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
|
#ifndef _XN_QUEUE_T_H_
#define _XN_QUEUE_T_H_
//---------------------------------------------------------------------------
// Includes
//---------------------------------------------------------------------------
#include <XnListT.h>
//---------------------------------------------------------------------------
// Code
//---------------------------------------------------------------------------
template<class T, class TAlloc = XnLinkedNodeDefaultAllocatorT<T> >
class XnQueueT : protected XnListT<T, TAlloc>
{
public:
typedef XnListT<T, TAlloc> Base;
XnQueueT() : Base() {}
XnQueueT(const XnQueueT& other) : Base()
{
*this = other;
}
XnQueueT& operator=(const XnQueueT& other)
{
Base::operator=(other);
// no other members
return *this;
}
~XnQueueT() {}
using Base::ConstIterator;
using Base::IsEmpty;
XnStatus Push(T const& value)
{
return Base::AddLast(value);
}
XnStatus Pop(T& value)
{
Iterator it = Begin();
if (it == End())
{
return XN_STATUS_IS_EMPTY;
}
value = *it;
return Base::Remove(it);
}
T const& Top() const { return *Begin(); }
T& Top() { return *Begin(); }
using Base::Begin;
using Base::End;
using Base::Size;
};
#endif // _XN_QUEUE_T_H_
|
