protected void findLinearMatches(FormattedString formattedString, FormattedString toBeFormattedString, List<Mapping> mappings, List<Region> remainingRegions) { int i1 = 0; int i2 = 0; while (i1 < formattedString.length() && i2 < toBeFormattedString.length()) { int match = countOverlappingChars(formattedString, toBeFormattedString, i1, i2); if (match > 0) { mappings.add(new Mapping(formattedString, toBeFormattedString, i1, i2, match)); i1 += match; i2 += match; } if (i1 >= formattedString.length() || i2 >= toBeFormattedString.length()) return; int[] next = findNextOverlappingChar(formattedString, toBeFormattedString, i1, i2); if (next == null) { remainingRegions.add(new Region(i2, toBeFormattedString.length() - i2)); return; } remainingRegions.add(new Region(i2, next[1])); i1 += next[0]; i2 += next[1]; } }
protected void findLinearMatches(FormattedString formattedString, FormattedString toBeFormattedString, List<Mapping> mappings, List<Region> remainingRegions) { int i1 = 0; int i2 = 0; while (i1 < formattedString.length() && i2 < toBeFormattedString.length()) { int match = countOverlappingChars(formattedString, toBeFormattedString, i1, i2); if (match > 0) { mappings.add(new Mapping(formattedString, toBeFormattedString, i1, i2, match)); i1 += match; i2 += match; } if (i1 >= formattedString.length() || i2 >= toBeFormattedString.length()) return; int[] next = findNextOverlappingChar(formattedString, toBeFormattedString, i1, i2); if (next == null) { remainingRegions.add(new Region(i2, toBeFormattedString.length() - i2)); return; } remainingRegions.add(new Region(i2, next[1])); i1 += next[0]; i2 += next[1]; } }