TreeSet<UnicodeSet> sorted1 = new TreeSet<UnicodeSet>(new Comparator<UnicodeSet>(){
@Override
- public int compare(UnicodeSet o1, UnicodeSet o2) {
+ public int compare(UnicodeSet o1, UnicodeSet o2) {
// TODO Auto-generated method stub
return o1.compareTo(o2, ComparisonStyle.LONGER_FIRST);
}});
sorted1 = new TreeSet<UnicodeSet>(new Comparator<UnicodeSet>(){
@Override
- public int compare(UnicodeSet o1, UnicodeSet o2) {
+ public int compare(UnicodeSet o1, UnicodeSet o2) {
// TODO Auto-generated method stub
return o1.compareTo(o2, ComparisonStyle.LEXICOGRAPHIC);
}});
* @see com.ibm.icu.text.SymbolTable#lookup(java.lang.String)
*/
@Override
- public char[] lookup(String s) {
+ public char[] lookup(String s) {
logln("TokenSymbolTable: lookup \"" + s + "\" => \"" +
new String((char[]) contents.get(s)) + "\"");
return (char[])contents.get(s);
* @see com.ibm.icu.text.SymbolTable#lookupMatcher(int)
*/
@Override
- public UnicodeMatcher lookupMatcher(int ch) {
+ public UnicodeMatcher lookupMatcher(int ch) {
return null;
}
java.text.ParsePosition, int)
*/
@Override
- public String parseReference(String text, ParsePosition pos, int
+ public String parseReference(String text, ParsePosition pos, int
limit) {
int cp;
int start = pos.getIndex();
/**
* Check that there are no gaps, when we alternate spanning. That is, there
* should only be a zero length span at the very start.
- * @param longString
- * @param us
- * @param simple
*/
private int checkSpan(String longString, UnicodeSet us, SpanCondition spanCondition) {
int start = 0;