harpoon.Util.Collections
Interface Graph.Node<N extends Graph.Node<N,E>,E extends Graph.Edge<N,E>>

All Known Subinterfaces:

CFGraphable<CFG,E>

All Known Implementing Classes:

AbstractGraph.Node, AGET, ALENGTH, ANEW, ARRAYINIT, ASET, CALL, CJMP, CodeGen.InstrCC, CodeGen.InstrDELAYSLOT, COMPONENTOF, CONST, DEBUG, FOOTER, GET, HANDLER, HEADER, InCti, InGen, InMerge, InRet, INSTANCEOF, Instr, Instr, InstrCALL, InstrDIRECTIVE, InstrJUMP, InstrLABEL, InstrMEM, InstrMOVE, InstrMOVEproxy, InSwitch, LABEL, LowQuad, METHOD, MONITORENTER, MONITOREXIT, MOVE, NEW, NOP, OPER, PAOFFSET, PARRAY, PCALL, PCONST, PFCONST, PFIELD, PFOFFSET, PGET, PHI, PMCONST, PMETHOD, PMOFFSET, POPER, PPTR, PSET, Quad, RegAlloc.RestoreProxy, RegAlloc.SpillLoad, RegAlloc.SpillProxy, RegAlloc.SpillStore, RETURN, SET, SIGMA, SWITCH, THROW, TYPECAST, TYPESWITCH

Enclosing interface:

Graph<N extends Graph.Node<N,E>,E extends Graph.Edge<N,E>>

public static interface Graph.Node<N extends Graph.Node<N,E>,E extends Graph.Edge<N,E>>

This class represents nodes in a Graph.

Version:

$Id: Graph.java,v 1.3 2004/02/08 01:56:38 cananian Exp $

Author:

C. Scott Ananian <cananian@alumni.princeton.edu>

Method Summary

boolean	isPred(N n) Return true iff the given node is a predecessor of this node.
boolean	isSucc(N n) Return true iff the given node is a successor of this node.
Collection<E>	predC() Return a collection of edges leading to this node.
Collection<E>	succC() Return a collection of edges leaving this node.

Method Detail

predC

Collection<E> predC()

Return a collection of edges leading to this node.

succC

Collection<E> succC()

Return a collection of edges leaving this node.

isSucc

boolean isSucc(N n)

Return true iff the given node is a successor of this node.

isPred

boolean isPred(N n)

Return true iff the given node is a predecessor of this node.