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
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
|
/**
* @file lltreenode.h
*
* $LicenseInfo:firstyear=2005&license=viewergpl$
*
* Copyright (c) 2005-2008, Linden Research, Inc.
*
* Second Life Viewer Source Code
* The source code in this file ("Source Code") is provided by Linden Lab
* to you under the terms of the GNU General Public License, version 2.0
* ("GPL"), unless you have obtained a separate licensing agreement
* ("Other License"), formally executed by you and Linden Lab. Terms of
* the GPL can be found in doc/GPL-license.txt in this distribution, or
* online at http://secondlife.com/developers/opensource/gplv2
*
* There are special exceptions to the terms and conditions of the GPL as
* it is applied to this Source Code. View the full text of the exception
* in the file doc/FLOSS-exception.txt in this software distribution, or
* online at http://secondlife.com/developers/opensource/flossexception
*
* By copying, modifying or distributing this software, you acknowledge
* that you have read and understood your obligations described above,
* and agree to abide by those obligations.
*
* ALL LINDEN LAB SOURCE CODE IS PROVIDED "AS IS." LINDEN LAB MAKES NO
* WARRANTIES, EXPRESS, IMPLIED OR OTHERWISE, REGARDING ITS ACCURACY,
* COMPLETENESS OR PERFORMANCE.
* $/LicenseInfo$
*/
#ifndef LL_LLTREENODE_H
#define LL_LLTREENODE_H
#include "stdtypes.h"
#include "xform.h"
#include <vector>
template <class T> class LLTreeNode;
template <class T> class LLTreeTraveler;
template <class T> class LLTreeListener;
template <class T>
class LLTreeState
{
public:
LLTreeState(LLTreeNode<T>* node) { setNode(node); }
virtual ~LLTreeState() { };
virtual bool insert(T* data) = 0;
virtual bool remove(T* data) = 0;
virtual void setNode(LLTreeNode<T>* node);
virtual const LLTreeNode<T>* getNode() const { return mNode; }
virtual LLTreeNode<T>* getNode() { return mNode; }
virtual void accept(LLTreeTraveler<T>* traveler) const = 0;
virtual LLTreeListener<T>* getListener(U32 index) const;
private:
LLTreeNode<T>* mNode;
};
template <class T>
class LLTreeListener: public LLRefCount
{
public:
virtual void handleInsertion(const LLTreeNode<T>* node, T* data) = 0;
virtual void handleRemoval(const LLTreeNode<T>* node, T* data) = 0;
virtual void handleDestruction(const LLTreeNode<T>* node) = 0;
virtual void handleStateChange(const LLTreeNode<T>* node) = 0;
};
template <class T>
class LLTreeNode
{
public:
LLTreeNode(LLTreeState<T>* state) { setState(state); }
virtual ~LLTreeNode();
LLTreeState<T>* getState() { return mState; }
const LLTreeState<T>* getState() const { return mState; }
void setState(LLTreeState<T>* state);
void insert(T* data);
bool remove(T* data);
void notifyRemoval(T* data);
inline U32 getListenerCount() { return mListeners.size(); }
inline LLTreeListener<T>* getListener(U32 index) const { return mListeners[index]; }
inline void addListener(LLTreeListener<T>* listener) { mListeners.push_back(listener); }
inline void removeListener(U32 index) { mListeners.erase(mListeners.begin()+index); }
protected:
void destroyListeners()
{
for (U32 i = 0; i < mListeners.size(); i++)
{
mListeners[i]->handleDestruction(this);
}
mListeners.clear();
}
LLTreeState<T>* mState;
public:
std::vector<LLPointer<LLTreeListener<T> > > mListeners;
};
template <class T>
class LLTreeTraveler
{
public:
virtual ~LLTreeTraveler() { };
virtual void traverse(const LLTreeNode<T>* node) = 0;
virtual void visit(const LLTreeState<T>* state) = 0;
};
template <class T>
LLTreeNode<T>::~LLTreeNode()
{
destroyListeners();
};
template <class T>
void LLTreeNode<T>::insert(T* data)
{
if (mState->insert(data))
{
for (U32 i = 0; i < mListeners.size(); i++)
{
mListeners[i]->handleInsertion(this, data);
}
}
};
template <class T>
bool LLTreeNode<T>::remove(T* data)
{
if (mState->remove(data))
{
return true;
}
return false;
};
template <class T>
void LLTreeNode<T>::notifyRemoval(T* data)
{
for (U32 i = 0; i < mListeners.size(); i++)
{
mListeners[i]->handleRemoval(this, data);
}
}
template <class T>
void LLTreeNode<T>::setState(LLTreeState<T>* state)
{
mState = state;
if (state)
{
if (state->getNode() != this)
{
state->setNode(this);
}
for (U32 i = 0; i < mListeners.size(); i++)
{
mListeners[i]->handleStateChange(this);
}
}
};
template <class T>
void LLTreeState<T>::setNode(LLTreeNode<T>* node)
{
mNode = node;
if (node && node->getState() != this)
{
node->setState(this);
}
};
template <class T>
LLTreeListener<T>* LLTreeState<T>::getListener(U32 index) const
{
return mNode->getListener(index);
}
#endif
|
