HomeSort by relevance Sort by last modified time
    Searched full:numbers (Results 1 - 25 of 2856) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/stlport/test/unit/
heap_test.cpp 37 int numbers[6] = { 5, 10, 4, 13, 11, 19 }; local
39 make_heap(numbers, numbers + 6);
40 CPPUNIT_ASSERT(numbers[0]==19)
41 pop_heap(numbers, numbers + 6);
42 CPPUNIT_ASSERT(numbers[0]==13)
43 pop_heap(numbers, numbers + 5);
44 CPPUNIT_ASSERT(numbers[0]==11
55 int numbers[6] = { 5, 10, 4, 13, 11, 19 }; local
    [all...]
iota_test.cpp 34 int numbers[10]; local
35 iota(numbers, numbers + 10, 42);
36 CPPUNIT_ASSERT(numbers[0]==42);
37 CPPUNIT_ASSERT(numbers[1]==43);
38 CPPUNIT_ASSERT(numbers[2]==44);
39 CPPUNIT_ASSERT(numbers[3]==45);
40 CPPUNIT_ASSERT(numbers[4]==46);
41 CPPUNIT_ASSERT(numbers[5]==47);
42 CPPUNIT_ASSERT(numbers[6]==48)
    [all...]
count_test.cpp 34 int numbers[10] = { 1, 2, 4, 1, 2, 4, 1, 2, 4, 1 }; local
36 int result = count(numbers, numbers + 10, 1);
40 count(numbers, numbers + 10, 1, result);
46 vector <int> numbers(100);
48 numbers[i] = i % 3;
49 int elements = count(numbers.begin(), numbers.end(), 2);
53 count(numbers.begin(), numbers.end(), 2, elements)
    [all...]
foreach_test.cpp 37 int numbers[10] = { 1, 1, 2, 3, 5, 8, 13, 21, 34, 55 }; local
39 for_each(numbers, numbers + 10, ptr_fun(increase));
41 CPPUNIT_ASSERT(numbers[0]==2);
42 CPPUNIT_ASSERT(numbers[1]==2);
43 CPPUNIT_ASSERT(numbers[2]==3);
44 CPPUNIT_ASSERT(numbers[3]==4);
45 CPPUNIT_ASSERT(numbers[4]==6);
46 CPPUNIT_ASSERT(numbers[5]==9);
47 CPPUNIT_ASSERT(numbers[6]==14)
    [all...]
rndshf_test.cpp 42 int numbers[6] = { 1, 2, 3, 4, 5, 6 }; local
44 random_shuffle(numbers, numbers + 6);
46 CPPUNIT_ASSERT(count(numbers, numbers+6, 1)==1);
47 CPPUNIT_ASSERT(count(numbers, numbers+6, 2)==1);
48 CPPUNIT_ASSERT(count(numbers, numbers+6, 3)==1);
49 CPPUNIT_ASSERT(count(numbers, numbers+6, 4)==1)
    [all...]
partition_test.cpp 56 int numbers[6] = { 10, 5, 11, 20, 6, -2 }; local
59 stable_partition((int*)numbers, (int*)numbers + 6, less_n(10, nb_pred_calls));
61 CPPUNIT_ASSERT(numbers[0]==5);
62 CPPUNIT_ASSERT(numbers[1]==6);
63 CPPUNIT_ASSERT(numbers[2]==-2);
64 CPPUNIT_ASSERT(numbers[3]==10);
65 CPPUNIT_ASSERT(numbers[4]==11);
66 CPPUNIT_ASSERT(numbers[5]==20);
69 CPPUNIT_ASSERT( nb_pred_calls == sizeof(numbers) / sizeof(numbers[0]) )
75 int numbers[] = { 5, 5, 2, 10, 0, 12, 5, 0, 0, 19 }; local
95 int numbers[6] = { 6, 12, 3, 10, 1, 20 }; local
113 int numbers[10] ={ 19, 3, 11, 14, 10, 19, 8, 17, 9, 6 }; local
    [all...]
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...]
  /ndk/tests/device/test-gnustl-full/unit/
