Java 8 Collectors.toMap SortedMap

Question

I'm using Java 8 lambdas and want to use Collectors toMap to return a SortedMap. The best I can come up with is to call the following Collectors toMap method with a dummy mergeFunction and mapSupplier equal to TreeMap::new.

public static <T, K, U, M extends Map<K, U>>         Collector<T, ?, M> toMap(Function<? super T, ? extends K> keyMapper,                 Function<? super T, ? extends U> valueMapper,                 BinaryOperator<U> mergeFunction,                 Supplier<M> mapSupplier) {     BiConsumer<M, T> accumulator = (map, element) -> map.merge(keyMapper.apply(element),             valueMapper.apply(element), mergeFunction);     return new CollectorImpl<>(mapSupplier, accumulator, mapMerger(mergeFunction), CH_ID); } 

I don't want to pass in a merge function though, as I just want throwingMerger(), in the same way as the basic toMapimplementation as follows:

public static <T, K, U>         Collector<T, ?, Map<K, U>> toMap(Function<? super T, ? extends K> keyMapper,                 Function<? super T, ? extends U> valueMapper) {     return toMap(keyMapper, valueMapper, throwingMerger(), HashMap::new); } 

What would be the best practise method of using Collectors to return a SortedMap?

Answer 1

I don't think you can get much better than this:

.collect(Collectors.toMap(keyMapper, valueMapper,                         (v1,v2) ->{ throw new RuntimeException(String.format("Duplicate key for values %s and %s", v1, v2));},                         TreeMap::new)); 

where the throw lambda is the same as throwingMerger() but I can't directly call that since it's package private (you can of course always make your own static method for that like throwingMerger() is. )