Alternatives and similar repositories for orchid-fst

Users that are interested in orchid-fst are comparing it to the libraries listed below

• yhirose / cpp-fstlib
  A single file C++17 header-only Minimal Acyclic Subsequential Transducers, or Finite State Transducers
  ☆59Updated 3 years ago
• Kronuz / cpp-btree
  Modern C++ B-tree containers
  ☆276Updated 2 years ago
• bytedance / terark-zip
  A data structure and algorithm library built for TerarkDB
  ☆67Updated 3 years ago
• ytakano / radix_tree
  STL like container of radix tree (a.k.a. PATRICIA trie) in C++
  ☆142Updated 2 years ago
• greensky00 / latency-collector
  Latency collector as an embedded library for C++
  ☆13Updated 6 years ago
• greensky00 / skiplist
  Generic lock-free Skiplist container pure C implementation, STL-style set, map
  ☆148Updated 5 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 4 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆63Updated 7 years ago
• kshk123 / hashMap
  A concurrent thread-safe hash map implemented in C++
  ☆149Updated 2 years ago
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆183Updated last month
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆288Updated 3 months ago
• JGRennison / cpp-btree
  Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.
  ☆37Updated 3 weeks ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆167Updated 3 weeks ago
• taskflow / work-stealing-queue
  A fast work-stealing queue template in C++
  ☆327Updated last year
• Tessil / sparse-map
  C++ implementation of a memory efficient hash map and hash set
  ☆366Updated last month
• fast-pack / FrameOfReference
  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
• kephir4eg / trie
  C++ implementation of Radix tree
  ☆66Updated 6 years ago
• martinus / map_benchmark
  Comprehensive benchmarks of C++ maps
  ☆316Updated 2 years ago
• tstarling / thread-safe-lru
  A C++ template class providing a thread-safe LRU cache
  ☆77Updated 3 years ago
• jaypipes / sqltoast
  A SQL parser written in C++
  ☆32Updated 4 years ago
• Tessil / hat-trie
  C++ implementation of a fast and memory efficient HAT-trie
  ☆849Updated last month
• datatechnology / cornerstone
  C++ implementation of raft consensus
  ☆270Updated 2 years ago
• rigtorp / TokenBucket
  Lock-free implementation of the token bucket algorithm in C++
  ☆61Updated 2 years ago
• mohaps / lrucache11
  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 …
  ☆298Updated last year
• diegocaro / cpp-btree
  A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/
  ☆87Updated 11 years ago
• izenecloud / izenelib
  General purpose C++ library for iZENECloud
  ☆43Updated 10 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆215Updated 2 years ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• mfycheng / ratelimiter
  A C++ Rate limiter implementation.
  ☆56Updated 10 years ago