Lines Matching full:will
57 * either being redundant (a state processed later will have an identical
58 * transition table) or nearly redundant (a state processed later will have
60 * protos is kept around with the hope that most states will find a proto
65 * destination) then the odds are good that future states will also go
70 * state will differ from the proto for two out-transitions. One of these
71 * out-transitions will be that character on which the proto does not go
72 * to the common destination, and one will be that character on which the
133 * it will not be considered a template.
211 * following call will do nothing.
331 * In determining if a state will or will not fit, find_table_space() must take
332 * into account the fact that an end-of-buffer state will be added at [0],
333 * and an action number will be added in [-1].
365 * (skipping only the elements which will definitely not
507 * "JAMSTATE", then no attempt will be made to fit zero entries of "state"
509 * "JAMSTATE" they will be taken care of. In any case, entries in "state"
510 * marking transitions to "SAME_TRANS" are treated as though they will be
513 * the tables are searched for an interior spot that will accommodate the
563 * the nxt array with one and a low-valued character will access
722 /* Calculate where we will temporarily store the transition table
859 * entry of "pr" will appear in "ext".
861 * Entries which are the same in both "state" and "pr" will be marked
