[Haskell-cafe] Re: PrefixMap is a Trie

David F.Place wrote:

The PrefixMap datastructure implements a Prefix Tree which allows a key/value relationship.

\begin{code}

data PrefixMap k v = Node (Maybe v) (Map.Map k (PrefixMap k v)) deriving (Show) \end{code}

You may compare your code with Keith's implemenation of a Trie. http://article.gmane.org/gmane.comp.lang.haskell.libraries/2571 Find attached a modified version (that I never tested, though). Christian