See: Description
| Interface | Description |
|---|---|
| CombinatorialIterator<T> |
Combinatorial iterator.
|
| IntCombinatorialPort |
This interface is common for all combinatorial iterators.
|
| Class | Description |
|---|---|
| Combinatorics |
This class provides factory and utility methods for combinatorics infrastructure.
|
| IntCombinations |
Iterator over all unordered combinations (i.e.
|
| IntCombinationsWithPermutations |
Iterator over over all possible unique combinations with permutations (i.e.
|
| IntCombinatorialPort.Iterator | |
| IntCompositions |
Iterator over all compositions of specified integer into N parts.
|
| IntDistinctTuples |
Iterator over all distinct N-tuples, which can be chosen from
N sets of integers. |
| IntPermutations |
Iterator over all possible permutations.
|
| IntPermutationsWithPriority |
Iterator over all possible permutations of specified that allows to adjust the "niceness" of particular permutations,
such they will appear earlier in the iteration if iterator was reset via
IntPermutationsWithPriority.reset(). |
| IntTuples |
Iterator over all N-tuples (not necessary to be distinct), which can be chosen from
N arrays of integers of
the form arrayi = [0, 1, 2, ..., Ki]. |
Enumerating combinations. Provides algorithms for enumerating (without in memory storing) different types of combinations.
IntPermutationsIntCombinationsIntCombinationsWithPermutationsIntDistinctTuplesN sets of integers. IntTuplesN sets of integers of the form arrayi = [0, 1, 2, ..., Ki]. IntPermutationsWithPriorityIntCompositionsCopyright © 2017. All rights reserved.