Package cc.redberry.combinatorics
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]. IntPermutationsWithPriorityIntCompositions- Since:
- 1.0
-
Interface Summary Interface Description CombinatorialIterator<T> Combinatorial iterator.Combinatorics.ArrayFactory<T> IntCombinatorialPort This interface is common for all combinatorial iterators. -
Class Summary Class Description Combinatorics This class provides factory and utility methods for combinatorics infrastructure.Combinatorics.GenericFactory<T> Combinatorics.TIterator<T> Combinatorics.TTIterator<T> IntCombinations Iterator over all unordered combinations (i.e.IntCombinationsWithPermutations Iterator over over all possible unique combinations with permutations (i.e.IntCombinatorialIterator IntCombinatorialPort.Iterator IntCompositions Iterator over all compositions of specified integer into N parts.IntDistinctTuples Iterator over all distinct N-tuples, which can be chosen fromNsets 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 viaIntPermutationsWithPriority.reset().IntPermutationsWithPriority.PermutationPriorityTuple IntTuples Iterator over all N-tuples (not necessary to be distinct), which can be chosen fromNarrays of integers of the form arrayi = [0, 1, 2, ..., Ki].