diogomg / van-emde-boas-tree
A fast priority queue/tree/sort struct that supports operations in O(loglog u) time
☆18Updated 7 years ago
Alternatives and similar repositories for van-emde-boas-tree:
Users that are interested in van-emde-boas-tree are comparing it to the libraries listed below
- arbitrary precision arithmetic library☆43Updated 6 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- A sparse and compressed bitmap library.☆11Updated 10 years ago
- NetBSD cdb (constant database) library☆14Updated 5 years ago
- Coroutine library in C.☆20Updated 4 years ago
- Linear vs binary search benchmark☆40Updated 5 years ago
- ☆26Updated 8 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- Automatically exported from code.google.com/p/judyarray☆17Updated 9 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- a tiny string library☆23Updated 9 years ago
- A simple immutable ordered key/value storage system.☆15Updated 9 years ago
- Bloom filter alternative (C++)☆17Updated 6 years ago
- A proof-of-concept for a fast regex matcher using lossy NFA matching on SIMD☆12Updated 5 years ago
- A compact library for C99 (and MSVC in C++ mode) providing refcounted arrays, maps, lists and a cool lexical scanner.☆41Updated 8 years ago
- 8-bit Xor Filter in C99☆61Updated 5 years ago
- Quick sort code using AVX2 instructions☆68Updated 7 years ago
- mirror of http://hg.dyncall.org/pub/dyncall/dyncall☆16Updated 10 years ago
- C11 + Pthreads Atomic Bounded Work Queue☆28Updated 9 years ago
- Basic C99 implementations of various fundamental data structures (queue, stack, graph, heap, etc.)☆15Updated 7 years ago
- Go-style coroutines and channels for C++☆33Updated 11 years ago
- A simple, intrusive, zero-allocation red-black tree implementation☆45Updated 3 years ago
- Multiple Producers / Multiple Consumers Message Passing Pool☆19Updated 10 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- Arbitrary-precision integer and rational arithmetic☆18Updated 3 years ago
- C++ reflection framework (for fun)☆14Updated 10 years ago
- Lock-free interthread message queue.☆17Updated 9 years ago
- Durable dead simple queue that allows zero copy semantics. Durable under failure!☆18Updated 9 years ago
- Intrusive data structures for C☆57Updated 7 years ago
- Implementation of Alexander A. Stepanov inverted Index Compression algorithms☆21Updated 9 years ago