Permalink
Cannot retrieve contributors at this time
Name already in use
A tag already exists with the provided branch name. Many Git commands accept both tag and branch names, so creating this branch may cause unexpected behavior. Are you sure you want to create this branch?
2015OmegaT/OmegaT/src/org/omegat/core/dictionaries/Trie.java
Go to fileThis commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
76 lines (62 sloc)
1.87 KB
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package org.omegat.core.dictionaries; | |
import java.util.HashMap; | |
import java.util.Map; | |
/* | |
* Class for Trie tree | |
* Java does not contain a Trie tree implementation in its libraries so this particular | |
* model was taken from: http://www.programcreek.com/2014/05/leetcode-implement-trie-prefix-tree-java/ | |
*/ | |
public class Trie { | |
private TrieNode root; | |
public Trie() { | |
root = new TrieNode(); | |
} | |
// Inserts a word into the trie. | |
public void insert(String word) { | |
HashMap<Character, TrieNode> children = root.children; | |
for(int i=0; i<word.length(); i++){ | |
char c = word.charAt(i); | |
TrieNode t; | |
if(children.containsKey(c)){ | |
t = children.get(c); | |
}else{ | |
t = new TrieNode(c); | |
children.put(c, t); | |
} | |
children = t.children; | |
//set leaf node | |
if(i==word.length()-1) | |
t.isLeaf = true; | |
} | |
} | |
// Returns if the word is in the trie. | |
public boolean search(String word) { | |
TrieNode t = searchNode(word); | |
if(t != null && t.isLeaf) | |
return true; | |
else | |
return false; | |
} | |
// Returns if there is any word in the trie | |
// that starts with the given prefix. | |
public boolean startsWith(String prefix) { | |
if(searchNode(prefix) == null) | |
return false; | |
else | |
return true; | |
} | |
public TrieNode searchNode(String str){ | |
Map<Character, TrieNode> children = root.children; | |
TrieNode t = null; | |
for(int i=0; i<str.length(); i++){ | |
char c = str.charAt(i); | |
if(children.containsKey(c)){ | |
t = children.get(c); | |
children = t.children; | |
}else{ | |
return null; | |
} | |
} | |
return t; | |
} | |
} |