Lines Matching defs:trie
209 triedrop(disc, e->re.trie.root[i]);
613 if ((env->stats.m += e->re.trie.min) < cm)
616 if ((env->stats.n += e->re.trie.max) < cn)
619 if (!env->stats.y || env->stats.y->re.trie.min < e->re.trie.min)
1919 if (!(t = g->re.trie.root[*s]) && !(t = g->re.trie.root[*s] = trienode(env, *s)))
1939 if (g->re.trie.min > len)
1940 g->re.trie.min = len;
1941 if (g->re.trie.max < len)
1942 g->re.trie.max = len;
1948 * trie() tries to combine nontrivial e and f into a REX_TRIE
1954 trie(Cenv_t* env, Rex_t* e, Rex_t* f)
1964 g->re.trie.min = INT_MAX;
2869 if (!cond && (g = trie(env, e, f)))
2925 * set up BM table from trie
2978 if ((t = env->stats.y) && t->re.trie.min < 3)
2982 if (x->re.string.size >= t->re.trie.min)
3006 n = t->re.trie.min;
3007 m = t->re.trie.max;
3046 if (t->re.trie.root[i])
3047 m = bmtrie(env, a, v, t->re.trie.root[i], n, 0, m);
3458 if (!(g = trie(&env, f, e)))
3501 p->env->min = g->re.trie.min;