blob: 401f580b446f225dcfbc4c37bf043f9a825504f8 (
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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
|
#include <Standard_OutOfRange.hxx>
#include <Standard_NoSuchObject.hxx>
#include <Standard_NoMoreObject.hxx>
// ----------------------------------------------------------------------
// Copyright: Matra-Datavision 1992
// File: PCollection_ATPreOrderIterator.gxx
// Created: Aug, 13 1992
// Author: Mireille MERCIEN
// ----------------------------------------------------------------------
// Purpose: Permits to iterate through an ArbitraryTree so that,
// from the root, it reads each element on the left,
// until the first leave, then goes to its rightSibling
// and upward.
// IF theTree is ( A (B (C D E)) F G (H (I J K)))
// THEN it will read ( A B C D E F G H I J K)
// -----------
// constructor :
// -----------
PCollection_ATPreOrderIterator::
PCollection_ATPreOrderIterator
(const Handle(PCollection_HArbitraryTree)& ATree)
{
CurrentStack = new PCollection_StackArbitraryTree;
if (ATree.IsNull()) {
HasMore = Standard_False;
}
else {
HasMore = Standard_True;
CurrentTree = ATree;
CurrentStack->Push(ATree);
}
}
// --------
// More
// --------
Standard_Boolean PCollection_ATPreOrderIterator::More() const
{
return HasMore;
}
// --------
// Value
// --------
Handle(PCollection_HArbitraryTree)
PCollection_ATPreOrderIterator::Value() const
{
if (!HasMore) Standard_NoSuchObject::Raise();
return CurrentTree;
}
// --------
// Clear
// --------
void PCollection_ATPreOrderIterator::Clear()
{
CurrentTree.Nullify();
CurrentStack.Nullify();
HasMore = Standard_False;
}
// --------
// Next
// --------
void PCollection_ATPreOrderIterator::Next()
{
if (!HasMore) Standard_NoMoreObject::Raise();
Handle(PCollection_HArbitraryTree) Temp;
if (CurrentTree->IsLeaf()) {
// ... no child, so go upward, then to the right
Temp = RecursiveRemove( CurrentTree);
// ... and adds the right neighbour of the last removed tree
if ( HasMore) {
CurrentTree = Temp->RightSibling();
CurrentStack->Push(CurrentTree);
}
}
else {
// ... just go down for one step
CurrentTree = CurrentTree->Child(1);
CurrentStack->Push(CurrentTree);
}
}
// PRIVATE TOOLS TO MANAGE CURRENTSTACK
Handle(PCollection_HArbitraryTree)
PCollection_ATPreOrderIterator::RecursiveRemove(
const Handle(PCollection_HArbitraryTree)& ATree)
{
Handle(PCollection_HArbitraryTree) Temp;
CurrentStack->Pop();
if ( CurrentStack->IsEmpty()) {
HasMore = Standard_False;
Temp = ATree; // ... to be returned
}
else {
// ... is there somebody to the right ? if yes, stop removing
// ... if not, go on removing
Temp = ATree->RightSibling();
if (!Temp.IsNull()) {
Temp = ATree; // ... to be returned
}
else {
Temp = CurrentStack->Top();
Temp = RecursiveRemove( Temp);
}
}
return Temp;
}
|
