Lines Matching defs:irhs
233 size_t irhs = left_[ilhs];
234 if (irhs == kUnused) continue;
235 result.push_back(ElementMatcherPair(ilhs, irhs));
260 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) {
261 if ((*seen)[irhs])
263 if (!graph_->HasEdge(ilhs, irhs))
265 // There's an available edge from ilhs to irhs.
266 (*seen)[irhs] = 1;
270 // right_[irhs] == kUnused means that there is residual flow from
271 // right node irhs to the sink, so we can use that to finish this
277 if (right_[irhs] == kUnused || TryAugment(right_[irhs], seen)) {
278 // Add flow from left_[ilhs] to right_[irhs].
279 left_[ilhs] = irhs;
280 right_[irhs] = ilhs;
361 for (size_t irhs = 0; irhs < RhsSize(); ++irhs) {
362 char& b = matched_[SpaceIndex(ilhs, irhs)];
375 for (size_t irhs = 0; irhs < RhsSize(); ++irhs) {
376 char& b = matched_[SpaceIndex(ilhs, irhs)];
453 for (size_t irhs = 0; irhs < matrix.RhsSize(); irhs++) {
454 char matched = matrix.HasEdge(ilhs, irhs);
456 matcher_matched[irhs] |= matched;