A modern programming language that makes developers happier.

kotlinlang

how would you call what I called `cartesianProduct`?

```listOf(1, 2, 3, 4).cartesianProduct() shouldContainExactlyInAnyOrder listOf(
  listOf(1),
  listOf(2),
  listOf(3),
  listOf(4),
  listOf(1, 2),
  listOf(1, 3),
  listOf(1, 4),
  listOf(2, 3),
  listOf(2, 4),
  listOf(3, 4),
  listOf(1, 2, 3),
  listOf(1, 2, 4),
  listOf(1, 3, 4),
  listOf(2, 3, 4),
  listOf(1, 2, 3, 4)
)```
permutations? combinations?

I know it is something, but cannot figure out what

found <https://www.geeksforgeeks.org/find-distinct-subsets-given-set/>, went for subsets

Maybe `powerSet()` ? The power set should include the empty set as well though.

<https://en.wikipedia.org/wiki/Power_set>

for my use case, the empty set is not needed. but I can still call the method something on the line of powerSet (nonEmptyPowerSet, or just remove the empty set in a second step)

Yes, it’s a powerset P(A), minus the empty set. A cartesian product between two sets A and B is the set of all ordered pairs (_a_, _b_)