FTGraphNodeIteratorImpl


Abstract

Implements an iterator over all nodes of a graph

Discussion

Note that this iterator works a bit different from others: "hasNext" may return YES while in the meanwhile the underlying node may be removed from the database. So in this case it is possible that "next" may return nil.

Methods

-hasNext
-initForGraph
-initForGraph:usingIdIterator:
-next

hasNext


- (BOOL) hasNext;
method result
returns YES if there is at least a datum at the current iteration step

initForGraph


See Also:
initForGraph:usingIdIterator:
- initForGraph: (FTGraphImpl *) aGraph usingIdIterator: (id <ECIterator>) anIdIterator;
Parameter Descriptions
aGraph
graph to examine
anIdIterator
iterator over all node identifiers of this graph
method result
self

initForGraph:usingIdIterator:


See Also:
initForGraph
- initForGraph: (FTGraphImpl *) aGraph usingIdIterator: (id <ECIterator>) anIdIterator;
Parameter Descriptions
aGraph
graph to examine
anIdIterator
iterator over all node identifiers of this graph

next


- next;
method result
returns the next object of the set to iterate or nil, if not existent

(Last Updated August 27, 2006)