yhirose / cpp-fstlibLinks
A single file C++17 header-only Minimal Acyclic Subsequential Transducers, or Finite State Transducers
☆57Updated 2 years ago
Alternatives and similar repositories for cpp-fstlib
Users that are interested in cpp-fstlib are comparing it to the libraries listed below
Sorting:
- 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
- Async GRPC with C++20 coroutine support☆74Updated 2 years ago
- Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.☆37Updated last month
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- An intrusive lock-free multiple-producer, single-consumer queue in C++☆52Updated 8 years ago
- Embeddable C++17 Unicode library offering UTF encodings, general category info, simple and full casing, normalization forms, and combinin…☆78Updated 3 months ago
- A High-Performance JIT-Based C++ Expression/Script Execution Engine with SIMD Vectorization Support☆91Updated 3 weeks ago
- C++ implementation of a fast and memory efficient hash map and hash set specialized for strings☆178Updated 9 months ago
- Git mirror of the official (mercurial) repository of cpp-btree☆74Updated 10 years ago
- Comparison of C++ Serialization Libraries for Graph Data☆36Updated 3 years ago
- This project Orchid-Fst implements a fast text string dictionary search data structure: Finite state transducer (short for FST) in c++ la…☆15Updated last year
- Memory-mapped storage library☆76Updated 9 years ago
- Looking into the performance of heaps, starting with the Min-Max Heap☆67Updated 4 years ago
- Automatically exported from code.google.com/p/google-concurrency-library☆14Updated 9 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- Compile-time-efficient proof-of-concept implementation for std::tuple☆94Updated 3 years ago
- A benchmark of some prominent C/C++ hash table implementations☆37Updated 4 years ago
- Litesimd is a no overhead, header only, C++ library for SIMD processing, specialized on SIMD comparison and data shuffle.☆16Updated 6 years ago
- C++ implementation of Concise and WAH compressed bitsets☆20Updated 8 years ago
- C++14 cache friendly B-heap priority queue☆105Updated 4 years ago
- Succinct data structures in C/C++☆89Updated 9 months ago
- Efficient Prefix-Sum data structures in C++.☆26Updated last year
- fast prime sieve and hash algorithm☆38Updated last month
- Smart queue that executes tasks in threadpool-like manner☆40Updated last year
- Collection of header-only utilities for C++☆35Updated last year
- Trie is a lightweight and simple autocompletion data structure written in C++11.☆44Updated 10 years ago
- async io-uring based kernel io library☆31Updated 4 years ago
- Latency collector as an embedded library for C++☆13Updated 6 years ago
- Fast, shared, upgradeable, non-recursive and non-fair mutex☆31Updated 6 years ago
- C++ framework for rapid server development☆77Updated last year