import gnu.trove.map.hash.TCharObjectHashMap; //导入依赖的package包/类
/**
 * Private internal method to recursively add the wordPart to the trie structure
 * 
 * @param wordPart Word part to be added to the trie
 */
private int addInternal(TrieNode node, String wordPart, boolean isFullWord, int cost) {
	cost += 1;
	// LOGGER.debugprintln("\t\t" + this.getClass().getSimpleName() +
	// ": adding wordPart: " + wordPart + ", currentCost: " + cost);

	int length = wordPart.length();
	node.children = (node.children != null) ? node.children : new TCharObjectHashMap<TrieNode>(1, 0.9f);

	char c = getChar(wordPart);
	TrieNode child = node.children.get(c);

	if (child == null) {
		child = new TrieNode(c);
		node.children.put(c, child);
	}

	if (length == 1) { // This is the end of the string and not on the root
						// node, add a child marker to denote end of suffix
		child.isEnd = true;
		child.isFullWordEnd = child.isFullWordEnd || isFullWord;
	} else {
		String subString = getSubstring(wordPart);

		cost += addInternal(child, subString, isFullWord, cost);

		if (createFullTrie && node.isRootNode()) { // full tree and root node
			cost += addInternal(node, subString, false, cost);
		}
	}
	return cost;
}
 

import gnu.trove.map.hash.TCharObjectHashMap; //导入依赖的package包/类
/**
 * Creates new instance of {@link CharHashMapTrieNode}.
 */
public CharHashMapTrieNode() {
    next = new TCharObjectHashMap<CharHashMapTrieNode<T>>();
}
 

import gnu.trove.map.hash.TCharObjectHashMap; //导入依赖的package包/类
public <V> Map<Character, V> createMap() {
	return new TCharObjectMapDecorator<V>(new TCharObjectHashMap<V>(0));
}