Thibaut Goetghebuer-Planchon

> I'm quite surprised by the amount of code it took to add this, i was expecting a lot less lines to be honest :) The problem is if part...

Sorry forgot something, could you try again with the latest commit? I'll see to test it a bit more when I have more time.

Hi, I did some quick tests on my side using the Wikipedia title dataset used in the README.md using "/home/tessil/" as pefix. Results: * insert: 5208 ms * insert_with_prefix: 4480...

EDIT: Yes, I could try to support other char types. I have plans to support `wchar_t`, `char16_t` and `char32_t` so I could also support `QChar` which use UTF-16, but I...

Sorry for the late reply. It's effectively due to the usage of `std::vector` in the [array-hash](https://github.com/Tessil/array-hash) project. I have to check if I could swap it with a `std::deque`. I...

It should be possible to adapt the `longest_prefix` method into a new one that return all the encountered prefixes instead of just the longest one. It may take some time...

Not sure why you'd use a trie for a LRU cache? Could you detail your use case?

Hi, It would be possible to optimize this by skipping whole prefix branches. If you currently are on a branch where every key has the prefix 'foo' and the another...

I plan to extend the API of the iterator but it may take time before I start to work on it, 2 to 3 months, as I'm currently on holiday...

Hi, Effectively I didn't really optimize the size of the iterators. It could be possible to reduce its size a bit but not by much I think. Introducing a way...