Big diff: Use new "|" union syntax (#5872)

stdlib/lib2to3/pytree.pyi

@@ -14,7 +14,7 @@ def type_repr(type_num: int) -> str: ...
 
 class Base:
     type: int
-    parent: Optional[Node]
+    parent: Node | None
     prefix: str
     children: List[_NL]
     was_changed: bool
@@ -24,14 +24,14 @@ class Base:
     def clone(self: _P) -> _P: ...
     def post_order(self) -> Iterator[_NL]: ...
     def pre_order(self) -> Iterator[_NL]: ...
-    def replace(self, new: Union[_NL, List[_NL]]) -> None: ...
+    def replace(self, new: _NL | List[_NL]) -> None: ...
     def get_lineno(self) -> int: ...
     def changed(self) -> None: ...
-    def remove(self) -> Optional[int]: ...
+    def remove(self) -> int | None: ...
     @property
-    def next_sibling(self) -> Optional[_NL]: ...
+    def next_sibling(self) -> _NL | None: ...
     @property
-    def prev_sibling(self) -> Optional[_NL]: ...
+    def prev_sibling(self) -> _NL | None: ...
     def leaves(self) -> Iterator[Leaf]: ...
     def depth(self) -> int: ...
     def get_suffix(self) -> str: ...
@@ -42,9 +42,9 @@ class Node(Base):
         self,
         type: int,
         children: List[_NL],
-        context: Optional[Any] = ...,
-        prefix: Optional[str] = ...,
-        fixers_applied: Optional[List[Any]] = ...,
+        context: Any | None = ...,
+        prefix: str | None = ...,
+        fixers_applied: List[Any] | None = ...,
     ) -> None: ...
     def set_child(self, i: int, child: _NL) -> None: ...
     def insert_child(self, i: int, child: _NL) -> None: ...
@@ -56,38 +56,33 @@ class Leaf(Base):
     value: str
     fixers_applied: List[Any]
     def __init__(
-        self,
-        type: int,
-        value: str,
-        context: Optional[_Context] = ...,
-        prefix: Optional[str] = ...,
-        fixers_applied: List[Any] = ...,
+        self, type: int, value: str, context: _Context | None = ..., prefix: str | None = ..., fixers_applied: List[Any] = ...
     ) -> None: ...
 
 def convert(gr: Grammar, raw_node: _RawNode) -> _NL: ...
 
 class BasePattern:
     type: int
-    content: Optional[str]
-    name: Optional[str]
+    content: str | None
+    name: str | None
     def optimize(self) -> BasePattern: ...  # sic, subclasses are free to optimize themselves into different patterns
-    def match(self, node: _NL, results: Optional[_Results] = ...) -> bool: ...
-    def match_seq(self, nodes: List[_NL], results: Optional[_Results] = ...) -> bool: ...
+    def match(self, node: _NL, results: _Results | None = ...) -> bool: ...
+    def match_seq(self, nodes: List[_NL], results: _Results | None = ...) -> bool: ...
     def generate_matches(self, nodes: List[_NL]) -> Iterator[Tuple[int, _Results]]: ...
 
 class LeafPattern(BasePattern):
-    def __init__(self, type: Optional[int] = ..., content: Optional[str] = ..., name: Optional[str] = ...) -> None: ...
+    def __init__(self, type: int | None = ..., content: str | None = ..., name: str | None = ...) -> None: ...
 
 class NodePattern(BasePattern):
     wildcards: bool
-    def __init__(self, type: Optional[int] = ..., content: Optional[str] = ..., name: Optional[str] = ...) -> None: ...
+    def __init__(self, type: int | None = ..., content: str | None = ..., name: str | None = ...) -> None: ...
 
 class WildcardPattern(BasePattern):
     min: int
     max: int
-    def __init__(self, content: Optional[str] = ..., min: int = ..., max: int = ..., name: Optional[str] = ...) -> None: ...
+    def __init__(self, content: str | None = ..., min: int = ..., max: int = ..., name: str | None = ...) -> None: ...
 
 class NegatedPattern(BasePattern):
-    def __init__(self, content: Optional[str] = ...) -> None: ...
+    def __init__(self, content: str | None = ...) -> None: ...
 
 def generate_matches(patterns: List[BasePattern], nodes: List[_NL]) -> Iterator[Tuple[int, _Results]]: ...