103 lines
2.3 KiB
C++
103 lines
2.3 KiB
C++
/**
|
|
* @file lldepthstack.h
|
|
* @brief Declaration of the LLDepthStack class
|
|
*
|
|
* $LicenseInfo:firstyear=2001&license=viewergpl$
|
|
*
|
|
* Copyright (c) 2001-2009, 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://secondlifegrid.net/programs/open_source/licensing/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://secondlifegrid.net/programs/open_source/licensing/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_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)
|
|
{}
|
|
|
|
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 removeAllNodes()
|
|
{
|
|
mCurrentDepth = 0;
|
|
mStack.clear();
|
|
}
|
|
};
|
|
|
|
#endif
|