Dataflow Software Stack
032db78
Master Thesis of Mathijs Saey at the VUB
|
Standard node. More...
Public Member Functions | |
def | __init__ |
Create a new node. More... | |
def | copy |
Create a copy of a node. More... | |
def | __str__ |
Create a printable version of the node. More... | |
def | getInputPort |
Gets an input port. More... | |
def | getOutputPort |
Gets an output port. More... | |
def | hasNext |
See if this node can be followed to other nodes. More... | |
def | hasPrevious |
See if this node can be follow to other nodes. More... | |
def | isCompound |
Check if this node is a compound node. More... | |
def | isCall |
Check if this node is a call node. More... | |
Public Attributes | |
subGraph | |
key | |
inputs | |
outputs | |
inputPorts | |
outputPorts | |
Standard node.
def IGR.node.Node.__init__ | ( | self, | |
subGraph, | |||
inputs = 0 , |
|||
outputs = 0 , |
|||
key = None |
|||
) |
Create a new node.
subGraph | The subgraph this node belongs to. |
inputs | The amount of inputs this node will accept This argument is optional, the input amount will be updated depending on the amount of incoming edges. |
outputs | The amount of outputs this node will return. The same rules that apply to inputs apply here. |
def IGR.node.Node.copy | ( | self, | |
subGraph | |||
) |
Create a copy of a node.
This will create an identical, unique node, but with unconnected in and output ports.
def IGR.node.Node.__str__ | ( | self | ) |
Create a printable version of the node.
def IGR.node.Node.getInputPort | ( | self, | |
idx | |||
) |
Gets an input port.
Create it if it doesn't exist yet. This allows us to determine the amount of inputs a certain node will have, even if this is not explicit in IF1
idx | The idx of the port you need |
def IGR.node.Node.getOutputPort | ( | self, | |
idx | |||
) |
Gets an output port.
Create it if it doesn't exist yet. This allows us to determine the amount of outputs a certain node will have, even if this is not explicit in IF1
idx | The idx of the port you need |
def IGR.node.Node.hasNext | ( | self | ) |
See if this node can be followed to other nodes.
def IGR.node.Node.hasPrevious | ( | self | ) |
See if this node can be follow to other nodes.
def IGR.node.Node.isCompound | ( | self | ) |
Check if this node is a compound node.
def IGR.node.Node.isCall | ( | self | ) |
Check if this node is a call node.
IGR.node.Node.subGraph |
IGR.node.Node.key |
IGR.node.Node.inputs |
IGR.node.Node.outputs |
IGR.node.Node.inputPorts |
IGR.node.Node.outputPorts |