Alternatives and similar repositories for FrameOfReference:

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

• ademakov / Oroch
  A C++ library for integer array compression
  ☆29Updated 3 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 12 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆26Updated 5 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• lemire / Concise
  C++ implementation of Concise and WAH compressed bitsets
  ☆20Updated 8 years ago
• jermp / clustered_elias_fano_indexes
  Clustered Elias-Fano inverted indexes.
  ☆15Updated 6 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆52Updated 7 years ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆14Updated last year
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 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
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 3 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 7 years ago
• HBPVIS / ZeroBuf
  zero-copy, zero-serialize, zero-hassle protocol buffers
  ☆56Updated 7 years ago
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆32Updated 7 years ago
• JGRennison / cpp-btree
  Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.
  ☆37Updated 2 months ago
• ssteinberg / shared_futex
  Fast, shared, upgradeable, non-recursive and non-fair mutex
  ☆30Updated 6 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• greg7mdp / sho
  Small Hash Optimization - an optimization for when you have many small hash maps - similar to LLVM's small vector optimization.
  ☆39Updated 7 years ago
• pgoodman / rcu
  C++ implementation of RCU based on reference counting and hazard pointers.
  ☆27Updated 12 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆49Updated last year
• powturbo / Turbo-Transpose
  Transpose: SIMD Integer+Floating Point Compression Filter
  ☆60Updated 5 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• cyfdecyf / google-concurrency-library
  Automatically exported from code.google.com/p/google-concurrency-library
  ☆14Updated 9 years ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆34Updated 10 months ago
• KevinStern / index-cpp
  C++ implementations of indexing mechanisms, including a Hilbert-curve geohash based spatial index and a linear hashing table, for disk or…
  ☆76Updated 4 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆65Updated 4 years ago
• tarsa / SortingAlgorithmsBenchmark
  ☆16Updated 10 years ago