|
|
|
@ -145,35 +145,37 @@ def unique(a):
|
|
|
|
|
c = set(a)
|
|
|
|
|
else:
|
|
|
|
|
c = []
|
|
|
|
|
c = filter(lambda x: x not in c, a)
|
|
|
|
|
for x in a:
|
|
|
|
|
if x not in c:
|
|
|
|
|
c.append(x)
|
|
|
|
|
return c
|
|
|
|
|
|
|
|
|
|
def intersect(a, b):
|
|
|
|
|
if isinstance(a,collections.Hashable) and isinstance(b,collections.Hashable):
|
|
|
|
|
c = set(a) & set(b)
|
|
|
|
|
else:
|
|
|
|
|
c = filter(lambda x: x in b, a)
|
|
|
|
|
c = unique(filter(lambda x: x in b, a))
|
|
|
|
|
return c
|
|
|
|
|
|
|
|
|
|
def difference(a, b):
|
|
|
|
|
if isinstance(a,collections.Hashable) and isinstance(b,collections.Hashable):
|
|
|
|
|
c = set(a) - set(b)
|
|
|
|
|
else:
|
|
|
|
|
c = filter(lambda x: x not in b, a)
|
|
|
|
|
c = unique(filter(lambda x: x not in b, a))
|
|
|
|
|
return c
|
|
|
|
|
|
|
|
|
|
def symmetric_difference(a, b):
|
|
|
|
|
if isinstance(a,collections.Hashable) and isinstance(b,collections.Hashable):
|
|
|
|
|
c = set(a) ^ set(b)
|
|
|
|
|
else:
|
|
|
|
|
c = filter(lambda x: x not in intersect(a,b), union(a,b))
|
|
|
|
|
c = unique(filter(lambda x: x not in intersect(a,b), union(a,b)))
|
|
|
|
|
return c
|
|
|
|
|
|
|
|
|
|
def union(a, b):
|
|
|
|
|
if isinstance(a,collections.Hashable) and isinstance(b,collections.Hashable):
|
|
|
|
|
c = set(a) | set(b)
|
|
|
|
|
else:
|
|
|
|
|
c = a + b
|
|
|
|
|
c = unique(a + b)
|
|
|
|
|
return c
|
|
|
|
|
|
|
|
|
|
def version_compare(value, version, operator='eq', strict=False):
|
|
|
|
|