Compute a vector, indexed by character code, of the trie nodes referenced from the given tree. */
| 409 | /* Compute a vector, indexed by character code, of the trie nodes |
| 410 | referenced from the given tree. */ |
| 411 | static void |
| 412 | treenext (struct tree const *tree, struct trie *next[]) |
| 413 | { |
| 414 | if (!tree) |
| 415 | return; |
| 416 | treenext(tree->llink, next); |
| 417 | treenext(tree->rlink, next); |
| 418 | next[tree->label] = tree->trie; |
| 419 | } |
| 420 | |
| 421 | /* Compute the shift for each trie node, as well as the delta |
| 422 | table and next cache for the given keyword set. */ |