Setting coverage values for probabilistic generators

[mitches-got-glitches]

I'm looking for a way to set the coverage values for unique combinations in a set or collection, so that I can get the coverage I want. Is there currently a method in the API that can help with this?

Here's a rough demonstration of what I want:

rom typing import Literal, Iterable, TypeVar, get_args
from polyfactory.factories.pydantic_factory import ModelFactory
from pydantic import BaseModel
from itertools import chain, combinations

ContactMethod = Literal["email", "mobile", "post"]

T = TypeVar("T")


def powerset(iterable: Iterable[T]) -> list[list[T]]:
    "Subsequences of the iterable from shortest to longest."
    # powerset([1,2,3]) → () (1,) (2,) (3,) (1,2) (1,3) (2,3) (1,2,3)
    s = list(iterable)
    return chain.from_iterable(combinations(s, r) for r in range(len(s) + 1))


class Customer(BaseModel):
    contact_by: set[ContactMethod]


class CustomerFactory(ModelFactory[Customer]): ...


print("Coverage produces this...")
for c in CustomerFactory.coverage():
    print(c)

print("\nBut I want all of these combinations...")
for e in powerset(get_args(ContactMethod)):
    print(e)

Output:

Coverage produces this...
contact_by={'email'}
contact_by={'mobile'}
contact_by={'post'}

But I want all of these combinations...
()
('email',)
('mobile',)
('post',)
('email', 'mobile')
('email', 'post')
('mobile', 'post')
('email', 'mobile', 'post')