Lines Matching full:sets
49 """split(set) -> [sets]
63 def delta(self, c, sets):
64 # assert(reduce(set.union, sets, set()) == c)
67 if len(sets) <= 1:
71 res = self.search(c, sets)
75 # Otherwise, partition sets if possible; if not we are done.
76 refined = sum(map(list, map(self.split, sets)), [])
77 if len(refined) == len(sets):
82 def search(self, c, sets):
83 for i,S in enumerate(sets):
88 # Otherwise if we have more than two sets, see if test
90 if len(sets) > 2:
91 complement = sum(sets[:i] + sets[i+1:],[])
93 return self.delta(complement, sets[:i] + sets[i+1:])
