mavam / compbench

Related projects ⓘ

Alternatives and complementary repositories for compbench

• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆14Updated 7 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 8 years ago
• gnzlbg / nmp
  Non-blocking message passing (a C++14 MPI wrapper)
  ☆18Updated 10 years ago
• essennell / narl
  Not Another Range Library
  ☆39Updated 10 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆27Updated 2 years ago
• lemire / Concise
  C++ implementation of Concise and WAH compressed bitsets
  ☆21Updated 7 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆17Updated 6 years ago
• naquin / native
  Native C++ Library
  ☆49Updated 9 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 …
  ☆21Updated 2 years ago
• r-lyeh-archived / malloc-survey
  Allocation benchmarks
  ☆30Updated 8 years ago
• google / hashing-demo
  Sample implementation of a proposed C++ hashing framework
  ☆29Updated 9 years ago
• drbobbeaty / DKit
  C++ Library of Atomic and Lockless Data Structures
  ☆38Updated 4 years ago
• KWillets / simd_interleave
  Interleaving bits from two sources using SIMD instructions.
  ☆14Updated 6 years ago
• nemequ / LZSSE-SIMDe
  LZSSE compression codec ported to SIMDe
  ☆19Updated 4 years ago
• philsquared / scape
  A header-only, modern C++, library for terminal colours and cursor manipulation
  ☆17Updated 6 years ago
• toby-allsopp / ranges-coroutines
  Utilities to help using Coroutines with Ranges
  ☆23Updated 7 years ago
• graphitemaster / libintrusive
  Intrusive data structures for C
  ☆56Updated 7 years ago
• arneg / GJAlloc
  a fast fixed size block allocator
  ☆20Updated 9 years ago
• Manu343726 / Polyop
  Overridable universal operator overloading for C++14
  ☆20Updated 10 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆52Updated 10 months ago
• cruppstahl / sparsemap
  A sparse and compressed bitmap library.
  ☆11Updated 10 years ago
• rollbear / tachymeter
  Header only C++14 micro benchmark
  ☆14Updated 8 years ago
• schani / linbin
  Linear vs binary search benchmark
  ☆41Updated 4 years ago
• 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
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆50Updated 10 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated last year
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆25Updated 5 years ago
• mklarqvist / StormBitmaps
  Fast algorithms for computing XX^T for binary matrices
  ☆14Updated 5 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 11 years ago
• dcdillon / cpuaff
  C++ interface to CPU affinity management
  ☆30Updated 6 years ago