## Trie implementation

Copyright (c) 2016 Robin Luiten

An implementation of a Trie data structure.

A Trie is an ordered tree data structure that is used to store a dynamic
set or associative array where the keys are usually strings.

In this implementation the keys are strings.

To execute tests run TestRunner.elm in tests folder via elm-reacator or
on windows you can run test.cmd to run tests under node.

To see tests look at TrieTest.elm and TrieCodecTests.elm in tests folder.

As of Sunday 2015/12/27 Json encoder and decoder have been added to this package.

To improve Encoder and Decoer parts of data model have changed.
Have also removed exposing the Constructors of Trie, they were accidently exposed
previously, hope this is not a big problem for anyone, it was intended to be
an opaque type.