Searched refs:MatchClassification (Results 1 – 1 of 1) sorted by relevance
660 … Map<MatchClassification, Integer> potentialMatches = new EnumMap<>(MatchClassification.class); in findIndexOfCorrespondingNodeTextElement()683 potentialMatches.putIfAbsent(MatchClassification.ALL, i); in findIndexOfCorrespondingNodeTextElement()685 potentialMatches.putIfAbsent(MatchClassification.PREVIOUS_AND_SAME, i); in findIndexOfCorrespondingNodeTextElement()687 potentialMatches.putIfAbsent(MatchClassification.NEXT_AND_SAME, i); in findIndexOfCorrespondingNodeTextElement()689 potentialMatches.putIfAbsent(MatchClassification.SAME_ONLY, i); in findIndexOfCorrespondingNodeTextElement()692 potentialMatches.putIfAbsent(MatchClassification.ALMOST, i); in findIndexOfCorrespondingNodeTextElement()698 Optional<MatchClassification> bestMatchKey = potentialMatches.keySet().stream() in findIndexOfCorrespondingNodeTextElement()699 .min(Comparator.comparing(MatchClassification::getPriority)); in findIndexOfCorrespondingNodeTextElement()711 private enum MatchClassification { enum in Difference715 MatchClassification(int priority) { in MatchClassification() method in Difference.MatchClassification