diff options
author | Raymond Hettinger <python@rcn.com> | 2009-03-19 23:23:15 (GMT) |
---|---|---|
committer | Raymond Hettinger <python@rcn.com> | 2009-03-19 23:23:15 (GMT) |
commit | bfb5456142a70ef8de9a03f17a210795677320e6 (patch) | |
tree | b58972942c25ed74e712d237c62fe8b006a597fc | |
parent | 18ed2cbc75a6f1af1a6d43b1785f133f1567c65b (diff) | |
download | cpython-bfb5456142a70ef8de9a03f17a210795677320e6.zip cpython-bfb5456142a70ef8de9a03f17a210795677320e6.tar.gz cpython-bfb5456142a70ef8de9a03f17a210795677320e6.tar.bz2 |
Fix typo
-rw-r--r-- | Lib/collections.py | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/Lib/collections.py b/Lib/collections.py index bb5991c..1ed5e4a 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: |