On Sat, Apr 17, 2010 at 04:50:02PM +0200, Matteo Sisti Sette wrote:
Matteo Sisti Sette escribió:
So my question is which of these is true: A) there is always a one-block latency between a s~ and a corresponding r~ B) there _can_ be a latency, depending on the execution order Pd choses, and you can't know whether there will or won't be. C) there _can_ be a latency, but if there is no dsp loop on the graph, then you can be sure there won't be any avoidable latency due to execution order.
Ok I did some tests and it seems the answer is (A)
No, not always. Attached are two versions of your patch that have zero delay over three s~/r~.
*-sorted.pd uses explicit sorting, *-moved.pd exploits the current implementation of sorting, Pd does. Don't edit and save the second one, it may "break" again.
Ciao
Frank