On Mon, 30 Mar 2009, Philip Potter wrote:

3) Someone mentioned on the list a [pack 0 0 0 0 0] idiom for building
large trees of maths in order to avoid weaving many [t b f] objects to
cold inlets. How does this idiom work?

It doesn't eliminate the [t b f], it makes them more manageable.

it's just a bunch of [inlets] connected to a [pack 0 0 0 0 0] then to an [unpack 0 0 0 0 0]. This causes recomputation of the complete tree of maths every time something is sent to the hot inlet of the abstraction, but it doesn't fix anything arising from crossing wires in ways that would usually cause a delay: for example if you use [t f f] with crossed wires to an object, instead of using [swap], this causes a delay (intentional or not) due to order of operations.

 _ _ __ ___ _____ ________ _____________ _____________________ ...
| Mathieu Bouchard - tél:+1.514.383.3801, Montréal, Québec
_______________________________________________
Pd-list@iem.at mailing list
UNSUBSCRIBE and account-management -> 
http://lists.puredata.info/listinfo/pd-list

Reply via email to