Ben Sless

Regarding instrumenting specific sexprs, without a reader macro to pinpoint interesting locations, it would be hard. Slowing down functions inside vars is easy and gets you 90% of the way...

Thinking about this and #9 , what do you think will be the effects of missed branch predictions on this code? Can we engineer a test case where branch prediction...

I ran the following interesting test: ```clojure (defn foo [k] (fast-case k :a 0 :b 1 :c 2 :d 3 :e 4 :f 5 :g 6 :h 7 :i 9...

I wander how critical it actually is. While identity case checks are 2x faster we're still talking about 4 vs 8 ns in the worst case scenario, not to mention...

Is there a need to introduce the binding to `ge` and type hint it as an Object? I fail to see the ratilnale behind it. Am I missing anything?

Another case I came across [here](https://github.com/oakes/odoyle-rules/issues/7) is fast hash calculations for records If you close the extmap you can unroll the hash calculations

Seems reasonable. Easiest would just be to just use Java records but that's some way off. Implementing the hashing correctly seems to be the hardest part imo. Just hash it...

I think the more unpleasant part of it would be implementing the hashing of MapEntry which extends APersistentVector It needs to be done only once, but it would be slightly...

Interesting. I wonder if it could be generalized to `reduce`?

>Are there any performance improvements for the same cases possible in cljs I have no idea. Are you interested in running the benchmarks on cljs? I've only used Clojure until...