heap_test.cpp 37 int numbers[6] = { 5, 10, 4, 13, 11, 19 }; local
39 make_heap(numbers, numbers + 6);
40 CPPUNIT_ASSERT(numbers[0]==19)
41 pop_heap(numbers, numbers + 6);
42 CPPUNIT_ASSERT(numbers[0]==13)
43 pop_heap(numbers, numbers + 5);
44 CPPUNIT_ASSERT(numbers[0]==11
55 int numbers[6] = { 5, 10, 4, 13, 11, 19 }; local
    [all...]
iota_test.cpp 34 int numbers[10]; local
35 iota(numbers, numbers + 10, 42);
36 CPPUNIT_ASSERT(numbers[0]==42);
37 CPPUNIT_ASSERT(numbers[1]==43);
38 CPPUNIT_ASSERT(numbers[2]==44);
39 CPPUNIT_ASSERT(numbers[3]==45);
40 CPPUNIT_ASSERT(numbers[4]==46);
41 CPPUNIT_ASSERT(numbers[5]==47);
42 CPPUNIT_ASSERT(numbers[6]==48)
    [all...]
count_test.cpp 34 int numbers[10] = { 1, 2, 4, 1, 2, 4, 1, 2, 4, 1 }; local
36 int result = count(numbers, numbers + 10, 1);
40 count(numbers, numbers + 10, 1, result);
46 vector <int> numbers(100);
48 numbers[i] = i % 3;
49 int elements = count(numbers.begin(), numbers.end(), 2);
53 count(numbers.begin(), numbers.end(), 2, elements)
    [all...]
foreach_test.cpp 37 int numbers[10] = { 1, 1, 2, 3, 5, 8, 13, 21, 34, 55 }; local
39 for_each(numbers, numbers + 10, ptr_fun(increase));
41 CPPUNIT_ASSERT(numbers[0]==2);
42 CPPUNIT_ASSERT(numbers[1]==2);
43 CPPUNIT_ASSERT(numbers[2]==3);
44 CPPUNIT_ASSERT(numbers[3]==4);
45 CPPUNIT_ASSERT(numbers[4]==6);
46 CPPUNIT_ASSERT(numbers[5]==9);
47 CPPUNIT_ASSERT(numbers[6]==14)
    [all...]
rndshf_test.cpp 42 int numbers[6] = { 1, 2, 3, 4, 5, 6 }; local
44 random_shuffle(numbers, numbers + 6);
46 CPPUNIT_ASSERT(count(numbers, numbers+6, 1)==1);
47 CPPUNIT_ASSERT(count(numbers, numbers+6, 2)==1);
48 CPPUNIT_ASSERT(count(numbers, numbers+6, 3)==1);
49 CPPUNIT_ASSERT(count(numbers, numbers+6, 4)==1)
    [all...]
partition_test.cpp 56 int numbers[6] = { 10, 5, 11, 20, 6, -2 }; local
59 stable_partition((int*)numbers, (int*)numbers + 6, less_n(10, nb_pred_calls));
61 CPPUNIT_ASSERT(numbers[0]==5);
62 CPPUNIT_ASSERT(numbers[1]==6);
63 CPPUNIT_ASSERT(numbers[2]==-2);
64 CPPUNIT_ASSERT(numbers[3]==10);
65 CPPUNIT_ASSERT(numbers[4]==11);
66 CPPUNIT_ASSERT(numbers[5]==20);
69 CPPUNIT_ASSERT( nb_pred_calls == sizeof(numbers) / sizeof(numbers[0]) )
75 int numbers[] = { 5, 5, 2, 10, 0, 12, 5, 0, 0, 19 }; local
95 int numbers[6] = { 6, 12, 3, 10, 1, 20 }; local
113 int numbers[10] ={ 19, 3, 11, 14, 10, 19, 8, 17, 9, 6 }; local
    [all...]
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...]
  /ndk/tests/device/test-stlport/unit/
