From fbe270dee09cf5eb890663d712a68f3acbc31681 Mon Sep 17 00:00:00 2001 From: "DocsBot[bot]" Date: Mon, 22 Apr 2024 19:48:12 +0000 Subject: [PATCH 1/2] doc: build --- docs/magic_list.html | 80 ++++++++++++++++++++++---------------------- docs/search.js | 2 +- 2 files changed, 41 insertions(+), 41 deletions(-) diff --git a/docs/magic_list.html b/docs/magic_list.html index abbaa42..5cc4be8 100644 --- a/docs/magic_list.html +++ b/docs/magic_list.html @@ -17,7 +17,7 @@
- + @@ -206,7 +206,7 @@

- + class list(collections.UserList[~_T]): @@ -1336,7 +1336,7 @@
The list must be non-empty.
- + def prepend(self, item: ~_T) -> None: @@ -1374,7 +1374,7 @@
The list must be non-empty.
- + def reversed(self) -> Self: @@ -1409,7 +1409,7 @@
The list must be non-empty.
- + def sorted( self, *, key: 'collections.abc.Callable[[_T], _typeshed.SupportsRichComparison] | None' = None, reverse: bool = False) -> Self: @@ -1453,7 +1453,7 @@
The list must be non-empty.
- + def shuffled(self) -> Self: @@ -1503,7 +1503,7 @@
The list must be non-empty.
- + def map( self, function: collections.abc.Callable[[~_T], ~_U]) -> list[~_U]: @@ -1549,7 +1549,7 @@
The list must be non-empty.
- + def rotate(self, n: int = 1) -> Self: @@ -1625,7 +1625,7 @@
The list must be non-empty.
- + def filter(self, function: collections.abc.Callable[[~_T], bool]) -> Self: @@ -1670,7 +1670,7 @@
The list must be non-empty.
- + def mask(self, mask_seq: collections.abc.Sequence[bool]) -> Self: @@ -1730,7 +1730,7 @@
The mask seque
- + def deduplicate(self) -> Self: @@ -1780,7 +1780,7 @@
The mask seque
- + def reduce(self, function: collections.abc.Callable[[~_T, ~_T], ~_T]) -> ~_T: @@ -1837,7 +1837,7 @@
The list must be non-empty.
- + def reduce_right(self, function: collections.abc.Callable[[~_T, ~_T], ~_T]) -> ~_T: @@ -1901,7 +1901,7 @@
The list must be non-empty.
- + def fold( self, function: collections.abc.Callable[[~_T, ~_T], ~_T], initial_value: ~_T) -> ~_T: @@ -1951,7 +1951,7 @@
The list must be non-empty.
- + def fold_right( self, function: collections.abc.Callable[[~_T, ~_T], ~_T], initial_value: ~_T) -> ~_T: @@ -2005,7 +2005,7 @@
The list must be non-empty.
- + def scan( self, function: collections.abc.Callable[[~_T, ~_T], ~_T], initial_value: ~_T) -> Self: @@ -2068,7 +2068,7 @@
The list must be non-empty.
- + def scan_right( self, function: collections.abc.Callable[[~_T, ~_T], ~_T], initial_value: ~_T) -> Self: @@ -2120,7 +2120,7 @@
The list must be non-empty.
- + def merge( self, function: collections.abc.Callable[[~_T, ~_U], ~_V], other: collections.abc.Sequence[~_U]) -> list[~_V]: @@ -2184,7 +2184,7 @@
The list and the se
- + def flatten( self, *, _base: list[typing.Any] | None = None) -> list[typing.Any]: @@ -2265,7 +2265,7 @@
The list cannot contain recu
- + def sum(self) -> ~_T: @@ -2320,7 +2320,7 @@
- + def mean( self: list[int] | list[float] | list[complex]) -> float | complex: @@ -2378,7 +2378,7 @@
The list must contain nu
- + def min( self: list[int] | list[float]) -> int | float: @@ -2434,7 +2434,7 @@
The list must be non-emp
- + def max( self: list[int] | list[float]) -> int | float: @@ -2490,7 +2490,7 @@
The list must be non-emp
- + def fill_left( self, filler: Union[~_T, collections.abc.Callable[[list[~_T]], ~_T]], n: int) -> Self: @@ -2562,7 +2562,7 @@
n must be non-negative.
- + def fill_right( self, filler: Union[~_T, collections.abc.Callable[[list[~_T]], ~_T]], n: int) -> Self: @@ -2634,7 +2634,7 @@
n must be non-negative.
- + def interleave( self, filler: Union[~_T, collections.abc.Callable[[~_T, ~_T], ~_T]]) -> Self: @@ -2708,7 +2708,7 @@
The list must contain at least
- + def gap_fill( self, filler: Union[~_T, collections.abc.Callable[[~_T, ~_T], ~_T]]) -> Self: @@ -2767,7 +2767,7 @@
This alias is deprecated.
- + def select(self, indexes: collections.abc.Sequence[int]) -> Self: @@ -2830,7 +2830,7 @@
All the indexes must be in bounds.
- + def take(self, n: int) -> Self: @@ -2890,7 +2890,7 @@
n mus
- + def take_right(self, n: int) -> Self: @@ -2954,7 +2954,7 @@
n mus
- + def drop(self, n: int) -> Self: @@ -3014,7 +3014,7 @@
n mus
- + def drop_right(self, n: int) -> Self: @@ -3074,7 +3074,7 @@
n mus
- + def slice(self, start: int, stop: int) -> Self: @@ -3158,7 +3158,7 @@
start and stop
- + def partition(self, index: int) -> tuple[typing.Self, ~_T, typing.Self]: @@ -3227,7 +3227,7 @@
The list m
- + def bisect(self, index: int) -> tuple[typing.Self, typing.Self]: @@ -3295,7 +3295,7 @@
The list must be non-empty.
- + def trisect( self, first_index: int, second_index: int) -> tuple[typing.Self, typing.Self, typing.Self]: @@ -3376,13 +3376,13 @@
Inherited Members
L = <magic_list.prelude._ListBuilder object> - +
- - + +
- + \ No newline at end of file diff --git a/docs/search.js b/docs/search.js index 8820bd6..87b08bb 100644 --- a/docs/search.js +++ b/docs/search.js @@ -43,4 +43,4 @@ window.pdocSearch = (function(){ }, expand: true }); -})(); +})(); \ No newline at end of file From 0ca517bceb445816f5d65ec4c8b18a50143f8130 Mon Sep 17 00:00:00 2001 From: "pre-commit-ci[bot]" <66853113+pre-commit-ci[bot]@users.noreply.github.com> Date: Mon, 22 Apr 2024 19:48:59 +0000 Subject: [PATCH 2/2] [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci --- docs/magic_list.html | 78 ++++++++++++++++++++++---------------------- docs/search.js | 2 +- 2 files changed, 40 insertions(+), 40 deletions(-) diff --git a/docs/magic_list.html b/docs/magic_list.html index 5cc4be8..30bf1d6 100644 --- a/docs/magic_list.html +++ b/docs/magic_list.html @@ -206,7 +206,7 @@

- + class list(collections.UserList[~_T]): @@ -1336,7 +1336,7 @@
The list must be non-empty.
- + def prepend(self, item: ~_T) -> None: @@ -1374,7 +1374,7 @@
The list must be non-empty.
- + def reversed(self) -> Self: @@ -1409,7 +1409,7 @@
The list must be non-empty.
- + def sorted( self, *, key: 'collections.abc.Callable[[_T], _typeshed.SupportsRichComparison] | None' = None, reverse: bool = False) -> Self: @@ -1453,7 +1453,7 @@
The list must be non-empty.
- + def shuffled(self) -> Self: @@ -1503,7 +1503,7 @@
The list must be non-empty.
- + def map( self, function: collections.abc.Callable[[~_T], ~_U]) -> list[~_U]: @@ -1549,7 +1549,7 @@
The list must be non-empty.
- + def rotate(self, n: int = 1) -> Self: @@ -1625,7 +1625,7 @@
The list must be non-empty.
- + def filter(self, function: collections.abc.Callable[[~_T], bool]) -> Self: @@ -1670,7 +1670,7 @@
The list must be non-empty.
- + def mask(self, mask_seq: collections.abc.Sequence[bool]) -> Self: @@ -1730,7 +1730,7 @@
The mask seque
- + def deduplicate(self) -> Self: @@ -1780,7 +1780,7 @@
The mask seque
- + def reduce(self, function: collections.abc.Callable[[~_T, ~_T], ~_T]) -> ~_T: @@ -1837,7 +1837,7 @@
The list must be non-empty.
- + def reduce_right(self, function: collections.abc.Callable[[~_T, ~_T], ~_T]) -> ~_T: @@ -1901,7 +1901,7 @@
The list must be non-empty.
- + def fold( self, function: collections.abc.Callable[[~_T, ~_T], ~_T], initial_value: ~_T) -> ~_T: @@ -1951,7 +1951,7 @@
The list must be non-empty.
- + def fold_right( self, function: collections.abc.Callable[[~_T, ~_T], ~_T], initial_value: ~_T) -> ~_T: @@ -2005,7 +2005,7 @@
The list must be non-empty.
- + def scan( self, function: collections.abc.Callable[[~_T, ~_T], ~_T], initial_value: ~_T) -> Self: @@ -2068,7 +2068,7 @@
The list must be non-empty.
- + def scan_right( self, function: collections.abc.Callable[[~_T, ~_T], ~_T], initial_value: ~_T) -> Self: @@ -2120,7 +2120,7 @@
The list must be non-empty.
- + def merge( self, function: collections.abc.Callable[[~_T, ~_U], ~_V], other: collections.abc.Sequence[~_U]) -> list[~_V]: @@ -2184,7 +2184,7 @@
The list and the se
- + def flatten( self, *, _base: list[typing.Any] | None = None) -> list[typing.Any]: @@ -2265,7 +2265,7 @@
The list cannot contain recu
- + def sum(self) -> ~_T: @@ -2320,7 +2320,7 @@
- + def mean( self: list[int] | list[float] | list[complex]) -> float | complex: @@ -2378,7 +2378,7 @@
The list must contain nu
- + def min( self: list[int] | list[float]) -> int | float: @@ -2434,7 +2434,7 @@
The list must be non-emp
- + def max( self: list[int] | list[float]) -> int | float: @@ -2490,7 +2490,7 @@
The list must be non-emp
- + def fill_left( self, filler: Union[~_T, collections.abc.Callable[[list[~_T]], ~_T]], n: int) -> Self: @@ -2562,7 +2562,7 @@
n must be non-negative.
- + def fill_right( self, filler: Union[~_T, collections.abc.Callable[[list[~_T]], ~_T]], n: int) -> Self: @@ -2634,7 +2634,7 @@
n must be non-negative.
- + def interleave( self, filler: Union[~_T, collections.abc.Callable[[~_T, ~_T], ~_T]]) -> Self: @@ -2708,7 +2708,7 @@
The list must contain at least
- + def gap_fill( self, filler: Union[~_T, collections.abc.Callable[[~_T, ~_T], ~_T]]) -> Self: @@ -2767,7 +2767,7 @@
This alias is deprecated.
- + def select(self, indexes: collections.abc.Sequence[int]) -> Self: @@ -2830,7 +2830,7 @@
All the indexes must be in bounds.
- + def take(self, n: int) -> Self: @@ -2890,7 +2890,7 @@
n mus
- + def take_right(self, n: int) -> Self: @@ -2954,7 +2954,7 @@
n mus
- + def drop(self, n: int) -> Self: @@ -3014,7 +3014,7 @@
n mus
- + def drop_right(self, n: int) -> Self: @@ -3074,7 +3074,7 @@
n mus
- + def slice(self, start: int, stop: int) -> Self: @@ -3158,7 +3158,7 @@
start and stop
- + def partition(self, index: int) -> tuple[typing.Self, ~_T, typing.Self]: @@ -3227,7 +3227,7 @@
The list m
- + def bisect(self, index: int) -> tuple[typing.Self, typing.Self]: @@ -3295,7 +3295,7 @@
The list must be non-empty.
- + def trisect( self, first_index: int, second_index: int) -> tuple[typing.Self, typing.Self, typing.Self]: @@ -3376,13 +3376,13 @@
Inherited Members
L = <magic_list.prelude._ListBuilder object> - +
- - + +
- \ No newline at end of file + diff --git a/docs/search.js b/docs/search.js index 87b08bb..8820bd6 100644 --- a/docs/search.js +++ b/docs/search.js @@ -43,4 +43,4 @@ window.pdocSearch = (function(){ }, expand: true }); -})(); \ No newline at end of file +})();