Modifier and Type	Class and Description
private static class	DynamicGraph.Edges<T> Manage edges and weights between nodes.

Modifier and Type	Field and Description
private final DynamicGraph.Edges<T>	m_edges
private final Set<T>	m_nodesFinished
private final Set<T>	m_nodesReady
private final Set<T>	m_nodesRunning
private Set<IExecutionVisualiser>	visualisers

Access	Constructor and Description
public	DynamicGraph()

Method Summary

Modifier and Type	Method and Description
public void	addEdge(int - Represents one of `org.testng.TestRunner.PriorityWeight` ordinals indicating the weightage of a particular node in the graph weight, T - Represents the edge that depends on another edge. from, T - Represents the edge on which another edge depends upon. to) Implements org.testng.IDynamicGraph.addEdge.
public void	addEdges(int weight, T from, Iterable<T> tos) Implements org.testng.IDynamicGraph.addEdges. Add an edge between two nodes.
public boolean	addNode(T node) Implements org.testng.IDynamicGraph.addNode. Add a node to the graph.
private List<T>	dependencies(Map<T, Integer> dependencies)
private static <T> String	dotShortName(T t)
public List<T>	getDependenciesFor(T node) Implements org.testng.IDynamicGraph.getDependenciesFor.
pack-priv Map<T, Map<T, Integer>>	getEdges() For tests only
public List<T>	Returns: a set of all the nodes that don't depend on any other nodes. getFreeNodes() Implements org.testng.IDynamicGraph.getFreeNodes.
public int	Returns: the number of nodes in this graph. getNodeCount() Implements org.testng.IDynamicGraph.getNodeCount.
public int	getNodeCountWithStatus(IDynamicGraph.Status status) Implements org.testng.IDynamicGraph.getNodeCountWithStatus.
public Set<T>	getNodesWithStatus(IDynamicGraph.Status status) Implements org.testng.IDynamicGraph.getNodesWithStatus.
public List<T>	getUpstreamDependenciesFor(T node) Overrides default org.testng.IDynamicGraph.getUpstreamDependenciesFor.
public void	setStatus(Collection<T> nodes, IDynamicGraph.Status status) Implements org.testng.IDynamicGraph.setStatus, org.testng.IDynamicGraph.setStatus. Set the status for a set of nodes.
public void	setStatus(T node, IDynamicGraph.Status status) Implements org.testng.IDynamicGraph.setStatus. Set the status for a node.
public void	setVisualisers(Set<IExecutionVisualiser> listener) Implements org.testng.IDynamicGraph.setVisualisers.
public String	Returns: a .dot file (GraphViz) version of this graph. toDot() Implements org.testng.IDynamicGraph.toDot.
public String	toString() Overrides java.lang.Object.toString. Returns a string representation of the object.

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll wait wait wait

Field Detail

m_edges	back to summary
private final DynamicGraph.Edges<T> m_edges

m_nodesFinished	back to summary
private final Set<T> m_nodesFinished

m_nodesReady	back to summary
private final Set<T> m_nodesReady

m_nodesRunning	back to summary
private final Set<T> m_nodesRunning

visualisers	back to summary
private Set<IExecutionVisualiser> visualisers

DynamicGraph	back to summary
public DynamicGraph()

Method Detail

addEdge back to summary

addEdge	back to summary
public void addEdge(int weight, T from, T to) Implements org.testng.IDynamicGraph.addEdge. Parameters weight:int - Represents one of `org.testng.TestRunner.PriorityWeight` ordinals indicating the weightage of a particular node in the graph from:T - Represents the edge that depends on another edge. to:T - Represents the edge on which another edge depends upon.

public void addEdge(int weight, T from, T to)

Implements org.testng.IDynamicGraph.addEdge.

Parameters

weight:int: - Represents one of org.testng.TestRunner.PriorityWeight ordinals indicating the weightage of a particular node in the graph
from:T: - Represents the edge that depends on another edge.
to:T: - Represents the edge on which another edge depends upon.

addEdges	back to summary
public void addEdges(int weight, T from, Iterable<T> tos) Implements org.testng.IDynamicGraph.addEdges. Add an edge between two nodes.

addEdges

back to summary

public void addEdges(int weight, T from, Iterable<T> tos)

Implements org.testng.IDynamicGraph.addEdges.

Add an edge between two nodes.

addNode	back to summary
public boolean addNode(T node) Implements org.testng.IDynamicGraph.addNode. Add a node to the graph.

addNode

back to summary

public boolean addNode(T node)

Implements org.testng.IDynamicGraph.addNode.

Add a node to the graph.

