Searched refs:visited_ (Results 1 - 3 of 3) sorted by relevance

/external/regex-re2/re2/testing/
H A Dbacktrack.cc41 // like (a*)*, the visited_[] bitmap marks the (state, string-position)
45 // such infinite loops possible to avoid without keeping a giant visited_
46 // bitmap, but visited_ works fine for a reference implementation
74 uint32 *visited_; // bitmap: (Inst*, char*) pairs already backtracked member in class:re2::Backtracker
85 visited_(NULL),
90 delete[] visited_;
122 // Allocate new visited_ bitmap -- size is proportional
124 delete[] visited_;
126 visited_ = new uint32[nvisited_];
127 memset(visited_,
[all...]
/external/regex-re2/re2/
H A Dbitstate.cc63 uint32 *visited_; // bitmap: (Inst*, char*) pairs already backtracked member in class:re2::BitState
80 visited_(NULL),
88 delete[] visited_;
98 if (visited_[n/VisitedBits] & (1 << (n & (VisitedBits-1))))
100 visited_[n/VisitedBits] |= 1 << (n & (VisitedBits-1));
315 visited_ = new uint32[nvisited_];
316 memset(visited_, 0, nvisited_*sizeof visited_[0]);
338 // but we are not clearing visited_ between calls to TrySearch,
/external/openfst/src/include/fst/
H A Drmepsilon.h144 vector<bool> visited_; // '[i] = true' if state 'i' has been visited member in class:fst::RmEpsilonState
172 while (visited_.size() <= state) visited_.push_back(false);
173 if (visited_[state]) continue;
174 visited_[state] = true;
184 while (visited_.size() <= arc.nextstate)
185 visited_.push_back(false);
186 if (!visited_[arc.nextstate])
212 visited_[visited_states_.front()] = false;

Completed in 171 milliseconds