Here's my take:
(defn partition' [coll]
(let [coll' (partition-by keyword? coll)]
(reduce merge {}
(map vector (flatten (take-nth 2 coll')) (take-nth 2 (rest
coll'))
Note that this breaks if some keys point to empty sets
On Wednesday, February 20, 2013 6:50:42 AM UTC-5, St
I can't find the reference now, but either in a screencast or a discussion
I read it was mentioned that if you have a single thing that performs
side-effects, you can perform this function last in the transaction without
worrying about any issues. The reasoning here is that if anything before it
