Faster processing of collection literals

[borkdude]

If we get {:a (+ 1 2 x)} maybe it would be faster to emit a function (fn [ctx] (hash-map :a (eval ctx '(+ 1 2 x)))) than another map from the analyzer?

This in turn can be unrolled like the other calls.

[borkdude]

First experiment in faster-maps branch (tests fail) using return-call:

$ tmp/master "(time (dotimes [i 1000000] {:i i :j i}))"
"Elapsed time: 1661.457229 msecs"

$ ./sci "(time (dotimes [i 1000000] {:i i :j i}))"
"Elapsed time: 796.002494 msecs"

[borkdude]

$ ./sci "(time (dotimes [i 1000000] [i (+ 1 2 i)]))"
"Elapsed time: 681.592362 msecs"
$ tmp/master "(time (dotimes [i 1000000] [i (+ 1 2 i)]))"
"Elapsed time: 1426.597451 msecs"

[borkdude]

./bb '(time (dotimes [i 1000000] ^{:a 1} [i (+ 1 2 3 i)]))'
"Elapsed time: 751.102041 msecs"
/usr/local/bin/bb '(time (dotimes [i 1000000] ^{:a 1} [i (+ 1 2 3 i)]))'
"Elapsed time: 1552.392127 msecs"

/usr/local/bin/bb '(time (dotimes [i 1000000] ^{:a i} [i (+ 1 2 3 i)]))'
"Elapsed time: 2508.376464 msecs"
./bb '(time (dotimes [i 1000000] ^{:a i} [i (+ 1 2 3 i)]))'
"Elapsed time: 836.875561 msecs"