Paul Meng

`cedar` is a really fast implementation of double array trie, it resolves the slow insertion issue. * http://www.tkl.iis.u-tokyo.ac.jp/~ynaga/cedar/ * http://www.tkl.iis.u-tokyo.ac.jp/~ynaga/papers/ynaga-coling2014.pdf

* Not sure the benefit, tradeoff. My hunch is the performance would be better, but not so sure.

https://linux.thai.net/~thep/datrie/#Suffix

There are duplicates in both of the impl.

* Library candidate: https://docs.rs/flatbuffers/0.6.0/flatbuffers/ Related issue: https://github.com/andelf/rust-darts/issues/21 cc @messense

Now it is hard coded with two items in a page. This restriction should be corrected.