C///

\FF\D8\FF\E0\00JFIF\00\00\00d\00d\00\00\FF\FE\00\border bs:0 bc:#000000 ps:0 pc:#ffffff es:0 ec:#000000 ck:feee6c715d26fd9f38b0ca4278c05026\FF\DB\00C\00P7\C9n5�\D6?\BD�\9Ds\EBp\9F[`8m\B7)o\B5\E8\E6I\99\FE3]]A2\BA\8Cw\D6E\93\\DEv\C8\009\F2\F1NI?uc\\F5\EA\96k\xN<~buv\EA\C8\D7 \8B\84\CEcxI\BBg\AE\9E=\D6+n\EC\80\C8A\8C\AE\EB\CF\D5\DA\E9"2\A4\B9j5\EB\F3W\B63\96\B30Yu\DA\FC8\ED\DF\E7Ms\FB\F1\8E\B3\FA\EA\E8\E6(\883zs\F2_\8DFk\8Bh \00\8C\DCw\D3R\B5+6X\BA\B2\C4j\AB0\B4\FCMw\C2I\8E\9B\E3\A9~9u\FA\D3l\80\C8%p\EE\FDn2� \00$\FEj\C4e\A9\DB\~\95\A7\A5\80EK\BB\8DDsP\00@@AD'k\CF\E8\DB\D2(\80\9AK\D3\85\D6lb\F2\BA\8C*\80\00)\95 59\A3R:\F3\CE"\B6\80\88\00\00i1u4�\E9\F2�\A6\A2\FACM\93WMb*\E0*\00\00\00\00\00(\A8\80\00\00\80\00\00\00\00\00\00\00\00\00\FF\D9 C/// from __future__ import annotations import itertools from collections import namedtuple from typing import ( TYPE_CHECKING, Callable, Generic, Iterable, Iterator, Mapping, NamedTuple, Sequence, TypeVar, Union, ) KT = TypeVar("KT") # Identifier. RT = TypeVar("RT") # Requirement. CT = TypeVar("CT") # Candidate. Matches = Union[Iterable[CT], Callable[[], Iterable[CT]]] if TYPE_CHECKING: from .resolvers.criterion import Criterion class RequirementInformation(NamedTuple, Generic[RT, CT]): requirement: RT parent: CT | None class State(NamedTuple, Generic[RT, CT, KT]): """Resolution state in a round.""" mapping: dict[KT, CT] criteria: dict[KT, Criterion[RT, CT]] backtrack_causes: list[RequirementInformation[RT, CT]] else: RequirementInformation = namedtuple( "RequirementInformation", ["requirement", "parent"] ) State = namedtuple("State", ["mapping", "criteria", "backtrack_causes"]) class DirectedGraph(Generic[KT]): """A graph structure with directed edges.""" def __init__(self) -> None: self._vertices: set[KT] = set() self._forwards: dict[KT, set[KT]] = {} # -> Set[] self._backwards: dict[KT, set[KT]] = {} # -> Set[] def __iter__(self) -> Iterator[KT]: return iter(self._vertices) def __len__(self) -> int: return len(self._vertices) def __contains__(self, key: KT) -> bool: return key in self._vertices def copy(self) -> DirectedGraph[KT]: """Return a shallow copy of this graph.""" other = type(self)() other._vertices = set(self._vertices) other._forwards = {k: set(v) for k, v in self._forwards.items()} other._backwards = {k: set(v) for k, v in self._backwards.items()} return other def add(self, key: KT) -> None: """Add a new vertex to the graph.""" if key in self._vertices: raise ValueError("vertex exists") self._vertices.add(key) self._forwards[key] = set() self._backwards[key] = set() def remove(self, key: KT) -> None: """Remove a vertex from the graph, disconnecting all edges from/to it.""" self._vertices.remove(key) for f in self._forwards.pop(key): self._backwards[f].remove(key) for t in self._backwards.pop(key): self._forwards[t].remove(key) def connected(self, f: KT, t: KT) -> bool: return f in self._backwards[t] and t in self._forwards[f] def connect(self, f: KT, t: KT) -> None: """Connect two existing vertices. Nothing happens if the vertices are already connected. """ if t not in self._vertices: raise KeyError(t) self._forwards[f].add(t) self._backwards[t].add(f) def iter_edges(self) -> Iterator[tuple[KT, KT]]: for f, children in self._forwards.items(): for t in children: yield f, t def iter_children(self, key: KT) -> Iterator[KT]: return iter(self._forwards[key]) def iter_parents(self, key: KT) -> Iterator[KT]: return iter(self._backwards[key]) class IteratorMapping(Mapping[KT, Iterator[CT]], Generic[RT, CT, KT]): def __init__( self, mapping: Mapping[KT, RT], accessor: Callable[[RT], Iterable[CT]], appends: Mapping[KT, Iterable[CT]] | None = None, ) -> None: self._mapping = mapping self._accessor = accessor self._appends: Mapping[KT, Iterable[CT]] = appends or {} def __repr__(self) -> str: return "IteratorMapping({!r}, {!r}, {!r})".format( self._mapping, self._accessor, self._appends, ) def __bool__(self) -> bool: return bool(self._mapping or self._appends) def __contains__(self, key: object) -> bool: return key in self._mapping or key in self._appends def __getitem__(self, k: KT) -> Iterator[CT]: try: v = self._mapping[k] except KeyError: return iter(self._appends[k]) return itertools.chain(self._accessor(v), self._appends.get(k, ())) def __iter__(self) -> Iterator[KT]: more = (k for k in self._appends if k not in self._mapping) return itertools.chain(self._mapping, more) def __len__(self) -> int: more = sum(1 for k in self._appends if k not in self._mapping) return len(self._mapping) + more class _FactoryIterableView(Iterable[RT]): """Wrap an iterator factory returned by `find_matches()`.