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
• attractivechaos / udb2
  For details, see the blog post:
  ☆34Updated last year
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 6 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆55Updated 7 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆46Updated 5 years ago
• JGRennison / cpp-btree
  Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.
  ☆37Updated last week
• vigna / sux
  Succinct data structures in C/C++
  ☆92Updated last year
• WojciechMula / simd-string
  SIMD (SSE) string functions
  ☆103Updated 8 years ago
• rollbear / prio_queue
  C++14 cache friendly B-heap priority queue
  ☆109Updated 2 months ago
• yandex / fastops
  This small library enables acceleration of bulk calls of certain math functions on AVX and AVX2 hardware. Currently supported operations …
  ☆87Updated 4 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆108Updated 8 years ago
• romange / gaia
  C++ framework for rapid server development
  ☆76Updated last year
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 8 years 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…
  ☆78Updated 5 years ago
• mpoeter / emr
  Effective Memory Reclamation
  ☆63Updated 5 years ago
• mpictor / judy-template
  An implementation of the Judy array, wrapped in a c++ template. Uses Karl Malbrain's implementation, http://code.google.com/p/judyarray/ …
  ☆45Updated 10 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆51Updated 11 years ago
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆47Updated 12 years ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆40Updated last year
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆63Updated 7 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆65Updated last year
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 10 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆125Updated 3 weeks ago
• cyfdecyf / google-concurrency-library
  Automatically exported from code.google.com/p/google-concurrency-library
  ☆14Updated 10 years ago
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆91Updated 2 years ago
• fast-pack / LittleIntPacker
  C library to pack and unpack short arrays of integers as fast as possible
  ☆91Updated 2 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago