* lib/dfa.c (build_state): Simplify by using emptyset.
+2017-01-10 Paul Eggert <eggert@cs.ucla.edu>
+
+ dfa: minor simplification with emptyset
+ * lib/dfa.c (build_state): Simplify by using emptyset.
+
2017-01-09 Paul Eggert <eggert@cs.ucla.edu>
dfa: shrink constraints from 4 bits to 3
matches.w[j] &= d->syntax.letters.w[j] | d->syntax.newline.w[j];
/* If there are no characters left, there's no point in going on. */
- size_t j;
- for (j = 0; j < CHARCLASS_WORDS && !matches.w[j]; j++)
- continue;
- if (j == CHARCLASS_WORDS)
+ if (emptyset (&matches))
continue;
/* If we have reset the bit that made us declare "matched", reset