apollo008 / orchid-fstLinks
This project Orchid-Fst implements a fast text string dictionary search data structure: Finite state transducer (short for FST) in c++ language.This FST C++ open source project has much significant advantages.
☆15Updated last year
Alternatives and similar repositories for orchid-fst
Users that are interested in orchid-fst are comparing it to the libraries listed below
Sorting:
- A single file C++17 header-only Minimal Acyclic Subsequential Transducers, or Finite State Transducers☆57Updated 2 years ago
- STL like container of radix tree (a.k.a. PATRICIA trie) in C++☆142Updated 2 years ago
- Modern C++ B-tree containers☆275Updated 2 years ago
- W-TinyLFU cache C++11 header only implementation☆63Updated 6 years ago
- Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.☆37Updated 2 months ago
- C++ implementation of a fast and memory efficient hash map and hash set specialized for strings☆180Updated 11 months ago
- A concurrent thread-safe hash map implemented in C++☆145Updated 2 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- Latency collector as an embedded library for C++☆13Updated 6 years ago
- Generic lock-free Skiplist container pure C implementation, STL-style set, map☆149Updated 5 years ago
- A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/☆87Updated 11 years ago
- A header only C++11 LRU Cache template class that allows you to define key, value and optionally the Map type. uses a double linked list …☆297Updated 11 months ago
- A C++ template class providing a thread-safe LRU cache☆76Updated 3 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- A benchmark of some prominent C/C++ hash table implementations☆37Updated 4 years ago
- Lock-free implementation of the token bucket algorithm in C++☆59Updated 2 years ago
- Git mirror of the official (mercurial) repository of cpp-btree☆76Updated 11 years ago
- A data structure and algorithm library built for TerarkDB☆67Updated 3 years ago
- C++ implementation of a fast and memory efficient HAT-trie☆833Updated 11 months ago
- Key/Value NoSQL database that utilize LSM trees☆40Updated this week
- 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
- C++ implementation of raft consensus☆266Updated 2 years ago
- TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers☆418Updated 7 months ago
- Comprehensive benchmarks of C++ maps☆311Updated 2 years ago
- An open addressing linear probing hash table, tuned for delete heavy workloads☆209Updated last year
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- Effective Memory Reclamation☆58Updated 5 years ago
- Fast Approximate Membership Filters (C++)☆281Updated last week
- An intrusive lock-free multiple-producer, single-consumer queue in C++☆52Updated 8 years ago
- C++ framework for rapid server development☆76Updated last year