node = node.getOrCreateNextNode( character );
}
if (node.getValue() != null)
{
throw new TrieKeyAlreadyExistsException(key);
}
node.setValue(value, matchPattern);
trieLookup.put(key, node);
readAheadLimit = Math.max(readAheadLimit, key.length() + 1);