summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorAndrew Kuchling <amk@amk.ca>2015-05-13 15:25:40 (GMT)
committerAndrew Kuchling <amk@amk.ca>2015-05-13 15:25:40 (GMT)
commitc711b61ad4ac3f125129dce2a4482f0649c07c84 (patch)
tree5359a9bf1a2bf63000f71cf14d697d9ad7e45c57
parent73e4f5f6bb199b79bc748de1dbb42cfa8f741953 (diff)
downloadcpython-c711b61ad4ac3f125129dce2a4482f0649c07c84.zip
cpython-c711b61ad4ac3f125129dce2a4482f0649c07c84.tar.gz
cpython-c711b61ad4ac3f125129dce2a4482f0649c07c84.tar.bz2
#19934: fix mangled wording
-rw-r--r--Doc/library/collections.rst6
1 files changed, 3 insertions, 3 deletions
diff --git a/Doc/library/collections.rst b/Doc/library/collections.rst
index 2dc60e8..e08eb51 100644
--- a/Doc/library/collections.rst
+++ b/Doc/library/collections.rst
@@ -104,9 +104,9 @@ For example::
.. method:: most_common([n])
Return a list of the *n* most common elements and their counts from the
- most common to the least. If *n* is omitted or ``None`
- :func:`most_common` returns *all* elements in the count
- with equal counts are ordered arbitrarily:
+ most common to the least. If *n* is omitted or ``None``,
+ :func:`most_common` returns *all* elements in the counter.
+ Elements with equal counts are ordered arbitrarily:
>>> Counter('abracadabra').most_common(3)
[('a', 5), ('r', 2), ('b', 2)]