forked from AuroraMiddleware/gtk
bloomfilter: Drop the SECTION
This is private, no need.
This commit is contained in:
parent
260a4db854
commit
b019cabd0c
@ -26,11 +26,7 @@
|
||||
G_BEGIN_DECLS
|
||||
|
||||
/*
|
||||
* SECTION:gtkcountingbloomfilter
|
||||
* @Short_description: A counting bloom filter
|
||||
* @Title: GtkCountingBloomFilter
|
||||
* @See_also: https://en.wikipedia.org/wiki/Bloom_filter,
|
||||
* https://en.wikipedia.org/wiki/Counting_Bloom_filter
|
||||
* GtkCountingBloomFilter:
|
||||
*
|
||||
* This implements a counting bloom filter. A bloom filter is a space-efficient
|
||||
* probabilistic data structure that is used to test whether an element may be
|
||||
@ -45,6 +41,9 @@ G_BEGIN_DECLS
|
||||
* are 16bit hash values.
|
||||
* It is possible to use 32bit hash values or a different number of bits, should this
|
||||
* be considered useful.
|
||||
*
|
||||
* See: [Bloom filter](https://en.wikipedia.org/wiki/Bloom_filter),
|
||||
* [Counting Bloom filter](https://en.wikipedia.org/wiki/Counting_Bloom_filter)
|
||||
*/
|
||||
|
||||
/* The number of bits from the hash we care about */
|
||||
|
Loading…
Reference in New Issue
Block a user