Searched refs:visited_ (Results 1 – 3 of 3) sorted by relevance
63 uint32 *visited_; // bitmap: (Inst*, char*) pairs already backtracked member in re2::BitState80 visited_(NULL), in BitState()88 delete[] visited_; in ~BitState()98 if (visited_[n/VisitedBits] & (1 << (n & (VisitedBits-1)))) in ShouldVisit()100 visited_[n/VisitedBits] |= 1 << (n & (VisitedBits-1)); in ShouldVisit()315 visited_ = new uint32[nvisited_]; in Search()316 memset(visited_, 0, nvisited_*sizeof visited_[0]); in Search()
145 vector<bool> visited_; // '[i] = true' if state 'i' has been visited variable173 while (visited_.size() <= state) visited_.push_back(false); in Expand()174 if (visited_[state]) continue; in Expand()175 visited_[state] = true; in Expand()185 while (visited_.size() <= arc.nextstate) in Expand()186 visited_.push_back(false); in Expand()187 if (!visited_[arc.nextstate]) in Expand()213 visited_[visited_states_.front()] = false; in Expand()
127 vector<bool> visited_; // '[i] = true' if state 'i' has been visited variable147 while ((StateId)visited_.size() <= state) visited_.push_back(false); in Expand()148 visited_[state] = true; in Expand()158 while ((StateId)visited_.size() <= arc.nextstate) in Expand()159 visited_.push_back(false); in Expand()160 if (!visited_[arc.nextstate]) in Expand()186 visited_[visited_states_.front()] = false; in Expand()