HomeSort by relevance Sort by last modified time
    Searched defs:numbers (Results 26 - 50 of 126) sorted by null

12 3 4 5 6

  /external/clang/test/CodeGenCXX/
cp-blocks-linetables.cpp 16 enum numbers { enum
20 typedef enum numbers (^myblock)(enum numbers);
28 __block enum numbers x = one;
29 __block enum numbers y = two;
32 myblock CL = ^(enum numbers z)
33 { enum numbers savex = x;
34 { __block enum numbers x = savex;
40 ^ (enum numbers z) {
51 return (enum numbers) four
    [all...]
  /external/fio/t/
lfsr-test.c 16 printf("Usage: lfsr-test 0x<numbers> [seed] [spin] [verify]\n");
18 printf("*numbers: how many random numbers to produce (in hex)\n"
22 "Only <numbers> is required. The rest are evaluated to 0 or false\n"
35 uint64_t numbers; local
47 case 2: numbers = strtol(argv[1], NULL, 16);
60 r = lfsr_init(fl, numbers, seed, spin);
78 v_size = numbers * sizeof(uint8_t);
87 * numbers. Verifying the results should introduce some small yet not
100 /* Check if all expected numbers within range have been calculated *
    [all...]
  /external/lldb/test/expression_command/formatters/
main.cpp 44 int numbers[5] = {1,2,3,4,5}; local
  /ndk/tests/device/test-gnustl-full/unit/
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]);
max_test.cpp 52 int numbers[6] = { 4, 10, 56, 11, -42, 19 }; local
54 int* r = max_element((int*)numbers, (int*)numbers + 6);
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...]
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...]
transform_test.cpp 46 int numbers[6] = { -5, -1, 0, 1, 6, 11 }; local
49 transform((int*)numbers, (int*)numbers + 6, (int*)result, negate_int);
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...]
adj_test.cpp 87 int numbers[5] = { 1, 2, 4, 8, 16 }; local
89 adjacent_difference(numbers, numbers + 5, (int*)difference);
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...]
equal_test.cpp 43 int numbers[10] = { 0, 0, 1, 1, 2, 2, 2, 2, 3, 3 }; local
44 pair<int*, int*> range = equal_range((int*)numbers, (int*)numbers + 10, 2);
45 CPPUNIT_ASSERT( (range.first - numbers) == 4 );
46 CPPUNIT_ASSERT( (range.second - numbers) == 8 );
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);
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/
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]);
max_test.cpp 52 int numbers[6] = { 4, 10, 56, 11, -42, 19 }; local
54 int* r = max_element((int*)numbers, (int*)numbers + 6);
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...]
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...]
transform_test.cpp 46 int numbers[6] = { -5, -1, 0, 1, 6, 11 }; local
49 transform((int*)numbers, (int*)numbers + 6, (int*)result, negate_int);
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...]
adj_test.cpp 87 int numbers[5] = { 1, 2, 4, 8, 16 }; local
89 adjacent_difference(numbers, numbers + 5, (int*)difference);
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...]
equal_test.cpp 43 int numbers[10] = { 0, 0, 1, 1, 2, 2, 2, 2, 3, 3 }; local
44 pair<int*, int*> range = equal_range((int*)numbers, (int*)numbers + 10, 2);
45 CPPUNIT_ASSERT( (range.first - numbers) == 4 );
46 CPPUNIT_ASSERT( (range.second - numbers) == 8 );
  /external/protobuf/src/google/protobuf/compiler/cpp/
cpp_enum.cc 236 // numbers, then printing a case statement for each element.
238 set<int> numbers; local
241 numbers.insert(value->number());
244 for (set<int>::iterator iter = numbers.begin();
245 iter != numbers.end(); ++iter) {
  /external/icu/icu4c/source/samples/plurfmtsample/
plurfmtsample.cpp 39 int numbers[] = {0, 1, 2, 3, 4, 5, 10, 100, 101, 102}; local
44 for (int i=0;i<sizeof(numbers)/sizeof(int);i++) {
47 Formattable argEn[]={Formattable(numbers[i]), Formattable(plfmtEn.format(numbers[i],status))};
48 Formattable argSl[]={Formattable(numbers[i]), Formattable(plfmtSl.format(numbers[i],status))};
51 u_printf("%-16d%-16S%-16S\n", numbers[i], msgEn.getTerminatedBuffer(),msgSl.getTerminatedBuffer());
64 for (int i=0;i<sizeof(numbers)/sizeof(int);i++) {
66 Formattable arg[] = {numbers[i]};
70 u_printf("%-16d%-16S%-16S\n", numbers[i], msgEn.getTerminatedBuffer(), msgSl.getTerminatedBuffer())
    [all...]

Completed in 194 milliseconds

12 3 4 5 6