T=j SSKJr SSKrSSKJrJrJrJrJr SSK J r J r J r J r \(a%SSKJr SSKJr SS KJr "S S \\\ \ \ 45rO\R*"S /S Q5r"S S\\ \ \ 45rg)) annotationsN) TYPE_CHECKINGAnyGenericIterable NamedTuple)CTKTRT DirectedGraph)AbstractProvider) BaseReporter) Criterionc4\rSrSr%S\S'S\S'S\S'Srg ) Result z dict[KT, CT]mappingzDirectedGraph[KT | None]graphzdict[KT, Criterion[RT, CT]]criteriaN)__name__ __module__ __qualname____firstlineno____annotations____static_attributes__rm/Users/stevendouglas/BidBrain/.venv/lib/python3.13/site-packages/pip/_vendor/resolvelib/resolvers/abstract.pyrr s''--rr)rrrc<\rSrSrSr\rSSjrSSjrSr g) AbstractResolverz3The thing that performs the actual resolution work.cXlX lg)Nproviderreporter)selfr&r's r __init__AbstractResolver.__init__s !  rc [e)aTake a collection of constraints, spit out the resolution result. This returns a representation of the final resolution state, with one guarenteed attribute ``mapping`` that contains resolved candidates as values. The keys are their respective identifiers. :param requirements: A collection of constraints. :param kwargs: Additional keyword arguments that subclasses may accept. :raises: ``self.base_exception`` or its subclass. )NotImplementedError)r( requirementskwargss r resolveAbstractResolver.resolve#s "!rr%N)r&zAbstractProvider[RT, CT, KT]r'zBaseReporter[RT, CT, KT]returnNone)r-z Iterable[RT]r.rr1zResult[RT, CT, KT]) rrrr__doc__ Exceptionbase_exceptionr)r/rrrr r"r"s0=N!.!+!  ! "rr") __future__r collectionstypingrrrrrstructsr r r r providersr reportersr criterionrr namedtupler"rrr r>sh"DD//,($.WRRZ0.  # #H.N OF"wr2rz*"r