Lines Matching defs:mTrie
69 private char[] mTrie;
132 int here = mTrie[TRIE_ROOT];
137 for (; here != TRIE_NULL; here = mTrie[here + TRIE_NEXT]) {
138 if (c == mTrie[here + TRIE_C]) {
140 && (mTrie[here + TRIE_OFF] != TRIE_NULL)) {
141 int off = mTrie[here + TRIE_OFF];
147 here = mTrie[here + TRIE_CHILD];
164 mTrie = new char[DEFAULT];
165 mTrie[TRIE_ROOT] = TRIE_NULL;
221 for (; mTrie[herep] != TRIE_NULL;
222 herep = mTrie[herep] + TRIE_NEXT) {
223 if (c == mTrie[mTrie[herep] + TRIE_C]) {
228 mTrie[mTrie[herep] + TRIE_OFF] = off;
235 herep = mTrie[herep] + TRIE_CHILD;
245 mTrie[herep] = node;
247 mTrie[mTrie[herep] + TRIE_C] = c;
248 mTrie[mTrie[herep] + TRIE_OFF] = TRIE_NULL;
249 mTrie[mTrie[herep] + TRIE_NEXT] = TRIE_NULL;
250 mTrie[mTrie[herep] + TRIE_CHILD] = TRIE_NULL;
255 mTrie[mTrie[herep] + TRIE_OFF] = off;
261 herep = mTrie[herep] + TRIE_CHILD;
267 if (mTrieUsed + TRIE_SIZEOF > mTrie.length) {
268 char[] copy = new char[mTrie.length + INCREMENT];
269 System.arraycopy(mTrie, 0, copy, 0, mTrie.length);
270 mTrie = copy;
