Searched refs:count1 (Results 1 - 20 of 20) sorted by relevance

/external/stlport/test/unit/
H A Dcount_test.cpp16 CPPUNIT_TEST(count1);
22 void count1();
44 void CountTest::count1() function in class:CountTest
/external/webkit/SunSpider/resources/
H A Dsunspider-compare-results.js28 var count1 = output1.length;
32 itemTotals1.length = count1;
96 for (var i = 0; i < count1; i++) {
301 var df = count1 + count2 - 2;
326 return result + pad(diffSummary, 18) + formatMean(meanWidth1, mean1, stdErr1, count1) + " " + formatMean(meanWidth2, mean2, stdErr2, count2) + diffDetail;
370 mean1 = computeMeans(count1, total1, categoryTotals1, categoryMeans1, testTotalsByCategory1, testMeansByCategory1);
376 stdErr1 = computeStdErrors(count1, stdDev1, categoryStdErrs1, categoryStdDevs1, testStdErrsByCategory1, testStdDevsByCategory1);
/external/freetype/src/pshinter/
H A Dpshrec.c382 FT_UInt count1 = mask1->num_bits; local
387 count = ( count1 <= count2 ) ? count1 : count2;
429 FT_UInt count1 = mask1->num_bits; local
441 /* if "count2" is greater than "count1", we need to grow the */
443 if ( count2 > count1 )
449 for ( pos = count1; pos < count2; pos++ )
1007 FT_UInt count1 = dim[0].hints.num_hints; local
1012 if ( bit_count != count1 + count2 )
1016 bit_count, count1
1052 FT_UInt count1 = dim[0].hints.num_hints; local
[all...]
H A Dpshglob.c476 FT_UInt count1, count2; local
493 count1 = normal->count;
495 for ( ; count1 > 0; count1--, zone1++ )
/external/chromium/third_party/icu/source/i18n/
H A Ducol_wgt.c385 uint32_t count1, count2, power_1, power; local
389 /* calculate how to split the range between maxLength-1 (count1) and maxLength (count2) */
393 count1=ranges[0].count-count2;
397 printf("split the first range %ld:%ld\n", count1, count2);
399 if(count1<1) {
414 /* set the end of the first range according to count1 */
416 byte=getWeightByte(ranges[0].start, i)+count1-1;
419 * ranges[0].count and count1 may be >countBytes
438 ranges[0].count=count1;
441 ranges[0].count2=count1*power_
[all...]
/external/icu4c/i18n/
H A Ducol_wgt.cpp385 uint32_t count1, count2, power_1, power; local
389 /* calculate how to split the range between maxLength-1 (count1) and maxLength (count2) */
393 count1=ranges[0].count-count2;
397 printf("split the first range %ld:%ld\n", count1, count2);
399 if(count1<1) {
414 /* set the end of the first range according to count1 */
416 byte=getWeightByte(ranges[0].start, i)+count1-1;
419 * ranges[0].count and count1 may be >countBytes
438 ranges[0].count=count1;
441 ranges[0].count2=count1*power_
[all...]
/external/guava/src/com/google/common/collect/
H A DMultisets.java346 int count1 = multiset1.count(element);
347 return (count1 == 0) ? 0 : Math.min(count1, multiset2.count(element));
/external/qemu/
H A Dblock.c620 void *buf, int count1)
626 count = count1;
638 return count1;
660 return count1;
664 const void *buf, int count1)
670 count = count1;
684 return count1;
708 return count1;
619 bdrv_pread(BlockDriverState *bs, int64_t offset, void *buf, int count1) argument
663 bdrv_pwrite(BlockDriverState *bs, int64_t offset, const void *buf, int count1) argument
/external/chromium/third_party/icu/source/test/intltest/
H A Dapicoll.cpp1036 int32_t count1, count2; local
1041 const Locale* list = Collator::getAvailableLocales(count1);
1042 for (int32_t i = 0; i < count1; ++i) {
1050 if (count1 == 0 || list == NULL) {
1070 if (count1 != count2) {
1071 errln("getAvailableLocales(int&) returned %d and getAvailableLocales() returned %d", count1, count2);
1075 count1 = 0;
1081 count1++;
1083 if (count1 != count2) {
1084 errln("getAvailableLocales(3rd time) returned %d and getAvailableLocales(2nd time) returned %d", count1, count
[all...]
H A Dmsfmrgts.cpp763 int32_t count1 = 0; local
765 Formattable *newobjs = mf->parse(result, pp, count1);
H A Drbbitst.cpp1054 int count1, count2; local
1055 mutableDict->matches(originalText, originalWord->length(), lengths1.elems(), count1, originalWord->length(), values1.elems());
1058 if(values1[count1-1] != values2[count2-1]){
1060 counter, values1[count1-1], values2[count2-1]);
1122 int count1, count2; local
1123 mutableDict->matches(originalText, originalWord->length(), lengths1.elems(), count1, originalWord->length(), values1.elems());
1126 if(values1[count1-1] != values2[count2-1]){
1128 counter, values1[count1-1], values2[count2-1]);
H A Dcalregts.cpp1164 int32_t count1, count2, count3; local
1165 Calendar::getAvailableLocales(count1);
1169 count1, count2, count3
/external/icu4c/test/intltest/
H A Dapicoll.cpp1036 int32_t count1, count2; local
1041 const Locale* list = Collator::getAvailableLocales(count1);
1042 for (int32_t i = 0; i < count1; ++i) {
1050 if (count1 == 0 || list == NULL) {
1070 if (count1 != count2) {
1071 errln("getAvailableLocales(int&) returned %d and getAvailableLocales() returned %d", count1, count2);
1075 count1 = 0;
1081 count1++;
1083 if (count1 != count2) {
1084 errln("getAvailableLocales(3rd time) returned %d and getAvailableLocales(2nd time) returned %d", count1, count
[all...]
H A Dmsfmrgts.cpp764 int32_t count1 = 0; local
766 Formattable *newobjs = mf->parse(result, pp, count1);
H A Dcalregts.cpp1193 int32_t count1, count2, count3; local
1194 Calendar::getAvailableLocales(count1);
1198 count1, count2, count3
/external/chromium/third_party/icu/source/common/
H A Duhash.c881 int32_t count1, count2, pos, i; local
907 count1 = uhash_count(hash1);
909 if(count1!=count2){
914 for(i=0; i<count1; i++){
/external/icu4c/common/
H A Duhash.c882 int32_t count1, count2, pos, i; local
908 count1 = uhash_count(hash1);
910 if(count1!=count2){
915 for(i=0; i<count1; i++){
/external/freetype/src/base/
H A Dftstroke.c1611 FT_UInt count1, count2, num_points = 0; local
1617 &count1, &count2 );
1626 num_points = count1 + count3;
/external/chromium/third_party/icu/source/test/cintltst/
H A Dccapitst.c172 int32_t count1 = 0; local
176 count1++;
190 if (count1 != count2) {
/external/icu4c/test/cintltst/
H A Dccapitst.c178 int32_t count1 = 0; local
182 count1++;
196 if (count1 != count2) {

Completed in 248 milliseconds