From 3bd0e0389bd1712916a7ab8d40351e72c5cc8279 Mon Sep 17 00:00:00 2001 From: Bubobubobubobubo Date: Mon, 28 Aug 2023 15:44:02 +0000 Subject: [PATCH] deploy: 011be9f31dbd9e0420f4c2dd9655a374e2ccb94e --- assets/{index-26d72bf9.js => index-01b6919a.js} | 12 +++++++++++- index.html | 2 +- 2 files changed, 12 insertions(+), 2 deletions(-) rename assets/{index-26d72bf9.js => index-01b6919a.js} (99%) diff --git a/assets/index-26d72bf9.js b/assets/index-01b6919a.js similarity index 99% rename from assets/index-26d72bf9.js rename to assets/index-01b6919a.js index eb59e54..fc7e9ba 100644 --- a/assets/index-26d72bf9.js +++ b/assets/index-01b6919a.js @@ -312,7 +312,17 @@ mod(.25) && euclid($(4), 7, 9, 1) && snd('hh').out() `,!1)} - +- rhythm(divisor: number, pulses: number, length: number, rotate: number): boolean: generates true or false values from an euclidian rhythm sequence. This is another version of euclid that does not take an iterator. +${t("rhythm is a beginner friendly rhythmic function!",` +let speed = [0.5, 0.25].div(8); +rhythm(speed, 5, 12) :: snd('east').n(2).out() +rhythm(speed, 2, 12) :: snd('east').out() +rhythm(speed, 3, 12) :: snd('east').n(4).out() +rhythm(speed, 7, 12) :: snd('east').n(9).out() +`,!0)} + + + - bin(iterator: number, n: number): boolean: a binary rhythm generator. It transforms the given number into its binary representation (_e.g_ 34 becomes 100010). It then returns a boolean value based on the iterator in order to generate a rhythm. ${t("Change the integers for a surprise rhythm!",` diff --git a/index.html b/index.html index f314a84..7191dbf 100644 --- a/index.html +++ b/index.html @@ -6,7 +6,7 @@ Topos - +