r-lyeh-archived / trieLinks
Trie is a lightweight and simple autocompletion data structure written in C++11.
☆45Updated 10 years ago
Alternatives and similar repositories for trie
Users that are interested in trie are comparing it to the libraries listed below
Sorting:
- a header only C++ LRU Cache template class (now with optional synchronization) that allows you to define key, value and optionally the Ma…☆41Updated 9 years ago
- C++ implementation of concurrent Binary Search Trees☆72Updated 10 years ago
- A fastest, exception-safety and pure C++17 thread pool.☆132Updated 6 years ago
- A fast and flexible c++ template class for tree data structures☆110Updated last month
- C++ Library of Atomic and Lockless Data Structures☆38Updated 5 years ago
- Thread pool using std::* primitives from C++20, with optional priority queue/greenthreading for POSIX.☆85Updated 3 years ago
- An intrusive lock-free multiple-producer, single-consumer queue in C++☆52Updated 9 years ago
- A C++ 14 implementation of graph data structures☆34Updated 8 years ago
- STL-based caches for C++☆116Updated 2 years ago
- fast prime sieve and hash algorithm☆38Updated last month
- Heap allocation free version of C++11 std::function☆57Updated 4 years ago
- Lock-free concurrent work stealing deque in C++☆40Updated 7 years ago
- C++14 cache friendly B-heap priority queue☆106Updated 3 weeks ago
- A persistent hash array-mapped trie for C++☆91Updated 2 years ago
- ID, a compile-time string hasher and sequential ID generator (C++11)☆29Updated 10 years ago
- C++ implementation of a fast and memory efficient hash map and hash set specialized for strings☆183Updated last year
- A lightweight LRU cache structure for list<T> and map<K,V> containers. Written in C++11☆28Updated 10 years ago
- A prototype implementation of the executors proposal☆85Updated 6 years ago
- A feature complete LRU cache implementation in C++☆257Updated 5 years ago
- Lightweight approach to expressing task stealing and balanced parallelism in a C++ programs.☆73Updated 9 years ago
- Compile-time-efficient proof-of-concept implementation for std::tuple☆94Updated 4 years ago
- Use functors, lambdas and std::chrono to schedule tasks in the near future☆93Updated 4 years ago
- High performance multithreading toolkit for C++17☆47Updated 2 months ago
- A lightweight (3 file, single function) library for running micro-benchmarks on C++ code☆84Updated 9 years ago
- Yet another web framework—this time in modern C++!☆101Updated 2 years ago
- Cleaned up version of <https://bitbucket.org/martinhofernandes/wheels/>☆27Updated 9 years ago
- Provides run-time tuple element access☆15Updated 4 years ago
- Replaced by foonathan/lexy☆138Updated 4 years ago
- Small Hash Optimization - an optimization for when you have many small hash maps - similar to LLVM's small vector optimization.☆39Updated 8 years ago
- Boost.Coroutine☆85Updated last month