1 -- File: TDataStd_ChildNodeIterator.cdl
2 -- Created: Wed Jan 26 16:32:08 2000
3 -- Author: Denis PASCAL
4 -- <dp@dingox.paris1.matra-dtv.fr>
5 ---Copyright: Matra Datavision 2000
8 class ChildNodeIterator from TDataStd
10 ---Purpose: Iterates on the ChildStepren step of a step, at the
11 -- first level only. It is possible to ask the
12 -- iterator to explore all the sub step levels of the
13 -- given one, with the option "allLevels".
15 uses TreeNode from TDataStd
20 returns ChildNodeIterator from TDataStd;
21 ---Purpose: Creates an empty iterator.
23 Create(aTreeNode : TreeNode from TDataStd;
24 allLevels : Boolean from Standard = Standard_False)
25 returns ChildNodeIterator from TDataStd;
26 ---Purpose: Iterates on the ChildStepren of the given Step. If
27 -- <allLevels> option is set to true, it explores not
28 -- only the first, but all the sub Step levels.
30 Initialize(me : in out;
31 aTreeNode : TreeNode from TDataStd;
32 allLevels : Boolean from Standard = Standard_False);
33 ---Purpose: Initializes the iteration on the Children Step of
34 -- the given Step. If <allLevels> option is set to
35 -- true, it explores not only the first, but all the
38 More(me) returns Boolean;
40 ---Purpose: Returns True if there is a current Item in the
44 ---Purpose: Move to the next Item
46 NextBrother(me : in out);
47 ---Purpose: Move to the next Brother. If there is none, go up
48 -- etc. This method is interesting only with
49 -- "allLevels" behavior, because it avoids to explore
50 -- the current Step ChildStepren.
52 Value(me) returns TreeNode from TDataStd;
54 ---Purpose: Returns the current item; a null Step if there is
59 myNode : TreeNode from TDataStd;
60 myFirstLevel : Integer from Standard;
62 end ChildNodeIterator;