| /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/deque/deque.modifiers/ |
| pop_back.pass.cpp | 39 test(std::deque<int>& c1)
43 std::size_t c1_osize = c1.size();
44 c1.pop_back();
45 assert(c1.size() == c1_osize - 1);
46 assert(distance(c1.begin(), c1.end()) == c1.size());
47 I i = c1.begin();
48 for (int j = 0; j < c1.size(); ++j, ++i)
58 C c1 = make(N, start) local
[all...] |
| pop_front.pass.cpp | 39 test(std::deque<int>& c1)
43 std::size_t c1_osize = c1.size();
44 c1.pop_front();
45 assert(c1.size() == c1_osize - 1);
46 assert(distance(c1.begin(), c1.end()) == c1.size());
47 I i = c1.begin();
48 for (int j = 1; j < c1.size(); ++j, ++i)
58 C c1 = make(N, start) local
[all...] |
| push_front.pass.cpp | 39 test(std::deque<int>& c1, int x)
43 std::size_t c1_osize = c1.size();
44 c1.push_front(x);
45 assert(c1.size() == c1_osize + 1);
46 assert(distance(c1.begin(), c1.end()) == c1.size());
47 I i = c1.begin();
58 C c1 = make(N, start); local
59 test(c1, -10)
[all...] |
| push_front_rvalue.pass.cpp | 43 test(std::deque<MoveOnly>& c1, int x)
47 std::size_t c1_osize = c1.size();
48 c1.push_front(MoveOnly(x));
49 assert(c1.size() == c1_osize + 1);
50 assert(distance(c1.begin(), c1.end()) == c1.size());
51 I i = c1.begin();
62 C c1 = make(N, start); local
63 test(c1, -10)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/deque/deque.special/ |
| copy.pass.cpp | 52 C c1 = make(N, start); local
54 assert(std::copy(c1.cbegin(), c1.cend(), c2.begin()) == c2.end());
55 assert(c1 == c2);
56 assert(std::copy(c2.cbegin(), c2.cend(), c1.begin()) == c1.end());
57 assert(c1 == c2);
58 assert(std::copy(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end()));
59 assert(c1 == c2)
[all...] |
| copy_backward.pass.cpp | 51 C c1 = make(N, start); local
53 assert(std::copy_backward(c1.cbegin(), c1.cend(), c2.end()) == c2.begin());
54 assert(c1 == c2);
55 assert(std::copy_backward(c2.cbegin(), c2.cend(), c1.end()) == c1.begin());
56 assert(c1 == c2);
57 assert(std::copy_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin()));
58 assert(c1 == c2)
[all...] |
| move.pass.cpp | 51 C c1 = make(N, start); local
53 assert(std::move(c1.cbegin(), c1.cend(), c2.begin()) == c2.end());
54 assert(c1 == c2);
55 assert(std::move(c2.cbegin(), c2.cend(), c1.begin()) == c1.end());
56 assert(c1 == c2);
57 assert(std::move(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end()));
58 assert(c1 == c2)
[all...] |
| move_backward.pass.cpp | 51 C c1 = make(N, start); local
53 assert(std::move_backward(c1.cbegin(), c1.cend(), c2.end()) == c2.begin());
54 assert(c1 == c2);
55 assert(std::move_backward(c2.cbegin(), c2.cend(), c1.end()) == c1.begin());
56 assert(c1 == c2);
57 assert(std::move_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin()));
58 assert(c1 == c2)
[all...] |
| swap.pass.cpp | 43 C c1 = make(N, start); local
45 C c1_save = c1;
47 swap(c1, c2);
48 assert(c1 == c2_save);
66 std::deque<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A(1));
68 swap(c1, c2);
69 assert((c1 == std::deque<int, A>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
70 assert(c1.get_allocator() == A(1));
78 std::deque<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A(1));
80 swap(c1, c2)
[all...] |
| /libcore/luni/src/test/java/tests/security/cert/ |
| CertificateTest.java | 63 Certificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
64 assertTrue(Arrays.equals(testEncoding, c1.getEncoded()));
65 assertEquals("TEST", c1.getPublicKey().getAlgorithm());
67 c1.getPublicKey().getEncoded()));
68 assertEquals("TEST_FORMAT", c1.getPublicKey().getFormat());
69 assertEquals("TEST_TYPE", c1.getType());
78 Certificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
81 assertTrue(c1.hashCode() == c2.hashCode());
83 assertFalse(c1.hashCode() == new MyCertificate("TEST_TYPE", cert
85 assertFalse(c1.hashCode() == cert.hashCode())
93 Certificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
106 Certificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
115 Certificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
125 Certificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
135 Certificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
145 Certificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
158 Certificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
192 Certificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
211 Certificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
219 Certificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
227 Certificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
235 MyCertificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
388 Certificate c1 = new MyCertificate("TEST_TYPE", testEncoding); local
415 MyCertificate c1 = new MyFailingCertificate("TEST_TYPE", testEncoding); local
[all...] |
| /external/apache-harmony/x-net/src/test/impl/java.injected/org/apache/harmony/xnet/provider/jsse/ |
| CipherSuiteTest.java | 29 CipherSuite c1 = new CipherSuite("CipherSuite1", false, 0, "", "", local
37 if (!c1.equals(c2) || c1.equals(c3) || c4.equals(c1) || c4.equals(c3)) {
43 CipherSuite c1 = new CipherSuite("CipherSuite1", false, 0, "", "", local
46 c1.toString());
91 CipherSuite c1 = new CipherSuite("CipherSuite1", false, local
100 assertTrue(c1.isAnonymous());
101 assertTrue(c1.isAnonymous());
|
| /dalvik/vm/hprof/ |
| HprofClass.cpp | 57 const ClassObject *c1 = (const ClassObject *)v1; local
61 diff = (uintptr_t)c1->classLoader - (uintptr_t)c2->classLoader;
63 return strcmp(c1->descriptor, c2->descriptor);
|
| /external/apache-harmony/security/src/test/api/java/tests/api/java/security/ |
| DomainCombinerTest.java | 76 final AccessControlContext c1 = new AccessControlContext(parent, local
|
| /external/bison/lib/ |
| strverscmp.c | 65 unsigned char c1, c2; local
98 c1 = *p1++;
101 state = S_N | ((c1 == '0') + (ISDIGIT (c1) != 0));
103 while ((diff = c1 - c2) == 0 && c1 != '\0')
106 c1 = *p1++;
108 state |= (c1 == '0') + (ISDIGIT (c1) != 0);
|
| /external/clang/test/CodeGenCXX/ |
| array-operator-delete-call.cpp | 53 COST c1; variable
|
| /external/clang/test/Misc/ |
| diag-aka-types.cpp | 7 char c1 = ptr; // expected-error{{'foo_t *' (aka 'X *')}} variable
|
| /external/clang/test/SemaCXX/ |
| constexpr-value-init.cpp | 26 constexpr C c1; // expected-error {{requires a user-provided default constructor}} variable
|
| vtable-instantiation.cc | 4 template<class T1> struct C1 {
5 virtual void c1() { function in struct:PR8640::C1
12 new C1<T2>(); // expected-note {{in instantiation of member function}}
|
| /external/eigen/test/ |
| redux.cpp | 50 Index c1 = internal::random<Index>(c0+1,cols)-c0; local
51 VERIFY_IS_APPROX(m1.block(r0,c0,r1,c1).sum(), m1.block(r0,c0,r1,c1).eval().sum());
52 VERIFY_IS_APPROX(m1.block(r0,c0,r1,c1).mean(), m1.block(r0,c0,r1,c1).eval().mean());
53 VERIFY_IS_APPROX(m1_for_prod.block(r0,c0,r1,c1).prod(), m1_for_prod.block(r0,c0,r1,c1).eval().prod());
54 VERIFY_IS_APPROX(m1.block(r0,c0,r1,c1).real().minCoeff(), m1.block(r0,c0,r1,c1).real().eval().minCoeff());
55 VERIFY_IS_APPROX(m1.block(r0,c0,r1,c1).real().maxCoeff(), m1.block(r0,c0,r1,c1).real().eval().maxCoeff())
[all...] |
| /external/guava/guava/src/com/google/common/hash/ |
| Murmur3_32HashFunction.java | 46 int c1 = 0xcc9e2d51; field in class:Murmur3_32HashFunction.Murmur3_32Hasher
59 k1 *= c1;
82 k1 *= c1;
|
| /external/libnfc-nxp/src/ |
| phFriNfc_NdefReg.c | 51 int8_t c1, c2; local
55 c1 = *s1;
57 if (c1 >=97)
58 c1 = (c1 - 32);
65 while ( (c1 == c2) && (c1 != '\0') && (c2 != '\0') && (count > 0) );
67 if ( (count == 0) || (c1 == c2) )
70 else if ( (c1 > c2) )
|
| /external/openssl/crypto/bn/asm/ |
| s390x.S | 329 #define c1 %r1 define
333 #define mul_add_c(ai,bi,c1,c2,c3) \
336 algr c1,%r7; \
347 lghi c1,0
352 mul_add_c(0,0,c1,c2,c3);
353 stg c1,0*8(%r2)
354 lghi c1,0
356 mul_add_c(0,1,c2,c3,c1);
357 mul_add_c(1,0,c2,c3,c1);
361 mul_add_c(2,0,c3,c1,c2)
[all...] |
| /external/openssl/crypto/bn/ |
| bn_sqr.c | 209 int zero,c1; local
239 c1=bn_cmp_words(a,&(a[n]),n);
241 if (c1 > 0)
243 else if (c1 < 0)
263 c1=(int)(bn_add_words(t,r,&(r[n2]),n2));
266 c1-=(int)(bn_sub_words(&(t[n2]),t,&(t[n2]),n2));
271 * c1 holds the carry bits
273 c1+=(int)(bn_add_words(&(r[n]),&(r[n]),&(t[n2]),n2));
274 if (c1)
278 ln=(lo+c1)&BN_MASK2
[all...] |
| /external/v8/test/mjsunit/compiler/ |
| inline-construct.js | 76 function c1(a, b, counter) { class
80 TestInAllContexts(c1);
|
| /external/valgrind/main/massif/tests/ |
| alloc-fns.c | 16 void c1(int n) { c2(n); } function
29 c1(400);
|
