This is a C++ implementation of efficiently-updatable double-array trie, developed by Naoki Yoshinaga at Kitsuregawa, Toyoda Lab., IIS, University of Tokyo.

If you make use of cedar for research or commercial purposes, the reference will be:

N. Yoshinaga and M. Kitsuregawa. A Self-adaptive Classifier for Efficient Text-stream Processing. Proc. COLING 2014, 2014.

I have done below modifications to the code

1. Efficient reset method to reset the trie without reallocating the memory
2. Additional CommonPrefixSearch() based on sentinel (without the need for computing the string length)

BSD (see License file)

Additionally the original code is also vailable under GPL/LGPL terms at the website location given below.

Naoki Yoshinaga at Kitsuregawa, Toyoda Lab., IIS, University of Tokyo

Website: http://www.tkl.iis.u-tokyo.ac.jp/~ynaga/cedar