Class Node
A single internal node in the tree graph. A Node should be viewed as a connection (the root) with the children being either leaf nodes or other Node instances.
Declaration
class Node
source linkDocumentation
Methods
▷ def __bool__(self) Return whether or not this node has children.
▷ def __contains__(self, other) Return True if 'other' is a direct child of this instance.
▶ def __init__(self, children=None, connector=None, negated=False) Construct a new Node. If no connector is given, use the default.
Overrides
This method is overriden in:
▷ def __len__(self) Return the number of children this node has.
▶ def add(self, data, conn_type, squash=True) Combine this tree and the data represented by data using the connector conn_type. The combine is done by squashing the node other away if possible.
This tree (self) will never be pushed to a child node of the
combined tree, nor will the connector or negated properties change.
Return a node which can be used in place of data regardless if the
node other got squashed or not.
If `squash` is False the data is prepared and added as a child to
this tree without further logic.
▷ def negate(self) Negate the sense of the root connector.
Subclasses
Reexports