r-lyeh-archived / trieLinks
Trie is a lightweight and simple autocompletion data structure written in C++11.
☆46Updated 10 years ago
Alternatives and similar repositories for trie
Users that are interested in trie are comparing it to the libraries listed below
Sorting:
- Thread pool using std::* primitives from C++20, with optional priority queue/greenthreading for POSIX.☆85Updated 3 years ago
- 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
- A feature complete LRU cache implementation in C++☆262Updated 6 years ago
- STL-based caches for C++☆116Updated 2 years ago
- A fastest, exception-safety and pure C++17 thread pool.☆134Updated 6 years ago
- C++14 cache friendly B-heap priority queue☆109Updated 3 months ago
- C++ implementation of concurrent Binary Search Trees☆72Updated 10 years ago
- C++ implementation of a fast and memory efficient hash map and hash set specialized for strings☆184Updated 2 months ago
- ⏱️ Single-header C++11 RDTSCP clock and timing utilities released into the public domain.☆110Updated 6 years ago
- ID, a compile-time string hasher and sequential ID generator (C++11)☆29Updated 10 years ago
- An intrusive lock-free multiple-producer, single-consumer queue in C++☆52Updated 9 years ago
- Lightweight approach to expressing task stealing and balanced parallelism in a C++ programs.☆74Updated 10 years ago
- A prototype implementation of the executors proposal☆86Updated 6 years ago
- A fast and flexible c++ template class for tree data structures☆114Updated 4 months ago
- High performance multithreading toolkit for C++17☆47Updated 2 months ago
- Use functors, lambdas and std::chrono to schedule tasks in the near future☆93Updated 4 years ago
- A C++ 14 implementation of graph data structures☆34Updated 9 years ago
- A C++ header-only support for serialization of generic objects to be used when the type is known a-priori.☆52Updated 12 years ago
- An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!☆130Updated 2 years ago
- Cleaned up version of <https://bitbucket.org/martinhofernandes/wheels/>☆27Updated 9 years ago
- Heap allocation free version of C++11 std::function☆59Updated 4 years ago
- Yet another web framework—this time in modern C++!☆102Updated 3 years ago
- Header only C++14 micro benchmark☆14Updated 10 years ago
- A lightweight LRU cache structure for list<T> and map<K,V> containers. Written in C++11☆28Updated 10 years ago
- A lightweight (3 file, single function) library for running micro-benchmarks on C++ code☆84Updated 10 years ago
- Component-Model Framework in C++☆44Updated 10 years ago
- Automatically exported from code.google.com/p/google-concurrency-library☆14Updated 10 years ago
- fast prime sieve and hash algorithm☆39Updated 4 months ago
- C++ String Toolkit Library https://www.partow.net/programming/strtk/index.html☆143Updated 5 years ago
- Lock-free concurrent work stealing deque in C++☆40Updated 7 years ago