Re: Trie implementation

Keith Wansbrough writes:

Hi... I was writing some code yesterday to walk over a directory tree, and needed a Trie. Not seeing one around, I wrote a basic implementation of the functions I needed (attached below).

Has anyone else done this? Should I polish it up and offer it for inclusion in Data?

I have a Trie implementation with a different, and even simpler, interface. The only operation is 'match' for search/insertion, and it does not store values at the nodes (although the latter restriction could be easily lifted). Regards, Malcolm