|
sl@0
|
1 |
// (C) Copyright Jeremy Siek 2004
|
|
sl@0
|
2 |
// Distributed under the Boost Software License, Version 1.0. (See
|
|
sl@0
|
3 |
// accompanying file LICENSE_1_0.txt or copy at
|
|
sl@0
|
4 |
// http://www.boost.org/LICENSE_1_0.txt)
|
|
sl@0
|
5 |
|
|
sl@0
|
6 |
#ifndef BOOST_QUEUE_HPP
|
|
sl@0
|
7 |
#define BOOST_QUEUE_HPP
|
|
sl@0
|
8 |
|
|
sl@0
|
9 |
#include <deque>
|
|
sl@0
|
10 |
#include <algorithm>
|
|
sl@0
|
11 |
|
|
sl@0
|
12 |
namespace boost {
|
|
sl@0
|
13 |
|
|
sl@0
|
14 |
template <class _Tp,
|
|
sl@0
|
15 |
class _Sequence = std::deque<_Tp> >
|
|
sl@0
|
16 |
class queue;
|
|
sl@0
|
17 |
|
|
sl@0
|
18 |
template <class _Tp, class _Seq>
|
|
sl@0
|
19 |
inline bool operator==(const queue<_Tp, _Seq>&, const queue<_Tp, _Seq>&);
|
|
sl@0
|
20 |
|
|
sl@0
|
21 |
template <class _Tp, class _Seq>
|
|
sl@0
|
22 |
inline bool operator<(const queue<_Tp, _Seq>&, const queue<_Tp, _Seq>&);
|
|
sl@0
|
23 |
|
|
sl@0
|
24 |
|
|
sl@0
|
25 |
template <class _Tp, class _Sequence>
|
|
sl@0
|
26 |
class queue {
|
|
sl@0
|
27 |
|
|
sl@0
|
28 |
#ifndef BOOST_NO_MEMBER_TEMPLATE_FRIENDS
|
|
sl@0
|
29 |
template <class _Tp1, class _Seq1>
|
|
sl@0
|
30 |
friend bool operator== (const queue<_Tp1, _Seq1>&,
|
|
sl@0
|
31 |
const queue<_Tp1, _Seq1>&);
|
|
sl@0
|
32 |
template <class _Tp1, class _Seq1>
|
|
sl@0
|
33 |
friend bool operator< (const queue<_Tp1, _Seq1>&,
|
|
sl@0
|
34 |
const queue<_Tp1, _Seq1>&);
|
|
sl@0
|
35 |
#endif
|
|
sl@0
|
36 |
public:
|
|
sl@0
|
37 |
typedef typename _Sequence::value_type value_type;
|
|
sl@0
|
38 |
typedef typename _Sequence::size_type size_type;
|
|
sl@0
|
39 |
typedef _Sequence container_type;
|
|
sl@0
|
40 |
|
|
sl@0
|
41 |
typedef typename _Sequence::reference reference;
|
|
sl@0
|
42 |
typedef typename _Sequence::const_reference const_reference;
|
|
sl@0
|
43 |
#ifndef BOOST_NO_MEMBER_TEMPLATE_FRIENDS
|
|
sl@0
|
44 |
protected:
|
|
sl@0
|
45 |
#endif
|
|
sl@0
|
46 |
_Sequence c;
|
|
sl@0
|
47 |
public:
|
|
sl@0
|
48 |
queue() : c() {}
|
|
sl@0
|
49 |
explicit queue(const _Sequence& __c) : c(__c) {}
|
|
sl@0
|
50 |
|
|
sl@0
|
51 |
bool empty() const { return c.empty(); }
|
|
sl@0
|
52 |
size_type size() const { return c.size(); }
|
|
sl@0
|
53 |
reference front() { return c.front(); }
|
|
sl@0
|
54 |
const_reference front() const { return c.front(); }
|
|
sl@0
|
55 |
reference top() { return c.front(); }
|
|
sl@0
|
56 |
const_reference top() const { return c.front(); }
|
|
sl@0
|
57 |
reference back() { return c.back(); }
|
|
sl@0
|
58 |
const_reference back() const { return c.back(); }
|
|
sl@0
|
59 |
void push(const value_type& __x) { c.push_back(__x); }
|
|
sl@0
|
60 |
void pop() { c.pop_front(); }
|
|
sl@0
|
61 |
|
|
sl@0
|
62 |
void swap(queue& other)
|
|
sl@0
|
63 |
{
|
|
sl@0
|
64 |
using std::swap;
|
|
sl@0
|
65 |
swap(c, other.c);
|
|
sl@0
|
66 |
}
|
|
sl@0
|
67 |
};
|
|
sl@0
|
68 |
|
|
sl@0
|
69 |
template <class _Tp, class _Sequence>
|
|
sl@0
|
70 |
bool
|
|
sl@0
|
71 |
operator==(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y)
|
|
sl@0
|
72 |
{
|
|
sl@0
|
73 |
return __x.c == __y.c;
|
|
sl@0
|
74 |
}
|
|
sl@0
|
75 |
|
|
sl@0
|
76 |
template <class _Tp, class _Sequence>
|
|
sl@0
|
77 |
bool
|
|
sl@0
|
78 |
operator<(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y)
|
|
sl@0
|
79 |
{
|
|
sl@0
|
80 |
return __x.c < __y.c;
|
|
sl@0
|
81 |
}
|
|
sl@0
|
82 |
|
|
sl@0
|
83 |
template <class _Tp, class _Sequence>
|
|
sl@0
|
84 |
bool
|
|
sl@0
|
85 |
operator!=(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y)
|
|
sl@0
|
86 |
{
|
|
sl@0
|
87 |
return !(__x == __y);
|
|
sl@0
|
88 |
}
|
|
sl@0
|
89 |
|
|
sl@0
|
90 |
template <class _Tp, class _Sequence>
|
|
sl@0
|
91 |
bool
|
|
sl@0
|
92 |
operator>(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y)
|
|
sl@0
|
93 |
{
|
|
sl@0
|
94 |
return __y < __x;
|
|
sl@0
|
95 |
}
|
|
sl@0
|
96 |
|
|
sl@0
|
97 |
template <class _Tp, class _Sequence>
|
|
sl@0
|
98 |
bool
|
|
sl@0
|
99 |
operator<=(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y)
|
|
sl@0
|
100 |
{
|
|
sl@0
|
101 |
return !(__y < __x);
|
|
sl@0
|
102 |
}
|
|
sl@0
|
103 |
|
|
sl@0
|
104 |
template <class _Tp, class _Sequence>
|
|
sl@0
|
105 |
bool
|
|
sl@0
|
106 |
operator>=(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y)
|
|
sl@0
|
107 |
{
|
|
sl@0
|
108 |
return !(__x < __y);
|
|
sl@0
|
109 |
}
|
|
sl@0
|
110 |
|
|
sl@0
|
111 |
template <class _Tp, class _Sequence>
|
|
sl@0
|
112 |
inline void
|
|
sl@0
|
113 |
swap(queue<_Tp, _Sequence>& __x, queue<_Tp, _Sequence>& __y)
|
|
sl@0
|
114 |
{ __x.swap(__y); }
|
|
sl@0
|
115 |
|
|
sl@0
|
116 |
} /* namespace boost */
|
|
sl@0
|
117 |
|
|
sl@0
|
118 |
#endif /* BOOST_QUEUE_HPP */
|