[PD] counter question

tim info at timvets.net
Wed Aug 1 10:16:25 CEST 2007

Derek Holzer wrote:
> If I use a simple counter structure that continues to generate a number 
> from [f] & [+1] at every bang, and use [mod] to keep that number within 
> certain bounds, then eventually it will require more and more memory to 
> hold the number coming from [f], right? Is this a potential memory leak, 
> or is there a cap to how much memory it will hold?
> Likewise, is there a max limit to the number that can be stored in [f]? 
> I've seen that [f] resets itself somewhere around 8.394e+06. Does that 
> mean that [f] resets itself and clears the memory?
> Or in less-theoretical and more practical terms, would it make sense to 
> reset [f] to 0 every so often, or let it run forever towards infinity?
> best,
> d.

Hi all,

I often make counters using [moses], see attachement.

-------------- next part --------------
An embedded and charset-unspecified text was scrubbed...
Name: mosescounter.pd
URL: <http://lists.puredata.info/pipermail/pd-list/attachments/20070801/b17f5b83/attachment.txt>

More information about the Pd-list mailing list