Searched refs:irhs (Results 1 – 2 of 2) sorted by relevance
156 size_t irhs = left_[ilhs]; in Compute() local157 if (irhs == kUnused) continue; in Compute()183 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) { in TryAugment() local184 if ((*seen)[irhs]) continue; in TryAugment()187 (*seen)[irhs] = 1; in TryAugment()198 if (right_[irhs] == kUnused || TryAugment(right_[irhs], seen)) { in TryAugment()200 left_[ilhs] = irhs; in TryAugment()201 right_[irhs] = ilhs; in TryAugment()249 for (size_t irhs = 0; irhs < RhsSize(); ++irhs) { in NextGraph() local263 for (size_t irhs = 0; irhs < RhsSize(); ++irhs) { in Randomize() local[all …]
2869 bool HasEdge(size_t ilhs, size_t irhs) const {2870 return matched_[SpaceIndex(ilhs, irhs)] == 1;2872 void SetEdge(size_t ilhs, size_t irhs, bool b) {2873 matched_[SpaceIndex(ilhs, irhs)] = b ? 1 : 0;2886 size_t SpaceIndex(size_t ilhs, size_t irhs) const {2887 return ilhs * num_matchers_ + irhs;3036 for (size_t irhs = 0; irhs != matchers_.size(); ++irhs) {3037 did_match.push_back(Matches(matchers_[irhs])(*elem_first));3044 for (size_t irhs = 0; irhs != matchers_.size(); ++irhs) {3045 matrix.SetEdge(ilhs, irhs, *did_match_iter++ != 0);