Linux vps-61133.fhnet.fr 4.9.0-19-amd64 #1 SMP Debian 4.9.320-2 (2022-06-30) x86_64
Apache/2.4.25 (Debian)
Server IP : 93.113.207.21 & Your IP : 216.73.216.119
Domains :
Cant Read [ /etc/named.conf ]
User : www-data
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
usr /
include /
c++ /
6 /
bits /
Delete
Unzip
Name
Size
Permission
Date
Action
algorithmfwd.h
21.03
KB
-rwxrwxrwx
2018-02-14 17:53
alloc_traits.h
19.13
KB
-rwxrwxrwx
2018-02-14 17:53
allocated_ptr.h
3.42
KB
-rwxrwxrwx
2018-02-14 17:53
allocator.h
6.76
KB
-rwxrwxrwx
2018-02-14 17:53
atomic_base.h
23.41
KB
-rwxrwxrwx
2018-02-14 17:53
atomic_futex.h
9.35
KB
-rwxrwxrwx
2018-02-14 17:53
atomic_lockfree_defines.h
2.2
KB
-rwxrwxrwx
2018-02-14 17:53
basic_ios.h
15.7
KB
-rwxrwxrwx
2018-02-14 17:53
basic_ios.tcc
5.89
KB
-rwxrwxrwx
2018-02-14 17:53
basic_string.h
203.81
KB
-rwxrwxrwx
2018-02-14 17:53
basic_string.tcc
50.58
KB
-rwxrwxrwx
2018-02-14 17:53
boost_concept_check.h
26.41
KB
-rwxrwxrwx
2018-02-14 17:53
c++0x_warning.h
1.44
KB
-rwxrwxrwx
2018-02-14 17:53
c++14_warning.h
1.48
KB
-rwxrwxrwx
2018-02-14 17:53
char_traits.h
17.56
KB
-rwxrwxrwx
2018-02-14 17:53
codecvt.h
20.8
KB
-rwxrwxrwx
2018-02-14 17:53
concept_check.h
3.34
KB
-rwxrwxrwx
2018-02-14 17:53
cpp_type_traits.h
9.37
KB
-rwxrwxrwx
2018-02-14 17:53
cxxabi_forced.h
1.77
KB
-rwxrwxrwx
2018-02-14 17:53
deque.tcc
32.89
KB
-rwxrwxrwx
2018-02-14 17:53
enable_special_members.h
10.87
KB
-rwxrwxrwx
2018-02-14 17:53
exception_defines.h
1.61
KB
-rwxrwxrwx
2018-02-14 17:53
exception_ptr.h
5.6
KB
-rwxrwxrwx
2018-02-14 17:53
forward_list.h
47.46
KB
-rwxrwxrwx
2018-02-14 17:53
forward_list.tcc
14.74
KB
-rwxrwxrwx
2018-02-14 17:53
fstream.tcc
32.1
KB
-rwxrwxrwx
2018-02-14 17:53
functexcept.h
3.18
KB
-rwxrwxrwx
2018-02-14 17:53
functional_hash.h
7.49
KB
-rwxrwxrwx
2018-02-14 17:53
gslice.h
5.39
KB
-rwxrwxrwx
2018-02-14 17:53
gslice_array.h
7.59
KB
-rwxrwxrwx
2018-02-14 17:53
hash_bytes.h
2.1
KB
-rwxrwxrwx
2018-02-14 17:53
hashtable.h
67.52
KB
-rwxrwxrwx
2018-02-14 17:53
hashtable_policy.h
62.54
KB
-rwxrwxrwx
2018-02-14 17:53
indirect_array.h
7.68
KB
-rwxrwxrwx
2018-02-14 17:53
ios_base.h
30.22
KB
-rwxrwxrwx
2018-02-14 17:53
istream.tcc
30.21
KB
-rwxrwxrwx
2018-02-14 17:53
list.tcc
15.1
KB
-rwxrwxrwx
2018-02-14 17:53
locale_classes.h
24.31
KB
-rwxrwxrwx
2018-02-14 17:53
locale_classes.tcc
8.18
KB
-rwxrwxrwx
2018-02-14 17:53
locale_conv.h
15.69
KB
-rwxrwxrwx
2018-02-14 17:53
locale_facets.h
89.93
KB
-rwxrwxrwx
2018-02-14 17:53
locale_facets.tcc
38.64
KB
-rwxrwxrwx
2018-02-14 17:53
locale_facets_nonio.h
67.33
KB
-rwxrwxrwx
2018-02-14 17:53
locale_facets_nonio.tcc
44.08
KB
-rwxrwxrwx
2018-02-14 17:53
localefwd.h
5.51
KB
-rwxrwxrwx
2018-02-14 17:53
mask_array.h
7.42
KB
-rwxrwxrwx
2018-02-14 17:53
memoryfwd.h
2.36
KB
-rwxrwxrwx
2018-02-14 17:53
move.h
6.19
KB
-rwxrwxrwx
2018-02-14 17:53
nested_exception.h
4.82
KB
-rwxrwxrwx
2018-02-14 17:53
ostream.tcc
12.03
KB
-rwxrwxrwx
2018-02-14 17:53
ostream_insert.h
3.91
KB
-rwxrwxrwx
2018-02-14 17:53
parse_numbers.h
7.58
KB
-rwxrwxrwx
2018-02-14 17:53
postypes.h
8.02
KB
-rwxrwxrwx
2018-02-14 17:53
predefined_ops.h
7.78
KB
-rwxrwxrwx
2018-02-14 17:53
ptr_traits.h
4.75
KB
-rwxrwxrwx
2018-02-14 17:53
quoted_string.h
4.47
KB
-rwxrwxrwx
2018-02-14 17:53
random.h
169.29
KB
-rwxrwxrwx
2018-02-14 17:53
random.tcc
103.07
KB
-rwxrwxrwx
2018-02-14 17:53
range_access.h
9.32
KB
-rwxrwxrwx
2018-02-14 17:53
regex.h
94.62
KB
-rwxrwxrwx
2018-02-14 17:53
regex.tcc
16.09
KB
-rwxrwxrwx
2018-02-14 17:53
regex_automaton.h
10.43
KB
-rwxrwxrwx
2018-02-14 17:53
regex_automaton.tcc
7.65
KB
-rwxrwxrwx
2018-02-14 17:53
regex_compiler.h
14.42
KB
-rwxrwxrwx
2018-02-14 17:53
regex_compiler.tcc
17.97
KB
-rwxrwxrwx
2018-02-14 17:53
regex_constants.h
13.93
KB
-rwxrwxrwx
2018-02-14 17:53
regex_error.h
4.85
KB
-rwxrwxrwx
2018-02-14 17:53
regex_executor.h
6.61
KB
-rwxrwxrwx
2018-02-14 17:53
regex_executor.tcc
13.9
KB
-rwxrwxrwx
2018-02-14 17:53
regex_scanner.h
6.88
KB
-rwxrwxrwx
2018-02-14 17:53
regex_scanner.tcc
14.6
KB
-rwxrwxrwx
2018-02-14 17:53
shared_ptr.h
19.78
KB
-rwxrwxrwx
2018-02-14 17:53
shared_ptr_atomic.h
9.54
KB
-rwxrwxrwx
2018-02-14 17:53
shared_ptr_base.h
44.6
KB
-rwxrwxrwx
2018-02-14 17:53
slice_array.h
9.13
KB
-rwxrwxrwx
2018-02-14 17:53
specfun.h
44
KB
-rwxrwxrwx
2018-02-14 17:53
sstream.tcc
9.27
KB
-rwxrwxrwx
2018-02-14 17:53
std_mutex.h
9
KB
-rwxrwxrwx
2018-02-14 17:53
stl_algo.h
200.43
KB
-rwxrwxrwx
2018-02-14 17:53
stl_algobase.h
49.22
KB
-rwxrwxrwx
2018-02-14 17:53
stl_bvector.h
32.69
KB
-rwxrwxrwx
2018-02-14 17:53
stl_construct.h
5.05
KB
-rwxrwxrwx
2018-02-14 17:53
stl_deque.h
76.16
KB
-rwxrwxrwx
2018-02-14 17:53
stl_function.h
32.5
KB
-rwxrwxrwx
2018-02-14 17:53
stl_heap.h
18.75
KB
-rwxrwxrwx
2018-02-14 17:53
stl_iterator.h
39.39
KB
-rwxrwxrwx
2018-02-14 17:53
stl_iterator_base_funcs.h
7.69
KB
-rwxrwxrwx
2018-02-14 17:53
stl_iterator_base_types.h
8.45
KB
-rwxrwxrwx
2018-02-14 17:53
stl_list.h
64.03
KB
-rwxrwxrwx
2018-02-14 17:53
stl_map.h
49.45
KB
-rwxrwxrwx
2018-02-14 17:53
stl_multimap.h
37.09
KB
-rwxrwxrwx
2018-02-14 17:53
stl_multiset.h
31.18
KB
-rwxrwxrwx
2018-02-14 17:53
stl_numeric.h
13.51
KB
-rwxrwxrwx
2018-02-14 17:53
stl_pair.h
17.18
KB
-rwxrwxrwx
2018-02-14 17:53
stl_queue.h
20.26
KB
-rwxrwxrwx
2018-02-14 17:53
stl_raw_storage_iter.h
3.74
KB
-rwxrwxrwx
2018-02-14 17:53
stl_relops.h
4.49
KB
-rwxrwxrwx
2018-02-14 17:53
stl_set.h
31.43
KB
-rwxrwxrwx
2018-02-14 17:53
stl_stack.h
10.56
KB
-rwxrwxrwx
2018-02-14 17:53
stl_tempbuf.h
8.15
KB
-rwxrwxrwx
2018-02-14 17:53
stl_tree.h
67.86
KB
-rwxrwxrwx
2018-02-14 17:53
stl_uninitialized.h
21.38
KB
-rwxrwxrwx
2018-02-14 17:53
stl_vector.h
52.4
KB
-rwxrwxrwx
2018-02-14 17:53
stream_iterator.h
6.44
KB
-rwxrwxrwx
2018-02-14 17:53
streambuf.tcc
4.81
KB
-rwxrwxrwx
2018-02-14 17:53
streambuf_iterator.h
12.33
KB
-rwxrwxrwx
2018-02-14 17:53
stringfwd.h
2.55
KB
-rwxrwxrwx
2018-02-14 17:53
uniform_int_dist.h
9.73
KB
-rwxrwxrwx
2018-02-14 17:53
unique_ptr.h
24.36
KB
-rwxrwxrwx
2018-02-14 17:53
unordered_map.h
61.39
KB
-rwxrwxrwx
2018-02-14 17:53
unordered_set.h
47.59
KB
-rwxrwxrwx
2018-02-14 17:53
uses_allocator.h
3.68
KB
-rwxrwxrwx
2018-02-14 17:53
valarray_after.h
22.12
KB
-rwxrwxrwx
2018-02-14 17:53
valarray_array.h
21.23
KB
-rwxrwxrwx
2018-02-14 17:53
valarray_array.tcc
7.08
KB
-rwxrwxrwx
2018-02-14 17:53
valarray_before.h
18.08
KB
-rwxrwxrwx
2018-02-14 17:53
vector.tcc
26.42
KB
-rwxrwxrwx
2018-02-14 17:53
Save
Rename
// Queue implementation -*- C++ -*- // Copyright (C) 2001-2016 Free Software Foundation, Inc. // // This file is part of the GNU ISO C++ Library. This library is free // software; you can redistribute it and/or modify it under the // terms of the GNU General Public License as published by the // Free Software Foundation; either version 3, 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 General Public License for more details. // Under Section 7 of GPL version 3, you are granted additional // permissions described in the GCC Runtime Library Exception, version // 3.1, as published by the Free Software Foundation. // You should have received a copy of the GNU General Public License and // a copy of the GCC Runtime Library Exception along with this program; // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see // <http://www.gnu.org/licenses/>. /* * * Copyright (c) 1994 * Hewlett-Packard Company * * Permission to use, copy, modify, distribute and sell this software * and its documentation for any purpose is hereby granted without fee, * provided that the above copyright notice appear in all copies and * that both that copyright notice and this permission notice appear * in supporting documentation. Hewlett-Packard Company makes no * representations about the suitability of this software for any * purpose. It is provided "as is" without express or implied warranty. * * * Copyright (c) 1996,1997 * Silicon Graphics Computer Systems, Inc. * * Permission to use, copy, modify, distribute and sell this software * and its documentation for any purpose is hereby granted without fee, * provided that the above copyright notice appear in all copies and * that both that copyright notice and this permission notice appear * in supporting documentation. Silicon Graphics makes no * representations about the suitability of this software for any * purpose. It is provided "as is" without express or implied warranty. */ /** @file bits/stl_queue.h * This is an internal header file, included by other library headers. * Do not attempt to use it directly. @headername{queue} */ #ifndef _STL_QUEUE_H #define _STL_QUEUE_H 1 #include <bits/concept_check.h> #include <debug/debug.h> #if __cplusplus >= 201103L # include <bits/uses_allocator.h> #endif namespace std _GLIBCXX_VISIBILITY(default) { _GLIBCXX_BEGIN_NAMESPACE_VERSION /** * @brief A standard container giving FIFO behavior. * * @ingroup sequences * * @tparam _Tp Type of element. * @tparam _Sequence Type of underlying sequence, defaults to deque<_Tp>. * * Meets many of the requirements of a * <a href="tables.html#65">container</a>, * but does not define anything to do with iterators. Very few of the * other standard container interfaces are defined. * * This is not a true container, but an @e adaptor. It holds another * container, and provides a wrapper interface to that container. The * wrapper is what enforces strict first-in-first-out %queue behavior. * * The second template parameter defines the type of the underlying * sequence/container. It defaults to std::deque, but it can be any type * that supports @c front, @c back, @c push_back, and @c pop_front, * such as std::list or an appropriate user-defined type. * * Members not found in @a normal containers are @c container_type, * which is a typedef for the second Sequence parameter, and @c push and * @c pop, which are standard %queue/FIFO operations. */ template<typename _Tp, typename _Sequence = deque<_Tp> > class queue { // concept requirements typedef typename _Sequence::value_type _Sequence_value_type; __glibcxx_class_requires(_Tp, _SGIAssignableConcept) __glibcxx_class_requires(_Sequence, _FrontInsertionSequenceConcept) __glibcxx_class_requires(_Sequence, _BackInsertionSequenceConcept) __glibcxx_class_requires2(_Tp, _Sequence_value_type, _SameTypeConcept) template<typename _Tp1, typename _Seq1> friend bool operator==(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&); template<typename _Tp1, typename _Seq1> friend bool operator<(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&); #if __cplusplus >= 201103L template<typename _Alloc> using _Uses = typename enable_if<uses_allocator<_Sequence, _Alloc>::value>::type; #endif public: typedef typename _Sequence::value_type value_type; typedef typename _Sequence::reference reference; typedef typename _Sequence::const_reference const_reference; typedef typename _Sequence::size_type size_type; typedef _Sequence container_type; protected: /** * 'c' is the underlying container. Maintainers wondering why * this isn't uglified as per style guidelines should note that * this name is specified in the standard, [23.2.3.1]. (Why? * Presumably for the same reason that it's protected instead * of private: to allow derivation. But none of the other * containers allow for derivation. Odd.) */ _Sequence c; public: /** * @brief Default constructor creates no elements. */ #if __cplusplus < 201103L explicit queue(const _Sequence& __c = _Sequence()) : c(__c) { } #else explicit queue(const _Sequence& __c) : c(__c) { } explicit queue(_Sequence&& __c = _Sequence()) : c(std::move(__c)) { } template<typename _Alloc, typename _Requires = _Uses<_Alloc>> explicit queue(const _Alloc& __a) : c(__a) { } template<typename _Alloc, typename _Requires = _Uses<_Alloc>> queue(const _Sequence& __c, const _Alloc& __a) : c(__c, __a) { } template<typename _Alloc, typename _Requires = _Uses<_Alloc>> queue(_Sequence&& __c, const _Alloc& __a) : c(std::move(__c), __a) { } template<typename _Alloc, typename _Requires = _Uses<_Alloc>> queue(const queue& __q, const _Alloc& __a) : c(__q.c, __a) { } template<typename _Alloc, typename _Requires = _Uses<_Alloc>> queue(queue&& __q, const _Alloc& __a) : c(std::move(__q.c), __a) { } #endif /** * Returns true if the %queue is empty. */ bool empty() const { return c.empty(); } /** Returns the number of elements in the %queue. */ size_type size() const { return c.size(); } /** * Returns a read/write reference to the data at the first * element of the %queue. */ reference front() { __glibcxx_requires_nonempty(); return c.front(); } /** * Returns a read-only (constant) reference to the data at the first * element of the %queue. */ const_reference front() const { __glibcxx_requires_nonempty(); return c.front(); } /** * Returns a read/write reference to the data at the last * element of the %queue. */ reference back() { __glibcxx_requires_nonempty(); return c.back(); } /** * Returns a read-only (constant) reference to the data at the last * element of the %queue. */ const_reference back() const { __glibcxx_requires_nonempty(); return c.back(); } /** * @brief Add data to the end of the %queue. * @param __x Data to be added. * * This is a typical %queue operation. The function creates an * element at the end of the %queue and assigns the given data * to it. The time complexity of the operation depends on the * underlying sequence. */ void push(const value_type& __x) { c.push_back(__x); } #if __cplusplus >= 201103L void push(value_type&& __x) { c.push_back(std::move(__x)); } template<typename... _Args> void emplace(_Args&&... __args) { c.emplace_back(std::forward<_Args>(__args)...); } #endif /** * @brief Removes first element. * * This is a typical %queue operation. It shrinks the %queue by one. * The time complexity of the operation depends on the underlying * sequence. * * Note that no data is returned, and if the first element's * data is needed, it should be retrieved before pop() is * called. */ void pop() { __glibcxx_requires_nonempty(); c.pop_front(); } #if __cplusplus >= 201103L void swap(queue& __q) noexcept(__is_nothrow_swappable<_Tp>::value) { using std::swap; swap(c, __q.c); } #endif }; /** * @brief Queue equality comparison. * @param __x A %queue. * @param __y A %queue of the same type as @a __x. * @return True iff the size and elements of the queues are equal. * * This is an equivalence relation. Complexity and semantics depend on the * underlying sequence type, but the expected rules are: this relation is * linear in the size of the sequences, and queues are considered equivalent * if their sequences compare equal. */ template<typename _Tp, typename _Seq> inline bool operator==(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) { return __x.c == __y.c; } /** * @brief Queue ordering relation. * @param __x A %queue. * @param __y A %queue of the same type as @a x. * @return True iff @a __x is lexicographically less than @a __y. * * This is an total ordering relation. Complexity and semantics * depend on the underlying sequence type, but the expected rules * are: this relation is linear in the size of the sequences, the * elements must be comparable with @c <, and * std::lexicographical_compare() is usually used to make the * determination. */ template<typename _Tp, typename _Seq> inline bool operator<(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) { return __x.c < __y.c; } /// Based on operator== template<typename _Tp, typename _Seq> inline bool operator!=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) { return !(__x == __y); } /// Based on operator< template<typename _Tp, typename _Seq> inline bool operator>(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) { return __y < __x; } /// Based on operator< template<typename _Tp, typename _Seq> inline bool operator<=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) { return !(__y < __x); } /// Based on operator< template<typename _Tp, typename _Seq> inline bool operator>=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) { return !(__x < __y); } #if __cplusplus >= 201103L template<typename _Tp, typename _Seq> inline void swap(queue<_Tp, _Seq>& __x, queue<_Tp, _Seq>& __y) noexcept(noexcept(__x.swap(__y))) { __x.swap(__y); } template<typename _Tp, typename _Seq, typename _Alloc> struct uses_allocator<queue<_Tp, _Seq>, _Alloc> : public uses_allocator<_Seq, _Alloc>::type { }; #endif /** * @brief A standard container automatically sorting its contents. * * @ingroup sequences * * @tparam _Tp Type of element. * @tparam _Sequence Type of underlying sequence, defaults to vector<_Tp>. * @tparam _Compare Comparison function object type, defaults to * less<_Sequence::value_type>. * * This is not a true container, but an @e adaptor. It holds * another container, and provides a wrapper interface to that * container. The wrapper is what enforces priority-based sorting * and %queue behavior. Very few of the standard container/sequence * interface requirements are met (e.g., iterators). * * The second template parameter defines the type of the underlying * sequence/container. It defaults to std::vector, but it can be * any type that supports @c front(), @c push_back, @c pop_back, * and random-access iterators, such as std::deque or an * appropriate user-defined type. * * The third template parameter supplies the means of making * priority comparisons. It defaults to @c less<value_type> but * can be anything defining a strict weak ordering. * * Members not found in @a normal containers are @c container_type, * which is a typedef for the second Sequence parameter, and @c * push, @c pop, and @c top, which are standard %queue operations. * * @note No equality/comparison operators are provided for * %priority_queue. * * @note Sorting of the elements takes place as they are added to, * and removed from, the %priority_queue using the * %priority_queue's member functions. If you access the elements * by other means, and change their data such that the sorting * order would be different, the %priority_queue will not re-sort * the elements for you. (How could it know to do so?) */ template<typename _Tp, typename _Sequence = vector<_Tp>, typename _Compare = less<typename _Sequence::value_type> > class priority_queue { // concept requirements typedef typename _Sequence::value_type _Sequence_value_type; __glibcxx_class_requires(_Tp, _SGIAssignableConcept) __glibcxx_class_requires(_Sequence, _SequenceConcept) __glibcxx_class_requires(_Sequence, _RandomAccessContainerConcept) __glibcxx_class_requires2(_Tp, _Sequence_value_type, _SameTypeConcept) __glibcxx_class_requires4(_Compare, bool, _Tp, _Tp, _BinaryFunctionConcept) #if __cplusplus >= 201103L template<typename _Alloc> using _Uses = typename enable_if<uses_allocator<_Sequence, _Alloc>::value>::type; #endif public: typedef typename _Sequence::value_type value_type; typedef typename _Sequence::reference reference; typedef typename _Sequence::const_reference const_reference; typedef typename _Sequence::size_type size_type; typedef _Sequence container_type; protected: // See queue::c for notes on these names. _Sequence c; _Compare comp; public: /** * @brief Default constructor creates no elements. */ #if __cplusplus < 201103L explicit priority_queue(const _Compare& __x = _Compare(), const _Sequence& __s = _Sequence()) : c(__s), comp(__x) { std::make_heap(c.begin(), c.end(), comp); } #else explicit priority_queue(const _Compare& __x, const _Sequence& __s) : c(__s), comp(__x) { std::make_heap(c.begin(), c.end(), comp); } explicit priority_queue(const _Compare& __x = _Compare(), _Sequence&& __s = _Sequence()) : c(std::move(__s)), comp(__x) { std::make_heap(c.begin(), c.end(), comp); } template<typename _Alloc, typename _Requires = _Uses<_Alloc>> explicit priority_queue(const _Alloc& __a) : c(__a), comp() { } template<typename _Alloc, typename _Requires = _Uses<_Alloc>> priority_queue(const _Compare& __x, const _Alloc& __a) : c(__a), comp(__x) { } template<typename _Alloc, typename _Requires = _Uses<_Alloc>> priority_queue(const _Compare& __x, const _Sequence& __c, const _Alloc& __a) : c(__c, __a), comp(__x) { } template<typename _Alloc, typename _Requires = _Uses<_Alloc>> priority_queue(const _Compare& __x, _Sequence&& __c, const _Alloc& __a) : c(std::move(__c), __a), comp(__x) { } template<typename _Alloc, typename _Requires = _Uses<_Alloc>> priority_queue(const priority_queue& __q, const _Alloc& __a) : c(__q.c, __a), comp(__q.comp) { } template<typename _Alloc, typename _Requires = _Uses<_Alloc>> priority_queue(priority_queue&& __q, const _Alloc& __a) : c(std::move(__q.c), __a), comp(std::move(__q.comp)) { } #endif /** * @brief Builds a %queue from a range. * @param __first An input iterator. * @param __last An input iterator. * @param __x A comparison functor describing a strict weak ordering. * @param __s An initial sequence with which to start. * * Begins by copying @a __s, inserting a copy of the elements * from @a [first,last) into the copy of @a __s, then ordering * the copy according to @a __x. * * For more information on function objects, see the * documentation on @link functors functor base * classes@endlink. */ #if __cplusplus < 201103L template<typename _InputIterator> priority_queue(_InputIterator __first, _InputIterator __last, const _Compare& __x = _Compare(), const _Sequence& __s = _Sequence()) : c(__s), comp(__x) { __glibcxx_requires_valid_range(__first, __last); c.insert(c.end(), __first, __last); std::make_heap(c.begin(), c.end(), comp); } #else template<typename _InputIterator> priority_queue(_InputIterator __first, _InputIterator __last, const _Compare& __x, const _Sequence& __s) : c(__s), comp(__x) { __glibcxx_requires_valid_range(__first, __last); c.insert(c.end(), __first, __last); std::make_heap(c.begin(), c.end(), comp); } template<typename _InputIterator> priority_queue(_InputIterator __first, _InputIterator __last, const _Compare& __x = _Compare(), _Sequence&& __s = _Sequence()) : c(std::move(__s)), comp(__x) { __glibcxx_requires_valid_range(__first, __last); c.insert(c.end(), __first, __last); std::make_heap(c.begin(), c.end(), comp); } #endif /** * Returns true if the %queue is empty. */ bool empty() const { return c.empty(); } /** Returns the number of elements in the %queue. */ size_type size() const { return c.size(); } /** * Returns a read-only (constant) reference to the data at the first * element of the %queue. */ const_reference top() const { __glibcxx_requires_nonempty(); return c.front(); } /** * @brief Add data to the %queue. * @param __x Data to be added. * * This is a typical %queue operation. * The time complexity of the operation depends on the underlying * sequence. */ void push(const value_type& __x) { c.push_back(__x); std::push_heap(c.begin(), c.end(), comp); } #if __cplusplus >= 201103L void push(value_type&& __x) { c.push_back(std::move(__x)); std::push_heap(c.begin(), c.end(), comp); } template<typename... _Args> void emplace(_Args&&... __args) { c.emplace_back(std::forward<_Args>(__args)...); std::push_heap(c.begin(), c.end(), comp); } #endif /** * @brief Removes first element. * * This is a typical %queue operation. It shrinks the %queue * by one. The time complexity of the operation depends on the * underlying sequence. * * Note that no data is returned, and if the first element's * data is needed, it should be retrieved before pop() is * called. */ void pop() { __glibcxx_requires_nonempty(); std::pop_heap(c.begin(), c.end(), comp); c.pop_back(); } #if __cplusplus >= 201103L void swap(priority_queue& __pq) noexcept(__is_nothrow_swappable<_Tp>::value && __is_nothrow_swappable<_Compare>::value) { using std::swap; swap(c, __pq.c); swap(comp, __pq.comp); } #endif }; // No equality/comparison operators are provided for priority_queue. #if __cplusplus >= 201103L template<typename _Tp, typename _Sequence, typename _Compare> inline void swap(priority_queue<_Tp, _Sequence, _Compare>& __x, priority_queue<_Tp, _Sequence, _Compare>& __y) noexcept(noexcept(__x.swap(__y))) { __x.swap(__y); } template<typename _Tp, typename _Sequence, typename _Compare, typename _Alloc> struct uses_allocator<priority_queue<_Tp, _Sequence, _Compare>, _Alloc> : public uses_allocator<_Sequence, _Alloc>::type { }; #endif _GLIBCXX_END_NAMESPACE_VERSION } // namespace #endif /* _STL_QUEUE_H */