Searched refs:c2 (Results 101 - 125 of 933) sorted by relevance

1234567891011>>

/external/icu/icu4c/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...]
H A Dunormcmp.cpp62 * get one code unit c2 from s2 (-1 if end of source)
67 * if(c1==c2) {
71 * // c1!=c2
72 * try to decompose/case-fold c1/c2, and continue if one does;
74 * // still c1!=c2 and neither decomposes/case-folds, return result
75 * return c1-c2;
168 UChar32 c1, c2, cp1, cp2; local
209 c1=c2=-1;
241 if(c2<0) {
244 if(s2==limit2 || ((c2
[all...]
/external/libcxx/test/std/containers/sequences/deque/deque.modifiers/
H A Dinsert_iter_iter.pass.cpp50 test(int P, const C& c0, const C& c2) argument
57 CI i = c1.insert(c1.begin() + P, BCI(c2.begin()), BCI(c2.end()));
59 assert(c1.size() == c1_osize + c2.size());
64 for (int j = 0; j < c2.size(); ++j, ++i)
74 CI i = c1.insert(c1.begin() + P, BCI(c2.begin()), BCI(c2.end()));
76 assert(c1.size() == c1_osize + c2.size());
81 for (int j = 0; j < c2.size(); ++j, ++i)
91 CI i = c1.insert(c1.begin() + P, BCI(c2
114 C c2 = make<C>(M); local
123 C c2 = make<C>(M); local
132 C c2 = make<C>(M); local
141 C c2 = make<C>(M); local
150 C c2 = make<C>(M); local
159 C c2 = make<C>(M); local
167 testI(int P, C& c1, const C& c2) argument
194 C c2 = make<C>(M); local
203 C c2 = make<C>(M); local
212 C c2 = make<C>(M); local
221 C c2 = make<C>(M); local
230 C c2 = make<C>(M); local
[all...]
/external/boringssl/src/crypto/bn/asm/
H A Dco-586.pl18 local($a,$ai,$b,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
38 &adc($c2,0);
46 local($r,$a,$ai,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
67 &adc($c2,0);
75 local($r,$a,$ai,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
94 &adc($c2,0);
99 &adc($c2,0);
108 local($a,$b,$c0,$c1,$c2);
116 $c2="ebp";
148 &xor($c2,
[all...]
/external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.ops/
H A Dremove.pass.cpp39 C c2(std::begin(t2), std::end(t2));
41 assert(c1 == c2);
48 C c2; local
50 assert(c1 == c2);
58 C c2(std::begin(t2), std::end(t2));
60 assert(c1 == c2);
66 C c2; local
68 assert(c1 == c2);
76 C c2(std::begin(t2), std::end(t2));
78 assert(c1 == c2);
122 C c2; local
140 C c2; local
[all...]
H A Dremove_if.pass.cpp36 C c2(std::begin(t2), std::end(t2));
39 assert(c1 == c2);
48 C c2; local
51 assert(c1 == c2);
61 C c2(std::begin(t2), std::end(t2));
64 assert(c1 == c2);
72 C c2; local
75 assert(c1 == c2);
85 C c2(std::begin(t2), std::end(t2));
88 assert(c1 == c2);
111 C c2; local
135 C c2; local
[all...]
/external/lzma/CPP/Common/
H A DUTFConvert.cpp31 Byte c2 = *src++; local
32 if (c2 < 0x80 || c2 >= 0xC0)
35 value |= (c2 - 0x80);
75 Byte c2; local
78 c2 = (Byte)src[srcPos++];
79 if (c2 < 0x80 || c2 >= 0xC0)
82 value |= (c2 - 0x80);
131 UInt32 c2; 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/eigen/test/
H A Dblock.cpp15 block_real_only(const MatrixType &m1, Index r1, Index r2, Index c1, Index c2, const Scalar& s1) { argument
20 VERIFY_IS_APPROX(m1.block(r1,c1,r2-r1+1,c2-c1+1).cwiseMin(s1), m1.cwiseMin(s1).block(r1,c1,r2-r1+1,c2-c1+1));
21 VERIFY_IS_APPROX(m1.block(r1,c1,r2-r1+1,c2-c1+1).cwiseMax(s1), m1.cwiseMax(s1).block(r1,c1,r2-r1+1,c2-c1+1));
58 Index c2 = internal::random<Index>(c1,cols-1); local
72 m1.col(c1) += s1 * m1_copy.col(c2);
73 VERIFY_IS_APPROX(m1.col(c1), m1_copy.col(c1) + s1 * m1_copy.col(c2));
74 m1.col(c1).col(0) += s1 * m1_copy.col(c2);
75 VERIFY_IS_APPROX(m1.col(c1), m1_copy.col(c1) + Scalar(2) * s1 * m1_copy.col(c2));
223 Index c2 = internal::random<Index>(c1,cols-1); local
[all...]
/external/libcxx/test/std/containers/sequences/deque/deque.cons/
H A Dmove.pass.cpp31 std::deque<MoveOnly, A> c2(A(2));
33 c2.push_back(MoveOnly(*p));
35 assert(c2 == c3);
46 std::deque<MoveOnly, A> c2(A(2));
48 c2.push_back(MoveOnly(*p));
50 assert(c2 == c3);
62 std::deque<MoveOnly, A> c2(A{});
64 c2.push_back(MoveOnly(*p));
66 assert(c2 == c3);
H A Dmove_alloc.pass.cpp31 std::deque<MoveOnly, A> c2(A(1));
33 c2.push_back(MoveOnly(*p));
35 assert(c2 == c3);
46 std::deque<MoveOnly, A> c2(A(1));
48 c2.push_back(MoveOnly(*p));
50 assert(c2 == c3);
61 std::deque<MoveOnly, A> c2(A(1));
63 c2.push_back(MoveOnly(*p));
65 assert(c2 == c3);
77 std::deque<MoveOnly, A> c2(
[all...]
H A Dmove_assign.pass.cpp31 std::deque<MoveOnly, A> c2(A(5));
33 c2.push_back(MoveOnly(*p));
36 assert(c2 == c3);
47 std::deque<MoveOnly, A> c2(A(5));
49 c2.push_back(MoveOnly(*p));
52 assert(c2 == c3);
63 std::deque<MoveOnly, A> c2(A(5));
65 c2.push_back(MoveOnly(*p));
68 assert(c2 == c3);
80 std::deque<MoveOnly, A> c2(
[all...]
/external/ceres-solver/internal/ceres/
H A Dsingle_linkage_clustering.cc78 const int c2 = FindConnectedComponent(vertex2, membership); local
80 if (c1 == c2) {
84 if (c1 < c2) {
85 (*membership)[c2] = c1;
87 (*membership)[c1] = c2;
/external/fio/crc/
H A Dmurmur3.c24 const uint32_t c2, uint32_t h1)
38 k1 *= c2;
51 const uint32_t c2 = 0x1b873593; local
60 k1 *= c2;
67 return murmur3_tail(data, nblocks, len, c1, c2, h1);
22 murmur3_tail(const uint8_t *data, const int nblocks, uint32_t len, const uint32_t c1, const uint32_t c2, uint32_t h1) argument
/external/testng/src/test/java/test/parameters/
H A DShadowTest.java32 XmlClass c2 = new XmlClass(Shadow2SampleTest.class.getName());
34 include2.setXmlClass(c2);
35 c2.getLocalParameters().put("a", "Second");
36 c2.getIncludedMethods().add(include2);
37 t.getXmlClasses().add(c2);
/external/clang/test/CodeGen/
H A Datomics-inlining.c7 unsigned char c1, c2; variable
23 (void)__atomic_load(&c1, &c2, memory_order_seq_cst);
24 (void)__atomic_store(&c1, &c2, memory_order_seq_cst);
/external/libcxx/test/std/numerics/complex.number/complex.member.ops/
H A Ddivide_equal_complex.pass.cpp22 const std::complex<T> c2(1.5, 2.5);
25 c /= c2;
28 c /= c2;
H A Dminus_equal_complex.pass.cpp22 const std::complex<T> c2(1.5, 2.5);
25 c -= c2;
28 c -= c2;
H A Dplus_equal_complex.pass.cpp22 const std::complex<T> c2(1.5, 2.5);
25 c += c2;
28 c += c2;
H A Dtimes_equal_complex.pass.cpp22 const std::complex<T> c2(1.5, 2.5);
25 c *= c2;
28 c *= c2;
/external/libcxx/test/std/utilities/template.bitset/bitset.members/
H A Dcount.pass.cpp33 std::size_t c2 = 0; local
36 ++c2;
37 assert(c1 == c2);
/external/mockito/src/org/mockito/internal/creation/
H A DSerializableMockitoMethodProxy.java16 private final Class<?> c2; field in class:SerializableMockitoMethodProxy
25 c2 = (Class<?>) Whitebox.getInternalState(info, "c2");
34 methodProxy = MethodProxy.create(c1, c2, desc, name, superName);
/external/bison/lib/
H A Dstrverscmp.c65 unsigned char c1, c2; local
99 c2 = *p2++;
103 while ((diff = c1 - c2) == 0 && c1 != '\0')
107 c2 = *p2++;
111 state = result_type[state << 2 | ((c2 == '0') + (ISDIGIT (c2) != 0))];
/external/blktrace/
H A Dstrverscmp.c93 unsigned char c1, c2; local
127 c2 = *p2++;
131 while ((diff = c1 - c2) == 0 && c1 != '\0')
135 c2 = *p2++;
139 state = result_type[state << 2 | (((c2 == '0') + (isdigit (c2) != 0)))];
/external/apache-harmony/security/src/test/api/java/org/apache/harmony/security/tests/java/security/cert/
H A DCertificateTest.java67 Certificate c2 = new MyCertificate("TEST_TYPE", testEncoding);
69 assertTrue(c1.hashCode() == c2.hashCode());
78 Certificate c2 = new MyCertificate("TEST_TYPE", testEncoding);
80 assertTrue((c1.hashCode() == c2.hashCode()) && c1.equals(c2));
109 Certificate c2 = new MyCertificate("TEST_TYPE", testEncoding);
110 assertTrue(c1.equals(c2) && c2.equals(c1));

Completed in 2036 milliseconds

1234567891011>>