Lines Matching defs:irhs
158 size_t irhs = left_[ilhs];
159 if (irhs == kUnused) continue;
160 result.push_back(ElementMatcherPair(ilhs, irhs));
185 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) {
186 if ((*seen)[irhs]) continue;
187 if (!graph_->HasEdge(ilhs, irhs)) continue;
188 // There's an available edge from ilhs to irhs.
189 (*seen)[irhs] = 1;
193 // right_[irhs] == kUnused means that there is residual flow from
194 // right node irhs to the sink, so we can use that to finish this
200 if (right_[irhs] == kUnused || TryAugment(right_[irhs], seen)) {
201 // Add flow from left_[ilhs] to right_[irhs].
202 left_[ilhs] = irhs;
203 right_[irhs] = ilhs;
249 for (size_t irhs = 0; irhs < RhsSize(); ++irhs) {
250 char& b = matched_[SpaceIndex(ilhs, irhs)];
263 for (size_t irhs = 0; irhs < RhsSize(); ++irhs) {
264 char& b = matched_[SpaceIndex(ilhs, irhs)];
395 for (size_t irhs = 0; irhs < matrix.RhsSize(); irhs++) {
396 char matched = matrix.HasEdge(ilhs, irhs);
398 matcher_matched[irhs] |= matched;