refactor: pairing algorithm

This commit is contained in:
DvRodri8 2023-12-13 17:25:22 +01:00
commit 5513005e65

View file

@ -15,20 +15,10 @@ class Group(BaseModel):
@staticmethod
def pair(names: list[str]) -> dict[str, str]:
names_copy = names[:]
random.shuffle(names_copy)
pairings = {}
for i, name in enumerate(names):
pair = names_copy[i]
while pair == name:
random.shuffle(names_copy)
pair = names_copy[i]
pairings[name] = pair
return pairings
random.shuffle(names)
names_copy = names[1:]
names_copy.append(names[0])
return dict(zip(names, names_copy))
class IRepo(ABC):
@abstractmethod