A trie implementation in Delphi?

Question

Anyone knows a ready-to-use trie [sic] implementation in Delphi? An optimized trie would be even better.

Thanks in advance!

Tic

Do you mean tree instead of trie? Parent and Child relations? Any specific about the tree? What would you like to be optimized? You mean you want to be balanced? – Marsupial

@LarsTruijens: I suspect the OP really does mean a trie. – Wrinkle

Trie or prefix tree: en.wikipedia.org/wiki/Trie – Marsupial

See COSMIN's Answer here; #5297557 – Fecteau

@LarsTruijens, I really meant "trie". Basic Trie implementations take much more memory than hashtables, but there are scopes of optimization to solve this issue. Here's a JavaScript example: ejohn.org/blog/javascript-trie-performance-analysis – Tic

Answer 1

So far this seems to be the only choice. Good thing is it is generic.

Compact Generic Trie Dictionary

Tic

Answer 2

Try this one from softcomplete. Download link is at the bottom.

Haven't got any experience with it, just found it on Google when searching for Delphi "Trie". The quotes were needed, or else Google is so smart to change it to 'try', which is probably why you didn't find it yourself in the first place. Free tip. :)

Verbal