IvanPinezhaninov / IntervalTreeLinks
A red-black self-balancing interval tree
☆32Updated 5 years ago
Alternatives and similar repositories for IntervalTree
Users that are interested in IntervalTree are comparing it to the libraries listed below
Sorting:
- A C++ header only interval tree implementation.☆74Updated 4 months ago
- a minimal C++ interval tree implementation☆237Updated 4 years ago
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆249Updated last month
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆34Updated 8 months ago
- Efficient Prefix-Sum data structures in C++.☆25Updated 2 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- BitMagic Library☆437Updated 4 months ago
- AVX512F and AVX2 versions of quick sort☆104Updated 8 years ago
- TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers☆441Updated 11 months ago
- Learned Monotone Minimal Perfect Hashing☆31Updated 9 months ago
- An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!☆130Updated 2 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- 🚀 Fast C/C++ bit population count library☆358Updated last year
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Updated 3 years ago
- Modern C++ B-tree containers☆279Updated 2 years ago
- A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines☆399Updated last month
- Bloom-filter based minimal perfect hash function library☆270Updated 5 months ago
- Comprehensive benchmarks of C++ maps☆316Updated 2 years ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆25Updated 2 years ago
- Fast in-place radix sort with STL-like API☆48Updated 9 years ago
- C++ Implementation of Zip Trees☆14Updated 3 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆117Updated last year
- Fast Approximate Membership Filters (C++)☆288Updated 4 months ago
- Simple C++ code to benchmark fast division algorithms☆54Updated 4 years ago
- std::map/std::set implementation using the adaptive radix tree☆15Updated 4 years ago
- Succinct data structures in C/C++☆92Updated last year
- ☆11Updated 2 years ago
- A comparative, extendable benchmarking suite for C and C++ hash-table libraries.☆41Updated last year
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Updated 10 months ago
- A single file C++17 header-only Minimal Acyclic Subsequential Transducers, or Finite State Transducers☆59Updated 3 years ago