Home
last modified time | relevance | path

Searched refs:ilhs (Results 1 – 10 of 10) sorted by relevance

/external/googletest/googlemock/src/
Dgmock-matchers.cc144 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) { in Compute() local
147 GTEST_CHECK_(left_[ilhs] == kUnused) in Compute()
148 << "ilhs: " << ilhs << ", left_[ilhs]: " << left_[ilhs]; in Compute()
151 TryAugment(ilhs, &seen); in Compute()
154 for (size_t ilhs = 0; ilhs < left_.size(); ++ilhs) { in Compute() local
155 size_t irhs = left_[ilhs]; in Compute()
157 result.push_back(ElementMatcherPair(ilhs, irhs)); in Compute()
181 bool TryAugment(size_t ilhs, ::std::vector<char>* seen) { in TryAugment() argument
184 if (!graph_->HasEdge(ilhs, irhs)) continue; in TryAugment()
199 left_[ilhs] = irhs; in TryAugment()
[all …]
/external/llvm-project/llvm/utils/unittest/googlemock/src/
Dgmock-matchers.cc222 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/fmtlib/test/
Dgmock-gtest-all.cc9992 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) { in Compute() local
9995 GTEST_CHECK_(left_[ilhs] == kUnused) in Compute()
9996 << "ilhs: " << ilhs << ", left_[ilhs]: " << left_[ilhs]; in Compute()
9999 TryAugment(ilhs, &seen); in Compute()
10002 for (size_t ilhs = 0; ilhs < left_.size(); ++ilhs) { in Compute() local
10003 size_t irhs = left_[ilhs]; in Compute()
10005 result.push_back(ElementMatcherPair(ilhs, irhs)); in Compute()
10029 bool TryAugment(size_t ilhs, ::std::vector<char>* seen) { in TryAugment() argument
10032 if (!graph_->HasEdge(ilhs, irhs)) continue; in TryAugment()
10047 left_[ilhs] = irhs; in TryAugment()
[all …]
/external/rust/crates/grpcio-sys/grpc/third_party/cares/cares/test/gmock-1.8.0/
Dgmock-gtest-all.cc10988 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) { in Compute() local
10991 GTEST_CHECK_(left_[ilhs] == kUnused) in Compute()
10992 << "ilhs: " << ilhs << ", left_[ilhs]: " << left_[ilhs]; in Compute()
10995 TryAugment(ilhs, &seen); in Compute()
10998 for (size_t ilhs = 0; ilhs < left_.size(); ++ilhs) { in Compute() local
10999 size_t irhs = left_[ilhs]; in Compute()
11001 result.push_back(ElementMatcherPair(ilhs, irhs)); in Compute()
11025 bool TryAugment(size_t ilhs, ::std::vector<char>* seen) { in TryAugment() argument
11029 if (!graph_->HasEdge(ilhs, irhs)) in TryAugment()
11045 left_[ilhs] = irhs; in TryAugment()
[all …]
/external/llvm-project/llvm/utils/unittest/googlemock/include/gmock/
Dgmock-matchers.h3276 bool HasEdge(size_t ilhs, size_t irhs) const {
3277 return matched_[SpaceIndex(ilhs, irhs)] == 1;
3279 void SetEdge(size_t ilhs, size_t irhs, bool b) {
3280 matched_[SpaceIndex(ilhs, irhs)] = b ? 1 : 0;
3293 size_t SpaceIndex(size_t ilhs, size_t irhs) const {
3294 return ilhs * num_matchers_ + irhs;
3438 for (size_t ilhs = 0; ilhs != num_elements; ++ilhs) {
3440 matrix.SetEdge(ilhs, irhs, *did_match_iter++ != 0);
/external/googletest/googlemock/include/gmock/
Dgmock-matchers.h3334 bool HasEdge(size_t ilhs, size_t irhs) const {
3335 return matched_[SpaceIndex(ilhs, irhs)] == 1;
3337 void SetEdge(size_t ilhs, size_t irhs, bool b) {
3338 matched_[SpaceIndex(ilhs, irhs)] = b ? 1 : 0;
3351 size_t SpaceIndex(size_t ilhs, size_t irhs) const {
3352 return ilhs * num_matchers_ + irhs;
3508 for (size_t ilhs = 0; ilhs != num_elements; ++ilhs) {
3510 matrix.SetEdge(ilhs, irhs, *did_match_iter++ != 0);
/external/googletest/googlemock/test/
Dgmock-matchers_test.cc6194 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) { in TEST() local
6195 if (lhs_used_[ilhs] != kUnused) { in TEST()
6198 if (!graph_->HasEdge(ilhs, irhs)) { in TEST()
6201 PushMatch(ilhs, irhs); in TEST()
6254 size_t ilhs = matches[i].first; in TEST() local
6256 EXPECT_TRUE(graph.HasEdge(ilhs, irhs)); in TEST()
6257 EXPECT_FALSE(seen_element[ilhs]); in TEST()
6259 seen_element[ilhs] = true; in TEST()
/external/icu/icu4c/source/i18n/
DdecNumber.cpp4917 Int ilhs, irhs, iacc; /* item counts in the arrays */ in decMultiplyOp() local
4988 ilhs=(lhs->digits+FASTDIGS-1)/FASTDIGS; /* [ceiling] */ in decMultiplyOp()
4990 iacc=ilhs+irhs; in decMultiplyOp()
4993 needbytes=ilhs*sizeof(uInt); in decMultiplyOp()
/external/fmtlib/test/gmock/
Dgmock.h7683 bool HasEdge(size_t ilhs, size_t irhs) const {
7684 return matched_[SpaceIndex(ilhs, irhs)] == 1;
7686 void SetEdge(size_t ilhs, size_t irhs, bool b) {
7687 matched_[SpaceIndex(ilhs, irhs)] = b ? 1 : 0;
7700 size_t SpaceIndex(size_t ilhs, size_t irhs) const {
7701 return ilhs * num_matchers_ + irhs;
7842 for (size_t ilhs = 0; ilhs != num_elements; ++ilhs) {
7844 matrix.SetEdge(ilhs, irhs, *did_match_iter++ != 0);
/external/rust/crates/grpcio-sys/grpc/third_party/cares/cares/test/gmock-1.8.0/gmock/
Dgmock.h8086 bool HasEdge(size_t ilhs, size_t irhs) const {
8087 return matched_[SpaceIndex(ilhs, irhs)] == 1;
8089 void SetEdge(size_t ilhs, size_t irhs, bool b) {
8090 matched_[SpaceIndex(ilhs, irhs)] = b ? 1 : 0;
8103 size_t SpaceIndex(size_t ilhs, size_t irhs) const {
8104 return ilhs * num_matchers_ + irhs;
8245 for (size_t ilhs = 0; ilhs != num_elements; ++ilhs) {
8247 matrix.SetEdge(ilhs, irhs, *did_match_iter++ != 0);