I’ve been looking into smaller modules that can produce a wide range of rhythmic and tonal sequences and I have a concept to combine JDRaoul’s Euclidean Sequencer with @robertsyrett 's LFO Sequencer resulting in a very small number of controls with a large range if possible outputs. I’m in the very primitive stages of design, where I’m getting into the bones of the Eudlidean Sequencer and trying to manually recreate it and I have a few questions:
a) I’ve noticed that there’s a counter with the expression (x < 65535) * (x+1), and I was curious, what is the significance of 65535? Is it just an arbitrarily high reset value?
b) I understand that the clock input gets multiplied by an expression using the three length, offset, and hits controls but I’m wondering what exactly this expression results in? I’ve tried metering the output but can’t really discern what the behavior is other than it must result in a binary state that gates the clock.
c) If I was to use basic math nodes to recreate fract and floor functions (sounds silly but I have my reasons), how would I go about it? I understand what they do based on the descriptions in the documentation but can’t quite figure out how to implement them.
Yes I noticed that last year when I made a micro version of the Euclidean sequencer with a visual display – curious. Later when I added it to @RileyGuy’s uClidean Sarlaccs circular sequencer I replaced it with an updated reset counter – either from @RobertSyrett or from the library I think. I can’t remember the details but I think reset in the updated counter was more reliable. Here’s the thread on the old forum: http://forum-old.audulus.com/discussion/2425/euclidean-circles-clone/p1
One can definitely notice changes in programming styles/best practices when looking back through some of the older modules.
You can think of a * b as a mathematical operator but here it is working like an if/then/else statement. If the clock gate is high (which is a 1) and there is a hit on this step of our count (that’s also a 1) then it will output 1 (1 * 1) otherwise it will mute the clock gate (1 * 0).
There is probably a way, but you might want to hold off until you have your sequencer working probably, then you can start making it needlessly complicated.
I uploaded my current version of the Euclidean sequencer in my personal collection, which also has loop length instead of the count going up to the largest 16-bit integer.
The challenge you would have in trying to recreate the fact() and floor() functions is that all values in Audulus are 32 bit floating point numbers. You could probably come up with something using a sequence of mod() expressions for each power of 10 and conditionals, but it would likely be very CPU intensive compared to the native functions.
@stschoen I believe there was no reply, as that was seemingly a spam post.
LuckyPatcher is a free app of questionable origin (imo), which you can sideload on Android phones/tablets with super user capabilities and it provides the the ability to bypass licensing IAP’s on free trial apps that the user doesn’t wish to pay for. In many cases, it will unlock the full app without having to make payment to the hard working developers that were nice enough to create the app(s) in the first place.
Each of those links do not appear to have anything to do with the discussion, and I have flagged it as spam.
Edit: I probably look like an idiot, as I am here explaining a pirating tool to a dev who is probably very much aware of LP and its use.
I misread your reply to @lovelash as “not to be repetitive but, what does that mean?” and thought you were echoing the new user’s sentiments about the links in the post. Anyway, even though I am embarrassingly here explaining oil paint to an artist lol, I will leave it up for anyone else who may actually not know.