Java 8 Lambda (grouping and reducing in a single step)

Question

Say I have a List of Pair objects,

List<Pair<A,B>> listOfPairs = //some list of pairs ;

I would like to group this list into a Map<A,Set<B>>.

Currently, I can do this in two steps. The first step groups by A, and returns a Map<A,Set<Pair<A,B>> as follows:

   Map<A,Set<Pair<A,B>> intermediateStep =   listOfPairs.stream().collect(Collectors.groupingBy((Pair::getLeft), Collectors.toSet()));

I then stream the entryset of the map above and collect them into the desired end result, mainly by mapping each Pair object to its B value, and collecting them to a set:

 Map<A, Set<B>> finalResult= intermediateStep.entrySet().stream().collect(Collectors.toMap(e -> e.getKey(), e -> e.getValue().stream().map(Pair::getRight).collect(Collectors.toSet())));

Is there a better way to achieve the desired result, perhaps in one step? In other words, the intermediate step mentioned above groups by A, but the right side of the grouping returns the entire Pair object. I'd like to group by A and point A to the set of its associated Bs in one step.

(I know that just because I could do it in one step, doesn't mean I should, because readability might suffer, but I'm curious.)

Thanks!

Ousmane D. · Accepted Answer · 2018-01-26 16:33:43Z

15

You can simplify the code by passing a mapping collector into the groupingBy collector like this:

Map<A, Set<B>> collect = 
       listOfPairs.stream()
                  .collect(Collectors.groupingBy(Pair::getLeft, 
                                Collectors.mapping(Pair::getRight,
                                       Collectors.toSet())));

answered Jan 26, 2018 at 16:33

Ousmane D.

56.6k8 gold badges101 silver badges134 bronze badges

Sign up to request clarification or add additional context in comments.

Comments

fps · Accepted Answer · 2018-01-26 23:50:30Z

2

You can do it using Map.computeIfAbsent:

Map<A, Set<B>> finalResult = new HashMap<>();
listOfPairs.forEach(pair -> finalResult.computeIfAbsent(
        pair.getLeft(), 
        k -> new HashSet<>())
    .add(pair.getRight()));

If you want to preserve insertion order you can use LinkedHashMap and LinkedHashSet instead of HashMap and HashSet, respectively.

answered Jan 26, 2018 at 23:50

fps

34.5k8 gold badges63 silver badges116 bronze badges

Collectives™ on Stack Overflow

Java 8 Lambda (grouping and reducing in a single step)

2 Answers 2

Comments

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

2 Answers 2

Comments

Comments

Your Answer

Sign up or log in

Post as a guest

Related