freepoulite

i want to make a patch that give me all possible disposition of n elements in m spaces ( max)

i search for the fastest way to do that...

any help would be be highly appreciated!
i search for the fastest way to do that...


combination-problem

i want all permutations of a list of int, BUT no permutations of equal elements

I'm searching to make another patch too
i explain:

1224
1242
1422
4122
4212
4221
2142
2124
2214
2241
2421
2412


You can combine it with [zl thin] to remove duplicates.

For permutations, check out RTC-Lib:
http://www.essl.at/works/rtc.html

i really need the same thing with no permutation of the equals elements

i need to optimize speed on this patch and your way seems too slow in my case

thank you for the help
 i knew the permute object from RTC lib
i really need the same thing with no permutation of the equals elements
i need to optimize speed on this patch and your way seems too slow in my case

I think LISP is definitely the way to do it.

In Max I'd use either the Bach objects or maxlispj (if you're up for it)

http://www.bachproject.net/bach/home_page.html

http://music.columbia.edu/~brad/maxlispj/

here is a makeshift patch using some of the bach objects.

It only works as long as M%N=0, in other words, as long as M is a multiple of N.

For the general case of all M's, you first need to decide how to handle the remainder - which elements of N should come more often than others. For example, if you have N=2, M=3: should the list be 010 or 011?

I think LISP is definitely the way to do it.
In Max I'd use either the Bach objects or maxlispj (if you're up for it)
http://www.bachproject.net/bach/home_page.html
http://music.columbia.edu/~brad/maxlispj/

here is a makeshift patch using some of the bach objects.
It only works as long as M%N=0, in other words, as long as M is a multiple of N.

There are lots of ways to crack this nut, LISP is hardly the only way to go (although if you like parentheses, go for it (says he (cynically (somewhat))):-)

Somewhere there is a version of [change] that works with symbols (possibly an abstraction (it was discussed (not too long (ago)) and (if the forum search function (is in a good mood) it (might) (find the (thread for (you)))))). Armed with an object like that, you could [permute]->[zl group]->[zl sort]->[symchange].

Sorry about getting Lost In Spurious Parentheses, but talking about LISP does that to me;-

Somewhere there is a version of [change] that works with symbols (possibly an abstraction (it was discussed (not too long (ago)) and (if the forum search function (is in a good mood) it (might) (find the (thread for (you)))))). Armed with an object like that, you could [permute]->[zl group]->[zl sort]->[symchange]. 

Sorry about getting Lost In Spurious Parentheses, but talking about LISP does that to me;-


@yp,thanks for the patch, it's all i need! bach looks awesome!

@Peter, you make me laugh at 5 AM, you're talented ;) thanks for the hints

thank you a lot for those informations
i really appreciate a lot
@yp,thanks for the patch, it's all i need! bach looks awesome!
@Peter, you make me laugh at 5 AM, you're talented ;) thanks for the hints

combination problem