List tailMatch(Pattern currentPattern) { int max = 0; Pattern longestMatchingPattern = null; for (Pattern p : rules.keySet()) { if ((p.size() > 1) && p.get(0).equals(ANY)) { int r = currentPattern.getTailMatchLength(p); if (r > max) { max = r; longestMatchingPattern = p; } } } if (longestMatchingPattern != null) { return rules.get(longestMatchingPattern); } else { return null; } }
List tailMatch(Pattern currentPattern) { int max = 0; Pattern longestMatchingPattern = null; for (Pattern p : rules.keySet()) { if ((p.size() > 1) && p.get(0).equals(ANY)) { int r = currentPattern.getTailMatchLength(p); if (r > max) { max = r; longestMatchingPattern = p; } } } if (longestMatchingPattern != null) { return rules.get(longestMatchingPattern); } else { return null; } }
List tailMatch(Pattern currentPattern) { int max = 0; Pattern longestMatchingPattern = null; for (Pattern p : rules.keySet()) { if ((p.size() > 1) && p.get(0).equals("*")) { int r = currentPattern.getTailMatchLength(p); // System.out.println("tailMatch " +r); if (r > max) { // System.out.println("New longest tailMatch "+p); max = r; longestMatchingPattern = p; } } } if (longestMatchingPattern != null) { return rules.get(longestMatchingPattern); } else { return null; } }