Lines Matching refs:other
116 def update(self, other):
119 for element in other:
122 def __ior__(self, other):
123 self.update(other)
126 def difference(self, other):
128 newset.difference_update(other)
132 def difference_update(self, other):
133 self.__isub__(other)
134 def __isub__(self, other):
137 if self is other:
140 self.data.difference_update(ref(item) for item in other)
143 def intersection(self, other):
144 return self.__class__(item for item in other if item in self)
147 def intersection_update(self, other):
148 self.__iand__(other)
149 def __iand__(self, other):
152 self.data.intersection_update(ref(item) for item in other)
155 def issubset(self, other):
156 return self.data.issubset(ref(item) for item in other)
159 def __lt__(self, other):
160 return self.data < set(ref(item) for item in other)
162 def issuperset(self, other):
163 return self.data.issuperset(ref(item) for item in other)
166 def __gt__(self, other):
167 return self.data > set(ref(item) for item in other)
169 def __eq__(self, other):
170 if not isinstance(other, self.__class__):
172 return self.data == set(ref(item) for item in other)
174 def symmetric_difference(self, other):
176 newset.symmetric_difference_update(other)
180 def symmetric_difference_update(self, other):
181 self.__ixor__(other)
182 def __ixor__(self, other):
185 if self is other:
188 self.data.symmetric_difference_update(ref(item, self._remove) for item in other)
191 def union(self, other):
192 return self.__class__(e for s in (self, other) for e in s)
195 def isdisjoint(self, other):
196 return len(self.intersection(other)) == 0
