Lines Matching refs:ilhs
147 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) { in Compute() local
150 GTEST_CHECK_(left_[ilhs] == kUnused) in Compute()
151 << "ilhs: " << ilhs << ", left_[ilhs]: " << left_[ilhs]; in Compute()
154 TryAugment(ilhs, &seen); in Compute()
157 for (size_t ilhs = 0; ilhs < left_.size(); ++ilhs) { in Compute() local
158 size_t irhs = left_[ilhs]; in Compute()
160 result.push_back(ElementMatcherPair(ilhs, irhs)); in Compute()
184 bool TryAugment(size_t ilhs, ::std::vector<char>* seen) { in TryAugment() argument
187 if (!graph_->HasEdge(ilhs, irhs)) continue; in TryAugment()
202 left_[ilhs] = irhs; in TryAugment()
203 right_[irhs] = ilhs; in TryAugment()
247 for (size_t ilhs = 0; ilhs < LhsSize(); ++ilhs) { in NextGraph() local
249 char& b = matched_[SpaceIndex(ilhs, irhs)]; in NextGraph()
261 for (size_t ilhs = 0; ilhs < LhsSize(); ++ilhs) { in Randomize() local
263 char& b = matched_[SpaceIndex(ilhs, irhs)]; in Randomize()
393 for (size_t ilhs = 0; ilhs < matrix.LhsSize(); ilhs++) { in VerifyMatchMatrix() local
395 char matched = matrix.HasEdge(ilhs, irhs); in VerifyMatchMatrix()
396 element_matched[ilhs] |= matched; in VerifyMatchMatrix()