Alternatives and similar repositories for intervaltree

Users that are interested in intervaltree are comparing it to the libraries listed below

• tlk00 / BitMagic
  BitMagic Library
  ☆436Updated 3 months ago
• stxxl / stxxl
  STXXL: Standard Template Library for Extra Large Data Sets
  ☆496Updated last year
• 5cript / interval-tree
  A C++ header only interval tree implementation.
  ☆71Updated 3 months ago
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆269Updated 4 months ago
• kimwalisch / libpopcnt
  🚀 Fast C/C++ bit population count library
  ☆355Updated last year
• mavam / libbf
  Bloom filters for C++11
  ☆365Updated 3 years 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
• johannesthoma / mmap_allocator
  A STL allocator that mmaps files
  ☆253Updated 4 years ago
• tobbez / string-splitting
  String splitting benchmarks
  ☆40Updated 9 years ago
• timsort / cpp-TimSort
  A C++ implementation of timsort
  ☆312Updated last year
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆99Updated last week
• rantala / string-sorting
  A collection of string sorting algorithms
  ☆55Updated 3 years ago
• lemire / rollinghashcpp
  Rolling Hash C++ Library
  ☆189Updated last year
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last year
• mateidavid / zstr
  A C++ header-only ZLib wrapper
  ☆332Updated last month
• pinam45 / dynamic_bitset
  Simple Useful Libraries: C++17/20 header-only dynamic bitset
  ☆170Updated 10 months ago
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆183Updated last month
• bingmann / malloc_count
  Method to measure the amount of allocated memory of a program at run-time.
  ☆70Updated 3 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆65Updated last year
• 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
• edanor / umesimd
  UME::SIMD A library for explicit simd vectorization.
  ☆91Updated 7 years ago
• kephir4eg / trie
  C++ implementation of Radix tree
  ☆66Updated 6 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!
  ☆130Updated 2 years ago
• miloyip / dtoa-benchmark
  C++ double-to-string conversion benchmark
  ☆259Updated 3 years ago
• richelbilderbeek / boost_graph_cookbook_1
  Boost.Graph Cookbook 1: Basics
  ☆185Updated last year
• simongog / sdsl
  Succinct Data Structure Library
  ☆108Updated 12 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 5 years ago
• petegoodliffe / skip_list
  STL-style C++ skip_list container
  ☆87Updated 3 years ago
• molpopgen / libsequence
  libsequence: a C++ class library for evolutionary genetic analysis
  ☆53Updated 5 years ago