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
|
/**
* @file lldepthstack.h
* @brief Declaration of the LLDepthStack class
*
* $LicenseInfo:firstyear=2001&license=viewerlgpl$
* Second Life Viewer Source Code
* Copyright (C) 2010, Linden Research, Inc.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation;
* version 2.1 of the License only.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*
* Linden Research, Inc., 945 Battery Street, San Francisco, CA 94111 USA
* $/LicenseInfo$
*/
#ifndef LL_LLDEPTHSTACK_H
#define LL_LLDEPTHSTACK_H
#include "llstl.h"
template <class DATA_TYPE> class LLDepthStack
{
private:
std::deque<DATA_TYPE*> mStack;
U32 mCurrentDepth;
U32 mMaxDepth;
public:
LLDepthStack()
: mCurrentDepth(0), mMaxDepth(0)
{}
~LLDepthStack() {}
void setDepth(U32 depth)
{
mMaxDepth = depth;
}
U32 getDepth(void) const
{
return mCurrentDepth;
}
void push(DATA_TYPE *data)
{
if (mCurrentDepth < mMaxDepth)
{
mStack.push_back(data);
mCurrentDepth++;
}
else
{
// the last item falls off stack and is deleted
if (!mStack.empty())
{
mStack.pop_front();
}
mStack.push_back(data);
}
}
DATA_TYPE *pop()
{
DATA_TYPE *tempp = NULL;
if (!mStack.empty())
{
tempp = mStack.back();
mStack.pop_back();
mCurrentDepth--;
}
return tempp;
}
DATA_TYPE *check()
{
return mStack.empty() ? NULL : mStack.back();
}
void deleteAllData()
{
mCurrentDepth = 0;
std::for_each(mStack.begin(), mStack.end(), DeletePointer());
mStack.clear();
}
void removeAllNodes()
{
mCurrentDepth = 0;
mStack.clear();
}
};
#endif
|
