| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/priority.queue/priqueue.special/ |
| swap_noexcept.pass.cpp | 28 C c1, c2; local
29 static_assert(noexcept(swap(c1, c2)), "");
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/queue/queue.special/ |
| swap_noexcept.pass.cpp | 27 C c1, c2; local
28 static_assert(noexcept(swap(c1, c2)), "");
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/stack/stack.special/ |
| swap_noexcept.pass.cpp | 27 C c1, c2; local
28 static_assert(noexcept(swap(c1, c2)), "");
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.special/ |
| swap_noexcept.pass.cpp | 41 C c1, c2; local
42 static_assert(noexcept(swap(c1, c2)), "");
46 C c1, c2; local
47 static_assert(noexcept(swap(c1, c2)), "");
51 C c1, c2; local
52 static_assert(noexcept(swap(c1, c2)), "");
56 C c1, c2; local
57 static_assert(!noexcept(swap(c1, c2)), "");
|
| copy.pass.cpp | 55 C c2 = make<C>(N); local
56 assert(std::copy(c1.cbegin(), c1.cend(), c2.begin()) == c2.end());
57 assert(c1 == c2);
58 assert(std::copy(c2.cbegin(), c2.cend(), c1.begin()) == c1.end());
59 assert(c1 == c2);
60 assert(std::copy(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end()));
61 assert(c1 == c2);
[all...] |
| copy_backward.pass.cpp | 54 C c2 = make<C>(N); local
55 assert(std::copy_backward(c1.cbegin(), c1.cend(), c2.end()) == c2.begin());
56 assert(c1 == c2);
57 assert(std::copy_backward(c2.cbegin(), c2.cend(), c1.end()) == c1.begin());
58 assert(c1 == c2);
59 assert(std::copy_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin()));
60 assert(c1 == c2);
[all...] |
| move.pass.cpp | 54 C c2 = make<C>(N); local
55 assert(std::move(c1.cbegin(), c1.cend(), c2.begin()) == c2.end());
56 assert(c1 == c2);
57 assert(std::move(c2.cbegin(), c2.cend(), c1.begin()) == c1.end());
58 assert(c1 == c2);
59 assert(std::move(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end()));
60 assert(c1 == c2);
[all...] |
| move_backward.pass.cpp | 54 C c2 = make<C>(N); local
55 assert(std::move_backward(c1.cbegin(), c1.cend(), c2.end()) == c2.begin());
56 assert(c1 == c2);
57 assert(std::move_backward(c2.cbegin(), c2.cend(), c1.end()) == c1.begin());
58 assert(c1 == c2);
59 assert(std::move_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin()));
60 assert(c1 == c2);
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.spec/ |
| equal.pass.cpp | 34 C c2; local
36 c2.push_front(i);
38 assert(c1 == c2);
40 assert(c1 != c2);
41 c2 = c1;
42 assert(c1 == c2);
45 c2.front() = N+1;
46 assert(c1 != c2);
|
| swap_noexcept.pass.cpp | 41 C c1, c2; local
42 static_assert(noexcept(swap(c1, c2)), "");
46 C c1, c2; local
47 static_assert(noexcept(swap(c1, c2)), "");
51 C c1, c2; local
52 static_assert(noexcept(swap(c1, c2)), "");
56 C c1, c2; local
57 static_assert(!noexcept(swap(c1, c2)), "");
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.special/ |
| swap_noexcept.pass.cpp | 41 C c1, c2; local
42 static_assert(noexcept(swap(c1, c2)), "");
46 C c1, c2; local
47 static_assert(noexcept(swap(c1, c2)), "");
51 C c1, c2; local
52 static_assert(noexcept(swap(c1, c2)), "");
56 C c1, c2; local
57 static_assert(!noexcept(swap(c1, c2)), "");
|
| swap.pass.cpp | 26 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
27 swap(c1, c2);
29 assert(c2 == std::list<int>(a1, a1+sizeof(a1)/sizeof(a1[0])));
35 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
36 swap(c1, c2);
38 assert(c2.empty());
39 assert(distance(c2.begin(), c2.end()) == 0);
45 std::list<int> c2(a2, a2);
46 swap(c1, c2);
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.special/ |
| swap_noexcept.pass.cpp | 41 C c1, c2; local
42 static_assert(noexcept(swap(c1, c2)), "");
46 C c1, c2; local
47 static_assert(noexcept(swap(c1, c2)), "");
51 C c1, c2; local
52 static_assert(noexcept(swap(c1, c2)), "");
56 C c1, c2; local
57 static_assert(!noexcept(swap(c1, c2)), "");
|
| swap.pass.cpp | 26 std::vector<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
27 swap(c1, c2);
29 assert(c2 == std::vector<int>(a1, a1+sizeof(a1)/sizeof(a1[0])));
35 std::vector<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
36 swap(c1, c2);
38 assert(c2.empty());
39 assert(distance(c2.begin(), c2.end()) == 0);
45 std::vector<int> c2(a2, a2);
46 swap(c1, c2);
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector.bool/ |
| swap_noexcept.pass.cpp | 40 C c1, c2; local
41 static_assert(noexcept(swap(c1, c2)), "");
45 C c1, c2; local
46 static_assert(noexcept(swap(c1, c2)), "");
50 C c1, c2; local
51 static_assert(noexcept(swap(c1, c2)), "");
55 C c1, c2; local
56 static_assert(!noexcept(swap(c1, c2)), "");
|
| /bionic/libc/upstream-freebsd/lib/libc/string/ |
| wcsncasecmp.c | 36 wchar_t c1, c2; local
42 c2 = towlower(*s2);
43 if (c1 != c2)
44 return ((int)c1 - c2);
|
| /external/valgrind/main/memcheck/tests/ |
| leak-cycle.c | 39 struct n *volatile c1, *volatile c2; local
45 c2 = mkcycle();
47 c1 = c2 = 0;
51 c2 = mkcycle();
55 if (c1 < c2)
56 c2->r = c1;
58 c1->r = c2;
60 c1 = c2 = 0;
64 c2 = mkcycle();
66 c1->r = c2;
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/ |
| eq.pass.cpp | 45 const C c2; local
46 assert(!(c1 == c2));
47 assert( (c1 != c2));
64 const C c2 = c1; local
65 assert( (c1 == c2));
66 assert(!(c1 != c2));
83 C c2 = c1; local
84 c2.rehash(30);
85 assert( (c1 == c2));
86 assert(!(c1 != c2));
111 const C c2; local
131 const C c2 = c1; local
151 C c2 = c1; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/ |
| eq.pass.cpp | 48 const C c2; local
49 assert(!(c1 == c2));
50 assert( (c1 != c2));
70 const C c2 = c1; local
71 assert( (c1 == c2));
72 assert(!(c1 != c2));
92 C c2 = c1; local
93 c2.rehash(30);
94 assert( (c1 == c2));
95 assert(!(c1 != c2));
123 const C c2; local
146 const C c2 = c1; local
169 C c2 = c1; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
| eq.pass.cpp | 47 const C c2; local
48 assert(!(c1 == c2));
49 assert( (c1 != c2));
69 const C c2 = c1; local
70 assert( (c1 == c2));
71 assert(!(c1 != c2));
91 C c2 = c1; local
92 c2.rehash(30);
93 assert( (c1 == c2));
94 assert(!(c1 != c2));
122 const C c2; local
145 const C c2 = c1; local
168 C c2 = c1; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
| eq.pass.cpp | 44 const C c2; local
45 assert(!(c1 == c2));
46 assert( (c1 != c2));
63 const C c2 = c1; local
64 assert( (c1 == c2));
65 assert(!(c1 != c2));
82 C c2 = c1; local
83 c2.rehash(30);
84 assert( (c1 == c2));
85 assert(!(c1 != c2));
109 const C c2; local
128 const C c2 = c1; local
147 C c2 = c1; local
[all...] |
| /external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/java/security/spec/ |
| EllipticCurve_ImplTest.java | 45 EllipticCurve c2=null, c1 = local
49 assertFalse(c1.equals(c2));
55 c2 = new EllipticCurve(new ECFieldFp(BigInteger.valueOf(31L)),
58 assertFalse(c1.equals(c2) || c2.equals(c1));
64 c2 = new EllipticCurve(new ECFieldFp(BigInteger.valueOf(23L)),
67 assertFalse(c1.equals(c2) || c2.equals(c1));
73 c2 = new EllipticCurve(new ECFieldFp(BigInteger.valueOf(23L)),
76 assertFalse(c1.equals(c2) || c2.equals(c1))
[all...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/bn/asm/ |
| x86_64-gcc.c | 271 /* mul_add_c(a,b,c0,c1,c2) -- c+=a*b for three word number c=(c2,c1,c0) */
272 /* mul_add_c2(a,b,c0,c1,c2) -- c+=2*a*b for three word number c=(c2,c1,c0) */
273 /* sqr_add_c(a,i,c0,c1,c2) -- c+=a[i]^2 for three word number c=(c2,c1,c0) */
274 /* sqr_add_c2(a,i,c0,c1,c2) -- c+=2*a[i]*a[j] for three word number c=(c2,c1,c0) */
278 #define mul_add_c(a,b,c0,c1,c2) { \
283 c1 += t2; c2 += (c1<t2)?1:0;
356 BN_ULONG c1,c2,c3; local
460 BN_ULONG c1,c2,c3; local
500 BN_ULONG c1,c2,c3; local
576 BN_ULONG c1,c2,c3; local
[all...] |
| /external/openssl/crypto/bn/asm/ |
| x86_64-gcc.c | 271 /* mul_add_c(a,b,c0,c1,c2) -- c+=a*b for three word number c=(c2,c1,c0) */
272 /* mul_add_c2(a,b,c0,c1,c2) -- c+=2*a*b for three word number c=(c2,c1,c0) */
273 /* sqr_add_c(a,i,c0,c1,c2) -- c+=a[i]^2 for three word number c=(c2,c1,c0) */
274 /* sqr_add_c2(a,i,c0,c1,c2) -- c+=2*a[i]*a[j] for three word number c=(c2,c1,c0) */
278 #define mul_add_c(a,b,c0,c1,c2) { \
283 c1 += t2; c2 += (c1<t2)?1:0;
356 BN_ULONG c1,c2,c3; local
460 BN_ULONG c1,c2,c3; local
500 BN_ULONG c1,c2,c3; local
576 BN_ULONG c1,c2,c3; local
[all...] |
| /frameworks/base/core/tests/coretests/src/android/widget/ |
| TextViewTest.java | 49 char[] c2 = new char[7]; local
50 ((GetChars) newText).getChars(1, 4, c2, 2);
51 assertEquals('\0', c2[1]);
52 assertEquals(' ', c2[2]);
53 assertEquals('W', c2[3]);
54 assertEquals('o', c2[4]);
55 assertEquals('\0', c2[5]);
|
