// the original starting and ending position. And initialize the
// cache iteration position to the first entry.
- // System.out.printf("foundBreakCount = %d\n", foundBreakCount);
+ // System.out.printf("foundBreakCount = %d%n", foundBreakCount);
if (foundBreakCount > 0) {
assert(foundBreakCount == fBreaks.size());
if (startPos < fBreaks.elementAt(0)) {
}
void dumpCache() {
- System.out.printf("fTextIdx:%d fBufIdx:%d\n", fTextIdx, fBufIdx);
+ System.out.printf("fTextIdx:%d fBufIdx:%d%n", fTextIdx, fBufIdx);
for (int i=fStartBufIdx; ; i=modChunkSize(i+1)) {
- System.out.printf("%d %d\n", i, fBoundaries[i]);
+ System.out.printf("%d %d%n", i, fBoundaries[i]);
if (i == fEndBufIdx) {
break;
}