Lines Matching defs:new
15 during a search. When a new state is computed, it is stored in a cache so
22 In pathological cases, a new state can be created for every byte of input.
81 /// contention, then new caches are created.)
146 /// Scratch space used when building instruction pointer lists for new
206 /// The DFA can also give up if it runs out of room to create new states, or if
325 /// cached state or a new state altogether. In general, an unknown state means
413 /// Create new empty cache for the DFA engine.
414 pub fn new(prog: &Program) -> Self {
420 compiled: StateMap::new(num_byte_classes),
421 trans: Transitions::new(num_byte_classes),
428 qcur: SparseSet::new(prog.insts.len()),
429 qnext: SparseSet::new(prog.insts.len()),
1139 /// If the cache is full, then it is wiped before caching a new state.
1341 /// None is returned if a new state could not be allocated (i.e., the DFA
1576 /// inputs, a new state could be created for every byte of input. (This is
1608 fn new(num_byte_classes: usize) -> StateMap {
1609 StateMap { map: HashMap::new(), states: vec![], num_byte_classes }
1640 /// Create a new transition table.
1644 fn new(num_byte_classes: usize) -> Transitions {
1919 QuickCheck::new()
1920 .gen(Gen::new(10_000))