i SrSSKJr SSKrSSKJr SSKJr SSK J r SSK J r SS K J r SS K Jr SS K Jr SS K Jr SS K Jr SSK Jr SSK Jr "SS\\\4\\\45r"SS\\\45rg)z3Provide :class:`MutableBidict` and :class:`bidict`.) annotationsN)MutableBidirectionalMapping) BidictBase)ON_DUP_DROP_OLD) ON_DUP_RAISE)OnDup)DT)KT)MISSING)ODT)VT) MapOrItemscH\rSrSrSr\R (a\SSj5r\SSj5r SSjr SSjr SSjr \ 4SSjjrSS jrSS jr\R"SS j5r\R"SSS jj5r\4SS jjrSSjrSS SjjrSS Sjjr\ 4S!SjjrS"SjrSrg)# MutableBidict"z.Base class for mutable bidirectional mappings.cgNselfs K/home/admin/cozy_coffee/venv/lib/python3.13/site-packages/bidict/_bidict.pyinverseMutableBidict.inverse's47cgrrrs rinvMutableBidict.inv*s03rcVURRU5nURU U$r)_fwdmpop_invmrkeyvals r_popMutableBidict._pop-s$jjnnS! JJsO rc&URU5 g)u#*x.__delitem__(y)　⟺　del x[y]*N)r&rr$s r __delitem__MutableBidict.__delitem__2s  #rc8URXURS9 g)aSet the value for *key* to *val*. If *key* is already associated with *val*, this is a no-op. If *key* is already associated with a different value, the old value will be replaced with *val*, as with dict's :meth:`__setitem__`. If *val* is already associated with a different key, an exception is raised to protect against accidental removal of the key that's currently associated with *val*. Use :meth:`put` instead if you want to specify different behavior in the case that the provided key or value duplicates an existing one. Or use :meth:`forceput` to unconditionally associate *key* with *val*, replacing any existing items as necessary to preserve uniqueness. :raises bidict.ValueDuplicationError: if *val* duplicates that of an existing item. :raises bidict.KeyAndValueDuplicationError: if *key* duplicates the key of an existing item and *val* duplicates the value of a different existing item. on_dupN)putr.r#s r __setitem__MutableBidict.__setitem__6s4 $++.rc(URX44US9 g)aAssociate *key* with *val*, honoring the :class:`OnDup` given in *on_dup*. For example, if *on_dup* is :attr:`~bidict.ON_DUP_RAISE`, then *key* will be associated with *val* if and only if *key* is not already associated with an existing value and *val* is not already associated with an existing key, otherwise an exception will be raised. If *key* is already associated with *val*, this is a no-op. :raises bidict.KeyDuplicationError: if attempting to insert an item whose key only duplicates an existing item's, and *on_dup.key* is :attr:`~bidict.RAISE`. :raises bidict.ValueDuplicationError: if attempting to insert an item whose value only duplicates an existing item's, and *on_dup.val* is :attr:`~bidict.RAISE`. :raises bidict.KeyAndValueDuplicationError: if attempting to insert an item whose key duplicates one existing item's, and whose value duplicates another existing item's, and *on_dup.val* is :attr:`~bidict.RAISE`. r-N_update)rr$r%r.s rr/MutableBidict.putRs0 sj]6 2rc,URX[S9 g)zAssociate *key* with *val* unconditionally. Replace any existing mappings containing key *key* or value *val* as necessary to preserve uniqueness. r-N)r/rr#s rforceputMutableBidict.forceputls /2rclURR5 URR5 g)zRemove all items.N)r clearr"rs rr:MutableBidict.clearts"  rcgrrr)s rr!MutableBidict.popys%(rcgrrrr$defaults rr!r={s=@rc^URU5$![a U[LaeUs$f=f)u*x.pop(k[, d]) → v* Remove specified key and return the corresponding value. :raises KeyError: if *key* is not found and no *default* is provided. )r&KeyErrorr r?s rr!r=~s4 99S> ! '!N s ,,cZURR5upURU X4$)ur*x.popitem() → (k, v)* Remove and return some item as a (key, value) pair. :raises KeyError: if *x* is empty. )r popitemr"r#s rrDMutableBidict.popitems*::%%' JJsOxrrc "URXS9 g)zCLike calling :meth:`putall` with *self.on_dup* passed for *on_dup*.)kwNr3rargrGs rupdateMutableBidict.updates S  rc ,URX[S9 g)zLike a bulk :meth:`forceput`.)rGr.N)r4rrHs r forceupdateMutableBidict.forceupdates S 8rc"URXS9 g)zuLike a bulk :meth:`put`. If one of the given items causes an exception to be raised, none of the items is inserted. r-Nr3)ritemsr.s rputallMutableBidict.putalls U *rc(URU5 U$)zReturn self|=other.)rJ)rothers r__ior__MutableBidict.__ior__s E rN)returnzMutableBidict[VT, KT])r$r rWr)r$r rWNone)r$r r%rrWrX)r$r r%rr.r rWrX)rWrX).)r$r r@r rWVT | DT)r$r r@zODT[DT]rWrY)rWz tuple[KT, VT])r)rIMapOrItems[KT, VT]rGrrWrX)rPrZr.r rWrX)rTzt.Mapping[KT, VT]rWzMutableBidict[KT, VT])__name__ __module__ __qualname____firstlineno____doc__t TYPE_CHECKINGpropertyrrr&r*r0rr/r7r:overloadr!r rDrJrMrQrU__static_attributes__rrrrr"s8 7 7 3 3 /85A343 ZZ((ZZ@@.5  !9AM+rrch\rSrSrSr\R (a\SSj5r\SSj5r Sr gSr g)bidictzThe main bidirectional mapping type. See :ref:`intro:Introduction` and :ref:`basic-usage:Basic Usage` to get started (also available at https://bidict.rtfd.io). cgrrrs rrbidict.inverses-0rcgrrrs rr bidict.invs),rrN)rWzbidict[VT, KT]) r[r\r]r^r_r`rarbrrrdrrrrfrfs1   0 0 , , rrf)r_ __future__rtypingr`_abcr_baser_duprrr _typingr r r r rrrrfrrrrrsj:"-!JJr2v&(CBF(KJZ -]2r6 " -r