Eclipse ORB Primitive Function Library 5.1.1 · org.glassfish.pfl.basic.graph.GraphImpl

Modifier and Type	Class and Description
pack-priv static interface	GraphImpl.NodeVisitor<T extends Node>

Modifier and Type	Field and Description
private Map<T, NodeData>	nodeToData

Access	Constructor and Description
public	GraphImpl()
public	GraphImpl(Collection<T> coll)

Method Summary

Modifier and Type	Method and Description
public boolean	add(T obj) Overrides java.util.AbstractCollection.add. Implements java.util.Set.add, java.util.Collection.add. Adds the specified element to this set if it is not already present (optional operation).
private void	clearNodeData()
private Set<T>	collectRootSet()
public NodeData	getNodeData(T node) Implements org.glassfish.pfl.basic.graph.Graph.getNodeData.
public Set<T>	getRoots() Implements org.glassfish.pfl.basic.graph.Graph.getRoots.
public Iterator<T>	iterator() Implements abstract java.util.AbstractCollection.iterator. Implements java.util.Set.iterator, java.util.Collection.iterator. Returns an iterator over the elements in this set.
private void	markNonRoots()
public int	size() Implements abstract java.util.AbstractCollection.size. Implements java.util.Set.size, java.util.Collection.size. Returns the number of elements in this set (its cardinality).
pack-priv void	visitAll(GraphImpl.NodeVisitor<T> nv)

Inherited from java.util.AbstractSet:: equals hashCode removeAll

nodeToData	back to summary
private Map<T, NodeData> nodeToData

GraphImpl	back to summary
public GraphImpl()

GraphImpl	back to summary
public GraphImpl(Collection<T> coll)

Method Detail

add back to summary

add	back to summary
public boolean add(T obj) Overrides java.util.AbstractCollection.add. Implements java.util.Set.add, java.util.Collection.add. Doc from java.util.Set.add. Adds the specified element to this set if it is not already present (optional operation). More formally, adds the specified element `e` to this set if the set contains no element `e2` such that `Objects.equals(e, e2)`. If this set already contains the element, the call leaves the set unchanged and returns `false`. In combination with the restriction on constructors, this ensures that sets never contain duplicate elements. The stipulation above does not imply that sets must accept all elements; sets may refuse to add any particular element, including `null`, and throw an exception, as described in the specification for `Collection.add`. Individual set implementations should clearly document any restrictions on the elements that they may contain. Annotations @Override

public boolean add(T obj)

Overrides java.util.AbstractCollection.add.

Implements java.util.Set.add, java.util.Collection.add.

Doc from java.util.Set.add.

Adds the specified element to this set if it is not already present (optional operation). More formally, adds the specified element e to this set if the set contains no element e2 such that Objects.equals(e, e2). If this set already contains the element, the call leaves the set unchanged and returns false. In combination with the restriction on constructors, this ensures that sets never contain duplicate elements.

The stipulation above does not imply that sets must accept all elements; sets may refuse to add any particular element, including null, and throw an exception, as described in the specification for Collection.add. Individual set implementations should clearly document any restrictions on the elements that they may contain.

Annotations

@Override

clearNodeData	back to summary
private void clearNodeData()

collectRootSet	back to summary
private Set<T> collectRootSet()

getNodeData	back to summary
public NodeData getNodeData(T node) Implements org.glassfish.pfl.basic.graph.Graph.getNodeData.

getRoots	back to summary
public Set<T> getRoots() Implements org.glassfish.pfl.basic.graph.Graph.getRoots.

iterator	back to summary
public Iterator<T> iterator() Implements abstract java.util.AbstractCollection.iterator. Implements java.util.Set.iterator, java.util.Collection.iterator. Doc from java.util.Set.iterator. Returns an iterator over the elements in this set. The elements are returned in no particular order (unless this set is an instance of some class that provides a guarantee).

iterator

back to summary

public Iterator<T> iterator()

Implements abstract java.util.AbstractCollection.iterator.

Implements java.util.Set.iterator, java.util.Collection.iterator.

Doc from java.util.Set.iterator.

Returns an iterator over the elements in this set. The elements are returned in no particular order (unless this set is an instance of some class that provides a guarantee).

markNonRoots	back to summary
private void markNonRoots()

size back to summary

size	back to summary
public int size() Implements abstract java.util.AbstractCollection.size. Implements java.util.Set.size, java.util.Collection.size. Doc from java.util.Set.size. Returns the number of elements in this set (its cardinality). If this set contains more than `Integer.MAX_VALUE` elements, returns `Integer.MAX_VALUE`.

public int size()

Implements abstract java.util.AbstractCollection.size.

Implements java.util.Set.size, java.util.Collection.size.

Doc from java.util.Set.size.

Returns the number of elements in this set (its cardinality). If this set contains more than Integer.MAX_VALUE elements, returns Integer.MAX_VALUE.

visitAll	back to summary
pack-priv void visitAll(GraphImpl.NodeVisitor<T> nv)

public Class GraphImpl<T extends Node<T>>

Nested and Inner Type Summary

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

pack-priv Interface GraphImpl.NodeVisitor<T extends Node>

Method Summary

Method Detail