blob: a5cfb782784e7d57496c58479af6bdc0ebe3ef44 (
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
|
// Copyright: Matra-Datavision 1992
// Created: Wed May,13 1992
// Created by: Jean-Pierre TIRAULT
// <jpt@topsn1>
// Revised: Wed Oct,21 1992
// By : Mireille MERCIEN
// <mip@sdsun3>
#include <Standard_NoMoreObject.hxx>
#include <Standard_NoSuchObject.hxx>
typedef PCollection_AVLNodeStack Stack;
typedef PCollection_HAVLSearchTree Tree;
typedef Handle(PCollection_HAVLSearchTree) Handle(Tree);
typedef PCollection_AVLNode Node;
typedef Handle(PCollection_AVLNode) Handle(Node);
//-----------------------------------------------------------------------------
PCollection_AVLIterator::
PCollection_AVLIterator ( const Handle(Tree)& aTree)
{
CurrentStack = new Stack; // Create an empty Stack
Handle(Node) Root = aTree->GetRoot(); // Current node = root of tree
if (Root.IsNull()) {
HasMore = False;
}
else {
HasMore = True;
// CURRENTSTACK MANAGEMENT
Append( Root);
}
}
//-----------------------------------------------------------------------------
Boolean PCollection_AVLIterator::More () const
{
return HasMore;
}
//-----------------------------------------------------------------------------
Handle(Node) PCollection_AVLIterator::Value () const
{
if (!HasMore) NoSuchObject::Raise();
return CurrentNode;
}
//-----------------------------------------------------------------------------
void PCollection_AVLIterator::Clear ()
{
CurrentNode.Nullify();
CurrentStack.Nullify();
HasMore = False;
}
//-----------------------------------------------------------------------------
void PCollection_AVLIterator::Next ()
{
if (!HasMore) NoMoreObject::Raise();
Handle(Node) Right = CurrentNode->RightChild();
// WHAT ARE THE FOLLOWING ELEMENTS ?
if ( Right.IsNull()) {
RecursiveRemove(CurrentNode);
// MAYBE IT'S THE END
if (CurrentStack->IsEmpty())
HasMore = False;
else
CurrentNode = CurrentStack->Top();
}
else {
Append (Right);
}
}
// PRIVATE TOOLS TO ITERATE
void PCollection_AVLIterator::Append ( const Handle(Node)& Root)
{
RecursiveAppend( Root);
CurrentNode = CurrentStack->Top();
}
void PCollection_AVLIterator::RecursiveAppend(const Handle(Node)& ANode)
{
if (!ANode.IsNull()) {
CurrentStack->Push(ANode);
Handle(Node) Left = ANode->LeftChild();
RecursiveAppend( Left);
}
}
void PCollection_AVLIterator::RecursiveRemove(const Handle(Node)& theNode)
{
CurrentStack->Pop();
if (CurrentStack->IsEmpty()) return;
Handle(Node) NewNode = CurrentStack->Top();
if (theNode == NewNode->RightChild()) {
RecursiveRemove(NewNode);
}
}
|
