blob: f559b8ed41bd0abaa51392e6417f6c59947477ad (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
|
// File: TDataStd_ChildNodeIterator.cxx
// Created: Wed Jan 26 16:43:08 2000
// Author: Denis PASCAL
// <dp@dingox.paris1.matra-dtv.fr>
#include <TDataStd_ChildNodeIterator.ixx>
#define ChildNodeIterator_UpToBrother \
{ \
while (!myNode.IsNull() && (myNode->Depth() > myFirstLevel) && myNode->myNext == NULL) \
myNode = myNode->myFather; \
if (!myNode.IsNull() && (myNode->Depth() > myFirstLevel) && myNode->myFather != NULL) \
myNode = myNode->myNext; \
else \
myNode = NULL; \
}
//=======================================================================
//function : TDataStd_ChildNodeIterator
//purpose :
//=======================================================================
TDataStd_ChildNodeIterator::TDataStd_ChildNodeIterator()
: myFirstLevel(0)
{}
//=======================================================================
//function : TDataStd_ChildNodeIterator
//purpose :
//=======================================================================
TDataStd_ChildNodeIterator::TDataStd_ChildNodeIterator (const Handle(TDataStd_TreeNode)& aTreeNode,
const Standard_Boolean allLevels)
: myNode(aTreeNode->myFirst),
myFirstLevel(allLevels ? aTreeNode->Depth() : -1)
{}
//=======================================================================
//function : Initialize
//purpose :
//=======================================================================
void TDataStd_ChildNodeIterator::Initialize(const Handle(TDataStd_TreeNode)& aTreeNode,
const Standard_Boolean allLevels)
{
myNode = aTreeNode->myFirst;
myFirstLevel = allLevels ? aTreeNode->Depth() : -1;
}
//=======================================================================
//function : Next
//purpose :
//=======================================================================
void TDataStd_ChildNodeIterator::Next()
{
if (myFirstLevel == -1) {
myNode = myNode->myNext;
}
else {
if (myNode->myFirst != NULL) myNode = myNode->myFirst;
else ChildNodeIterator_UpToBrother;
}
}
//=======================================================================
//function : NextBrother
//purpose :
//=======================================================================
void TDataStd_ChildNodeIterator::NextBrother()
{
if (myNode->myNext != NULL) myNode = myNode->myNext;
else ChildNodeIterator_UpToBrother;
}
|
