Apache
/
commons-lang
mirror of https://github.com/apache/commons-lang.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

ws 

git-svn-id: https://svn.apache.org/repos/asf/commons/proper/lang/trunk@1091096 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
Matthew Jason Benson 2011-04-11 15:07:29 +00:00
parent 77c0ffce3c
commit a283547d5c
1 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
src/main/java/org/apache/commons/lang3/text/translate/LookupTranslator.java
View File

@ -45,10 +45,10 @@ public class LookupTranslator extends CharSequenceTranslator {
for (CharSequence[] seq : lookup) { for (CharSequence[] seq : lookup) {
this.lookupMap.put(seq[0], seq[1]); this.lookupMap.put(seq[0], seq[1]);
int sz = seq[0].length(); int sz = seq[0].length();
if(sz < _shortest) { if (sz < _shortest) {
_shortest = sz; _shortest = sz;
} }
if(sz > _longest) { if (sz > _longest) {
_longest = sz; _longest = sz;
} }
} }
@ -63,14 +63,14 @@ public class LookupTranslator extends CharSequenceTranslator {
@Override @Override
public int translate(CharSequence input, int index, Writer out) throws IOException { public int translate(CharSequence input, int index, Writer out) throws IOException {
int max = longest; int max = longest;
if(index + longest > input.length()) { if (index + longest > input.length()) {
max = input.length() - index; max = input.length() - index;
} }
// descend so as to get a greedy algorithm // descend so as to get a greedy algorithm
for(int i=max; i >= shortest; i--) { for (int i = max; i >= shortest; i--) {
CharSequence subSeq = input.subSequence(index, index + i); CharSequence subSeq = input.subSequence(index, index + i);
CharSequence result = lookupMap.get(subSeq); CharSequence result = lookupMap.get(subSeq);
if(result != null) { if (result != null) {
out.write(result.toString()); out.write(result.toString());
return i; return i;
} }