cedar - C++ implementation of efficiently-updatable double-array triecedar - C++ implementation of efficiently-updatable double-array trie About Cedar implements an updatable double-array trie [1,2,3], which offers fast update/lookup for skewed queries in real-world data, e.g., counting words in text or mining conjunctive features in a classifier. Its update and lookup speed is comparable to (hard-to-serialize) hash-based containers (std::unordered_map) or modern c
