189 lines
7.2 KiB
Python
189 lines
7.2 KiB
Python
|
# -*- coding: utf-8 -*-
|
|||
|
|
# Copyright 2009-2020 Joshua Bronson. All Rights Reserved.
|
|||
|
|
#
|
|||
|
|
# This Source Code Form is subject to the terms of the Mozilla Public
|
|||
|
|
# License, v. 2.0. If a copy of the MPL was not distributed with this
|
|||
|
|
# file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
|||
|
|
|
|||
|
|
|
|||
|
|
#==============================================================================
|
|||
|
|
# * Welcome to the bidict source code *
|
|||
|
|
#==============================================================================
|
|||
|
|
|
|||
|
|
# Doing a code review? You'll find a "Code review nav" comment like the one
|
|||
|
|
# below at the top and bottom of the most important source files. This provides
|
|||
|
|
# a suggested initial path through the source when reviewing.
|
|||
|
|
#
|
|||
|
|
# Note: If you aren't reading this on https://github.com/jab/bidict, you may be
|
|||
|
|
# viewing an outdated version of the code. Please head to GitHub to review the
|
|||
|
|
# latest version, which contains important improvements over older versions.
|
|||
|
|
#
|
|||
|
|
# Thank you for reading and for any feedback you provide.
|
|||
|
|
|
|||
|
|
# * Code review nav *
|
|||
|
|
#==============================================================================
|
|||
|
|
# ← Prev: _frozenbidict.py Current: _mut.py Next: _bidict.py →
|
|||
|
|
#==============================================================================
|
|||
|
|
|
|||
|
|
|
|||
|
|
"""Provide :class:`MutableBidict`."""
|
|||
|
|
|
|||
|
|
import typing as _t
|
|||
|
|
|
|||
|
|
from ._abc import MutableBidirectionalMapping
|
|||
|
|
from ._base import BidictBase
|
|||
|
|
from ._dup import OnDup, ON_DUP_RAISE, ON_DUP_DROP_OLD
|
|||
|
|
from ._typing import _NONE, KT, VT, VDT, IterItems, MapOrIterItems
|
|||
|
|
|
|||
|
|
|
|||
|
|
class MutableBidict(BidictBase[KT, VT], MutableBidirectionalMapping[KT, VT]):
|
|||
|
|
"""Base class for mutable bidirectional mappings."""
|
|||
|
|
|
|||
|
|
__slots__ = ()
|
|||
|
|
|
|||
|
|
if _t.TYPE_CHECKING:
|
|||
|
|
@property
|
|||
|
|
def inverse(self) -> 'MutableBidict[VT, KT]': ...
|
|||
|
|
|
|||
|
|
def __delitem__(self, key: KT) -> None:
|
|||
|
|
"""*x.__delitem__(y) ⟺ del x[y]*"""
|
|||
|
|
self._pop(key)
|
|||
|
|
|
|||
|
|
def __setitem__(self, key: KT, val: VT) -> None:
|
|||
|
|
"""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.
|
|||
|
|
"""
|
|||
|
|
self._put(key, val, self.on_dup)
|
|||
|
|
|
|||
|
|
def put(self, key: KT, val: VT, on_dup: OnDup = ON_DUP_RAISE) -> None:
|
|||
|
|
"""Associate *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.kv* is
|
|||
|
|
:attr:`~bidict.RAISE`.
|
|||
|
|
"""
|
|||
|
|
self._put(key, val, on_dup)
|
|||
|
|
|
|||
|
|
def forceput(self, key: KT, val: VT) -> None:
|
|||
|
|
"""Associate *key* with *val* unconditionally.
|
|||
|
|
|
|||
|
|
Replace any existing mappings containing key *key* or value *val*
|
|||
|
|
as necessary to preserve uniqueness.
|
|||
|
|
"""
|
|||
|
|
self._put(key, val, ON_DUP_DROP_OLD)
|
|||
|
|
|
|||
|
|
def clear(self) -> None:
|
|||
|
|
"""Remove all items."""
|
|||
|
|
self._fwdm.clear()
|
|||
|
|
self._invm.clear()
|
|||
|
|
|
|||
|
|
@_t.overload
|
|||
|
|
def pop(self, key: KT) -> VT: ...
|
|||
|
|
@_t.overload
|
|||
|
|
def pop(self, key: KT, default: VDT = ...) -> VDT: ...
|
|||
|
|
def pop(self, key: KT, default: VDT = _NONE) -> VDT:
|
|||
|
|
"""*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.
|
|||
|
|
"""
|
|||
|
|
try:
|
|||
|
|
return self._pop(key)
|
|||
|
|
except KeyError:
|
|||
|
|
if default is _NONE:
|
|||
|
|
raise
|
|||
|
|
return default
|
|||
|
|
|
|||
|
|
def popitem(self) -> _t.Tuple[KT, VT]:
|
|||
|
|
"""*x.popitem() → (k, v)*
|
|||
|
|
|
|||
|
|
Remove and return some item as a (key, value) pair.
|
|||
|
|
|
|||
|
|
:raises KeyError: if *x* is empty.
|
|||
|
|
"""
|
|||
|
|
if not self:
|
|||
|
|
raise KeyError('mapping is empty')
|
|||
|
|
key, val = self._fwdm.popitem()
|
|||
|
|
del self._invm[val]
|
|||
|
|
return key, val
|
|||
|
|
|
|||
|
|
@_t.overload
|
|||
|
|
def update(self, __arg: _t.Mapping[KT, VT], **kw: VT) -> None: ...
|
|||
|
|
@_t.overload
|
|||
|
|
def update(self, __arg: IterItems[KT, VT], **kw: VT) -> None: ...
|
|||
|
|
@_t.overload
|
|||
|
|
def update(self, **kw: VT) -> None: ...
|
|||
|
|
def update(self, *args: MapOrIterItems[KT, VT], **kw: VT) -> None:
|
|||
|
|
"""Like calling :meth:`putall` with *self.on_dup* passed for *on_dup*."""
|
|||
|
|
if args or kw:
|
|||
|
|
self._update(False, self.on_dup, *args, **kw)
|
|||
|
|
|
|||
|
|
@_t.overload
|
|||
|
|
def forceupdate(self, __arg: _t.Mapping[KT, VT], **kw: VT) -> None: ...
|
|||
|
|
@_t.overload
|
|||
|
|
def forceupdate(self, __arg: IterItems[KT, VT], **kw: VT) -> None: ...
|
|||
|
|
@_t.overload
|
|||
|
|
def forceupdate(self, **kw: VT) -> None: ...
|
|||
|
|
def forceupdate(self, *args: MapOrIterItems[KT, VT], **kw: VT) -> None:
|
|||
|
|
"""Like a bulk :meth:`forceput`."""
|
|||
|
|
self._update(False, ON_DUP_DROP_OLD, *args, **kw)
|
|||
|
|
|
|||
|
|
@_t.overload
|
|||
|
|
def putall(self, items: _t.Mapping[KT, VT], on_dup: OnDup) -> None: ...
|
|||
|
|
@_t.overload
|
|||
|
|
def putall(self, items: IterItems[KT, VT], on_dup: OnDup = ON_DUP_RAISE) -> None: ...
|
|||
|
|
def putall(self, items: MapOrIterItems[KT, VT], on_dup: OnDup = ON_DUP_RAISE) -> None:
|
|||
|
|
"""Like a bulk :meth:`put`.
|
|||
|
|
|
|||
|
|
If one of the given items causes an exception to be raised,
|
|||
|
|
none of the items is inserted.
|
|||
|
|
"""
|
|||
|
|
if items:
|
|||
|
|
self._update(False, on_dup, items)
|
|||
|
|
|
|||
|
|
|
|||
|
|
# * Code review nav *
|
|||
|
|
#==============================================================================
|
|||
|
|
# ← Prev: _frozenbidict.py Current: _mut.py Next: _bidict.py →
|
|||
|
|
#==============================================================================
|