Counter: fix recipe for "n least common elements". Found by Mikhail Golubev on docs@.

diff --git a/Doc/library/collections.rst b/Doc/library/collections.rst
index a65fe5bfa2ecfc341858dbd0bb6b90b5a9fa71c6..a47d99bf56b78859d98662e28a247064e7916b05 100644 (file)
--- a/Doc/library/collections.rst
+++ b/Doc/library/collections.rst
@@ -307,7 +307,7 @@ Common patterns for working with :class:`Counter` objects::
     dict(c)                         # convert to a regular dictionary
     c.items()                       # convert to a list of (elem, cnt) pairs
     Counter(dict(list_of_pairs))    # convert from a list of (elem, cnt) pairs
-    c.most_common()[:-n:-1]         # n least common elements
+    c.most_common()[:-n-1:-1]       # n least common elements
     +c                              # remove zero and negative counts
 
 Several mathematical operations are provided for combining :class:`Counter`