blob: 6e323d3f1966b2e802ef7ba048dc203e723a4095 (
plain)
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
|
#ifndef _XN_CYCLIC_QUEUE_T_H_
#define _XN_CYCLIC_QUEUE_T_H_
//---------------------------------------------------------------------------
// Includes
//---------------------------------------------------------------------------
#include "XnQueueT.h"
//---------------------------------------------------------------------------
// Code
//---------------------------------------------------------------------------
template<class T, XnUInt32 TDefaultMaxDepth, class TAlloc = XnLinkedNodeDefaultAllocatorT<T> >
class XnCyclicQueueT : protected XnQueueT<T, TAlloc>
{
public:
typedef XnQueueT<T, TAlloc> Base;
XnCyclicQueueT(XnUInt32 nMaxDepth = TDefaultMaxDepth) : Base(), m_nMaxDepth(nMaxDepth) {}
XnCyclicQueueT(const XnCyclicQueueT& other) : Base(other)
{
*this = other;
}
XnCyclicQueueT& operator=(const XnCyclicQueueT& other)
{
Base::operator=(other);
m_nMaxDepth = other.m_nMaxDepth;
return *this;
}
~XnCyclicQueueT() {}
using Base::ConstIterator;
using Base::IsEmpty;
using Base::Size;
XnStatus SetMaxSize(XnUInt32 nMaxSize)
{
XnStatus nRetVal = XN_STATUS_OK;
while (Size() > nMaxSize)
{
nRetVal = Remove(this->Begin());
XN_IS_STATUS_OK(nRetVal);
}
m_nMaxDepth = nMaxSize;
return (XN_STATUS_OK);
}
XnStatus Push(T const& value)
{
XnStatus nRetVal = XN_STATUS_OK;
if (Size() == m_nMaxDepth)
{
nRetVal = Remove(this->Begin());
XN_IS_STATUS_OK(nRetVal);
}
nRetVal = Base::Push(value);
XN_IS_STATUS_OK(nRetVal);
return (XN_STATUS_OK);
}
using Base::Pop;
using Base::Top;
using Base::Begin;
using Base::End;
protected:
XnUInt32 m_nMaxDepth;
};
#endif // _XN_CYCLIC_QUEUE_T_H_
|
