ekg / intervaltreeLinks
a minimal C++ interval tree implementation
☆237Updated 4 years ago
Alternatives and similar repositories for intervaltree
Users that are interested in intervaltree are comparing it to the libraries listed below
Sorting:
- BitMagic Library☆441Updated 5 months ago
- STXXL: Standard Template Library for Extra Large Data Sets☆496Updated 2 years ago
- A C++ header only interval tree implementation.☆73Updated 5 months ago
- Bloom-filter based minimal perfect hash function library☆274Updated 6 months ago
- 🚀 Fast C/C++ bit population count library☆360Updated last year
- A STL allocator that mmaps files☆255Updated 4 years ago
- A collection of string sorting algorithms☆55Updated 4 years ago
- Bloom filters for C++11☆364Updated 4 years ago
- Simple Useful Libraries: C++17/20 header-only dynamic bitset☆174Updated 2 weeks ago
- A C++ header-only ZLib wrapper☆335Updated 3 months ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆66Updated last year
- An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!☆131Updated 2 years ago
- Provides a bit-vector, an optimized replacement of the infamous std::vector<ool>. In addition to the bit-vector, the library also pro…☆73Updated last year
- C++ implementation of a fast and memory efficient hash map and hash set specialized for strings☆185Updated 3 months ago
- Dynamic succinct/compressed data structures☆115Updated last month
- A feature complete LRU cache implementation in C++☆264Updated 6 years ago
- Method to measure the amount of allocated memory of a program at run-time.☆70Updated 3 years ago
- UME::SIMD A library for explicit simd vectorization.☆91Updated 8 years ago
- Succinct Data Structure Library 3.0☆101Updated last month
- Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.☆136Updated 6 years ago
- String splitting benchmarks☆41Updated 9 years ago
- Compact Data Structures Library☆103Updated 3 years ago
- Fast in-place radix sort with STL-like API☆49Updated 9 years ago
- Enjoy template metaprogramming☆115Updated 9 years ago
- STL-style C++ skip_list container☆87Updated 3 years ago
- std::bitset with constexpr implementations plus additional features.☆126Updated 2 years ago
- C++ Bloom Filter Library https://www.partow.net/programming/bloomfilter/index.html☆146Updated 5 years ago
- C++ library to easily start subprocesses and pipelines of commands☆16Updated 2 years ago
- Greg's Template Library of useful classes.☆266Updated 3 weeks ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆118Updated last year