wg dZddlmZddlZddlmZddlmZddl m Z ddl m Z dd l m Z dd l mZdd l mZdd l mZdd l mZddl mZddl mZGddeeefeeefZGddeeefZy)z3Provide :class:`MutableBidict` and :class:`bidict`.) annotationsN)MutableBidirectionalMapping) BidictBase)ON_DUP_DROP_OLD) ON_DUP_RAISE)OnDup)DT)KT)MISSING)ODT)VT) MapOrItemsc eZdZdZej reddZeddZddZ ddZ ddZ e fddZ ddZdd Zej dd Zej ddd Zefdd Zdd ZdddZdddZe fddZd dZy)! MutableBidictz.Base class for mutable bidirectional mappings.cyNselfs S/home/mcse/projects/flask/flask-venv/lib/python3.12/site-packages/bidict/_bidict.pyinversezMutableBidict.inverse's47cyrrrs rinvzMutableBidict.inv*s03rcV|jj|}|j|=|Sr)_fwdmpop_invmrkeyvals r_popzMutableBidict._pop-s$jjnnS! JJsO rc&|j|y)u#*x.__delitem__(y)　⟺　del x[y]*N)r#rr!s r __delitem__zMutableBidict.__delitem__2s  #rc@|j|||jy)a*Set 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__zMutableBidict.__setitem__6s4 c$++.rc0|j||ff|y)aMAssociate *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*zMutableBidict.putRs0 sCj]6 2rc4|j||ty)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 rforceputzMutableBidict.forceputls c/2rcl|jj|jjy)zRemove all items.N)rclearrrs rr2zMutableBidict.clearts"  rcyrrr%s rrzMutableBidict.popys%(rcyrrrr!defaults rrzMutableBidict.pop{s=@rcZ |j|S#t$r|tur|cYSwxYw)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 r5s rrzMutableBidict.pop~s4 99S> ! '!N s **c^|jj\}}|j|=||fS)u*x.popitem() → (k, v)* Remove and return some item as a (key, value) pair. :raises KeyError: if *x* is empty. )rpopitemrr s rr:zMutableBidict.popitems.::%%'S JJsOCxrc *|j||y)zCLike calling :meth:`putall` with *self.on_dup* passed for *on_dup*.)kwNr-rargr<s rupdatezMutableBidict.updates SR  rc 4|j||ty)zLike a bulk :meth:`forceput`.)r<r)N)r.rr=s r forceupdatezMutableBidict.forceupdates SR 8rc*|j||y)zLike a bulk :meth:`put`. If one of the given items causes an exception to be raised, none of the items is inserted. r(Nr-)ritemsr)s rputallzMutableBidict.putalls U6 *rc(|j||S)zReturn self|=other.)r?)rothers r__ior__zMutableBidict.__ior__s E rN)returnzMutableBidict[VT, KT])r!r rHr)r!r rHNone)r!r r"rrHrI)r!r r"rr)r rHrI)rHrI).)r!r r6r rHVT | DT)r!r r6zODT[DT]rHrJ)rHz tuple[KT, VT])r)r>MapOrItems[KT, VT]r<rrHrI)rCrKr)r rHrI)rFzt.Mapping[KT, VT]rHzMutableBidict[KT, VT])__name__ __module__ __qualname____doc__t TYPE_CHECKINGpropertyrrr#r&r+rr*r0r2overloadrr r:r?rArDrGrrrrr"s8 7 7 3 3 /85A343 ZZ((ZZ@@.5  !9AM+rrcNeZdZdZej reddZeddZyy)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). cyrrrs rrzbidict.inverses-0rcyrrrs rrz bidict.invs),rN)rHzbidict[VT, KT]) rLrMrNrOrPrQrRrrrrrrUrUs1   0 0 , , rrU)rO __future__rtypingrP_abcr_baser_duprrr _typingr r r r rrrrUrrrr^sj:"-!JJr2v&(CBF(KJZ -]2r6 " -r