Couples of consecutive elements in a coll

Question

What's the most idiomatic way of writing a function that, given a coll (1 2 3 4 5)

Returns

((1 2) (2 3) (3 4) (4 5))

i.e. consecutive couples of elements in a collection.

My naive solution would be:

(map (fn [a b] [a b]) a (rest a))

Answer 1

partition has an arity with a step argment that does this.

(partition 2 1 [1 2 3 4 5]) ;=> ((1 2) (2 3) (3 4) (4 5))