OLD | NEW |
1 /* | 1 /* |
2 * Copyright © 2012 Google, Inc. | 2 * Copyright © 2012 Google, Inc. |
3 * | 3 * |
4 * This is part of HarfBuzz, a text shaping library. | 4 * This is part of HarfBuzz, a text shaping library. |
5 * | 5 * |
6 * Permission is hereby granted, without written agreement and without | 6 * Permission is hereby granted, without written agreement and without |
7 * license or royalty fees, to use, copy, modify, and distribute this | 7 * license or royalty fees, to use, copy, modify, and distribute this |
8 * software and its documentation for any purpose, provided that the | 8 * software and its documentation for any purpose, provided that the |
9 * above copyright notice and the following two paragraphs appear in | 9 * above copyright notice and the following two paragraphs appear in |
10 * all copies of this software. | 10 * all copies of this software. |
(...skipping 10 matching lines...) Expand all Loading... |
21 * ON AN "AS IS" BASIS, AND THE COPYRIGHT HOLDER HAS NO OBLIGATION TO | 21 * ON AN "AS IS" BASIS, AND THE COPYRIGHT HOLDER HAS NO OBLIGATION TO |
22 * PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS. | 22 * PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS. |
23 * | 23 * |
24 * Google Author(s): Behdad Esfahbod | 24 * Google Author(s): Behdad Esfahbod |
25 */ | 25 */ |
26 | 26 |
27 #ifndef HB_SET_PRIVATE_HH | 27 #ifndef HB_SET_PRIVATE_HH |
28 #define HB_SET_PRIVATE_HH | 28 #define HB_SET_PRIVATE_HH |
29 | 29 |
30 #include "hb-private.hh" | 30 #include "hb-private.hh" |
31 #include "hb-set.h" | |
32 #include "hb-object-private.hh" | 31 #include "hb-object-private.hh" |
33 | 32 |
34 | 33 |
35 /* | 34 /* |
36 * The set digests here implement various "filters" that support | 35 * The set digests here implement various "filters" that support |
37 * "approximate member query". Conceptually these are like Bloom | 36 * "approximate member query". Conceptually these are like Bloom |
38 * Filter and Quotient Filter, however, much smaller, faster, and | 37 * Filter and Quotient Filter, however, much smaller, faster, and |
39 * designed to fit the requirements of our uses for glyph coverage | 38 * designed to fit the requirements of our uses for glyph coverage |
40 * queries. As a result, our filters have much higher. | 39 * queries. As a result, our filters have much higher. |
41 */ | 40 */ |
(...skipping 290 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
332 | 331 |
333 elt_t elts[ELTS]; /* XXX 8kb */ | 332 elt_t elts[ELTS]; /* XXX 8kb */ |
334 | 333 |
335 ASSERT_STATIC (sizeof (elt_t) * 8 == BITS); | 334 ASSERT_STATIC (sizeof (elt_t) * 8 == BITS); |
336 ASSERT_STATIC (sizeof (elt_t) * 8 * ELTS > MAX_G); | 335 ASSERT_STATIC (sizeof (elt_t) * 8 * ELTS > MAX_G); |
337 }; | 336 }; |
338 | 337 |
339 | 338 |
340 | 339 |
341 #endif /* HB_SET_PRIVATE_HH */ | 340 #endif /* HB_SET_PRIVATE_HH */ |
OLD | NEW |