A modern programming language that makes developers happier.

kotlinlang

If I am doing an awful lot of of `Map&lt;String, T&gt; + Map&lt;String, T&gt;` as well as `Map&lt;String, T&gt;.distinct()` and this is showing up during profiling as a hotspot, is there some obvious optimization I can do that lets me keep calls to `plus` and `distinct` but makes it go faster? All involved classes are kotlin data classes so implement that hashCode

What exactly is `Map&lt;String, T&gt;.distinct()` ?
And can specify your goal a bit more? For example, what other operations are you doing on those maps?

Best to describe what you are trying to accomplish, as there are many many things such structure &amp; operations can represent, and that can change the optimization significantly

Sorry the Map part was on the values so basically just `List&lt;T&gt;.distinct()`

as in <https://kotlinlang.org/api/latest/jvm/stdlib/kotlin.collections/distinct.html|https://kotlinlang.org/api/latest/jvm/stdlib/kotlin.collections/distinct.html>

so its Map plus Map as one operation and distinct on Lists as another one

this is the point where you can evaluate whether creating an index (e.q. primitive array) is more efficient than calling distinct() which is just linkedHashSet().toList().

You could also replace your lists by sets, so no conversion needs to take place at all