Lines Matching refs:length
68 if (args.length == 1) {
80 System.out.println("Read " + aChristmasCarol.length() + " bytes in " + PerformanceTest.time(x,y));
88 for (int j=0;j<deletePlan.length;++j) {
94 for (int k=20; k<=deletePlan.length; k+=20) {
95 System.out.println("Delete plan length: " + k);
114 for (int j=0;j<prependPlan.length;++j) {
119 for (int k=20; k<=prependPlan.length; k+=20) {
120 System.out.println("Prepend plan length: " + k);
141 for (int j=0;j<appendPlan.length;++j) {
147 for (int k=20; k<=appendPlan.length; k+=20) {
148 System.out.println("Append plan length: " + k);
168 for (int j=0;j<insertPlan.length;++j) {
171 insertPlan[j][2] = PerformanceTest.random.nextInt(PerformanceTest.lenCC - insertPlan[j][1]); //clip length
176 for (int k=insertPlan.length; k<=insertPlan.length; k+=20) {
177 System.out.println("Insert plan length: " + k);
199 for (int j=0;j<insertPlan2.length;++j) {
202 insertPlan2[j][2] = PerformanceTest.random.nextInt(PerformanceTest.lenBF - insertPlan2[j][1]); //clip length
388 System.out.printf("[String.find] indexOf needle length %d found at index %d in % ,18d ns.\n", toFind.length(), loc, (y-x));
395 StringBuffer b = new StringBuffer(aChristmasCarol.length); b.append(aChristmasCarol);
399 System.out.printf("[StringBuffer.find] indexOf needle length %d found at index %d in % ,18d ns.\n", toFind.length(), loc, (y-x));
410 System.out.printf("[Rope.find] indexOf needle length %d found at index %d in % ,18d ns.\n", toFind.length(), loc, (y-x));
420 System.out.printf("[String.find] indexOf needle length %d found at index %d in % ,18d ns.\n", toFind.length(), loc, (y-x));
430 System.out.printf("[StringBuffer.find] indexOf needle length %d found at index %d in % ,18d ns.\n", toFind.length(), loc, (y-x));
440 System.out.printf("[Rope.find] indexOf needle length %d found at index %d in % ,18d ns.\n", toFind.length(), loc, (y-x));
447 Writer out = new StringWriter(complexRope.length());
462 Writer out = new StringWriter(complexRope.length());
508 final int length = appendPlan[j][1];
509 result = result.append(result.subSequence(offset, offset+length));
512 System.out.printf("[Rope] Executed append plan in % ,18d ns. Result has length: %d. Rope Depth: %d\n", (y-x), result.length(), ((AbstractRope)result).depth());
522 for (int j=0; j<prependPlan.length; ++j) {
524 final int length = prependPlan[j][1];
525 result = result.delete(offset, offset + length);
528 System.out.printf("[Rope] Executed delete plan in % ,18d ns. Result has length: %d. Rope Depth: %d\n", (y-x), result.length(), ((AbstractRope)result).depth());
541 final int length = insertPlan[j][2];
542 result = result.insert(into, result.subSequence(offset, offset+length));
545 System.out.printf("[Rope] Executed insert plan in % ,18d ns. Result has length: %d. Rope Depth: %d\n", (y-x), result.length(), ((AbstractRope)result).depth());
559 final int length = insertPlan[j][2];
560 result = result.insert(into, result.subtext(offset, offset+length));
563 System.out.printf("[Text] Executed insert plan in % ,18d ns. Result has length: %d.\n", (y-x), result.length());
574 for (int j=0; j<insertPlan.length; ++j) {
577 final int length = insertPlan[j][2];
578 result = result.insert(into, bensAuto.subSequence(offset, offset+length));
581 System.out.printf("[Rope] Executed insert plan in % ,18d ns. Result has length: %d. Rope Depth: %d\n", (y-x), result.length(), ((AbstractRope)result).depth());
593 final int length = prependPlan[j][1];
594 result = result.subSequence(offset, offset+length).append(result);
597 System.out.printf("[Rope] Executed prepend plan in % ,18d ns. Result has length: %d. Rope Depth: %d\n", (y-x), result.length(), ((AbstractRope)result).depth());
609 final int length = prependPlan[j][1];
610 result = result.subtext(offset, offset+length).concat(result);
613 System.out.printf("[Text] Executed prepend plan in % ,18d ns. Result has length: %d.\n", (y-x), result.length());
623 for (int j=0; j<r.length(); ++j) result+=r.charAt(j);
650 for (int j=0; j<result.length(); ++j) r+=result.charAt(j);
663 for (int j=0; j<result.length(); ++j) r+=result.charAt(j);
690 final int length = appendPlan[j][1];
691 result = result.concat(result.substring(offset, offset + length));
694 System.out.printf("[String] Executed append plan in % ,18d ns. Result has length: %d\n", (y-x), result.length());
706 final int length = appendPlan[j][1];
707 result.append(result.subSequence(offset, offset+length));
710 System.out.printf("[StringBuffer] Executed append plan in % ,18d ns. Result has length: %d\n", (y-x), result.length());
720 for (int j=0; j<prependPlan.length; ++j) {
722 final int length = prependPlan[j][1];
723 result.delete(offset, offset+length);
726 System.out.printf("[StringBuffer] Executed delete plan in % ,18d ns. Result has length: %d\n", (y-x), result.length());
732 final StringBuffer result=new StringBuffer(aChristmasCarol.length); result.append(aChristmasCarol);
739 final int length = insertPlan[j][2];
740 result.insert(into, result.subSequence(offset, offset+length));
743 System.out.printf("[StringBuffer] Executed insert plan in % ,18d ns. Result has length: %d\n", (y-x), result.length());
754 for (int j=0; j<insertPlan.length; ++j) {
757 final int length = insertPlan[j][2];
758 result.insert(into, bensAuto.subSequence(offset, offset+length));
761 System.out.printf("[StringBuffer] Executed insert plan in % ,18d ns. Result has length: %d\n", (y-x), result.length());
773 final int length = prependPlan[j][1];
774 result.insert(0, result.subSequence(offset, offset+length));
777 System.out.printf("[StringBuffer] Executed prepend plan in % ,18d ns. Result has length: %d\n", (y-x), result.length());
783 final StringBuffer b=new StringBuffer(aChristmasCarol.length); b.append(aChristmasCarol);
787 for (int j=0; j<b.length(); ++j) result+=b.charAt(j);
802 for (int j=0; j<result.length(); ++j) r+=result.charAt(j);
814 for (int j=0; j<prependPlan.length; ++j) {
816 final int length = prependPlan[j][1];
817 result = result.substring(0, offset).concat(result.substring(offset+length));
820 System.out.printf("[String] Executed delete plan in % ,18d ns. Result has length: %d\n", (y-x), result.length());
833 final int length = insertPlan[j][2];
834 result = result.substring(0, into).concat(result.substring(offset, offset + length)).concat(result.substring(into));
838 System.out.printf("[String] Executed insert plan in % ,18d ns. Result has length: %d\n", (y-x), result.length());
849 for (int j=0; j<insertPlan.length; ++j) {
852 final int length = insertPlan[j][2];
853 result = result.substring(0, into).concat(bensAuto.substring(offset, offset + length)).concat(result.substring(into));
856 System.out.printf("[String] Executed insert plan in % ,18d ns. Result has length: %d\n", (y-x), result.length());
868 final int length = prependPlan[j][1];
869 result = result.substring(offset, offset + length).concat(result);
872 System.out.printf("[String] Executed prepend plan in % ,18d ns. Result has length: %d\n", (y-x), result.length());
882 for (int j=0; j<s.length(); ++j) result+=s.charAt(j);
896 for (int j=0; j<result.length(); ++j) r+=result.charAt(j);
934 StringBuffer buffer = new StringBuffer(aChristmasCarol.length); buffer.append(aChristmasCarol);
1071 if (stats.length < 3)
1075 double median = ((stats.length & 1) == 1 ? stats[stats.length >> 1]: (stats[stats.length >> 1] + stats[1 + (stats.length >> 1)]) / 2);
1077 for (int j=1;j<stats.length-1;++j) {
1080 average /= stats.length - 2;