30 Nov
2009
30 Nov
'09
4:20 p.m.
Disclaimer: I don't (yet) know faust
On Monday 30 November 2009 20:38:12 Bjoern Lindig wrote:
I have a problem understanding this piece of
faust-code:
index( n ) = &( n - 1 ) ~ + ( 1 );
It is from the faust-soft-computing.pdf. I do understand that it works like
a counter and I think it should jump back to 0 when it reaches n - 1. But
what exactly is the logical AND operator doing?
I think its not a logical AND for expressions but a bitwise AND. Which means
that only the bits that are set in both arguments pass. Which would make sense
to have the counter wrap...
Maybe that helps,
Arnold