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
• stxxl / stxxl
  STXXL: Standard Template Library for Extra Large Data Sets
  ☆492Updated last year
• tlk00 / BitMagic
  BitMagic Library
  ☆425Updated last month
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆261Updated 2 years ago
• tlx / tlx
  TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers
  ☆409Updated 4 months ago
• johannesthoma / mmap_allocator
  A STL allocator that mmaps files
  ☆247Updated 4 years ago
• greg7mdp / gtl
  Greg's Template Library of useful classes.
  ☆196Updated this week
• moya-lang / Allocator
  Ultra fast C++11 allocator for STL containers.
  ☆274Updated 3 years ago
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆178Updated 7 months ago
• mavam / libbf
  Bloom filters for C++11
  ☆358Updated 3 years ago
• elliotgoodrich / SSO-23
  Memory optimal Small String Optimization implementation for C++
  ☆239Updated 10 years ago
• martinus / map_benchmark
  Comprehensive benchmarks of C++ maps
  ☆309Updated 2 years ago
• ArashPartow / strtk
  C++ String Toolkit Library https://www.partow.net/programming/strtk/index.html
  ☆133Updated 4 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆100Updated 2 years ago
• Tessil / hopscotch-map
  C++ implementation of a fast hash map and hash set using hopscotch hashing
  ☆740Updated 7 months ago
• pinam45 / dynamic_bitset
  Simple Useful Libraries: C++17/20 header-only dynamic bitset
  ☆161Updated 3 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…
  ☆109Updated 4 months ago
• mpoeter / xenium
  A C++ library providing various concurrent data structures and reclamation schemes.
  ☆580Updated last month
• kimwalisch / libpopcnt
  🚀 Fast C/C++ bit population count library
  ☆345Updated 10 months ago
• executors / executors
  A proposal for a executor programming model for ISO C++
  ☆140Updated 4 years ago
• IvanPinezhaninov / IntervalTree
  A red-black self-balancing interval tree
  ☆30Updated 4 years ago
• greg7mdp / sparsepp
  A fast, memory efficient hash map for C++
  ☆1,268Updated 2 years ago
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆139Updated 5 years ago
• carlomilanesi / cpp-mmf
  C++98 library that encapsulates memory-mapped-files for POSIX or Windows
  ☆90Updated 6 years ago
• mateidavid / zstr
  A C++ header-only ZLib wrapper
  ☆317Updated 2 weeks ago
• Tessil / sparse-map
  C++ implementation of a memory efficient hash map and hash set
  ☆348Updated 7 months ago
• ClaasBontus / bitset2
  std::bitset with constexpr implementations plus additional features.
  ☆119Updated last year
• ldionne / mpl11
  Enjoy template metaprogramming
  ☆113Updated 8 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 …
  ☆26Updated 3 years ago
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆94Updated last month