Replace frozenset with FrozenSet (#1057)

Author: ilevkivskyi

stdlib/2/__builtin__.pyi

@@ -625,22 +625,22 @@ class frozenset(AbstractSet[_T], Generic[_T]):
     def __init__(self) -> None: ...
     @overload
     def __init__(self, iterable: Iterable[_T]) -> None: ...
-    def copy(self) -> frozenset[_T]: ...
-    def difference(self, *s: Iterable[Any]) -> frozenset[_T]: ...
-    def intersection(self, *s: Iterable[Any]) -> frozenset[_T]: ...
+    def copy(self) -> FrozenSet[_T]: ...
+    def difference(self, *s: Iterable[Any]) -> FrozenSet[_T]: ...
+    def intersection(self, *s: Iterable[Any]) -> FrozenSet[_T]: ...
     def isdisjoint(self, s: Iterable[_T]) -> bool: ...
     def issubset(self, s: Iterable[Any]) -> bool: ...
     def issuperset(self, s: Iterable[Any]) -> bool: ...
-    def symmetric_difference(self, s: Iterable[_T]) -> frozenset[_T]: ...
-    def union(self, *s: Iterable[_T]) -> frozenset[_T]: ...
+    def symmetric_difference(self, s: Iterable[_T]) -> FrozenSet[_T]: ...
+    def union(self, *s: Iterable[_T]) -> FrozenSet[_T]: ...
     def __len__(self) -> int: ...
     def __contains__(self, o: object) -> bool: ...
     def __iter__(self) -> Iterator[_T]: ...
     def __str__(self) -> str: ...
-    def __and__(self, s: AbstractSet[_T]) -> frozenset[_T]: ...
-    def __or__(self, s: AbstractSet[_S]) -> frozenset[Union[_T, _S]]: ...
-    def __sub__(self, s: AbstractSet[_T]) -> frozenset[_T]: ...
-    def __xor__(self, s: AbstractSet[_S]) -> frozenset[Union[_T, _S]]: ...
+    def __and__(self, s: AbstractSet[_T]) -> FrozenSet[_T]: ...
+    def __or__(self, s: AbstractSet[_S]) -> FrozenSet[Union[_T, _S]]: ...
+    def __sub__(self, s: AbstractSet[_T]) -> FrozenSet[_T]: ...
+    def __xor__(self, s: AbstractSet[_S]) -> FrozenSet[Union[_T, _S]]: ...
     def __le__(self, s: AbstractSet[Any]) -> bool: ...
     def __lt__(self, s: AbstractSet[Any]) -> bool: ...
     def __ge__(self, s: AbstractSet[Any]) -> bool: ...

stdlib/2/typing.pyi

@@ -31,6 +31,7 @@ List = TypeAlias(object)
 Dict = TypeAlias(object)
 DefaultDict = TypeAlias(object)
 Set = TypeAlias(object)
+FrozenSet = TypeAlias(object)
 Counter = TypeAlias(object)
 Deque = TypeAlias(object)
 
@@ -164,8 +165,6 @@ class AbstractSet(Sized, Iterable[_T_co], Container[_T_co], Generic[_T_co]):
     # TODO: argument can be any container?
     def isdisjoint(self, s: AbstractSet[Any]) -> bool: ...
 
-class FrozenSet(AbstractSet[_T_co], Generic[_T_co]): ...
-
 class MutableSet(AbstractSet[_T], Generic[_T]):
     @abstractmethod
     def add(self, x: _T) -> None: ...

stdlib/3/builtins.pyi

@@ -672,22 +672,22 @@ class set(MutableSet[_T], Generic[_T]):
 
 class frozenset(AbstractSet[_T], Generic[_T]):
     def __init__(self, iterable: Iterable[_T] = ...) -> None: ...
-    def copy(self) -> frozenset[_T]: ...
-    def difference(self, *s: Iterable[Any]) -> frozenset[_T]: ...
-    def intersection(self, *s: Iterable[Any]) -> frozenset[_T]: ...
+    def copy(self) -> FrozenSet[_T]: ...
+    def difference(self, *s: Iterable[Any]) -> FrozenSet[_T]: ...
+    def intersection(self, *s: Iterable[Any]) -> FrozenSet[_T]: ...
     def isdisjoint(self, s: Iterable[_T]) -> bool: ...
     def issubset(self, s: Iterable[Any]) -> bool: ...
     def issuperset(self, s: Iterable[Any]) -> bool: ...
-    def symmetric_difference(self, s: Iterable[_T]) -> frozenset[_T]: ...
-    def union(self, *s: Iterable[_T]) -> frozenset[_T]: ...
+    def symmetric_difference(self, s: Iterable[_T]) -> FrozenSet[_T]: ...
+    def union(self, *s: Iterable[_T]) -> FrozenSet[_T]: ...
     def __len__(self) -> int: ...
     def __contains__(self, o: object) -> bool: ...
     def __iter__(self) -> Iterator[_T]: ...
     def __str__(self) -> str: ...
-    def __and__(self, s: AbstractSet[_T]) -> frozenset[_T]: ...
-    def __or__(self, s: AbstractSet[_S]) -> frozenset[Union[_T, _S]]: ...
-    def __sub__(self, s: AbstractSet[_T]) -> frozenset[_T]: ...
-    def __xor__(self, s: AbstractSet[_S]) -> frozenset[Union[_T, _S]]: ...
+    def __and__(self, s: AbstractSet[_T]) -> FrozenSet[_T]: ...
+    def __or__(self, s: AbstractSet[_S]) -> FrozenSet[Union[_T, _S]]: ...
+    def __sub__(self, s: AbstractSet[_T]) -> FrozenSet[_T]: ...
+    def __xor__(self, s: AbstractSet[_S]) -> FrozenSet[Union[_T, _S]]: ...
     def __le__(self, s: AbstractSet[Any]) -> bool: ...
     def __lt__(self, s: AbstractSet[Any]) -> bool: ...
     def __ge__(self, s: AbstractSet[Any]) -> bool: ...

stdlib/3/typing.pyi

@@ -32,6 +32,7 @@ List = TypeAlias(object)
 Dict = TypeAlias(object)
 DefaultDict = TypeAlias(object)
 Set = TypeAlias(object)
+FrozenSet = TypeAlias(object)
 Counter = TypeAlias(object)
 Deque = TypeAlias(object)
 if sys.version_info >= (3, 3):
@@ -240,8 +241,6 @@ class AbstractSet(_Collection[_T_co], Generic[_T_co]):
     # TODO: Argument can be a more general ABC?
     def isdisjoint(self, s: AbstractSet[Any]) -> bool: ...
 
-class FrozenSet(AbstractSet[_T_co], Generic[_T_co]): ...
-
 class MutableSet(AbstractSet[_T], Generic[_T]):
     @abstractmethod
     def add(self, x: _T) -> None: ...