tests: Use collections.abc.MutableSet

collections.MutableSet is deprecated and removed in py3.11

R=jojwang@google.com

Change-Id: Id09f6f4f64fd59ef66659e7369562f59b8aaa232
Reviewed-on: https://chromium-review.googlesource.com/c/chromium/tools/depot_tools/+/5039630
Auto-Submit: Josip Sokcevic <sokcevic@chromium.org>
Commit-Queue: Joanna Wang <jojwang@chromium.org>
Reviewed-by: Joanna Wang <jojwang@chromium.org>
changes/30/5039630/3
Josip Sokcevic 2 years ago committed by LUCI CQ
parent 44d6d1a666
commit 06c4261af7

@ -29,7 +29,7 @@ def git_hash_data(data, typ='blob'):
return hashlib.sha1(b'blob %d\0%s' % (len(data), data)).hexdigest()
class OrderedSet(collections.MutableSet):
class OrderedSet(collections.abc.MutableSet):
# from http://code.activestate.com/recipes/576694/
def __init__(self, iterable=None):
self.end = end = []
@ -73,20 +73,20 @@ class OrderedSet(collections.MutableSet):
yield curr[0]
curr = curr[1]
def add(self, key):
if key not in self.data:
def add(self, value):
if value not in self.data:
end = self.end
curr = end[1]
curr[2] = end[1] = self.data[key] = [key, curr, end]
curr[2] = end[1] = self.data[value] = [value, curr, end]
def difference_update(self, *others):
for other in others:
for i in other:
self.discard(i)
def discard(self, key):
if key in self.data:
key, prev, nxt = self.data.pop(key)
def discard(self, value):
if value in self.data:
value, prev, nxt = self.data.pop(value)
prev[2] = nxt
nxt[1] = prev

Loading…
Cancel
Save