heap_test.cpp 37 int numbers[6] = { 5, 10, 4, 13, 11, 19 }; local
39 make_heap(numbers, numbers + 6);
40 CPPUNIT_ASSERT(numbers[0]==19)
41 pop_heap(numbers, numbers + 6);
42 CPPUNIT_ASSERT(numbers[0]==13)
43 pop_heap(numbers, numbers + 5);
44 CPPUNIT_ASSERT(numbers[0]==11
55 int numbers[6] = { 5, 10, 4, 13, 11, 19 }; local
    [all...]
iota_test.cpp 34 int numbers[10]; local
35 iota(numbers, numbers + 10, 42);
36 CPPUNIT_ASSERT(numbers[0]==42);
37 CPPUNIT_ASSERT(numbers[1]==43);
38 CPPUNIT_ASSERT(numbers[2]==44);
39 CPPUNIT_ASSERT(numbers[3]==45);
40 CPPUNIT_ASSERT(numbers[4]==46);
41 CPPUNIT_ASSERT(numbers[5]==47);
42 CPPUNIT_ASSERT(numbers[6]==48)
    [all...]
count_test.cpp 34 int numbers[10] = { 1, 2, 4, 1, 2, 4, 1, 2, 4, 1 }; local
36 int result = count(numbers, numbers + 10, 1);
40 count(numbers, numbers + 10, 1, result);
46 vector <int> numbers(100);
48 numbers[i] = i % 3;
49 int elements = count(numbers.begin(), numbers.end(), 2);
53 count(numbers.begin(), numbers.end(), 2, elements)
    [all...]
foreach_test.cpp 37 int numbers[10] = { 1, 1, 2, 3, 5, 8, 13, 21, 34, 55 }; local
39 for_each(numbers, numbers + 10, ptr_fun(increase));
41 CPPUNIT_ASSERT(numbers[0]==2);
42 CPPUNIT_ASSERT(numbers[1]==2);
43 CPPUNIT_ASSERT(numbers[2]==3);
44 CPPUNIT_ASSERT(numbers[3]==4);
45 CPPUNIT_ASSERT(numbers[4]==6);
46 CPPUNIT_ASSERT(numbers[5]==9);
47 CPPUNIT_ASSERT(numbers[6]==14)
    [all...]
rndshf_test.cpp 42 int numbers[6] = { 1, 2, 3, 4, 5, 6 }; local
44 random_shuffle(numbers, numbers + 6);
46 CPPUNIT_ASSERT(count(numbers, numbers+6, 1)==1);
47 CPPUNIT_ASSERT(count(numbers, numbers+6, 2)==1);
48 CPPUNIT_ASSERT(count(numbers, numbers+6, 3)==1);
49 CPPUNIT_ASSERT(count(numbers, numbers+6, 4)==1)
    [all...]
partition_test.cpp 56 int numbers[6] = { 10, 5, 11, 20, 6, -2 }; local
59 stable_partition((int*)numbers, (int*)numbers + 6, less_n(10, nb_pred_calls));
61 CPPUNIT_ASSERT(numbers[0]==5);
62 CPPUNIT_ASSERT(numbers[1]==6);
63 CPPUNIT_ASSERT(numbers[2]==-2);
64 CPPUNIT_ASSERT(numbers[3]==10);
65 CPPUNIT_ASSERT(numbers[4]==11);
66 CPPUNIT_ASSERT(numbers[5]==20);
69 CPPUNIT_ASSERT( nb_pred_calls == sizeof(numbers) / sizeof(numbers[0]) )
75 int numbers[] = { 5, 5, 2, 10, 0, 12, 5, 0, 0, 19 }; local
95 int numbers[6] = { 6, 12, 3, 10, 1, 20 }; local
113 int numbers[10] ={ 19, 3, 11, 14, 10, 19, 8, 17, 9, 6 }; local
    [all...]
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...]
  /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/
unistd.h 5 * Include machine specific syscall numbers

Completed in 185 milliseconds

1 2 3 4 5 6 7 8 91011>>