diff options
| author | Hugo van Kemenade <hugovk@users.noreply.github.com> | 2023-12-26 21:12:15 (GMT) |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2023-12-26 21:12:15 (GMT) |
| commit | 2b53c767de0a7afd29598a87da084d0e125e1c34 (patch) | |
| tree | 98b375ac01e12235905137821caef0c661555598 /Doc | |
| parent | 4e67644d367673bbacc40a0d8efb777410437b93 (diff) | |
| download | cpython-2b53c767de0a7afd29598a87da084d0e125e1c34.zip cpython-2b53c767de0a7afd29598a87da084d0e125e1c34.tar.gz cpython-2b53c767de0a7afd29598a87da084d0e125e1c34.tar.bz2 | |
gh-101100: Fix Sphinx warnings in `library/bisect.rst` (#113496)
Diffstat (limited to 'Doc')
| -rw-r--r-- | Doc/library/bisect.rst | 8 | ||||
| -rw-r--r-- | Doc/tools/.nitignore | 1 |
2 files changed, 4 insertions, 5 deletions
diff --git a/Doc/library/bisect.rst b/Doc/library/bisect.rst index 8022c59..c092309 100644 --- a/Doc/library/bisect.rst +++ b/Doc/library/bisect.rst @@ -19,9 +19,9 @@ linear searches or frequent resorting. The module is called :mod:`bisect` because it uses a basic bisection algorithm to do its work. Unlike other bisection tools that search for a specific value, the functions in this module are designed to locate an -insertion point. Accordingly, the functions never call an :meth:`__eq__` +insertion point. Accordingly, the functions never call an :meth:`~object.__eq__` method to determine whether a value has been found. Instead, the -functions only call the :meth:`__lt__` method and will return an insertion +functions only call the :meth:`~object.__lt__` method and will return an insertion point between values in an array. .. _bisect functions: @@ -73,7 +73,7 @@ The following functions are provided: Insert *x* in *a* in sorted order. This function first runs :py:func:`~bisect.bisect_left` to locate an insertion point. - Next, it runs the :meth:`insert` method on *a* to insert *x* at the + Next, it runs the :meth:`!insert` method on *a* to insert *x* at the appropriate position to maintain sort order. To support inserting records in a table, the *key* function (if any) is @@ -93,7 +93,7 @@ The following functions are provided: entries of *x*. This function first runs :py:func:`~bisect.bisect_right` to locate an insertion point. - Next, it runs the :meth:`insert` method on *a* to insert *x* at the + Next, it runs the :meth:`!insert` method on *a* to insert *x* at the appropriate position to maintain sort order. To support inserting records in a table, the *key* function (if any) is diff --git a/Doc/tools/.nitignore b/Doc/tools/.nitignore index 4eb0075..f2ffe85 100644 --- a/Doc/tools/.nitignore +++ b/Doc/tools/.nitignore @@ -31,7 +31,6 @@ Doc/library/asyncio-policy.rst Doc/library/asyncio-subprocess.rst Doc/library/asyncio-task.rst Doc/library/bdb.rst -Doc/library/bisect.rst Doc/library/calendar.rst Doc/library/cmd.rst Doc/library/collections.rst |