critbit
dependent-map
| critbit | dependent-map | |
|---|---|---|
| 3 | 1 | |
| 330 | 61 | |
| - | - | |
| 0.0 | 0.0 | |
| over 2 years ago | over 1 year ago | |
| C | Haskell | |
| - | LicenseRef-OtherLicense |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
critbit
-
Ask HN: What are some 'cool' but obscure data structures you know about?
> Good use-case: routing. Say you have a list of 1 million IPs that are [deny listed].
Apparently, bloom filters make for lousy IP membership checks, read: https://blog.cloudflare.com/when-bloom-filters-dont-bloom/
CritBit Trie [0] and possibly Allotment Routing Table (ART) are better suited for IPs.
[0] https://github.com/agl/critbit
[1] https://web.archive.org/web/20210720162224/https://www.harig...
-
Rethink-app: DNS over HTTPS, firewall, and connection tracker for Android
developer here
I'd imagine the app should work over IPv6-only networks thanks to 464xlat. I may be wrong, because I've never tested it on a IPv6-only network.
The reason for IPv6 is two fold:
1. Firewall today simply stores classless IP address rules as strings in a sqlite table fronted by a lfu cache backed by a typical hash-map. With IPv6, I'd imagine, this won't scale. So, we need a more economical in-memory data-structure (like a crit-bit trie [0] or art tree).
2. Apparently LwIP has problems with HappyEyeballs (I personally never saw it, but got a couple of reports from users about it that it was an unrecoverable error once the connectivity was lost, and the firewall had to be restarted). We're in the process of replacing LwIP with gvisor/netstack now [2], just to get IPv6 support back on track.
[0] https://github.com/agl/critbit
[1] http://www.hariguchi.org/art/art.pdf
[2] https://github.com/celzero/firestack/issues/3
- Critbit Trees in C(WEB)
dependent-map
-
Monthly Hask Anything (October 2021)
Are there any clever ways to abstract the reallyUnsafePtrEquality traversal trick (as found e.g. here). Integrating it into something like uniplate was the only real idea I had, but I'm sure the overhead there would more than negate the saved allocations.
What are some alternatives?
flatbuffers - An implementation of the flatbuffers protocol in Haskell.
d10 - Digits 0-9
tables - Deprecated because of
dependent-state
rethink-app - DNS over HTTPS / DNS over Tor / DNSCrypt client, WireGuard proxifier, firewall, and connection tracker for Android.
critbit - A Haskell implementation of crit-bit trees.
semantic-source - Parsing, analyzing, and comparing source code across many languages
hierarchy
nextstep-plist - Parser and printer for NextStep style plist files
relevant-time - relevant times useful for looking forward or backward in time from a time-anchor
data-treify - Reify a recursive data structure into an explicit graph.
conffmt - language-conf - .conf (e.g. nginx configuration) parsers and pretty-printers for the Haskell programming language.