2 * Copyright (C) 1994, Index Data I/S
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.3 1995-02-06 10:12:55 adam
8 * Unused static function rm_SetElement was removed.
10 * Revision 1.2 1995/01/24 16:00:22 adam
11 * Added -ansi to CFLAGS.
12 * Some changes to the dfa module.
14 * Revision 1.1 1994/09/26 10:16:57 adam
15 * First version of dfa module in alex. This version uses yacc to parse
16 * regular expressions. This should be hand-made instead.
30 static Set mk_SetElement (SetType st, int n);
32 SetType mk_SetType (int chunk)
36 assert (chunk > 8 && chunk < 8000);
38 st = (SetType) imalloc (sizeof(*st));
41 st->alloclist = st->freelist = NULL;
47 int inf_SetType (SetType st, long *used, long *allocated)
53 for (s = st->alloclist; s; s = s->next)
54 *allocated += st->chunk;
55 return sizeof (SetElement);
58 SetType rm_SetType (SetType st)
61 for (s = st->alloclist; (s1 = s);)
70 Set mk_Set (SetType st)
76 static Set mk_SetElement (SetType st, int n)
82 assert (st->chunk > 8);
85 s = (Set) imalloc (sizeof(*s) * (1+st->chunk));
87 s->next = st->alloclist;
90 for (i=st->chunk; --i > 0; s++)
96 st->freelist = s->next;
102 static void rm_SetElement (SetType st, SetElement *p)
105 assert (st->used > 0);
106 p->next = st->freelist;
112 Set rm_Set (SetType st, Set s)
124 s->next = st->freelist;
127 assert (st->used >= 0);
132 Set add_Set (SetType st, Set s, int n)
137 while (p->next && p->next->value < n)
140 if (!(p->next && p->next->value == n))
142 new = mk_SetElement (st, n);
149 Set union_Set (SetType st, Set s1, Set s2)
155 for (p = &dummy; s1 && s2;)
156 if (s1->value < s2->value)
161 else if (s1->value > s2->value)
163 p = p->next = mk_SetElement (st, s2->value);
178 p = p->next = mk_SetElement (st, s2->value);
186 Set cp_Set (SetType st, Set s)
188 return merge_Set (st, s, NULL);
191 Set merge_Set (SetType st, Set s1, Set s2)
196 for (p = &dummy; s1 && s2; p = p->next)
197 if (s1->value < s2->value)
199 p->next = mk_SetElement (st, s1->value);
202 else if (s1->value > s2->value)
204 p->next = mk_SetElement (st, s2->value);
209 p->next = mk_SetElement (st, s1->value);
217 p = p->next = mk_SetElement (st, s1->value);
224 void pr_Set (SetType st, Set s)
229 printf (" %d", s->value);
235 unsigned hash_Set (SetType st, Set s)
246 int eq_Set (SetType st, Set s1, Set s2)
248 for (; s1 && s2; s1=s1->next, s2=s2->next)
249 if (s1->value != s2->value)