Home
last modified time | relevance | path

Searched refs:n2 (Results 1 - 25 of 223) sorted by relevance

123456789

/third_party/typescript/tests/baselines/reference/
H A DtypeArgumentsWithStringLiteralTypes01.js51 namespace n2 {
157 var n2; variable
158 (function (n2) {
161 n2.a = fun1("Hello", "Hello");
162 n2.b = fun1("Hello", "World");
163 n2.c = fun2("Hello", "Hello");
164 n2.d = fun2("Hello", "World");
165 n2.e = fun3("Hello", "World");
167 n2.a = takeReturnString(n2
[all...]
H A DrecursiveInitializer.js4 var n2: number = n2 + n2; variable
25 var n2 = n2 + n2; variable
H A DgenericReduce.js5 var n2 = b.reduceRight((x, y) => x + y); variable
9 n2.x = "fail"; // should error, as 'n2' should be type 'number', not 'any'.
10 n2.toExponential(2); // should not error if 'n2' is correctly number.
20 var n2 = b.reduceRight(function (x, y) { return x + y; }); variable
23 n2.x = "fail"; // should error, as 'n2' should be type 'number', not 'any'.
24 n2.toExponential(2); // should not error if 'n2' i
[all...]
/third_party/node/deps/openssl/openssl/crypto/bn/
H A Dbn_mul.c164 * r is 2*n2 words in size,
165 * a and b are both n2 words in size.
166 * n2 must be a power of 2.
168 * t must be 2*n2 words in size
174 /* dnX may not be positive, but n2/2+dnX has to be */
175 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, in bn_mul_recursive() argument
178 int n = n2 / 2, c1, c2; in bn_mul_recursive()
185 if (n2 == 4) { in bn_mul_recursive()
191 * Only call bn_mul_comba 8 if n2 == 8 and the two arrays are complete in bn_mul_recursive()
194 if (n2 in bn_mul_recursive()
325 int i, j, n2 = n * 2; bn_mul_part_recursive() local
477 bn_mul_low_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, BN_ULONG *t) bn_mul_low_recursive() argument
[all...]
H A Dbn_sqr.c156 void bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t) in bn_sqr_recursive() argument
158 int n = n2 / 2; in bn_sqr_recursive()
162 if (n2 == 4) { in bn_sqr_recursive()
169 } else if (n2 == 8) { in bn_sqr_recursive()
177 if (n2 < BN_SQR_RECURSIVE_SIZE_NORMAL) { in bn_sqr_recursive()
178 bn_sqr_normal(r, a, n2, t); in bn_sqr_recursive()
192 p = &(t[n2 * 2]); in bn_sqr_recursive()
195 bn_sqr_recursive(&(t[n2]), t, n, p); in bn_sqr_recursive()
197 memset(&t[n2], 0, sizeof(*t) * n2); in bn_sqr_recursive()
[all...]
/third_party/openssl/crypto/bn/
H A Dbn_mul.c164 * r is 2*n2 words in size,
165 * a and b are both n2 words in size.
166 * n2 must be a power of 2.
168 * t must be 2*n2 words in size
174 /* dnX may not be positive, but n2/2+dnX has to be */
175 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, in bn_mul_recursive() argument
178 int n = n2 / 2, c1, c2; in bn_mul_recursive()
185 if (n2 == 4) { in bn_mul_recursive()
191 * Only call bn_mul_comba 8 if n2 == 8 and the two arrays are complete in bn_mul_recursive()
194 if (n2 in bn_mul_recursive()
325 int i, j, n2 = n * 2; bn_mul_part_recursive() local
477 bn_mul_low_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, BN_ULONG *t) bn_mul_low_recursive() argument
[all...]
H A Dbn_sqr.c156 void bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t) in bn_sqr_recursive() argument
158 int n = n2 / 2; in bn_sqr_recursive()
162 if (n2 == 4) { in bn_sqr_recursive()
169 } else if (n2 == 8) { in bn_sqr_recursive()
177 if (n2 < BN_SQR_RECURSIVE_SIZE_NORMAL) { in bn_sqr_recursive()
178 bn_sqr_normal(r, a, n2, t); in bn_sqr_recursive()
192 p = &(t[n2 * 2]); in bn_sqr_recursive()
195 bn_sqr_recursive(&(t[n2]), t, n, p); in bn_sqr_recursive()
197 memset(&t[n2], 0, sizeof(*t) * n2); in bn_sqr_recursive()
[all...]
/third_party/selinux/libsepol/src/
H A Debitmap.c20 const ebitmap_node_t *n1, *n2; in ebitmap_or() local
26 n2 = e2->node; in ebitmap_or()
28 while (n1 || n2) { in ebitmap_or()
34 if (n1 && n2 && n1->startbit == n2->startbit) { in ebitmap_or()
36 new->map = n1->map | n2->map; in ebitmap_or()
38 n2 = n2->next; in ebitmap_or()
39 } else if (!n2 || (n1 && n1->startbit < n2 in ebitmap_or()
76 const ebitmap_node_t *n1, *n2; ebitmap_and() local
119 const ebitmap_node_t *n1, *n2; ebitmap_xor() local
259 const ebitmap_node_t *n1, *n2; ebitmap_cmp() local
309 const ebitmap_node_t *n1, *n2; ebitmap_contains() local
337 const ebitmap_node_t *n2 = e2->node; ebitmap_match_any() local
[all...]
/third_party/skia/third_party/externals/dawn/src/tests/unittests/
H A DLinkedListTests.cpp108 Node n2(2); in TEST()
109 list.Append(&n2); in TEST()
112 EXPECT_EQ(&n2, list.tail()); in TEST()
133 Node n2(2); in TEST()
139 list.Append(&n2); in TEST()
174 EXPECT_EQ(&n2, list.head()); in TEST()
182 n2.RemoveFromList(); in TEST()
191 list.Append(&n2); in TEST()
208 Node n2(2); in TEST()
213 list.Append(&n2); in TEST()
[all...]
/third_party/icu/icu4c/source/common/
H A Dunorm.cpp51 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_quickCheck() local
52 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_quickCheck()
59 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_quickCheckWithOptions() local
61 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode)); in unorm_quickCheckWithOptions()
66 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_quickCheckWithOptions()
74 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_isNormalized() local
75 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_isNormalized()
82 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_isNormalizedWithOptions() local
84 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode)); in unorm_isNormalizedWithOptions()
89 return unorm2_isNormalized((const UNormalizer2 *)n2, sr in unorm_isNormalizedWithOptions()
101 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); unorm_normalize() local
117 _iterate(UCharIterator *src, UBool forward, UChar *dest, int32_t destCapacity, const Normalizer2 *n2, UBool doNormalize, UBool *pNeededToNormalize, UErrorCode *pErrorCode) _iterate() argument
182 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); unorm_iterate() local
225 _concatenate(const UChar *left, int32_t leftLength, const UChar *right, int32_t rightLength, UChar *dest, int32_t destCapacity, const Normalizer2 *n2, UErrorCode *pErrorCode) _concatenate() argument
266 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); unorm_concatenate() local
[all...]
/third_party/node/deps/icu-small/source/common/
H A Dunorm.cpp51 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_quickCheck() local
52 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_quickCheck()
59 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_quickCheckWithOptions() local
61 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode)); in unorm_quickCheckWithOptions()
66 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_quickCheckWithOptions()
74 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_isNormalized() local
75 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_isNormalized()
82 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_isNormalizedWithOptions() local
84 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode)); in unorm_isNormalizedWithOptions()
89 return unorm2_isNormalized((const UNormalizer2 *)n2, sr in unorm_isNormalizedWithOptions()
101 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); unorm_normalize() local
117 _iterate(UCharIterator *src, UBool forward, char16_t *dest, int32_t destCapacity, const Normalizer2 *n2, UBool doNormalize, UBool *pNeededToNormalize, UErrorCode *pErrorCode) _iterate() argument
182 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); unorm_iterate() local
225 _concatenate(const char16_t *left, int32_t leftLength, const char16_t *right, int32_t rightLength, char16_t *dest, int32_t destCapacity, const Normalizer2 *n2, UErrorCode *pErrorCode) _concatenate() argument
266 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); unorm_concatenate() local
[all...]
/third_party/skia/third_party/externals/icu/source/common/
H A Dunorm.cpp51 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_quickCheck() local
52 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_quickCheck()
59 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_quickCheckWithOptions() local
61 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode)); in unorm_quickCheckWithOptions()
66 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_quickCheckWithOptions()
74 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_isNormalized() local
75 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode); in unorm_isNormalized()
82 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); in unorm_isNormalizedWithOptions() local
84 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode)); in unorm_isNormalizedWithOptions()
89 return unorm2_isNormalized((const UNormalizer2 *)n2, sr in unorm_isNormalizedWithOptions()
101 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); unorm_normalize() local
117 _iterate(UCharIterator *src, UBool forward, UChar *dest, int32_t destCapacity, const Normalizer2 *n2, UBool doNormalize, UBool *pNeededToNormalize, UErrorCode *pErrorCode) _iterate() argument
182 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); unorm_iterate() local
225 _concatenate(const UChar *left, int32_t leftLength, const UChar *right, int32_t rightLength, UChar *dest, int32_t destCapacity, const Normalizer2 *n2, UErrorCode *pErrorCode) _concatenate() argument
266 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); unorm_concatenate() local
[all...]
/third_party/rust/crates/memchr/src/memchr/
H A Dmod.rs154 fn imp(n1: u8, n2: u8, haystack: &[u8]) -> Option<usize> { in memchr2()
155 naive::memchr2(n1, n2, haystack) in memchr2()
160 fn imp(n1: u8, n2: u8, haystack: &[u8]) -> Option<usize> { in memchr2()
161 x86::memchr2(n1, n2, haystack) in memchr2()
169 fn imp(n1: u8, n2: u8, haystack: &[u8]) -> Option<usize> { in memchr2()
170 fallback::memchr2(n1, n2, haystack) in memchr2()
212 fn imp(n1: u8, n2: u8, n3: u8, haystack: &[u8]) -> Option<usize> { in memchr3()
213 naive::memchr3(n1, n2, n3, haystack) in memchr3()
218 fn imp(n1: u8, n2: u8, n3: u8, haystack: &[u8]) -> Option<usize> { in memchr3()
219 x86::memchr3(n1, n2, n in memchr3()
[all...]
H A Dnaive.rs7 pub fn memchr2(n1: u8, n2: u8, haystack: &[u8]) -> Option<usize> { in memchr2()
8 haystack.iter().position(|&b| b == n1 || b == n2) in memchr2()
11 pub fn memchr3(n1: u8, n2: u8, n3: u8, haystack: &[u8]) -> Option<usize> { in memchr3()
12 haystack.iter().position(|&b| b == n1 || b == n2 || b == n3) in memchr3()
19 pub fn memrchr2(n1: u8, n2: u8, haystack: &[u8]) -> Option<usize> { in memrchr2()
20 haystack.iter().rposition(|&b| b == n1 || b == n2) in memrchr2()
23 pub fn memrchr3(n1: u8, n2: u8, n3: u8, haystack: &[u8]) -> Option<usize> { in memrchr3()
24 haystack.iter().rposition(|&b| b == n1 || b == n2 || b == n3) in memrchr3()
/third_party/rust/crates/memchr/src/tests/memchr/
H A Dmemchr.rs101 fn qc_memchr2_matches_naive(n1: u8, n2: u8, corpus: Vec<u8>) -> bool { in qc_memchr2_matches_naive()
102 memchr2(n1, n2, &corpus) == naive::memchr2(n1, n2, &corpus) in qc_memchr2_matches_naive()
108 n1: u8, n2: u8, n3: u8, in qc_memchr3_matches_naive()
111 memchr3(n1, n2, n3, &corpus) == naive::memchr3(n1, n2, n3, &corpus) in qc_memchr3_matches_naive()
122 fn qc_memrchr2_matches_naive(n1: u8, n2: u8, corpus: Vec<u8>) -> bool { in qc_memrchr2_matches_naive()
123 memrchr2(n1, n2, &corpus) == naive::memrchr2(n1, n2, &corpus) in qc_memrchr2_matches_naive()
129 n1: u8, n2 in qc_memrchr3_matches_naive()
[all...]
/third_party/openssl/test/testutil/
H A Dformat_output.c49 size_t n1, n2, i; in test_fail_string_common() local
72 n1 = n2 = 0; in test_fail_string_common()
79 b2[n2 = l2 > width ? width : l2] = 0; in test_fail_string_common()
80 for (i = 0; i < n2; i++) in test_fail_string_common()
85 if (n1 > 0 && n2 > 0) { in test_fail_string_common()
86 const size_t j = n1 < n2 ? n1 : n2; in test_fail_string_common()
97 if (n1 == n2 && !diff) { in test_fail_string_common()
98 test_printf_stderr("%4u: '%s'\n", cnt, n2 > n1 ? b2 : b1); in test_fail_string_common()
106 else if (n2 > in test_fail_string_common()
275 size_t l1, l2, n1, n2, i, len; test_fail_bignum_common() local
434 size_t n1, n2, i; test_fail_memory_common() local
[all...]
/third_party/python/Lib/lib2to3/tests/
H A Dtest_pytree.py112 n2 = pytree.Node(1000, [n1, l3])
116 self.assertEqual(n2.get_suffix(), "")
120 n2 = pytree.Node(1000, [], context=(" ", (1, 0)))
121 self.assertEqual(n1, n2)
129 n2 = pytree.Node(1000, [l2])
130 self.assertEqual(n1, n2)
163 n2 = pytree.Node(1000, [l1, l2])
165 n1 = pytree.Node(1000, [n2, n3])
172 n2 = pytree.Node(1000, [l1, l2])
174 n1 = pytree.Node(1000, [n2, n
[all...]
/third_party/FreeBSD/lib/msun/ld128/
H A Ds_expl.c208 int k, n, n2; in expm1l() local
271 /* Reduce x to (k*ln2 + endpoint[n2] + r1 + r2). */ in expm1l()
274 n2 = (unsigned)n % INTERVALS; in expm1l()
287 * expl(endpoint[n2] + r1 + r2) = tbl[n2] * expl(r1 + r2). in expm1l()
293 t = tbl[n2].lo + tbl[n2].hi; in expm1l()
296 t = SUM2P(tbl[n2].hi - 1, tbl[n2].lo * (r1 + 1) + t * q + in expm1l()
297 tbl[n2] in expm1l()
[all...]
/third_party/node/deps/v8/src/bigint/
H A Dmul-karatsuba.cc164 int n2 = n >> 1; in KaratsubaMain() local
165 Digits X0(X, 0, n2); in KaratsubaMain()
166 Digits X1(X, n2, n2); in KaratsubaMain()
167 Digits Y0(Y, 0, n2); in KaratsubaMain()
168 Digits Y1(Y, n2, n2); in KaratsubaMain()
171 KaratsubaMain(P0, X0, Y0, scratch_for_recursion, n2); in KaratsubaMain()
175 KaratsubaMain(P2, X1, Y1, scratch_for_recursion, n2); in KaratsubaMain()
185 digit_t overflow = AddAndReturnOverflow(Z + n2, P in KaratsubaMain()
[all...]
/third_party/icu/icu4c/source/samples/uciter8/
H A Duciter8.c54 UCharIterator *iter2, const char *n2) { in compareIterators()
62 log_err("%s->getIndex(length)=%d != %d=%s->getIndex(length)\n", n1, length, pos2, n2); in compareIterators()
77 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n2, middle, pos2); in compareIterators()
85 log_err("%s->current()=U+%04x != U+%04x=%s->current() at middle=%d\n", n1, c1, c2, n2, middle); in compareIterators()
94 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT)); in compareIterators()
104 log_err("%s->previous()=U+%04x != U+%04x=%s->previous() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT)); in compareIterators()
122 log_err("%s->move(start) failed\n", n2); in compareIterators()
126 log_err("%s->hasNext() at the start returns false\n", n2); in compareIterators()
134 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT)); in compareIterators()
144 log_err("%s->hasNext() at the end returns true\n", n2); in compareIterators()
53 compareIterators(UCharIterator *iter1, const char *n1, UCharIterator *iter2, const char *n2) compareIterators() argument
[all...]
/third_party/skia/third_party/externals/icu/source/samples/uciter8/
H A Duciter8.c54 UCharIterator *iter2, const char *n2) { in compareIterators()
62 log_err("%s->getIndex(length)=%d != %d=%s->getIndex(length)\n", n1, length, pos2, n2); in compareIterators()
77 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n2, middle, pos2); in compareIterators()
85 log_err("%s->current()=U+%04x != U+%04x=%s->current() at middle=%d\n", n1, c1, c2, n2, middle); in compareIterators()
94 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT)); in compareIterators()
104 log_err("%s->previous()=U+%04x != U+%04x=%s->previous() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT)); in compareIterators()
122 log_err("%s->move(start) failed\n", n2); in compareIterators()
126 log_err("%s->hasNext() at the start returns false\n", n2); in compareIterators()
134 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT)); in compareIterators()
144 log_err("%s->hasNext() at the end returns true\n", n2); in compareIterators()
53 compareIterators(UCharIterator *iter1, const char *n1, UCharIterator *iter2, const char *n2) compareIterators() argument
[all...]
/third_party/mesa3d/src/util/
H A Dregister_allocate.c482 ra_get_adjacency_bit_index(unsigned n1, unsigned n2) in ra_get_adjacency_bit_index() argument
484 assert(n1 != n2); in ra_get_adjacency_bit_index()
485 unsigned k1 = MAX2(n1, n2); in ra_get_adjacency_bit_index()
486 unsigned k2 = MIN2(n1, n2); in ra_get_adjacency_bit_index()
491 ra_test_adjacency_bit(struct ra_graph *g, unsigned n1, unsigned n2) in ra_test_adjacency_bit() argument
493 uint64_t index = ra_get_adjacency_bit_index(n1, n2); in ra_test_adjacency_bit()
498 ra_set_adjacency_bit(struct ra_graph *g, unsigned n1, unsigned n2) in ra_set_adjacency_bit() argument
500 unsigned index = ra_get_adjacency_bit_index(n1, n2); in ra_set_adjacency_bit()
505 ra_clear_adjacency_bit(struct ra_graph *g, unsigned n1, unsigned n2) in ra_clear_adjacency_bit() argument
507 unsigned index = ra_get_adjacency_bit_index(n1, n2); in ra_clear_adjacency_bit()
512 ra_add_node_adjacency(struct ra_graph *g, unsigned int n1, unsigned int n2) ra_add_node_adjacency() argument
524 ra_node_remove_adjacency(struct ra_graph *g, unsigned int n1, unsigned int n2) ra_node_remove_adjacency() argument
635 ra_add_node_interference(struct ra_graph *g, unsigned int n1, unsigned int n2) ra_add_node_interference() argument
687 unsigned int n2 = *n2p; add_node_to_stack() local
836 unsigned int n2 = *n2p; ra_find_conflicting_neighbor() local
867 struct ra_node *n2 = &g->nodes[*n2p]; ra_compute_available_regs() local
1025 unsigned int n2 = *n2p; ra_get_spill_benefit() local
[all...]
/third_party/rust/crates/memchr/src/memchr/x86/
H A Dmod.rs100 pub fn memchr2(n1: u8, n2: u8, haystack: &[u8]) -> Option<usize> { in memchr2()
106 n2 in memchr2()
111 pub fn memchr3(n1: u8, n2: u8, n3: u8, haystack: &[u8]) -> Option<usize> { in memchr3()
117 n2, in memchr3()
128 pub fn memrchr2(n1: u8, n2: u8, haystack: &[u8]) -> Option<usize> { in memrchr2()
134 n2 in memrchr2()
139 pub fn memrchr3(n1: u8, n2: u8, n3: u8, haystack: &[u8]) -> Option<usize> { in memrchr3()
145 n2, in memrchr3()
/third_party/musl/src/multibyte/
H A Dmbsnrtowcs.c5 size_t l, cnt=0, n2; in mbsnrtowcs() local
17 while ( s && wn && ( (n2=n/4)>=wn || n2>32 ) ) { in mbsnrtowcs()
18 if (n2>=wn) n2=wn; in mbsnrtowcs()
20 l = mbsrtowcs(ws, &s, n2, st); in mbsnrtowcs()
/third_party/icu/icu4j/main/tests/localespi/src/com/ibm/icu/dev/test/localespi/
H A DNumberFormatTest.java179 Number n1, n2; in TestICUEquivalent()
191 n1 = n2 = null; in TestICUEquivalent()
199 n2 = icunf.parse(s2); in TestICUEquivalent()
207 } else if (!pe1 && !pe2 && !n1.equals(n2)) { in TestICUEquivalent()
209 + methodName[0] + ") in locale " + loc + " - JDK:" + n1 + " ICU:" + n2); in TestICUEquivalent()
226 n1 = n2 = null; in TestICUEquivalent()
234 n2 = icunf.parse(s2); in TestICUEquivalent()
242 } else if (!pe1 && !pe2 && !n1.equals(n2)) { in TestICUEquivalent()
244 + methodName[0] + ") in locale " + loc + " - JDK:" + n1 + " ICU:" + n2); in TestICUEquivalent()
261 n1 = n2 in TestICUEquivalent()
[all...]

Completed in 11 milliseconds

123456789