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.
  ☆73Updated 5 months ago
• tlx / tlx
  TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers
  ☆446Updated last year
• jermp / pthash
  ✈️ PTHash is a fast and compact minimal perfect hash function.
  ☆250Updated 2 months ago
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆26Updated 2 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 8 years ago
• Kronuz / cpp-btree
  Modern C++ B-tree containers
  ☆280Updated 2 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆31Updated 10 months ago
• ekg / intervaltree
  a minimal C++ interval tree implementation
  ☆237Updated 4 years ago
• kimwalisch / libpopcnt
  🚀 Fast C/C++ bit population count library
  ☆360Updated last year
• tlk00 / BitMagic
  BitMagic Library
  ☆442Updated 5 months ago
• pfent / L5RDMA
  A low level, low latency library, which can be used to accelerate network messages using shared memory and RDMA
  ☆79Updated 5 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!
  ☆132Updated 2 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆84Updated 2 years ago
• martinus / map_benchmark
  Comprehensive benchmarks of C++ maps
  ☆316Updated 2 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆63Updated 7 years ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆38Updated 3 years ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆289Updated 5 months 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…
  ☆118Updated last year
• yhirose / cpp-fstlib
  A single file C++17 header-only Minimal Acyclic Subsequential Transducers, or Finite State Transducers
  ☆57Updated 3 years ago
• llnl / metall
  Persistent memory allocator for data-centric analytics
  ☆60Updated 3 months ago
• cmuparlay / parlaylib
  A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines
  ☆422Updated 2 months ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• edanor / umesimd
  UME::SIMD A library for explicit simd vectorization.
  ☆91Updated 8 years ago
• lemire / fast_division
  Simple C++ code to benchmark fast division algorithms
  ☆54Updated 4 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆71Updated 2 years ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆123Updated 5 years ago
• deepgrace / monster
  The Art of Template MetaProgramming (TMP) in Modern C++♦️
  ☆168Updated last year
• cwida / ALP
  ALP: Adaptive Lossless Floating-Point Compression
  ☆161Updated 3 months ago
• agenium-scale / nsimd
  Agenium Scale vectorization library for CPUs and GPUs
  ☆337Updated 4 years ago