apollo008 / orchid-fst

Related projects ⓘ

Alternatives and complementary repositories for orchid-fst

• yhirose / cpp-fstlib
  A single file C++17 header-only Minimal Acyclic Subsequential Transducers, or Finite State Transducers
  ☆54Updated 2 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 7 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆55Updated 6 years ago
• mpictor / judy-template
  An implementation of the Judy array, wrapped in a c++ template. Uses Karl Malbrain's implementation, http://code.google.com/p/judyarray/ …
  ☆42Updated 9 years ago
• ytakano / radix_tree
  STL like container of radix tree (a.k.a. PATRICIA trie) in C++
  ☆139Updated last year
• KevinStern / index-cpp
  C++ implementations of indexing mechanisms, including a Hilbert-curve geohash based spatial index and a linear hashing table, for disk or…
  ☆73Updated 3 years ago
• greensky00 / latency-collector
  Latency collector as an embedded library for C++
  ☆13Updated 5 years ago
• bytedance / terark-zip
  A data structure and algorithm library built for TerarkDB
  ☆62Updated 2 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆130Updated 2 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆151Updated 8 months ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆57Updated 2 years ago
• kampersanda / xcdat
  Fast compressed trie dictionary library
  ☆64Updated 2 months ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 3 years ago
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆107Updated 8 months ago
• thomasmoelhave / tpie
  Templated Portable I/O Environment
  ☆112Updated this week
• JGRennison / cpp-btree
  Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.
  ☆35Updated 2 weeks ago
• izenecloud / izenelib
  General purpose C++ library for iZENECloud
  ☆42Updated 9 years ago
• lemire / dictionary
  High-performance dictionary coding
  ☆103Updated 7 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆40Updated 4 years ago
• lemire / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆50Updated 9 months ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆50Updated 6 years ago
• andybbruno / TSXor
  TSXor: A Simple Time Series Compression Algorithm
  ☆51Updated last year
• rigtorp / TokenBucket
  Lock-free implementation of the token bucket algorithm in C++
  ☆55Updated last year
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆214Updated last year
• alasdairmackintosh / google-concurrency-library
  Automatically exported from code.google.com/p/google-concurrency-library
  ☆35Updated 8 years ago
• greensky00 / skiplist
  Generic lock-free Skiplist container pure C implementation, STL-style set, map
  ☆142Updated 4 years ago
• datatechnology / cornerstone
  C++ implementation of raft consensus
  ☆264Updated last year
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆263Updated 10 months ago
• MorphStore / TVLLib
  Template Vector Library
  ☆18Updated 3 years ago