Hi,
Today a For-loop iterates the number of times that the smallest number of these specifies:
1) The N-input on the For-loop.
2) The smallest number of elements among auto-indexed arrays wired to the For-loop.
I sometimes want the For-loop to run longer than the smallest input array, while still needing to index through the smaller input arrays (resulting in a similar effect as when you run out of array elements when auto-indexing array inputs on a While-loop). Of course the smaller arrays will start outputting their default values when you move past their end, but some algorithms benefit from that. Today I have to do something like this (very simple example):
It would be much simpler to be able to auto-index any input array but then also select which tunnels shouldn't be taken into account when calculating N. You know, somehow being able to defeat or deactivate the indexing limit of some auto-indexed tunnels:
There might even be three modes of auto-indexed tunnels:
1) The usual mode as today.
2) An unlimited mode, as I suggest above, which will ouput the default value when running out of elements.
3) A recurring mode that would start over on the array when reaching its end (I think I've seen this mode suggested somewhere before?).
Thoughts?
Cheers,
Steen
You must be a registered user to add a comment. If you've already registered, sign in. Otherwise, register and sign in.