Divergent data structures
Divergent data structures
(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)
This get operation is used in multiple places, and can be inlined. Possibly redundant with (indirect-nd index entry-vector k nil)
(indirect-nf index entry-vector k not-found)This alternative get operation is used in multiple places, and can be inlined.
This alternative get operation is used in multiple places, and can be inlined.
(ordered-map)(ordered-map & keyvals)Creates a map object that remembers the insertion order, similarly to a java.util.LinkedHashMap
Creates a map object that remembers the insertion order, similarly to a java.util.LinkedHashMap
(ordered-set)(ordered-set & s)Creates a set object that remembers the insertion order, similarly to a java.util.LinkedHashSet
Creates a set object that remembers the insertion order, similarly to a java.util.LinkedHashSet
(oset s)Convenience function to create an ordered set from a seq
Convenience function to create an ordered set from a seq
(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.
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 os)cljdoc builds & hosts documentation for Clojure/Script libraries
| Ctrl+k | Jump to recent docs |
| ← | Move to previous article |
| → | Move to next article |
| Ctrl+/ | Jump to the search field |