Subversion Repositories wimsdev

Rev

Rev 6895 | Rev 8123 | Go to most recent revision | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 6895 Rev 8100
Line 33... Line 33...
33 
int sufcomp(int t, const unsigned char *s2)
 33 
int sufcomp(int t, const unsigned char *s2)
34 
{
 34 
{
35 
    int k;
 35 
    int k;
36 
 
 36 
 
37 
    for(k=0;k<suf[t].olen && k<sufwordlen
 37 
    for(k=0;k<suf[t].olen && k<sufwordlen
38 
    && suf[t].original[k]==s2[sufwordlen-k-1];k++);
 38 
      && suf[t].original[k]==s2[sufwordlen-k-1];k++);
39 
    if(k>=suf[t].olen) {
 39 
    if(k>=suf[t].olen) {
40 
    if(sufwordlen>k) return -1; else return 0;
 40 
      if(sufwordlen>k) return -1; else return 0;
41 
    }
 41 
    }
42 
    else return suf[t].original[k]-s2[sufwordlen-k-1];
 42 
    else return suf[t].original[k]-s2[sufwordlen-k-1];
43 
}
 43 
}
44 
 
 44 
 
45 
/* searches a list. Returns index if found, -1 if nomatch.
 45 
/* searches a list. Returns index if found, -1 if nomatch.
46 
 * This routine is faster than naive one by one comparisons,
 46 
 * This routine is faster than naive one by one comparisons,
47 
 * and is especially suited for large lists. */
 47 
 * and is especially suited for large lists.
- 
 
 48 
 */
48 
int suffix_list(void *list, int items, size_t item_size, const unsigned char *str)
 49 
int suffix_list(void *list, int items, size_t item_size, const unsigned char *str)
49 
{
 50 
{
50 
    int i1,i2,j,k,t,v;
 51 
    int i1,i2,j,k,t,v;
51 
    unsigned char c,d;
 52 
    unsigned char c,d;
52 
 
 53 
 
Line 54... Line 55...
54 
    k=sufcomp(0,str);
 55 
    k=sufcomp(0,str);
55 
    if(k==0) return 0; if(k>0) return -1;
 56 
    if(k==0) return 0; if(k>0) return -1;
56 
    j=items-1; k=sufcomp(j,str);
 57 
    j=items-1; k=sufcomp(j,str);
57 
    if(k==0) return j;
 58 
    if(k==0) return j;
58 
    if(k>0) for(i1=0,i2=j;i2>i1+1;) {
 59 
    if(k>0) for(i1=0,i2=j;i2>i1+1;) {
59 
    j=i1+(i2-i1)/2; k=sufcomp(j,str);
 60 
      j=i1+(i2-i1)/2; k=sufcomp(j,str);
60 
    if(k==0) return j;
 61 
      if(k==0) return j;
61 
    if(k>0) {i2=j; continue;}
 62 
      if(k>0) {i2=j; continue;}
62 
    if(k<0) {i1=j; continue;}
 63 
      if(k<0) {i1=j; continue;}
63 
    }
 64 
    }
64 
    if(k>0 && j>0) j--;
 65 
    if(k>0 && j>0) j--;
65 
    backcheck:
 66 
    backcheck:
66 
    v=j;for(t=0;t<suf[j].olen && t<sufwordlen
 67 
    v=j;for(t=0;t<suf[j].olen && t<sufwordlen
67 
    && suf[j].original[t]==str[sufwordlen-t-1];t++);
 68 
      && suf[j].original[t]==str[sufwordlen-t-1];t++);
68 
    if(t<sufminlen) return -1; if(t>=suf[j].olen) return j;
 69 
    if(t<sufminlen) return -1; if(t>=suf[j].olen) return j;
69 
    for(j--,c=str[sufwordlen-1],d=str[sufwordlen-t];
 70 
    for(j--,c=str[sufwordlen-1],d=str[sufwordlen-t];
70 
    j>=0 && suf[j].original[0]==c && suf[j].olen>t
 71 
      j>=0 && suf[j].original[0]==c && suf[j].olen>t
71 
    && suf[j].original[t-1]==d;j--);
 72 
      && suf[j].original[t-1]==d;j--);
72 
    if(j>=0 && suf[j].original[0]==c &&
 73 
    if(j>=0 && suf[j].original[0]==c &&
73 
       strncmp((char*)suf[j].original,(char*)suf[v].original,suf[j].olen)==0)
 74 
       strncmp((char*)suf[j].original,(char*)suf[v].original,suf[j].olen)==0)
74 
      return j;
 75 
      return j;
75 
    else goto backcheck;
 76 
    else goto backcheck;
76 
}
 77 
}
77 
 
 78 
 
78 
/* Prepare dictionary.  */
 79 
/* Prepare dictionary.  */
79 
void suffix_dic(char *sdicname)
 80 
