☆27Mar 23, 2017Updated 8 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:
- ☆11Apr 19, 2018Updated 7 years ago
- Succinct Data Structure of Trie, written in Go☆42Sep 26, 2021Updated 4 years ago
- A sparse and compressed bitmap library.☆13Aug 28, 2014Updated 11 years ago
- ☆11Oct 18, 2017Updated 8 years ago
- Go implementation of MurmurHash3☆13Jun 3, 2013Updated 12 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆58Jan 27, 2023Updated 3 years ago
- Golang Counting Bloom Filter Implementation☆12Feb 26, 2014Updated 12 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 3 years ago
- Automatically exported from code.google.com/p/tx-trie☆29Jun 23, 2015Updated 10 years ago
- First Practical and General-purpose Range Filter☆551Mar 11, 2022Updated 3 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Nov 10, 2021Updated 4 years ago
- A lock-free pool-based allocator using C++11 facilities☆15Mar 21, 2015Updated 10 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14May 11, 2018Updated 7 years ago
- Succinct data structures in C/C++☆94Oct 7, 2024Updated last year
- github.com/cznic/fileutil has moved to modernc.org/fileutil☆15Nov 22, 2018Updated 7 years ago
- Compact Tree Representation☆16Mar 16, 2017Updated 8 years ago
- A Go library for space-efficient rank/select operations for both sparse and dense bit arrays.☆38Jul 24, 2020Updated 5 years ago
- Lightweight Msgpack Encoder☆15Feb 19, 2017Updated 9 years ago
- ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.☆24May 4, 2015Updated 10 years ago
- benchmarking positional population count☆17Oct 19, 2025Updated 4 months ago
- Space efficient (graph) algorithms☆18Sep 10, 2020Updated 5 years ago
- Tiny Linux Kernel Project； 本项目作者发布了《360° 剖析 Linux ELF》视频课程，欢迎订阅：https://www.cctalk.com/m/group/88089283☆16Jun 24, 2015Updated 10 years ago
- Regular Expression Pattern Analyzer☆17Aug 9, 2023Updated 2 years ago
- Go ("golang") library to implement writev() syscall and friends (please use https://github.com/google/vectorio instead)☆16Jan 6, 2016Updated 10 years ago
- a asymmetric coroutine (lua like) with fixed-size stack☆16Feb 27, 2015Updated 11 years ago
- ☆19Mar 13, 2016Updated 9 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Jan 29, 2020Updated 6 years ago
- Feed-forward Bloom filters☆53Jun 7, 2011Updated 14 years ago
- Minimal pub/sub message queue in C.☆23Nov 9, 2014Updated 11 years ago
- A high-performance, memory-efficient concurrent hash table☆36Oct 5, 2013Updated 12 years ago
- Crit-bit tree (trie) library☆32Jun 8, 2014Updated 11 years ago
- A light weight, low level embedded key-value database library☆32Jul 8, 2013Updated 12 years ago
- High performance multithreading toolkit for C++17☆46Oct 28, 2025Updated 4 months ago
- Package mafsa implements Minimal Acyclic Finite State Automata in Go, essentially a high-speed, memory-efficient, Unicode-friendly set of…☆295Jun 3, 2019Updated 6 years ago
- Single-header-file, public domain, type-generic C89 skip list implemementation☆31May 27, 2017Updated 8 years ago
- Tools for safe management of persistent main memory.☆28Nov 3, 2013Updated 12 years ago
- ☆20Nov 17, 2015Updated 10 years ago
- Simulation code for the LHD cache replacement policy as published in NSDI 2018.☆25Jul 23, 2018Updated 7 years ago