noon.utils.sequences — org.clojars.pbaille/noon 0.1.3

sequences transformation with the consideration of increasing complexity

decimal->idx clj

(decimal->idx s d)

take a sequence and a number between 0 and 1, 0 being the first idx and 1 the last. also supports negative numbers to (-1 being the first idx and -0 the last) return the corresponding integer index.

default-split-sizes clj

(default-split-sizes s)

default available split sizes for the given sequence

factors clj

(factors x)

grade-permutations clj

(grade-permutations s n)

(grade-permutations s n split-sizes)

gradual-permutations clj

(gradual-permutations s)

(gradual-permutations s split-sizes)

take a sequence s to permute, returns a grade->permutations map.

idx-permutations clj

MAX_GRADE clj

member clj

(member s x)

Find or pick an element within a sequence 's. available forms: (member s <integer>) normal nth like get (member s <negative-integer>) nth from the end of the list (member s <float-or-rational>) a non integer between -1 and 1, is picking a member relatively to the length of the list, forward if positive, backward if negative. (member s <[min max]>) picks a member randomly between the given idxs (every type of index allowed) (member s <:rand|:random>) picks a random member

mirror-idx clj

(mirror-idx s idx)

partitions clj

(partitions x)

permutation clj

(permutation s)

(permutation s idx)

(permutation s idx {:keys [grade split-bounds split-sizes min-split max-split]})

permutation-grades clj

(permutation-grades s)

return a seq of available permutation grades for the given seq

rotate clj

(rotate coll n)

rotation clj

(rotation s x)

rotations clj

(rotations x)

seq-idx clj

(seq-idx s x)

seq-section clj

(seq-section s [from to])

shuffle-no-rep clj

shuffle a sequence while avoiding to produce successive equal elements.

simple-permutations clj

(simple-permutations x)

lazy seq of permutations by increasing complexity

simple-subseqs clj

(simple-subseqs x)

split-permutations clj

splits clj

(splits s n)

(splits s n sizes)

takes a seq 's and a number of splits 'n return all possible splits of 's of size 'n