Searched refs:ilhs (Results 1 - 4 of 4) sorted by relevance

/external/gmock/src/
H A Dgmock-matchers.cc222 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) {
224 // source to sink starting at the left_[ilhs] node.
225 GTEST_CHECK_(left_[ilhs] == kUnused)
226 << "ilhs: " << ilhs << ", left_[ilhs]: " << left_[ilhs];
229 TryAugment(ilhs,
259 TryAugment(size_t ilhs, ::std::vector<char>* seen) argument
[all...]
/external/gmock/include/gmock/
H A Dgmock-matchers.h3026 bool HasEdge(size_t ilhs, size_t irhs) const { argument
3027 return matched_[SpaceIndex(ilhs, irhs)] == 1;
3029 void SetEdge(size_t ilhs, size_t irhs, bool b) { argument
3030 matched_[SpaceIndex(ilhs, irhs)] = b ? 1 : 0;
3043 size_t SpaceIndex(size_t ilhs, size_t irhs) const { argument
3044 return ilhs * num_matchers_ + irhs;
3052 // a (ilhs, irhs) matrix coordinate into an offset.
3185 for (size_t ilhs = 0; ilhs != num_elements; ++ilhs) {
[all...]
/external/gmock/test/
H A Dgmock-matchers_test.cc4775 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) {
4776 if (lhs_used_[ilhs] != kUnused) {
4779 if (!graph_->HasEdge(ilhs, irhs)) {
4782 PushMatch(ilhs, irhs);
4835 size_t ilhs = matches[i].first; local
4837 EXPECT_TRUE(graph.HasEdge(ilhs, irhs));
4838 EXPECT_FALSE(seen_element[ilhs]);
4840 seen_element[ilhs]
[all...]
/external/icu/icu4c/source/i18n/
H A DdecNumber.c4913 Int ilhs, irhs, iacc; /* item counts in the arrays */ local
4984 ilhs=(lhs->digits+FASTDIGS-1)/FASTDIGS; /* [ceiling] */
4986 iacc=ilhs+irhs;
4989 needbytes=ilhs*sizeof(uInt);

Completed in 304 milliseconds