noon.lib.rythmn — org.clojars.pbaille/noon 0.1.2-SNAPSHOT

durtup clj

(durtup & xs)

build a tup from some numbers

durtup* clj

(durtup* xs)

build a tup from some numbers

euclidean-tup clj

(euclidean-tup resolution size)

make a tuple from an euclidean sum

euclidean-tups clj

(euclidean-tups resolution size)

an euclidean tuple and its rotations

gen-bintup clj

(gen-bintup resolution)

(gen-bintup resolution size)

(gen-bintup resolution size & options)

works like gen-tup except: every notes length equal resolution every note is marked with :gentup 0

in addition to this, every hole between notes is filled with notes of duration resolution and marked :bintup 1.

this will allow you to get some binary accentuated tups, for instance like this: (play (gen-bintup 18 10 :shifted) (parts {:bintup 0} vel2 {:bintup 1} vel6))

gen-tup doc: generate a rythmic tup based on the given arguments: resolution: the number of subdivisions that we will use. size: the number of notes that the generated tup will contain. options: euclidean: generates an euclydean tup. durations: the multiples of 'resolution that we are allowed to use (fractionals allowed). shifted: the possibility for the generated tup to not begin on beat.

gen-tup clj

(gen-tup resolution)

(gen-tup resolution size)

(gen-tup resolution size & options)

generate a rythmic tup based on the given arguments: resolution: the number of subdivisions that we will use. size: the number of notes that the generated tup will contain. options: euclidean: generates an euclydean tup. durations: the multiples of 'resolution that we are allowed to use (fractionals allowed). shifted: the possibility for the generated tup to not begin on beat.

gen-tup-options clj

(gen-tup-options x)

memo-sums clj

permutation clj

(permutation n)

(permutation n i)

permute a score by time slices, 'n is the number of slices, 'i is a permutation index (int:absolute | float:gradual | :random).

rand-shift clj

(rand-shift resolution)

rand-sum clj

(rand-sum total size members)

random-kw? clj

rotation clj

(rotation offset)

(rotation k arg)

time rotation of a score. forms: (rotation <offset>) : rotate by the given offset (rotation :relative <fractional>) : rotate to a fraction of the total length (rotation :rand-by <increment>) : pick a random rotation using increment as resolution. (rotation :rand-sub <n>) : split the score in 'n parts and rotate to a randomly picked one.

score-fw-shifts clj

(score-fw-shifts score increment)

returns a sequence of forward time shifts by 'increment preserving the original score duration. the shifting stops when the last event goes out of score.

slice-score clj

(slice-score score n)

slice a score into n parts of equal duration.

sum->bins clj

(sum->bins sum)

sum->tup clj

(sum->tup xs)