Lines Matching refs:other
120 def update(self, other):
123 for element in other:
126 def __ior__(self, other):
127 self.update(other)
130 def difference(self, other):
132 newset.difference_update(other)
136 def difference_update(self, other):
137 self.__isub__(other)
138 def __isub__(self, other):
141 if self is other:
144 self.data.difference_update(ref(item) for item in other)
147 def intersection(self, other):
148 return self.__class__(item for item in other if item in self)
151 def intersection_update(self, other):
152 self.__iand__(other)
153 def __iand__(self, other):
156 self.data.intersection_update(ref(item) for item in other)
159 def issubset(self, other):
160 return self.data.issubset(ref(item) for item in other)
163 def __lt__(self, other):
164 return self.data < set(map(ref, other))
166 def issuperset(self, other):
167 return self.data.issuperset(ref(item) for item in other)
170 def __gt__(self, other):
171 return self.data > set(map(ref, other))
173 def __eq__(self, other):
174 if not isinstance(other, self.__class__):
176 return self.data == set(map(ref, other))
178 def symmetric_difference(self, other):
180 newset.symmetric_difference_update(other)
184 def symmetric_difference_update(self, other):
185 self.__ixor__(other)
186 def __ixor__(self, other):
189 if self is other:
192 self.data.symmetric_difference_update(ref(item, self._remove) for item in other)
195 def union(self, other):
196 return self.__class__(e for s in (self, other) for e in s)
199 def isdisjoint(self, other):
200 return len(self.intersection(other)) == 0