tiara.data — org.clojars.quoll/tiara 0.3.2

Divergent data structures

EMPTY_MAP clj/s

EMPTY_SET clj/s

indirect clj

(indirect index entry-vector k)

This get operation is used in multiple places, and can be inlined. Possibly redundant with (indirect-nd index entry-vector k nil)

indirect-nf clj

(indirect-nf index entry-vector k not-found)

This alternative get operation is used in multiple places, and can be inlined.

magic clj/s

ordered-map clj/s

(ordered-map)

(ordered-map & keyvals)

Creates a map object that remembers the insertion order, similarly to a java.util.LinkedHashMap

ordered-set clj/s

(ordered-set)

(ordered-set & s)

Creates a set object that remembers the insertion order, similarly to a java.util.LinkedHashSet

oset clj/s

(oset s)

Convenience function to create an ordered set from a seq

set-magic clj/s

transiable-subvec clj

(transiable-subvec v start end)

Get a subvec into a vector that can be made transient, skipping some of the steps of instance checking that the usual API imposes.

transient-ordered-set clj/s

(transient-ordered-set os)

vreverse clj/s

(vreverse v)

Reverses a vector into a vector. Lists are reversed as usual.