Sync-up 3.1 docs with 2.7 for collections.Counter().

diff --git a/Doc/library/collections.rst b/Doc/library/collections.rst
index 4b3bbe9c69f60bd32d3aa90723a1f1c89a8e02c5..c28704b6082f991e31968a9e990468d62f2e78ea 100644 (file)
--- a/Doc/library/collections.rst
+++ b/Doc/library/collections.rst
@@ -236,13 +236,12 @@ Common patterns for working with :class:`Counter` objects::
     c.most_common()[:-n:-1]         # n least common elements
     c += Counter()                  # remove zero and negative counts
 
-Several multiset mathematical operations are provided for combining
-:class:`Counter` objects.  Multisets are like regular sets but are allowed to
-contain repeated elements (with counts of one or more).  Addition and
-subtraction combine counters by adding or subtracting the counts of
-corresponding elements.  Intersection and union return the minimum and maximum
-of corresponding counts.  Each operation can accept inputs with signed counts,
-but the output excludes results with counts less than one.
+Several mathematical operations are provided for combining :class:`Counter`
+objects to produce multisets (counters that have counts greater than zero).
+Addition and subtraction combine counters by adding or subtracting the counts
+of corresponding elements.  Intersection and union return the minimum and
+maximum of corresponding counts.  Each operation can accept inputs with signed
+counts, but the output will exclude results with counts of zero or less.
 
     >>> c = Counter(a=3, b=1)
     >>> d = Counter(a=1, b=2)