Doc that 'sorted' args are keyword-only, fix 'reverse' default (#2706)

diff --git a/Doc/library/functions.rst b/Doc/library/functions.rst
index 4e48e4267f647536c3d530c8b52fdc2aa5eec19f..015231d9cff225a5506076c3e129e6c971c2af44 100644 (file)
--- a/Doc/library/functions.rst
+++ b/Doc/library/functions.rst
@@ -1361,7 +1361,7 @@ are always available.  They are listed here in alphabetical order.
    :func:`itertools.islice` for an alternate version that returns an iterator.
 
 
-.. function:: sorted(iterable[, key][, reverse])
+.. function:: sorted(iterable, *, key=None, reverse=False)
 
    Return a new sorted list from the items in *iterable*.
 

diff --git a/Doc/library/stdtypes.rst b/Doc/library/stdtypes.rst
index e0691c7dcf87d46f1ce2307872ff93ca76d050c8..564579e70c5d1e8416bb1384792d6eace85e38df 100644 (file)
--- a/Doc/library/stdtypes.rst
+++ b/Doc/library/stdtypes.rst
@@ -1161,7 +1161,7 @@ application).
    :ref:`mutable <typesseq-mutable>` sequence operations. Lists also provide the
    following additional method:
 
-   .. method:: list.sort(*, key=None, reverse=None)
+   .. method:: list.sort(*, key=None, reverse=False)
 
       This method sorts the list in place, using only ``<`` comparisons
       between items. Exceptions are not suppressed - if any comparison operations