TruncationNode

Yields the lowermost bits of its input.

@mnemonic("trunc")

struct TruncationNode {

OutEdge input;

InEdge output;

static err_t initialize(TruncationNode* self);

static void dispose(TruncationNode* self);

bool opEquals(const(TruncationNode) rhs);

hash_t toHash();

inout(InEdge)* opIndex(InEdge.ID slot);

OutEdgeIterator!Callable outEdges [@property getter];

InEdgeIterator!Callable inEdges [@property getter];

}

Members

Functions

opEquals bool opEquals(const(TruncationNode) rhs): Equivalence <=> structural equality.
opIndex inout(InEdge)* opIndex(InEdge.ID slot): See Node.opIndex.
toHash hash_t toHash(): Semantic hash.

Properties

inEdges InEdgeIterator!Callable inEdges [@property getter]: Provides an iterator over this node's in-edges.
outEdges OutEdgeIterator!Callable outEdges [@property getter]: Provides an iterator over this node's out-edges.

Static functions

dispose void dispose(TruncationNode* self): Frees all resources allocated by this node and sets it to an uninitialized state.
initialize err_t initialize(TruncationNode* self): Initializes a truncation node.

Variables

input OutEdge input;: Bit pattern being truncated.
output InEdge output;: Lowermost input bits.

Mixed In Members

From `mixin NodeInheritance`

opPostMove void opPostMove(const(This) old): Post-move adjusts in-edge slots' owner pointer.