 | Combinatorial Class |
Combinatorial algorithms, including generating tuples, combinations, permutations and
partitions.
Except for PowerSet, all methods are implemented after Knuth, described in The Art of
Computer Programming Volume 4.
Inheritance HierarchyNamespace: Gamelogic.Extensions.Algorithms
Assembly: Assembly-CSharp (in Assembly-CSharp.dll) Version: 0.0.0.0
SyntaxC#
[VersionAttribute(1, 4, 0)] public static class Combinatorial
The Combinatorial type exposes the following members.
Methods| Name | Description | |
|---|---|---|
  | CombinationsT(IEnumerableT, Int32) |
Generates all combinations of m elements selected from the list.
|
| CombinationsT(Int32, Int32, FuncInt32, T) | |
| MultiRadixTuples(Int32) |
Generates all tuples with mixed radixes.
|
| MultiRadixTuplesT(IEnumerableIEnumerableT) | |
| PartitionsT |
Returns a list of all the partitions of a list.
|
| Permutations(Int32) |
Generates all permutations of the numbers 0 to n - 1.
|
| PermutationsT(IEnumerableT) |
Generates all permutations of the list of elements.
|
| PowerSetT |
Returns the power set of the input, that is, the set of all subsets of the input.
|
| Tuples(Int32) |
Generate all possible tuples of length n with digits 0 to n-1.
|
| TuplesT(IEnumerableT) | |
| TuplesT(Int32, FuncInt32, T) |
Generates n-tuples of integers 0 to n-1 and applies the selector to them.
|
See Also