preshing / CompareIntegerMaps
Generates benchmark data for two different data structures, then renders some graphs.
☆112Updated 5 years ago
Alternatives and similar repositories for CompareIntegerMaps:
Users that are interested in CompareIntegerMaps are comparing it to the libraries listed below
- A Fast, Multicore-Scalable, Low-Fragmentation Memory Allocator☆161Updated 2 years ago
- STM (Software Transactional Memory) implementation in C, based on memory-mapping.☆59Updated 15 years ago
- Joedb, the Journal-Only Embedded Database☆92Updated 2 weeks ago
- A benchmark of some prominent C/C++ hash table implementations☆103Updated 5 years ago
- High-performance multicore-scalable data structures and benchmarks☆139Updated 5 years ago
- nkvdb - is a numeric time-series database.☆35Updated 7 years ago
- Support for Currying and Function Composition in C++☆61Updated 9 years ago
- A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit f…☆274Updated 3 years ago
- Linear vs binary search benchmark☆40Updated 5 years ago
- BSD Licensed Bignum Library☆232Updated 10 months ago
- Coroutines/Fibers implementation for x86☆65Updated 8 years ago
- A C++ pointer bump memory arena implementation☆89Updated 10 years ago
- Hash Array Mapped Trie (C++ Templates)☆124Updated last year
- Experiments with array layouts for comparison-based searching☆82Updated last year
- Lock-free multithreaded memory allocation☆105Updated 8 years ago
- Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.☆131Updated 5 years ago
- A dependency-based coroutine scheduler☆46Updated 8 years ago
- C library implementing the ridiculously fast CLHash hashing function☆270Updated 9 months ago
- Continuation-ready container algorithms from STL algorithms☆60Updated 7 years ago
- A persistent hash array-mapped trie for C++☆90Updated last year
- Benchmark showing the we can randomly hash strings very quickly with good universality☆134Updated last week
- bit & sketches data structures☆60Updated 6 years ago
- A C++ library for concurrent programming☆71Updated 3 years ago
- No sane compiler would optimize atomics: the presentation☆106Updated 8 years ago
- Fast, efficient string interning☆95Updated 7 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆116Updated 7 years ago
- Demonstration of LLVM's opt-viewer tool☆70Updated 7 years ago
- Implementation of hash_append proposal☆69Updated 8 years ago
- A high performance C++ playground library☆48Updated 8 years ago
- userspace threads and coroutines for C☆18Updated 9 years ago