Offers combinatoric sequence operations like combinations, permutations, and Cartesian products, inspired by Python's itertools library, facilitating sequence manipulation in various contexts.
Multiplatform iterator tools and combinatoric sequences for Kotlin.
Inspired by:
Initially built as part of my solutions for Advent of Code 2023.
repositories {
mavenCentral()
}
dependencies {
implementation("com.michael-bull.kotlin-itertools:kotlin-itertools:1.1.0")
}Returns an infinite sequence that yields elements from this iterable repeatedly, cycling back to the start after reaching the end.
fun <T> Iterable<T>.cycle(): Sequence<T>
fun <T> Iterable<T>.cycle(times: Int): Sequence<T>import com.github.michaelbull.itertools.cycle
// [A, B, C, A, B, C, A]
fun example1(): List<Char> {
return "ABC".toList()
.cycle()
.take(7)
.toList()
}
// [A, B, C, A, B, C, A, B, C]
fun example2(): List<Char> {
return "ABC".toList()
.cycle(times = 3)
.toList()
}Returns a list (or sequence) that alternates elements from two iterables. See also Interleave Longest to continue until both are exhausted.
fun <T> Iterable<T>.interleave(other: Iterable<T>): List<T>
fun <T, C : MutableCollection<in T>> Iterable<T>.interleaveTo(destination: C, other: Iterable<T>): C
fun <T> Sequence<T>.interleave(other: Sequence<T>): Sequence<T>import com.github.michaelbull.itertools.interleave
// [1, 2, 3, 4, 5, 6]
fun example1(): List<Int> {
return listOf(1, 3, 5)
.interleave(listOf(2, 4, 6))
}
// [1, 2, 3, 4]
fun example2(): List<Int> {
return listOf(1, 3, 5)
.interleave(listOf(2, 4))
}Returns a list (or sequence) that alternates elements from two iterables, continuing until both are exhausted. See also Interleave to stop at the shorter.
fun <T> Iterable<T>.interleaveLongest(other: Iterable<T>): List<T>
fun <T, C : MutableCollection<in T>> Iterable<T>.interleaveLongestTo(destination: C, other: Iterable<T>): C
fun <T> Sequence<T>.interleaveLongest(other: Sequence<T>): Sequence<T>import com.github.michaelbull.itertools.interleaveLongest
// [1, 2, 3, 4, 5]
fun example1(): List<Int> {
return listOf(1, 3, 5)
.interleaveLongest(listOf(2, 4))
}
// [1, 2, 4, 6]
fun example2(): List<Int> {
return listOf(1)
.interleaveLongest(listOf(2, 4, 6))
}Returns a list (or sequence) with a separator inserted between each pair of adjacent elements.
fun <T> Iterable<T>.intersperse(separator: T): List<T>
fun <T, C : MutableCollection<in T>> Iterable<T>.intersperseTo(destination: C, separator: T): C
fun <T> Sequence<T>.intersperse(separator: T): Sequence<T>import com.github.michaelbull.itertools.intersperse
// [A, -, B, -, C]
fun example1(): List<Char> {
return "ABC".toList()
.intersperse('-')
}Returns a sequence that yields k-sized combinations of elements from this list. See also
Combinations with Replacement for allowing repeated elements, and
Powerset for all subsets across all sizes.
The combination tuples are emitted in lexicographic order according to the order of this list.
fun <T> List<T>.combinations(k: Int = size): Sequence<List<T>>
fun <T> List<T>.pairCombinations(): Sequence<Pair<T, T>>
fun <T> List<T>.tripleCombinations(): Sequence<Triple<T, T, T>>import com.github.michaelbull.itertools.combinations
import com.github.michaelbull.itertools.pairCombinations
import com.github.michaelbull.itertools.tripleCombinations
// [[A, B], [A, C], [B, C]]
fun example1(): List<List<Char>> {
return "ABC".toList()
.combinations(k = 2)
.toList()
}
// [(A, B), (A, C), (B, C)]
fun example2(): List<Pair<Char, Char>> {
return "ABC".toList()
.pairCombinations()
.toList()
}
// [(A, B, C)]
fun example3(): List<Triple<Char, Char, Char>> {
return "ABC".toList()
.tripleCombinations()
.toList()
}Returns a sequence that yields k-sized combinations of elements from this list, allowing individual elements to be
repeated. See also Combinations for without replacement.
The combination tuples are emitted in lexicographic order according to the order of this list.
fun <T> List<T>.combinationsWithReplacement(k: Int = size): Sequence<List<T>>
fun <T> List<T>.pairCombinationsWithReplacement(): Sequence<Pair<T, T>>
fun <T> List<T>.tripleCombinationsWithReplacement(): Sequence<Triple<T, T, T>>import com.github.michaelbull.itertools.combinationsWithReplacement
import com.github.michaelbull.itertools.pairCombinationsWithReplacement
import com.github.michaelbull.itertools.tripleCombinationsWithReplacement
// [[A, A], [A, B], [A, C], [B, B], [B, C], [C, C]]
fun example1(): List<List<Char>> {
return "ABC".toList()
.combinationsWithReplacement(k = 2)
.toList()
}
// [(A, A), (A, B), (A, C), (B, B), (B, C), (C, C)]
fun example2(): List<Pair<Char, Char>> {
return "ABC".toList()
.pairCombinationsWithReplacement()
.toList()
}
// [(A, A, A), (A, A, B), (A, A, C), (A, B, B), (A, B, C), (A, C, C), (B, B, B), (B, B, C), (B, C, C), (C, C, C)]
fun example3(): List<Triple<Char, Char, Char>> {
return "ABC".toList()
.tripleCombinationsWithReplacement()
.toList()
}Returns a sequence that yields all subsets of this list, from the empty set to the full set. Equivalent to
combinations for every k from 0 to size.
Subsets are emitted in order of increasing size. Within each size, subsets are emitted in lexicographic order according to the order of this list.
fun <T> List<T>.powerset(): Sequence<List<T>>import com.github.michaelbull.itertools.powerset
// [[], [A], [B], [C], [A, B], [A, C], [B, C], [A, B, C]]
fun example1(): List<List<Char>> {
return "ABC".toList()
.powerset()
.toList()
}Returns a sequence that yields k-sized permutations of elements from this list.
Elements are treated as unique based on their position, not their value. See also Distinct Permutations for value-based uniqueness, and Permutations with Replacement for allowing repeated elements.
The permutation tuples are emitted in lexicographic order according to the order of this list.
fun <T> List<T>.permutations(k: Int = size): Sequence<List<T>>
fun <T> List<T>.pairPermutations(): Sequence<Pair<T, T>>
fun <T> List<T>.triplePermutations(): Sequence<Triple<T, T, T>>import com.github.michaelbull.itertools.permutations
import com.github.michaelbull.itertools.pairPermutations
import com.github.michaelbull.itertools.triplePermutations
// [[A, B], [A, C], [A, D], [B, A], [B, C], [B, D], [C, A], [C, B], [C, D], [D, A], [D, B], [D, C]]
fun example1(): List<List<Char>> {
return "ABCD".toList()
.permutations(k = 2)
.toList()
}
// [(A, B), (A, C), (A, D), (B, A), (B, C), (B, D), (C, A), (C, B), (C, D), (D, A), (D, B), (D, C)]
fun example2(): List<Pair<Char, Char>> {
return "ABCD".toList()
.pairPermutations()
.toList()
}
// [(A, B, C), (A, B, D), (A, C, B), (A, C, D), (A, D, B), (A, D, C), (B, A, C), (B, A, D), (B, C, A), (B, C, D), (B, D, A), (B, D, C), (C, A, B), (C, A, D), (C, B, A), (C, B, D), (C, D, A), (C, D, B), (D, A, B), (D, A, C), (D, B, A), (D, B, C), (D, C, A), (D, C, B)]
fun example3(): List<Triple<Char, Char, Char>> {
return "ABCD".toList()
.triplePermutations()
.toList()
}Returns a sequence that yields distinct permutations of elements from this list. Unlike Permutations, elements are treated as unique based on their value, not their position — equal elements are interchangeable and the output contains no duplicates. See also Permutations with Replacement for allowing repeated elements.
fun <T : Comparable<T>> List<T>.distinctPermutations(): Sequence<List<T>>import com.github.michaelbull.itertools.distinctPermutations
// [[A, A, B], [A, B, A], [B, A, A]]
fun example1(): List<List<Char>> {
return "AAB".toList()
.distinctPermutations()
.toList()
}
// [[A, B, C], [A, C, B], [B, A, C], [B, C, A], [C, A, B], [C, B, A]]
fun example2(): List<List<Char>> {
return "ABC".toList()
.distinctPermutations()
.toList()
}Returns a sequence that yields k-sized permutations of elements from this list, allowing individual elements to be
repeated. See also Permutations for without replacement, and
Distinct Permutations for value-based uniqueness.
The permutation tuples are emitted in lexicographic order according to the order of this list.
fun <T> List<T>.permutationsWithReplacement(k: Int = size): Sequence<List<T>>
fun <T> List<T>.pairPermutationsWithReplacement(): Sequence<Pair<T, T>>
fun <T> List<T>.triplePermutationsWithReplacement(): Sequence<Triple<T, T, T>>import com.github.michaelbull.itertools.permutationsWithReplacement
import com.github.michaelbull.itertools.pairPermutationsWithReplacement
import com.github.michaelbull.itertools.triplePermutationsWithReplacement
// [[A, A], [A, B], [A, C], [A, D], [B, A], [B, B], [B, C], [B, D], [C, A], [C, B], [C, C], [C, D], [D, A], [D, B], [D, C], [D, D]]
fun example1(): List<List<Char>> {
return "ABCD".toList()
.permutationsWithReplacement(k = 2)
.toList()
}
// [(A, A), (A, B), (A, C), (B, A), (B, B), (B, C), (C, A), (C, B), (C, C)]
fun example2(): List<Pair<Char, Char>> {
return "ABC".toList()
.pairPermutationsWithReplacement()
.toList()
}
// [(A, A, A), (A, A, B), (A, A, C), (A, B, A), (A, B, B), (A, B, C), (A, C, A), (A, C, B), (A, C, C), (B, A, A), (B, A, B), (B, A, C), (B, B, A), (B, B, B), (B, B, C), (B, C, A), (B, C, B), (B, C, C), (C, A, A), (C, A, B), (C, A, C), (C, B, A), (C, B, B), (C, B, C), (C, C, A), (C, C, B), (C, C, C)]
fun example3(): List<Triple<Char, Char, Char>> {
return "ABC".toList()
.triplePermutationsWithReplacement()
.toList()
}Returns a sequence that yields k-sized derangements of elements from this list. A derangement is a permutation where
no element appears in its original position.
The derangement tuples are emitted in lexicographic order according to the order of this list.
fun <T> List<T>.derangements(k: Int = size): Sequence<List<T>>import com.github.michaelbull.itertools.derangements
// [[B, C, A], [C, A, B]]
fun example1(): List<List<Char>> {
return "ABC".toList()
.derangements()
.toList()
}
// [[B, A], [B, C], [B, D], [C, A], [C, D], [D, A], [D, C]]
fun example2(): List<List<Char>> {
return "ABCD".toList()
.derangements(k = 2)
.toList()
}Returns a sequence that yields the Cartesian product of the input iterables/lists.
The product tuples are emitted in lexicographic order according to the order of this iterable/list.
fun <A, B> Iterable<A>.product(other: Iterable<B>): Sequence<Pair<A, B>>
fun <A, B, C> Iterable<A>.product(first: Iterable<B>, second: Iterable<C>): Sequence<Triple<A, B, C>>
fun <A, B> Pair<Iterable<A>, Iterable<B>>.product(): Sequence<Pair<A, B>>
fun <A, B, C> Triple<Iterable<A>, Iterable<B>, Iterable<C>>.product(): Sequence<Triple<A, B, C>>
fun <T> List<List<T>>.product(): Sequence<List<T>>import com.github.michaelbull.itertools.product
// [(A, x), (A, y), (B, x), (B, y), (C, x), (C, y), (D, x), (D, y)]
fun example1(): List<Pair<Char, Char>> {
val a = "ABCD".toList()
val b = "xy".toList()
return a.product(b).toList()
}
// [(A, C, E), (A, C, F), (A, D, E), (A, D, F), (B, C, E), (B, C, F), (B, D, E), (B, D, F)]
fun example2(): List<Triple<Char, Char, Char>> {
val a = "AB".toList()
val b = "CD".toList()
val c = "EF".toList()
return Triple(a, b, c)
.product()
.toList()
}
// [[A, x], [A, y], [B, x], [B, y], [C, x], [C, y], [D, x], [D, y]]
fun example3(): List<List<Char>> {
val a = "ABCD".toList()
val b = "xy".toList()
return listOf(a, b)
.product()
.toList()
}Note: Unlike Python's
itertools.product(iterable, repeat=n), this function does not accept arepeatparameter. The Cartesian product of a list with itself is equivalent topermutationsWithReplacement:// Python: itertools.product("ABCD", repeat=2) "ABCD".toList().permutationsWithReplacement(k = 2)
Bug reports and pull requests are welcome on GitHub.
This project is available under the terms of the ISC license. See the
LICENSE file for the copyright information and licensing terms.
Multiplatform iterator tools and combinatoric sequences for Kotlin.
Inspired by:
Initially built as part of my solutions for Advent of Code 2023.
repositories {
mavenCentral()
}
dependencies {
implementation("com.michael-bull.kotlin-itertools:kotlin-itertools:1.1.0")
}Returns an infinite sequence that yields elements from this iterable repeatedly, cycling back to the start after reaching the end.
fun <T> Iterable<T>.cycle(): Sequence<T>
fun <T> Iterable<T>.cycle(times: Int): Sequence<T>import com.github.michaelbull.itertools.cycle
// [A, B, C, A, B, C, A]
fun example1(): List<Char> {
return "ABC".toList()
.cycle()
.take(7)
.toList()
}
// [A, B, C, A, B, C, A, B, C]
fun example2(): List<Char> {
return "ABC".toList()
.cycle(times = 3)
.toList()
}Returns a list (or sequence) that alternates elements from two iterables. See also Interleave Longest to continue until both are exhausted.
fun <T> Iterable<T>.interleave(other: Iterable<T>): List<T>
fun <T, C : MutableCollection<in T>> Iterable<T>.interleaveTo(destination: C, other: Iterable<T>): C
fun <T> Sequence<T>.interleave(other: Sequence<T>): Sequence<T>import com.github.michaelbull.itertools.interleave
// [1, 2, 3, 4, 5, 6]
fun example1(): List<Int> {
return listOf(1, 3, 5)
.interleave(listOf(2, 4, 6))
}
// [1, 2, 3, 4]
fun example2(): List<Int> {
return listOf(1, 3, 5)
.interleave(listOf(2, 4))
}Returns a list (or sequence) that alternates elements from two iterables, continuing until both are exhausted. See also Interleave to stop at the shorter.
fun <T> Iterable<T>.interleaveLongest(other: Iterable<T>): List<T>
fun <T, C : MutableCollection<in T>> Iterable<T>.interleaveLongestTo(destination: C, other: Iterable<T>): C
fun <T> Sequence<T>.interleaveLongest(other: Sequence<T>): Sequence<T>import com.github.michaelbull.itertools.interleaveLongest
// [1, 2, 3, 4, 5]
fun example1(): List<Int> {
return listOf(1, 3, 5)
.interleaveLongest(listOf(2, 4))
}
// [1, 2, 4, 6]
fun example2(): List<Int> {
return listOf(1)
.interleaveLongest(listOf(2, 4, 6))
}Returns a list (or sequence) with a separator inserted between each pair of adjacent elements.
fun <T> Iterable<T>.intersperse(separator: T): List<T>
fun <T, C : MutableCollection<in T>> Iterable<T>.intersperseTo(destination: C, separator: T): C
fun <T> Sequence<T>.intersperse(separator: T): Sequence<T>import com.github.michaelbull.itertools.intersperse
// [A, -, B, -, C]
fun example1(): List<Char> {
return "ABC".toList()
.intersperse('-')
}Returns a sequence that yields k-sized combinations of elements from this list. See also
Combinations with Replacement for allowing repeated elements, and
Powerset for all subsets across all sizes.
The combination tuples are emitted in lexicographic order according to the order of this list.
fun <T> List<T>.combinations(k: Int = size): Sequence<List<T>>
fun <T> List<T>.pairCombinations(): Sequence<Pair<T, T>>
fun <T> List<T>.tripleCombinations(): Sequence<Triple<T, T, T>>import com.github.michaelbull.itertools.combinations
import com.github.michaelbull.itertools.pairCombinations
import com.github.michaelbull.itertools.tripleCombinations
// [[A, B], [A, C], [B, C]]
fun example1(): List<List<Char>> {
return "ABC".toList()
.combinations(k = 2)
.toList()
}
// [(A, B), (A, C), (B, C)]
fun example2(): List<Pair<Char, Char>> {
return "ABC".toList()
.pairCombinations()
.toList()
}
// [(A, B, C)]
fun example3(): List<Triple<Char, Char, Char>> {
return "ABC".toList()
.tripleCombinations()
.toList()
}Returns a sequence that yields k-sized combinations of elements from this list, allowing individual elements to be
repeated. See also Combinations for without replacement.
The combination tuples are emitted in lexicographic order according to the order of this list.
fun <T> List<T>.combinationsWithReplacement(k: Int = size): Sequence<List<T>>
fun <T> List<T>.pairCombinationsWithReplacement(): Sequence<Pair<T, T>>
fun <T> List<T>.tripleCombinationsWithReplacement(): Sequence<Triple<T, T, T>>import com.github.michaelbull.itertools.combinationsWithReplacement
import com.github.michaelbull.itertools.pairCombinationsWithReplacement
import com.github.michaelbull.itertools.tripleCombinationsWithReplacement
// [[A, A], [A, B], [A, C], [B, B], [B, C], [C, C]]
fun example1(): List<List<Char>> {
return "ABC".toList()
.combinationsWithReplacement(k = 2)
.toList()
}
// [(A, A), (A, B), (A, C), (B, B), (B, C), (C, C)]
fun example2(): List<Pair<Char, Char>> {
return "ABC".toList()
.pairCombinationsWithReplacement()
.toList()
}
// [(A, A, A), (A, A, B), (A, A, C), (A, B, B), (A, B, C), (A, C, C), (B, B, B), (B, B, C), (B, C, C), (C, C, C)]
fun example3(): List<Triple<Char, Char, Char>> {
return "ABC".toList()
.tripleCombinationsWithReplacement()
.toList()
}Returns a sequence that yields all subsets of this list, from the empty set to the full set. Equivalent to
combinations for every k from 0 to size.
Subsets are emitted in order of increasing size. Within each size, subsets are emitted in lexicographic order according to the order of this list.
fun <T> List<T>.powerset(): Sequence<List<T>>import com.github.michaelbull.itertools.powerset
// [[], [A], [B], [C], [A, B], [A, C], [B, C], [A, B, C]]
fun example1(): List<List<Char>> {
return "ABC".toList()
.powerset()
.toList()
}Returns a sequence that yields k-sized permutations of elements from this list.
Elements are treated as unique based on their position, not their value. See also Distinct Permutations for value-based uniqueness, and Permutations with Replacement for allowing repeated elements.
The permutation tuples are emitted in lexicographic order according to the order of this list.
fun <T> List<T>.permutations(k: Int = size): Sequence<List<T>>
fun <T> List<T>.pairPermutations(): Sequence<Pair<T, T>>
fun <T> List<T>.triplePermutations(): Sequence<Triple<T, T, T>>import com.github.michaelbull.itertools.permutations
import com.github.michaelbull.itertools.pairPermutations
import com.github.michaelbull.itertools.triplePermutations
// [[A, B], [A, C], [A, D], [B, A], [B, C], [B, D], [C, A], [C, B], [C, D], [D, A], [D, B], [D, C]]
fun example1(): List<List<Char>> {
return "ABCD".toList()
.permutations(k = 2)
.toList()
}
// [(A, B), (A, C), (A, D), (B, A), (B, C), (B, D), (C, A), (C, B), (C, D), (D, A), (D, B), (D, C)]
fun example2(): List<Pair<Char, Char>> {
return "ABCD".toList()
.pairPermutations()
.toList()
}
// [(A, B, C), (A, B, D), (A, C, B), (A, C, D), (A, D, B), (A, D, C), (B, A, C), (B, A, D), (B, C, A), (B, C, D), (B, D, A), (B, D, C), (C, A, B), (C, A, D), (C, B, A), (C, B, D), (C, D, A), (C, D, B), (D, A, B), (D, A, C), (D, B, A), (D, B, C), (D, C, A), (D, C, B)]
fun example3(): List<Triple<Char, Char, Char>> {
return "ABCD".toList()
.triplePermutations()
.toList()
}Returns a sequence that yields distinct permutations of elements from this list. Unlike Permutations, elements are treated as unique based on their value, not their position — equal elements are interchangeable and the output contains no duplicates. See also Permutations with Replacement for allowing repeated elements.
fun <T : Comparable<T>> List<T>.distinctPermutations(): Sequence<List<T>>import com.github.michaelbull.itertools.distinctPermutations
// [[A, A, B], [A, B, A], [B, A, A]]
fun example1(): List<List<Char>> {
return "AAB".toList()
.distinctPermutations()
.toList()
}
// [[A, B, C], [A, C, B], [B, A, C], [B, C, A], [C, A, B], [C, B, A]]
fun example2(): List<List<Char>> {
return "ABC".toList()
.distinctPermutations()
.toList()
}Returns a sequence that yields k-sized permutations of elements from this list, allowing individual elements to be
repeated. See also Permutations for without replacement, and
Distinct Permutations for value-based uniqueness.
The permutation tuples are emitted in lexicographic order according to the order of this list.
fun <T> List<T>.permutationsWithReplacement(k: Int = size): Sequence<List<T>>
fun <T> List<T>.pairPermutationsWithReplacement(): Sequence<Pair<T, T>>
fun <T> List<T>.triplePermutationsWithReplacement(): Sequence<Triple<T, T, T>>import com.github.michaelbull.itertools.permutationsWithReplacement
import com.github.michaelbull.itertools.pairPermutationsWithReplacement
import com.github.michaelbull.itertools.triplePermutationsWithReplacement
// [[A, A], [A, B], [A, C], [A, D], [B, A], [B, B], [B, C], [B, D], [C, A], [C, B], [C, C], [C, D], [D, A], [D, B], [D, C], [D, D]]
fun example1(): List<List<Char>> {
return "ABCD".toList()
.permutationsWithReplacement(k = 2)
.toList()
}
// [(A, A), (A, B), (A, C), (B, A), (B, B), (B, C), (C, A), (C, B), (C, C)]
fun example2(): List<Pair<Char, Char>> {
return "ABC".toList()
.pairPermutationsWithReplacement()
.toList()
}
// [(A, A, A), (A, A, B), (A, A, C), (A, B, A), (A, B, B), (A, B, C), (A, C, A), (A, C, B), (A, C, C), (B, A, A), (B, A, B), (B, A, C), (B, B, A), (B, B, B), (B, B, C), (B, C, A), (B, C, B), (B, C, C), (C, A, A), (C, A, B), (C, A, C), (C, B, A), (C, B, B), (C, B, C), (C, C, A), (C, C, B), (C, C, C)]
fun example3(): List<Triple<Char, Char, Char>> {
return "ABC".toList()
.triplePermutationsWithReplacement()
.toList()
}Returns a sequence that yields k-sized derangements of elements from this list. A derangement is a permutation where
no element appears in its original position.
The derangement tuples are emitted in lexicographic order according to the order of this list.
fun <T> List<T>.derangements(k: Int = size): Sequence<List<T>>import com.github.michaelbull.itertools.derangements
// [[B, C, A], [C, A, B]]
fun example1(): List<List<Char>> {
return "ABC".toList()
.derangements()
.toList()
}
// [[B, A], [B, C], [B, D], [C, A], [C, D], [D, A], [D, C]]
fun example2(): List<List<Char>> {
return "ABCD".toList()
.derangements(k = 2)
.toList()
}Returns a sequence that yields the Cartesian product of the input iterables/lists.
The product tuples are emitted in lexicographic order according to the order of this iterable/list.
fun <A, B> Iterable<A>.product(other: Iterable<B>): Sequence<Pair<A, B>>
fun <A, B, C> Iterable<A>.product(first: Iterable<B>, second: Iterable<C>): Sequence<Triple<A, B, C>>
fun <A, B> Pair<Iterable<A>, Iterable<B>>.product(): Sequence<Pair<A, B>>
fun <A, B, C> Triple<Iterable<A>, Iterable<B>, Iterable<C>>.product(): Sequence<Triple<A, B, C>>
fun <T> List<List<T>>.product(): Sequence<List<T>>import com.github.michaelbull.itertools.product
// [(A, x), (A, y), (B, x), (B, y), (C, x), (C, y), (D, x), (D, y)]
fun example1(): List<Pair<Char, Char>> {
val a = "ABCD".toList()
val b = "xy".toList()
return a.product(b).toList()
}
// [(A, C, E), (A, C, F), (A, D, E), (A, D, F), (B, C, E), (B, C, F), (B, D, E), (B, D, F)]
fun example2(): List<Triple<Char, Char, Char>> {
val a = "AB".toList()
val b = "CD".toList()
val c = "EF".toList()
return Triple(a, b, c)
.product()
.toList()
}
// [[A, x], [A, y], [B, x], [B, y], [C, x], [C, y], [D, x], [D, y]]
fun example3(): List<List<Char>> {
val a = "ABCD".toList()
val b = "xy".toList()
return listOf(a, b)
.product()
.toList()
}Note: Unlike Python's
itertools.product(iterable, repeat=n), this function does not accept arepeatparameter. The Cartesian product of a list with itself is equivalent topermutationsWithReplacement:// Python: itertools.product("ABCD", repeat=2) "ABCD".toList().permutationsWithReplacement(k = 2)
Bug reports and pull requests are welcome on GitHub.
This project is available under the terms of the ISC license. See the
LICENSE file for the copyright information and licensing terms.