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.
  ☆64Updated 5 months ago
• ekg / intervaltree
  a minimal C++ interval tree implementation
  ☆230Updated 4 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!
  ☆128Updated 2 years ago
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆26Updated last year
• jermp / pthash
  ✈️ PTHash is a fast and compact minimal perfect hash function.
  ☆229Updated last week
• 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 …
  ☆26Updated 3 years ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆34Updated 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.
  ☆30Updated 2 months ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 9 months ago
• yhirose / cpp-fstlib
  A single file C++17 header-only Minimal Acyclic Subsequential Transducers, or Finite State Transducers
  ☆56Updated 2 years ago
• Kronuz / cpp-btree
  Modern C++ B-tree containers
  ☆271Updated last year
• martinus / map_benchmark
  Comprehensive benchmarks of C++ maps
  ☆309Updated 2 years ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated last year
• tlx / tlx
  TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers
  ☆412Updated 4 months ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆35Updated 2 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…
  ☆109Updated 5 months ago
• greg7mdp / gtl
  Greg's Template Library of useful classes.
  ☆198Updated 3 weeks ago
• cmuparlay / parlaylib
  A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines
  ☆365Updated 3 weeks ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• vpetrigo / caches
  C++ cache with LRU/LFU/FIFO policies implementation
  ☆364Updated 2 weeks ago
• voutcn / kxsort
  Fast in-place radix sort with STL-like API
  ☆47Updated 8 years ago
• kimwalisch / libpopcnt
  🚀 Fast C/C++ bit population count library
  ☆346Updated 11 months ago
• cmuparlay / parlayhash
  Concurrent Hash Table
  ☆27Updated last month
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆27Updated 2 months ago
• boostorg / sort
  Boost.Sort
  ☆53Updated last month
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆178Updated 8 months ago
• cmuparlay / flock
  Library for lock-free locks
  ☆80Updated last year
• mpoeter / emr
  Effective Memory Reclamation
  ☆55Updated 5 years ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆116Updated 4 years ago