| /external/stlport/test/unit/ |
| lexcmp_test.cpp | 35 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>());
|
| mismatch_test.cpp | 41 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 + size && result.second == n2 + size))
[all...] |
| /external/webkit/JavaScriptCore/tests/mozilla/ecma_3/NumberFormatting/ |
| tostring-001.js | 31 var n2 = 1.6e24;
38 reportCompare ("1.6e+24", n2.toString(), "1.6e24 toString()");
|
| /external/openssl/crypto/bn/ |
| bn_mul.c | 382 /* 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,
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 == 4
553 int i,j,n2=n*2; local
[all...] |
| bn_sqr.c | 206 void bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t)
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]),t,n,p)
[all...] |
| /external/bzip2/ |
| bzmore | 16 n1=''; n2='\c'
18 n1='-n'; n2=''
44 echo $n1 "--More--(Next file: $FILE)$n2"
|
| /external/elfutils/libelf/ |
| elf32_fsize.c | 58 #define local_strong_alias(n1, n2) strong_alias (n1, n2)
|
| /external/openssl/crypto/rand/ |
| randtest.c | 73 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];
|
| /dalvik/libcore/concurrent/src/test/java/tests/api/java/util/concurrent/ |
| SystemTest.java | 40 long n2 = System.nanoTime(); local
44 long nanos = n2 - n1;
67 long n2 = System.nanoTime(); local
69 long nanos = n2 - n1;
|
| /external/gtest/samples/ |
| sample3_unittest.cc | 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
107 EXPECT_EQ(2 * n1->element(), n2->element());
|
| /external/icu4c/samples/uciter8/ |
| uciter8.c | 46 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);
[all...] |
| /system/core/sh/ |
| parser.c | 152 union node *n1, *n2, *n3; local
160 n2 = andor();
163 if (n2->type == NCMD || n2->type == NPIPE) {
164 n2->ncmd.backgnd = 1;
165 } else if (n2->type == NREDIR) {
166 n2->type = NBACKGND;
170 n3->nredir.n = n2;
172 n2 = n3;
176 n1 = n2;
222 union node *n1, *n2, *n3; local
249 union node *n1, *n2, *pipenode; local
290 union node *n1, *n2; local
533 union node *n = NULL, *n2; local
[all...] |
| /external/bluetooth/glib/glib/ |
| gtestutils.h | 40 #define g_assert_cmpint(n1, cmp, n2) do { gint64 __n1 = (n1), __n2 = (n2); \
43 #n1 " " #cmp " " #n2, __n1, #cmp, __n2, 'i'); } while (0)
44 #define g_assert_cmpuint(n1, cmp, n2) do { guint64 __n1 = (n1), __n2 = (n2); \
47 #n1 " " #cmp " " #n2, __n1, #cmp, __n2, 'i'); } while (0)
48 #define g_assert_cmphex(n1, cmp, n2) do { guint64 __n1 = (n1), __n2 = (n2); \
51 #n1 " " #cmp " " #n2, __n1, #cmp, __n2, 'x'); } while (0)
52 #define g_assert_cmpfloat(n1,cmp,n2) do { long double __n1 = (n1), __n2 = (n2);
[all...] |
| /dalvik/libcore/security/src/main/java/org/apache/harmony/security/provider/crypto/ |
| SHA1withDSA_SignatureImpl.java | 210 int n, n1, n2; local
259 n2 = sBytes.length;
261 n2++;
264 signature = new byte[6 + n1 + n2]; // 48 is max. possible length of signature
266 signature[1] = (byte) (4 + n1 + n2); // total length of two INTEGERs
270 signature[5 + n1] = (byte) n2; // length of s
279 if (n2 == sBytes.length) {
332 int n1, n2; local
341 n2 = sigBytes[offset + n1 + 5];
345 || sigBytes[offset + 1] != (n1 + n2 + 4) || n1 > 2
[all...] |
| /dalvik/libcore/xml/src/main/java/org/apache/xalan/transformer/ |
| NodeSorter.java | 118 * @param n2 Second node to use in compare
127 NodeCompareElem n1, NodeCompareElem n2, int kIndex, XPathContext support)
141 n2Num = ((Double) n2.m_key1Value).doubleValue();
146 n2Num = ((Double) n2.m_key2Value).doubleValue();
153 double n2Num = (double)n2.m_keyValue[kIndex];
161 XObject r2 = k.m_selectPat.execute(m_execContext, n2.m_node,
174 result = compare(n1, n2, kIndex + 1, support);
204 n2String = (CollationKey) n2.m_key1Value;
209 n2String = (CollationKey) n2.m_key2Value;
216 String n2String = (String)n2.m_keyValue[kIndex]
[all...] |
| /dalvik/libcore/xml/src/main/java/org/apache/xpath/objects/ |
| XNodeSet.java | 750 * @param n2 Second number to compare
754 abstract boolean compareNumbers(double n1, double n2);
783 * @param n2 Second number to compare
785 * @return true if n1 is less than n2
787 boolean compareNumbers(double n1, double n2)
789 return n1 < n2;
819 * @param n2 Second number to compare
821 * @return true if n1 is less than or equal to n2
823 boolean compareNumbers(double n1, double n2)
825 return n1 <= n2;
[all...] |
| /system/core/rootdir/etc/ |
| init.testmenu | 7 n2=`cat /data/phoneentry2 2>/dev/null`
10 n2=${n2:-"*#06#"}
118 echo " 2: Dial: ATD $n2;"
132 "2" ) echo "Dialing $n2"; echo -e "ATD $n2;\r" >$atdev;;
135 "5" ) echo -n "Number: "; read n2; echo $n2 >/data/phoneentry2;;
|
| /external/srec/srec/cfront/ |
| sp_fft.c | 174 unsigned m, n, n2, i, j, i0, is, id, ii, ib; local
193 n2 = n << 1;
205 id = n2;
207 n2 = n2 >> 1;
226 is = 2 * id - n2;
272 unsigned m, n, n2, n4, i, j, ii, nt; local
286 n2 = n << 1;
289 n2 = n2 >> 1
588 unsigned n2; local
[all...] |
| /external/webkit/JavaScriptCore/runtime/ |
| Operations.h | 273 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...] |
| /cts/tools/dasm/src/dasm/ |
| parser.cup | 697 Insn:i Word:n1 Num:n2
698 {: dAsm.addOpcode(i.str_val, n1.str_val, n2.number_val); :}
701 Insn:i Word:n1 Int:n2
702 {: dAsm.addOpcode(i.str_val, n1.str_val, new Integer(n2.int_val)); :}
705 Insn:i Word:n1 Word:n2
706 {: dAsm.addOpcode(i.str_val, n1.str_val, n2.str_val); :}
709 Insn:i Word:n1 Relative:n2
710 {: dAsm.addRelativeGoto(i.str_val, n1.str_val, n2.int_val); :}
713 Insn:i Word:n1 Word:n2 Word:n3
714 {: dAsm.addOpcode(i.str_val, n1.str_val, n2.str_val, n3.str_val); :
[all...] |
| /external/opencore/codecs_v2/audio/aac/dec/src/ |
| fft_rx4_long.cpp | 199 Int n2; local
231 n2 = FFT_RX4_LONG;
236 n1 = n2;
237 n2 >>= 2;
285 for (j = 1; j < n2; j++)
|
| fft_rx4_short.cpp | 197 Int n2; local
242 n2 = FFT_RX4_SHORT;
253 n1 = n2;
254 n2 >>= 2;
313 for (j = 1; j < n2; j++)
|
| /frameworks/base/media/libstagefright/codecs/aacdec/ |
| fft_rx4_long.cpp | 199 Int n2; local
231 n2 = FFT_RX4_LONG;
236 n1 = n2;
237 n2 >>= 2;
285 for (j = 1; j < n2; j++)
|
| fft_rx4_short.cpp | 197 Int n2; local
242 n2 = FFT_RX4_SHORT;
253 n1 = n2;
254 n2 >>= 2;
313 for (j = 1; j < n2; j++)
|
| /packages/apps/Email/src/org/apache/james/mime4j/field/address/ |
| Builder.java | 79 Node n2 = it.nextNode();
local
80 if (n2 instanceof ASTgroup_body) {
81 return new Group(name, buildGroupBody((ASTgroup_body)n2));
83 else if (n2 instanceof ASTangle_addr) {
85 return new NamedMailbox(name, buildAngleAddr((ASTangle_addr)n2));
|
