[PD] [PD-dev] extremely fast pure pd [list-drip] (fwd)

[Hans-Christoph Steiner]

Sounds very cool.  Just out of curiosty, how did you measure the speed  
difference?  That would be a useful technic to know about for testing   
in general.

.hc

On Feb 25, 2009, at 11:43 AM, Mathieu Bouchard wrote:

>
> seems like it would fit better on this mailing-list.
>
> ---------- Forwarded message ----------
> Date: Wed, 25 Feb 2009 11:38:27 -0500 (EST)
> From: Mathieu Bouchard <matju at artengine.ca>
> To: Frank Barknecht <fbar at footils.org>
> Cc: pd-dev at iem.at
> Subject: [PD-dev] extremely fast pure pd [list-drip]
>
> On Wed, 25 Feb 2009, Frank Barknecht wrote:
>
>> such a standard library would define an *interface* for standard
>> objects. Where performance is an issue, the interface could  
>> alternatively
>> implemented with externals. This also is exemplified in [list]-abs,
>> where personally I use a version of [list-drip] that has zexy's  
>> [drip]
>> inside for speed reasons. It behaves exactly like the abstraction
>> version so it doesn't matter if people don't have zexy installed.
>
> i just made a pure-pd [list-drip] that is much much quicker for  
> large lists than your pure pd [list-drip].
>
> For a list of size 32768, I find it to be at least 250 times faster.
>
> For a list of size 4096, it's at least 24 times faster.
>
> See attachment.
>
> _ _ __ ___ _____ ________ _____________ _____________________ ...
> | Mathieu Bouchard - tél:+1.514.383.3801, Montréal, Québec<list-drip- 
> quick.pd>_______________________________________________
> Pd-list at iem.at mailing list
> UNSUBSCRIBE and account-management -> http://lists.puredata.info/listinfo/pd-list





----------------------------------------------------------------------------

Programs should be written for people to read, and only incidentally  
for machines to execute.
  - from Structure and Interpretation of Computer Programs