Lines Matching refs:ilhs
145 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) { in Compute() local
148 GTEST_CHECK_(left_[ilhs] == kUnused) in Compute()
149 << "ilhs: " << ilhs << ", left_[ilhs]: " << left_[ilhs]; in Compute()
152 TryAugment(ilhs, &seen); in Compute()
155 for (size_t ilhs = 0; ilhs < left_.size(); ++ilhs) { in Compute() local
156 size_t irhs = left_[ilhs]; in Compute()
158 result.push_back(ElementMatcherPair(ilhs, irhs)); in Compute()
182 bool TryAugment(size_t ilhs, ::std::vector<char>* seen) { in TryAugment() argument
185 if (!graph_->HasEdge(ilhs, irhs)) continue; in TryAugment()
200 left_[ilhs] = irhs; in TryAugment()
201 right_[irhs] = ilhs; in TryAugment()
248 for (size_t ilhs = 0; ilhs < LhsSize(); ++ilhs) { in NextGraph() local
250 char& b = matched_[SpaceIndex(ilhs, irhs)]; in NextGraph()
262 for (size_t ilhs = 0; ilhs < LhsSize(); ++ilhs) { in Randomize() local
264 char& b = matched_[SpaceIndex(ilhs, irhs)]; in Randomize()
377 for (size_t ilhs = 0; ilhs < matrix.LhsSize(); ilhs++) { in VerifyMatchMatrix() local
379 char matched = matrix.HasEdge(ilhs, irhs); in VerifyMatchMatrix()
380 element_matched[ilhs] |= matched; in VerifyMatchMatrix()