Extend assoc-in to take multiple k-v pairs? about clj-fast

[bsless]

A heuristic is better than nothing.
Dropping this here for reference, it can be adapted for a solution: https://github.com/bsless/impedance

[bsless]

Your intuition here is correct, I've done something similar in the past which can be generalized to this. The idea is to build a trie then derive an execution model from it.
Good find :)

[yuhan0]

I guess there's also the assumption that individual keys are referentially transparent, and can actually be combined like so:

(inline/assoc-in {}
  [(rand) :x] :oh
  [(rand) :y] :no)

The above transform would change the behavior:

(let [m {}
      r (get m (rand))]
  (assoc m (rand)
    (-> r
      (assoc :x :oh)
      (assoc :y :no))))

unless we use a heuristic that only atomic keys (keywords/symbols/numbers/strings) can be tested for equality and combined safely.

[bsless]

@yuhan0 I opened a PR which should provide this feature, you're welcome to take a look