Skip to main content

ClikaRT::graph::Edge

class

Header: ClikaRT/graph/node.h

One read of a value: the value src() produces on output port src_port(), read by dst() on input port dst_port(); Mul(x, x) reads x over two edges. Edges join nodes only: a constant or a state operand is a Value (Node::inputs(), Node::input(port)), not an edge, and returning a value from the graph adds none. The view finds its edge again by its two nodes and ports after an edit; once no edge has them, the view answers empty and check() says so.

Member functions​

check()​

void check() const

Nothing when the graph still holds this edge; Status::InvalidArgument naming its two nodes and ports when it no longer does (an end was removed or renamed, or the read moved to another port) or when the graph itself no longer exists.

Declared in ClikaRT/graph/node.h, line 195

src()​

Node src() const

The node the edge leaves: the producer of the value it carries.

Declared in ClikaRT/graph/node.h, line 197

src_port()​

int src_port() const

Declared in ClikaRT/graph/node.h, line 198

dst()​

Node dst() const

The node the edge enters: the operator that reads the value.

Declared in ClikaRT/graph/node.h, line 200

dst_port()​

int dst_port() const

Declared in ClikaRT/graph/node.h, line 201

Friends​

operator==​

friend bool operator==(const Edge& a, const Edge& b) noexcept

Two views of the same edge (the same graph, nodes and ports) compare equal.

Declared in ClikaRT/graph/node.h, line 205