| /external/google-breakpad/src/testing/test/ |
| gmock-matchers_test.cc | 105 using testing::Ne;
860 // Tests that Ne(v) matches anything != v.
862 Matcher<int> m1 = Ne(0);
868 // Tests that Ne(v) describes itself properly.
870 Matcher<int> m = Ne(5);
[all...] |
| gmock-generated-matchers_test.cc | 72 using testing::Ne;
111 EXPECT_THAT(t, Not(Args<>(Ne(tuple<>()))));
132 EXPECT_THAT(t, Not(Args<1, 1>(Ne())));
325 Matcher<const list<int>& > m = ElementsAre(1, Ne(2));
428 ElementsAre(0, Ge(0), _, 3, 4, Ne(2), Eq(6), 7, 8, _));
470 EXPECT_THAT(nested, ElementsAre(ElementsAre('H', Ne('e')),
[all...] |
| gmock_link_test.h | 70 // Gt, Lt, Ge, Le, Ne
157 using testing::Ne;
494 // Tests the linkage of the Lt, Gt, Le, Ge, and Ne matchers.
502 ON_CALL(mock, VoidFromFloat(Ne(1.0f))).WillByDefault(Return());
|
| /external/googletest/googlemock/test/ |
| gmock-matchers_test.cc | 116 using testing::Ne;
988 // Tests that Ne(v) matches anything != v.
990 Matcher<int> m1 = Ne(0);
996 // Tests that Ne(v) describes itself properly.
998 Matcher<int> m = Ne(5);
[all...] |
| gmock-generated-matchers_test.cc | 73 using testing::Ne;
112 EXPECT_THAT(t, Not(Args<>(Ne(tuple<>()))));
133 EXPECT_THAT(t, Not(Args<1, 1>(Ne())));
323 Matcher<const list<int>& > m = ElementsAre(1, Ne(2));
426 ElementsAre(0, Ge(0), _, 3, 4, Ne(2), Eq(6), 7, 8, _));
468 EXPECT_THAT(nested, ElementsAre(ElementsAre('H', Ne('e')),
663 { Eq(1), Ne(-2), Ge(3), Le(4), Eq(5) }));
665 { Eq(1), Ne(-2), Ge(3), Le(4), Eq(6) })));
[all...] |
| gmock_link_test.h | 70 // Gt, Lt, Ge, Le, Ne
157 using testing::Ne;
494 // Tests the linkage of the Lt, Gt, Le, Ge, and Ne matchers.
502 ON_CALL(mock, VoidFromFloat(Ne(1.0f))).WillByDefault(Return());
|
| /external/v8/testing/gmock/test/ |
| gmock-matchers_test.cc | 116 using testing::Ne;
984 // Tests that Ne(v) matches anything != v.
986 Matcher<int> m1 = Ne(0);
992 // Tests that Ne(v) describes itself properly.
994 Matcher<int> m = Ne(5);
[all...] |
| gmock-generated-matchers_test.cc | 73 using testing::Ne;
113 EXPECT_THAT(t, Not(Args<>(Ne(tuple<>()))));
134 EXPECT_THAT(t, Not(Args<1, 1>(Ne())));
324 Matcher<const list<int>& > m = ElementsAre(1, Ne(2));
427 ElementsAre(0, Ge(0), _, 3, 4, Ne(2), Eq(6), 7, 8, _));
469 EXPECT_THAT(nested, ElementsAre(ElementsAre('H', Ne('e')),
664 { Eq(1), Ne(-2), Ge(3), Le(4), Eq(5) }));
666 { Eq(1), Ne(-2), Ge(3), Le(4), Eq(6) })));
[all...] |
| /external/flac/libFLAC/ |
| window.c | 242 FLAC__int32 Ns, Ne, n, i;
251 Ne = (FLAC__int32)(p / 2.0f * (L - end_n));
261 for (i = 1; n < end_n+Ne && n < L; n++, i++)
262 window[n] = (FLAC__real)(0.5f - 0.5f * cos(M_PI * i / Ne));
263 for (; n < L - (Ne) && n < L; n++)
265 for (i = Ne; n < L; n++, i--)
266 window[n] = (FLAC__real)(0.5f - 0.5f * cos(M_PI * i / Ne));
|
| /frameworks/base/tools/aapt2/util/ |
| Util_test.cpp | 25 using ::testing::Ne;
100 ASSERT_THAT(iter, Ne(tokenizer.end()));
111 ASSERT_THAT(iter, Ne(tokenizer.end()));
|
| /frameworks/base/tools/aapt2/ |
| StringPool_test.cpp | 29 using ::testing::Ne;
170 EXPECT_THAT(ref.index(), Ne(style_ref.index()));
180 EXPECT_THAT(ref_b.index(), Ne(ref_c.index()));
280 ASSERT_THAT(span->name.index, Ne(ResStringPool_span::END));
|
| /frameworks/base/tools/aapt2/java/ |
| JavaClassGenerator_test.cpp | 27 using ::testing::Ne;
363 ASSERT_THAT(actionbar_pos, Ne(std::string::npos));
366 ASSERT_THAT(actionbar_background_pos, Ne(std::string::npos));
369 ASSERT_THAT(actionbar_layout_params_pos, Ne(std::string::npos));
373 ASSERT_THAT(actionbar_layout_params_layout_gravity_pos, Ne(std::string::npos));
|
| /frameworks/native/libs/vr/libpdx/ |
| client_tests.cpp | 30 using testing::Ne;
458 SendWithInt(nullptr, 2, Ne(nullptr), 1, nullptr, 0))
467 SendWithInt(nullptr, 4, nullptr, 0, Ne(nullptr), 1))
477 SendWithInt(nullptr, 5, Ne(nullptr), 1, Ne(nullptr), 1))
|
| /external/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyTIL.h | [all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyTIL.h | [all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyTIL.h | [all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyTIL.h | [all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyTIL.h | [all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyTIL.h | [all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyTIL.h | [all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyTIL.h | [all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyTIL.h | [all...] |
| /external/v8/src/wasm/ |
| wasm-opcodes.cc | 58 CASE_ALL_OP(Ne, "ne")
170 CASE_SIMD_OP(Ne, "ne")
|
| /frameworks/base/tools/aapt2/flatten/ |
| XmlFlattener_test.cpp | 31 using ::testing::Ne;
171 ASSERT_THAT(tree.getEventType(), Ne(android::ResXMLTree::BAD_DOCUMENT));
172 ASSERT_THAT(tree.getEventType(), Ne(android::ResXMLTree::END_DOCUMENT));
188 ASSERT_THAT(tree.getEventType(), Ne(android::ResXMLTree::BAD_DOCUMENT));
189 ASSERT_THAT(tree.getEventType(), Ne(android::ResXMLTree::END_DOCUMENT));
203 ASSERT_THAT(tree.getEventType(), Ne(android::ResXMLTree::BAD_DOCUMENT));
204 ASSERT_THAT(tree.getEventType(), Ne(android::ResXMLTree::END_DOCUMENT));
237 ASSERT_THAT(tree.getEventType(), Ne(android::ResXMLTree::BAD_DOCUMENT));
238 ASSERT_THAT(tree.getEventType(), Ne(android::ResXMLTree::END_DOCUMENT));
263 ASSERT_THAT(tree.getEventType(), Ne(android::ResXMLTree::BAD_DOCUMENT))
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonCommonGEP.cpp | 476 bool node_eq(GepNode *N1, GepNode *N2, NodePairSet &Eq, NodePairSet &Ne) {
486 NodePairSet::iterator FNe = Ne.find(NP);
487 if (FNe != Ne.end())
497 Ne.insert(P);
503 if (Root1 || node_eq(N1->Parent, N2->Parent, Eq, Ne)) {
529 NodePairSet Eq, Ne; // Caches.
533 for (NodeSet::iterator NI = S.begin(), NE = S.end(); NI != NE; ++NI) {
543 for (NodeSet::iterator NJ = std::next(NI); NJ != NE; ++NJ)
544 if (node_eq(N, *NJ, Eq, Ne))
[all...] |
