Searched refs:ilhs (Results 1 – 3 of 3) sorted by relevance
| /freebsd-14.2/contrib/googletest/googlemock/src/ |
| H A D | gmock-matchers.cc | 147 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) { in Compute() local
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()
202 left_[ilhs] = irhs; in TryAugment()
203 right_[irhs] = ilhs; in TryAugment()
248 for (size_t ilhs = 0; ilhs < LhsSize(); ++ilhs) { in NextGraph() local
262 for (size_t ilhs = 0; ilhs < LhsSize(); ++ilhs) { in Randomize() local
394 for (size_t ilhs = 0; ilhs < matrix.LhsSize(); ilhs++) { in VerifyMatchMatrix() local
[all …]
|
| /freebsd-14.2/contrib/googletest/googlemock/test/ |
| H A D | gmock-matchers-misc_test.cc | 454 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) { in RecurseInto() local
455 if (lhs_used_[ilhs] != kUnused) { in RecurseInto()
458 if (!graph_->HasEdge(ilhs, irhs)) { in RecurseInto()
461 PushMatch(ilhs, irhs); in RecurseInto()
512 size_t ilhs = matches[i].first; in TEST_P() local
514 EXPECT_TRUE(graph.HasEdge(ilhs, irhs)); in TEST_P()
515 EXPECT_FALSE(seen_element[ilhs]); in TEST_P()
517 seen_element[ilhs] = true; in TEST_P()
|
| /freebsd-14.2/contrib/googletest/googlemock/include/gmock/ |
| H A D | gmock-matchers.h | 3523 bool HasEdge(size_t ilhs, size_t irhs) const {
3524 return matched_[SpaceIndex(ilhs, irhs)] == 1;
3526 void SetEdge(size_t ilhs, size_t irhs, bool b) {
3527 matched_[SpaceIndex(ilhs, irhs)] = b ? 1 : 0;
3540 size_t SpaceIndex(size_t ilhs, size_t irhs) const {
3541 return ilhs * num_matchers_ + irhs;
3676 for (size_t ilhs = 0; ilhs != num_elements; ++ilhs) {
3678 matrix.SetEdge(ilhs, irhs, *did_match_iter++ != 0);
|