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

/freebsd-12-stable/contrib/googletest/googlemock/src/
H A Dgmock-matchers.cc255 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) {
257 // source to sink starting at the left_[ilhs] node.
258 GTEST_CHECK_(left_[ilhs] == kUnused)
259 << "ilhs: " << ilhs << ", left_[ilhs]: " << left_[ilhs];
262 TryAugment(ilhs,
292 TryAugment(size_t ilhs, ::std::vector<char>* seen) argument
[all...]
/freebsd-12-stable/contrib/googletest/googlemock/include/gmock/
H A Dgmock-matchers.h3637 bool HasEdge(size_t ilhs, size_t irhs) const { argument
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 { argument
3655 return ilhs * num_matchers_ + irhs;
3663 // a (ilhs, irhs) matrix coordinate into an offset.
3809 for (size_t ilhs = 0; ilhs != num_elements; ++ilhs) {
[all...]
/freebsd-12-stable/contrib/googletest/googlemock/test/
H A Dgmock-matchers_test.cc6037 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) {
6038 if (lhs_used_[ilhs] != kUnused) {
6041 if (!graph_->HasEdge(ilhs, irhs)) {
6044 PushMatch(ilhs, irhs);
6097 size_t ilhs = matches[i].first; local
6099 EXPECT_TRUE(graph.HasEdge(ilhs, irhs));
6100 EXPECT_FALSE(seen_element[ilhs]);
6102 seen_element[ilhs]
[all...]

Completed in 199 milliseconds