22 lines
867 B
Python
22 lines
867 B
Python
|
from random import Random
|
||
|
|
from typing import Dict, List, MutableSequence, Sequence, Set, Tuple
|
||
|
|
|
||
|
|
|
||
|
|
def constrained_choices(population: Sequence[int], d: int, *, k: int, random: Random) -> List[int]:
|
||
|
|
n: int = len(population)
|
||
|
|
constraints: Dict[int, Tuple[int, ...]] = {
|
||
|
|
i: tuple(dict.fromkeys(population[j] for j in range(max(0, i - d), min(i + d + 1, n)))) for i in range(n)
|
||
|
|
}
|
||
|
|
|
||
|
|
return [random.choice(constraints[i]) for i in range(k)]
|
||
|
|
|
||
|
|
|
||
|
|
def constrained_shuffle(x: MutableSequence[int], d: int, random: Random) -> None:
|
||
|
|
n: int = len(x)
|
||
|
|
constraints: Dict[int, Set[int]] = {i: set(x[j] for j in range(max(0, i - d), min(i + d + 1, n))) for i in range(n)}
|
||
|
|
|
||
|
|
for _ in range(d * n * n):
|
||
|
|
i, j = random.randrange(n), random.randrange(n)
|
||
|
|
if x[i] in constraints[j] and x[j] in constraints[i]:
|
||
|
|
x[i], x[j] = x[j], x[i]
|