blob: 27b335fad5deeee8e85eb40aa40dc792701c2bb4 (
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
|
#include <Standard_OutOfRange.hxx>
#include <Standard_NoSuchObject.hxx>
#include <Standard_NoMoreObject.hxx>
// ----------------------------------------------------------------------
// Copyright: Matra-Datavision 1992
// File: PCollection_ATPostOrderIterator.gxx
// Created: Aug, 13 1992
// Author: Mireille MERCIEN
// ----------------------------------------------------------------------
// Purpose: Permits to iterate through an ArbitraryTree beginning by
// the most left leave and its rightSibling, then upward to
// its parent, ..
// IF theTree is ( A (B (C D E)) F G (H (I J K)))
// THEN it will read ( C D E B F I J K H G A)
// --------
// Create
// --------
PCollection_ATPostOrderIterator::
PCollection_ATPostOrderIterator
(const Handle(PCollection_HArbitraryTree)& ATree)
{
CurrentStack = new PCollection_StackArbitraryTree;
if (ATree.IsNull()) {
HasMore = Standard_False;
}
else {
HasMore = Standard_True;
RecursiveAppend(ATree);
CurrentTree = CurrentStack->Top();
}
}
// --------
// More
// --------
Standard_Boolean PCollection_ATPostOrderIterator::More () const
{
return HasMore;
}
// --------
// Value
// --------
Handle(PCollection_HArbitraryTree)
PCollection_ATPostOrderIterator::Value () const
{
if (!HasMore) Standard_NoSuchObject::Raise();
return CurrentTree;
}
// --------
// Clear
// --------
void PCollection_ATPostOrderIterator::Clear ()
{
CurrentTree.Nullify();
CurrentStack.Nullify();
HasMore = Standard_False;
}
// --------
// Next
// --------
void PCollection_ATPostOrderIterator::Next ()
{
if (!HasMore) Standard_NoMoreObject::Raise();
// ... removes the last tree
CurrentStack->Pop();
if (CurrentStack->IsEmpty()) {
HasMore = Standard_False;
}
else {
// ... is there still someone on the right ?
// ... if yes, go on to the right
Handle(PCollection_HArbitraryTree) Temp = CurrentTree->RightSibling();
if (!Temp.IsNull()) {
RecursiveAppend(Temp);
}
CurrentTree = CurrentStack->Top();
}
}
// PRIVATE TOOLS TO MANAGE CURRENTSTACK
// --------
// --------
void PCollection_ATPostOrderIterator::RecursiveAppend (
const Handle(PCollection_HArbitraryTree)& ATree)
{
CurrentStack->Push(ATree);
// ... is there still some child ?
if ( !ATree->IsLeaf()) {
RecursiveAppend( ATree->Child(1));
}
}
|