dependencies	back to summary
private List<T> dependencies(Map<T, Integer> dependencies)

dotShortName	back to summary
private static <T> String dotShortName(T t)

getDependenciesFor	back to summary
public List<T> getDependenciesFor(T node) Implements org.testng.IDynamicGraph.getDependenciesFor.

getEdges	back to summary
pack-priv Map<T, Map<T, Integer>> getEdges() For tests only

getFreeNodes	back to summary
public List<T> getFreeNodes() Implements org.testng.IDynamicGraph.getFreeNodes. Returns:List<T> a set of all the nodes that don't depend on any other nodes.

getFreeNodes

back to summary

public List<T> getFreeNodes()

Implements org.testng.IDynamicGraph.getFreeNodes.

Returns:List<T>: a set of all the nodes that don't depend on any other nodes.

getNodeCount	back to summary
public int getNodeCount() Implements org.testng.IDynamicGraph.getNodeCount. Returns:int the number of nodes in this graph.

getNodeCount

back to summary

public int getNodeCount()

Implements org.testng.IDynamicGraph.getNodeCount.

Returns:int: the number of nodes in this graph.

getNodeCountWithStatus	back to summary
public int getNodeCountWithStatus(IDynamicGraph.Status status) Implements org.testng.IDynamicGraph.getNodeCountWithStatus.

getNodesWithStatus	back to summary
public Set<T> getNodesWithStatus(IDynamicGraph.Status status) Implements org.testng.IDynamicGraph.getNodesWithStatus.

getUpstreamDependenciesFor	back to summary
public List<T> getUpstreamDependenciesFor(T node) Overrides default org.testng.IDynamicGraph.getUpstreamDependenciesFor. Annotations @Override

getUpstreamDependenciesFor

back to summary

public List<T> getUpstreamDependenciesFor(T node)

Overrides default org.testng.IDynamicGraph.getUpstreamDependenciesFor.

Annotations

@Override

setStatus	back to summary
public void setStatus(Collection<T> nodes, IDynamicGraph.Status status) Implements org.testng.IDynamicGraph.setStatus, org.testng.IDynamicGraph.setStatus. Set the status for a set of nodes.

setStatus

back to summary

public void setStatus(Collection<T> nodes, IDynamicGraph.Status status)

Implements org.testng.IDynamicGraph.setStatus, org.testng.IDynamicGraph.setStatus.

Set the status for a set of nodes.

setStatus	back to summary
public void setStatus(T node, IDynamicGraph.Status status) Implements org.testng.IDynamicGraph.setStatus. Set the status for a node.

setStatus

back to summary

public void setStatus(T node, IDynamicGraph.Status status)

Implements org.testng.IDynamicGraph.setStatus.

Set the status for a node.

setVisualisers	back to summary
public void setVisualisers(Set<IExecutionVisualiser> listener) Implements org.testng.IDynamicGraph.setVisualisers.

toDot	back to summary
public String toDot() Implements org.testng.IDynamicGraph.toDot. Returns:String a .dot file (GraphViz) version of this graph.

toDot

back to summary

public String toDot()

Implements org.testng.IDynamicGraph.toDot.

Returns:String: a .dot file (GraphViz) version of this graph.

toString	back to summary
public String toString() Overrides java.lang.Object.toString. Doc from java.lang.Object.toString. Returns a string representation of the object. Returns:String a string representation of the object Annotations @Override

toString

back to summary

public String toString()

Overrides java.lang.Object.toString.

Doc from java.lang.Object.toString.

Returns a string representation of the object.

Returns:String

a string representation of the object

Annotations

@Override

org.testng.internal back to summary

private Class DynamicGraph.Edges<T>

Class Inheritance

extends Object

java.lang.Object
org.testng.internal.DynamicGraph.Edges

Manage edges and weights between nodes.

Field Summary

Modifier and Type	Field and Description
private final Map<T, Map<T, Integer>>	m_incomingEdges
private final Map<T, Map<T, Integer>>	m_outgoingEdges

Constructor Summary

Access	Constructor and Description
private	Edges()

Method Summary

