2 * Copyright (C) 1994, Index Data I/S
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.9 1994-09-22 14:43:56 adam
8 * First functional version of lookup with error correction. A 'range'
9 * specified the maximum number of insertions+deletions+substitutions.
11 * Revision 1.8 1994/09/22 10:43:44 adam
12 * Two versions of depend. Type 1 is the tail-type compatible with
13 * all make programs. Type 2 is the GNU make with include facility.
14 * Type 2 is default. depend rule chooses current rule.
16 * Revision 1.7 1994/09/19 16:34:26 adam
17 * Depend rule change. Minor changes in dicttest.c
19 * Revision 1.6 1994/09/16 15:39:12 adam
20 * Initial code of lookup - not tested yet.
22 * Revision 1.5 1994/09/06 13:05:14 adam
23 * Further development of insertion. Some special cases are
24 * not properly handled yet! assert(0) are put here. The
25 * binary search in each page definitely reduce usr CPU.
27 * Revision 1.4 1994/09/01 17:49:37 adam
28 * Removed stupid line. Work on insertion in dictionary. Not finished yet.
30 * Revision 1.3 1994/09/01 17:44:06 adam
31 * depend include change.
33 * Revision 1.2 1994/08/18 12:40:54 adam
34 * Some development of dictionary. Not finished at all!
36 * Revision 1.1 1994/08/16 16:26:47 adam
51 static int lookup_handle (Dict_char *name)
53 printf ("%s\n", name);
57 int main (int argc, char **argv)
59 const char *name = NULL;
60 const char *inputfile = NULL;
61 const char *base = NULL;
67 int no_of_iterations = 0;
68 int no_of_new = 0, no_of_same = 0, no_of_change = 0;
69 int no_of_hits = 0, no_of_misses = 0;
76 fprintf (stderr, "usage:\n "
77 " %s [-r n] [-u] [-s n] [-v n] [-i f] [-w] [-c n]"
82 while ((ret = options ("r:us:v:i:wc:", argv, argc, &arg)) != -2)
92 log (LOG_FATAL, "too many files specified\n");
116 infosize = atoi(arg);
120 log_init (atoi(arg), prog, NULL);
124 log (LOG_FATAL, "unknown option");
130 log (LOG_FATAL, "no base and/or dictionary specified");
133 common_resource = res_open (base);
134 if (!common_resource)
136 log (LOG_FATAL, "cannot open resource `%s'", base);
139 dict = dict_open (name, cache, rw);
142 log (LOG_FATAL, "dict_open fail of `%s'", name);
151 memset (infobytes, 0, 120);
153 if (!(ipf = fopen(inputfile, "r")))
155 log (LOG_FATAL|LOG_ERRNO, "cannot open %s", inputfile);
159 while (fgets (ipf_buf, 1023, ipf))
161 char *ipf_ptr = ipf_buf;
162 sprintf (infobytes, "%d", line);
163 for (;*ipf_ptr && *ipf_ptr != '\n';ipf_ptr++)
165 if (isalpha(*ipf_ptr) || *ipf_ptr == '_')
168 while (ipf_ptr[i] && (isalnum(ipf_ptr[i]) ||
175 switch(dict_insert (dict, ipf_ptr,
176 infosize, infobytes))
184 log (LOG_LOG, "%s change\n", ipf_ptr);
188 log (LOG_LOG, "%s duplicate\n", ipf_ptr);
197 cp = dict_lookup (dict, ipf_ptr);
205 dict_lookup_ec (dict, ipf_ptr, range, lookup_handle);
217 log (LOG_LOG, "Insertions.... %d", no_of_iterations);
218 log (LOG_LOG, "No of new..... %d", no_of_new);
219 log (LOG_LOG, "No of change.. %d", no_of_change);
220 log (LOG_LOG, "No of same.... %d", no_of_same);
224 log (LOG_LOG, "Lookups....... %d", no_of_iterations);
225 log (LOG_LOG, "No of hits.... %d", no_of_hits);
226 log (LOG_LOG, "No of misses.. %d", no_of_misses);
229 res_close (common_resource);