Searched refs:numbers (Results 26 - 50 of 186) sorted by relevance

12345678

/external/chromium_org/third_party/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/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,
H A Dcvfindhandregion.cpp58 CvMemStorage * storage, CvSeq ** numbers )
125 /* alloc memory for the temporale point's numbers */
180 *numbers = cvCreateSeq( CV_SEQ_POINT_SET, sizeof( CvSeq ), sizeof( CvPoint ), storage );
181 assert( numbers != 0 );
182 if( numbers == NULL )
188 cvStartAppendToSeq( *numbers, &writer );
273 CvMemStorage * storage, CvSeq ** numbers )
350 /* alloc memory for the temporale point's numbers */
452 *numbers = NULL;
470 *numbers
[all...]
/external/stlport/test/unit/
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);
H A Dmin_test.cpp51 int numbers[6] = { -10, 15, -100, 36, -242, 42 }; local
52 int* r = min_element((int*)numbers, (int*)numbers + 6);
H A Dcopy_test.cpp120 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]);
H A Diter_test.cpp99 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);
H A Dtransform_test.cpp46 int numbers[6] = { -5, -1, 0, 1, 6, 11 }; local
49 transform((int*)numbers, (int*)numbers + 6, (int*)result, negate_int);
/external/chromium_org/third_party/icu/source/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...]
/external/chromium_org/third_party/icu/source/test/perf/leperf/
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...]
/external/icu/icu4c/source/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...]
/external/icu/icu4c/source/test/perf/leperf/
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...]
/external/clang/test/Misc/
H A Ddiag-line-wrapping.cpp21 // CHECK-NOT: static const float numbers[]
22 static const float numbers[] = {0.1764705882352941,0.1176470588235294,0.1176470588235294,0.1176470588235294,0.1176470588235294,0.3529411764705883,0.2352941176470588,0.1176470588235294,0.1176470588235294,0.1176470588235294,0.1176470588235294,0.4117647058823529,0.1176470588235294,0.1176470588235294,0.1176470588235294,0.1176470588235294,0.1764705882352941,0.3529411764705883,0.1764705882352941,0.1176470588235294,0.1176470588235294,0.1176470588235294,0.1764705882352941,0.4117647058823529,0.2352941176470588,0.1176470588235294,0.1176470588235294,0.1176470588235294,0.1764705882352941,0.4705882352941176,0.1176470588235294,0.1176470588235294,0.1176470588235294,0.1176470588235294,0.2352941176470588,0.4117647058823529,0.1764705882352941,0.1176470588235294,0.1176470588235294,0.1176470588235294,0.2352941176470588,0.4705882352941176,0.2352941176470588,0.1176470588235294,0.1176470588235294,0.1176470588235294,0.2352941176470588,0.5294117647058824,0.1176470588235294,0.1176470588235294,0.1176470588235294,0.1176470588235294,0.2941176470588235,0.4705882352941176,0.1764705882352941,0.1176470588235294,0.1176470588235294,0.1176470588235294,0.2941176470588235,0.5294117647058824,0.1176470588235294,0.1176470588235294,0.1176470588235294,0.1176470588235294,0.3529411764705883,0.5294117647058824,0.4117647058823529,0.1176470588235294,0.1176470588235294,0.1764705882352941,0.1764705882352941,0.1176470588235294,0.1176470588235294,0.1176470588235294,0.1176470588235294,0.1764705882352941,0.1764705882352941,0.3529411764705883,0.1764705882352941,0.1176470588235294,0.1176470588235294,0.1764705882352941,0.1764705882352941,0.4117647058823529,0.4117647058823529,0.1176470588235294,0.1176470588235294,0.1764705882352941,0.2352941176470588,0.1764705882352941,0.1176470588235294,0.1176470588235294,0.1176470588235294,0.1764705882352941,0.2352941176470588,0.4117647058823529,0.1764705882352941,0.1176470588235294,0.1176470588235294,0.1764705882352941,0.2352941176470588,0.4705882352941176,0.4117647058823529,0.1176470588235294,0.1176470588235294,0.1764705882352941,0.2941176470588235,0.2352941176470588,0.1176470588235294,0.1176470588235294,0.1176470588235294,0.1764705882352941,0.2941176470588235,0.4705882352941176,0.1764705882352941,0.1176470588235294,0.1176470588235294,0.1764705882352941,0.2941176470588235,0.5294117647058824,0.4117647058823529,0.1176470588235294,0.1176470588235294,0.1764705882352941,0.3529411764705883,0.2941176470588235,0.1176470588235294,0.1176470588235294,0.1176470588235294,0.1764705882352941,0.3529411764705883,0.5294117647058824,0.3529411764705883,0.1176470588235294,0.1176470588235294,0.2352941176470588,0.2352941176470588,0.1176470588235294,0.4117647058823529,0.1176470588235294,0.1176470588235294,0.2352941176470588,0.2352941176470588,0.1764705882352941,0.1176470588235294,0.1176470588235294,0.1176470588235294,0.2352941176470588,0.2352941176470588,0.4117647058823529,0.3529411764705883,0.1176470588235294,0.1176470588235294,0.2352941176470588,0.2941176470588235,0.1764705882352941,0.4117647058823529,0.1176470588235294,0.1176470588235294,0.2352941176470588,0.2941176470588235,0.2352941176470588,0.1176470588235294,0.1176470588235294,0.1176470588235294,0.2352941176470588,0.2941176470588235,0.4705882352941176,0.3529411764705883,0.1176470588235294,0.1176470588235294,0.2352941176470588,0.3529411764705883,0.2352941176470588,0.1176470588235294,0.1176470588235294,0.1176470588235294,0.2352941176470588,0.3529411764705883,0.5294117647058824,0.3529411764705883,0.1176470588235294,0.1176470588235294,0.2352941176470588,0.4117647058823529,0.2941176470588235,0.2941176470588235,0.1176470588235294,0.1176470588235294,0.2941176470588235,0.2941176470588235,0.1176470588235294,0.3529411764705883,0.1176470588235294,0.1176470588235294,0.2941176470588235,0.2941176470588235,0.1764705882352941,0.2941176470588235,0.1176470588235294,0.1176470588235294,0.2941176470588235,0.3529411764705883,0.1764705882352941,0.3529411764705883,0.1176470588235294,0.1176470588235294,0.2941176470588235,0.3529411764705883,0.2352941176470588,0.2941176470588235,0.1176470588235294,0.1176470588235294,0.2941176470588235,0.4117647058823529,0.2352941176470588,0.2941176470588235,0.1176470588235294,0.1176470588235294,0.2941176470588235,0.4705882352941176,0.2941176470588235,0.2352941176470588,0.1176470588235294,0.1176470588235294,0.3529411764705883,0.3529411764705883,0.1176470588235294,0.2941176470588235,0.1176470588235294,0.1176470588235294,0.3529411764705883,0.3529411764705883,0.1764705882352941,0.2352941176470588,0.1176470588235294,0.1176470588235294,0.3529411764705883,0.4117647058823529,0.1764705882352941,0.2941176470588235,0.1176470588235294,0.1176470588235294,0.3529411764705883,0.4117647058823529,0.2352941176470588,0.2352941176470588,0.1176470588235294,0.1176470588235294,0.3529411764705883,0.4705882352941176,0.2352941176470588,0.2352941176470588,0.1176470588235294,0.1176470588235294,0.3529411764705883,0.5294117647058824,0.2941176470588235,0.1764705882352941,0.1176470588235294,0.1176470588235294,0.4117647058823529}; variable
/external/chromium_org/content/public/common/
H A Dwebplugininfo.cc86 std::vector<std::string> numbers; local
87 base::SplitString(version, '.', &numbers);
88 for (size_t i = 0; i < numbers.size(); ++i) {
89 size_t n = numbers[i].size();
91 while (j < n && numbers[i][j] == '0') {
94 no_leading_zeros_version += (j < n) ? numbers[i].substr(j) : "0";
95 if (i != numbers.size() - 1) {
/external/fio/t/
H A Dlfsr-test.c14 printf("Usage: lfsr-test 0x<numbers> [seed] [spin] [verify]\n");
16 printf("*numbers: how many random numbers to produce (in hex)\n"
20 "Only <numbers> is required. The rest are evaluated to 0 or false\n"
33 uint64_t numbers; local
45 case 2: numbers = strtol(argv[1], NULL, 16);
58 r = lfsr_init(fl, numbers, seed, spin);
76 v_size = numbers * sizeof(uint8_t);
85 * numbers. Verifying the results should introduce some small yet not
98 /* Check if all expected numbers withi
[all...]
/external/llvm/test/MC/Mips/
H A Dcfi.s7 # canonicalised to their DWARF register numbers.
/external/openssl/crypto/des/times/
H A Dusparc.cc13 and while it makes the des_opts numbers much slower, it makes the
14 actual 'speed' numbers look better which is a realistic version of
/external/chromium_org/base/
H A Dversion.cc20 // Parses the |numbers| vector representing the different numbers
23 // is the resulting integer vector. Function returns true if all numbers were
27 std::vector<std::string> numbers; local
28 SplitString(version_str, '.', &numbers);
29 if (numbers.empty())
32 for (std::vector<std::string>::const_iterator it = numbers.begin();
33 it != numbers.end(); ++it) {
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/network/
H A DRequestTimingView.js122 * @param {!Array.<number>} numbers
125 function firstPositive(numbers)
127 for (var i = 0; i < numbers.length; ++i) {
128 if (numbers[i] > 0)
129 return numbers[i];
/external/chromium_org/third_party/protobuf/src/google/protobuf/compiler/cpp/
H A Dcpp_enum.cc209 // numbers, then printing a case statement for each element.
211 set<int> numbers; local
214 numbers.insert(value->number());
217 for (set<int>::iterator iter = numbers.begin();
218 iter != numbers.end(); ++iter) {
/external/chromium_org/v8/benchmarks/
H A Dbase.js55 // Automatically convert results to numbers. Used by the geometric
147 // Computes the geometric mean of a set of numbers.
148 BenchmarkSuite.GeometricMean = function(numbers) {
150 for (var i = 0; i < numbers.length; i++) {
151 log += Math.log(numbers[i]);
153 return Math.pow(Math.E, log / numbers.length);
/external/lldb/test/expression_command/formatters/
H A Dmain.cpp44 int numbers[5] = {1,2,3,4,5}; local
/external/protobuf/src/google/protobuf/compiler/cpp/
H A Dcpp_enum.cc209 // numbers, then printing a case statement for each element.
211 set<int> numbers; local
214 numbers.insert(value->number());
217 for (set<int>::iterator iter = numbers.begin();
218 iter != numbers.end(); ++iter) {

Completed in 1190 milliseconds

12345678