| /external/googletest/googlemock/src/ |
| D | gmock-matchers.cc | 233 size_t irhs = left_[ilhs]; in Compute() local
234 if (irhs == kUnused) continue; in Compute()
235 result.push_back(ElementMatcherPair(ilhs, irhs)); in Compute()
260 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) { in TryAugment() local
261 if ((*seen)[irhs]) in TryAugment()
263 if (!graph_->HasEdge(ilhs, irhs)) in TryAugment()
266 (*seen)[irhs] = 1; in TryAugment()
277 if (right_[irhs] == kUnused || TryAugment(right_[irhs], seen)) { in TryAugment()
279 left_[ilhs] = irhs; in TryAugment()
280 right_[irhs] = ilhs; in TryAugment()
[all …]
|
| /external/v8/testing/gmock/src/ |
| D | gmock-matchers.cc | 233 size_t irhs = left_[ilhs]; in Compute() local
234 if (irhs == kUnused) continue; in Compute()
235 result.push_back(ElementMatcherPair(ilhs, irhs)); in Compute()
260 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) { in TryAugment() local
261 if ((*seen)[irhs]) in TryAugment()
263 if (!graph_->HasEdge(ilhs, irhs)) in TryAugment()
266 (*seen)[irhs] = 1; in TryAugment()
277 if (right_[irhs] == kUnused || TryAugment(right_[irhs], seen)) { in TryAugment()
279 left_[ilhs] = irhs; in TryAugment()
280 right_[irhs] = ilhs; in TryAugment()
[all …]
|
| /external/fmtlib/test/ |
| D | gmock-gtest-all.cc | 10188 size_t irhs = left_[ilhs]; in Compute() local
10189 if (irhs == kUnused) continue; in Compute()
10190 result.push_back(ElementMatcherPair(ilhs, irhs)); in Compute()
10215 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) { in TryAugment() local
10216 if ((*seen)[irhs]) in TryAugment()
10218 if (!graph_->HasEdge(ilhs, irhs)) in TryAugment()
10221 (*seen)[irhs] = 1; in TryAugment()
10232 if (right_[irhs] == kUnused || TryAugment(right_[irhs], seen)) { in TryAugment()
10234 left_[ilhs] = irhs; in TryAugment()
10235 right_[irhs] = ilhs; in TryAugment()
[all …]
|
| /external/v8/testing/gmock/include/gmock/ |
| D | gmock-matchers.h | 3267 bool HasEdge(size_t ilhs, size_t irhs) const {
3268 return matched_[SpaceIndex(ilhs, irhs)] == 1;
3270 void SetEdge(size_t ilhs, size_t irhs, bool b) {
3271 matched_[SpaceIndex(ilhs, irhs)] = b ? 1 : 0;
3284 size_t SpaceIndex(size_t ilhs, size_t irhs) const {
3285 return ilhs * num_matchers_ + irhs;
3419 for (size_t irhs = 0; irhs != matchers_.size(); ++irhs) {
3420 did_match.push_back(Matches(matchers_[irhs])(*elem_first));
3427 for (size_t irhs = 0; irhs != matchers_.size(); ++irhs) {
3428 matrix.SetEdge(ilhs, irhs, *did_match_iter++ != 0);
|
| /external/googletest/googlemock/include/gmock/ |
| D | gmock-matchers.h | 3267 bool HasEdge(size_t ilhs, size_t irhs) const {
3268 return matched_[SpaceIndex(ilhs, irhs)] == 1;
3270 void SetEdge(size_t ilhs, size_t irhs, bool b) {
3271 matched_[SpaceIndex(ilhs, irhs)] = b ? 1 : 0;
3284 size_t SpaceIndex(size_t ilhs, size_t irhs) const {
3285 return ilhs * num_matchers_ + irhs;
3419 for (size_t irhs = 0; irhs != matchers_.size(); ++irhs) {
3420 did_match.push_back(Matches(matchers_[irhs])(*elem_first));
3427 for (size_t irhs = 0; irhs != matchers_.size(); ++irhs) {
3428 matrix.SetEdge(ilhs, irhs, *did_match_iter++ != 0);
|
| /external/v8/testing/gmock/test/ |
| D | gmock-matchers_test.cc | 5018 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) { in Compute() local
5020 RecurseInto(irhs); in Compute()
5046 bool RecurseInto(size_t irhs) { in RecurseInto() argument
5047 if (rhs_used_[irhs] != kUnused) { in RecurseInto()
5054 if (!graph_->HasEdge(ilhs, irhs)) { in RecurseInto()
5057 PushMatch(ilhs, irhs); in RecurseInto()
5061 for (size_t mi = irhs + 1; mi < graph_->RhsSize(); ++mi) { in RecurseInto()
5111 size_t irhs = matches[i].second; in TEST_P() local
5112 EXPECT_TRUE(graph.HasEdge(ilhs, irhs)); in TEST_P()
5114 EXPECT_FALSE(seen_matcher[irhs]); in TEST_P()
[all …]
|
| /external/googletest/googlemock/test/ |
| D | gmock-matchers_test.cc | 5020 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) { in Compute() local
5022 RecurseInto(irhs); in Compute()
5048 bool RecurseInto(size_t irhs) { in RecurseInto() argument
5049 if (rhs_used_[irhs] != kUnused) { in RecurseInto()
5056 if (!graph_->HasEdge(ilhs, irhs)) { in RecurseInto()
5059 PushMatch(ilhs, irhs); in RecurseInto()
5063 for (size_t mi = irhs + 1; mi < graph_->RhsSize(); ++mi) { in RecurseInto()
5113 size_t irhs = matches[i].second; in TEST_P() local
5114 EXPECT_TRUE(graph.HasEdge(ilhs, irhs)); in TEST_P()
5116 EXPECT_FALSE(seen_matcher[irhs]); in TEST_P()
[all …]
|
| /external/fmtlib/test/gmock/ |
| D | gmock.h | 7682 bool HasEdge(size_t ilhs, size_t irhs) const {
7683 return matched_[SpaceIndex(ilhs, irhs)] == 1;
7685 void SetEdge(size_t ilhs, size_t irhs, bool b) {
7686 matched_[SpaceIndex(ilhs, irhs)] = b ? 1 : 0;
7699 size_t SpaceIndex(size_t ilhs, size_t irhs) const {
7700 return ilhs * num_matchers_ + irhs;
7834 for (size_t irhs = 0; irhs != matchers_.size(); ++irhs) {
7835 did_match.push_back(Matches(matchers_[irhs])(*elem_first));
7842 for (size_t irhs = 0; irhs != matchers_.size(); ++irhs) {
7843 matrix.SetEdge(ilhs, irhs, *did_match_iter++ != 0);
|
| /external/icu/icu4c/source/i18n/ |
| D | decNumber.c | 4915 Int ilhs, irhs, iacc; /* item counts in the arrays */ in decMultiplyOp() local
4987 irhs=(rhs->digits+FASTDIGS-1)/FASTDIGS; /* .. */ in decMultiplyOp()
4988 iacc=ilhs+irhs; in decMultiplyOp()
4995 needbytes=irhs*sizeof(uInt); in decMultiplyOp()
|