Permutations
A class to iterate over all permutations of an array.
The algorithm is from Applied Combinatorics, by Alan Tucker as implemented in
http://www.koders.com/java/fidD3445CD11B1DC687F6B8911075E7F01E23171553.aspx
| Methods |
|---|
| static Permutations |
create(T[] in, T[] out)
Create a new permutations object.
|
| static Permutations |
create(T[] in, T[] out)
Create a new permutations object.
Parameters:
in - the source array
out - the target array
Returns:
the generated permutations object
|
| static Permutations |
create(T[] in, T[] out, int m)
Create a new permutations object.
|
| static Permutations |
create(T[] in, T[] out, int m)
Create a new permutations object.
Parameters:
in - the source array
out - the target array
m - the number of output elements to generate
Returns:
the generated permutations object
|
| boolean |
next()
Go to the next lineup, and if available, fill the target array.
|
| boolean |
next()
Go to the next lineup, and if available, fill the target array.
Returns:
if a new lineup is available
|
|