A Trie string lookup data structure using a tree <p> This implementation is always case insensitive and is optimal for a variable number of fixed strings with few special characters. </p> <p> This Trie is stored in a Tree and is unlimited in capacity </p> <p> <p> This Trie is not Threadsafe and contains no mutual exclusion or deliberate memory barriers. It is intended for an ArrayTrie to be built by a single thread and then used concurrently by multiple threads and not mutated during that access. If concurrent mutations of the Trie is required external locks need to be applied. </p>