Skip to content

Commit ef0fbe2

Browse files
RodneyRichardsonRodneyRichardson
committed
Reduce sortedcontainers.pyi to only the functions used.
Signed-off-by: Rodney Richardson <[email protected]>
1 parent 41d1bee commit ef0fbe2

File tree

1 file changed

+90
-92
lines changed

1 file changed

+90
-92
lines changed

‎typings/sortedcontainers.pyi

Lines changed: 90 additions & 92 deletions
Original file line numberDiff line numberDiff line change
@@ -4,20 +4,18 @@
44
# https://github.com/althonos/python-sortedcontainers/blob/d0a225d7fd0fb4c54532b8798af3cbeebf97e2d5/sortedcontainers/sortedset.pyi
55

66
from typing import (
7-
AbstractSet,
87
Any,
98
Callable,
10-
Generic,
119
Hashable,
1210
Iterable,
13-
Iterator,
11+
# Iterator,
1412
List,
1513
MutableSet,
1614
Optional,
1715
Sequence,
1816
Set,
19-
Tuple,
20-
Type,
17+
# Tuple,
18+
# Type,
2119
TypeVar,
2220
Union,
2321
overload,
@@ -27,7 +25,7 @@ from typing import (
2725

2826
_T = TypeVar("_T", bound=Hashable)
2927
_S = TypeVar("_S", bound=Hashable)
30-
_SS = TypeVar("_SS", bound=SortedSet)
28+
#_SS = TypeVar("_SS", bound=SortedSet)
3129
_Key = Callable[[_T], Any]
3230

3331
class SortedSet(MutableSet[_T], Sequence[_T]):
@@ -36,96 +34,96 @@ class SortedSet(MutableSet[_T], Sequence[_T]):
3634
iterable: Optional[Iterable[_T]] = ...,
3735
key: Optional[_Key[_T]] = ...,
3836
) -> None: ...
39-
@classmethod
40-
def _fromset(
41-
cls, values: Set[_T], key: Optional[_Key[_T]] = ...
42-
) -> SortedSet[_T]: ...
43-
@property
44-
def key(self) -> Optional[_Key[_T]]: ...
37+
# @classmethod
38+
# def _fromset(
39+
# cls, values: Set[_T], key: Optional[_Key[_T]] = ...
40+
# ) -> SortedSet[_T]: ...
41+
# @property
42+
# def key(self) -> Optional[_Key[_T]]: ...
4543
def __contains__(self, value: Any) -> bool: ...
46-
@overload
47-
def __getitem__(self, index: int) -> _T: ...
44+
# @overload
45+
# def __getitem__(self, index: int) -> _T: ...
4846
@overload
4947
def __getitem__(self, index: slice) -> List[_T]: ...
50-
def __delitem__(self, index: Union[int, slice]) -> None: ...
51-
def __eq__(self, other: Any) -> bool: ...
52-
def __ne__(self, other: Any) -> bool: ...
53-
def __lt__(self, other: Iterable[_T]) -> bool: ...
54-
def __gt__(self, other: Iterable[_T]) -> bool: ...
55-
def __le__(self, other: Iterable[_T]) -> bool: ...
56-
def __ge__(self, other: Iterable[_T]) -> bool: ...
48+
# def __delitem__(self, index: Union[int, slice]) -> None: ...
49+
# def __eq__(self, other: Any) -> bool: ...
50+
# def __ne__(self, other: Any) -> bool: ...
51+
# def __lt__(self, other: Iterable[_T]) -> bool: ...
52+
# def __gt__(self, other: Iterable[_T]) -> bool: ...
53+
# def __le__(self, other: Iterable[_T]) -> bool: ...
54+
# def __ge__(self, other: Iterable[_T]) -> bool: ...
5755
def __len__(self) -> int: ...
58-
def __iter__(self) -> Iterator[_T]: ...
59-
def __reversed__(self) -> Iterator[_T]: ...
56+
# def __iter__(self) -> Iterator[_T]: ...
57+
# def __reversed__(self) -> Iterator[_T]: ...
6058
def add(self, value: _T) -> None: ...
61-
def _add(self, value: _T) -> None: ...
62-
def clear(self) -> None: ...
63-
def copy(self: _SS) -> _SS: ...
64-
def __copy__(self: _SS) -> _SS: ...
65-
def count(self, value: _T) -> int: ...
59+
# def _add(self, value: _T) -> None: ...
60+
# def clear(self) -> None: ...
61+
# def copy(self: _SS) -> _SS: ...
62+
# def __copy__(self: _SS) -> _SS: ...
63+
# def count(self, value: _T) -> int: ...
6664
def discard(self, value: _T) -> None: ...
67-
def _discard(self, value: _T) -> None: ...
68-
def pop(self, index: int = ...) -> _T: ...
69-
def remove(self, value: _T) -> None: ...
70-
def difference(
71-
self, *iterables: Iterable[_S]
72-
) -> SortedSet[Union[_T, _S]]: ...
73-
def __sub__(self, *iterables: Iterable[_S]) -> SortedSet[Union[_T, _S]]: ...
74-
def difference_update(
75-
self, *iterables: Iterable[_S]
76-
) -> SortedSet[Union[_T, _S]]: ...
77-
def __isub__(
78-
self, *iterables: Iterable[_S]
79-
) -> SortedSet[Union[_T, _S]]: ...
80-
def intersection(
81-
self, *iterables: Iterable[_S]
82-
) -> SortedSet[Union[_T, _S]]: ...
83-
def __and__(self, *iterables: Iterable[_S]) -> SortedSet[Union[_T, _S]]: ...
84-
def __rand__(
85-
self, *iterables: Iterable[_S]
86-
) -> SortedSet[Union[_T, _S]]: ...
87-
def intersection_update(
88-
self, *iterables: Iterable[_S]
89-
) -> SortedSet[Union[_T, _S]]: ...
90-
def __iand__(
91-
self, *iterables: Iterable[_S]
92-
) -> SortedSet[Union[_T, _S]]: ...
93-
def symmetric_difference(
94-
self, other: Iterable[_S]
95-
) -> SortedSet[Union[_T, _S]]: ...
96-
def __xor__(self, other: Iterable[_S]) -> SortedSet[Union[_T, _S]]: ...
97-
def __rxor__(self, other: Iterable[_S]) -> SortedSet[Union[_T, _S]]: ...
98-
def symmetric_difference_update(
99-
self, other: Iterable[_S]
100-
) -> SortedSet[Union[_T, _S]]: ...
101-
def __ixor__(self, other: Iterable[_S]) -> SortedSet[Union[_T, _S]]: ...
102-
def union(self, *iterables: Iterable[_S]) -> SortedSet[Union[_T, _S]]: ...
103-
def __or__(self, *iterables: Iterable[_S]) -> SortedSet[Union[_T, _S]]: ...
104-
def __ror__(self, *iterables: Iterable[_S]) -> SortedSet[Union[_T, _S]]: ...
65+
# def _discard(self, value: _T) -> None: ...
66+
# def pop(self, index: int = ...) -> _T: ...
67+
# def remove(self, value: _T) -> None: ...
68+
# def difference(
69+
# self, *iterables: Iterable[_S]
70+
# ) -> SortedSet[Union[_T, _S]]: ...
71+
# def __sub__(self, *iterables: Iterable[_S]) -> SortedSet[Union[_T, _S]]: ...
72+
# def difference_update(
73+
# self, *iterables: Iterable[_S]
74+
# ) -> SortedSet[Union[_T, _S]]: ...
75+
# def __isub__(
76+
# self, *iterables: Iterable[_S]
77+
# ) -> SortedSet[Union[_T, _S]]: ...
78+
# def intersection(
79+
# self, *iterables: Iterable[_S]
80+
# ) -> SortedSet[Union[_T, _S]]: ...
81+
# def __and__(self, *iterables: Iterable[_S]) -> SortedSet[Union[_T, _S]]: ...
82+
# def __rand__(
83+
# self, *iterables: Iterable[_S]
84+
# ) -> SortedSet[Union[_T, _S]]: ...
85+
# def intersection_update(
86+
# self, *iterables: Iterable[_S]
87+
# ) -> SortedSet[Union[_T, _S]]: ...
88+
# def __iand__(
89+
# self, *iterables: Iterable[_S]
90+
# ) -> SortedSet[Union[_T, _S]]: ...
91+
# def symmetric_difference(
92+
# self, other: Iterable[_S]
93+
# ) -> SortedSet[Union[_T, _S]]: ...
94+
# def __xor__(self, other: Iterable[_S]) -> SortedSet[Union[_T, _S]]: ...
95+
# def __rxor__(self, other: Iterable[_S]) -> SortedSet[Union[_T, _S]]: ...
96+
# def symmetric_difference_update(
97+
# self, other: Iterable[_S]
98+
# ) -> SortedSet[Union[_T, _S]]: ...
99+
# def __ixor__(self, other: Iterable[_S]) -> SortedSet[Union[_T, _S]]: ...
100+
# def union(self, *iterables: Iterable[_S]) -> SortedSet[Union[_T, _S]]: ...
101+
# def __or__(self, *iterables: Iterable[_S]) -> SortedSet[Union[_T, _S]]: ...
102+
# def __ror__(self, *iterables: Iterable[_S]) -> SortedSet[Union[_T, _S]]: ...
105103
def update(self, *iterables: Iterable[_S]) -> SortedSet[Union[_T, _S]]: ...
106-
def __ior__(self, *iterables: Iterable[_S]) -> SortedSet[Union[_T, _S]]: ...
107-
def _update(self, *iterables: Iterable[_S]) -> SortedSet[Union[_T, _S]]: ...
108-
def __reduce__(
109-
self
110-
) -> Tuple[Type[SortedSet[_T]], Set[_T], Callable[[_T], Any]]: ...
111-
def __repr__(self) -> str: ...
112-
def _check(self) -> None: ...
113-
def bisect_left(self, value: _T) -> int: ...
114-
def bisect_right(self, value: _T) -> int: ...
115-
def islice(
116-
self,
117-
start: Optional[int] = ...,
118-
stop: Optional[int] = ...,
119-
reverse=bool,
120-
) -> Iterator[_T]: ...
121-
def irange(
122-
self,
123-
minimum: Optional[_T] = ...,
124-
maximum: Optional[_T] = ...,
125-
inclusive: Tuple[bool, bool] = ...,
126-
reverse: bool = ...,
127-
) -> Iterator[_T]: ...
128-
def index(
129-
self, value: _T, start: Optional[int] = ..., stop: Optional[int] = ...
130-
) -> int: ...
131-
def _reset(self, load: int) -> None: ...
104+
# def __ior__(self, *iterables: Iterable[_S]) -> SortedSet[Union[_T, _S]]: ...
105+
# def _update(self, *iterables: Iterable[_S]) -> SortedSet[Union[_T, _S]]: ...
106+
# def __reduce__(
107+
# self
108+
# ) -> Tuple[Type[SortedSet[_T]], Set[_T], Callable[[_T], Any]]: ...
109+
# def __repr__(self) -> str: ...
110+
# def _check(self) -> None: ...
111+
# def bisect_left(self, value: _T) -> int: ...
112+
# def bisect_right(self, value: _T) -> int: ...
113+
# def islice(
114+
# self,
115+
# start: Optional[int] = ...,
116+
# stop: Optional[int] = ...,
117+
# reverse=bool,
118+
# ) -> Iterator[_T]: ...
119+
# def irange(
120+
# self,
121+
# minimum: Optional[_T] = ...,
122+
# maximum: Optional[_T] = ...,
123+
# inclusive: Tuple[bool, bool] = ...,
124+
# reverse: bool = ...,
125+
# ) -> Iterator[_T]: ...
126+
# def index(
127+
# self, value: _T, start: Optional[int] = ..., stop: Optional[int] = ...
128+
# ) -> int: ...
129+
# def _reset(self, load: int) -> None: ...

0 commit comments

Comments
 (0)