Alternatives and similar repositories for intervaltree

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

• tlk00 / BitMagic
  BitMagic Library
  ☆428Updated 3 weeks ago
• 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
• kimwalisch / libpopcnt
  🚀 Fast C/C++ bit population count library
  ☆349Updated last year
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆265Updated 2 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
• mavam / libbf
  Bloom filters for C++11
  ☆363Updated 3 years ago
• johannesthoma / mmap_allocator
  A STL allocator that mmaps files
  ☆251Updated 4 years ago
• mateidavid / zstr
  A C++ header-only ZLib wrapper
  ☆329Updated last month
• pinam45 / dynamic_bitset
  Simple Useful Libraries: C++17/20 header-only dynamic bitset
  ☆167Updated 7 months ago
• rantala / string-sorting
  A collection of string sorting algorithms
  ☆56Updated 3 years ago
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆181Updated 11 months ago
• greg7mdp / gtl
  Greg's Template Library of useful classes.
  ☆217Updated last month
• edanor / umesimd
  UME::SIMD A library for explicit simd vectorization.
  ☆91Updated 7 years ago
• timsort / cpp-TimSort
  A C++ implementation of timsort
  ☆310Updated 9 months ago
• goldsborough / lru-cache
  A feature complete LRU cache implementation in C++
  ☆256Updated 5 years ago
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆95Updated 3 weeks ago
• valyala / gheap
  Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.
  ☆135Updated 6 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆64Updated last year
• tlx / tlx
  TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers
  ☆419Updated 8 months ago
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆34Updated 8 months ago
• Tessil / hopscotch-map
  C++ implementation of a fast hash map and hash set using hopscotch hashing
  ☆758Updated 11 months ago
• VinGarcia / Simple-Iterator-Template
  Provides a header-only iterator template that is easy to adapt for any custom container
  ☆47Updated 3 years ago
• eyalz800 / serializer
  A single header standard C++ serialization framework.
  ☆196Updated 3 years ago
• jermp / pthash
  ✈️ PTHash is a fast and compact minimal perfect hash function.
  ☆237Updated this week
• ericniebler / meta
  A tiny metaprogramming library
  ☆311Updated 2 years ago
• tobbez / string-splitting
  String splitting benchmarks
  ☆39Updated 9 years ago
• ast-al / rangeless
  c++ LINQ -like library of higher-order functions for data manipulation
  ☆198Updated 4 years ago
• redspah / xxhash_cpp
  Port of the xxhash library to C++17.
  ☆184Updated 3 months ago