AndNode

Bitwise AND operation.

@mnemonic("and")

struct AndNode {

InEdge result;

static err_t initialize(AndNode* self);

static void dispose(AndNode* self);

bool opEquals(const(AndNode) other);

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(AndNode) other): Equivalence <=> structural equality (modulo operand order).
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(AndNode* self): Frees all resources allocated by this node and sets it to an uninitialized state.
initialize err_t initialize(AndNode* self): Initializes an AND node.

Variables

lhs OutEdge lhs;: Operands.
result InEdge result;: Resulting bit pattern.
rhs OutEdge rhs;: Operands.

Mixed In Members

From `mixin NodeInheritance`

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