/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
private int charIndex;
private int boundaryIndex;
charIndex = i;
b.add(i);
}
}
try {
return super.clone();
} catch (Exception e) {
throw new RuntimeException("clone failed", e);
}
}
public int first() {
return changeIndices(0);
}
public int last() {
}
public int next(int n) {
if (n == 0) {
return current();
}
int newBoundary = boundaryIndex + n;
if (newBoundary < 0) {
first();
return DONE;
}
if (newBoundary > lastBoundary()) {
last();
return DONE;
}
return changeIndices(newBoundary);
}
public int next() {
if (boundaryIndex == lastBoundary()) {
return DONE;
}
}
public int previous() {
if (boundaryIndex == 0) {
return DONE;
}
}
for (int b = 0; b <= lastBoundary(); b++) {
int i = boundaries.get(b);
if (i > offset) {
return changeIndices(i, b);
}
}
return DONE;
}
for (int b = lastBoundary(); b >= 0; b--) {
int i = boundaries.get(b);
if (i < offset) {
return changeIndices(i, b);
}
}
return DONE;
}
// Call the default impelementation in BreakIterator
return super.isBoundary(offset);
}
public int current() {
return charIndex;
}
throw new UnsupportedOperationException();
}
throw new UnsupportedOperationException();
}
private int lastBoundary() {
}
return charIndex = newCharIndex;
}
try {
} catch (IndexOutOfBoundsException e) {
throw new IllegalArgumentException(e);
}
}
throw new IllegalArgumentException();
}
}
}