Searched refs:ilhs (Results 1 – 4 of 4) sorted by relevance
/external/gmock/src/ |
D | gmock-matchers.cc | 222 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/gmock/include/gmock/ |
D | gmock-matchers.h | 3026 bool HasEdge(size_t ilhs, size_t irhs) const { 3027 return matched_[SpaceIndex(ilhs, irhs)] == 1; 3029 void SetEdge(size_t ilhs, size_t irhs, bool b) { 3030 matched_[SpaceIndex(ilhs, irhs)] = b ? 1 : 0; 3043 size_t SpaceIndex(size_t ilhs, size_t irhs) const { 3044 return ilhs * num_matchers_ + irhs; 3185 for (size_t ilhs = 0; ilhs != num_elements; ++ilhs) { 3187 matrix.SetEdge(ilhs, irhs, *did_match_iter++ != 0);
|
/external/gmock/test/ |
D | gmock-matchers_test.cc | 4775 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) { in RecurseInto() local 4776 if (lhs_used_[ilhs] != kUnused) { in RecurseInto() 4779 if (!graph_->HasEdge(ilhs, irhs)) { in RecurseInto() 4782 PushMatch(ilhs, irhs); in RecurseInto() 4835 size_t ilhs = matches[i].first; in TEST_P() local 4837 EXPECT_TRUE(graph.HasEdge(ilhs, irhs)); in TEST_P() 4838 EXPECT_FALSE(seen_element[ilhs]); in TEST_P() 4840 seen_element[ilhs] = true; in TEST_P()
|
/external/icu/icu4c/source/i18n/ |
D | decNumber.c | 4913 Int ilhs, irhs, iacc; /* item counts in the arrays */ in decMultiplyOp() local 4984 ilhs=(lhs->digits+FASTDIGS-1)/FASTDIGS; /* [ceiling] */ in decMultiplyOp() 4986 iacc=ilhs+irhs; in decMultiplyOp() 4989 needbytes=ilhs*sizeof(uInt); in decMultiplyOp()
|