Searched refs:c2 (Results 76 - 100 of 939) sorted by relevance

1234567891011>>

/external/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/
H A Dremove_if.pass.cpp33 C c2(std::begin(t2), std::end(t2));
35 assert(c1 == c2);
42 C c2; local
44 assert(c1 == c2);
52 C c2(std::begin(t2), std::end(t2));
54 assert(c1 == c2);
60 C c2; local
62 assert(c1 == c2);
70 C c2(std::begin(t2), std::end(t2));
72 assert(c1 == c2);
90 C c2; local
108 C c2; local
[all...]
H A Dunique.pass.cpp28 C c2(std::begin(t2), std::end(t2));
30 assert(c1 == c2);
38 C c2(std::begin(t2), std::end(t2));
40 assert(c1 == c2);
48 C c2(std::begin(t2), std::end(t2));
50 assert(c1 == c2);
56 C c2; local
58 assert(c1 == c2);
66 C c2(std::begin(t2), std::end(t2));
68 assert(c1 == c2);
105 C c2; local
[all...]
H A Dunique_pred.pass.cpp33 C c2(std::begin(t2), std::end(t2));
35 assert(c1 == c2);
43 C c2(std::begin(t2), std::end(t2));
45 assert(c1 == c2);
53 C c2(std::begin(t2), std::end(t2));
55 assert(c1 == c2);
61 C c2; local
63 assert(c1 == c2);
71 C c2(std::begin(t2), std::end(t2));
73 assert(c1 == c2);
110 C c2; local
[all...]
/external/chromium_org/third_party/boringssl/src/crypto/bn/
H A Dgeneric.c651 /* mul_add_c(a,b,c0,c1,c2) -- c+=a*b for three word number c=(c2,c1,c0) */
652 /* mul_add_c2(a,b,c0,c1,c2) -- c+=2*a*b for three word number c=(c2,c1,c0) */
653 /* sqr_add_c(a,i,c0,c1,c2) -- c+=a[i]^2 for three word number c=(c2,c1,c0) */
654 /* sqr_add_c2(a,i,c0,c1,c2) -- c+=2*a[i]*a[j] for three word number c=(c2,c1,c0) */
657 #define mul_add_c(a, b, c0, c1, c2) \
666 c2
826 BN_ULONG c1, c2, c3; local
934 BN_ULONG c1, c2, c3; local
978 BN_ULONG c1, c2, c3; local
1058 BN_ULONG c1, c2, c3; local
[all...]
/external/proguard/src/proguard/io/
H A DManifestRewriter.java96 int c2 = super.read();
99 if ((c2 == '\n' || c2 == '\r') && c1 != c2)
101 c2 = super.read();
105 if (c2 != ' ')
108 bufferedCharacter = c2;
/external/lzma/CPP/Common/
H A DMyString.cpp141 wchar_t c2 = *s2++;
143 wchar_t u2 = MyCharUpper(c2);
159 unsigned char c2 = (unsigned char)*s2++; local
160 if (c1 < c2) return -1;
161 if (c1 > c2) return 1;
171 wchar_t c2 = *s2++; local
172 if (c1 < c2) return -1;
173 if (c1 > c2) return 1;
183 wchar_t c2 = *s2++; local
184 if (c1 != c2)
[all...]
/external/apache-http/src/org/apache/http/cookie/
H A DCookieIdentityComparator.java56 public int compare(final Cookie c1, final Cookie c2) { argument
57 int res = c1.getName().compareTo(c2.getName());
64 String d2 = c2.getDomain();
/external/libcxx/test/containers/sequences/deque/deque.cons/
H A Dassign_iter_iter.pass.cpp45 test(C& c1, const C& c2) argument
48 c1.assign(c2.begin(), c2.end());
50 assert(c1 == c2);
60 C c2 = make<C>(M); local
61 test(c1, c2);
66 testI(C& c1, const C& c2) argument
71 c1.assign(ICI(c2.begin()), ICI(c2.end()));
73 assert(c1 == c2);
83 C c2 = make<C>(M); local
[all...]
/external/clang/test/CXX/dcl.decl/dcl.init/dcl.init.list/
H A Dp7-0x-fixits.cpp10 struct {char c;} c2 = {x}; local
/external/clang/test/CodeGen/
H A Dconstant-comparison.c6 int *c2 = 3 != 3LL ? &b : &a; variable
/external/clang/test/Parser/
H A Dc11-noreturn.c10 char _Noreturn c2; // expected-error {{'_Noreturn' can only appear on functions}} variable
/external/clang/test/SemaCXX/
H A Dvtable-instantiation.cc11 void c2() { function in struct:PR8640::C2
17 C2<int*> c2; local
18 c2.c2(); // expected-note {{in instantiation of member function}}
/external/libcxx/test/containers/sequences/deque/deque.special/
H A Dswap.pass.cpp46 C c2 = make<C>(M); local
48 C c2_save = c2;
49 swap(c1, c2);
51 assert(c2 == c1_save);
69 std::deque<int, A> c2(a2, a2+sizeof(a2)/sizeof(a2[0]), A(2));
70 swap(c1, c2);
73 assert((c2 == std::deque<int, A>(a1, a1+sizeof(a1)/sizeof(a1[0]))));
74 assert(c2.get_allocator() == A(2));
81 std::deque<int, A> c2(a2, a2+sizeof(a2)/sizeof(a2[0]), A(2));
82 swap(c1, c2);
[all...]
/external/libcxx/test/containers/sequences/list/list.ops/
H A Dmerge.pass.cpp26 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
27 c1.merge(c2);
36 std::list<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
37 c1.merge(c2);
H A Dmerge_comp.pass.cpp27 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
28 c1.merge(c2, std::greater<int>());
37 std::list<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
38 c1.merge(c2, std::greater<int>());
/external/libcxx/test/containers/unord/unord.map/unord.map.swap/
H A Ddb_swap_1.pass.cpp33 std::unordered_map<int, int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
35 std::unordered_map<int, int>::iterator i2 = c2.begin();
36 swap(c1, c2);
38 c2.erase(i1);
/external/libcxx/test/containers/unord/unord.multimap/unord.multimap.swap/
H A Ddb_swap_1.pass.cpp33 std::unordered_multimap<int, int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
35 std::unordered_multimap<int, int>::iterator i2 = c2.begin();
36 swap(c1, c2);
38 c2.erase(i1);
/external/libcxx/test/containers/unord/unord.multiset/unord.multiset.swap/
H A Ddb_swap_1.pass.cpp32 std::unordered_multiset<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
34 std::unordered_multiset<int>::iterator i2 = c2.begin();
35 swap(c1, c2);
37 c2.erase(i1);
/external/libcxx/test/containers/unord/unord.set/unord.set.swap/
H A Ddb_swap_1.pass.cpp32 std::unordered_set<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
34 std::unordered_set<int>::iterator i2 = c2.begin();
35 swap(c1, c2);
37 c2.erase(i1);
/external/pdfium/core/src/fxcodec/fx_libopenjpeg/libopenjpeg20/
H A Dmct.h60 @param c2 Samples blue component
63 void opj_mct_encode(OPJ_INT32 *c0, OPJ_INT32 *c1, OPJ_INT32 *c2, OPJ_UINT32 n);
68 @param c2 Samples for blue chrominance component
71 void opj_mct_decode(OPJ_INT32 *c0, OPJ_INT32 *c1, OPJ_INT32 *c2, OPJ_UINT32 n);
83 @param c2 Samples blue component
86 void opj_mct_encode_real(OPJ_INT32 *c0, OPJ_INT32 *c1, OPJ_INT32 *c2, OPJ_UINT32 n);
91 @param c2 Samples for blue chrominance component
94 void opj_mct_decode_real(OPJ_FLOAT32* c0, OPJ_FLOAT32* c1, OPJ_FLOAT32* c2, OPJ_UINT32 n);
/external/libcxx/test/containers/sequences/deque/deque.modifiers/
H A Dinsert_iter_iter.pass.cpp47 test(int P, C& c1, const C& c2) argument
53 CI i = c1.insert(c1.begin() + P, BCI(c2.begin()), BCI(c2.end()));
55 assert(c1.size() == c1_osize + c2.size());
60 for (int j = 0; j < c2.size(); ++j, ++i)
77 C c2 = make<C>(M); local
78 test(i, c1, c2);
86 C c2 = make<C>(M); local
87 test(i, c1, c2);
95 C c2 local
104 C c2 = make<C>(M); local
113 C c2 = make<C>(M); local
122 C c2 = make<C>(M); local
130 testI(int P, C& c1, const C& c2) argument
160 C c2 = make<C>(M); local
169 C c2 = make<C>(M); local
178 C c2 = make<C>(M); local
187 C c2 = make<C>(M); local
196 C c2 = make<C>(M); local
[all...]
/external/chromium_org/v8/test/mjsunit/regress/
H A Dregress-618.js47 var c2 = new C2();
48 assertEquals(23, c2.x);
49 assertEquals("undefined", typeof c2.y);
54 var c2 = new C2();
55 assertEquals("undefined", typeof c2.x);
56 assertEquals(23, c2.y);
/external/fio/lib/
H A Dbswap.h9 uint32_t c1, c2, c3, c4; local
12 c2 = (val >> 16) & 0xff;
16 return c1 | c2 << 8 | c3 << 16 | c4 << 24;
21 uint64_t c1, c2, c3, c4, c5, c6, c7, c8; local
24 c2 = (val >> 48) & 0xff;
32 return c1 | c2 << 8 | c3 << 16 | c4 << 24 | c5 << 32 | c6 << 40 | c7 << 48 | c8 << 56;
/external/libcxx/test/numerics/complex.number/complex.literals/
H A Dliterals.pass.cpp32 auto c2 = 3il; local
33 assert ( c1 == c2 );
39 auto c2 = 3i; local
40 assert ( c1 == c2 );
46 auto c2 = 3if; local
47 assert ( c1 == c2 );
/external/chromium_org/third_party/icu/source/common/
H A Dutrie.h184 #define _UTRIE_GET_FROM_PAIR(trie, data, c, c2, result, resultType) { \
193 (result)=_UTRIE_GET_RAW((trie), data, __offset, (c2)&0x3ff); \
221 /** Internal next-post-increment: get the next code point (c, c2) and its data */
222 #define _UTRIE_NEXT(trie, data, src, limit, c, c2, result, resultType) { \
225 (c2)=0; \
227 } else if((src)!=(limit) && U16_IS_TRAIL((c2)=*(src))) { \
229 _UTRIE_GET_FROM_PAIR((trie), data, (c), (c2), (result), resultType); \
232 (c2)=0; \
237 /** Internal previous: get the previous code point (c, c2) and its data */
238 #define _UTRIE_PREVIOUS(trie, data, start, src, c, c2, resul
[all...]

Completed in 678 milliseconds

1234567891011>>