det / segmented_tree
Sequence data structure with efficient random access insert and erase
☆13Updated last year
Alternatives and similar repositories for segmented_tree:
Users that are interested in segmented_tree are comparing it to the libraries listed below
- Counting the collisions with perl hash tables per function☆12Updated 5 years ago
- Bloom filter alternative (C++)☆18Updated 6 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- NetBSD cdb (constant database) library☆14Updated 5 years ago
- A small DFA for under 16 states☆51Updated 6 years ago
- LLVM-jitted bitmaps☆27Updated 5 years ago
- Quick sort code using AVX2 instructions☆68Updated 7 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆36Updated 6 years ago
- Some variations on Lemire's Fast Random Integer Generation in an Interval☆15Updated 5 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- Linear vs binary search benchmark☆40Updated 5 years ago
- A small test for multithreaded C++ stack unwinding on unixes☆16Updated 5 years ago
- Improved NetBSD's Perfect Hash Generation Tool v3☆19Updated last year
- Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…☆53Updated 12 years ago
- Pruning of blanks from an ASCII stream - musings in AMD64 and ARM64☆10Updated 4 years ago
- Automatically exported from code.google.com/p/libhhash☆32Updated 9 years ago
- Quick experiment to see how expensive safety is in C, for research☆12Updated 6 years ago
- C++ reimplementation of https://github.com/emilk/drop-merge-sort☆21Updated 3 years ago
- A vectorized single header hash function.☆19Updated 5 months ago
- A library for Rapid {C|Concurrency|Correct} Development☆34Updated 9 years ago
- A word-aligned integer compression algorithm.☆12Updated 9 months ago
- RLU resizable hash-table☆17Updated 9 years ago
- ☆13Updated 6 years ago
- A library to support streaming data applications☆24Updated 4 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- MlpIndex - Extremely fast ordered index via memory level parallelism☆12Updated 6 years ago
- Proof of concept LSM-tree built on MDB☆17Updated 9 years ago
- A proof-of-concept for a fast regex matcher using lossy NFA matching on SIMD☆12Updated 5 years ago
- A colorful C++ type name demangler (like c++filt, but fancier)☆21Updated 9 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago