Searched refs:numbers (Results 1 - 25 of 123) sorted by relevance

12345

/external/v8/test/mjsunit/regress/
H A Dregress-91008.js29 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[
[all...]
H A Dregress-201.js32 var numbers=new Array(n);
33 for (var i=0;i<n;i++) numbers[i]=i;
34 numbers.sort();
/external/clang/test/CodeGenCXX/
H A Ddebug-info-namespace.cpp5 enum numbers { enum in namespace:A
12 numbers n;
/external/stlport/test/unit/
H A Diota_test.cpp34 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[
[all...]
H A Dheap_test.cpp37 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[
55 int numbers[6] = { 5, 10, 4, 13, 11, 19 }; local
[all...]
H A Dcount_test.cpp34 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
[all...]
H A Dnthelm_test.cpp35 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[
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...]
H A Dpartition_test.cpp56 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) / sizeo
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...]
H A Dsort_test.cpp56 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[ local
129 int numbers[] = { 1, 50, -10, 11, 42, 19 }; local
198 int numbers[] = { 0, 0, 1, 0, 0, 1, 0, 0 }; local
[all...]
H A Dforeach_test.cpp37 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[
[all...]
H A Drm_cp_test.cpp56 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[ 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...]
H A Drndshf_test.cpp42 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, number
[all...]
H A Dunique_test.cpp37 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[
70 int numbers[8] = { 0, 1, 1, 2, 2, 2, 3, 4 }; local
[all...]
H A Dinplace_test.cpp33 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[
[all...]
H A Drotate_test.cpp38 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[
92 int numbers[6] = { 0, 1, 2, 3, 4, 5 }; local
[all...]
H A Dpartial_test.cpp63 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[
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...]
H A Dfind_test.cpp40 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
[all...]
H A Dgenerator_test.cpp41 int numbers[10]; local
43 generate(numbers, numbers + 10, ptr_gen(cxxrand));
45 generate(numbers, numbers + 10, cxxrand);
H A Dmax_test.cpp52 int numbers[6] = { 4, 10, 56, 11, -42, 19 }; local
54 int* r = max_element((int*)numbers, (int*)numbers + 6);
/external/compiler-rt/BlocksRuntime/tests/
H A Dvarargs-bad-assign.c23 va_list numbers;
26 va_start(numbers, n);
28 result += va_arg(numbers, int);
30 va_end(numbers);
H A Dvarargs.c19 va_list numbers;
22 va_start(numbers, n);
24 result += va_arg(numbers, int);
26 va_end(numbers);
/external/clang/test/SemaCXX/
H A Darray-bounds-ptr-arith.cpp23 double numbers[2]; // expected-note {{declared here}} local
24 swallow((char*)numbers + sizeof(double)); // no-warning
25 swallow((char*)numbers + 60); // expected-warning {{refers past the end of the array}}
/external/protobuf/src/google/protobuf/
H A Ddescriptor_database_unittest.cc367 // Can't find non-existent extension numbers.
408 vector<int> numbers; local
409 EXPECT_TRUE(database_->FindAllExtensionNumbers("Foo", &numbers));
410 ASSERT_EQ(2, numbers.size());
411 sort(numbers.begin(), numbers.end());
412 EXPECT_EQ(5, numbers[0]);
413 EXPECT_EQ(32, numbers[1]);
417 vector<int> numbers; local
418 EXPECT_TRUE(database_->FindAllExtensionNumbers("corge.Bar", &numbers));
426 vector<int> numbers; local
432 vector<int> numbers; local
706 vector<int> numbers; local
714 vector<int> numbers; local
722 vector<int> numbers; local
731 vector<int> numbers; local
741 vector<int> numbers; local
[all...]
/external/opencv/cvaux/src/
H A Dcvcreatehandmask.cpp52 static CvStatus icvCreateHandMask8uC1R(CvSeq * numbers, argument
62 if( numbers == NULL )
65 if( !CV_IS_SEQ_POINT_SET( numbers ))
72 cvStartReadSeq( numbers, &reader, 0 );
74 k_point = numbers->total;
108 // numbers - pointer to the input sequence of the point's indexes inside
116 cvCreateHandMask( CvSeq * numbers, IplImage * img_mask, CvRect * roi ) argument
134 IPPI_CALL( icvCreateHandMask8uC1R( numbers, img_mask_data,
/external/icu4c/test/letest/
H A Dxmlreader.cpp36 static le_uint32 *getHexArray(const UnicodeString &numbers, int32_t &arraySize) argument
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_ argument
[all...]

Completed in 2420 milliseconds

12345