[PD] counter question

Max Neupert abonnements at revolwear.com
Thu Jul 26 23:49:27 CEST 2007


i asked that question the 2005-11-10 with the subject Re: [PD]  
Building a counter problem



Am 26.07.2007 um 13:45 schrieb Derek Holzer:

> 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.
> -- 
> derek holzer ::: http://www.umatic.nl ::: http://blog.myspace.com/ 
> macumbista
> ---Oblique Strategy # 37:
> "Convert a melodic element into a rhythmic element"
>
> _______________________________________________
> PD-list at iem.at mailing list
> UNSUBSCRIBE and account-management -> http://lists.puredata.info/ 
> listinfo/pd-list





More information about the Pd-list mailing list