#include <TDataStd_ChildNodeIterator.hxx>
Public Member Functions | |
| void * | operator new (size_t, void *anAddress) |
| void * | operator new (size_t size) |
| void | operator delete (void *anAddress) |
| Standard_EXPORT | TDataStd_ChildNodeIterator () |
| Creates an empty iterator. . | |
| Standard_EXPORT | TDataStd_ChildNodeIterator (const Handle(TDataStd_TreeNode)&aTreeNode, const Standard_Boolean allLevels=Standard_False) |
| Iterates on the ChildStepren of the given Step. If <alllevels> option is set to true, it explores not only the first, but all the sub Step levels. . | |
| Standard_EXPORT void | Initialize (const Handle(TDataStd_TreeNode)&aTreeNode, const Standard_Boolean allLevels=Standard_False) |
| Initializes the iteration on the Children Step of the given Step. If <alllevels> option is set to true, it explores not only the first, but all the sub Step levels. . | |
| Standard_Boolean | More () const |
| Returns True if there is a current Item in the iteration. . | |
| Standard_EXPORT void | Next () |
| Move to the next Item . | |
| Standard_EXPORT void | NextBrother () |
| Move to the next Brother. If there is none, go up etc. This method is interesting only with "allLevels" behavior, because it avoids to explore the current Step ChildStepren. . | |
| Handle_TDataStd_TreeNode | Value () const |
| Returns the current item; a null Step if there is no one. . | |
Private Attributes | |
| Handle_TDataStd_TreeNode | myNode |
| Standard_Integer | myFirstLevel |
|
|
|
|
||||||||||||
|
|
|
||||||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||||||||||||
|
|
|
|
|
|
|
|
|
|
|
1.4.1