frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.NodeInfo Class Reference

Information about a node in the DFS. More...

Public Member Functions
	NodeInfo (Collection< String > flags)
	Constructor.
void	addFlags (Collection< String > flags)
	Adds flags to myFlags and lcas.

Public Attributes
HashSet< String >	myFlags = new HashSet<String> ()
	The set of flags for this node.
HashSet< String >	lcas = new HashSet<String> ()
	The set of all flags for which this node might be the lca.
String	parent
	The parent node.
HashMap< String, HashSet< String > >	childFlags
	For each child node, the set of flags received from that node during phase 1.
HashSet< String >	allFlags
	The set of all flags received from all children.
int	nbrMsgsRemaining = 0
	A counter for the number of messages to be received from children.
ArrayList< LCAmsg1 >	phase1msgs = new ArrayList<LCAmsg1> ()
	Used to store phase 1 messages received for this node until we receive the DFSoutput message for this node.

Detailed Description

Information about a node in the DFS.

Constructor & Destructor Documentation

NodeInfo()

frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.NodeInfo.NodeInfo

(

Collection< String >

flags

)

Constructor.

Parameters

flags

a set of flags

Member Function Documentation

addFlags()

void frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.NodeInfo.addFlags

(

Collection< String >

flags

)

Adds flags to myFlags and lcas.

Parameters

flags

the flags

Member Data Documentation

allFlags

HashSet<String> frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.NodeInfo.allFlags

The set of all flags received from all children.

Referenced by frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.newPhase1msg(), frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLCAs< V extends Addable< V >, U extends Addable< U > >.newPhase1msg(), frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.notifyIn(), and frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtRoots< V extends Addable< V >, U extends Addable< U > >.notifyIn().

childFlags

HashMap< String, HashSet<String> > frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.NodeInfo.childFlags

For each child node, the set of flags received from that node during phase 1.

Referenced by frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.notifyIn(), and frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.terminatePhase2().

lcas

HashSet<String> frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.NodeInfo.lcas = new HashSet<String> ()

The set of all flags for which this node might be the lca.

Referenced by frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLCAs< V extends Addable< V >, U extends Addable< U > >.chooseSamples(), frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.notifyIn(), frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtRoots< V extends Addable< V >, U extends Addable< U > >.notifyIn(), frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.sendOutput(), frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLCAs< V extends Addable< V >, U extends Addable< U > >.sendOutput(), and frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.terminatePhase2().

myFlags

HashSet<String> frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.NodeInfo.myFlags = new HashSet<String> ()

The set of flags for this node.

Referenced by frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.notifyIn(), frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtRoots< V extends Addable< V >, U extends Addable< U > >.notifyIn(), frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLCAs< V extends Addable< V >, U extends Addable< U > >.proposeSamples(), frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtRoots< V extends Addable< V >, U extends Addable< U > >.proposeSamples(), and frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLCAs< V extends Addable< V >, U extends Addable< U > >.sendOutput().

nbrMsgsRemaining

int frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.NodeInfo.nbrMsgsRemaining = 0

A counter for the number of messages to be received from children.

Referenced by frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.notifyIn().

parent

String frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.NodeInfo.parent

The parent node.

Referenced by frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.newPhase1msg(), frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLCAs< V extends Addable< V >, U extends Addable< U > >.newPhase1msg(), frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.notifyIn(), and frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtRoots< V extends Addable< V >, U extends Addable< U > >.notifyIn().

phase1msgs

ArrayList<LCAmsg1> frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.NodeInfo.phase1msgs = new ArrayList<LCAmsg1> ()

Used to store phase 1 messages received for this node until we receive the DFSoutput message for this node.

Referenced by frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.notifyIn(), and frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtRoots< V extends Addable< V >, U extends Addable< U > >.notifyIn().

---

The documentation for this class was generated from the following file:

• src/frodo2/algorithms/dpop/stochastic/LowestCommonAncestors.java