Alternatives and similar repositories for intervaltree

Users that are interested in intervaltree are comparing it to the libraries listed below

• tlk00 / BitMagic
  BitMagic Library
  ☆428Updated last month
• 5cript / interval-tree
  A C++ header only interval tree implementation.
  ☆69Updated last month
• stxxl / stxxl
  STXXL: Standard Template Library for Extra Large Data Sets
  ☆493Updated last year
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆265Updated 2 months ago
• kimwalisch / libpopcnt
  🚀 Fast C/C++ bit population count library
  ☆350Updated last year
• mavam / libbf
  Bloom filters for C++11
  ☆363Updated 3 years ago
• bkille / BitLib
  Provides a bit-vector, an optimized replacement of the infamous std::vector<ool>. In addition to the bit-vector, the library also pro…
  ☆74Updated last year
• johannesthoma / mmap_allocator
  A STL allocator that mmaps files
  ☆252Updated 4 years ago
• voutcn / kxsort
  Fast in-place radix sort with STL-like API
  ☆47Updated 8 years ago
• mateidavid / zstr
  A C++ header-only ZLib wrapper
  ☆332Updated last month
• pinam45 / dynamic_bitset
  Simple Useful Libraries: C++17/20 header-only dynamic bitset
  ☆168Updated 8 months ago
• goldsborough / lru-cache
  A feature complete LRU cache implementation in C++
  ☆257Updated 5 years ago
• tobbez / string-splitting
  String splitting benchmarks
  ☆39Updated 9 years ago
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆183Updated last year
• timsort / cpp-TimSort
  A C++ implementation of timsort
  ☆310Updated 10 months ago
• rantala / string-sorting
  A collection of string sorting algorithms
  ☆55Updated 3 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆64Updated last year
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆110Updated last year
• tinloaf / ygg
  An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!
  ☆129Updated 2 years ago
• lemire / rollinghashcpp
  Rolling Hash C++ Library
  ☆188Updated last year
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆95Updated last month
• redspah / xxhash_cpp
  Port of the xxhash library to C++17.
  ☆183Updated 4 months ago
• cjgdev / aho_corasick
  A C++ implementation of the aho corasick pattern search algorithm
  ☆229Updated last year
• valyala / gheap
  Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.
  ☆135Updated 6 years ago
• martinus / map_benchmark
  Comprehensive benchmarks of C++ maps
  ☆314Updated 2 years ago
• tlx / tlx
  TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers
  ☆432Updated 8 months ago
• ldionne / mpl11
  Enjoy template metaprogramming
  ☆113Updated 8 years ago
• kephir4eg / trie
  C++ implementation of Radix tree
  ☆65Updated 6 years ago
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆91Updated 2 years ago
• Tessil / sparse-map
  C++ implementation of a memory efficient hash map and hash set
  ☆362Updated 3 weeks ago