void suffix_dic(char *sdicname)
80 
{
 81 
{
81 
    int i,l;
 82 
    int i,l;
82 
    FILE *suff;
 83 
    FILE *suff;
83 
    char *p1, *p2, *pp;
 84 
    char *p1, *p2, *pp;
84 
    long int flen;
 85 
    long int flen;
85 
 
 86 
 
86 
    suffixcnt=0; sufminlen=100000;
 87 
    suffixcnt=0; sufminlen=100000;
87 
    suff=fopen(sdicname,"r"); if(suff==NULL) return;
 88 
    suff=fopen(sdicname,"r"); if(suff==NULL) return;
88 
    fseek(suff,0,SEEK_END);flen=ftell(suff); fseek(suff,0,SEEK_SET);
 89 
    fseek(suff,0,SEEK_END);flen=ftell(suff); fseek(suff,0,SEEK_SET);
89 
    if(flen>sufbuflim) return;
 90 
    if(flen>sufbuflim) return;
90 
    sufbuf=xmalloc(flen+16);flen=fread(sufbuf,1,flen,suff);
 91 
    sufbuf=xmalloc(flen+16);flen=fread(sufbuf,1,flen,suff);
Line 93... Line 94...
93 
    else return;
 94 
    else return;
94 
    for(i=0,p1=sufbuf;p1!=NULL && *p1!=0 && i<suflim;p1=p2) {
 95 
    for(i=0,p1=sufbuf;p1!=NULL && *p1!=0 && i<suflim;p1=p2) {
95 
    p2=strchr(p1+1,'\n'); if(p2>p1) *p2++=0;
 96 
    p2=strchr(p1+1,'\n'); if(p2>p1) *p2++=0;
96 
    pp=strchr(p1,':'); if(pp==NULL) continue;
 97 
    pp=strchr(p1,':'); if(pp==NULL) continue;
97 
    *pp++=0;
 98 
    *pp++=0;
98 
    strip_trailing_spaces(p1); strip_trailing_spaces(pp);
 99 
    strip_trailing_spaces2(p1); strip_trailing_spaces2(pp);
99 
    singlespace(p1);
 100 
    singlespace2(p1);
100 
    p1=find_word_start(p1); pp=find_word_start(pp);
 101 
    p1=find_word_start(p1); pp=find_word_start(pp);
101 
    if(*p1==0) continue;
 102 
    if(*p1==0) continue;
102 
    suf[i].original=(unsigned char*)p1; suf[i].olen=l=strlen(p1);
 103 
    suf[i].original=(unsigned char*)p1; suf[i].olen=l=strlen(p1);
103 
    if(l<sufminlen) sufminlen=l;
 104 
    if(l<sufminlen) sufminlen=l;
104 
    suf[i].replace=(unsigned char*)pp; i++;
 105 
    suf[i].replace=(unsigned char*)pp; i++;
Line 115... Line 116...
115 
{
 116 
{
116 
    char *p1, *p2;
 117 
    char *p1, *p2;
117 
    int t;
 118 
    int t;
118 
 
 119 
 
119 
    for(p1=find_word_start(p);
 120 
    for(p1=find_word_start(p);
120 
    p1!=NULL && p1-p<MAX_LINELEN && *p1!=0;
 121 
      p1!=NULL && p1-p<MAX_LINELEN && *p1!=0;
121 
    p1=p2) {
 122 
      p1=p2) {
122 
    if(!isalpha(*p1)) {p2=p1+1; continue;}
 123 
       if(!isalpha(*p1)) {p2=p1+1; continue;}
123 
    for(p2=p1;isalpha(*p2);p2++);
 124 
       for(p2=p1;isalpha(*p2);p2++);
124 
    if(*p2!=0 && strchr(" ,.?!'\"\n`:;()[]{}<>",*p2)==NULL) continue;
 125 
       if(*p2!=0 && strchr(" ,.?!'\"\n`:;()[]{}<>",*p2)==NULL) continue;
125 
    sufwordlen=p2-p1;
 126 
       sufwordlen=p2-p1;
126 
    t=suffix_list(suf,suffixcnt,sizeof(suf[0]),(unsigned char*)p1);
 127 
       t=suffix_list(suf,suffixcnt,sizeof(suf[0]),(unsigned char*)p1);
127 
    if(t<0) continue;
 128 
       if(t<0) continue;
128 
    string_modify(p,p2-suf[t].olen,p2,(char*)suf[t].replace);
 129 
       string_modify3(p,p2-suf[t].olen,p2,(char*)suf[t].replace);
129 
    p2=p2-suf[t].olen+strlen((char*)suf[t].replace);
 130 
       p2=p2-suf[t].olen+strlen((char*)suf[t].replace);
130 
    }
 131 
     }
131 
    p[MAX_LINELEN]=0;
 132 
     p[MAX_LINELEN]=0;
132 
}
 133 
}
133 
 
 134 
 
134 
void suffix(char *p, char *sdicname)
 135 
void suffix(char *p, char *sdicname)
135 
{
 136 
{
136 
    suffix_dic(sdicname); if(suffixcnt>0) suffix_translate(p);
 137 
    suffix_dic(sdicname); if(suffixcnt>0) suffix_translate(p);