Searched refs:irhs (Results 1 - 9 of 9) sorted by relevance
/external/googletest/googlemock/src/ |
H A D | gmock-matchers.cc | 233 size_t irhs = left_[ilhs]; local 234 if (irhs == kUnused) continue; 235 result.push_back(ElementMatcherPair(ilhs, irhs)); 260 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) { 261 if ((*seen)[irhs]) 263 if (!graph_->HasEdge(ilhs, irhs)) 265 // There's an available edge from ilhs to irhs. 266 (*seen)[irhs] [all...] |
/external/v8/testing/gmock/src/ |
H A D | gmock-matchers.cc | 233 size_t irhs = left_[ilhs]; local 234 if (irhs == kUnused) continue; 235 result.push_back(ElementMatcherPair(ilhs, irhs)); 260 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) { 261 if ((*seen)[irhs]) 263 if (!graph_->HasEdge(ilhs, irhs)) 265 // There's an available edge from ilhs to irhs. 266 (*seen)[irhs] [all...] |
/external/fmtlib/test/ |
H A D | gmock-gtest-all.cc | 10188 size_t irhs = left_[ilhs]; 10189 if (irhs == kUnused) continue; 10190 result.push_back(ElementMatcherPair(ilhs, irhs)); 10215 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) { 10216 if ((*seen)[irhs]) 10218 if (!graph_->HasEdge(ilhs, irhs)) 10220 // There's an available edge from ilhs to irhs. 10221 (*seen)[irhs] [all...] |
/external/googletest/googlemock/include/gmock/ |
H A 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) { argument 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; 3293 // a (ilhs, irhs) matrix coordinate into an offset. 3419 for (size_t irhs = 0; irhs != matchers_.size(); ++irhs) { [all...] |
/external/v8/testing/gmock/include/gmock/ |
H A 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) { argument 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; 3293 // a (ilhs, irhs) matrix coordinate into an offset. 3419 for (size_t irhs = 0; irhs != matchers_.size(); ++irhs) { [all...] |
/external/googletest/googlemock/test/ |
H A D | gmock-matchers_test.cc | 5020 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) { 5022 RecurseInto(irhs); 5048 bool RecurseInto(size_t irhs) { argument 5049 if (rhs_used_[irhs] != kUnused) { 5056 if (!graph_->HasEdge(ilhs, irhs)) { 5059 PushMatch(ilhs, irhs); 5063 for (size_t mi = irhs + 1; mi < graph_->RhsSize(); ++mi) { 5113 size_t irhs local [all...] |
/external/v8/testing/gmock/test/ |
H A D | gmock-matchers_test.cc | 5018 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) { 5020 RecurseInto(irhs); 5046 bool RecurseInto(size_t irhs) { argument 5047 if (rhs_used_[irhs] != kUnused) { 5054 if (!graph_->HasEdge(ilhs, irhs)) { 5057 PushMatch(ilhs, irhs); 5061 for (size_t mi = irhs + 1; mi < graph_->RhsSize(); ++mi) { 5111 size_t irhs local [all...] |
/external/fmtlib/test/gmock/ |
H A 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) { argument 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; 7708 // a (ilhs, irhs) matrix coordinate into an offset. 7834 for (size_t irhs = 0; irhs != matchers_.size(); ++irhs) { [all...] |
/external/icu/icu4c/source/i18n/ |
H A D | decNumber.c | 4915 Int ilhs, irhs, iacc; /* item counts in the arrays */ local 4987 irhs=(rhs->digits+FASTDIGS-1)/FASTDIGS; /* .. */ 4988 iacc=ilhs+irhs; 4995 needbytes=irhs*sizeof(uInt);
|
Completed in 189 milliseconds