From 0edd0fd255790471118fae1fd7a1309a2b77cf62 Mon Sep 17 00:00:00 2001
From: Behdad Esfahbod <behdad@behdad.org>
Date: Wed, 17 Apr 2013 17:26:56 -0400
Subject: [PATCH] Add comment

---
 src/hb-set-private.hh | 8 ++++++++
 1 file changed, 8 insertions(+)

diff --git a/src/hb-set-private.hh b/src/hb-set-private.hh
index fee09cf..e50d7bc 100644
--- a/src/hb-set-private.hh
+++ b/src/hb-set-private.hh
@@ -32,6 +32,14 @@
 #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 ();
-- 
2.7.4