@kairotic/rhythm 0.2.0 → 0.3.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/README.md CHANGED
@@ -15,6 +15,9 @@ is their editor, measures them and writes them as music.
15
15
  |---|---|
16
16
  | `euclid [k 3] [n 8] [rotation 0]` | **a generator**: a Euclidean rhythm (Bjorklund's algorithm, after Toussaint) as pulses — k onsets as evenly as they can be over n pulses: `euclid 3 8` the tresillo, `5 8` the cinquillo, `5 16 6` the bossa nova, `7 12` the bembé. No view of its own: a bang sends the pulses; `[:k 5]`, `[:n 16]`, `[:rotation 6]` (or a map) change them, a number is k |
17
17
  | `necklace [n 16] [bars 1] [midi] [fourier]` | **the rhythm box**: takes a rhythm in any notation, draws it on the circle with its axes of symmetry, lets you edit it (pressing a pulse adds or takes away an onset), sends its **measures** (interval vector, evenness, deep, flat, axes, gap, oddity, the rotation of E(k,n) it is, Fourier coefficients) and writes it as a **musical tree** with the pitches of its right inlet |
18
+ | `chance [k 3] [n 8] [seed 1]` | **a generator**: k onsets among n pulses drawn with a seed — each bang another rhythm, the same seed the same rhythms in the same order (in a room, from the history); `:reset` starts them again |
19
+ | `homometric` | **a generator from a rhythm**: the other rhythms with the same interval vector, not the same necklace turned or in a mirror (the two flat rhythms of 4 in 12; a half of an even cycle and its complement) — a list of pulses, and how many |
20
+ | `swap` | **how far apart two rhythms are** (Toussaint's swap distance): the left one against the right one (the reference, cold) — in the bar, around the circle, and as necklaces at the best rotation; with the Hamming distance beside it, and the directed swap distance when they hold different numbers of onsets |
18
21
 
19
22
  ```clojure
20
23
  (box :b1 "msg [:rotation 6]" 40 20)
@@ -59,4 +62,16 @@ Its **right inlet** (cold) takes the pitches the notes take in turn, starting ag
59
62
  string, a list of Hz (the keys held on a keyboard; MIDI with `midi`), notes or chords of a tree; `:clear` forgets them.
60
63
  With `bars` the color goes on from bar to bar.
61
64
 
65
+ ## Generators and relations
66
+
67
+ `euclid`, `chance` and `homometric` make pulses; `swap` compares two. They have no view: put a `necklace` after
68
+ a generator to see, edit, measure and hear what it made.
69
+
70
+ **swap** answers `{:swap :circular :necklace :rotation :hamming :necklace-hamming :n :k}`. A swap exchanges an onset
71
+ and the silence beside it; the distance is how many turn one rhythm into the other, so an onset moved far counts
72
+ more than one moved near — the Hamming distance (how many pulses differ) cannot tell: the son clave is 1 swap from
73
+ the rumba and 1 from the bossa nova, and 2 by Hamming from both. With different numbers of onsets it is the directed
74
+ swap distance (the tresillo is 0 from the cinquillo: it is inside it). `:circular` lets a swap cross the end of the
75
+ bar; `:necklace` turns the reference to where it comes nearest, and `:rotation` says how far.
76
+
62
77
  Writing one of its classes in a work brings the package into it. Licence: [MPL-2.0](../../LICENSE).
@@ -0,0 +1,9 @@
1
+ // Generated by packages/build.mjs from src/chance.cljs
2
+ export default {
3
+ "class": "chance",
4
+ "version": "0.3.0",
5
+ "author": "bonuoq",
6
+ "license": "MPL-2.0",
7
+ "doc": "A generator of pulses, as euclid, with chance instead of evenness: each bang draws another rhythm of k onsets among n pulses, sent as pulses (ones and zeros) for a necklace. The draws are the seed's — the same seed, the same rhythms in the same order, for everyone in a room and again from the history; :reset starts its draws again. [:k 5], [:n 16], [:seed 7] (or a map of them) change it and start again; a number is k.",
8
+ "source": ";; chance · k onsets among n pulses, drawn with a seed\n;; Part of @kairotic/rhythm. Written against the Kairotic API (api/…).\n;; A generator of pulses, as euclid is, with chance instead of evenness: each bang draws another rhythm of k\n;; onsets among n pulses. The draws are the seed's: draw i of seed s is always the same rhythm, so the same\n;; seed plays the same game for everyone in a room and again from the history (:reset starts its draws\n;; again). Against euclid's, a necklace's measures say how even or uneven chance came out.\n(let [M 2147483647\n ;; Park–Miller, started from the seed and the number of the draw, a few turns to mix them\n rng (fn [seed i]\n (let [s (volatile! (inc (mod (+ (* 7919 (js/Math.abs (js/Math.round seed))) (* 104729 i) 12345) (dec M))))]\n (dotimes [_ 4] (vreset! s (mod (* @s 16807) M)))\n (fn [] (vreset! s (mod (* @s 16807) M)) (/ (dec @s) (dec M)))))\n ;; k of the n pulses, as a shuffle stopped after k (Fisher–Yates)\n draw (fn [k n seed i]\n (let [r (rng seed i)\n picked (loop [xs (vec (range n)) j 0]\n (if (= j k) (set (subvec xs 0 k))\n (let [m (+ j (js/Math.floor (* (r) (- n j)))) xj (nth xs j) xm (nth xs m)]\n (recur (assoc xs j xm m xj) (inc j)))))]\n (mapv (fn [p] (if (picked p) 1 0)) (range n))))\n params (fn [args over]\n (let [o (merge args over)\n n (api/clamp (js/Math.round (or (:n o) 8)) 1 128)]\n {:n n :k (api/clamp (js/Math.round (or (:k o) 3)) 0 n) :seed (or (:seed o) 1)}))]\n {;; ── about ──\n :class \"chance\"\n :license \"MPL-2.0\"\n :doc \"A generator of pulses, as euclid, with chance instead of evenness: each bang draws another rhythm of k onsets among n pulses, sent as pulses (ones and zeros) for a necklace. The draws are the seed's — the same seed, the same rhythms in the same order, for everyone in a room and again from the history; :reset starts its draws again. [:k 5], [:n 16], [:seed 7] (or a map of them) change it and start again; a number is k.\"\n :usage \"chance [k 3] [n 8] [seed 1]\"\n :io [1 1]\n\n ;; ── arguments ──\n :args [[:k 3] [:n 8] [:seed 1]]\n\n ;; ── logic ──\n :receive (fn [{:keys [value state args]}]\n (let [st (or state {:over {} :i 0})\n again (fn [over] {:state {:over over :i 0} :show (let [p (params args over)] (str (:k p) \"/\" (:n p) \" · seed \" (:seed p)))})]\n (cond\n (#{:bang} value) (let [p (params args (:over st)) i (:i st)]\n {:state (assoc st :i (inc i)) :show (str (:k p) \"/\" (:n p) \" · seed \" (:seed p) \" · draw \" (inc i))\n :out [[0 (draw (:k p) (:n p) (:seed p) i)]]})\n (#{:reset} value) (again (:over st))\n (number? value) (again (assoc (:over st) :k value))\n (and (vector? value) (= 2 (count value)) (#{:k :n :seed} (first value)) (number? (second value)))\n (again (assoc (:over st) (first value) (second value)))\n (map? value) (again (merge (:over st) (select-keys value [:k :n :seed])))\n :else {})))})\n"
9
+ };
package/dist/euclid.mjs CHANGED
@@ -1,7 +1,7 @@
1
1
  // Generated by packages/build.mjs from src/euclid.cljs
2
2
  export default {
3
3
  "class": "euclid",
4
- "version": "0.2.0",
4
+ "version": "0.3.0",
5
5
  "author": "bonuoq",
6
6
  "license": "MPL-2.0",
7
7
  "doc": "A Euclidean rhythm (Bjorklund's algorithm, after Toussaint), as pulses: k onsets spread as evenly as they can be over n pulses, from pulse rotation on — euclid 3 8 is the tresillo [1 0 0 1 0 0 1 0], euclid 5 8 the cinquillo, euclid 5 16 a rotation of the bossa nova (euclid 5 16 6 the bossa nova), euclid 7 12 the bembé. A generator with no view: a bang sends the pulses; [:k 5], [:n 16], [:rotation 2] (or a map of them) change them and send them when they are new, a number is k. Pulses are what every rhythm box takes: a necklace after it shows, edits and measures the rhythm, and writes it as a musical tree with pitches (euclid → necklace → tree).",
@@ -0,0 +1,9 @@
1
+ // Generated by packages/build.mjs from src/homometric.cljs
2
+ export default {
3
+ "class": "homometric",
4
+ "version": "0.3.0",
5
+ "author": "bonuoq",
6
+ "license": "MPL-2.0",
7
+ "doc": "The other rhythms with the same interval vector (Toussaint, after crystallography): homometric rhythms hold the same distances between onsets, as many times each, without being the same necklace turned or in a mirror — the two flat rhythms of four onsets in twelve; any half of the pulses of an even cycle and its complement, two drums with the same intervals. Given pulses, it searches every rhythm of as many onsets among as many pulses (when they are at most 7 000: any rhythm of 16 pulses) and sends the others it finds, each from its first onset, as a list of pulses (left: for nth, or one by one to a necklace) and how many there are (right); none, an empty list. A bang searches again.",
8
+ "source": ";; homometric · the other rhythms with the same interval vector\n;; Part of @kairotic/rhythm. Written against the Kairotic API (api/…).\n;; Two rhythms are homometric when they hold the same distances between onsets, as many times each — the\n;; same interval vector, the same \"histogram\" — without being the same necklace turned or seen in a mirror\n;; (Toussaint, after crystallography: Patterson, Rosenblatt and Seymour). The two flat rhythms of four onsets\n;; in twelve are homometric; so is any half of the pulses of an even cycle with its complement, which gives two\n;; drums (high and low congas) the same intervals. Given a rhythm as pulses, it searches every rhythm of as many\n;; onsets among as many pulses (up to 7 000 of them: any rhythm of 16 pulses; a moment for the largest) and sends the others it finds, each from its first onset, as a list of\n;; pulses (for nth, or a necklace one by one), and how many there are.\n(let [onsets-of (fn [ps] (vec (keep-indexed (fn [i x] (when (= 1 x) i)) ps)))\n pulses? (fn [v] (and (sequential? v) (seq v) (every? #{0 1} v)))\n dist (fn [n a b] (let [d (js/Math.abs (- a b))] (min d (- n d))))\n ivec-of (fn [n os] (let [c (frequencies (for [i (range (count os)) j (range (inc i) (count os))] (dist n (nth os i) (nth os j))))]\n (mapv (fn [d] (get c d 0)) (range 1 (inc (quot n 2))))))\n ;; a necklace up to rotation and mirror, as its smallest form starting at 0 (a bracelet)\n bracelet (fn [n os]\n (first (sort (for [f [identity (fn [x] (mod (- n x) n))] r (range n)]\n (vec (sort (map (fn [x] (mod (- (f x) r) n)) os)))))))\n ;; the subsets of 1…n−1 of size m (0 is always an onset: rotations are the same necklace)\n subsets (fn subsets [from n m]\n (cond (zero? m) [[]]\n (> m (- n from)) []\n :else (concat (map (fn [s] (cons from s)) (subsets (inc from) n (dec m))) (subsets (inc from) n m))))\n ;; how many rhythms the search goes through: C(n−1, k−1)\n choose (fn [a b] (reduce (fn [acc i] (/ (* acc (- a i)) (inc i))) 1 (range (min b (- a b)))))\n limit 7000\n search (fn [ps]\n (let [n (count ps) os (onsets-of ps) k (count os) target (ivec-of n os) own (bracelet n os)]\n (if (zero? k) []\n (->> (subsets 1 n (dec k))\n (map (fn [s] (vec (cons 0 s))))\n (filter (fn [o] (= target (ivec-of n o))))\n (map (fn [o] (bracelet n o)))\n distinct\n (remove (fn [b] (= b own)))\n sort\n (mapv (fn [b] (let [on (set b)] (mapv (fn [i] (if (on i) 1 0)) (range n)))))))))]\n {;; ── about ──\n :class \"homometric\"\n :license \"MPL-2.0\"\n :doc \"The other rhythms with the same interval vector (Toussaint, after crystallography): homometric rhythms hold the same distances between onsets, as many times each, without being the same necklace turned or in a mirror — the two flat rhythms of four onsets in twelve; any half of the pulses of an even cycle and its complement, two drums with the same intervals. Given pulses, it searches every rhythm of as many onsets among as many pulses (when they are at most 7 000: any rhythm of 16 pulses) and sends the others it finds, each from its first onset, as a list of pulses (left: for nth, or one by one to a necklace) and how many there are (right); none, an empty list. A bang searches again.\"\n :usage \"homometric\"\n :io [1 2]\n\n ;; ── logic ──\n :receive (fn [{:keys [value state]}]\n (let [st (or state {})\n go (fn [ps] (if (> (choose (dec (count ps)) (max 0 (dec (count (onsets-of ps))))) limit)\n {:state (assoc st :ps ps) :show (str \"too many to search (more than \" limit \" rhythms)\")}\n (let [hs (search ps)]\n {:state (assoc st :ps ps) :show (str (count hs) \" homometric\")\n :out [[1 (count hs)] [0 hs]]})))]\n (cond\n (and (#{:bang} value) (:ps st)) (go (:ps st))\n (pulses? value) (if (= (vec value) (:ps st)) {:state st} (go (vec value)))\n :else {})))})\n"
9
+ };
package/dist/index.mjs CHANGED
@@ -1,22 +1,40 @@
1
1
  // Generated by packages/build.mjs
2
2
  export default {
3
3
  "package": "@kairotic/rhythm",
4
- "version": "0.2.0",
4
+ "version": "0.3.0",
5
5
  "api": 1,
6
6
  "author": "bonuoq",
7
7
  "license": "MPL-2.0",
8
8
  "components": [
9
+ {
10
+ "class": "chance",
11
+ "license": "MPL-2.0",
12
+ "doc": "A generator of pulses, as euclid, with chance instead of evenness: each bang draws another rhythm of k onsets among n pulses, sent as pulses (ones and zeros) for a necklace. The draws are the seed's — the same seed, the same rhythms in the same order, for everyone in a room and again from the history; :reset starts its draws again. [:k 5], [:n 16], [:seed 7] (or a map of them) change it and start again; a number is k.",
13
+ "source": ";; chance · k onsets among n pulses, drawn with a seed\n;; Part of @kairotic/rhythm. Written against the Kairotic API (api/…).\n;; A generator of pulses, as euclid is, with chance instead of evenness: each bang draws another rhythm of k\n;; onsets among n pulses. The draws are the seed's: draw i of seed s is always the same rhythm, so the same\n;; seed plays the same game for everyone in a room and again from the history (:reset starts its draws\n;; again). Against euclid's, a necklace's measures say how even or uneven chance came out.\n(let [M 2147483647\n ;; Park–Miller, started from the seed and the number of the draw, a few turns to mix them\n rng (fn [seed i]\n (let [s (volatile! (inc (mod (+ (* 7919 (js/Math.abs (js/Math.round seed))) (* 104729 i) 12345) (dec M))))]\n (dotimes [_ 4] (vreset! s (mod (* @s 16807) M)))\n (fn [] (vreset! s (mod (* @s 16807) M)) (/ (dec @s) (dec M)))))\n ;; k of the n pulses, as a shuffle stopped after k (Fisher–Yates)\n draw (fn [k n seed i]\n (let [r (rng seed i)\n picked (loop [xs (vec (range n)) j 0]\n (if (= j k) (set (subvec xs 0 k))\n (let [m (+ j (js/Math.floor (* (r) (- n j)))) xj (nth xs j) xm (nth xs m)]\n (recur (assoc xs j xm m xj) (inc j)))))]\n (mapv (fn [p] (if (picked p) 1 0)) (range n))))\n params (fn [args over]\n (let [o (merge args over)\n n (api/clamp (js/Math.round (or (:n o) 8)) 1 128)]\n {:n n :k (api/clamp (js/Math.round (or (:k o) 3)) 0 n) :seed (or (:seed o) 1)}))]\n {;; ── about ──\n :class \"chance\"\n :license \"MPL-2.0\"\n :doc \"A generator of pulses, as euclid, with chance instead of evenness: each bang draws another rhythm of k onsets among n pulses, sent as pulses (ones and zeros) for a necklace. The draws are the seed's — the same seed, the same rhythms in the same order, for everyone in a room and again from the history; :reset starts its draws again. [:k 5], [:n 16], [:seed 7] (or a map of them) change it and start again; a number is k.\"\n :usage \"chance [k 3] [n 8] [seed 1]\"\n :io [1 1]\n\n ;; ── arguments ──\n :args [[:k 3] [:n 8] [:seed 1]]\n\n ;; ── logic ──\n :receive (fn [{:keys [value state args]}]\n (let [st (or state {:over {} :i 0})\n again (fn [over] {:state {:over over :i 0} :show (let [p (params args over)] (str (:k p) \"/\" (:n p) \" · seed \" (:seed p)))})]\n (cond\n (#{:bang} value) (let [p (params args (:over st)) i (:i st)]\n {:state (assoc st :i (inc i)) :show (str (:k p) \"/\" (:n p) \" · seed \" (:seed p) \" · draw \" (inc i))\n :out [[0 (draw (:k p) (:n p) (:seed p) i)]]})\n (#{:reset} value) (again (:over st))\n (number? value) (again (assoc (:over st) :k value))\n (and (vector? value) (= 2 (count value)) (#{:k :n :seed} (first value)) (number? (second value)))\n (again (assoc (:over st) (first value) (second value)))\n (map? value) (again (merge (:over st) (select-keys value [:k :n :seed])))\n :else {})))})\n"
14
+ },
9
15
  {
10
16
  "class": "euclid",
11
17
  "license": "MPL-2.0",
12
18
  "doc": "A Euclidean rhythm (Bjorklund's algorithm, after Toussaint), as pulses: k onsets spread as evenly as they can be over n pulses, from pulse rotation on — euclid 3 8 is the tresillo [1 0 0 1 0 0 1 0], euclid 5 8 the cinquillo, euclid 5 16 a rotation of the bossa nova (euclid 5 16 6 the bossa nova), euclid 7 12 the bembé. A generator with no view: a bang sends the pulses; [:k 5], [:n 16], [:rotation 2] (or a map of them) change them and send them when they are new, a number is k. Pulses are what every rhythm box takes: a necklace after it shows, edits and measures the rhythm, and writes it as a musical tree with pitches (euclid → necklace → tree).",
13
19
  "source": ";; euclid · a Euclidean rhythm, as pulses: k onsets spread as evenly as they can be over n pulses\n;; Part of @kairotic/rhythm. Written against the Kairotic API (api/…).\n;; Bjorklund's algorithm (Toussaint, \"The Euclidean algorithm generates traditional musical rhythms\", 2005):\n;; E(3,8) is the tresillo, E(5,8) the cinquillo, E(5,16) a rotation of the bossa nova, E(7,12) the bembé.\n;; A generator, almost a function: (euclid k n rotation) → pulses, ones and zeros — the common tongue of the\n;; rhythm boxes, as Hz are of pitch. It has no view: a necklace shows, edits, measures and writes as a tree\n;; what it makes (euclid → necklace → tree).\n(let [bjorklund (fn [k n]\n (cond (<= n 0) []\n (<= k 0) (vec (repeat n 0))\n (>= k n) (vec (repeat n 1))\n :else (loop [a (vec (repeat k [1])) b (vec (repeat (- n k) [0]))]\n (if (<= (count b) 1)\n (vec (apply concat (concat a b)))\n (let [m (min (count a) (count b))]\n (recur (mapv into (subvec a 0 m) (subvec b 0 m))\n (if (> (count a) m) (subvec a m) (subvec b m))))))))\n ;; read from pulse r on: the rhythm in a fixed position against the beat\n rotate (fn [xs r] (let [n (count xs)] (if (zero? n) xs (let [r (mod r n)] (vec (concat (subvec xs r) (subvec xs 0 r)))))))\n pulses-of (fn [args over]\n (let [o (merge args over)\n n (api/clamp (js/Math.round (or (:n o) 8)) 1 128)\n k (api/clamp (js/Math.round (or (:k o) 3)) 0 n)]\n {:k k :n n :rotation (mod (js/Math.round (or (:rotation o) 0)) n)\n :pulses (rotate (bjorklund k n) (or (:rotation o) 0))}))\n ;; a change: sent when the pulses are new (the same again changes nothing); a bang sends them anyway\n changed (fn [args st over always?]\n (let [r (pulses-of args over)\n shown (str \"E(\" (:k r) \",\" (:n r) \")\" (when (pos? (:rotation r)) (str \" ↻\" (:rotation r))))]\n (if (and (not always?) (= (:pulses r) (:sent st)))\n {:state (assoc st :over over) :show shown}\n {:state (assoc st :over over :sent (:pulses r)) :show shown :out [[0 (:pulses r)]]})))]\n {;; ── about ──\n :class \"euclid\"\n :license \"MPL-2.0\"\n :doc \"A Euclidean rhythm (Bjorklund's algorithm, after Toussaint), as pulses: k onsets spread as evenly as they can be over n pulses, from pulse rotation on — euclid 3 8 is the tresillo [1 0 0 1 0 0 1 0], euclid 5 8 the cinquillo, euclid 5 16 a rotation of the bossa nova (euclid 5 16 6 the bossa nova), euclid 7 12 the bembé. A generator with no view: a bang sends the pulses; [:k 5], [:n 16], [:rotation 2] (or a map of them) change them and send them when they are new, a number is k. Pulses are what every rhythm box takes: a necklace after it shows, edits and measures the rhythm, and writes it as a musical tree with pitches (euclid → necklace → tree).\"\n :usage \"euclid [k 3] [n 8] [rotation 0]\"\n :io [1 1]\n\n ;; ── arguments ──\n :args [[:k 3] [:n 8] [:rotation 0]]\n\n ;; ── logic ──\n :receive (fn [{:keys [value state args]}]\n (let [st (or state {:over {}})\n over (:over st)\n set-over (fn [m] (changed args st (merge over m) false))]\n (cond\n (#{:bang} value) (changed args st over true)\n (number? value) (set-over {:k value})\n (and (vector? value) (= 2 (count value)) (#{:k :n :rotation} (first value)) (number? (second value)))\n (set-over {(first value) (second value)})\n (map? value) (set-over (select-keys value [:k :n :rotation]))\n :else {})))})\n"
14
20
  },
21
+ {
22
+ "class": "homometric",
23
+ "license": "MPL-2.0",
24
+ "doc": "The other rhythms with the same interval vector (Toussaint, after crystallography): homometric rhythms hold the same distances between onsets, as many times each, without being the same necklace turned or in a mirror — the two flat rhythms of four onsets in twelve; any half of the pulses of an even cycle and its complement, two drums with the same intervals. Given pulses, it searches every rhythm of as many onsets among as many pulses (when they are at most 7 000: any rhythm of 16 pulses) and sends the others it finds, each from its first onset, as a list of pulses (left: for nth, or one by one to a necklace) and how many there are (right); none, an empty list. A bang searches again.",
25
+ "source": ";; homometric · the other rhythms with the same interval vector\n;; Part of @kairotic/rhythm. Written against the Kairotic API (api/…).\n;; Two rhythms are homometric when they hold the same distances between onsets, as many times each — the\n;; same interval vector, the same \"histogram\" — without being the same necklace turned or seen in a mirror\n;; (Toussaint, after crystallography: Patterson, Rosenblatt and Seymour). The two flat rhythms of four onsets\n;; in twelve are homometric; so is any half of the pulses of an even cycle with its complement, which gives two\n;; drums (high and low congas) the same intervals. Given a rhythm as pulses, it searches every rhythm of as many\n;; onsets among as many pulses (up to 7 000 of them: any rhythm of 16 pulses; a moment for the largest) and sends the others it finds, each from its first onset, as a list of\n;; pulses (for nth, or a necklace one by one), and how many there are.\n(let [onsets-of (fn [ps] (vec (keep-indexed (fn [i x] (when (= 1 x) i)) ps)))\n pulses? (fn [v] (and (sequential? v) (seq v) (every? #{0 1} v)))\n dist (fn [n a b] (let [d (js/Math.abs (- a b))] (min d (- n d))))\n ivec-of (fn [n os] (let [c (frequencies (for [i (range (count os)) j (range (inc i) (count os))] (dist n (nth os i) (nth os j))))]\n (mapv (fn [d] (get c d 0)) (range 1 (inc (quot n 2))))))\n ;; a necklace up to rotation and mirror, as its smallest form starting at 0 (a bracelet)\n bracelet (fn [n os]\n (first (sort (for [f [identity (fn [x] (mod (- n x) n))] r (range n)]\n (vec (sort (map (fn [x] (mod (- (f x) r) n)) os)))))))\n ;; the subsets of 1…n−1 of size m (0 is always an onset: rotations are the same necklace)\n subsets (fn subsets [from n m]\n (cond (zero? m) [[]]\n (> m (- n from)) []\n :else (concat (map (fn [s] (cons from s)) (subsets (inc from) n (dec m))) (subsets (inc from) n m))))\n ;; how many rhythms the search goes through: C(n−1, k−1)\n choose (fn [a b] (reduce (fn [acc i] (/ (* acc (- a i)) (inc i))) 1 (range (min b (- a b)))))\n limit 7000\n search (fn [ps]\n (let [n (count ps) os (onsets-of ps) k (count os) target (ivec-of n os) own (bracelet n os)]\n (if (zero? k) []\n (->> (subsets 1 n (dec k))\n (map (fn [s] (vec (cons 0 s))))\n (filter (fn [o] (= target (ivec-of n o))))\n (map (fn [o] (bracelet n o)))\n distinct\n (remove (fn [b] (= b own)))\n sort\n (mapv (fn [b] (let [on (set b)] (mapv (fn [i] (if (on i) 1 0)) (range n)))))))))]\n {;; ── about ──\n :class \"homometric\"\n :license \"MPL-2.0\"\n :doc \"The other rhythms with the same interval vector (Toussaint, after crystallography): homometric rhythms hold the same distances between onsets, as many times each, without being the same necklace turned or in a mirror — the two flat rhythms of four onsets in twelve; any half of the pulses of an even cycle and its complement, two drums with the same intervals. Given pulses, it searches every rhythm of as many onsets among as many pulses (when they are at most 7 000: any rhythm of 16 pulses) and sends the others it finds, each from its first onset, as a list of pulses (left: for nth, or one by one to a necklace) and how many there are (right); none, an empty list. A bang searches again.\"\n :usage \"homometric\"\n :io [1 2]\n\n ;; ── logic ──\n :receive (fn [{:keys [value state]}]\n (let [st (or state {})\n go (fn [ps] (if (> (choose (dec (count ps)) (max 0 (dec (count (onsets-of ps))))) limit)\n {:state (assoc st :ps ps) :show (str \"too many to search (more than \" limit \" rhythms)\")}\n (let [hs (search ps)]\n {:state (assoc st :ps ps) :show (str (count hs) \" homometric\")\n :out [[1 (count hs)] [0 hs]]})))]\n (cond\n (and (#{:bang} value) (:ps st)) (go (:ps st))\n (pulses? value) (if (= (vec value) (:ps st)) {:state st} (go (vec value)))\n :else {})))})\n"
26
+ },
15
27
  {
16
28
  "class": "necklace",
17
29
  "license": "MPL-2.0",
18
30
  "doc": "A cyclic rhythm on the circle and its geometry (Toussaint): k onsets among n pulses around a circle, time clockwise from the top — the same object as a pitch-class set on pcclock. A rhythm arrives as pulses (ones and zeros, as euclid's right outlet sends them), as intervals between onsets ([3 3 2]), as box notation (\"x..x..x.\"), as an :rtm map ({:shares [3 3 2]}, euclid's middle outlet), a tree with an :rtm, or {:onsets [0 3 6] :n 8}; it is drawn as a polygon, with its axes of mirror symmetry. Pressing a pulse (or a number, its index) adds or takes away an onset. :complement swaps onsets and silences, [:rotate 1] starts it a pulse later, [:n 12] makes the circle longer or shorter, :clear empties it, [:bars 4] and [:meter \"3/4\"] as euclid, a bang sends it again. Out, as euclid: a musical tree (left: a bar of n pulses with an :rtm whose shares are the intervals between onsets), the :rtm map alone (1), the pulses (2); and its measures (3): {:n :k :onsets :intervals :ivec — how often each distance occurs —, :evenness — the sum of the chords between all pairs (Block and Douthett) —, :even — that sum against the Euclidean rhythm's, 1 as even as it —, :deep — each distance a different number of times —, :flat — each once —, :axes — of mirror symmetry, in pulses —, :gap — the longest interval —, :oddity — no two onsets halving the cycle —, :euclid — the rotation of E(k,n) it is, or nil —, :fourier and :phases — its Fourier coefficients f1 … f⌊n/2⌋, magnitudes 0…1 and phases in degrees: |f1| near 0 balanced, |f_k| largest when maximally even —}; with the word fourier the magnitudes are drawn too, a bar each. Its right inlet (cold) takes the pitches the notes take in turn, as euclid's.",
19
31
  "source": ";; necklace · a cyclic rhythm on the circle, and its geometry (Toussaint)\n;; Part of @kairotic/rhythm. Written against the Kairotic API (api/…).\n;; A rhythm that repeats is a necklace: k onsets among n pulses around a circle, time clockwise from the\n;; top. Seen so, it is the same object as a pitch-class set on pcclock, and the same geometry measures it\n;; (Toussaint, \"The Geometry of Musical Rhythm\"): its full-interval vector (how often each distance between\n;; onsets occurs), its evenness (the sum of the chords between all pairs of onsets, after Block and Douthett;\n;; arcs are too coarse: the six 4/4 claves would all score the same), whether it is deep (each distance a\n;; different number of times, as the diatonic scale and the bembé), flat (each distance once), its axes of\n;; mirror symmetry, its longest gap, rhythmic oddity (no two onsets halving the cycle), and whether it is a\n;; rotation of the Euclidean rhythm E(k,n) — and its Fourier coefficients (after Amiot and Milne): |f1| near 0\n;; is a balanced rhythm, a maximal |f_k| among the rhythms of k onsets a maximally even one, and the others its\n;; periodicities (in 16 pulses f4 the quarter notes, f3 a three against the four).\n;; It is the rhythm box: generators (euclid) make pulses, the necklace holds them, shows them, is their editor\n;; (pressing a pulse adds or takes away an onset), measures them and writes them as a musical tree, its :rtm\n;; map and its pulses, with the pitches of its right inlet (talea and color).\n(let [TAU (* 2 js/Math.PI)\n bjorklund (fn [k n]\n (cond (<= n 0) []\n (<= k 0) (vec (repeat n 0))\n (>= k n) (vec (repeat n 1))\n :else (loop [a (vec (repeat k [1])) b (vec (repeat (- n k) [0]))]\n (if (<= (count b) 1)\n (vec (apply concat (concat a b)))\n (let [m (min (count a) (count b))]\n (recur (mapv into (subvec a 0 m) (subvec b 0 m))\n (if (> (count a) m) (subvec a m) (subvec b m))))))))\n rotate (fn [xs r] (let [n (count xs)] (if (zero? n) xs (let [r (mod r n)] (vec (concat (subvec xs r) (subvec xs 0 r)))))))\n onsets-of (fn [ps] (vec (keep-indexed (fn [i x] (when (= 1 x) i)) ps)))\n intervals-of (fn [ps] (let [os (onsets-of ps) n (count ps)]\n (if (empty? os) [] (mapv (fn [a b] (- b a)) os (conj (subvec os 1) (+ n (first os)))))))\n shares-of (fn [ps] (let [os (onsets-of ps) n (count ps)]\n (cond (zero? n) []\n (empty? os) [(- n)]\n :else (vec (concat (when (pos? (first os)) [(- (first os))])\n (map (fn [a b] (- b a)) os (conj (subvec os 1) n)))))))\n r3 (fn [x] (/ (js/Math.round (* 1000 x)) 1000))\n ;; ── what arrives, as pulses (ones and zeros), or nil when it is not a rhythm ──\n whole? (fn [x] (and (number? x) (== x (js/Math.round x))))\n from-shares (fn [sh] (when (and (sequential? sh) (seq sh) (every? (fn [x] (and (whole? x) (not (zero? x)))) sh))\n (vec (mapcat (fn [x] (if (pos? x) (cons 1 (repeat (dec x) 0)) (repeat (- x) 0))) sh))))\n from-onsets (fn [os n] (when (and (whole? n) (pos? n) (sequential? os) (every? whole? os))\n (let [on (set (map (fn [o] (mod o n)) os))] (mapv (fn [i] (if (on i) 1 0)) (range n)))))\n ;; the first :rtm of a tree (as euclid sends it)\n rtm-in (fn rtm-in [t] (when (sequential? t)\n (if (= :rtm (first t)) (second t) (some rtm-in (filter sequential? t)))))\n ;; a list: ones and zeros are pulses; other whole numbers, the intervals between onsets (3 3 2)\n pulses-of-list (fn [v] (when (and (sequential? v) (seq v) (every? whole? v))\n (if (every? #{0 1} v) (vec v) (when (every? pos? v) (from-shares v)))))\n pulses-of (fn [v]\n (cond\n ;; box notation (TUBS): \"x..x..x.\" (x, X or 1 an onset; . - _ or 0 a pulse without one)\n (string? v) (let [cs (remove #{\" \"} (seq v))]\n (when (and (seq cs) (every? #{\"x\" \"X\" \"1\" \".\" \"-\" \"_\" \"0\"} cs))\n (mapv (fn [c] (if (#{\"x\" \"X\" \"1\"} c) 1 0)) cs)))\n (map? v) (cond (contains? v :shares) (from-shares (:shares v))\n (contains? v :pulses) (pulses-of-list (:pulses v))\n (contains? v :onsets) (from-onsets (:onsets v) (:n v)))\n (and (sequential? v) (keyword? (first v))) (some-> (rtm-in v) :shares from-shares)\n :else nil))\n ;; ── its geometry ──\n dist (fn [n a b] (let [d (js/Math.abs (- a b))] (min d (- n d))))\n pairs (fn [os] (for [i (range (count os)) j (range (inc i) (count os))] [(nth os i) (nth os j)]))\n ivec-of (fn [n os] (let [c (frequencies (map (fn [[a b]] (dist n a b)) (pairs os)))]\n (mapv (fn [d] (get c d 0)) (range 1 (inc (quot n 2))))))\n evenness-of (fn [n os] (reduce + 0 (map (fn [[a b]] (* 2 (js/Math.sin (/ (* js/Math.PI (dist n a b)) n)))) (pairs os))))\n ;; the axes of mirror symmetry, in pulses: x → a − x keeps the set; the axis passes through a/2 (and a/2 + n/2)\n axes-of (fn [n os] (let [s (set os)]\n (if (empty? s) []\n (vec (for [a (range n) :when (= s (set (map (fn [x] (mod (- a x) n)) os)))] (/ a 2))))))\n ;; the Fourier coefficients of the onsets, f1 … f⌊n/2⌋: magnitudes 0…1 (over k) and phases in degrees\n fourier-of (fn [n os]\n (let [k (count os)]\n (vec (for [j (range 1 (inc (quot n 2)))]\n (if (zero? k) [0 0]\n [(/ (reduce + (map (fn [x] (js/Math.cos (/ (* TAU j x) n))) os)) k)\n (- (/ (reduce + (map (fn [x] (js/Math.sin (/ (* TAU j x) n))) os)) k))])))))\n measures (fn [ps]\n (let [n (count ps) os (onsets-of ps) k (count os) iv (ivec-of n os) ev (evenness-of n os)\n e (bjorklund k n) eev (evenness-of n (onsets-of e))\n er (first (filter (fn [r] (= ps (rotate e r))) (range (max n 1))))]\n {:n n :k k :onsets os :intervals (intervals-of ps) :ivec iv\n :evenness (r3 ev) :even (if (pos? eev) (r3 (/ ev eev)) 1)\n :deep (and (>= k 2) (= (count (distinct iv)) (count iv)))\n :flat (and (seq iv) (every? #{1} iv))\n :axes (axes-of n os)\n :gap (if (seq os) (apply max (intervals-of ps)) n)\n :oddity (or (odd? n) (not-any? (fn [[a b]] (= (* 2 (dist n a b)) n)) (pairs os)))\n :euclid er\n :fourier (mapv (fn [[a b]] (r3 (js/Math.hypot a b))) (fourier-of n os))\n :phases (mapv (fn [[a b]] (if (< (js/Math.hypot a b) 1e-9) 0 (r3 (* (/ 180 js/Math.PI) (js/Math.atan2 b a))))) (fourier-of n os))}))\n fourier? (fn [args] (some (fn [a] (= \"fourier\" (if (keyword? a) (name a) (str a)))) (if (map? args) (when (:fourier args) [:fourier]) args)))\n ;; ── as euclid sends a rhythm: the meter of a bar of n pulses, the pitches, the color over bars ──\n pow2? (fn [x] (and (pos? x) (== x (js/Math.pow 2 (js/Math.round (js/Math.log2 x))))))\n meter-of (fn [n] (cond (and (>= n 4) (pow2? n)) [4 4]\n (and (>= n 12) (zero? (mod n 3)) (pow2? (/ n 3))) [12 8]\n (< n 4) [n 4]\n (<= n 12) [n 8]\n :else [n 16]))\n meter-arg (fn [v] (cond (and (sequential? v) (= 2 (count v)) (every? number? v)) (vec v)\n (string? v) v\n (keyword? v) (name v)\n :else nil))\n hz->m (fn [x] (when (and (number? x) (pos? x)) (/ (js/Math.round (* 1000 (+ 69 (* 12 (js/Math.log2 (/ x 440)))))) 1000)))\n pitches-of (fn [midi? v]\n (let [p (fn [x] (if midi? x (hz->m x)))]\n (cond (#{:clear} v) nil\n (map? v) (cond (or (contains? v :pitches) (contains? v :pitch)) (select-keys v [:pitches :pitch])\n (sequential? (:note v)) {:pitches (mapv (fn [x] (if (number? x) x \"r\")) (:note v))}\n :else :ignore)\n (string? v) {:pitches v}\n (number? v) (if-let [m (p v)] {:pitch m} :ignore)\n (and (sequential? v) (keyword? (first v))) {:pitches [v]}\n (and (sequential? v) (seq v) (every? number? v)) (let [ms (vec (keep p v))] (if (seq ms) {:pitches ms} :ignore))\n (and (sequential? v) (seq v)) {:pitches (vec v)}\n :else :ignore)))\n tokens (fn [ps] (cond (string? ps) (vec (remove #{\"\"} (.split (.trim ps) (js/RegExp. \"\\\\s+\"))))\n (sequential? ps) (vec ps)\n :else nil))\n color-at (fn [pm skip]\n (let [ts (tokens (:pitches pm))]\n (if (or (empty? ts) (zero? (mod skip (count ts))))\n pm\n (let [r (mod skip (count ts)) ts2 (vec (concat (subvec ts r) (subvec ts 0 r)))]\n (assoc pm :pitches (if (string? (:pitches pm)) (apply str (interpose \" \" ts2)) ts2))))))\n rhythm (fn [ps st]\n (let [k (count (onsets-of ps)) bars (:bars st) meter (or (:meter st) (meter-of (count ps)))\n rtm (merge {:shares (shares-of ps)} (or (:pm st) {}))\n bar (fn [i] (let [a (color-at rtm (* i k))]\n (if (zero? i) [:measure {:meter meter} [:rtm a]] [:measure [:rtm a]])))]\n {:rtm rtm :tree (into [:voice] (map bar (range bars)))}))\n ;; what goes out (the last first, as Max does): the measures (3), the pulses (2), the :rtm map (1), the tree (0)\n outs (fn [ps st] (let [r (rhythm ps st)] [[3 (measures ps)] [2 ps] [1 (:rtm r)] [0 (:tree r)]]))\n ;; a new state: sent when the rhythm, its bars or its meter are new (the same again changes nothing); a bang anyway\n settle (fn [st st2 always?]\n (let [ps (:pulses st2) key [ps (:bars st2) (:meter st2)]\n show (assoc (measures ps) :pulses ps)]\n (cond (empty? ps) {:state st2}\n (and (not always?) (= key (:sent st))) {:state st2 :show show}\n :else {:state (assoc st2 :sent key) :show show :out (outs ps st2)})))\n polar (fn [cx cy R i n] (let [a (* TAU (/ i n))] [(+ cx (* R (js/Math.sin a))) (- cy (* R (js/Math.cos a)))]))]\n {;; ── about ──\n :class \"necklace\"\n :license \"MPL-2.0\"\n :doc \"A cyclic rhythm on the circle and its geometry (Toussaint): k onsets among n pulses around a circle, time clockwise from the top — the same object as a pitch-class set on pcclock. A rhythm arrives as pulses (ones and zeros, as euclid's right outlet sends them), as intervals between onsets ([3 3 2]), as box notation (\\\"x..x..x.\\\"), as an :rtm map ({:shares [3 3 2]}, euclid's middle outlet), a tree with an :rtm, or {:onsets [0 3 6] :n 8}; it is drawn as a polygon, with its axes of mirror symmetry. Pressing a pulse (or a number, its index) adds or takes away an onset. :complement swaps onsets and silences, [:rotate 1] starts it a pulse later, [:n 12] makes the circle longer or shorter, :clear empties it, [:bars 4] and [:meter \\\"3/4\\\"] as euclid, a bang sends it again. Out, as euclid: a musical tree (left: a bar of n pulses with an :rtm whose shares are the intervals between onsets), the :rtm map alone (1), the pulses (2); and its measures (3): {:n :k :onsets :intervals :ivec — how often each distance occurs —, :evenness — the sum of the chords between all pairs (Block and Douthett) —, :even — that sum against the Euclidean rhythm's, 1 as even as it —, :deep — each distance a different number of times —, :flat — each once —, :axes — of mirror symmetry, in pulses —, :gap — the longest interval —, :oddity — no two onsets halving the cycle —, :euclid — the rotation of E(k,n) it is, or nil —, :fourier and :phases — its Fourier coefficients f1 … f⌊n/2⌋, magnitudes 0…1 and phases in degrees: |f1| near 0 balanced, |f_k| largest when maximally even —}; with the word fourier the magnitudes are drawn too, a bar each. Its right inlet (cold) takes the pitches the notes take in turn, as euclid's.\"\n :usage \"necklace [n 16] [bars 1] [midi] [fourier]\"\n :io [2 4]\n :size (fn [box] (if (fourier? (:args box)) [200 296] [200 240]))\n\n ;; ── arguments ──\n :args [[:n 16] [:bars 1] [:midi false] [:fourier false]]\n\n ;; ── logic ──\n :receive (fn [{:keys [inlet value state args]}]\n (let [st (or state {:pulses (vec (repeat (max 1 (js/Math.round (or (:n args) 16))) 0))\n :bars (api/clamp (js/Math.round (or (:bars args) 1)) 1 64) :meter nil :pm nil})\n ps (:pulses st) n (count ps)\n to (fn [m] (settle st (merge st m) false))\n toggle (fn [i] (let [i (mod (js/Math.round i) n)] (to {:pulses (update ps i (fn [x] (- 1 x)))})))]\n (if (= inlet 1)\n (let [pm (pitches-of (:midi args) value)]\n (if (= pm :ignore) {} {:state (assoc st :pm pm)}))\n (cond\n (#{:bang} value) (settle st st true)\n (#{:clear} value) (to {:pulses (vec (repeat n 0))})\n (#{:complement} value) (to {:pulses (mapv (fn [x] (- 1 x)) ps)})\n (number? value) (toggle value)\n (and (vector? value) (= :pressed (first value)) (number? (second value))) (toggle (second value))\n (and (vector? value) (= :rotate (first value)) (number? (second value))) (to {:pulses (rotate ps (js/Math.round (second value)))})\n (and (vector? value) (= :n (first value)) (number? (second value)))\n (let [m (api/clamp (js/Math.round (second value)) 1 128)]\n (to {:pulses (vec (take m (concat ps (repeat 0))))}))\n (and (vector? value) (= :bars (first value)) (number? (second value))) (to {:bars (api/clamp (js/Math.round (second value)) 1 64)})\n (and (vector? value) (= :meter (first value))) (to {:meter (meter-arg (second value))})\n :else (if-let [p (or (pulses-of-list value) (pulses-of value))]\n (to {:pulses p})\n {})))))\n ;; pressing a pulse adds or takes away an onset (sent once, on release)\n :gesture (fn [{:keys [up hit]}] (when (and up (number? hit)) [:pressed hit]))\n\n ;; ── view ──\n :draw (fn [{:keys [shown w h args]}]\n (let [p (or shown (let [ps (vec (repeat (max 1 (js/Math.round (or (:n args) 16))) 0))] (assoc (measures ps) :pulses ps)))\n n (:n p) ps (:pulses p) os (:onsets p)\n fh (if (:fourier args) 60 0)\n cx (/ w 2) cy (/ (- h 44 fh) 2) R (- (min cx cy) 16)\n r (cond (> n 32) 2.2 (> n 16) 3 :else 4.5)\n flags (remove nil? [(str \"even \" (:even p))\n (let [a (count (:axes p))] (case a 0 \"asymmetric\" 1 \"1 axis\" (str a \" axes\")))\n (when (:deep p) \"deep\") (when (:flat p) \"flat\")\n (when (and (even? n) (:oddity p) (pos? (:k p))) \"oddity\")\n (when (:euclid p) (str \"E(\" (:k p) \",\" n \")\" (when (pos? (:euclid p)) (str \" ↻\" (:euclid p)))))])]\n (concat\n [[:circle {:cx cx :cy cy :r R :stroke :grid}]]\n (let [[x1 y1] (polar cx cy (- R 9) 0 n) [x2 y2] (polar cx cy (+ R 9) 0 n)]\n [[:line {:x1 x1 :y1 y1 :x2 x2 :y2 y2 :stroke :kairos :weight 1.5 :opacity 0.8}]])\n ;; the axes of symmetry, across the circle\n (for [a (:axes p)]\n (let [[x1 y1] (polar cx cy (+ R 7) a n) [x2 y2] (polar cx cy (+ R 7) (+ a (/ n 2)) n)]\n [:line {:x1 x1 :y1 y1 :x2 x2 :y2 y2 :stroke :kairos :weight 1 :opacity 0.5}]))\n (when (> (count os) 1) [[:path {:points (mapv (fn [i] (polar cx cy R i n)) os) :closed true :stroke :accent :weight 2}]])\n (for [i (range n)]\n (let [[x y] (polar cx cy R i n) on (= 1 (nth ps i 0))]\n [:group {:hit i}\n [[:circle {:cx x :cy y :r (if on (+ r 1.5) r) :fill (if on :accent :bg) :stroke (if on :accent :soft)}]]]))\n ;; the Fourier magnitudes, a bar each (f1 … f⌊n/2⌋), above the texts\n (when (:fourier args)\n (let [fs (or (:fourier p) []) m (count fs) bw (if (pos? m) (/ (- w 20) m) 0) base (- h 52)]\n (concat\n [[:line {:x1 10 :y1 base :x2 (- w 10) :y2 base :stroke :grid}]]\n (for [[j f] (map-indexed vector fs)]\n [:rect {:x (+ 10 (* j bw) 1) :y (- base (* 36 f)) :w (max 1 (- bw 2)) :h (* 36 f)\n :fill (if (= (inc j) (:k p)) :kairos :accent) :opacity 0.8}])\n (when (<= m 16)\n (for [j (range m)]\n [:text {:x (+ 10 (* j bw) (/ bw 2)) :y (+ base 9) :anchor :middle :size 7 :fill :soft} (str (inc j))])))))\n [[:text {:x cx :y (- h 29) :anchor :middle :size 10 :fill :ink}\n (str (:k p) \"/\" n \" · \" (if (seq (:intervals p)) (apply str (interpose \"-\" (:intervals p))) \"silence\"))]\n [:text {:x cx :y (- h 16) :anchor :middle :size 9 :fill :soft} (str \"<\" (apply str (interpose \" \" (:ivec p))) \">\")]\n [:text {:x cx :y (- h 3) :anchor :middle :size 9 :fill :soft} (apply str (interpose \" · \" flags))]])))})\n"
32
+ },
33
+ {
34
+ "class": "swap",
35
+ "license": "MPL-2.0",
36
+ "doc": "How far apart two rhythms are (Toussaint's swap distance). Both inlets take pulses of n pulses (euclid's, a necklace's outlet 2): the left one is compared with the right one, the reference (cold). A swap exchanges an onset and the silence beside it; the swap distance is how many turn one rhythm into the other — an onset moved far counts more than one moved near, as the Hamming distance (how many pulses differ) cannot tell. With different numbers of onsets, the directed swap distance (each onset of the shorter rhythm to its own of the other). Out, a map: {:swap — in the bar —, :circular — a swap may cross the end of the bar —, :necklace — the best over every rotation of the reference — and :rotation, the one that gives it, :hamming and :necklace-hamming, :n, :k [onsets of each]}. Rhythms of different lengths are not compared. A bang compares again.",
37
+ "source": ";; swap · how far apart two rhythms are (Toussaint's swap distance)\n;; Part of @kairotic/rhythm. Written against the Kairotic API (api/…).\n;; Two rhythms of n pulses, as pulses. A swap exchanges an onset and the silence beside it, and the swap\n;; distance is how many of them turn one rhythm into the other: an onset moved far counts more than one moved\n;; near, which the Hamming distance (how many pulses differ) cannot tell. With the same number of onsets it\n;; is the sum of |uᵢ − vᵢ| over the onsets in order; with different numbers, the directed swap distance (each\n;; onset of the shorter rhythm goes to its own onset of the other, the least moving in all). Around the circle\n;; a swap may cross the end of the bar; as necklaces, the rhythms are also compared at every rotation (the\n;; one that brings them closest is said). For the futuribles and the agents: is a variation still the same\n;; timeline? Both inlets take pulses (euclid's, a necklace's outlet 2); the left one compares, the right one\n;; is the reference (cold).\n(let [onsets-of (fn [ps] (vec (keep-indexed (fn [i x] (when (= 1 x) i)) ps)))\n rotate (fn [xs r] (let [n (count xs)] (if (zero? n) xs (let [r (mod r n)] (vec (concat (subvec xs r) (subvec xs 0 r)))))))\n pulses? (fn [v] (and (sequential? v) (seq v) (every? #{0 1} v)))\n cdist (fn [n a b] (let [d (js/Math.abs (- a b))] (min d (- n d))))\n ;; onsets in order, each of the shorter list to its own of the longer one, the least moving in all\n ;; (dynamic programming over both lists: the directed swap distance; with equal lengths, Σ|uᵢ − vᵢ|)\n assign (fn [d us vs]\n (let [[a b] (if (<= (count us) (count vs)) [us vs] [vs us]) p (count a) q (count b)]\n (cond (zero? p) 0\n :else (loop [i 0 row (vec (repeat (inc q) 0))]\n (if (= i p)\n (peek row)\n (recur (inc i)\n (reduce (fn [nr j]\n (conj nr (min (if (> j (inc i)) (peek nr) js/Infinity)\n (+ (nth row (dec j)) (d (nth a i) (nth b (dec j)))))))\n [js/Infinity] (range 1 (inc q)))))))))\n linear (fn [A B] (assign (fn [x y] (js/Math.abs (- x y))) (onsets-of A) (onsets-of B)))\n ;; around the circle: with as many onsets, the best cyclic shift of the pairing; otherwise the best place\n ;; to cut the circle open\n circular (fn [A B]\n (let [n (count A) us (onsets-of A) vs (onsets-of B) k (count us)]\n (cond (or (empty? us) (empty? vs)) (if (= (count us) (count vs)) 0 nil)\n (= k (count vs)) (apply min (for [s (range k)] (reduce + (map (fn [i] (cdist n (nth us i) (nth vs (mod (+ i s) k)))) (range k)))))\n :else (apply min (for [c (range n)]\n (assign (fn [x y] (cdist n x y)) (onsets-of (rotate A c)) (onsets-of (rotate B c))))))))\n hamming (fn [A B] (count (filter false? (map = A B))))\n compare-them (fn [A B]\n (let [n (count A) ka (count (onsets-of A)) kb (count (onsets-of B))\n ;; a rhythm without onsets is not far from another one by swaps: only from silence\n none? (and (or (zero? ka) (zero? kb)) (not= ka kb))\n rs (vec (for [r (range n)] (circular A (rotate B r))))\n best (when-not none? (apply min rs))\n hs (vec (for [r (range n)] (hamming A (rotate B r))))]\n {:n n :k [ka kb]\n :swap (when-not none? (linear A B)) :circular (when-not none? (circular A B))\n :necklace best :rotation (when best (first (keep-indexed (fn [r x] (when (= x best) r)) rs)))\n :hamming (hamming A B) :necklace-hamming (apply min hs)}))]\n {;; ── about ──\n :class \"swap\"\n :license \"MPL-2.0\"\n :doc \"How far apart two rhythms are (Toussaint's swap distance). Both inlets take pulses of n pulses (euclid's, a necklace's outlet 2): the left one is compared with the right one, the reference (cold). A swap exchanges an onset and the silence beside it; the swap distance is how many turn one rhythm into the other — an onset moved far counts more than one moved near, as the Hamming distance (how many pulses differ) cannot tell. With different numbers of onsets, the directed swap distance (each onset of the shorter rhythm to its own of the other). Out, a map: {:swap — in the bar —, :circular — a swap may cross the end of the bar —, :necklace — the best over every rotation of the reference — and :rotation, the one that gives it, :hamming and :necklace-hamming, :n, :k [onsets of each]}. Rhythms of different lengths are not compared. A bang compares again.\"\n :usage \"swap\"\n :io [2 1]\n\n ;; ── logic ──\n :receive (fn [{:keys [inlet value state]}]\n (let [st (or state {})]\n (cond\n (= inlet 1) (if (pulses? value) {:state (assoc st :ref (vec value))} {})\n (and (#{:bang} value) (:a st)) (let [A (:a st) B (:ref st)]\n (if (and B (= (count A) (count B))) {:out [[0 (compare-them A B)]]} {}))\n (pulses? value) (let [A (vec value) B (:ref st)]\n (cond (nil? B) {:state (assoc st :a A) :show \"no reference yet (right inlet)\"}\n (not= (count A) (count B)) {:state (assoc st :a A) :show (str (count A) \" pulses against \" (count B) \": not compared\")}\n :else (let [m (compare-them A B)]\n {:state (assoc st :a A) :show (str \"swap \" (:swap m) \" · necklace \" (:necklace m)) :out [[0 m]]})))\n :else {})))})\n"
20
38
  }
21
39
  ]
22
40
  };
package/dist/necklace.mjs CHANGED
@@ -1,7 +1,7 @@
1
1
  // Generated by packages/build.mjs from src/necklace.cljs
2
2
  export default {
3
3
  "class": "necklace",
4
- "version": "0.2.0",
4
+ "version": "0.3.0",
5
5
  "author": "bonuoq",
6
6
  "license": "MPL-2.0",
7
7
  "doc": "A cyclic rhythm on the circle and its geometry (Toussaint): k onsets among n pulses around a circle, time clockwise from the top — the same object as a pitch-class set on pcclock. A rhythm arrives as pulses (ones and zeros, as euclid's right outlet sends them), as intervals between onsets ([3 3 2]), as box notation (\"x..x..x.\"), as an :rtm map ({:shares [3 3 2]}, euclid's middle outlet), a tree with an :rtm, or {:onsets [0 3 6] :n 8}; it is drawn as a polygon, with its axes of mirror symmetry. Pressing a pulse (or a number, its index) adds or takes away an onset. :complement swaps onsets and silences, [:rotate 1] starts it a pulse later, [:n 12] makes the circle longer or shorter, :clear empties it, [:bars 4] and [:meter \"3/4\"] as euclid, a bang sends it again. Out, as euclid: a musical tree (left: a bar of n pulses with an :rtm whose shares are the intervals between onsets), the :rtm map alone (1), the pulses (2); and its measures (3): {:n :k :onsets :intervals :ivec — how often each distance occurs —, :evenness — the sum of the chords between all pairs (Block and Douthett) —, :even — that sum against the Euclidean rhythm's, 1 as even as it —, :deep — each distance a different number of times —, :flat — each once —, :axes — of mirror symmetry, in pulses —, :gap — the longest interval —, :oddity — no two onsets halving the cycle —, :euclid — the rotation of E(k,n) it is, or nil —, :fourier and :phases — its Fourier coefficients f1 … f⌊n/2⌋, magnitudes 0…1 and phases in degrees: |f1| near 0 balanced, |f_k| largest when maximally even —}; with the word fourier the magnitudes are drawn too, a bar each. Its right inlet (cold) takes the pitches the notes take in turn, as euclid's.",
package/dist/swap.mjs ADDED
@@ -0,0 +1,9 @@
1
+ // Generated by packages/build.mjs from src/swap.cljs
2
+ export default {
3
+ "class": "swap",
4
+ "version": "0.3.0",
5
+ "author": "bonuoq",
6
+ "license": "MPL-2.0",
7
+ "doc": "How far apart two rhythms are (Toussaint's swap distance). Both inlets take pulses of n pulses (euclid's, a necklace's outlet 2): the left one is compared with the right one, the reference (cold). A swap exchanges an onset and the silence beside it; the swap distance is how many turn one rhythm into the other — an onset moved far counts more than one moved near, as the Hamming distance (how many pulses differ) cannot tell. With different numbers of onsets, the directed swap distance (each onset of the shorter rhythm to its own of the other). Out, a map: {:swap — in the bar —, :circular — a swap may cross the end of the bar —, :necklace — the best over every rotation of the reference — and :rotation, the one that gives it, :hamming and :necklace-hamming, :n, :k [onsets of each]}. Rhythms of different lengths are not compared. A bang compares again.",
8
+ "source": ";; swap · how far apart two rhythms are (Toussaint's swap distance)\n;; Part of @kairotic/rhythm. Written against the Kairotic API (api/…).\n;; Two rhythms of n pulses, as pulses. A swap exchanges an onset and the silence beside it, and the swap\n;; distance is how many of them turn one rhythm into the other: an onset moved far counts more than one moved\n;; near, which the Hamming distance (how many pulses differ) cannot tell. With the same number of onsets it\n;; is the sum of |uᵢ − vᵢ| over the onsets in order; with different numbers, the directed swap distance (each\n;; onset of the shorter rhythm goes to its own onset of the other, the least moving in all). Around the circle\n;; a swap may cross the end of the bar; as necklaces, the rhythms are also compared at every rotation (the\n;; one that brings them closest is said). For the futuribles and the agents: is a variation still the same\n;; timeline? Both inlets take pulses (euclid's, a necklace's outlet 2); the left one compares, the right one\n;; is the reference (cold).\n(let [onsets-of (fn [ps] (vec (keep-indexed (fn [i x] (when (= 1 x) i)) ps)))\n rotate (fn [xs r] (let [n (count xs)] (if (zero? n) xs (let [r (mod r n)] (vec (concat (subvec xs r) (subvec xs 0 r)))))))\n pulses? (fn [v] (and (sequential? v) (seq v) (every? #{0 1} v)))\n cdist (fn [n a b] (let [d (js/Math.abs (- a b))] (min d (- n d))))\n ;; onsets in order, each of the shorter list to its own of the longer one, the least moving in all\n ;; (dynamic programming over both lists: the directed swap distance; with equal lengths, Σ|uᵢ − vᵢ|)\n assign (fn [d us vs]\n (let [[a b] (if (<= (count us) (count vs)) [us vs] [vs us]) p (count a) q (count b)]\n (cond (zero? p) 0\n :else (loop [i 0 row (vec (repeat (inc q) 0))]\n (if (= i p)\n (peek row)\n (recur (inc i)\n (reduce (fn [nr j]\n (conj nr (min (if (> j (inc i)) (peek nr) js/Infinity)\n (+ (nth row (dec j)) (d (nth a i) (nth b (dec j)))))))\n [js/Infinity] (range 1 (inc q)))))))))\n linear (fn [A B] (assign (fn [x y] (js/Math.abs (- x y))) (onsets-of A) (onsets-of B)))\n ;; around the circle: with as many onsets, the best cyclic shift of the pairing; otherwise the best place\n ;; to cut the circle open\n circular (fn [A B]\n (let [n (count A) us (onsets-of A) vs (onsets-of B) k (count us)]\n (cond (or (empty? us) (empty? vs)) (if (= (count us) (count vs)) 0 nil)\n (= k (count vs)) (apply min (for [s (range k)] (reduce + (map (fn [i] (cdist n (nth us i) (nth vs (mod (+ i s) k)))) (range k)))))\n :else (apply min (for [c (range n)]\n (assign (fn [x y] (cdist n x y)) (onsets-of (rotate A c)) (onsets-of (rotate B c))))))))\n hamming (fn [A B] (count (filter false? (map = A B))))\n compare-them (fn [A B]\n (let [n (count A) ka (count (onsets-of A)) kb (count (onsets-of B))\n ;; a rhythm without onsets is not far from another one by swaps: only from silence\n none? (and (or (zero? ka) (zero? kb)) (not= ka kb))\n rs (vec (for [r (range n)] (circular A (rotate B r))))\n best (when-not none? (apply min rs))\n hs (vec (for [r (range n)] (hamming A (rotate B r))))]\n {:n n :k [ka kb]\n :swap (when-not none? (linear A B)) :circular (when-not none? (circular A B))\n :necklace best :rotation (when best (first (keep-indexed (fn [r x] (when (= x best) r)) rs)))\n :hamming (hamming A B) :necklace-hamming (apply min hs)}))]\n {;; ── about ──\n :class \"swap\"\n :license \"MPL-2.0\"\n :doc \"How far apart two rhythms are (Toussaint's swap distance). Both inlets take pulses of n pulses (euclid's, a necklace's outlet 2): the left one is compared with the right one, the reference (cold). A swap exchanges an onset and the silence beside it; the swap distance is how many turn one rhythm into the other — an onset moved far counts more than one moved near, as the Hamming distance (how many pulses differ) cannot tell. With different numbers of onsets, the directed swap distance (each onset of the shorter rhythm to its own of the other). Out, a map: {:swap — in the bar —, :circular — a swap may cross the end of the bar —, :necklace — the best over every rotation of the reference — and :rotation, the one that gives it, :hamming and :necklace-hamming, :n, :k [onsets of each]}. Rhythms of different lengths are not compared. A bang compares again.\"\n :usage \"swap\"\n :io [2 1]\n\n ;; ── logic ──\n :receive (fn [{:keys [inlet value state]}]\n (let [st (or state {})]\n (cond\n (= inlet 1) (if (pulses? value) {:state (assoc st :ref (vec value))} {})\n (and (#{:bang} value) (:a st)) (let [A (:a st) B (:ref st)]\n (if (and B (= (count A) (count B))) {:out [[0 (compare-them A B)]]} {}))\n (pulses? value) (let [A (vec value) B (:ref st)]\n (cond (nil? B) {:state (assoc st :a A) :show \"no reference yet (right inlet)\"}\n (not= (count A) (count B)) {:state (assoc st :a A) :show (str (count A) \" pulses against \" (count B) \": not compared\")}\n :else (let [m (compare-them A B)]\n {:state (assoc st :a A) :show (str \"swap \" (:swap m) \" · necklace \" (:necklace m)) :out [[0 m]]})))\n :else {})))})\n"
9
+ };
package/package.json CHANGED
@@ -1,7 +1,7 @@
1
1
  {
2
2
  "name": "@kairotic/rhythm",
3
- "version": "0.2.0",
4
- "description": "Kairotic rhythm as geometry (after Toussaint): necklace, the rhythm box (a cyclic rhythm on the circle: drawn, edited, measured — interval vector, evenness, deep, flat, axes of symmetry, oddity, Fourier coefficients — and written as a musical tree whose :rtm merges with any pitches); and euclid, a generator of Euclidean rhythms as pulses",
3
+ "version": "0.3.0",
4
+ "description": "Kairotic rhythm as geometry (after Toussaint): necklace, the rhythm box (a cyclic rhythm on the circle: drawn, edited, measured — interval vector, evenness, deep, flat, axes of symmetry, oddity, Fourier coefficients — and written as a musical tree whose :rtm merges with any pitches); generators of pulses (euclid, chance, homometric); and swap, how far apart two rhythms are",
5
5
  "author": "bonuoq",
6
6
  "license": "MPL-2.0",
7
7
  "repository": {
@@ -38,6 +38,8 @@
38
38
  "interval vector",
39
39
  "talea",
40
40
  "isorhythm",
41
- "fourier"
41
+ "fourier",
42
+ "swap distance",
43
+ "homometric"
42
44
  ]
43
45
  }
@@ -0,0 +1,48 @@
1
+ ;; chance · k onsets among n pulses, drawn with a seed
2
+ ;; Part of @kairotic/rhythm. Written against the Kairotic API (api/…).
3
+ ;; A generator of pulses, as euclid is, with chance instead of evenness: each bang draws another rhythm of k
4
+ ;; onsets among n pulses. The draws are the seed's: draw i of seed s is always the same rhythm, so the same
5
+ ;; seed plays the same game for everyone in a room and again from the history (:reset starts its draws
6
+ ;; again). Against euclid's, a necklace's measures say how even or uneven chance came out.
7
+ (let [M 2147483647
8
+ ;; Park–Miller, started from the seed and the number of the draw, a few turns to mix them
9
+ rng (fn [seed i]
10
+ (let [s (volatile! (inc (mod (+ (* 7919 (js/Math.abs (js/Math.round seed))) (* 104729 i) 12345) (dec M))))]
11
+ (dotimes [_ 4] (vreset! s (mod (* @s 16807) M)))
12
+ (fn [] (vreset! s (mod (* @s 16807) M)) (/ (dec @s) (dec M)))))
13
+ ;; k of the n pulses, as a shuffle stopped after k (Fisher–Yates)
14
+ draw (fn [k n seed i]
15
+ (let [r (rng seed i)
16
+ picked (loop [xs (vec (range n)) j 0]
17
+ (if (= j k) (set (subvec xs 0 k))
18
+ (let [m (+ j (js/Math.floor (* (r) (- n j)))) xj (nth xs j) xm (nth xs m)]
19
+ (recur (assoc xs j xm m xj) (inc j)))))]
20
+ (mapv (fn [p] (if (picked p) 1 0)) (range n))))
21
+ params (fn [args over]
22
+ (let [o (merge args over)
23
+ n (api/clamp (js/Math.round (or (:n o) 8)) 1 128)]
24
+ {:n n :k (api/clamp (js/Math.round (or (:k o) 3)) 0 n) :seed (or (:seed o) 1)}))]
25
+ {;; ── about ──
26
+ :class "chance"
27
+ :license "MPL-2.0"
28
+ :doc "A generator of pulses, as euclid, with chance instead of evenness: each bang draws another rhythm of k onsets among n pulses, sent as pulses (ones and zeros) for a necklace. The draws are the seed's — the same seed, the same rhythms in the same order, for everyone in a room and again from the history; :reset starts its draws again. [:k 5], [:n 16], [:seed 7] (or a map of them) change it and start again; a number is k."
29
+ :usage "chance [k 3] [n 8] [seed 1]"
30
+ :io [1 1]
31
+
32
+ ;; ── arguments ──
33
+ :args [[:k 3] [:n 8] [:seed 1]]
34
+
35
+ ;; ── logic ──
36
+ :receive (fn [{:keys [value state args]}]
37
+ (let [st (or state {:over {} :i 0})
38
+ again (fn [over] {:state {:over over :i 0} :show (let [p (params args over)] (str (:k p) "/" (:n p) " · seed " (:seed p)))})]
39
+ (cond
40
+ (#{:bang} value) (let [p (params args (:over st)) i (:i st)]
41
+ {:state (assoc st :i (inc i)) :show (str (:k p) "/" (:n p) " · seed " (:seed p) " · draw " (inc i))
42
+ :out [[0 (draw (:k p) (:n p) (:seed p) i)]]})
43
+ (#{:reset} value) (again (:over st))
44
+ (number? value) (again (assoc (:over st) :k value))
45
+ (and (vector? value) (= 2 (count value)) (#{:k :n :seed} (first value)) (number? (second value)))
46
+ (again (assoc (:over st) (first value) (second value)))
47
+ (map? value) (again (merge (:over st) (select-keys value [:k :n :seed])))
48
+ :else {})))})
@@ -0,0 +1,56 @@
1
+ ;; homometric · the other rhythms with the same interval vector
2
+ ;; Part of @kairotic/rhythm. Written against the Kairotic API (api/…).
3
+ ;; Two rhythms are homometric when they hold the same distances between onsets, as many times each — the
4
+ ;; same interval vector, the same "histogram" — without being the same necklace turned or seen in a mirror
5
+ ;; (Toussaint, after crystallography: Patterson, Rosenblatt and Seymour). The two flat rhythms of four onsets
6
+ ;; in twelve are homometric; so is any half of the pulses of an even cycle with its complement, which gives two
7
+ ;; drums (high and low congas) the same intervals. Given a rhythm as pulses, it searches every rhythm of as many
8
+ ;; onsets among as many pulses (up to 7 000 of them: any rhythm of 16 pulses; a moment for the largest) and sends the others it finds, each from its first onset, as a list of
9
+ ;; pulses (for nth, or a necklace one by one), and how many there are.
10
+ (let [onsets-of (fn [ps] (vec (keep-indexed (fn [i x] (when (= 1 x) i)) ps)))
11
+ pulses? (fn [v] (and (sequential? v) (seq v) (every? #{0 1} v)))
12
+ dist (fn [n a b] (let [d (js/Math.abs (- a b))] (min d (- n d))))
13
+ ivec-of (fn [n os] (let [c (frequencies (for [i (range (count os)) j (range (inc i) (count os))] (dist n (nth os i) (nth os j))))]
14
+ (mapv (fn [d] (get c d 0)) (range 1 (inc (quot n 2))))))
15
+ ;; a necklace up to rotation and mirror, as its smallest form starting at 0 (a bracelet)
16
+ bracelet (fn [n os]
17
+ (first (sort (for [f [identity (fn [x] (mod (- n x) n))] r (range n)]
18
+ (vec (sort (map (fn [x] (mod (- (f x) r) n)) os)))))))
19
+ ;; the subsets of 1…n−1 of size m (0 is always an onset: rotations are the same necklace)
20
+ subsets (fn subsets [from n m]
21
+ (cond (zero? m) [[]]
22
+ (> m (- n from)) []
23
+ :else (concat (map (fn [s] (cons from s)) (subsets (inc from) n (dec m))) (subsets (inc from) n m))))
24
+ ;; how many rhythms the search goes through: C(n−1, k−1)
25
+ choose (fn [a b] (reduce (fn [acc i] (/ (* acc (- a i)) (inc i))) 1 (range (min b (- a b)))))
26
+ limit 7000
27
+ search (fn [ps]
28
+ (let [n (count ps) os (onsets-of ps) k (count os) target (ivec-of n os) own (bracelet n os)]
29
+ (if (zero? k) []
30
+ (->> (subsets 1 n (dec k))
31
+ (map (fn [s] (vec (cons 0 s))))
32
+ (filter (fn [o] (= target (ivec-of n o))))
33
+ (map (fn [o] (bracelet n o)))
34
+ distinct
35
+ (remove (fn [b] (= b own)))
36
+ sort
37
+ (mapv (fn [b] (let [on (set b)] (mapv (fn [i] (if (on i) 1 0)) (range n)))))))))]
38
+ {;; ── about ──
39
+ :class "homometric"
40
+ :license "MPL-2.0"
41
+ :doc "The other rhythms with the same interval vector (Toussaint, after crystallography): homometric rhythms hold the same distances between onsets, as many times each, without being the same necklace turned or in a mirror — the two flat rhythms of four onsets in twelve; any half of the pulses of an even cycle and its complement, two drums with the same intervals. Given pulses, it searches every rhythm of as many onsets among as many pulses (when they are at most 7 000: any rhythm of 16 pulses) and sends the others it finds, each from its first onset, as a list of pulses (left: for nth, or one by one to a necklace) and how many there are (right); none, an empty list. A bang searches again."
42
+ :usage "homometric"
43
+ :io [1 2]
44
+
45
+ ;; ── logic ──
46
+ :receive (fn [{:keys [value state]}]
47
+ (let [st (or state {})
48
+ go (fn [ps] (if (> (choose (dec (count ps)) (max 0 (dec (count (onsets-of ps))))) limit)
49
+ {:state (assoc st :ps ps) :show (str "too many to search (more than " limit " rhythms)")}
50
+ (let [hs (search ps)]
51
+ {:state (assoc st :ps ps) :show (str (count hs) " homometric")
52
+ :out [[1 (count hs)] [0 hs]]})))]
53
+ (cond
54
+ (and (#{:bang} value) (:ps st)) (go (:ps st))
55
+ (pulses? value) (if (= (vec value) (:ps st)) {:state st} (go (vec value)))
56
+ :else {})))})
package/src/swap.cljs ADDED
@@ -0,0 +1,69 @@
1
+ ;; swap · how far apart two rhythms are (Toussaint's swap distance)
2
+ ;; Part of @kairotic/rhythm. Written against the Kairotic API (api/…).
3
+ ;; Two rhythms of n pulses, as pulses. A swap exchanges an onset and the silence beside it, and the swap
4
+ ;; distance is how many of them turn one rhythm into the other: an onset moved far counts more than one moved
5
+ ;; near, which the Hamming distance (how many pulses differ) cannot tell. With the same number of onsets it
6
+ ;; is the sum of |uᵢ − vᵢ| over the onsets in order; with different numbers, the directed swap distance (each
7
+ ;; onset of the shorter rhythm goes to its own onset of the other, the least moving in all). Around the circle
8
+ ;; a swap may cross the end of the bar; as necklaces, the rhythms are also compared at every rotation (the
9
+ ;; one that brings them closest is said). For the futuribles and the agents: is a variation still the same
10
+ ;; timeline? Both inlets take pulses (euclid's, a necklace's outlet 2); the left one compares, the right one
11
+ ;; is the reference (cold).
12
+ (let [onsets-of (fn [ps] (vec (keep-indexed (fn [i x] (when (= 1 x) i)) ps)))
13
+ rotate (fn [xs r] (let [n (count xs)] (if (zero? n) xs (let [r (mod r n)] (vec (concat (subvec xs r) (subvec xs 0 r)))))))
14
+ pulses? (fn [v] (and (sequential? v) (seq v) (every? #{0 1} v)))
15
+ cdist (fn [n a b] (let [d (js/Math.abs (- a b))] (min d (- n d))))
16
+ ;; onsets in order, each of the shorter list to its own of the longer one, the least moving in all
17
+ ;; (dynamic programming over both lists: the directed swap distance; with equal lengths, Σ|uᵢ − vᵢ|)
18
+ assign (fn [d us vs]
19
+ (let [[a b] (if (<= (count us) (count vs)) [us vs] [vs us]) p (count a) q (count b)]
20
+ (cond (zero? p) 0
21
+ :else (loop [i 0 row (vec (repeat (inc q) 0))]
22
+ (if (= i p)
23
+ (peek row)
24
+ (recur (inc i)
25
+ (reduce (fn [nr j]
26
+ (conj nr (min (if (> j (inc i)) (peek nr) js/Infinity)
27
+ (+ (nth row (dec j)) (d (nth a i) (nth b (dec j)))))))
28
+ [js/Infinity] (range 1 (inc q)))))))))
29
+ linear (fn [A B] (assign (fn [x y] (js/Math.abs (- x y))) (onsets-of A) (onsets-of B)))
30
+ ;; around the circle: with as many onsets, the best cyclic shift of the pairing; otherwise the best place
31
+ ;; to cut the circle open
32
+ circular (fn [A B]
33
+ (let [n (count A) us (onsets-of A) vs (onsets-of B) k (count us)]
34
+ (cond (or (empty? us) (empty? vs)) (if (= (count us) (count vs)) 0 nil)
35
+ (= k (count vs)) (apply min (for [s (range k)] (reduce + (map (fn [i] (cdist n (nth us i) (nth vs (mod (+ i s) k)))) (range k)))))
36
+ :else (apply min (for [c (range n)]
37
+ (assign (fn [x y] (cdist n x y)) (onsets-of (rotate A c)) (onsets-of (rotate B c))))))))
38
+ hamming (fn [A B] (count (filter false? (map = A B))))
39
+ compare-them (fn [A B]
40
+ (let [n (count A) ka (count (onsets-of A)) kb (count (onsets-of B))
41
+ ;; a rhythm without onsets is not far from another one by swaps: only from silence
42
+ none? (and (or (zero? ka) (zero? kb)) (not= ka kb))
43
+ rs (vec (for [r (range n)] (circular A (rotate B r))))
44
+ best (when-not none? (apply min rs))
45
+ hs (vec (for [r (range n)] (hamming A (rotate B r))))]
46
+ {:n n :k [ka kb]
47
+ :swap (when-not none? (linear A B)) :circular (when-not none? (circular A B))
48
+ :necklace best :rotation (when best (first (keep-indexed (fn [r x] (when (= x best) r)) rs)))
49
+ :hamming (hamming A B) :necklace-hamming (apply min hs)}))]
50
+ {;; ── about ──
51
+ :class "swap"
52
+ :license "MPL-2.0"
53
+ :doc "How far apart two rhythms are (Toussaint's swap distance). Both inlets take pulses of n pulses (euclid's, a necklace's outlet 2): the left one is compared with the right one, the reference (cold). A swap exchanges an onset and the silence beside it; the swap distance is how many turn one rhythm into the other — an onset moved far counts more than one moved near, as the Hamming distance (how many pulses differ) cannot tell. With different numbers of onsets, the directed swap distance (each onset of the shorter rhythm to its own of the other). Out, a map: {:swap — in the bar —, :circular — a swap may cross the end of the bar —, :necklace — the best over every rotation of the reference — and :rotation, the one that gives it, :hamming and :necklace-hamming, :n, :k [onsets of each]}. Rhythms of different lengths are not compared. A bang compares again."
54
+ :usage "swap"
55
+ :io [2 1]
56
+
57
+ ;; ── logic ──
58
+ :receive (fn [{:keys [inlet value state]}]
59
+ (let [st (or state {})]
60
+ (cond
61
+ (= inlet 1) (if (pulses? value) {:state (assoc st :ref (vec value))} {})
62
+ (and (#{:bang} value) (:a st)) (let [A (:a st) B (:ref st)]
63
+ (if (and B (= (count A) (count B))) {:out [[0 (compare-them A B)]]} {}))
64
+ (pulses? value) (let [A (vec value) B (:ref st)]
65
+ (cond (nil? B) {:state (assoc st :a A) :show "no reference yet (right inlet)"}
66
+ (not= (count A) (count B)) {:state (assoc st :a A) :show (str (count A) " pulses against " (count B) ": not compared")}
67
+ :else (let [m (compare-them A B)]
68
+ {:state (assoc st :a A) :show (str "swap " (:swap m) " · necklace " (:necklace m)) :out [[0 m]]})))
69
+ :else {})))})