You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
120 lines
2.6 KiB
120 lines
2.6 KiB
/*
|
|
* Copyright (c) 2006, Oracle and/or its affiliates. All rights reserved.
|
|
* ORACLE PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
|
|
*
|
|
*
|
|
*
|
|
*
|
|
*
|
|
*
|
|
*
|
|
*
|
|
*
|
|
*
|
|
*
|
|
*
|
|
*
|
|
*
|
|
*
|
|
*
|
|
*
|
|
*
|
|
*
|
|
*
|
|
*/
|
|
|
|
package javax.swing.text;
|
|
|
|
import java.text.BreakIterator;
|
|
import java.text.CharacterIterator;
|
|
import java.text.StringCharacterIterator;
|
|
import java.util.Arrays;
|
|
|
|
/**
|
|
* A simple whitespace-based BreakIterator implementation.
|
|
*
|
|
* @author Sergey Groznyh
|
|
*/
|
|
class WhitespaceBasedBreakIterator extends BreakIterator {
|
|
private char[] text = new char[0];
|
|
private int[] breaks = new int[] { 0 } ;
|
|
private int pos = 0;
|
|
|
|
/**
|
|
* Calculate break positions eagerly parallel to reading text.
|
|
*/
|
|
public void setText(CharacterIterator ci) {
|
|
int begin = ci.getBeginIndex();
|
|
text = new char[ci.getEndIndex() - begin];
|
|
int[] breaks0 = new int[text.length + 1];
|
|
int brIx = 0;
|
|
breaks0[brIx++] = begin;
|
|
|
|
int charIx = 0;
|
|
boolean inWs = false;
|
|
for (char c = ci.first(); c != CharacterIterator.DONE; c = ci.next()) {
|
|
text[charIx] = c;
|
|
boolean ws = Character.isWhitespace(c);
|
|
if (inWs && !ws) {
|
|
breaks0[brIx++] = charIx + begin;
|
|
}
|
|
inWs = ws;
|
|
charIx++;
|
|
}
|
|
if (text.length > 0) {
|
|
breaks0[brIx++] = text.length + begin;
|
|
}
|
|
System.arraycopy(breaks0, 0, breaks = new int[brIx], 0, brIx);
|
|
}
|
|
|
|
public CharacterIterator getText() {
|
|
return new StringCharacterIterator(new String(text));
|
|
}
|
|
|
|
public int first() {
|
|
return breaks[pos = 0];
|
|
}
|
|
|
|
public int last() {
|
|
return breaks[pos = breaks.length - 1];
|
|
}
|
|
|
|
public int current() {
|
|
return breaks[pos];
|
|
}
|
|
|
|
public int next() {
|
|
return (pos == breaks.length - 1 ? DONE : breaks[++pos]);
|
|
}
|
|
|
|
public int previous() {
|
|
return (pos == 0 ? DONE : breaks[--pos]);
|
|
}
|
|
|
|
public int next(int n) {
|
|
return checkhit(pos + n);
|
|
}
|
|
|
|
public int following(int n) {
|
|
return adjacent(n, 1);
|
|
}
|
|
|
|
public int preceding(int n) {
|
|
return adjacent(n, -1);
|
|
}
|
|
|
|
private int checkhit(int hit) {
|
|
if ((hit < 0) || (hit >= breaks.length)) {
|
|
return DONE;
|
|
} else {
|
|
return breaks[pos = hit];
|
|
}
|
|
}
|
|
|
|
private int adjacent(int n, int bias) {
|
|
int hit = Arrays.binarySearch(breaks, n);
|
|
int offset = (hit < 0 ? (bias < 0 ? -1 : -2) : 0);
|
|
return checkhit(Math.abs(hit) + bias + offset);
|
|
}
|
|
}
|