lwu / veb-tree

Related projects ⓘ

Alternatives and complementary repositories for veb-tree

• tetzank / coat
  EDSL for C++ to make just-in-time code generation easier
  ☆82Updated last year
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 3 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated last year
• lemire / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆50Updated 9 months ago
• jermp / dint
  Dictionary-based compression for inverted indexes.
  ☆23Updated 5 years ago
• tudocomp / compact_sparse_hash
  A blend of the compact and sparse hash table implementations.
  ☆12Updated 3 years ago
• toby-allsopp / ranges-coroutines
  Utilities to help using Coroutines with Ranges
  ☆23Updated 7 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆27Updated 2 years ago
• s3cur3 / llvm-data-structure-benchmarks
  A benchmark for cache efficient data structures.
  ☆29Updated 5 years ago
• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆31Updated 11 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• simdjson / simdjson_experiments_vldb2019
  Detailed experiments over simdjson for VLDB article (2019) and future work
  ☆22Updated 4 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 7 years ago
• mjansson / rpmalloc-benchmark
  Benchmarks for our memory allocator
  ☆61Updated last year
• lemire / Concise
  C++ implementation of Concise and WAH compressed bitsets
  ☆21Updated 7 years ago
• dotnwat / persistent-rbtree
  Persistent red-black tree in C++
  ☆27Updated 6 years ago
• L-v-M / async
  ☆21Updated last year
• executors / futures
  A proposal for a futures programming model for ISO C++
  ☆22Updated 6 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆25Updated 5 years ago
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆90Updated last year
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆17Updated 6 years ago
• bloomberg / bde-allocator-benchmarks
  A set of benchmarking tools used to quantify the performance of BDE-style polymorphic allocators.
  ☆34Updated 8 years ago
• mpoeter / emr
  Effective Memory Reclamation
  ☆50Updated 4 years ago
• ssteinberg / shared_futex
  Fast, shared, upgradeable, non-recursive and non-fair mutex
  ☆29Updated 6 years ago
• philipbecker / cpp-art
  STL-compliant map and set container based on a C++11 Adaptive Radix Tree implementation.
  ☆11Updated 8 years ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated 8 months ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆31Updated 11 months ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆51Updated 7 years ago
• dcdillon / cpuaff
  C++ interface to CPU affinity management
  ☆30Updated 6 years ago
• parlab-tuwien / lockfree-linked-list
  A more Pragmatic Implementation of the Lock-free, Ordered, Linked List
  ☆15Updated 3 years ago