Efficient and effective query auto-completion in C++.
☆56Sep 24, 2023Updated 2 years ago
Alternatives and similar repositories for autocomplete
Users that are interested in autocomplete are comparing it to the libraries listed below
Sorting:
- ⚙️🛠️ Essential C++ utilities.☆14Mar 9, 2026Updated last week
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Nov 10, 2021Updated 4 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 3 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Jan 8, 2023Updated 3 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆94Updated this week
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 years ago
- Defining Excel styles with HTML and CSS. It's a templated language, as same as HTML☆14Jun 29, 2022Updated 3 years ago
- Official repository of the ACM SIGIR 2019 paper: "Fast Approximate Filtering of Search Results Sorted by Attribute" by Franco Maria Nardi…☆14Nov 7, 2019Updated 6 years ago
- Rust library providing fast language model queries in compressed space☆25Oct 1, 2022Updated 3 years ago
- A self-contained, header-only, implementation of memory-mapped files in C++ for fast integration into larger projects.☆27Aug 22, 2024Updated last year
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated 8 months ago
- Fast compressed trie dictionary library☆72Sep 20, 2024Updated last year
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 7 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Feb 15, 2022Updated 4 years ago
- A C++ library to benchmark inverted indexes.☆21Aug 4, 2020Updated 5 years ago
- A flexible variational inference LDA library.☆23Mar 15, 2019Updated 7 years ago
- Command line parser for C++17.☆29Dec 10, 2024Updated last year
- String map implementation through Fast Succinct Trie☆23Jul 9, 2021Updated 4 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆58Jan 27, 2023Updated 3 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆68May 31, 2023Updated 2 years ago
- Word unscrambling game.☆14Feb 10, 2026Updated last month
- Generalized enhanced suffix array construction in external memory [CPM'13, AMB 2017]☆17Aug 9, 2021Updated 4 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago
- ☆39Jun 20, 2020Updated 5 years ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Dec 20, 2022Updated 3 years ago
- A cheatsheet for most common Stringology tasks☆14Apr 14, 2021Updated 4 years ago
- Implementation of a Backpack Quotient Filter☆13Jul 7, 2025Updated 8 months ago
- VTEnc C library☆37Dec 1, 2022Updated 3 years ago
- A library of inverted index data structures☆151Dec 15, 2022Updated 3 years ago
- Method to measure the amount of allocated memory of a program at run-time.☆70Apr 4, 2022Updated 3 years ago
- A collection of succinct data structures☆213Jan 3, 2024Updated 2 years ago
- Concurrent (with OLC) Adaptive Radix Trie in Golang.☆11Jul 31, 2020Updated 5 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Sep 4, 2024Updated last year
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆252Mar 9, 2026Updated last week
- Basic Sudoku game.☆16Feb 10, 2026Updated last month
- ☆14Aug 26, 2016Updated 9 years ago
- A comparative, extendable benchmarking suite for C and C++ hash-table libraries.☆44Jun 1, 2024Updated last year
- Official repository of "Efficient and Effective Query Expansion for Web Search", Short Paper @ CIKM 2018☆15Nov 17, 2019Updated 6 years ago
- Succinct data structures in C/C++☆94Oct 7, 2024Updated last year