* "approximate member query". Conceptually these are like Bloom
* Filter and Quotient Filter, however, much smaller, faster, and
* designed to fit the requirements of our uses for glyph coverage
- * queries.
- *
- * Our filters are highly accurate if the lookup covers fairly local
- * set of glyphs, but fully flooded and ineffective if coverage is
- * all over the place.
- *
- * The frozen-set can be used instead of a digest, to trade more
- * memory for 100% accuracy, but in practice, that doesn't look like
- * an attractive trade-off.
+ * queries. As a result, our filters have much higher.
*/
template <typename mask_t, unsigned int shift>
return;
unsigned int min = set.get_min ();
const elt_t &min_elt = set.elt (min);
+ const elt_t &max_elt = set.elt (max);
start = min & ~MASK;
count = max - start + 1;