Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
☆58Jan 27, 2023Updated 3 years ago
Alternatives and similar repositories for path_decomposed_tries
Users that are interested in path_decomposed_tries are comparing it to the libraries listed below
Sorting:
- A collection of succinct data structures☆213Jan 3, 2024Updated 2 years ago
- Implementation of the JSON semi-index described in the paper "Semi-Indexing Semi-Structured Data in Tiny Space"☆58Dec 7, 2012Updated 13 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆66May 29, 2024Updated last year
- Compressed double-array tries for static string dictionaries☆11May 9, 2019Updated 6 years ago
- A library of inverted index data structures☆151Dec 15, 2022Updated 3 years ago
- C++ Library implementing Compressed String Dictionaries☆46Apr 25, 2022Updated 3 years ago
- Compact Tree Representation☆16Mar 16, 2017Updated 8 years ago
- ☆27Mar 23, 2017Updated 8 years ago
- Morally-correct string and stream interpolation for Go.☆24Apr 23, 2016Updated 9 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Jan 31, 2015Updated 11 years ago
- a light weight, high performance coroutine implementation☆39Oct 16, 2012Updated 13 years ago
- Lock-free multithreaded memory allocation☆110Dec 14, 2016Updated 9 years ago
- Crit-bit tree (trie) library☆32Jun 8, 2014Updated 11 years ago
- Experiments with array layouts for comparison-based searching☆87Jan 5, 2024Updated 2 years ago
- Go implementation of skiplist, with search fingers☆33Oct 26, 2015Updated 10 years ago
- Bitmap Compression Library in Go☆52Nov 19, 2013Updated 12 years ago
- some code for testing nonius, hayai and celero lmicro benchmarking ibraries☆25May 8, 2017Updated 8 years ago
- finding set bits in large bitmaps☆15Nov 30, 2015Updated 10 years ago
- A sparse and compressed bitmap library.☆13Aug 28, 2014Updated 11 years ago
- Intermediate Compute Language with OpenCL/CUDA Backends☆20Oct 11, 2014Updated 11 years ago
- Companion source code for GTC 2014 talk☆11Mar 25, 2014Updated 11 years ago
- An experimental lexer and parser generator☆10Jul 31, 2018Updated 7 years ago
- Simple foliage renderer☆14Sep 3, 2015Updated 10 years ago
- A splaytree ADT written in C with a BSD license☆18Jun 18, 2020Updated 5 years ago
- Generates a Bezier Curve in euclidean or quaternion space with differentiable acceleration.☆15Apr 20, 2014Updated 11 years ago
- String map implementation through Fast Succinct Trie☆23Jul 9, 2021Updated 4 years ago
- A fast priority queue/tree/sort struct that supports operations in O(loglog u) time☆18Nov 28, 2017Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago
- 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 …☆26Apr 26, 2022Updated 3 years ago
- Implements a Min-Heap / Priority Queue in C using an indirection table for memory efficiency.☆29Aug 26, 2014Updated 11 years ago
- A blend of the compact and sparse hash table implementations.☆15Aug 20, 2021Updated 4 years ago
- An encoder/decoder collection for a sequence of integers☆32Mar 10, 2013Updated 12 years ago
- import of nvidia-texture-tools from Google Code☆22May 23, 2013Updated 12 years ago
- Regular Expression Research☆11Jul 6, 2022Updated 3 years ago
- Antialiasing algorithm☆13Jun 10, 2016Updated 9 years ago
- Marching cube on the GPU☆10Oct 1, 2012Updated 13 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Jan 8, 2023Updated 3 years ago
- Succinct Data Structure Library☆109Sep 26, 2013Updated 12 years ago
- Generates benchmark data for two different data structures, then renders some graphs.☆112Sep 4, 2019Updated 6 years ago