Or even shorter, but maybe not as fast because it flattens the given list, then pairs it up again. Thus it also assumes the resulting list should consist ENTIRELY of pairs and singletons, not just the last or penultimate element:
(fn [l x] (partition-all 2 (concat (flatten l) [x]))) On Jun 24, 2:54 pm, Tyler Perkins <thinks.outs...@gmail.com> wrote: > I discovered partition-all and came up with this function: > (fn [l x] (concat (butlast l) (partition-all 2 (concat (last l) > [x])))) > > user> ((fn [l x] (concat (butlast l) (partition-all 2 (concat (last l) > [x])))) > '() > 10) > ((10)) > user> ((fn [l x] (concat (butlast l) (partition-all 2 (concat (last l) > [x])))) > '(( 1 2 ) ( 20 30) (40)) > 50) > ((1 2) (20 30) (40 50)) > user> ((fn [l x] (concat (butlast l) (partition-all 2 (concat (last l) > [x])))) > '(( 1 2 ) ( 20 30) (40 50)) > 60) > ((1 2) (20 30) (40 50) (60)) -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en
