Hi everyboy, a very noob question here.
I'm using pd 0.43.4-extended on windows 8 and I would like to use the [peak~] object into a patch. I found out that this object is part of the "flib" library which is not included in the last version of pure data.
Searching the web I eventually found this link: http://ccrma.stanford.edu/planetccrma/mirror/fedora/linux/planetccrma/10/i386/repoview/pd-flib.html
Is it what I'm looking for? If so, where should I paste that file in order to have the [peak~] object available? How to "include" the flib library?

...is it even possible to do something like that?

Thank you so much!

Hello there! Hope to find a solution to my little issue here.
I'm really new to pure data and I'm not sure yet about its limits.
I'll go straight to the point. I'm trying to compute the autocorrelation function of a big array (4092 elements) and I'm trying to do it as quick as possible.
I made the patch (just a few math objects connected together) using a metro object as the main pulse of the index shifting needed to compute the autocorrelation, but I soon realized that the metro object has a limit in speed that is way under what I expected. I get the result I need but it takes a few minutes.
What I need to know is: how can I make quicker calculations?
Is this aim beyond the possibilities of pure data?
If the answer is yes, is there a way (a not so tricky one) to designate the calculation to some other softfware which is more appropriate? (MATLAB, for example?)

Thank you in advance

ps: this is somehow related to another issue I'm thinking about these day, which is how to write "for" cycles in a simple way in pure data...maybe I'm missing something big about how pure data works.

All right thank you very much. Anyway I guess I will make it with those other objects that you suggested. Thanks

Thank you all! Your answers are helping so much and making me understand more about my problem and about pure data in general.

And then there is this Katjav website...mindblowing! WOW!

@sebfumaster said:

seems like you could use tabsend~ to an fft~ subpatch and multiply it by its conjugate. http://en.wikipedia.org/wiki/Autocorrelation under Efficient computation

Wow that seems to be a very elegant way to do it, I'll surely try, thank you.

It should solve the problem, ok, but still I don't understand how pure data works with fast index shifting in general. What if I find myself with a similar problem that has nothing to do with FFT, crosscorrelation or convolution?