bidict/_base.py
def inverse(self):
        """The inverse of this bidict.

        *See also* :attr:`inv`
        """
        # Resolve and return a strong reference to the inverse bidict.
        # One may be stored in self._inv already.
        if self._inv is not None:
            return self._inv
        # Otherwise a weakref is stored in self._invweak. Try to get a strong ref from it.
        inv = self._invweak()
        if inv is not None:
            return inv
        # Refcount of referent must have dropped to zero, as in `bidict().inv.inv`. Init a new one.
        self._init_inv()  # Now this bidict will retain a strong ref to its inverse.
        return self._inv
def inverse(self):
        # Resolve and return a strong reference to the inverse bidict.
        # One may be stored in self._inv already.
        if self._inv is not None:
            return self._inv
        # Otherwise a weakref is stored in self._invweak. Try to get a strong ref from it.
        inv = self._invweak()
        if inv is not None:
            return inv
        # Refcount of referent must have dropped to zero, as in `bidict().inv.inv`. Init a new one.
        self._init_inv()  # Now this bidict will retain a strong ref to its inverse.
        return self._inv
def inverse ( self ) : # Resolve and return a strong reference to the inverse bidict. # One may be stored in self._inv already. if self . _inv is not None : return self . _inv # Otherwise a weakref is stored in self._invweak. Try to get a strong ref from it. inv = self . _invweak ( ) if inv is not None : return inv # Refcount of referent must have dropped to zero, as in `bidict().inv.inv`. Init a new one. self . _init_inv ( ) # Now this bidict will retain a strong ref to its inverse. return self . _inv
The inverse of this bidict.

        *See also* :attr:`inv`
The inverse of this bidict .