hello,
there is a list-sort in footils list abstraction folder. and some
list_quicksort where send to this list few years ago.
c
Le 12/06/2011 03:59, Pagano, Patrick a écrit :
Is there something in rjdj I could replace sort with?
From: Patrick Pagano p...@digitalworlds.ufl.edu
Hi Patrick,
What does sort do exactly?
In the RjLib there are many abstractions to apply functions to lists with.
If you make an object called [OVERVIEW] and look inside there will be a menu
to access all the objects. In the 'utilities' section there is
[u_listfilter], [u_listdrip],
Thanks joe, I'll check those
pp
From: Joe White white.j...@gmail.commailto:white.j...@gmail.com
Date: Sun, 12 Jun 2011 06:31:34 -0400
To: pd-list@iem.atmailto:pd-list@iem.at
pd-list@iem.atmailto:pd-list@iem.at, Patrick Pagano
p...@digitalworlds.ufl.edumailto:p...@digitalworlds.ufl.edu
Subject:
Cyrille
If I send you the patch do you think you might could look at it to see
what would be an appropriate substitution?
pp
On 6/12/11 4:32 AM, cyrille henry c...@chnry.net wrote:
hello,
there is a list-sort in footils list abstraction folder. and some
list_quicksort where send to this list
hello,
send a link to the patch on this list, so that anyone could have a look.
c
Le 12/06/2011 17:05, Pagano, Patrick a écrit :
Cyrille
If I send you the patch do you think you might could look at it to see
what would be an appropriate substitution?
pp
On 6/12/11 4:32 AM, cyrille
On Sat, Jun 11, 2011 at 02:56:15PM +0200, manecante wrote:
thank's a lot for your reply. I didn't have so much time this week to
deeply study it but in between i went to the pure data meeting in
Berlin where i met Dan Wilcox who quickly made the attached patch that
illustrates the answer of my
Hi,
On Sun, Jun 12, 2011 at 10:32:27AM +0200, cyrille henry wrote:
there is a list-sort in footils list abstraction folder. and some
list_quicksort where send to this list few years ago.
The rj library doesn't include a sorting abstraction, so indeed one should use
abstractions from elsewhere
Hi,
On Sun, Jun 12, 2011 at 08:09:37PM +0200, Frank Barknecht wrote:
Well, thinking about it, descending order turned out to be dead simple, as it
can be realized using a different order when building the final list (append
instead of prepend) so attached is a new version,
Sorry, last
Hi,
On Sun, Jun 12, 2011 at 06:59:50PM +0200, Frank Barknecht wrote:
Another option would be sorting with data structures, which I usually do
today.
Attached is an example abstraction for data structure sorting (datasort.pd).
It
seems to be much faster than list-quicksort from list-abs
There are some related libraries, like mtl or rjlib, but this one
specifically was not done. If you are feeling up to it, please take
it on. There are many working objects out there, so it'd mostly be an
exercise in coming up with standard inlets/outlets and messages, and a
naming
10 matches
Mail list logo