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 4 months ago
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆25Updated last year
• 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
• ekg / intervaltree
  a minimal C++ interval tree implementation
  ☆229Updated 4 years ago
• 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 last month
• jermp / pthash
  ✈️ PTHash is a fast and compact minimal perfect hash function.
  ☆226Updated this week
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆35Updated 2 years ago
• pnnl / NWGraph
  Complete Project Documentation
  ☆95Updated 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!
  ☆128Updated last year
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• tlk00 / BitMagic
  BitMagic Library
  ☆425Updated last month
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆27Updated last month
• tetzank / coat
  EDSL for C++ to make just-in-time code generation easier
  ☆86Updated 2 years ago
• PatwinchIR / ultra-sort
  DSL for SIMD Sorting on AVX2 & AVX512
  ☆29Updated 6 years ago
• cmuparlay / parlayhash
  Concurrent Hash Table
  ☆27Updated 3 weeks ago
• ByteHamster / SicHash
  A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.
  ☆19Updated last month
• martinus / map_benchmark
  Comprehensive benchmarks of C++ maps
  ☆309Updated 2 years ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆115Updated 4 years ago
• eyalz800 / zpp_throwing
  Using coroutines to implement C++ exceptions for freestanding environments
  ☆73Updated 6 months ago
• boostorg / sort
  Boost.Sort
  ☆52Updated 3 weeks ago
• greg7mdp / gtl
  Greg's Template Library of useful classes.
  ☆196Updated this week
• cmuparlay / flock
  Library for lock-free locks
  ☆78Updated last year
• rhalbersma / bit_set
  Rebooting the std::bitset franchise
  ☆44Updated 2 weeks ago
• Lucaweihs / range-tree
  A C++ RangeTree implementation.
  ☆43Updated 4 years ago
• kimwalisch / libpopcnt
  🚀 Fast C/C++ bit population count library
  ☆345Updated 10 months ago
• renzibei / fph-table
  Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup
  ☆43Updated last year
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated last year
• Jiwan / dense_hash_map
  A simple replacement for std::unordered_map
  ☆49Updated 9 months ago