kampersanda / fast_succinct_trieLinks
String map implementation through Fast Succinct Trie
☆21Updated 4 years ago
Alternatives and similar repositories for fast_succinct_trie
Users that are interested in fast_succinct_trie are comparing it to the libraries listed below
Sorting:
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- A C++ library for integer array compression☆29Updated 3 years ago
- For details, see the blog post:☆32Updated last year
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- DSL for SIMD Sorting on AVX2 & AVX512☆31Updated 6 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆54Updated last year
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- W-TinyLFU cache C++11 header only implementation☆62Updated 6 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆46Updated 11 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆54Updated 5 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Concurrent trie-hash map library☆92Updated last year
- benchmarking positional population count☆15Updated last year
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- ☆16Updated 11 years ago
- A more Pragmatic Implementation of the Lock-free, Ordered, Linked List☆17Updated 4 years ago
- C library to pack and unpack short arrays of integers as fast as possible☆90Updated 2 years ago
- Succinct data structures in C/C++☆89Updated 9 months ago
- Library for lock-free locks☆82Updated 2 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 5 months ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago