Lines Matching defs:union
37 Simplistic implementation of a union-find data structure that also keeps
41 - union: unify the sets containing the two given elements
55 def union(self, k1, k2):
255 other.chips = sorted(list(chips.union(other_chips)))
332 def __merge_enums(enums, union=False):
339 if not union:
356 def merge_enums(self, names, newname, union=False):
366 union=union
391 def __merge_register_types(regtypes, union=False, field_keys={}):
398 if not union:
416 def merge_register_types(self, names, newname, union=False):
426 union=union
577 regtypes_merge.union(regmap.type_ref, other.type_ref)
595 enums_merge.union(enum_ref, enum_refs[0])
615 union=True
652 union=True
674 regmap.chips = sorted(remaining_chips.union([newchip]))