源代码相似度比较.doc

#include#include#include#include#define N 32/关键字个数#define size 256#define maxlen 9#define hashlen 41/哈希表长度#define Smax 0.9/相似度s的阈值#define Dmin 2struct hashtable char *hash1;/指向关键字的指针 int count;hashtthashlen;using namespace std;void Hashfunc(char str); /将关键字根据哈希函数放入哈希表中的指定位置int Hashfind(char *words);/在哈希表中找是否该words为关键字，并统计频度int isletter(char ch); /判断是否为字母float Mol(int *x); /取模函数int Dot(int *x1, int *x2); /点积函数float D(int *x1, int *x2); /求距离D的函数float S(int *x1,int *x2); /求相似度S的函数int readc(char * filename); /读取源程序文件中的单词int getkey(char *str,int len); /获取该单词的keyvoid resethash(int n); /重置哈希表void copycount(int x,int n); /将频道拷贝到数组里if(ch=a&ch=A&ch=Z)return 1;return 0; int readc(char *filename) /读取源程序文件中的单词 FILE *fp1=NULL; char wordsmaxlen,ch; int i; if(fp1=fopen (filename,r)=NULL) coutcan not creat file!n; exit(0); while (!feof(fp1) /结束返回1 i=0; ch=fgetc(fp1); /一个字符一个字符的读 while (isletter(ch)=0&feof(fp1)=0) ch=fgetc(fp1); while (isletter(ch)=1&feof(fp1)=0) if (i=maxlen) while (isletter(ch)=1&feof(fp1)=0) ch=fgetc(fp1); i=0; break; /超过最大关键字长度将会跳过当前识别区域，读取下一个单词 else wordsi+=ch; ch=fgetc(fp1); wordsi=0; Hashfind (words); /将得到的该单词调入Hashfind函数，来判断是否为关键字，并统计频度 fclose(fp1); return 0; float Mol(int *x) /取模函数 int i = 0, sum = 0; for (i = 0; i N; i+) sum += (xi * xi); return (float)pow(float)sum,0.5); int Dot(int *x1, int *x2) /点积函数 int i = 0, sum = 0; for (i = 0; i N; i+) sum += x1i * x2i; return sum; float S(int *x1,int *x2) return Dot(x1, x2)/(Mol(x1)*Mol(x2); /求相似度S float D(int *x1, int *x2) /求几何距离 int xN, i = 0; for (i = 0; i N; i+) /向量相减 xi= x1i - x2i; return Mol(x); /再求模 void check(int *x1, int *x2) float xs = 0, xd = 0; xs = S(x1, x2); cout相似度xs=xs Smax) /先判断S，若S大于阈值再计算几何距离 xd = D(x1, x2); cout几何距离xd=xdendl; if (xd Dmin) /如果几何距离小于阈值则判断为相似 cout