[gtk/ebassi/gidocgen: 425/481] bloomfilter: Drop the SECTION
- From: Emmanuele Bassi <ebassi src gnome org>
- To: commits-list gnome org
- Cc:
- Subject: [gtk/ebassi/gidocgen: 425/481] bloomfilter: Drop the SECTION
- Date: Sun, 7 Mar 2021 23:55:16 +0000 (UTC)
commit c10574195eaf40a188ea44ed7a4075acb62ea1f3
Author: Matthias Clasen <mclasen redhat com>
Date: Mon Mar 1 11:14:03 2021 -0500
bloomfilter: Drop the SECTION
This is private, no need.
gtk/gtkcountingbloomfilterprivate.h | 9 ++++-----
1 file changed, 4 insertions(+), 5 deletions(-)
---
diff --git a/gtk/gtkcountingbloomfilterprivate.h b/gtk/gtkcountingbloomfilterprivate.h
index 78a3f54880..1918891030 100644
--- a/gtk/gtkcountingbloomfilterprivate.h
+++ b/gtk/gtkcountingbloomfilterprivate.h
@@ -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 */
[
Date Prev][
Date Next] [
Thread Prev][
Thread Next]
[
Thread Index]
[
Date Index]
[
Author Index]