HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
hashlookup
fleur
C2022–2022
hashlookup / fleur

fleur

Fleur implements a Bloom Filter library in C that is fully compatible with DCSO's Go and python implementations.

3Distinct people
3Mentions
0Explicit recommenders
116GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

Fleur implements a Bloom Filter library in C that is fully compatible with DCSO's Go and python implementations.

GitHub

Where it is used

No documented product use has been verified yet.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 1:49:46 PM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by 3-hour interval3 dated mentions

Observed mentions: 2022-07-26 12:13:28 UTC to 2022-07-28 00:59:35 UTC.

0122022-07-26 12:00:00 UTC to 2022-07-26 15:00:00 UTC (exclusive): 1 mentions; 1 submissions, 0 commentsJul 26, 12:002022-07-26 15:00:00 UTC to 2022-07-26 18:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2022-07-26 18:00:00 UTC to 2022-07-26 21:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2022-07-26 21:00:00 UTC to 2022-07-27 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2022-07-27 00:00:00 UTC to 2022-07-27 03:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2022-07-27 03:00:00 UTC to 2022-07-27 06:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2022-07-27 06:00:00 UTC to 2022-07-27 09:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 commentsJul 27, 06:002022-07-27 09:00:00 UTC to 2022-07-27 12:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2022-07-27 12:00:00 UTC to 2022-07-27 15:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2022-07-27 15:00:00 UTC to 2022-07-27 18:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2022-07-27 18:00:00 UTC to 2022-07-27 21:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2022-07-27 21:00:00 UTC to 2022-07-28 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2022-07-28 00:00:00 UTC to 2022-07-28 03:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 commentsJul 28, 00:00

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
Jul 26, 12:002022-07-26 12:00:00 UTC2022-07-26 15:00:00 UTC110
Jul 26, 15:002022-07-26 15:00:00 UTC2022-07-26 18:00:00 UTC000
Jul 26, 18:002022-07-26 18:00:00 UTC2022-07-26 21:00:00 UTC000
Jul 26, 21:002022-07-26 21:00:00 UTC2022-07-27 00:00:00 UTC000
Jul 27, 00:002022-07-27 00:00:00 UTC2022-07-27 03:00:00 UTC000
Jul 27, 03:002022-07-27 03:00:00 UTC2022-07-27 06:00:00 UTC000
Jul 27, 06:002022-07-27 06:00:00 UTC2022-07-27 09:00:00 UTC000
Jul 27, 09:002022-07-27 09:00:00 UTC2022-07-27 12:00:00 UTC000
Jul 27, 12:002022-07-27 12:00:00 UTC2022-07-27 15:00:00 UTC000
Jul 27, 15:002022-07-27 15:00:00 UTC2022-07-27 18:00:00 UTC000
Jul 27, 18:002022-07-27 18:00:00 UTC2022-07-27 21:00:00 UTC000
Jul 27, 21:002022-07-27 21:00:00 UTC2022-07-28 00:00:00 UTC000
Jul 28, 00:002022-07-28 00:00:00 UTC2022-07-28 03:00:00 UTC202

What Hacker News says

3 sources
Sorry if this is a bit negative but from a cursory look I wouldn't use this. An efficient Bloom Filter should only allocate on heap exactly once: when allocating the initial bitmap. This implementation seems to be not very efficient as it allocates even during a simple query. The usage of `static` variables makes the BloomFilter code unnecessarily dangerous to use when multiple threads are used even if every thread just wants to allocate and use totally separate bloom filters. Actually it could even cause issues with two bloom filters created after each other since even `Initialize` just returns a pointer to a single static `BloomFilter` :o I can't come up with a reason why you'd consider making anything in there `static`. There is also strange code like this loop https://github.com/hashlookup/fleur/blob/4ee2644a850381d928a... that jumped
Read the rest
into my eye. Oh and btw I believe bloom_path can cause memory safety issues because it is not terminated with a null after strncopy. I would additionally suggest to use some code formatting tool as it's a bit all over the place. But the variable/function names mix various styles as well.
In Fleur – A bloom filter implementation in C

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.