| /ndk/tests/device/test-stlport/unit/ |
| inplace_test.cpp | 33 int numbers[6] = { 1, 10, 42, 3, 16, 32 }; local
34 inplace_merge(numbers, numbers + 3, numbers + 6);
36 CPPUNIT_ASSERT(numbers[0]==1);
37 CPPUNIT_ASSERT(numbers[1]==3);
38 CPPUNIT_ASSERT(numbers[2]==10);
39 CPPUNIT_ASSERT(numbers[3]==16);
40 CPPUNIT_ASSERT(numbers[4]==32);
41 CPPUNIT_ASSERT(numbers[5]==42)
[all...] |
| sort_test.cpp | 56 int numbers[6] = { 1, 50, -10, 11, 42, 19 }; local
57 stable_sort(numbers, numbers + 6);
59 CPPUNIT_ASSERT(numbers[0]==-10);
60 CPPUNIT_ASSERT(numbers[1]==1);
61 CPPUNIT_ASSERT(numbers[2]==11);
62 CPPUNIT_ASSERT(numbers[3]==19);
63 CPPUNIT_ASSERT(numbers[4]==42);
64 CPPUNIT_ASSERT(numbers[5]==50);
115 int numbers[6] = { 1, 50, -10, 11, 42, 19 } local
129 int numbers[] = { 1, 50, -10, 11, 42, 19 }; local
198 int numbers[] = { 0, 0, 1, 0, 0, 1, 0, 0 }; local
[all...] |
| rm_cp_test.cpp | 56 int numbers[6] = { 0, 1, 2, 3, 4, 5 }; local
58 reverse(numbers, numbers + 6);
59 CPPUNIT_ASSERT(numbers[0]==5);
60 CPPUNIT_ASSERT(numbers[1]==4);
61 CPPUNIT_ASSERT(numbers[2]==3);
62 CPPUNIT_ASSERT(numbers[3]==2);
63 CPPUNIT_ASSERT(numbers[4]==1);
64 CPPUNIT_ASSERT(numbers[5]==0);
69 int numbers[6] = { 0, 1, 2, 3, 4, 5 } local
105 int numbers[6] = { 0, 1, 2, 0, 1, 2 }; local
119 int numbers[6] = { 0, 1, 2, 0, 1, 2 }; local
189 int numbers[6] = { 1, 2, 3, 1, 2, 3 }; local
203 int numbers[6] = { 0, 0, 1, 1, 2, 2 }; local
218 int numbers[6] = { 1, 2, 3, 1, 2, 3 }; local
233 int numbers[6] = { 1, 2, 3, 1, 2, 3 }; local
[all...] |
| nthelm_test.cpp | 35 int numbers[7] = { 5, 2, 4, 1, 0, 3 ,77}; local
36 nth_element(numbers, numbers + 3, numbers + 6);
38 CPPUNIT_ASSERT(numbers[0]==1);
39 CPPUNIT_ASSERT(numbers[1]==0);
40 CPPUNIT_ASSERT(numbers[2]==2);
41 CPPUNIT_ASSERT(numbers[3]==3);
42 CPPUNIT_ASSERT(numbers[4]==4);
43 CPPUNIT_ASSERT(numbers[5]==5)
49 int numbers[10] = { 6, 8, 5, 1, 7, 4, 1, 5, 2, 6 }; local
70 int numbers[10] = { 4, 5, 4, 2, 1, 7, 4, 3, 1, 6 }; local
[all...] |
| unique_test.cpp | 37 int numbers[8] = { 0, 1, 1, 2, 2, 2, 3, 4 }; local
38 unique((int*)numbers, (int*)numbers + 8);
40 CPPUNIT_ASSERT(numbers[0]==0);
41 CPPUNIT_ASSERT(numbers[1]==1);
42 CPPUNIT_ASSERT(numbers[2]==2);
43 CPPUNIT_ASSERT(numbers[3]==3);
44 CPPUNIT_ASSERT(numbers[4]==4);
45 CPPUNIT_ASSERT(numbers[5]==2);
46 CPPUNIT_ASSERT(numbers[6]==3)
70 int numbers[8] = { 0, 1, 1, 2, 2, 2, 3, 4 }; local
[all...] |
| /external/stlport/test/unit/ |
| sort_test.cpp | 56 int numbers[6] = { 1, 50, -10, 11, 42, 19 }; local
57 stable_sort(numbers, numbers + 6);
59 CPPUNIT_ASSERT(numbers[0]==-10);
60 CPPUNIT_ASSERT(numbers[1]==1);
61 CPPUNIT_ASSERT(numbers[2]==11);
62 CPPUNIT_ASSERT(numbers[3]==19);
63 CPPUNIT_ASSERT(numbers[4]==42);
64 CPPUNIT_ASSERT(numbers[5]==50);
115 int numbers[6] = { 1, 50, -10, 11, 42, 19 } local
129 int numbers[] = { 1, 50, -10, 11, 42, 19 }; local
198 int numbers[] = { 0, 0, 1, 0, 0, 1, 0, 0 }; local
[all...] |
| rm_cp_test.cpp | 56 int numbers[6] = { 0, 1, 2, 3, 4, 5 }; local
58 reverse(numbers, numbers + 6);
59 CPPUNIT_ASSERT(numbers[0]==5);
60 CPPUNIT_ASSERT(numbers[1]==4);
61 CPPUNIT_ASSERT(numbers[2]==3);
62 CPPUNIT_ASSERT(numbers[3]==2);
63 CPPUNIT_ASSERT(numbers[4]==1);
64 CPPUNIT_ASSERT(numbers[5]==0);
69 int numbers[6] = { 0, 1, 2, 3, 4, 5 } local
105 int numbers[6] = { 0, 1, 2, 0, 1, 2 }; local
119 int numbers[6] = { 0, 1, 2, 0, 1, 2 }; local
189 int numbers[6] = { 1, 2, 3, 1, 2, 3 }; local
203 int numbers[6] = { 0, 0, 1, 1, 2, 2 }; local
218 int numbers[6] = { 1, 2, 3, 1, 2, 3 }; local
233 int numbers[6] = { 1, 2, 3, 1, 2, 3 }; local
[all...] |
| nthelm_test.cpp | 35 int numbers[7] = { 5, 2, 4, 1, 0, 3 ,77}; local
36 nth_element(numbers, numbers + 3, numbers + 6);
38 CPPUNIT_ASSERT(numbers[0]==1);
39 CPPUNIT_ASSERT(numbers[1]==0);
40 CPPUNIT_ASSERT(numbers[2]==2);
41 CPPUNIT_ASSERT(numbers[3]==3);
42 CPPUNIT_ASSERT(numbers[4]==4);
43 CPPUNIT_ASSERT(numbers[5]==5)
49 int numbers[10] = { 6, 8, 5, 1, 7, 4, 1, 5, 2, 6 }; local
70 int numbers[10] = { 4, 5, 4, 2, 1, 7, 4, 3, 1, 6 }; local
[all...] |
| unique_test.cpp | 37 int numbers[8] = { 0, 1, 1, 2, 2, 2, 3, 4 }; local
38 unique((int*)numbers, (int*)numbers + 8);
40 CPPUNIT_ASSERT(numbers[0]==0);
41 CPPUNIT_ASSERT(numbers[1]==1);
42 CPPUNIT_ASSERT(numbers[2]==2);
43 CPPUNIT_ASSERT(numbers[3]==3);
44 CPPUNIT_ASSERT(numbers[4]==4);
45 CPPUNIT_ASSERT(numbers[5]==2);
46 CPPUNIT_ASSERT(numbers[6]==3)
70 int numbers[8] = { 0, 1, 1, 2, 2, 2, 3, 4 }; local
[all...] |
| /ndk/tests/device/test-gnustl-full/unit/ |
| sort_test.cpp | 56 int numbers[6] = { 1, 50, -10, 11, 42, 19 }; local
57 stable_sort(numbers, numbers + 6);
59 CPPUNIT_ASSERT(numbers[0]==-10);
60 CPPUNIT_ASSERT(numbers[1]==1);
61 CPPUNIT_ASSERT(numbers[2]==11);
62 CPPUNIT_ASSERT(numbers[3]==19);
63 CPPUNIT_ASSERT(numbers[4]==42);
64 CPPUNIT_ASSERT(numbers[5]==50);
115 int numbers[6] = { 1, 50, -10, 11, 42, 19 } local
129 int numbers[] = { 1, 50, -10, 11, 42, 19 }; local
198 int numbers[] = { 0, 0, 1, 0, 0, 1, 0, 0 }; local
[all...] |
| rm_cp_test.cpp | 56 int numbers[6] = { 0, 1, 2, 3, 4, 5 }; local
58 reverse(numbers, numbers + 6);
59 CPPUNIT_ASSERT(numbers[0]==5);
60 CPPUNIT_ASSERT(numbers[1]==4);
61 CPPUNIT_ASSERT(numbers[2]==3);
62 CPPUNIT_ASSERT(numbers[3]==2);
63 CPPUNIT_ASSERT(numbers[4]==1);
64 CPPUNIT_ASSERT(numbers[5]==0);
69 int numbers[6] = { 0, 1, 2, 3, 4, 5 } local
105 int numbers[6] = { 0, 1, 2, 0, 1, 2 }; local
119 int numbers[6] = { 0, 1, 2, 0, 1, 2 }; local
189 int numbers[6] = { 1, 2, 3, 1, 2, 3 }; local
203 int numbers[6] = { 0, 0, 1, 1, 2, 2 }; local
218 int numbers[6] = { 1, 2, 3, 1, 2, 3 }; local
233 int numbers[6] = { 1, 2, 3, 1, 2, 3 }; local
[all...] |
| nthelm_test.cpp | 35 int numbers[7] = { 5, 2, 4, 1, 0, 3 ,77}; local
36 nth_element(numbers, numbers + 3, numbers + 6);
38 CPPUNIT_ASSERT(numbers[0]==1);
39 CPPUNIT_ASSERT(numbers[1]==0);
40 CPPUNIT_ASSERT(numbers[2]==2);
41 CPPUNIT_ASSERT(numbers[3]==3);
42 CPPUNIT_ASSERT(numbers[4]==4);
43 CPPUNIT_ASSERT(numbers[5]==5)
49 int numbers[10] = { 6, 8, 5, 1, 7, 4, 1, 5, 2, 6 }; local
70 int numbers[10] = { 4, 5, 4, 2, 1, 7, 4, 3, 1, 6 }; local
[all...] |
| unique_test.cpp | 37 int numbers[8] = { 0, 1, 1, 2, 2, 2, 3, 4 }; local
38 unique((int*)numbers, (int*)numbers + 8);
40 CPPUNIT_ASSERT(numbers[0]==0);
41 CPPUNIT_ASSERT(numbers[1]==1);
42 CPPUNIT_ASSERT(numbers[2]==2);
43 CPPUNIT_ASSERT(numbers[3]==3);
44 CPPUNIT_ASSERT(numbers[4]==4);
45 CPPUNIT_ASSERT(numbers[5]==2);
46 CPPUNIT_ASSERT(numbers[6]==3)
70 int numbers[8] = { 0, 1, 1, 2, 2, 2, 3, 4 }; local
[all...] |
| /external/chromium_org/v8/test/mjsunit/regress/ |
| regress-91008.js | 29 var numbers=new Array(n);
30 for (var i=0;i<n;i++) numbers[i]=i;
31 delete numbers[50];
32 delete numbers[150];
33 delete numbers[25000];
34 delete numbers[n-1];
35 delete numbers[n-2];
36 delete numbers[30];
37 delete numbers[2];
38 delete numbers[1]
[all...] |
| /external/v8/test/mjsunit/regress/ |
| regress-91008.js | 29 var numbers=new Array(n);
30 for (var i=0;i<n;i++) numbers[i]=i;
31 delete numbers[50];
32 delete numbers[150];
33 delete numbers[25000];
34 delete numbers[n-1];
35 delete numbers[n-2];
36 delete numbers[30];
37 delete numbers[2];
38 delete numbers[1]
[all...] |
| /art/test/055-enum-performance/ |
| info.txt | 1 This is a performance test of Enum.valueOf(). To see the numbers, invoke
|
| /dalvik/tests/055-enum-performance/ |
| info.txt | 1 This is a performance test of Enum.valueOf(). To see the numbers, invoke
|
| /external/chromium_org/third_party/sqlite/src/test/ |
| shared2.test | 32 # Set up some data. Table "numbers" has 64 rows after this block
36 CREATE TABLE numbers(a PRIMARY KEY, b);
37 INSERT INTO numbers(oid) VALUES(NULL);
38 INSERT INTO numbers(oid) SELECT NULL FROM numbers;
39 INSERT INTO numbers(oid) SELECT NULL FROM numbers;
40 INSERT INTO numbers(oid) SELECT NULL FROM numbers;
41 INSERT INTO numbers(oid) SELECT NULL FROM numbers
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/ |
| dqblk_v2.h | 10 /* id numbers of quota format */
13 /* Numbers of blocks needed for updates */
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
| dqblk_v2.h | 10 /* id numbers of quota format */
13 /* Numbers of blocks needed for updates */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
| dqblk_v2.h | 10 /* id numbers of quota format */
13 /* Numbers of blocks needed for updates */
|
| /external/clang/test/Sema/ |
| warn-freestanding-complex.c | 3 void foo(float _Complex c) { // expected-warning{{complex numbers are an extension in a freestanding C99 implementation}}
|
| /external/compiler-rt/BlocksRuntime/tests/ |
| varargs.c | 19 va_list numbers;
22 va_start(numbers, n);
24 result += va_arg(numbers, int);
26 va_end(numbers);
|
| /external/valgrind/main/memcheck/tests/x86-linux/ |
| scalar_fork.c | 7 // All __NR_xxx numbers are taken from x86
|
| scalar_vfork.c | 7 // All __NR_xxx numbers are taken from x86
|
