Infinite sequence of all combinations

[svenstaro]

Given a list of inputs ["A", "B", "C"] I want an iterator that gives me an infinite combination output so that we get ["A", "B", "C", "AA", "AB", ..., "CCCC", .... I don't believe this is currently easily possible using itertools.

[svenstaro]

Perhaps this is not "combinations" mathematically speaking but rather a product.

[tobz1000]

This can probably be done with some adaption of MultiProduct. To add a bit more flexibility, it could take a meta-iterator, incremenally yielding items from the first iterator, then the product of the first two, etc. until termination (or not, if the meta-iterator is infinite).

e.g.

for x in (0..4).map(|_| 0..=1).incremental_product() {
    // [0] -> [1] -> [0, 0] -> [0, 1] ... [1, 1, 0, 1] -> [1, 1, 1, 0] -> [1, 1, 1, 1]
}

Then your use case could be achieved with

repeat(&["A", "B", "C"]).incremental_product()