| /external/stlport/test/unit/ |
| count_test.cpp | 16 CPPUNIT_TEST(count1);
22 void count1();
44 void CountTest::count1() function in class:CountTest
|
| /ndk/sources/android/stlport/test/unit/ |
| count_test.cpp | 16 CPPUNIT_TEST(count1);
22 void count1();
44 void CountTest::count1() function in class:CountTest
|
| /libcore/luni/src/main/java/java/util/ |
| ComparableTimSort.java | 641 int count1 = 0; // Number of times in a row that first run won
653 count1 = 0;
658 count1++;
663 } while ((count1 | count2) < minGallop);
672 count1 = gallopRight((Comparable) a[cursor2], tmp, cursor1, len1, 0);
673 if (count1 != 0) {
674 System.arraycopy(tmp, cursor1, a, dest, count1);
675 dest += count1;
676 cursor1 += count1;
677 len1 -= count1;
[all...] |
| TimSort.java | 674 int count1 = 0; // Number of times in a row that first run won
686 count1 = 0;
691 count1++;
696 } while ((count1 | count2) < minGallop);
705 count1 = gallopRight(a[cursor2], tmp, cursor1, len1, 0, c);
706 if (count1 != 0) {
707 System.arraycopy(tmp, cursor1, a, dest, count1);
708 dest += count1;
709 cursor1 += count1;
710 len1 -= count1;
[all...] |
| /packages/apps/Contacts/src/com/android/contacts/ |
| TextHighlightingAnimation.java | 94 int count1 = buffer1.sizeCopied; local
98 while (count1 > 0 && count2 > 0 && string1[count1 - 1] == string2[count2 - 1]) {
99 count1--;
104 for (int i = 0; i < count1; i++) {
105 if (i + size > count1) {
106 size = count1 - i;
|
| /external/webkit/SunSpider/resources/ |
| sunspider-compare-results.js | 28 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/ |
| pshrec.c | 382 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 + count2 ))
1052 FT_UInt count1 = dim[0].hints.num_hints; local
[all...] |
| pshglob.c | 476 FT_UInt count1, count2; local
493 count1 = normal->count;
495 for ( ; count1 > 0; count1--, zone1++ )
|
| /dalvik/tests/055-enum-performance/src/ |
| Main.java | 16 int count1 = test1(500); local
26 System.out.println("test1: performed " + count1 + " iterations");
30 double msec1 = (time1 - time0) / (double) count1 / 1000000;
|
| /external/chromium/third_party/icu/source/i18n/ |
| ucol_wgt.c | 385 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_1
[all...] |
| /external/icu4c/i18n/ |
| ucol_wgt.cpp | 385 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_1
[all...] |
| /external/guava/src/com/google/common/collect/ |
| Multisets.java | 346 int count1 = multiset1.count(element);
347 return (count1 == 0) ? 0 : Math.min(count1, multiset2.count(element));
|
| /system/wlan/ti/sta_dk_4_0_4_32/common/src/core/data_ctrl/Ctrl/4X/ |
| fourX.h | 87 UINT32 count1; member in struct:__anon16512
|
| fourX.c | 669 pFourX->counters.count1++;
836 WLAN_OS_REPORT(("No Free Msdu in ACX = %d\n", pFourX->counters.count1));
|
| /external/qemu/ |
| block.c | 620 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;
[all...] |
| /bionic/libc/netbsd/resolv/ |
| res_cache.c | 929 int count1, count2; local
946 count1 = _dnsPacket_readInt16(pack1);
948 if (count1 != count2 || count1 < 0) {
958 for ( ; count1 > 0; count1-- ) {
[all...] |
| /external/chromium/third_party/icu/source/test/intltest/ |
| apicoll.cpp | 1036 int32_t count1, count2; local
[all...] |
| msfmrgts.cpp | 763 int32_t count1 = 0; local
765 Formattable *newobjs = mf->parse(result, pp, count1);
[all...] |
| rbbitst.cpp | 1054 int count1, count2; local
1122 int count1, count2; local
[all...] |
| /external/icu4c/test/intltest/ |
| apicoll.cpp | 1036 int32_t count1, count2; local
[all...] |
| /frameworks/base/media/libstagefright/codecs/amrwbenc/src/ |
| wb_vad.c | 132 * (data[count1 - count2]) is stored to (*sub_level)
141 /* (count2 - count1) samples */
142 Word16 count1, /* i : number of samples to be counted */
153 for (i = count1; i < count2; i++)
161 for (i = 0; i < count1; i++)
|
| /external/chromium/third_party/icu/source/common/ |
| uhash.c | 881 int32_t count1, count2, pos, i; local
907 count1 = uhash_count(hash1);
909 if(count1!=count2){
914 for(i=0; i<count1; i++){
[all...] |
| /external/icu4c/common/ |
| uhash.c | 882 int32_t count1, count2, pos, i; local
908 count1 = uhash_count(hash1);
910 if(count1!=count2){
915 for(i=0; i<count1; i++){
[all...] |
| /frameworks/base/media/libstagefright/codecs/amrnb/common/src/ |
| vad1.cpp | 442 count1 -- Word16 -- number of samples to be counted
450 last (count2 - count1) samples.
510 /* (count2 - count1) samples */
511 Word16 count1, /* i : number of samples to be counted */
526 for (i = count1; i < count2; i++)
534 for (i = 0; i < count1; i++)
[all...] |
| /frameworks/base/media/libstagefright/codecs/m4v_h263/enc/src/ |
| motion_comp.cpp | 1909 Int i, j, count = 0, count1 = 0; local
[all...] |
