| /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...] |
| 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...] |
| partial_test.cpp | 63 int numbers[6] = { 5, 2, 4, 3, 1, 6 }; local
65 partial_sort((int*)numbers, (int*)numbers + 3, (int*)numbers + 6);
68 CPPUNIT_ASSERT(numbers[0]==1);
69 CPPUNIT_ASSERT(numbers[1]==2);
70 CPPUNIT_ASSERT(numbers[2]==3);
71 CPPUNIT_ASSERT(numbers[3]==5);
72 CPPUNIT_ASSERT(numbers[4]==4);
73 CPPUNIT_ASSERT(numbers[5]==6)
80 int numbers[10] ={ 8, 8, 5, 3, 7, 6, 5, 3, 2, 4 }; local
125 int numbers[6] = { 5, 2, 4, 3, 1, 6 }; local
137 int numbers[10] ={ 3, 0, 4, 3, 2, 8, 2, 7, 7, 5 }; local
176 int numbers[] = { 0, 0, 1, 0, 0, 1, 0, 0 }; local
202 int numbers[6] = { 1, 2, 3, 4, 5, 6 }; local
[all...] |
| rotate_test.cpp | 38 int numbers[6] = { 0, 1, 2, 3, 4, 5 }; local
40 rotate((int*)numbers, numbers + 3, numbers + 6);
41 CPPUNIT_ASSERT(numbers[0]==3);
42 CPPUNIT_ASSERT(numbers[1]==4);
43 CPPUNIT_ASSERT(numbers[2]==5);
44 CPPUNIT_ASSERT(numbers[3]==0);
45 CPPUNIT_ASSERT(numbers[4]==1);
46 CPPUNIT_ASSERT(numbers[5]==2)
92 int numbers[6] = { 0, 1, 2, 3, 4, 5 }; local
[all...] |
| find_test.cpp | 40 int numbers[10] = { 0, 1, 4, 9, 16, 25, 36, 49, 64 }; local
42 int *location = find((int*)numbers, (int*)numbers + 10, 25);
44 CPPUNIT_ASSERT((location - numbers)==5);
46 int *out_range = find((int*)numbers, (int*)numbers + 10, 128);
48 CPPUNIT_ASSERT( out_range == (int *)(numbers + 10) );
77 int numbers[6] = { 2, 4, 8, 15, 32, 64 }; local
78 int *location = find_if((int*)numbers, (int*)numbers + 6, odd)
[all...] |
| generator_test.cpp | 41 int numbers[10]; local
43 generate(numbers, numbers + 10, ptr_gen(cxxrand));
45 generate(numbers, numbers + 10, cxxrand);
|
| iter_test.cpp | 99 int numbers[6] = { 0, 1, 2, 3, 4, 5 }; local
101 iter_swap(numbers, numbers + 3);
103 CPPUNIT_ASSERT(numbers[0]==3);
104 CPPUNIT_ASSERT(numbers[1]==1);
105 CPPUNIT_ASSERT(numbers[2]==2);
106 CPPUNIT_ASSERT(numbers[3]==0);
107 CPPUNIT_ASSERT(numbers[4]==4);
108 CPPUNIT_ASSERT(numbers[5]==5);
|
| copy_test.cpp | 120 int numbers[5] = { 1, 2, 3, 4, 5 }; local
123 copy_backward(numbers, numbers + 5, (int*)result + 5);
124 CPPUNIT_ASSERT(result[0]==numbers[0]);
125 CPPUNIT_ASSERT(result[1]==numbers[1]);
126 CPPUNIT_ASSERT(result[2]==numbers[2]);
127 CPPUNIT_ASSERT(result[3]==numbers[3]);
128 CPPUNIT_ASSERT(result[4]==numbers[4]);
|
| /dalvik/tests/055-enum-performance/ |
| info.txt | 1 This is a performance test of Enum.valueOf(). To see the numbers, invoke
|
| /dalvik/tests/057-iteration-performance/ |
| info.txt | 1 This is a performance test of various iterator uses. To see the numbers,
|
| /dalvik/libcore/math/src/main/java/java/math/ |
| package.html | 7 decimal numbers. These numbers are suitable for currency calculations.
|
| /dalvik/libcore/security/src/main/java/org/bouncycastle/asn1/x509/ |
| NoticeReference.java | 39 * @param numbers a <code>Vector</code> value
43 Vector numbers)
47 Object o = numbers.elementAt(0);
52 Enumeration it = numbers.elements();
69 * @param numbers an <code>ASN1EncodableVector</code> value
73 ASN1Sequence numbers)
76 noticeNumbers = numbers;
84 * @param numbers an <code>ASN1EncodableVector</code> value
89 ASN1Sequence numbers)
93 noticeNumbers = numbers;
[all...] |
| /external/icu4c/test/letest/ |
| xmlreader.cpp | 36 static le_uint32 *getHexArray(const UnicodeString &numbers, int32_t &arraySize)
41 while((offset = numbers.indexOf(CH_COMMA, offset + 1)) >= 0) {
52 while(u_isUWhiteSpace(numbers[start])) {
56 while((end = numbers.indexOf(CH_COMMA, start)) >= 0) {
57 len = numbers.extract(start, end - start, number, ARRAY_SIZE(number), US_INV);
64 while(u_isUWhiteSpace(numbers[start])) {
70 end = numbers.length();
71 while(u_isUWhiteSpace(numbers[end - 1])) {
75 len = numbers.extract(start, end - start, number, ARRAY_SIZE(number), US_INV);
82 static float *getFloatArray(const UnicodeString &numbers, int32_t &arraySize
[all...] |
| /external/webkit/WebCore/manual-tests/ |
| js-timers-beneath-modal-dialog.html | 13 alert("Numbers in main window should not increase while this alert is displayed");
14 showModalDialog("data:text/html,<p>Numbers in main window should not increase while this modal dialog is displayed</p>");
|
| /dalvik/dx/tests/003-magic-version-access/ |
| info.txt | 8 * major / minor version numbers
|
| /development/samples/VoiceRecognitionService/res/values/ |
| strings.xml | 27 <!-- The title of the preference for the type of results to return (letters or numbers). -->
31 (letters or numbers). -->
34 <item>Numbers</item>
38 (letters or numbers). -->
45 (letters or numbers). -->
|
