(->collection item)
Ensure an item implements java.util.Collection. This is inherently true for seqs and any implementation of java.util.List but not true for object arrays. For maps this returns the entry set.
Ensure an item implements java.util.Collection. This is inherently true for seqs and any implementation of java.util.List but not true for object arrays. For maps this returns the entry set.
(->random-access item)
(->reducible item)
(concat)
(concat & args)
(filter pred coll)
(into-array aseq)
(into-array ary-type aseq)
(into-array ary-type mapfn aseq)
(make-readonly-list n idxvar read-code)
(make-readonly-list cls-type-kwd n idxvar read-code)
Implement a readonly list. If cls-type-kwd is provided it must be, at compile time, either :int64, :float64 or :object and the getLong, getDouble or get interface methods will be filled in, respectively. In those cases read-code must return the appropriate type.
Implement a readonly list. If cls-type-kwd is provided it must be, at compile time, either :int64, :float64 or :object and the getLong, getDouble or get interface methods will be filled in, respectively. In those cases read-code must return the appropriate type.
(map f arg)
(map f arg & args)
(object-array item)
Faster version of object-array for eductions, java collections and strings.
Faster version of object-array for eductions, java collections and strings.
(reindex coll indexes)
Permut coll by the given indexes. Result is random-access and the same length as the index collection. Indexes are expected to be in the range of [0->count(coll)).
Permut coll by the given indexes. Result is random-access and the same length as the index collection. Indexes are expected to be in the range of [0->count(coll)).
(repeatedly f)
(repeatedly n f)
(repeatedly n f opts)
When called with one argument, produce infinite list of calls to v. When called with two arguments, produce a random access list of length n of calls to v.
When called with one argument, produce infinite list of calls to v. When called with two arguments, produce a random access list of length n of calls to v.
(seed->random seed)
(shift n coll)
Shift a collection forward or backward repeating either the first or the last entries. Returns a random access list with the same elements as coll.
Example:
ham-fisted.api> (shift 2 (range 10))
[0 0 0 1 2 3 4 5 6 7]
ham-fisted.api> (shift -2 (range 10))
[2 3 4 5 6 7 8 9 9 9]
Shift a collection forward or backward repeating either the first or the last entries. Returns a random access list with the same elements as coll. Example: ```clojure ham-fisted.api> (shift 2 (range 10)) [0 0 0 1 2 3 4 5 6 7] ham-fisted.api> (shift -2 (range 10)) [2 3 4 5 6 7 8 9 9 9] ```
(shuffle coll)
(shuffle coll opts)
shuffle values returning random access container.
Options:
:seed
- If instance of java.util.Random, use this. If integer, use as seed.
If not provided a new instance of java.util.Random is created.shuffle values returning random access container. Options: * `:seed` - If instance of java.util.Random, use this. If integer, use as seed. If not provided a new instance of java.util.Random is created.
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close