- 論壇徽章:
- 0
|
不知道怎樣才能直接調(diào)用bm_find函數(shù)，大家給點提示？謝了先
說明看這里：http://blog.chinaunix.net/u1/53217/showart_1934058.html
代碼：
/*
* the boyer-moore algorithm
* for text search of rules cotent
* by zuii||williamzuii@163.com
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define BM_TEST
#define LEN 256
/*
* BMMatch()
* match once for each call,if match succeed,return 0
* or else,return the index for the next match
*
*/
int BMMatch(const char *src,const char *pattern,int idx,int po[])
{
const int slen=strlen(src);
int i=strlen(pattern)-1;
int j=idx+i;
int nidx;
if(j > slen)
return -1;
for(;i>=0;i--,j--){
if(src[j] != pattern[i])
break;
}
if(i < 0)
return 0; /* match succeed */
else if(po[src[j]] > 0) /* the charector is contained in pattern */
nidx=idx+(i-po[src[j]]);
else /* the charector is not contained in pattern */
nidx=idx+i+1;
return nidx;
}
/*
* BMSearch()
* --- the interface of the text search algorithm---Boyer-moore
* Arguments:
* src:the long text for matching with pattern
* pattern: the pattern text use to match with src
* n: the beginning char for matching in src
* Return:
* 0: matching succeed
* -1:matching failed
*/
int BMSearch(const char *src,const char *pattern,int n)
{
int po[LEN]={0};
int i,idx=-2,nidx=n;
int plen=strlen(pattern);
if((n+strlen(pattern)) > strlen(src)){
printf("Ivalid search!\n");
return -1;
}
/* assistant array */
for(i=0;i < plen;i++)
po[pattern[i]]=i;
/* the first time to match */
idx=BMMatch(src,pattern,n,po);
/* start looping */
while(idx != -1 && idx != 0){
nidx=idx;
idx=BMMatch(src,pattern,nidx,po);
}
/* return 0 or -1 */
return idx;
}
#ifdef BM_TEST
int main(int argc,char **argv)
{
if(BMSearch("it's a test!Oh yeah!","test",4) == 0){
printf("Succeed!\n");
}else{
printf("No content!\n");
}
//getch();
return 0;
}
#endif
|
[ 本帖最后由 zuii 于 2009-5-20 20:08 編輯 ] |
|
免費注冊
發(fā)表于 2009-05-16 15:45
