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.
  ☆69Updated 2 weeks ago
• stxxl / stxxl
  STXXL: Standard Template Library for Extra Large Data Sets
  ☆492Updated last year
• tlk00 / BitMagic
  BitMagic Library
  ☆426Updated 4 months ago
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆266Updated last month
• kimwalisch / libpopcnt
  🚀 Fast C/C++ bit population count library
  ☆348Updated last year
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆95Updated last week
• johannesthoma / mmap_allocator
  A STL allocator that mmaps files
  ☆249Updated 4 years ago
• mavam / libbf
  Bloom filters for C++11
  ☆363Updated 3 years ago
• mateidavid / zstr
  A C++ header-only ZLib wrapper
  ☆328Updated 2 weeks ago
• tlx / tlx
  TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers
  ☆417Updated 7 months ago
• bkille / BitLib
  Provides a bit-vector, an optimized replacement of the infamous std::vector<ool>. In addition to the bit-vector, the library also pro…
  ☆74Updated last year
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆179Updated 11 months ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆64Updated last year
• pinam45 / dynamic_bitset
  Simple Useful Libraries: C++17/20 header-only dynamic bitset
  ☆166Updated 6 months ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last year
• rantala / string-sorting
  A collection of string sorting algorithms
  ☆56Updated 3 years ago
• redspah / xxhash_cpp
  Port of the xxhash library to C++17.
  ☆184Updated 3 months ago
• tobbez / string-splitting
  String splitting benchmarks
  ☆39Updated 9 years ago
• greg7mdp / gtl
  Greg's Template Library of useful classes.
  ☆214Updated last week
• 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
• lemire / rollinghashcpp
  Rolling Hash C++ Library
  ☆187Updated last year
• goldsborough / lru-cache
  A feature complete LRU cache implementation in C++
  ☆255Updated 5 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…
  ☆110Updated 7 months ago
• bingmann / malloc_count
  Method to measure the amount of allocated memory of a program at run-time.
  ☆69Updated 3 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆101Updated 3 years ago
• Tessil / sparse-map
  C++ implementation of a memory efficient hash map and hash set
  ☆360Updated 11 months ago
• timsort / cpp-TimSort
  A C++ implementation of timsort
  ☆309Updated 8 months ago
• edanor / umesimd
  UME::SIMD A library for explicit simd vectorization.
  ☆91Updated 7 years ago
• ArashPartow / bloom
  C++ Bloom Filter Library https://www.partow.net/programming/bloomfilter/index.html
  ☆141Updated 4 years ago
• Tessil / hopscotch-map
  C++ implementation of a fast hash map and hash set using hopscotch hashing
  ☆753Updated 11 months ago