Lines Matching refs:ilhs
222 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) { in Compute() local
225 GTEST_CHECK_(left_[ilhs] == kUnused) in Compute()
226 << "ilhs: " << ilhs << ", left_[ilhs]: " << left_[ilhs]; in Compute()
229 TryAugment(ilhs, &seen); in Compute()
232 for (size_t ilhs = 0; ilhs < left_.size(); ++ilhs) { in Compute() local
233 size_t irhs = left_[ilhs]; in Compute()
235 result.push_back(ElementMatcherPair(ilhs, irhs)); in Compute()
259 bool TryAugment(size_t ilhs, ::std::vector<char>* seen) { in TryAugment() argument
263 if (!graph_->HasEdge(ilhs, irhs)) in TryAugment()
279 left_[ilhs] = irhs; in TryAugment()
280 right_[irhs] = ilhs; in TryAugment()
360 for (size_t ilhs = 0; ilhs < LhsSize(); ++ilhs) { in NextGraph() local
362 char& b = matched_[SpaceIndex(ilhs, irhs)]; in NextGraph()
374 for (size_t ilhs = 0; ilhs < LhsSize(); ++ilhs) { in Randomize() local
376 char& b = matched_[SpaceIndex(ilhs, irhs)]; in Randomize()
452 for (size_t ilhs = 0; ilhs < matrix.LhsSize(); ilhs++) { in VerifyAllElementsAndMatchersAreMatched() local
454 char matched = matrix.HasEdge(ilhs, irhs); in VerifyAllElementsAndMatchersAreMatched()
455 element_matched[ilhs] |= matched; in VerifyAllElementsAndMatchersAreMatched()