Searched refs:irhs (Results 1 – 3 of 3) sorted by relevance
| /freebsd/contrib/googletest/googlemock/src/ |
| H A D | gmock-matchers.cc | 158 size_t irhs = left_[ilhs]; in Compute() local
159 if (irhs == kUnused) continue; in Compute()
160 result.push_back(ElementMatcherPair(ilhs, irhs)); in Compute()
185 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) { in TryAugment() local
186 if ((*seen)[irhs]) continue; in TryAugment()
187 if (!graph_->HasEdge(ilhs, irhs)) continue; in TryAugment()
189 (*seen)[irhs] = 1; in TryAugment()
200 if (right_[irhs] == kUnused || TryAugment(right_[irhs], seen)) { in TryAugment()
202 left_[ilhs] = irhs; in TryAugment()
203 right_[irhs] = ilhs; in TryAugment()
[all …]
|
| /freebsd/contrib/googletest/googlemock/test/ |
| H A D | gmock-matchers-misc_test.cc | 424 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) { in Compute() local
426 RecurseInto(irhs); in Compute()
451 bool RecurseInto(size_t irhs) { in RecurseInto() argument
452 if (rhs_used_[irhs] != kUnused) { in RecurseInto()
459 if (!graph_->HasEdge(ilhs, irhs)) { in RecurseInto()
462 PushMatch(ilhs, irhs); in RecurseInto()
466 for (size_t mi = irhs + 1; mi < graph_->RhsSize(); ++mi) { in RecurseInto()
514 size_t irhs = matches[i].second; in TEST_P() local
515 EXPECT_TRUE(graph.HasEdge(ilhs, irhs)); in TEST_P()
517 EXPECT_FALSE(seen_matcher[irhs]); in TEST_P()
[all …]
|
| /freebsd/contrib/googletest/googlemock/include/gmock/ |
| H A D | gmock-matchers.h | 3731 bool HasEdge(size_t ilhs, size_t irhs) const {
3732 return matched_[SpaceIndex(ilhs, irhs)] == 1;
3734 void SetEdge(size_t ilhs, size_t irhs, bool b) {
3735 matched_[SpaceIndex(ilhs, irhs)] = b ? 1 : 0;
3748 size_t SpaceIndex(size_t ilhs, size_t irhs) const {
3749 return ilhs * num_matchers_ + irhs;
3876 for (size_t irhs = 0; irhs != matchers_.size(); ++irhs) {
3878 matchers_[irhs].MatchAndExplain(*elem_first, &dummy));
3885 for (size_t irhs = 0; irhs != matchers_.size(); ++irhs) {
3886 matrix.SetEdge(ilhs, irhs, *did_match_iter++ != 0);
|