Hi,
the list-sort.pd abstraction in the [list]-abs is Pd vanilla and uses data structures to do the sorting. The actual sorting is fast, but first the list is copied into a data structure [struct f float x] and into a subpatch, which takes a moment. Then you just sort the subpatch with the message "sort" to it.
In my benchmarks four yers ago it was faster than the other sorting algorithms available at the time, which are also included in the collection.
All the best,
Frank
On Fri, May 08, 2015 at 07:33:16PM -0700, Miller Puckette wrote:
Hi all,
There needs to be a way to do this in vanilla but I've never been able to decide what to do to provide it...
In the meanime, if the numbers you're sorting are integers with a known range, you can make a histogram (this will require some sort of loop, probably with 'until') and the use [array quantile] to pick the sorted values off one by one as needed.
cheers Miller
On Sat, May 09, 2015 at 02:18:17AM +0000, Pagano, Patrick wrote:
?i need to transfer a patch to Vanilla but it uses "sort" which i think is from zexy
Is there a Vanilla equivalent i can pop in there?
Patrick Pagano B.S, M.F.A Audio and Projection Design Faculty Digital Worlds Institute University of Florida, USA (352)294-2020
Pd-list@lists.iem.at mailing list UNSUBSCRIBE and account-management -> http://lists.puredata.info/listinfo/pd-list
Pd-list@lists.iem.at mailing list UNSUBSCRIBE and account-management -> http://lists.puredata.info/listinfo/pd-list