Searched defs:n2 (Results 1 - 25 of 54) sorted by relevance

123

/external/stlport/test/unit/
H A Dlexcmp_test.cpp35 char n2[size] = "shine"; local
37 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size);
44 char n2[size] = "shine"; local
46 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size, greater<char>());
H A Dmismatch_test.cpp41 int n2[5] = { 1, 2, 3, 4, 5 }; local
44 pair <int*, int*> result = mismatch((int*)n1, (int*)n1 + 5, (int*)n2);
45 CPPUNIT_ASSERT(result.first ==(n1 + 5) && result.second ==(n2 + 5));
72 char const* n2[size]; local
73 copy(n1, n1 + 5, (char const**)n2);
74 pair <char const**, char const**> result = mismatch((char const**)n1, (char const**)n1 + size, (char const**)n2, str_equal);
76 CPPUNIT_ASSERT(result.first == n1 + size && result.second == n2 + size);
78 n2[2] = "QED";
79 result = mismatch((char const**)n1, (char const**)n1 + size, (char const**)n2, str_equal);
80 CPPUNIT_ASSERT(!(result.first == n2
[all...]
/external/icu4c/common/unicode/
H A Dnormalizer2.h316 * @param n2 wrapped Normalizer2 instance
320 FilteredNormalizer2(const Normalizer2 &n2, const UnicodeSet &filterSet) : argument
321 norm2(n2), set(filterSet) {}
/external/openssl/crypto/rand/
H A Drandtest.c73 unsigned long n2[16]; local
87 for (i=0; i<16; i++) n2[i]=0;
97 n2[j&0x0f]++;
98 n2[(j>>4)&0x0f]++;
137 d+=n2[i]*n2[i];
147 d+=n2[i]*n2[i];
/external/dropbear/libtommath/
H A Dbn_mp_div.c24 int res, n, n2; local
74 n2 = (a->sign == b->sign ? MP_ZPOS : MP_NEG);
77 c->sign = (mp_iszero(c) == MP_YES) ? MP_ZPOS : n2;
/external/icu4c/samples/uciter8/
H A Duciter8.c46 UCharIterator *iter2, const char *n2) {
54 log_err("%s->getIndex(length)=%d != %d=%s->getIndex(length)\n", n1, length, pos2, n2);
69 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n2, middle, pos2);
77 log_err("%s->current()=U+%04x != U+%04x=%s->current() at middle=%d\n", n1, c1, c2, n2, middle);
86 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));
96 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));
114 log_err("%s->move(start) failed\n", n2);
118 log_err("%s->hasNext() at the start returns FALSE\n", n2);
126 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
136 log_err("%s->hasNext() at the end returns TRUE\n", n2);
45 compareIterators(UCharIterator *iter1, const char *n1, UCharIterator *iter2, const char *n2) argument
[all...]
/external/openssl/crypto/bn/
H A Dbn_sqr.c206 void bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t) argument
208 int n=n2/2;
213 fprintf(stderr," bn_sqr_recursive %d * %d\n",n2,n2);
215 if (n2 == 4)
224 else if (n2 == 8)
233 if (n2 < BN_SQR_RECURSIVE_SIZE_NORMAL)
235 bn_sqr_normal(r,a,n2,t);
249 p= &(t[n2*2]);
252 bn_sqr_recursive(&(t[n2]),
[all...]
H A Dbn_mul.c382 /* r is 2*n2 words in size,
383 * a and b are both n2 words in size.
384 * n2 must be a power of 2.
386 * t must be 2*n2 words in size
392 /* dnX may not be positive, but n2/2+dnX has to be */
393 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, argument
396 int n=n2/2,c1,c2;
402 fprintf(stderr," bn_mul_recursive %d%+d * %d%+d\n",n2,dna,n2,dnb);
406 if (n2
553 int i,j,n2=n*2; local
729 bn_mul_low_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, BN_ULONG *t) argument
760 bn_mul_high(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, BN_ULONG *l, int n2, BN_ULONG *t) argument
[all...]
/external/bzip2/
H A Dhuffman.c72 Int32 nNodes, nHeap, n1, n2, i, j, k; local
102 n2 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1);
104 parent[n1] = parent[n2] = nNodes;
105 weight[nNodes] = ADDWEIGHTS(weight[n1], weight[n2]);
/external/openssl/crypto/objects/
H A Dobj_xref.c207 int n1, n2, n3; local
221 rv = OBJ_find_sigid_algs(n1, &n2, &n3);
223 OBJ_nid2ln(n1), OBJ_nid2ln(n2), OBJ_nid2ln(n3));
225 rv = OBJ_find_sigid_by_algs(&n1, n2, n3);
227 OBJ_nid2ln(n1), OBJ_nid2ln(n2), OBJ_nid2ln(n3));
H A Do_names.c309 const OBJ_NAME * const *n2=n2_; local
311 return strcmp((*n1)->name,(*n2)->name);
/external/icu4c/common/
H A Dnormlzr.cpp140 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); local
143 FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)).
146 n2->normalize(source, *dest, status);
175 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); local
178 return FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)).
181 return n2->quickCheck(source, status);
192 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); local
195 return FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)).
198 return n2->isNormalized(source, status);
226 const Normalizer2 *n2 local
[all...]
H A Dunorm.cpp416 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
417 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
424 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
426 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode));
429 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
437 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
438 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
445 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
447 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode));
450 return unorm2_isNormalized((const UNormalizer2 *)n2, sr
462 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
482 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
583 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
[all...]
H A Dunormcmp.cpp577 const Normalizer2 *n2; local
579 n2=Normalizer2Factory::getNFDInstance(*pErrorCode);
581 n2=Normalizer2Factory::getFCDInstance(*pErrorCode);
594 FilteredNormalizer2 fn2(*n2, *uni32);
596 n2=&fn2;
601 int32_t spanQCYes1=n2->spanQuickCheckYes(str1, *pErrorCode);
602 int32_t spanQCYes2=n2->spanQuickCheckYes(str2, *pErrorCode);
619 n2->normalizeSecondAndAppend(fcd1, unnormalized, *pErrorCode);
626 n2->normalizeSecondAndAppend(fcd2, unnormalized, *pErrorCode);
/external/openssl/crypto/lhash/
H A Dlhash.c312 LHASH_NODE **n,**n1,**n2,*np; local
320 n2= &(lh->b[p+(int)lh->pmax]);
321 *n2=NULL; /* 27/07/92 - eay - undefined pointer bug */
335 np->next= *n2;
336 *n2=np;
/external/qemu/slirp/
H A Dtcp_subr.c612 u_int n1, n2, n3, n4, n5, n6; local
641 if (sscanf(so_rcv->sb_data, "%u%*[ ,]%u", &n1, &n2) == 2) {
643 HTONS(n2);
644 /* n2 is the one on our host */
647 tmpso->so_lport == n2 &&
652 n2 = ntohs(addr.sin_port);
659 "%d,%d\r\n", n1, n2);
970 &n1, &n2, &n3, &n4, &n5, &n6, buff);
974 laddr = htonl((n1 << 24) | (n2 << 16) | (n3 << 8) | (n4));
988 n2
[all...]
/external/webkit/JavaScriptCore/runtime/
H A DOperations.h273 double n2; local
274 if (v1.getNumber(n1) && v2.getNumber(n2))
275 return n1 < n2;
284 bool wasNotString2 = v2.getPrimitiveNumber(callFrame, n2, p2);
287 return n1 < n2;
298 double n2; local
299 if (v1.getNumber(n1) && v2.getNumber(n2))
300 return n1 <= n2;
309 bool wasNotString2 = v2.getPrimitiveNumber(callFrame, n2, p2);
312 return n1 <= n2;
[all...]
/external/bluetooth/hcidump/parser/
H A Dsdp.c451 int len, n1 = 0, n2 = 0; local
459 if (parse_de_hdr(frm, &n2) == SDP_DE_UUID) {
460 print_uuid(n2, frm, NULL, NULL);
477 int len, n1 = 0, n2 = 0; local
486 if (parse_de_hdr(frm, &n2) == SDP_DE_UINT) {
488 switch(n2) {
519 int len, split, n1 = 0, n2 = 0; local
525 if (parse_de_hdr(frm, &n2) == SDP_DE_UINT && n2 == sizeof(attr_id)) {
/external/icu4c/test/intltest/
H A Dsvccoll.cpp337 int32_t n1, n2, n3; local
391 n2 = checkAvailable("after registerFactory");
392 assertTrue("count after > count before", n2 > n1);
/external/qemu/slirp-android/
H A Dtcp_subr.c643 u_int n1, n2, n3, n4, n5, n6; local
671 if (sscanf(so_rcv->sb_data, "%u%*[ ,]%u", &n1, &n2) == 2) {
672 /* n2 is the one on our host */
675 tmpso->so_laddr_port == n2 &&
679 n2 = sock_address_get_port(&addr);
686 "%d,%d\r\n", n1, n2);
701 &n1, &n2, &n3, &n4, &n5, &n6, buff);
705 laddr = (n1 << 24) | (n2 << 16) | (n3 << 8) | (n4);
719 n2 = ((laddr >> 16) & 0xff);
726 n1, n2, n
[all...]
/external/speex/libspeex/
H A Dlsp.c532 float *pw,*n1,*n2,*n3,*n4=NULL; local
563 n2 = n1 + 1;
564 n3 = n2 + 1;
566 xout1 = xin1 - 2.f*x_freq[i2] * *n1 + *n2;
568 *n2 = *n1;
/external/sqlite/android/
H A Dsqlite3_android.cpp37 static int collate16(void *p, int n1, const void *v1, int n2, const void *v2) argument
41 (const UChar *) v2, n2);
52 static int collate8(void *p, int n1, const void *v1, int n2, const void *v2) argument
59 uiter_setUTF8(&i2, (const char *) v2, n2);
/external/tremolo/Tremolo/
H A Dmdct.c64 STIN void presymmetry(DATA_TYPE *in,int n2,int step){ argument
68 int n4=n2>>1;
70 aX = in+n2-3;
86 aX = in+n2-4;
/external/webkit/WebCore/xml/
H A DXPathParser.cpp265 String n2; local
266 if (!lexNCName(n2))
269 name = n1 + ":" + n2;
375 String n2; local
376 if (!lexNCName(n2))
379 name = name + ":" + n2;
/external/chromium/base/third_party/nspr/
H A Dprtime.cc869 int n1, n2, n3; local
888 n2 = (*s++ - '0');
890 n2 = n2*10 + (*s++ - '0');
924 if (n2 > 12) break;
931 month = (TIME_TOKEN)(n2 + ((int)TT_JAN) - 1);
937 if (n1 > 12 && n2 > 12) /* illegal */
951 month = (TIME_TOKEN)(n2 + ((int)TT_JAN) - 1);
959 date = n2;

Completed in 343 milliseconds

123