diff options
author | Jacek Antonelli | 2008-08-15 23:44:46 -0500 |
---|---|---|
committer | Jacek Antonelli | 2008-08-15 23:44:46 -0500 |
commit | 38d6d37f2d982fa959e9e8a4a3f7e1ccfad7b5d4 (patch) | |
tree | adca584755d22ca041a2dbfc35d4eca01f70b32c /linden/indra/llcommon/lldepthstack.h | |
parent | README.txt (diff) | |
download | meta-impy-38d6d37f2d982fa959e9e8a4a3f7e1ccfad7b5d4.zip meta-impy-38d6d37f2d982fa959e9e8a4a3f7e1ccfad7b5d4.tar.gz meta-impy-38d6d37f2d982fa959e9e8a4a3f7e1ccfad7b5d4.tar.bz2 meta-impy-38d6d37f2d982fa959e9e8a4a3f7e1ccfad7b5d4.tar.xz |
Second Life viewer sources 1.13.2.12
Diffstat (limited to 'linden/indra/llcommon/lldepthstack.h')
-rw-r--r-- | linden/indra/llcommon/lldepthstack.h | 100 |
1 files changed, 100 insertions, 0 deletions
diff --git a/linden/indra/llcommon/lldepthstack.h b/linden/indra/llcommon/lldepthstack.h new file mode 100644 index 0000000..0011f30 --- /dev/null +++ b/linden/indra/llcommon/lldepthstack.h | |||
@@ -0,0 +1,100 @@ | |||
1 | /** | ||
2 | * @file lldepthstack.h | ||
3 | * @brief Declaration of the LLDepthStack class | ||
4 | * | ||
5 | * Copyright (c) 2001-2007, Linden Research, Inc. | ||
6 | * | ||
7 | * The source code in this file ("Source Code") is provided by Linden Lab | ||
8 | * to you under the terms of the GNU General Public License, version 2.0 | ||
9 | * ("GPL"), unless you have obtained a separate licensing agreement | ||
10 | * ("Other License"), formally executed by you and Linden Lab. Terms of | ||
11 | * the GPL can be found in doc/GPL-license.txt in this distribution, or | ||
12 | * online at http://secondlife.com/developers/opensource/gplv2 | ||
13 | * | ||
14 | * There are special exceptions to the terms and conditions of the GPL as | ||
15 | * it is applied to this Source Code. View the full text of the exception | ||
16 | * in the file doc/FLOSS-exception.txt in this software distribution, or | ||
17 | * online at http://secondlife.com/developers/opensource/flossexception | ||
18 | * | ||
19 | * By copying, modifying or distributing this software, you acknowledge | ||
20 | * that you have read and understood your obligations described above, | ||
21 | * and agree to abide by those obligations. | ||
22 | * | ||
23 | * ALL LINDEN LAB SOURCE CODE IS PROVIDED "AS IS." LINDEN LAB MAKES NO | ||
24 | * WARRANTIES, EXPRESS, IMPLIED OR OTHERWISE, REGARDING ITS ACCURACY, | ||
25 | * COMPLETENESS OR PERFORMANCE. | ||
26 | */ | ||
27 | |||
28 | #ifndef LL_LLDEPTHSTACK_H | ||
29 | #define LL_LLDEPTHSTACK_H | ||
30 | |||
31 | #include "linked_lists.h" | ||
32 | |||
33 | template <class DATA_TYPE> class LLDepthStack | ||
34 | { | ||
35 | private: | ||
36 | LLLinkedList<DATA_TYPE> mStack; | ||
37 | U32 mCurrentDepth; | ||
38 | U32 mMaxDepth; | ||
39 | |||
40 | public: | ||
41 | LLDepthStack() : mCurrentDepth(0), mMaxDepth(0) {} | ||
42 | ~LLDepthStack() {} | ||
43 | |||
44 | void setDepth(U32 depth) | ||
45 | { | ||
46 | mMaxDepth = depth; | ||
47 | } | ||
48 | |||
49 | U32 getDepth(void) const | ||
50 | { | ||
51 | return mCurrentDepth; | ||
52 | } | ||
53 | |||
54 | void push(DATA_TYPE *data) | ||
55 | { | ||
56 | if (mCurrentDepth < mMaxDepth) | ||
57 | { | ||
58 | mStack.addData(data); | ||
59 | mCurrentDepth++; | ||
60 | } | ||
61 | else | ||
62 | { | ||
63 | // the last item falls off stack and is deleted | ||
64 | mStack.getLastData(); | ||
65 | mStack.deleteCurrentData(); | ||
66 | mStack.addData(data); | ||
67 | } | ||
68 | } | ||
69 | |||
70 | DATA_TYPE *pop() | ||
71 | { | ||
72 | DATA_TYPE *tempp = mStack.getFirstData(); | ||
73 | if (tempp) | ||
74 | { | ||
75 | mStack.removeCurrentData(); | ||
76 | mCurrentDepth--; | ||
77 | } | ||
78 | return tempp; | ||
79 | } | ||
80 | |||
81 | DATA_TYPE *check() | ||
82 | { | ||
83 | DATA_TYPE *tempp = mStack.getFirstData(); | ||
84 | return tempp; | ||
85 | } | ||
86 | |||
87 | void deleteAllData() | ||
88 | { | ||
89 | mCurrentDepth = 0; | ||
90 | mStack.deleteAllData(); | ||
91 | } | ||
92 | |||
93 | void removeAllNodes() | ||
94 | { | ||
95 | mCurrentDepth = 0; | ||
96 | mStack.removeAllNodes(); | ||
97 | } | ||
98 | }; | ||
99 | |||
100 | #endif | ||