On Sat, 17 Jun 2006, Hans-Christoph Steiner wrote:
How is the [&] object ineffecient?
It can only be so for two reasons:
Pd's messagesystem is interpreted.
Pd has floats and no ints.
But unless you try processing 100000 bytes per second or so, [&] prolly isn't slow enough to worry.
It would be easy enough to write something like [bit] for Pd based on [&] which would make the patching easier.
extracting bits is already pretty easy. you don't even need to know powers of two. e.g. [bit 13] would be like [>> 13] then [& 1]. You could do it like [& 8192] then [!=], but you really don't have to.
_ _ __ ___ _____ ________ _____________ _____________________ ... | Mathieu Bouchard - tél:+1.514.383.3801 - http://artengine.ca/matju | Freelance Digital Arts Engineer, Montréal QC Canada