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
120
121
122
|
//
// Copyright (C) : Please refer to the COPYRIGHT file distributed
// with this source distribution.
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License
// as published by the Free Software Foundation; either version 2
// of the License, or (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
//
///////////////////////////////////////////////////////////////////////////////
#include "NodeGroup.h"
void NodeGroup::AddChild(Node *iChild)
{
if(NULL == iChild)
return;
_Children.push_back(iChild);
iChild->addRef();
}
int NodeGroup::destroy()
{
/*! Node::destroy makes a release on the object
* and then returns the reference counter.
* If the reference counter is equal to 0,
* that means that nobody else is linking
* this node group and that we can destroy the whole
* underlying tree.
* Else, one or several Node link this node group,
* and we only returns the reference counter
* decremented by Node::destroy();
*/
int refThis = Node::destroy();
// if refThis != 0, we can't destroy the tree
if(0 != refThis)
return refThis;
// If we are here, that means that nobody else
// needs our NodeGroup and we can destroy it.
int refCount = 0;
vector<Node *>::iterator node;
for(node=_Children.begin(); node!=_Children.end(); node++)
{
refCount = (*node)->destroy();
if(0 == refCount)
delete (*node);
}
_Children.clear();
return refThis;
}
void NodeGroup::accept(SceneVisitor& v) {
v.visitNodeGroup(*this);
v.visitNodeGroupBefore(*this);
for(vector<Node *>::iterator node=_Children.begin(), end=_Children.end();
node!=end;
node++)
(*node)->accept(v);
v.visitNodeGroupAfter(*this);
}
void NodeGroup::DetachChildren()
{
vector<Node *>::iterator node;
for(node=_Children.begin(); node!=_Children.end(); node++)
{
(*node)->release();
}
_Children.clear();
}
void NodeGroup::DetachChild(Node *iChild)
{
int found = 0;
vector<Node*>::iterator node;
for(node=_Children.begin(); node!=_Children.end(); node++)
{
if((*node) == iChild)
{
(*node)->release();
_Children.erase(node);
found = 1;
break;
}
}
}
void NodeGroup::RetrieveChildren(vector<Node*>& oNodes){
oNodes = _Children;
}
const BBox<Vec3r>& NodeGroup::UpdateBBox()
{
vector<Node *>::iterator node;
clearBBox();
for(node=_Children.begin(); node!=_Children.end(); node++)
{
AddBBox((*node)->UpdateBBox());
}
return Node::UpdateBBox();
}
|
