diff options
| author | Tim Peters <tim.peters@gmail.com> | 2002-08-23 20:06:42 (GMT) |
|---|---|---|
| committer | Tim Peters <tim.peters@gmail.com> | 2002-08-23 20:06:42 (GMT) |
| commit | d06d03041b4b176953629858ae3a4f641e5a3c4f (patch) | |
| tree | 268e495a33434f6f7cbdf605da27f2af887be1b3 /Lib/sets.py | |
| parent | 2023c9b84a08f96a8786c8e87625b00074de21a2 (diff) | |
| download | cpython-d06d03041b4b176953629858ae3a4f641e5a3c4f.zip cpython-d06d03041b4b176953629858ae3a4f641e5a3c4f.tar.gz cpython-d06d03041b4b176953629858ae3a4f641e5a3c4f.tar.bz2 | |
Comment repair.
Diffstat (limited to 'Lib/sets.py')
| -rw-r--r-- | Lib/sets.py | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/Lib/sets.py b/Lib/sets.py index c391545..bd4a2b5 100644 --- a/Lib/sets.py +++ b/Lib/sets.py @@ -297,10 +297,10 @@ class BaseSet(object): def _compute_hash(self): # Calculate hash code for a set by xor'ing the hash codes of - # the elements. This algorithm ensures that the hash code - # does not depend on the order in which elements are added to - # the code. This is not called __hash__ because a BaseSet - # should not be hashable; only an ImmutableSet is hashable. + # the elements. This ensures that the hash code does not depend + # on the order in which elements are added to the set. This is + # not called __hash__ because a BaseSet should not be hashable; + # only an ImmutableSet is hashable. result = 0 for elt in self: result ^= hash(elt) |