Alternatives and similar repositories for segmented_tree

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

• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆18Updated 6 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• adrian17 / cpp-drop-merge-sort
  C++ reimplementation of https://github.com/emilk/drop-merge-sort
  ☆21Updated 3 years ago
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 6 years ago
• KWillets / range_generator
  Some variations on Lemire's Fast Random Integer Generation in an Interval
  ☆15Updated 5 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• rurban / nbperf
  Improved NetBSD's Perfect Hash Generation Tool v3
  ☆20Updated last year
• clasp-developers / ctak
  A small test for multithreaded C++ stack unwinding on unixes
  ☆16Updated 5 years ago
• fsaintjacques / jitmap
  LLVM-jitted bitmaps
  ☆27Updated 5 years ago
• schani / linbin
  Linear vs binary search benchmark
  ☆40Updated 5 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago
• Keith-Cancel / k-hashv
  A vectorized single header hash function.
  ☆19Updated 7 months ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆51Updated 7 years ago
• zwegner / Miroslav
  A proof-of-concept for a fast regex matcher using lossy NFA matching on SIMD
  ☆12Updated 6 years ago
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 6 years ago
• facebookarchive / Rseq
  Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations
  ☆36Updated 6 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• shaovoon / floatbench
  String to Float Benchmark
  ☆19Updated 6 years ago
• google / zuckerli
  ☆28Updated 2 years ago
• btrask / lsmdb
  Proof of concept LSM-tree built on MDB
  ☆17Updated 10 years ago
• nicola-gigante / bitvector
  A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …
  ☆26Updated 3 years ago
• Const-me / MemoryAccessCosts
  ☆13Updated 6 years ago
• stedolan / libfib
  A library for high-performance lightweight threads
  ☆20Updated 13 years ago
• skeeto / xf8
  8-bit Xor Filter in C99
  ☆61Updated 5 years ago
• willemt / splay-tree
  A splaytree ADT written in C with a BSD license
  ☆18Updated 5 years ago
• rurban / perl-hash-stats
  Counting the collisions with perl hash tables per function
  ☆12Updated 6 years ago
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆17Updated 9 years ago
• lemire / backward_multiplication
  Multiplying... backward?
  ☆13Updated 4 years ago
• JerrySievert / judyarray
  Automatically exported from code.google.com/p/judyarray
  ☆17Updated 9 years ago
• stasis / stasis
  Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…
  ☆53Updated 12 years ago