HomeSort by relevance Sort by last modified time
    Searched full:visited_ (Results 1 - 3 of 3) sorted by null

  /external/regex-re2/re2/
bitstate.cc 63 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/srec/tools/thirdparty/OpenFst/fst/lib/
rmepsilon.h 127 vector<bool> visited_; // '[i] = true' if state 'i' has been visited member in class:fst::RmEpsilonState
147 while ((StateId)visited_.size() <= state) visited_.push_back(false);
148 visited_[state] = true;
158 while ((StateId)visited_.size() <= arc.nextstate)
159 visited_.push_back(false);
160 if (!visited_[arc.nextstate])
186 visited_[visited_states_.front()] = false;
  /external/openfst/src/include/fst/
rmepsilon.h 145 vector<bool> visited_; // '[i] = true' if state 'i' has been visited member in class:fst::RmEpsilonState
173 while (visited_.size() <= state) visited_.push_back(false);
174 if (visited_[state]) continue;
175 visited_[state] = true;
185 while (visited_.size() <= arc.nextstate)
186 visited_.push_back(false);
187 if (!visited_[arc.nextstate])
213 visited_[visited_states_.front()] = false;

Completed in 79 milliseconds