Searched refs:irhs (Results 1 - 3 of 3) sorted by relevance
/freebsd-12-stable/contrib/googletest/googlemock/src/ |
H A D | gmock-matchers.cc | 266 size_t irhs = left_[ilhs]; local 267 if (irhs == kUnused) continue; 268 result.push_back(ElementMatcherPair(ilhs, irhs)); 293 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) { 294 if ((*seen)[irhs]) continue; 295 if (!graph_->HasEdge(ilhs, irhs)) continue; 296 // There's an available edge from ilhs to irhs. 297 (*seen)[irhs] [all...] |
/freebsd-12-stable/contrib/googletest/googlemock/include/gmock/ |
H A D | gmock-matchers.h | 3637 bool HasEdge(size_t ilhs, size_t irhs) const { 3638 return matched_[SpaceIndex(ilhs, irhs)] == 1; 3640 void SetEdge(size_t ilhs, size_t irhs, bool b) { argument 3641 matched_[SpaceIndex(ilhs, irhs)] = b ? 1 : 0; 3654 size_t SpaceIndex(size_t ilhs, size_t irhs) const { 3655 return ilhs * num_matchers_ + irhs; 3663 // a (ilhs, irhs) matrix coordinate into an offset. 3802 for (size_t irhs = 0; irhs != matchers_.size(); ++irhs) { [all...] |
/freebsd-12-stable/contrib/googletest/googlemock/test/ |
H A D | gmock-matchers_test.cc | 6005 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) { 6007 RecurseInto(irhs); 6033 bool RecurseInto(size_t irhs) { argument 6034 if (rhs_used_[irhs] != kUnused) { 6041 if (!graph_->HasEdge(ilhs, irhs)) { 6044 PushMatch(ilhs, irhs); 6048 for (size_t mi = irhs + 1; mi < graph_->RhsSize(); ++mi) { 6098 size_t irhs local [all...] |
Completed in 264 milliseconds