 def __sub__(self: _SelfT, other: Iterable[_T]) -> _SelfT: ...
    def difference_update(self: _SelfT, other: Iterable[_T]) -> None: ...
    def __isub__(self: _SelfT, other: Iterable[_T]) -> _SelfT: ...
    def intersection(self: _SelfT, other: Iterable[_T]) -> _SelfT: ...
    def __and__(self: _SelfT, other: Iterable[_T]) -> _SelfT: ...
    def intersection_update(self, other: Iterable[_T]) -> None: ...
    def __iand__(self: _SelfT, other: Iterable[_T]) -> _SelfT: ...
    def issubset(self, other: Iterable[_T]) -> bool: ...
    def __le__(self, other: Iterable[_T]) -> bool: ...
    def __lt__(self, other: Iterable[_T]) -> bool: ...
    def issuperset(self, other: Iterable[_T]) -> bool: ...
    def __ge__(self, other: Iterable[_T]) -> bool: ...
    def __gt__(self, other: Iterable[_T]) -> bool: ...
    def __eq__(self, other: object) -> bool: ...
    def symmetric_difference(self, other: Iterable[_S]) -> WeakSet[Union[_S, _T]]: ...
    def __xor__(self, other: Iterable[_S]) -> WeakSet[Union[_S, _T]]: ...
    def symmetric_difference_update(self, other: Iterable[_S]) -> None: ...
    def __ixor__(self, other: Iterable[_S]) -> WeakSet[Union[_S, _T]]: ...
    def union(self, other: Iterable[_S]) -> WeakSet[Union[_S, _T]]: ...
    def __or__(self, other: Iterable[_S]) -> WeakSet[Union[_S, _T]]: ...
    def isdisjoint(self, other: Iterable[_T]) -> bool: ...
    if sys.version_info >= (3, 9):
        def __class_getitem__(cls, item: Any) -> GenericAlias: ...
PK