performs a prefix search and returns all values mapped under the given prefix . the entirety of the prefix must be matches , if you only want part of the prefix to be matched use the #partialsearch string methodinstead . concode_field_sep Character singletonChildChar concode_elem_sep TrieNode<T> singletonChild concode_elem_sep T value concode_elem_sep TrieNode<T> root concode_elem_sep Map<Character,TrieNode<T>> children concode_field_sep void add concode_elem_sep TrieNode<T> moveToChild concode_elem_sep List<T> getValues concode_elem_sep TrieNode<T> moveToNode concode_elem_sep TrieNode<T> getChild concode_elem_sep T longestMatch concode_elem_sep boolean hasValue concode_elem_sep List<T> partialSearch concode_elem_sep void remove concode_elem_sep T getValue concode_elem_sep boolean contains concode_elem_sep boolean contains concode_elem_sep boolean contains concode_elem_sep TrieNode<T> find concode_elem_sep T get concode_elem_sep void setValue concode_elem_sep T shortestMatch
List < T > function ( String arg0 ) { TrieNode < T > loc0 = this . find ( arg0 ) ; if ( loc0 == null ) return new ArrayList < T > ( ) ; return Collections . unmodifiableList ( loc0 . getValues ( ) ) ; }