hara.data.deque — hara/data.deque 3.0.11

concat clj

(concat)

(concat v1)

(concat v1 v2)

(concat v1 v2 v3)

(concat v1 v2 v3 v4)

(concat v1 v2 v3 v4 & vn)

Concatenates the given vectors in logarithmic time.

conj-both clj

(conj-both l deque r)

appends elements on either side

(conj-both 1 [2] 3) => [1 2 3]

conj-left clj

(conj-left v & more)

appends elements on the left

(conj-left [4] 3 2 1) => [1 2 3 4]

conj-right clj

(conj-right v & more)

appends elements on the right

(conj-right [1] 2 3 4) => [1 2 3 4]

create clj

(create)

(create a)

(create a b)

(create a b c)

(create a b c d)

(create a b c d e)

(create a b c d e f)

(create a b c d e f & args)

Creates a new vector containing the args.

peek-left clj

(peek-left v)

peeks at the first element on the left

(peek-left [1 2 3 4]) => 1

peek-right clj

(peek-right coll)

For a list or queue, same as first, for a vector, same as, but much more efficient than, last. If the collection is empty, returns nil.

pop-left clj

(pop-left v)

pops an element from the left

(pop-left [1 2 3 4]) => [2 3 4]

pop-right clj

(pop-right coll)

For a list or queue, returns a new list/queue without the first item, for a vector, returns a new vector without the last item. If the collection is empty, throws an exception. Note - not the same as next/butlast.

update-left clj

(update-left deque f & args)

updates the leftmost element

(update-left [1 2 3] dec) => [0 2 3]

update-right clj

(update-right deque f & args)

updates the rightmost element

(update-right [1 2 3] inc) => [1 2 4]