Lines Matching refs:trie
218 triedrop(disc, e->re.trie.root[i]);
622 if ((env->stats.m += e->re.trie.min) < cm)
625 if ((env->stats.n += e->re.trie.max) < cn)
628 if (!env->stats.y || env->stats.y->re.trie.min < e->re.trie.min)
1942 if (!(t = g->re.trie.root[*s]) && !(t = g->re.trie.root[*s] = trienode(env, *s)))
1962 if (g->re.trie.min > len)
1963 g->re.trie.min = len;
1964 if (g->re.trie.max < len)
1965 g->re.trie.max = len;
1971 * trie() tries to combine nontrivial e and f into a REX_TRIE
1977 trie(Cenv_t* env, Rex_t* e, Rex_t* f)
1987 g->re.trie.min = INT_MAX;
2920 if (!cond && (g = trie(env, e, f)))
2976 * set up BM table from trie
3029 if ((t = env->stats.y) && t->re.trie.min < 3)
3033 if (x->re.string.size >= t->re.trie.min)
3057 n = t->re.trie.min;
3058 m = t->re.trie.max;
3097 if (t->re.trie.root[i])
3098 m = bmtrie(env, a, v, t->re.trie.root[i], n, 0, m);
3503 if (!(g = trie(&env, f, e)))
3546 p->env->min = g->re.trie.min;