|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object net.sourceforge.combean.graph.containers.NodeNumberingAsNodeSet
public class NodeNumberingAsNodeSet
A NodeSet which is implemented using a NodeNumbering. For every element in the set the node number is set to one and to zero otherwise.
Constructor Summary | |
---|---|
NodeNumberingAsNodeSet(NodeNumbering nodeNum)
constructor |
Method Summary | |
---|---|
boolean |
add(Node v)
Add a node to the set. |
void |
clear()
Remove all elements from the set. |
boolean |
contains(Node v)
Check if the set contains a certain node v. |
boolean |
isEmpty()
Check if the collection contains any elements. |
NodeIterator |
iterator()
Return an iterator through all nodes in the collection. |
boolean |
remove(Node v)
Remove a node from the set. |
void |
setGraph(GlobalNodesGraphProp g)
Set the graph which the node numbering refers to. |
int |
size()
Return the number of elements in the set. |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public NodeNumberingAsNodeSet(NodeNumbering nodeNum)
Method Detail |
---|
public void setGraph(GlobalNodesGraphProp g)
g
- The g to set.public final boolean add(Node v)
NodeSet
add
in interface NodeSet
v
- the node to be added.
public final boolean remove(Node v)
NodeSet
remove
in interface NodeSet
v
- the node to be removed.
public void clear()
NodeSet
clear
in interface NodeSet
public int size()
FixedNodeSet
size
in interface FixedNodeSet
public boolean contains(Node v)
FixedNodeSet
contains
in interface FixedNodeSet
public NodeIterator iterator()
FixedNodeCollection
iterator
in interface FixedNodeCollection
public boolean isEmpty()
FixedNodeCollection
isEmpty
in interface FixedNodeCollection
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |