summaryrefslogtreecommitdiffstats
path: root/Lib
diff options
context:
space:
mode:
authorRaymond Hettinger <python@rcn.com>2009-03-19 23:22:25 (GMT)
committerRaymond Hettinger <python@rcn.com>2009-03-19 23:22:25 (GMT)
commitc8e81ef508f0f1dc4e5c31bd0bec2766867fead5 (patch)
tree93710bec4d62cd8fea86916097519c55cb79086f /Lib
parente980d2d44b4a787969cf3657a39a487f36406400 (diff)
downloadcpython-c8e81ef508f0f1dc4e5c31bd0bec2766867fead5.zip
cpython-c8e81ef508f0f1dc4e5c31bd0bec2766867fead5.tar.gz
cpython-c8e81ef508f0f1dc4e5c31bd0bec2766867fead5.tar.bz2
Fix typo
Diffstat (limited to 'Lib')
-rw-r--r--Lib/collections.py4
1 files changed, 2 insertions, 2 deletions
diff --git a/Lib/collections.py b/Lib/collections.py
index 130337d..9118b70 100644
--- a/Lib/collections.py
+++ b/Lib/collections.py
@@ -23,13 +23,13 @@ class OrderedDict(dict, MutableMapping):
# The internal self.__map dictionary maps keys to links in a doubly linked list.
# The doubly linked list starts and ends with a sentinel element.
# The sentinel element never gets deleted. It simplifies the algorithm.
- # Setting a new item cause a new link to append to the doubly linked list.
+ # Setting a new item causes a new link to append to the doubly linked list.
# Deleting an item uses self.__map to find the link, which is then removed.
# Iteration follows the linked list in order.
# Reverse iteration follows the links backwards.
# The inherited dict provides __getitem__, __len__, __contains__, and get.
# The remaining methods are order-aware.
- # Big-Oh running times for all methods is the same as for regular dictionaries.
+ # Big-Oh running times for all methods are the same as for regular dictionaries.
def __init__(self, *args, **kwds):
if len(args) > 1: