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.
  ☆63Updated last week
• yhirose / cpp-fstlib
  A single file C++17 header-only Minimal Acyclic Subsequential Transducers, or Finite State Transducers
  ☆54Updated 2 years ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 2 years ago
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆25Updated last year
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆27Updated 2 months ago
• ekg / intervaltree
  a minimal C++ interval tree implementation
  ☆228Updated 3 years ago
• tinloaf / ygg
  An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!
  ☆124Updated last year
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• nicola-gigante / bitvector
  A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …
  ☆22Updated 2 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆93Updated 4 months ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• tetzank / coat
  EDSL for C++ to make just-in-time code generation easier
  ☆85Updated last year
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆253Updated last year
• jermp / pthash
  Fast and compact minimal perfect hash functions in C++.
  ☆211Updated last week
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆35Updated 2 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 4 months ago
• stbrumme / xxhash
  A super-fast hash algorithm in a single C++ header
  ☆78Updated 3 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆25Updated last month
• kimwalisch / libpopcnt
  🚀 Fast C/C++ bit population count library
  ☆336Updated 6 months ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆111Updated 4 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 2 years ago
• edanor / umesimd
  UME::SIMD A library for explicit simd vectorization.
  ☆91Updated 7 years ago
• justinasvd / art_map
  std::map/std::set implementation using the adaptive radix tree
  ☆13Updated 3 years ago
• lemire / runningmaxmin
  Fast maximum-minimum filters implemented in C++
  ☆44Updated last year
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆130Updated 3 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆76Updated last year
• tlk00 / BitMagic
  BitMagic Library
  ☆415Updated 4 months ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated last year
• jmuehlig / perf-cpp
  Lightweight recording and sampling of performance counters for specific code segments directly from your C++ application.
  ☆50Updated 3 weeks ago