Lines Matching +full:fast +full:- +full:deep +full:- +full:equal
19 BaseSet -- All the operations common to both mutable and immutable
23 Set -- Mutable sets, subclass of BaseSet; not hashable.
25 ImmutableSet -- Immutable sets, subclass of BaseSet; hashable.
28 _TemporarilyImmutableSet -- A wrapper around a Set, hashable,
34 actually added is an ImmutableSet built from it (it compares equal to
45 # - Greg V. Wilson wrote the first version, using a different approach
48 # - Alex Martelli modified Greg's version to implement the current
51 # - Guido van Rossum rewrote much of the code, made some API changes,
54 # - Raymond Hettinger added a number of speedups and other
108 # Three-way comparison is not supported. However, because __eq__ is
116 # Equality comparisons using the underlying dicts. Mixed-type comparisons
117 # are allowed here, where Set == z for non-Set z always returns False,
121 # a Set and y contain's a non-set ("in" invokes only __eq__).
154 """Return a deep copy of a set; used by copy module."""
155 # This pre-creates the result and inserts it in the memo
156 # early, in case the deep copy recurses into another reference
176 # raises TypeError as-is is also a bit subtle).
284 raise # re-raise the TypeError exception we caught
292 if len(self) > len(other): # Fast check for obvious cases
301 if len(self) < len(other): # Fast check for obvious cases
307 # Inequality comparisons using the is-subset relation.
345 # Use the fast update() method when a dictionary is available.
364 raise # re-raise the TypeError exception we caught
374 raise # re-raise the TypeError exception we caught
423 # In-place union, intersection, differences.
425 # as do all mutating operations on built-in container types.
487 # Python dict-like mass mutations: update, clear
497 # Single-element mutations: add, remove, discard
509 raise # re-raise the TypeError exception we caught
522 raise # re-raise the TypeError exception we caught