Lines Matching refs:TrieNode
51 public TrieNode getDomainSuffixes();
54 public TrieNode getSmileys();
57 public TrieNode getAcronyms();
293 TrieNode match = longestMatch(getResources().getSmileys(), this, nextChar,
316 TrieNode match = longestMatch(getResources().getAcronyms(), this, nextChar);
1338 public static class TrieNode {
1339 private final HashMap<Character,TrieNode> children =
1340 new HashMap<Character,TrieNode>();
1344 public TrieNode() { this(""); }
1345 public TrieNode(String text) {
1354 public TrieNode getChild(char ch) {
1358 public TrieNode getOrCreateChild(char ch) {
1360 TrieNode node = children.get(key);
1362 node = new TrieNode(text + String.valueOf(ch));
1369 public static void addToTrie(TrieNode root, String str, String value) {
1381 private static boolean matches(TrieNode root, String str) {
1398 private static TrieNode longestMatch(
1399 TrieNode root, AbstractMessageParser p, int start) {
1408 private static TrieNode longestMatch(
1409 TrieNode root, AbstractMessageParser p, int start, boolean smiley) {
1411 TrieNode bestMatch = null;