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.
  ☆71Updated 2 months ago
• tlk00 / BitMagic
  BitMagic Library
  ☆433Updated 2 months ago
• stxxl / stxxl
  STXXL: Standard Template Library for Extra Large Data Sets
  ☆495Updated last year
• johannesthoma / mmap_allocator
  A STL allocator that mmaps files
  ☆252Updated 4 years ago
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆268Updated 4 months ago
• kimwalisch / libpopcnt
  🚀 Fast C/C++ bit population count library
  ☆354Updated last year
• pinam45 / dynamic_bitset
  Simple Useful Libraries: C++17/20 header-only dynamic bitset
  ☆170Updated 9 months ago
• mavam / libbf
  Bloom filters for C++11
  ☆365Updated 3 years ago
• mateidavid / zstr
  A C++ header-only ZLib wrapper
  ☆332Updated 3 weeks 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…
  ☆75Updated last year
• rantala / string-sorting
  A collection of string sorting algorithms
  ☆55Updated 3 years ago
• ldionne / mpl11
  Enjoy template metaprogramming
  ☆114Updated 8 years ago
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆183Updated 2 weeks ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆65Updated last year
• gmarcais / NoShell
  C++ library to easily start subprocesses and pipelines of commands
  ☆16Updated 2 years ago
• timsort / cpp-TimSort
  A C++ implementation of timsort
  ☆312Updated 11 months ago
• goldsborough / lru-cache
  A feature complete LRU cache implementation in C++
  ☆260Updated 5 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 5 years ago
• voutcn / kxsort
  Fast in-place radix sort with STL-like API
  ☆48Updated 8 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆101Updated 3 years ago
• lemire / rollinghashcpp
  Rolling Hash C++ Library
  ☆189Updated last year
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last year
• ast-al / rangeless
  c++ LINQ -like library of higher-order functions for data manipulation
  ☆199Updated 4 years ago
• tobbez / string-splitting
  String splitting benchmarks
  ☆40Updated 9 years ago
• edanor / umesimd
  UME::SIMD A library for explicit simd vectorization.
  ☆91Updated 7 years ago
• ericniebler / meta
  A tiny metaprogramming library
  ☆312Updated 2 years ago
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆34Updated 10 months ago
• redspah / xxhash_cpp
  Port of the xxhash library to C++17.
  ☆183Updated 5 months ago
• trailofbits / sqlite_wrapper
  An easy-to-use, extensible and lightweight C++17 wrapper for SQLite
  ☆116Updated 6 years ago
• jaredhoberock / tuple_utility
  The missing C++ tuple functionality
  ☆85Updated 5 years ago