Lines Matching refs:sets
197 g->sets = NULL;
693 if (nch(p, cs) == 1) { /* optimize singleton sets */
1039 ptr = (cset *)realloc((char *)p->g->sets, nc * sizeof(cset));
1042 p->g->sets = ptr;
1050 p->g->sets[i].ptr = p->g->setbits + css*(i/CHAR_BIT);
1055 if (p->g->sets == NULL || p->g->setbits == NULL)
1058 cs = &p->g->sets[no];
1067 free(p->g->sets);
1068 p->g->sets = NULL;
1084 cset *top = &p->g->sets[p->g->ncsets];
1096 * The main task here is merging identical sets. This is usually a waste
1099 * is done using addition rather than xor -- all ASCII [aA] sets xor to
1107 cset *top = &p->g->sets[p->g->ncsets];
1112 for (cs2 = &p->g->sets[0]; cs2 < top; cs2++)
1127 return((int)(cs - p->g->sets));
1212 - isinsets - is this character in any sets?
1229 - samesets - are these two characters in exactly the same sets?
