@JJLloyd Also on a general note i find it helpful to separate the code logic from the GUI. So i develop the code and then build the GUI separately. This also helps to avoid some bugs and inconsistencies in the code

Example: gop-demo.pd

A slight improvement in speed: This version uses [array] to store the indices. To create the chains, the array is combined with the end of the array and chains are taken directly from this combined array. The downside is that the structure of the source material that is in the indices cannot be looked at like it was with [text], but for practical purposes, this should not be an issue. Also some other slight improvements.

markov.zip

This is now in the public domain. Thanks again for the great collaboration!

Edit:
Some more slight improvements. Also i added the clipping of the order again, as i think it contributes positively to the user experience. It is explained in the help file and there is a message when the chains are being created, so it should be reasonable.

@cfry The math section of the FLOSS manual was broken for some time, this seems to work: https://en.flossmanuals.net/pure-data/_full/#math_1. Note that this information is very old and newer objects are not covert. Here are the help files the only good source i know.

@weightless This was stupid. I didn't specify the order. My patch is actually a bit slower...

I tested it and the process of creating the chains is now about 300 times faster

@weightless Sorry for answering so late, i didn't find the time earlier.

I implemented a new system to generate the chains by simply iterating over all indices. Not sure if this is more or less efficient, but it is very simple.

Chains are build from left (oldest) to right (newest).

This system has the slight benefit that the order is not limited. An order higher than the length of the material is nonsensical and results in the original progression being played without jumps, but is not considered to be an error by this system.

I also incorporated the state saving into the object, so it doesn't rely on any other external, and made a new help file.

markov.zip

I used some code from weightless patch that uses code from markowGenerator. So i assume that the GPL still applies to this code. The authors can always reissue the code. @weightless, @Jona, would you agree to release the code used in this patch into the public domain?

@cfry I made this queue abstraction that can possibly do what you want to achieve: https://forum.pdpatchrepo.info/topic/12170/queue-a-universal-first-in-first-out-fifo-queue-that-takes-symbols-floats-and-lists-vanilla

[queue] is a universal first-in, first-out (FIFO) queue, that takes symbols, floats and lists. It is all vanilla.

It uses [text] by simply writing new items to the end of the [text] and outputting and deleting the first line of the [text] if an item is retrieved.

Download: queue.zip

Help file:

Abstraction:

Edit: Added the option to retrieve the current size

@RetroMaximus Trigger is used to control the order of operations.

This is not good practice:

This is better:

Not good:

Better:

Not good:

Better:

Here is a variation that outputs the line numbers that are 1 instead: text-sequencer2.pd