Skip to main content
Version: 2026R2

BooleanSelectionRule

class compolyx.BooleanSelectionRule(graph, obj, parent=None)​

Boolean selection rule.

Attributes​

NameDescription
BooleanSelectionRule.activeActive status of object
BooleanSelectionRule.changedTriggers Observable to dispatch changed message
BooleanSelectionRule.enabledWhether this object is currently enabled or not
BooleanSelectionRule.extentExtent of the rule
BooleanSelectionRule.idID of object
BooleanSelectionRule.include_rule_typeInclude type
BooleanSelectionRule.is_dict_itemSpecifies whether the object is an item of a dict
BooleanSelectionRule.is_list_itemSpecifies whether the object is an item of a list
BooleanSelectionRule.link_pathRoot path of the current node in the tree for links to this object
BooleanSelectionRule.nameName of object
BooleanSelectionRule.parentParent object in tree
BooleanSelectionRule.relative_rule_typeRelative type
BooleanSelectionRule.root_pathRoot path of the current node in the tree
BooleanSelectionRule.selection_rulesElement Selection Rule of the Boolean Selection Rule.
BooleanSelectionRule.statusStatus of the object
BooleanSelectionRule.status_changedBoolean flag which is set to true in C++ when up-to-date status of object changes
BooleanSelectionRule.uidUID of object
BooleanSelectionRule.vertexThrows an error if the object has been removed from the graph

Methods​

NameDescription
BooleanSelectionRule.add_rule(rule[, ...])Add selection rule to boolean selection rule
BooleanSelectionRule.find_parent(type)Steps up the tree and returns the first parent with given type
BooleanSelectionRule.get_short_description()
BooleanSelectionRule.obj_exists()Checks if __obj still references the C++ object (i.e. has not been reset to None by self._delete) and exists in the graph
BooleanSelectionRule.serialize()Serialize to Python string
BooleanSelectionRule.serialize_name_and_id()Helper function to serialize name and ID
BooleanSelectionRule.serialize_rule_types()
BooleanSelectionRule.update()
BooleanSelectionRule.visit(visitor)Walk through the tree and let the visitor perform an action on every descendant node