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@iem.at mailing list UNSUBSCRIBE and account-management -> http://lists.puredata.info/listinfo/pd-list
