代码搜索：磁链检测
找到约 8,471 项符合「磁链检测」的源代码
代码结果 8,471
www.eeworm.com/read/133056/14055612
txt javascript检测表单.txt
function checkdata() {
if (document.wizard.password.value=='') {
window.alert ("请输入您的密码 ！")
mobj = eval("document.wizard.password");
mobj.focus()
www.eeworm.com/read/200656/15428091
java sobel边缘检测.java
import java.awt.*;
import java.awt.image.*;
import java.applet.*;
import java.net.*;
import java.io.*;
import java.lang.Math;
import java.util.*;
import java.awt.event.*;
import javax.swing.*;
www.eeworm.com/read/112611/15481884
pdf 人脸检测综述.pdf
www.eeworm.com/read/383614/8932614
txt 链栈入栈算法.txt
JD *lzjz(JD *top,int x)
{ JD *p;
p=(JD *)malloc(sizeof(JD));
p->data=x;
p->link=top;
top=p;
return(top);
}
www.eeworm.com/read/383614/8932615
txt 链栈出栈算法.txt
JD *lztz(JD *top,int *p)
{ JD *q;
if(top!=NULL)
{ q=top;
*p=top->data;
top=top->link;
free(q);
}
return(top);
}
www.eeworm.com/read/383609/8932761
txt 链队列出队算法.txt
int ldsc(JD *front,JD *rear)
{ JD *s;
int x;
if(front==rear)
return(-1); //空队列
s=front->link;
front->link=s->link;
if(s->link==NULL) //判断队列中是否只有一个结点，若不判断会造成rear的丢失
www.eeworm.com/read/383609/8932764
txt 链队列入队算法.txt
JD *ldcr(JD *rear,int x)
{ JD *p;
p=(JD *)malloc(sizeof(JD));
p->data=x;
p->link=NULL;
rear->link=p;
return(p); //或rear=p;return(rear)
}
www.eeworm.com/read/371212/9561448
ppt 《食物链》解题报告.ppt
www.eeworm.com/read/364596/9903329