Package it.unive.lisa.util.datastructures.graph

Interface Node<G extends Graph<G,N,E>,N extends Node<G,N,E>,E extends Edge<G,N,E>>

Type Parameters:

G - the type of Graph this node can be used with

N - the type of this node

E - the type of Edge that this node can be connected to

All Known Subinterfaces:

CodeNode<G,N,E>

All Known Implementing Classes:

Assignment, BinaryExpression, BinaryStatement, Call, CallGraphNode, CallWithResult, CFGCall, DefaultParamInitialization, Expression, Literal, MultiCall, NamedParameterExpression, NaryExpression, NaryStatement, NativeCall, NoOp, OpenCall, Ret, Return, Statement, TernaryExpression, TernaryStatement, Throw, TruncatedParamsCall, UnaryExpression, UnaryStatement, UnresolvedCall, VariableRef

public interface Node<G extends Graph<G,N,E>,N extends Node<G,N,E>,E extends Edge<G,N,E>>

A node of a Graph.

Method Summary

Modifier and Type	Method	Description
<V> boolean	accept(GraphVisitor<G,N,E,V> visitor, V tool)	Accepts the given GraphVisitor.

Method Detail

accept

<V> boolean accept(GraphVisitor<G,N,E,V> visitor,
                   V tool)

Accepts the given GraphVisitor. Implementors of this method are responsible for invoking GraphVisitor.visit(Object, Graph, Node) on this node after accept(GraphVisitor, Object) has been invoked on all nested nodes, if any. The visiting should stop at the first of such calls that return false.

Type Parameters:

V - the type of auxiliary tool that visitor can use

Parameters:

visitor - the visitor that is visiting the Graph containing this node

tool - the auxiliary tool that visitor can use

Returns:

whether or not the visiting should stop when this call returns, as decided by the visitor itself