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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
|
/* Copyright (C) 2004 Garrett A. Kajmowicz
* This file is part of the uClibc++ Library.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#include <basic_definitions>
#include <deque>
#include <vector>
#include <functional>
#ifndef __HEADER_STD_QUEUE
#define __HEADER_STD_QUEUE 1
#pragma GCC visibility push(default)
extern "C++"
{
namespace std
{
template <class T, class Container = deque<T> > class _UCXXEXPORT queue
{
protected:
Container c;
public:
typedef typename Container::value_type value_type;
typedef typename Container::size_type size_type;
typedef Container container_type;
explicit queue(const Container& a = Container()) : c(a) { }
bool empty() const { return c.empty(); }
size_type size() const { return c.size(); }
value_type& front() { return c.front(); }
const value_type& front() const { return c.front(); }
value_type& back() { return c.back(); }
const value_type& back() const { return c.back(); }
void push(const value_type& x) { c.push_back(x); }
void pop() { c.pop_front(); }
};
template <class T, class Container> _UCXXEXPORT bool
operator==(const queue<T, Container>& x, const queue<T, Container>& y)
{
return (x.c == y.c);
}
template <class T, class Container> _UCXXEXPORT bool
operator< (const queue<T, Container>& x, const queue<T, Container>& y)
{
return (x.c < y.c);
}
template <class T, class Container> _UCXXEXPORT bool
operator!=(const queue<T, Container>& x, const queue<T, Container>& y)
{
return (x.c != y.c);
}
template <class T, class Container> _UCXXEXPORT bool
operator> (const queue<T, Container>& x, const queue<T, Container>& y)
{
return (x.c > y.c);
}
template <class T, class Container> _UCXXEXPORT bool
operator>=(const queue<T, Container>& x, const queue<T, Container>& y)
{
return (x.c >= y.c);
}
template <class T, class Container> _UCXXEXPORT bool
operator<=(const queue<T, Container>& x, const queue<T, Container>& y)
{
return (x.c <= y.c);
}
template <class T,
class Container = vector<T>,
class Compare = less<typename Container::value_type>
> class _UCXXEXPORT priority_queue
{
protected:
Container c;
Compare comp;
public:
typedef typename Container::value_type value_type;
typedef typename Container::size_type size_type;
typedef Container container_type;
explicit priority_queue(const Compare& x = Compare(), const Container& a = Container())
: c(a), comp(x) { make_heap(c.begin(), c.end(), comp) ; }
template <class InputIterator> priority_queue(InputIterator first,
InputIterator last,
const Compare& x = Compare(),
const Container& y= Container())
: c(y), comp(c)
{
c.insert(c.end(), first, last);
make_heap(c.begin(), c.end(), comp);
}
bool empty() const { return c.empty(); }
size_type size() const { return c.size(); }
const value_type& top() const { return c.front(); }
void push(const value_type& x)
{
c.push_back(x);
push_heap(c.begin(), c.end(), comp);
}
void pop()
{
pop_heap(c.begin(), c.end(), comp);
c.pop_back();
}
};
} // namespace
} // extern "C++"
#pragma GCC visibility pop
#endif
|
