[PD] speed

michael strohmann itsnotfair9 at gmail.com
Fri Jan 11 13:20:22 CET 2019

ok, then there might be the problem.
i was thinking that [line] runs thru ALL the numbers in different speeds.

which, come to think of it, might be a problem if i ask it to run from 0 to 100000 in 10 ms.

so, what is the actually algotithm the [line] object is using?

> On 11 Jan 2019, at 12:30, IOhannes m zmölnig <zmoelnig at iem.at> wrote:
> On 1/11/19 12:09 PM, michael strohmann wrote:
>> HI, 
>> the attached patch demonstrates a speed issue, of which i am surprised to be an issue with modern computers.
>> It seems that the fastest time to count from 0 to 30 is 310 ms. 
> i don't see any counting in your patch.
> [line] is for interpolation between numbers over time. if you want to
> count, you should use [+].
>> If I go faster some numbers are omitted. 
>> (actually there are already some number drop outs, but 13 is still in - i was trying to detect CarriageReturns / ascii 13 in Serial communication)
>> There is probably a formula that takes vector size into account to compute the max. speed i can rely on.
>> Or maybe i there is a programming mistake?
> could you post an example that doesn't require externals (no cyclone)?
> gf,rdsa
> IOhannes
> _______________________________________________
> Pd-list at lists.iem.at mailing list
> UNSUBSCRIBE and account-management -> https://lists.puredata.info/listinfo/pd-list

More information about the Pd-list mailing list