当原始地图包含collection作为值时,如何创建反向地图?

时间:2019-02-15 07:17:57

标签: java java-8 java-stream

假设我的原始Map包含以下内容:

Map<String, Set<String>> original = Maps.newHashMap();
original.put("Scott", Sets.newHashSet("Apple", "Pear", "Banana");
original.put("Jack", Sets.newHashSet("Banana", "Apple", "Orange");

我想创建一个包含以下内容的反向Map

  "Apple":  ["Scott", "Jack"]
  "Pear":   ["Scott"]
  "Banana": ["Scott", "Jack"]
  "Orange": ["Jack"]

我知道可以用旧的方式(Java 8之前的版本)完成操作,但是如何使用Java Stream API实现相同的功能?

Map<String, Set<String>> reversed = original.entrySet().stream().map(x -> ????).collect(??)

here中也发布了类似的问题,但这仅适用于单值Map

2 个答案:

答案 0 :(得分:8)

您可以使用MapString分成键值对(每个键和值是单个flatMap),然后根据需要收集它们:

Map<String,Set<String>> rev =
    original.entrySet ()
            .stream ()
            .flatMap (e -> e.getValue ()
                            .stream ()
                            .map (v -> new SimpleEntry<String,String>(v,e.getKey ())))
            .collect(Collectors.groupingBy (Map.Entry::getKey,
                                            Collectors.mapping (Map.Entry::getValue, 
                                                                Collectors.toSet())));
System.out.println (rev);

输出:

{Apple=[Jack, Scott], Pear=[Scott], Orange=[Jack], Banana=[Jack, Scott]}

答案 1 :(得分:3)

更迫切但更简单的解决方案是使用forEach

Map<String, Set<String>> original,result; // initialised
original.forEach((key, value) -> value.forEach(v -> 
            result.computeIfAbsent(v, k -> new HashSet<>()).add(key)));