Add comment
authorBehdad Esfahbod <behdad@behdad.org>
Wed, 17 Apr 2013 21:26:56 +0000 (17:26 -0400)
committerBehdad Esfahbod <behdad@behdad.org>
Wed, 17 Apr 2013 21:26:56 +0000 (17:26 -0400)
src/hb-set-private.hh

index fee09cf..e50d7bc 100644 (file)
 #include "hb-object-private.hh"
 
 
+/*
+ * The set digests here implement various "filters" that support
+ * "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.  As a result, our filters have much higher.
+ */
+
 struct hb_set_digest_common_bits_t
 {
   ASSERT_POD ();