com.phoenixst.plexus.util

Class AdjacentNodeCollection

public class AdjacentNodeCollection extends AbstractCollection

A Collection for nodes to help implement the Graph.adjacentNodes( Predicate ) method.

Since: 1.0

Version: $Revision: 1.7 $

Author: Ray A. Conner

Constructor Summary
AdjacentNodeCollection(Graph graph, Object baseNode, Predicate traverserPredicate)
Creates a new AdjacentNodeCollection.
Method Summary
booleanaddAll(Collection collection)
Throws an UnsupportedOperationException.
booleancontains(Object object)
This implementation uses Graph.traverser( node, predicate ) and returns true, if found.
Iteratoriterator()
This implementation returns a wrapper around Graph.traverser( node, predicate ).
booleanremove(Object object)
This implementation uses Graph.traverser( node, predicate ) and removes the Graph.Edge to the node, if found.
intsize()
This implementation delegates to Graph.degree( node, predicate ).

Constructor Detail

AdjacentNodeCollection

public AdjacentNodeCollection(Graph graph, Object baseNode, Predicate traverserPredicate)
Creates a new AdjacentNodeCollection. If a null Predicate is passed to this constructor, TruePredicate is used internally.

Method Detail

addAll

public boolean addAll(Collection collection)
Throws an UnsupportedOperationException.

contains

public boolean contains(Object object)
This implementation uses Graph.traverser( node, predicate ) and returns true, if found.

iterator

public Iterator iterator()
This implementation returns a wrapper around Graph.traverser( node, predicate ).

remove

public boolean remove(Object object)
This implementation uses Graph.traverser( node, predicate ) and removes the Graph.Edge to the node, if found.

size

public int size()
This implementation delegates to Graph.degree( node, predicate ).
See the Plexus project home, hosted by SourceForge.
Copyright B) 1994-2006, by Phoenix Software Technologists, Inc. and others. All Rights Reserved. Use is subject to license terms.