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
  ☆60Updated 3 years ago
• ytakano / radix_tree
  STL like container of radix tree (a.k.a. PATRICIA trie) in C++
  ☆141Updated 3 years ago
• Kronuz / cpp-btree
  Modern C++ B-tree containers
  ☆280Updated 2 years ago
• Tessil / hat-trie
  C++ implementation of a fast and memory efficient HAT-trie
  ☆852Updated 2 months ago
• greensky00 / skiplist
  Generic lock-free Skiplist container pure C implementation, STL-style set, map
  ☆150Updated 6 years ago
• Tessil / array-hash
  C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
  ☆185Updated 2 months ago
• Tessil / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆37Updated 5 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆288Updated 5 months ago
• kephir4eg / trie
  C++ implementation of Radix tree
  ☆67Updated 6 years ago
• ArashPartow / bloom
  C++ Bloom Filter Library https://www.partow.net/programming/bloomfilter/index.html
  ☆146Updated 5 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 4 years ago
• datatechnology / cornerstone
  C++ implementation of raft consensus
  ☆272Updated 2 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 years ago
• greensky00 / latency-collector
  Latency collector as an embedded library for C++
  ☆13Updated 6 years ago
• mpoeter / xenium
  A C++ library providing various concurrent data structures and reclamation schemes.
  ☆632Updated 5 months ago
• martinus / map_benchmark
  Comprehensive benchmarks of C++ maps
  ☆316Updated 2 years ago
• JGRennison / cpp-btree
  Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.
  ☆37Updated last month
• bytedance / terark-zip
  A data structure and algorithm library built for TerarkDB
  ☆67Updated 3 years ago
• fast-pack / SIMDCompressionAndIntersection
  A C++ library to compress and intersect sorted lists of integers using SIMD instructions
  ☆443Updated 6 months 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
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆170Updated 2 months ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• tlx / tlx
  TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers
  ☆444Updated last year
• diegocaro / cpp-btree
  A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/
  ☆87Updated 11 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆215Updated 2 years ago
• rigtorp / TokenBucket
  Lock-free implementation of the token bucket algorithm in C++
  ☆62Updated 2 years ago
• Tessil / sparse-map
  C++ implementation of a memory efficient hash map and hash set
  ☆366Updated 2 months ago
• CarterLi / liburing4cpp
  Modern C++ binding for liburing (io_uring) that features C++ coroutines support
  ☆338Updated last year
• cjgdev / aho_corasick
  A C++ implementation of the aho corasick pattern search algorithm
  ☆232Updated last year