Lines Matching refs:qnext
87 /// qcur and qnext are ordered sets with constant time
95 qnext: SparseSet,
429 qnext: SparseSet::new(prog.insts.len()),
473 dfa.exec_at(&mut cache.qcur, &mut cache.qnext, text)
503 dfa.exec_at_reverse(&mut cache.qcur, &mut cache.qnext, text)
534 let result = dfa.exec_at(&mut cache.qcur, &mut cache.qnext, text);
553 /// {qcur,qnext} are scratch ordered sets which may be non-empty.
558 qnext: &mut SparseSet,
708 next_si = match self.next_state(qcur, qnext, prev_si, byte) {
732 prev_si = match self.next_state(qcur, qnext, prev_si, Byte::eof()) {
751 qnext: &mut SparseSet,
813 next_si = match self.next_state(qcur, qnext, prev_si, byte) {
834 prev_si = match self.next_state(qcur, qnext, prev_si, Byte::eof()) {
893 qnext: &mut SparseSet,
932 qnext.clear();
934 self.follow_epsilons(usize_to_u32(ip), qnext, flags);
936 mem::swap(qcur, qnext);
957 qnext.clear();
969 && !qnext.contains(ip as usize)
973 qnext.insert(ip);
980 qnext,
993 mem::swap(qcur, qnext);
1008 match self.cached_state(qnext, state_flags, Some(&mut si)) {
1332 /// b. {qcur,qnext} are used as scratch space for storing ordered NFA
1346 qnext: &mut SparseSet,
1354 STATE_UNKNOWN => self.exec_byte(qcur, qnext, si, b),