summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorRaymond Hettinger <python@rcn.com>2015-05-13 21:39:04 (GMT)
committerRaymond Hettinger <python@rcn.com>2015-05-13 21:39:04 (GMT)
commit3afdb2870ff83ebb32a8c19260be7ced0567ac66 (patch)
tree85c06338499ac24765b2c1985f4b749a9a4a7472
parentc58cca5951ebab752020750e52334300342e54db (diff)
downloadcpython-3afdb2870ff83ebb32a8c19260be7ced0567ac66.zip
cpython-3afdb2870ff83ebb32a8c19260be7ced0567ac66.tar.gz
cpython-3afdb2870ff83ebb32a8c19260be7ced0567ac66.tar.bz2
Fix mangled wording
-rw-r--r--Doc/library/collections.rst4
1 files changed, 2 insertions, 2 deletions
diff --git a/Doc/library/collections.rst b/Doc/library/collections.rst
index be15477..50cc97c 100644
--- a/Doc/library/collections.rst
+++ b/Doc/library/collections.rst
@@ -269,8 +269,8 @@ For example::
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 counter. Elements
- with equal counts are ordered arbitrarily:
+ :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)]