Alternatives and similar repositories for IntervalTree

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

• 5cript / interval-tree
  A C++ header only interval tree implementation.
  ☆74Updated 4 months ago
• ekg / intervaltree
  a minimal C++ interval tree implementation
  ☆237Updated 4 years ago
• jermp / pthash
  ✈️ PTHash is a fast and compact minimal perfect hash function.
  ☆249Updated last month
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆34Updated 8 months ago
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆25Updated 2 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• tlk00 / BitMagic
  BitMagic Library
  ☆437Updated 4 months ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 8 years ago
• tlx / tlx
  TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers
  ☆441Updated 11 months ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆31Updated 9 months ago
• tinloaf / ygg
  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
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• kimwalisch / libpopcnt
  🚀 Fast C/C++ bit population count library
  ☆358Updated last year
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆38Updated 3 years ago
• Kronuz / cpp-btree
  Modern C++ B-tree containers
  ☆279Updated 2 years ago
• cmuparlay / parlaylib
  A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines
  ☆399Updated last month
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆270Updated 5 months ago
• martinus / map_benchmark
  Comprehensive benchmarks of C++ maps
  ☆316Updated 2 years ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆25Updated 2 years ago
• voutcn / kxsort
  Fast in-place radix sort with STL-like API
  ☆48Updated 9 years ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 3 years ago
• TooBiased / growt
  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
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆288Updated 4 months ago
• lemire / fast_division
  Simple C++ code to benchmark fast division algorithms
  ☆54Updated 4 years ago
• justinasvd / art_map
  std::map/std::set implementation using the adaptive radix tree
  ☆15Updated 4 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆92Updated last year
• MatteoCeregini / quad-wavelet-tree
  ☆11Updated 2 years ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆41Updated last year
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆36Updated 10 months ago
• yhirose / cpp-fstlib
  A single file C++17 header-only Minimal Acyclic Subsequential Transducers, or Finite State Transducers
  ☆59Updated 3 years ago