* Sebastian Hammer, Adam Dickmeiss
*
* $Log: lookupec.c,v $
- * Revision 1.7 1999-02-02 14:50:26 adam
+ * Revision 1.9 1999-05-26 07:49:13 adam
+ * C++ compilation.
+ *
+ * Revision 1.8 1999/05/15 14:36:37 adam
+ * Updated dictionary. Implemented "compression" of dictionary.
+ *
+ * Revision 1.7 1999/02/02 14:50:26 adam
* Updated WIN32 code specific sections. Changed header.
*
* Revision 1.6 1996/02/02 13:43:51 adam
dict_bf_readp (dict->dbf, ptr, &p);
lo = 0;
hi = DICT_nodir(p)-1;
- indxp = (short*) ((char*) p+DICT_pagesize(dict)-sizeof(short));
+ indxp = (short*) ((char*) p+DICT_bsize(p)-sizeof(short));
while (lo <= hi)
{
if (indxp[-lo] > 0)
userfunc, range, prefix);
dict_bf_readp (dict->dbf, ptr, &p);
indxp = (short*) ((char*) p +
- DICT_pagesize(dict)-sizeof(short));
+ DICT_bsize(p)-sizeof(short));
}
}
}
MatchWord *s;
MatchInfo *mi;
- mi = xmalloc (sizeof(*mi));
+ mi = (MatchInfo *) xmalloc (sizeof(*mi));
mi->m = dict_strlen (pattern);
- mi->s = s = xmalloc (sizeof(*s)*256); /* 256 !!! */
+ mi->s = s = (MatchWord *) xmalloc (sizeof(*s)*256); /* 256 !!! */
for (i=0; i<256; i++)
s[i] = 0;
for (i=0; pattern[i]; i++)
int i;
Dict_char prefix[2048];
- if (dict->head.last == 1)
+ if (!dict->head.root)
return 0;
mi = prepare_match ((Dict_char*) pattern);
- ri = xmalloc ((dict_strlen((Dict_char*) pattern)+range+2)
- * (range+1)*sizeof(*ri));
+ ri = (MatchWord *) xmalloc ((dict_strlen((Dict_char*) pattern)+range+2)
+ * (range+1)*sizeof(*ri));
for (i=0; i<=range; i++)
ri[i] = (2<<i)-1;
- i = dict_look_ec (dict, 1, mi, ri, 0, userfunc, range, prefix);
+ i = dict_look_ec (dict, dict->head.root, mi, ri, 0, userfunc,
+ range, prefix);
xfree (ri);
return i;
}