Modifier and Type	Method and Description
public void	addEdge(int weight, T from, T to, boolean ignoreCycles)
private static <T> void	addEdgeToMap(Map<T, Map<T, Integer>> map, T n1, T n2, int weight)
pack-priv void	appendDotEdges(StringBuilder sb, Set<T> finished)
private Integer	Returns: the weight of the reversed edge or null if edge does not exist findReversedEdge(T - the from edge from, T - the to edge to) Return the weight of the edge in the graph that is the reversed direction of edge.
pack-priv Map<T, Integer>	from(T node)
pack-priv Set<T>	Returns: the set of nodes that have outgoing edges. fromNodes()
pack-priv Map<T, Map<T, Integer>>	getEdges() Allow raw access to the edges, but protect inside unmodifiableMaps.
pack-priv int	getLowestEdgeWeight(Set<T> nodes)
pack-priv boolean	hasAllEdgesWithWeight(T node, int level)
private static <T> void	removeEdgesFromMap(Map<T, Map<T, Integer>> map, Collection<T> nodes, T node) Remove edges from a map given a node and a list of destination nodes.
pack-priv void	removeNode(T Node to remove. node) Remove a node from the graph and all associated edges.
pack-priv Map<T, Integer>	to(T node)
public String	toString() Overrides java.lang.Object.toString. Returns a string representation of the object.

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll wait wait wait

Field Detail

m_incomingEdges	back to summary
private final Map<T, Map<T, Integer>> m_incomingEdges

m_outgoingEdges	back to summary
private final Map<T, Map<T, Integer>> m_outgoingEdges

Constructor Detail

Edges	back to summary
private Edges()

Method Detail

addEdge	back to summary
public void addEdge(int weight, T from, T to, boolean ignoreCycles)

addEdgeToMap	back to summary
private static <T> void addEdgeToMap(Map<T, Map<T, Integer>> map, T n1, T n2, int weight)

appendDotEdges	back to summary
pack-priv void appendDotEdges(StringBuilder sb, Set<T> finished)

findReversedEdge	back to summary
private Integer findReversedEdge(T from, T to) Return the weight of the edge in the graph that is the reversed direction of edge. For example, if edge a -> b exists, and edge b -> a is passed in, then return a -> b. Parameters from:T - the from edge to:T - the to edge Returns:Integer the weight of the reversed edge or null if edge does not exist

findReversedEdge

back to summary

private Integer findReversedEdge(T from, T to)

Return the weight of the edge in the graph that is the reversed direction of edge. For example, if edge a -> b exists, and edge b -> a is passed in, then return a -> b.

Parameters

from:T: - the from edge
to:T: - the to edge

Returns:Integer

the weight of the reversed edge or null if edge does not exist

from	back to summary
pack-priv Map<T, Integer> from(T node)

fromNodes	back to summary
pack-priv Set<T> fromNodes() Returns:Set<T> the set of nodes that have outgoing edges.

getEdges	back to summary
pack-priv Map<T, Map<T, Integer>> getEdges() Allow raw access to the edges, but protect inside unmodifiableMaps. This is for tests, toString and toDot.

getLowestEdgeWeight	back to summary
pack-priv int getLowestEdgeWeight(Set<T> nodes)

hasAllEdgesWithWeight	back to summary
pack-priv boolean hasAllEdgesWithWeight(T node, int level)

removeEdgesFromMap back to summary

removeEdgesFromMap	back to summary
private static <T> void removeEdgesFromMap(Map<T, Map<T, Integer>> map, Collection<T> nodes, T node) Remove edges from a map given a node and a list of destination nodes. Given: `m_outgoingEdges: a -> b c d m_incomingEdges: b -> a c -> a d -> a` Then, calling this method to remove node c on both maps as done in removeNode(), would result in a -> c and c -> a edges being removed.

private static <T> void removeEdgesFromMap(Map<T, Map<T, Integer>> map, Collection<T> nodes, T node)

Remove edges from a map given a node and a list of destination nodes. Given:

m_outgoingEdges:
   a -> b
        c
        d
m_incomingEdges:
   b -> a
   c -> a
   d -> a

Then, calling this method to remove node c on both maps as done in removeNode(), would result in a -> c and c -> a edges being removed.

removeNode	back to summary
pack-priv void removeNode(T node) Remove a node from the graph and all associated edges. Each edge needs to be removed from both maps to keep the maps in sync. Parameters node:T Node to remove.

removeNode

back to summary

pack-priv void removeNode(T node)

Remove a node from the graph and all associated edges. Each edge needs to be removed from both maps to keep the maps in sync.

Parameters

node:T: Node to remove.

to	back to summary
pack-priv Map<T, Integer> to(T node)

toString	back to summary
public String toString() Overrides java.lang.Object.toString. Doc from java.lang.Object.toString. Returns a string representation of the object. Returns:String a string representation of the object Annotations @Override

toString

back to summary

public String toString()

Overrides java.lang.Object.toString.

Doc from java.lang.Object.toString.

Returns a string representation of the object.

Returns:String

a string representation of the object

Annotations

@Override

public Class DynamicGraph<T>

Nested and Inner Type Summary

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

private Class DynamicGraph.Edges<T>

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail