def __eq__(self, that): if len(self) != len(that): return False if isinstance(that, SortedSet): return (self._list == that._list) elif isinstance(that, set): return (self._set == that) else: _set = self._set return all(val in _set for val in that)
def __ge__(self, that): return ((len(self) >= len(that)) and all(lhs >= rhs for lhs, rhs in zip(self, that)))
def __le__(self, that): return ((len(self) <= len(that)) and all(lhs <= rhs for lhs, rhs in zip(self, that)))
def __eq__(self, that): return ((len(self) == len(that)) and all(lhs == rhs for lhs, rhs in zip(self, that)))
def __eq__(self, that): return (len(self._dict) == len(that) and all((key in that) and (self[key] == that[key]) for key in self))
def __le__(self, that): if isinstance(that, set): return (self._set <= that) else: return all(val in that for val in self._list)
def __gt__(self, that): if isinstance(that, set): return (self._set > that) else: _set = self._set return (len(self) > len(that)) and all(val in _set for val in that)
def __lt__(self, that): if isinstance(that, set): return (self._set < that) else: return (len(self) < len(that)) and all(val in that for val in self._list)
def __ge__(self, that): if isinstance(that, set): return (self._set >= that) else: _set = self._set return all(val in _set for val in that)
def __eq__(self, that): return (len(self._dict) == len(that) and all( (key in that) and (self[key] == that[key]) for key in self))