blynn / blt
Crit-bit tree (trie) library
☆32Updated 10 years ago
Alternatives and similar repositories for blt:
Users that are interested in blt are comparing it to the libraries listed below
- Fast time calls from user space.☆11Updated 9 years ago
- NetBSD cdb (constant database) library☆14Updated 5 years ago
- Compact tries for fixed-width keys☆25Updated 6 years ago
- A small DFA for under 16 states☆51Updated 6 years ago
- A library to support streaming data applications☆24Updated 4 years ago
- A distributed key-value cache with builtin materialized views.☆26Updated 10 years ago
- Simple out-of-process invoker☆18Updated 9 months ago
- Implementation of Alexander A. Stepanov inverted Index Compression algorithms☆21Updated 9 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆36Updated 6 years ago
- Counting the collisions with perl hash tables per function☆12Updated 5 years ago
- A binary serialisation format inspired by YAML, MessagePack and nvlists.☆32Updated 4 years ago
- Automatically exported from code.google.com/p/libhhash☆32Updated 9 years ago
- RLU resizable hash-table☆17Updated 9 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- quick c☆35Updated 3 years ago
- Static Radix Tree (Patricia trie) implementation in C☆49Updated 7 years ago
- A library for high-performance lightweight threads☆20Updated 13 years ago
- Experiments with JIT compilation☆65Updated 8 years ago
- A GIT clone of uthash.sourceforge.net, a hash table, implemented in C, supporting constant-time add/find/remove of C structures. Any stru…☆36Updated 11 years ago
- Batch Monitor - Gain performance by combining work from multiple threads into a single batch☆30Updated 9 years ago
- Fast 64 bit evolved hash.☆32Updated 7 years ago
- A very fast URI parser in C.☆26Updated 6 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆49Updated 11 months ago
- A library for Rapid {C|Concurrency|Correct} Development☆34Updated 9 years ago
- Control and diagnostic applications for rump kernels☆36Updated 8 years ago
- Dictionary implemented through a skiplist☆15Updated 10 years ago
- Very late bitcode and data binder☆19Updated 3 years ago
- A splaytree ADT written in C with a BSD license☆17Updated 4 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- The k-LSM: A relaxed, lock-free, linearizable priority queue☆23Updated 7 years ago