# [Python-checkins] r68803 - python/trunk/Doc/library/collections.rst

raymond.hettinger python-checkins at python.org
Tue Jan 20 13:59:37 CET 2009

```Author: raymond.hettinger
Date: Tue Jan 20 13:59:36 2009
New Revision: 68803

Log:
Fix typos.

Modified:
python/trunk/Doc/library/collections.rst

Modified: python/trunk/Doc/library/collections.rst
==============================================================================
--- python/trunk/Doc/library/collections.rst	(original)
+++ python/trunk/Doc/library/collections.rst	Tue Jan 20 13:59:36 2009
@@ -169,7 +169,7 @@
# Find the ten most common words in Hamlet
>>> import re
-    >>> Counter(hamlet_words).most_common(10)
+    >>> Counter(words).most_common(10)
[('the', 1143), ('and', 966), ('to', 762), ('of', 669), ('i', 631),
('you', 554),  ('a', 546), ('my', 514), ('hamlet', 471), ('in', 451)]

@@ -218,7 +218,7 @@
Elements are returned in arbitrary order.  If an element's count has been
set to zero or a negative number, :meth:`elements` will ignore it.

-            >>> c =  Counter(a=4, b=2, c=0, d=-2)
+            >>> c = Counter(a=4, b=2, c=0, d=-2)
>>> list(c.elements())
['a', 'a', 'a', 'a', 'b', 'b']

@@ -273,7 +273,7 @@
corresponding elements.  Intersection and union return the minimum and maximum
of corresponding counts::

-    >>> c = Counter('a': 3, 'b': 1})
+    >>> c = Counter({'a': 3, 'b': 1})
>>> d = Counter({'a': 1, 'b': 2})
>>> c + d                           # add two counters together:  c[x] + d[x]
Counter({'a': 4, 'b': 3})
```