IvanPinezhaninov / IntervalTree

Related projects: ⓘ

• 5cript / interval-tree
  A C++ header only interval tree implementation.
  ☆60Updated 3 weeks ago
• ekg / intervaltree
  a minimal C++ interval tree implementation
  ☆220Updated 3 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!
  ☆120Updated last year
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆57Updated 2 years ago
• yhirose / cpp-fstlib
  A single file C++17 header-only Minimal Acyclic Subsequential Transducers, or Finite State Transducers
  ☆52Updated last year
• jermp / pthash
  Fast and compact minimal perfect hash functions in C++.
  ☆187Updated 3 weeks ago
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆25Updated 2 weeks ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendible benchmarking suite for C and C++ hash-table libraries.
  ☆21Updated 3 months ago
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆24Updated 11 months ago
• martinus / map_benchmark
  Comprehensive benchmarks of C++ maps
  ☆296Updated last year
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆102Updated 6 years ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆109Updated 4 years ago
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆176Updated 9 months ago
• boostorg / sort
  Boost.Sort
  ☆50Updated 3 weeks ago
• greg7mdp / gtl
  Greg's Template Library of useful classes.
  ☆107Updated 3 weeks ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆30Updated last year
• ktprime / emhash
  Fast and memory efficient c++ flat hash map/set
  ☆462Updated 2 weeks ago
• grame-cncm / digraph
  Very simple C++ directed graph library
  ☆74Updated 2 years ago
• martinus / svector
  Compact SVO optimized vector for C++17 or higher
  ☆94Updated 4 months ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆40Updated 2 weeks ago
• google / dimsum
  Portable C++ SIMD library
  ☆173Updated 5 years ago
• stbrumme / xxhash
  A super-fast hash algorithm in a single C++ header
  ☆71Updated 2 years ago
• pinam45 / dynamic_bitset
  Simple Useful Libraries: C++17/20 header-only dynamic bitset
  ☆152Updated this week
• ogiroux / atomic_wait
  Sample implementation of C++20 atomic_wait/notify
  ☆56Updated 5 years ago
• ConorWilliams / Threadpool
  Light, fast, threadpool for C++20
  ☆94Updated last year
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆106Updated 6 months ago
• DragonSpit / ParallelAlgorithms
  Parallel C++ algorithms
  ☆55Updated 4 months ago
• mapbox / eternal
  A C++14 compile-time/constexpr map and hash map with minimal binary footprint
  ☆201Updated 2 years ago
• iwiwi / parallel-radix-sort
  An implementation of optimized parallel radix sort
  ☆47Updated 5 years ago
• cmuparlay / concurrent_deferred_rc
  Concurrent Deferred Reference Counting
  ☆145Updated 7 months ago