Home
last modified time | relevance | path

Searched refs:ilhs (Results 1 – 9 of 9) sorted by relevance

/external/googletest/googlemock/src/
Dgmock-matchers.cc222 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) { in Compute() local
225 GTEST_CHECK_(left_[ilhs] == kUnused) in Compute()
226 << "ilhs: " << ilhs << ", left_[ilhs]: " << left_[ilhs]; in Compute()
229 TryAugment(ilhs, &seen); in Compute()
232 for (size_t ilhs = 0; ilhs < left_.size(); ++ilhs) { in Compute() local
233 size_t irhs = left_[ilhs]; in Compute()
235 result.push_back(ElementMatcherPair(ilhs, irhs)); in Compute()
259 bool TryAugment(size_t ilhs, ::std::vector<char>* seen) { in TryAugment() argument
263 if (!graph_->HasEdge(ilhs, irhs)) in TryAugment()
279 left_[ilhs] = irhs; in TryAugment()
[all …]
/external/v8/testing/gmock/src/
Dgmock-matchers.cc222 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) { in Compute() local
225 GTEST_CHECK_(left_[ilhs] == kUnused) in Compute()
226 << "ilhs: " << ilhs << ", left_[ilhs]: " << left_[ilhs]; in Compute()
229 TryAugment(ilhs, &seen); in Compute()
232 for (size_t ilhs = 0; ilhs < left_.size(); ++ilhs) { in Compute() local
233 size_t irhs = left_[ilhs]; in Compute()
235 result.push_back(ElementMatcherPair(ilhs, irhs)); in Compute()
259 bool TryAugment(size_t ilhs, ::std::vector<char>* seen) { in TryAugment() argument
263 if (!graph_->HasEdge(ilhs, irhs)) in TryAugment()
279 left_[ilhs] = irhs; in TryAugment()
[all …]
/external/fmtlib/test/
Dgmock-gtest-all.cc10177 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) { in Compute() local
10180 GTEST_CHECK_(left_[ilhs] == kUnused) in Compute()
10181 << "ilhs: " << ilhs << ", left_[ilhs]: " << left_[ilhs]; in Compute()
10184 TryAugment(ilhs, &seen); in Compute()
10187 for (size_t ilhs = 0; ilhs < left_.size(); ++ilhs) { in Compute() local
10188 size_t irhs = left_[ilhs]; in Compute()
10190 result.push_back(ElementMatcherPair(ilhs, irhs)); in Compute()
10214 bool TryAugment(size_t ilhs, ::std::vector<char>* seen) { in TryAugment() argument
10218 if (!graph_->HasEdge(ilhs, irhs)) in TryAugment()
10234 left_[ilhs] = irhs; in TryAugment()
[all …]
/external/v8/testing/gmock/include/gmock/
Dgmock-matchers.h3267 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;
3426 for (size_t ilhs = 0; ilhs != num_elements; ++ilhs) {
3428 matrix.SetEdge(ilhs, irhs, *did_match_iter++ != 0);
/external/googletest/googlemock/include/gmock/
Dgmock-matchers.h3267 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;
3426 for (size_t ilhs = 0; ilhs != num_elements; ++ilhs) {
3428 matrix.SetEdge(ilhs, irhs, *did_match_iter++ != 0);
/external/v8/testing/gmock/test/
Dgmock-matchers_test.cc5050 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) { in RecurseInto() local
5051 if (lhs_used_[ilhs] != kUnused) { in RecurseInto()
5054 if (!graph_->HasEdge(ilhs, irhs)) { in RecurseInto()
5057 PushMatch(ilhs, irhs); in RecurseInto()
5110 size_t ilhs = matches[i].first; in TEST_P() local
5112 EXPECT_TRUE(graph.HasEdge(ilhs, irhs)); in TEST_P()
5113 EXPECT_FALSE(seen_element[ilhs]); in TEST_P()
5115 seen_element[ilhs] = true; in TEST_P()
/external/googletest/googlemock/test/
Dgmock-matchers_test.cc5052 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) { in RecurseInto() local
5053 if (lhs_used_[ilhs] != kUnused) { in RecurseInto()
5056 if (!graph_->HasEdge(ilhs, irhs)) { in RecurseInto()
5059 PushMatch(ilhs, irhs); in RecurseInto()
5112 size_t ilhs = matches[i].first; in TEST_P() local
5114 EXPECT_TRUE(graph.HasEdge(ilhs, irhs)); in TEST_P()
5115 EXPECT_FALSE(seen_element[ilhs]); in TEST_P()
5117 seen_element[ilhs] = true; in TEST_P()
/external/icu/icu4c/source/i18n/
DdecNumber.c4915 Int ilhs, irhs, iacc; /* item counts in the arrays */ in decMultiplyOp() local
4986 ilhs=(lhs->digits+FASTDIGS-1)/FASTDIGS; /* [ceiling] */ in decMultiplyOp()
4988 iacc=ilhs+irhs; in decMultiplyOp()
4991 needbytes=ilhs*sizeof(uInt); in decMultiplyOp()
/external/fmtlib/test/gmock/
Dgmock.h7682 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;
7841 for (size_t ilhs = 0; ilhs != num_elements; ++ilhs) {
7843 matrix.SetEdge(ilhs, irhs, *did_match_iter++ != 0);