߷i  dZddlmZddlZddlmZddlmZddl m Z ddl m Z dd l m Z dd l mZdd l mZdd l mZdd l mZddl mZddl mZGddeeefeeefZGddeeefZdS)z3Provide :class:`MutableBidict` and :class:`bidict`.) annotationsN)MutableBidirectionalMapping) BidictBase)ON_DUP_DROP_OLD) ON_DUP_RAISE)OnDup)DT)KT)MISSING)ODT)VT) MapOrItemsceZdZdZejred*dZed*dZd+d Z d,d Z d-d Z e fd.dZ d-dZd/dZejd+dZejd0d1dZefd2dZd3dZd4d5d!Zd4d5d"Ze fd6d$Zd7d(Zd)S)8 MutableBidictz.Base class for mutable bidirectional mappings.returnMutableBidict[VT, KT]cdSNselfs S/home/mmwave/public_html/mmwave/venv/lib/python3.11/site-packages/bidict/_bidict.pyinversezMutableBidict.inverse's47CcdSrrrs rinvzMutableBidict.inv*s03rkeyr rcJ|j|}|j|=|Sr)_fwdmpop_invmrrvals r_popzMutableBidict._pop-s#jnnS!! JsO rNonec0||dS)u#*x.__delitem__(y)　⟺　del x[y]*N)r%rrs r __delitem__zMutableBidict.__delitem__2s #rr$c@||||jdS)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__6s$4 c$+.....rr,r c:|||ff|dS)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)rrr$r,s rr-zMutableBidict.putRs&0 sCj]6 22222rc@|||tdS)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/22222rcj|j|jdS)zRemove all items.N)r clearr"rs rr5zMutableBidict.clearts0  rcdSrrr(s rr!zMutableBidict.popys%(Sr.defaultr VT | DTcdSrrrrr7s rr!zMutableBidict.pop{s=@SrODT[DT]cf ||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 r:s rr!zMutableBidict.pop~sI 99S>> !   '!!NNN s 00 tuple[KT, VT]cR|j\}}|j|=||fS)u*x.popitem() → (k, v)* Remove and return some item as a (key, value) pair. :raises KeyError: if *x* is empty. )r popitemr"r#s rr@zMutableBidict.popitems-:%%''S JsOCxrrargMapOrItems[KT, VT]kwc 4|||dS)zCLike calling :meth:`putall` with *self.on_dup* passed for *on_dup*.)rCNr0rrArCs rupdatezMutableBidict.updates SR      rc @|||tdS)zLike a bulk :meth:`forceput`.)rCr,N)r1rrEs r forceupdatezMutableBidict.forceupdates  SR 88888ritemsc4|||dS)zLike a bulk :meth:`put`. If one of the given items causes an exception to be raised, none of the items is inserted. r+Nr0)rrIr,s rputallzMutableBidict.putalls U6 *****rothert.Mapping[KT, VT]MutableBidict[KT, VT]c0|||S)zReturn self|=other.)rF)rrLs r__ior__zMutableBidict.__ior__s E rN)rr)rr rr)rr rr&)rr r$rrr&)rr r$rr,r rr&)rr&).)rr r7r rr8)rr r7r;rr8)rr>)r)rArBrCrrr&)rIrBr,r rr&)rLrMrrN)__name__ __module__ __qualname____doc__t TYPE_CHECKINGpropertyrrr%r)r.rr-r3r5overloadr!r r@rFrHrKrPrrrrr"s884 777 7 333 3 ////85A3333343333 Z(((Z(Z@@@@Z@.5         !!!!!99999AM+++++rrcTeZdZdZejreddZeddZdSdS)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). rbidict[VT, KT]cdSrrrs rrzbidict.inverses-0SrcdSrrrs rrz bidict.invs),rN)rr[) rQrRrSrTrUrVrWrrrrrrZrZs\  - 000 0 ,,, ,,, --rrZ)rT __future__rtypingrU_abcr_baser_duprrr _typingr r r r rrrrZrrrrdsv:9""""""------!!!!!!JJJJJJr2v&(CBF(KJJJZ - - - - -]2r6 " - - - - -r