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 month
• tinloaf / ygg
  An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!
  ☆126Updated last year
• ekg / intervaltree
  a minimal C++ interval tree implementation
  ☆229Updated 3 years ago
• jermp / pthash
  Fast and compact minimal perfect hash functions in C++.
  ☆214Updated this week
• tlx / tlx
  TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers
  ☆405Updated last month
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆25Updated last year
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆113Updated 4 years ago
• yhirose / cpp-fstlib
  A single file C++17 header-only Minimal Acyclic Subsequential Transducers, or Finite State Transducers
  ☆54Updated 2 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 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.
  ☆29Updated 3 months ago
• Kronuz / cpp-btree
  Modern C++ B-tree containers
  ☆269Updated last year
• powturbo / Turbo-Transpose
  Transpose: SIMD Integer+Floating Point Compression Filter
  ☆59Updated 5 years ago
• LLNL / metall
  Persistent memory allocator for data-centric analytics
  ☆54Updated 3 weeks ago
• boostorg / sort
  Boost.Sort
  ☆52Updated 2 months ago
• martinus / map_benchmark
  Comprehensive benchmarks of C++ maps
  ☆305Updated 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 2 years ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆35Updated 2 years ago
• reyoung / avx_mathfun
  AVX-optimized sin(), cos(), exp() and log() functions
  ☆119Updated 3 years ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• RedSpah / xxhash_cpp
  Port of the xxhash library to C++17.
  ☆172Updated last month
• bingmann / malloc_count
  Method to measure the amount of allocated memory of a program at run-time.
  ☆68Updated 2 years ago
• algorithm-ninja / cpp-btree
  Git mirror of the official (mercurial) repository of cpp-btree
  ☆73Updated 10 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆52Updated 7 years ago
• mattreecebentley / plf_hive
  plf::hive is a fork of plf::colony to match the current C++ standards proposal.
  ☆89Updated 2 months ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• kimwalisch / libpopcnt
  🚀 Fast C/C++ bit population count library
  ☆337Updated 7 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…
  ☆108Updated last month
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 5 months ago
• ytakano / radix_tree
  STL like container of radix tree (a.k.a. PATRICIA trie) in C++
  ☆141Updated 2 years ago
• simdutf / is_utf8
  Fast C++ function "is_utf8": checks if the input is valid UTF-8. Made of a single source file. Optimized for ARM NEON, x64 SSE, AVX2 and…
  ☆58Updated 4 months ago