Java流和按字符串Levenshtein距离过滤

Question

I'm trying to figure out if there is an elegant way of doing the following using Java streams:

1. take a list of Pojos where one of the fields is a String (eg surname)
2. take a String that you want to search for (eg surnameTypedIn)
3. find the Pojo in the list with the smallest Levenshtein distance (I'm using the Apache Commons StringUtils.getLevenshteinDistance)
4. return the whole Pojo, not just the surname or the distance

So far the only way I've been able to do it is to create an intermediate map at each level, which works but feels very dirty. Is there an accepted way to do this, eg by implementing a custom Collector or something like that?

Answer 1

Just create a Comparator<Pojo> :

Comparator<Pojo> comparator =
    Comparator.comparingInt(
        p -> StringUtils.getLevenshteinDistance(p.surname(), surnameTypedIn)

Then use the Stream.min method:

Optional<Pojo> minPojo = listOfPojos.stream().min(comparator);

(You can inline the Comparator.comparingInt in the Stream.min call if you want; I just separated them for readability).

Or, without streams:

Pojo minPojo = Collections.min(listOfPojos, comparator);

Note that this way will throw a NoSuchElementException if listOfPojos is empty.