Linux anchor 4.4.0-210-generic #242-Ubuntu SMP Fri Apr 16 09:57:56 UTC 2021 x86_64
Apache/2.4.18 (Ubuntu)
Server IP : 10.10.100.4 & Your IP : 216.73.217.150
Domains :
Cant Read [ /etc/named.conf ]
User : www-data
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
usr /
include /
c++ /
5 /
bits /
Delete
Unzip
Name
Size
Permission
Date
Action
algorithmfwd.h
21.14
KB
-rw-r--r--
2019-10-04 20:36
alloc_traits.h
20.05
KB
-rw-r--r--
2019-10-04 20:36
allocated_ptr.h
3.38
KB
-rw-r--r--
2019-10-04 20:36
allocator.h
6.32
KB
-rw-r--r--
2019-10-04 20:36
atomic_base.h
23.41
KB
-rw-r--r--
2019-10-04 20:36
atomic_futex.h
9.35
KB
-rw-r--r--
2019-10-04 20:36
atomic_lockfree_defines.h
2.2
KB
-rw-r--r--
2019-10-04 20:36
basic_ios.h
15.7
KB
-rw-r--r--
2019-10-04 20:36
basic_ios.tcc
5.89
KB
-rw-r--r--
2019-10-04 20:36
basic_string.h
198.81
KB
-rw-r--r--
2019-10-04 20:36
basic_string.tcc
50.73
KB
-rw-r--r--
2019-10-04 20:36
boost_concept_check.h
26.41
KB
-rw-r--r--
2019-10-04 20:36
c++0x_warning.h
1.44
KB
-rw-r--r--
2019-10-04 20:36
c++14_warning.h
1.48
KB
-rw-r--r--
2019-10-04 20:36
char_traits.h
17.56
KB
-rw-r--r--
2019-10-04 20:36
codecvt.h
20.8
KB
-rw-r--r--
2019-10-04 20:36
concept_check.h
3.26
KB
-rw-r--r--
2019-10-04 20:36
cpp_type_traits.h
10.04
KB
-rw-r--r--
2019-10-04 20:36
cxxabi_forced.h
1.77
KB
-rw-r--r--
2019-10-04 20:36
deque.tcc
32.89
KB
-rw-r--r--
2019-10-04 20:36
enable_special_members.h
10.87
KB
-rw-r--r--
2019-10-04 20:36
exception_defines.h
1.61
KB
-rw-r--r--
2019-10-04 20:36
exception_ptr.h
5.5
KB
-rw-r--r--
2019-10-04 20:36
forward_list.h
47.01
KB
-rw-r--r--
2019-10-04 20:36
forward_list.tcc
15.17
KB
-rw-r--r--
2019-10-04 20:36
fstream.tcc
32.1
KB
-rw-r--r--
2019-10-04 20:36
functexcept.h
3.18
KB
-rw-r--r--
2019-10-04 20:36
functional_hash.h
6.05
KB
-rw-r--r--
2019-10-04 20:36
gslice.h
5.39
KB
-rw-r--r--
2019-10-04 20:36
gslice_array.h
7.59
KB
-rw-r--r--
2019-10-04 20:36
hash_bytes.h
2.1
KB
-rw-r--r--
2019-10-04 20:36
hashtable.h
67.95
KB
-rw-r--r--
2019-10-04 20:36
hashtable_policy.h
62.61
KB
-rw-r--r--
2019-10-04 20:36
indirect_array.h
7.68
KB
-rw-r--r--
2019-10-04 20:36
ios_base.h
30.21
KB
-rw-r--r--
2019-10-04 20:36
istream.tcc
30.21
KB
-rw-r--r--
2019-10-04 20:36
list.tcc
13.5
KB
-rw-r--r--
2019-10-04 20:36
locale_classes.h
24.14
KB
-rw-r--r--
2019-10-04 20:36
locale_classes.tcc
8.18
KB
-rw-r--r--
2019-10-04 20:36
locale_conv.h
15.64
KB
-rw-r--r--
2019-10-04 20:36
locale_facets.h
89.93
KB
-rw-r--r--
2019-10-04 20:36
locale_facets.tcc
38.63
KB
-rw-r--r--
2019-10-04 20:36
locale_facets_nonio.h
67.33
KB
-rw-r--r--
2019-10-04 20:36
locale_facets_nonio.tcc
44.04
KB
-rw-r--r--
2019-10-04 20:36
localefwd.h
5.51
KB
-rw-r--r--
2019-10-04 20:36
mask_array.h
7.41
KB
-rw-r--r--
2019-10-04 20:36
memoryfwd.h
2.36
KB
-rw-r--r--
2019-10-04 20:36
move.h
5.93
KB
-rw-r--r--
2019-10-04 20:36
nested_exception.h
4.5
KB
-rw-r--r--
2019-10-04 20:36
ostream.tcc
12.03
KB
-rw-r--r--
2019-10-04 20:36
ostream_insert.h
3.91
KB
-rw-r--r--
2019-10-04 20:36
parse_numbers.h
7.58
KB
-rw-r--r--
2019-10-04 20:36
postypes.h
8.02
KB
-rw-r--r--
2019-10-04 20:36
predefined_ops.h
7.75
KB
-rw-r--r--
2019-10-04 20:36
ptr_traits.h
5.02
KB
-rw-r--r--
2019-10-04 20:36
quoted_string.h
4.47
KB
-rw-r--r--
2019-10-04 20:36
random.h
169.22
KB
-rw-r--r--
2019-10-04 20:36
random.tcc
102.74
KB
-rw-r--r--
2019-10-04 20:36
range_access.h
7.11
KB
-rw-r--r--
2019-10-04 20:36
regex.h
94.4
KB
-rw-r--r--
2019-10-04 20:36
regex.tcc
16.72
KB
-rw-r--r--
2019-10-04 20:36
regex_automaton.h
8.52
KB
-rw-r--r--
2019-10-04 20:36
regex_automaton.tcc
7.71
KB
-rw-r--r--
2019-10-04 20:36
regex_compiler.h
14.35
KB
-rw-r--r--
2019-10-04 20:36
regex_compiler.tcc
17.4
KB
-rw-r--r--
2019-10-04 20:36
regex_constants.h
13.57
KB
-rw-r--r--
2019-10-04 20:36
regex_error.h
4.48
KB
-rw-r--r--
2019-10-04 20:36
regex_executor.h
6.62
KB
-rw-r--r--
2019-10-04 20:36
regex_executor.tcc
13.99
KB
-rw-r--r--
2019-10-04 20:36
regex_scanner.h
6.88
KB
-rw-r--r--
2019-10-04 20:36
regex_scanner.tcc
13.8
KB
-rw-r--r--
2019-10-04 20:36
shared_ptr.h
19.8
KB
-rw-r--r--
2019-10-04 20:36
shared_ptr_atomic.h
9.54
KB
-rw-r--r--
2019-10-04 20:36
shared_ptr_base.h
44.48
KB
-rw-r--r--
2019-10-04 20:36
slice_array.h
9.12
KB
-rw-r--r--
2019-10-04 20:36
sstream.tcc
9.27
KB
-rw-r--r--
2019-10-04 20:36
stl_algo.h
198.04
KB
-rw-r--r--
2019-10-04 20:36
stl_algobase.h
49.72
KB
-rw-r--r--
2019-10-04 20:36
stl_bvector.h
32.76
KB
-rw-r--r--
2019-10-04 20:36
stl_construct.h
5.05
KB
-rw-r--r--
2019-10-04 20:36
stl_deque.h
75.97
KB
-rw-r--r--
2019-10-04 20:36
stl_function.h
32.55
KB
-rw-r--r--
2019-10-04 20:36
stl_heap.h
18.19
KB
-rw-r--r--
2019-10-04 20:36
stl_iterator.h
36.98
KB
-rw-r--r--
2019-10-04 20:36
stl_iterator_base_funcs.h
6.8
KB
-rw-r--r--
2019-10-04 20:36
stl_iterator_base_types.h
8.42
KB
-rw-r--r--
2019-10-04 20:36
stl_list.h
60.65
KB
-rw-r--r--
2019-10-04 20:36
stl_map.h
39.54
KB
-rw-r--r--
2019-10-04 20:36
stl_multimap.h
36.77
KB
-rw-r--r--
2019-10-04 20:36
stl_multiset.h
30.93
KB
-rw-r--r--
2019-10-04 20:36
stl_numeric.h
13.5
KB
-rw-r--r--
2019-10-04 20:36
stl_pair.h
9.63
KB
-rw-r--r--
2019-10-04 20:36
stl_queue.h
18.28
KB
-rw-r--r--
2019-10-04 20:36
stl_raw_storage_iter.h
3.37
KB
-rw-r--r--
2019-10-04 20:36
stl_relops.h
4.49
KB
-rw-r--r--
2019-10-04 20:36
stl_set.h
31.18
KB
-rw-r--r--
2019-10-04 20:36
stl_stack.h
9.71
KB
-rw-r--r--
2019-10-04 20:36
stl_tempbuf.h
8.15
KB
-rw-r--r--
2019-10-04 20:36
stl_tree.h
67.54
KB
-rw-r--r--
2019-10-04 20:36
stl_uninitialized.h
21.37
KB
-rw-r--r--
2019-10-04 20:36
stl_vector.h
52.41
KB
-rw-r--r--
2019-10-04 20:36
stream_iterator.h
6.44
KB
-rw-r--r--
2019-10-04 20:36
streambuf.tcc
4.81
KB
-rw-r--r--
2019-10-04 20:36
streambuf_iterator.h
12.33
KB
-rw-r--r--
2019-10-04 20:36
stringfwd.h
2.55
KB
-rw-r--r--
2019-10-04 20:36
uniform_int_dist.h
9.72
KB
-rw-r--r--
2019-10-04 20:36
unique_ptr.h
23.29
KB
-rw-r--r--
2019-10-04 20:36
unordered_map.h
52.15
KB
-rw-r--r--
2019-10-04 20:36
unordered_set.h
47.51
KB
-rw-r--r--
2019-10-04 20:36
uses_allocator.h
3.19
KB
-rw-r--r--
2019-10-04 20:36
valarray_after.h
22.12
KB
-rw-r--r--
2019-10-04 20:36
valarray_array.h
21.23
KB
-rw-r--r--
2019-10-04 20:36
valarray_array.tcc
7.08
KB
-rw-r--r--
2019-10-04 20:36
valarray_before.h
18.08
KB
-rw-r--r--
2019-10-04 20:36
vector.tcc
26.42
KB
-rw-r--r--
2019-10-04 20:36
Save
Rename
// Heap implementation -*- C++ -*- // Copyright (C) 2001-2015 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) 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_heap.h * This is an internal header file, included by other library headers. * Do not attempt to use it directly. @headername{queue} */ #ifndef _STL_HEAP_H #define _STL_HEAP_H 1 #include <debug/debug.h> #include <bits/move.h> #include <bits/predefined_ops.h> namespace std _GLIBCXX_VISIBILITY(default) { _GLIBCXX_BEGIN_NAMESPACE_VERSION /** * @defgroup heap_algorithms Heap * @ingroup sorting_algorithms */ template<typename _RandomAccessIterator, typename _Distance, typename _Compare> _Distance __is_heap_until(_RandomAccessIterator __first, _Distance __n, _Compare __comp) { _Distance __parent = 0; for (_Distance __child = 1; __child < __n; ++__child) { if (__comp(__first + __parent, __first + __child)) return __child; if ((__child & 1) == 0) ++__parent; } return __n; } // __is_heap, a predicate testing whether or not a range is a heap. // This function is an extension, not part of the C++ standard. template<typename _RandomAccessIterator, typename _Distance> inline bool __is_heap(_RandomAccessIterator __first, _Distance __n) { return std::__is_heap_until(__first, __n, __gnu_cxx::__ops::__iter_less_iter()) == __n; } template<typename _RandomAccessIterator, typename _Compare, typename _Distance> inline bool __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n) { return std::__is_heap_until(__first, __n, __gnu_cxx::__ops::__iter_comp_iter(__comp)) == __n; } template<typename _RandomAccessIterator> inline bool __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) { return std::__is_heap(__first, std::distance(__first, __last)); } template<typename _RandomAccessIterator, typename _Compare> inline bool __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { return std::__is_heap(__first, __comp, std::distance(__first, __last)); } // Heap-manipulation functions: push_heap, pop_heap, make_heap, sort_heap, // + is_heap and is_heap_until in C++0x. template<typename _RandomAccessIterator, typename _Distance, typename _Tp, typename _Compare> void __push_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __topIndex, _Tp __value, _Compare __comp) { _Distance __parent = (__holeIndex - 1) / 2; while (__holeIndex > __topIndex && __comp(__first + __parent, __value)) { *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __parent)); __holeIndex = __parent; __parent = (__holeIndex - 1) / 2; } *(__first + __holeIndex) = _GLIBCXX_MOVE(__value); } /** * @brief Push an element onto a heap. * @param __first Start of heap. * @param __last End of heap + element. * @ingroup heap_algorithms * * This operation pushes the element at last-1 onto the valid heap * over the range [__first,__last-1). After completion, * [__first,__last) is a valid heap. */ template<typename _RandomAccessIterator> inline void push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) { typedef typename iterator_traits<_RandomAccessIterator>::value_type _ValueType; typedef typename iterator_traits<_RandomAccessIterator>::difference_type _DistanceType; // concept requirements __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< _RandomAccessIterator>) __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) __glibcxx_requires_valid_range(__first, __last); __glibcxx_requires_heap(__first, __last - 1); _ValueType __value = _GLIBCXX_MOVE(*(__last - 1)); std::__push_heap(__first, _DistanceType((__last - __first) - 1), _DistanceType(0), _GLIBCXX_MOVE(__value), __gnu_cxx::__ops::__iter_less_val()); } /** * @brief Push an element onto a heap using comparison functor. * @param __first Start of heap. * @param __last End of heap + element. * @param __comp Comparison functor. * @ingroup heap_algorithms * * This operation pushes the element at __last-1 onto the valid * heap over the range [__first,__last-1). After completion, * [__first,__last) is a valid heap. Compare operations are * performed using comp. */ template<typename _RandomAccessIterator, typename _Compare> inline void push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { typedef typename iterator_traits<_RandomAccessIterator>::value_type _ValueType; typedef typename iterator_traits<_RandomAccessIterator>::difference_type _DistanceType; // concept requirements __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< _RandomAccessIterator>) __glibcxx_requires_valid_range(__first, __last); __glibcxx_requires_heap_pred(__first, __last - 1, __comp); _ValueType __value = _GLIBCXX_MOVE(*(__last - 1)); std::__push_heap(__first, _DistanceType((__last - __first) - 1), _DistanceType(0), _GLIBCXX_MOVE(__value), __gnu_cxx::__ops::__iter_comp_val(__comp)); } template<typename _RandomAccessIterator, typename _Distance, typename _Tp, typename _Compare> void __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __value, _Compare __comp) { const _Distance __topIndex = __holeIndex; _Distance __secondChild = __holeIndex; while (__secondChild < (__len - 1) / 2) { __secondChild = 2 * (__secondChild + 1); if (__comp(__first + __secondChild, __first + (__secondChild - 1))) __secondChild--; *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + __secondChild)); __holeIndex = __secondChild; } if ((__len & 1) == 0 && __secondChild == (__len - 2) / 2) { __secondChild = 2 * (__secondChild + 1); *(__first + __holeIndex) = _GLIBCXX_MOVE(*(__first + (__secondChild - 1))); __holeIndex = __secondChild - 1; } std::__push_heap(__first, __holeIndex, __topIndex, _GLIBCXX_MOVE(__value), __gnu_cxx::__ops::__iter_comp_val(__comp)); } template<typename _RandomAccessIterator, typename _Compare> inline void __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result, _Compare __comp) { typedef typename iterator_traits<_RandomAccessIterator>::value_type _ValueType; typedef typename iterator_traits<_RandomAccessIterator>::difference_type _DistanceType; _ValueType __value = _GLIBCXX_MOVE(*__result); *__result = _GLIBCXX_MOVE(*__first); std::__adjust_heap(__first, _DistanceType(0), _DistanceType(__last - __first), _GLIBCXX_MOVE(__value), __comp); } /** * @brief Pop an element off a heap. * @param __first Start of heap. * @param __last End of heap. * @pre [__first, __last) is a valid, non-empty range. * @ingroup heap_algorithms * * This operation pops the top of the heap. The elements __first * and __last-1 are swapped and [__first,__last-1) is made into a * heap. */ template<typename _RandomAccessIterator> inline void pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) { typedef typename iterator_traits<_RandomAccessIterator>::value_type _ValueType; // concept requirements __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< _RandomAccessIterator>) __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) __glibcxx_requires_non_empty_range(__first, __last); __glibcxx_requires_valid_range(__first, __last); __glibcxx_requires_heap(__first, __last); if (__last - __first > 1) { --__last; std::__pop_heap(__first, __last, __last, __gnu_cxx::__ops::__iter_less_iter()); } } /** * @brief Pop an element off a heap using comparison functor. * @param __first Start of heap. * @param __last End of heap. * @param __comp Comparison functor to use. * @ingroup heap_algorithms * * This operation pops the top of the heap. The elements __first * and __last-1 are swapped and [__first,__last-1) is made into a * heap. Comparisons are made using comp. */ template<typename _RandomAccessIterator, typename _Compare> inline void pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { // concept requirements __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< _RandomAccessIterator>) __glibcxx_requires_valid_range(__first, __last); __glibcxx_requires_non_empty_range(__first, __last); __glibcxx_requires_heap_pred(__first, __last, __comp); if (__last - __first > 1) { --__last; std::__pop_heap(__first, __last, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp)); } } template<typename _RandomAccessIterator, typename _Compare> void __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { typedef typename iterator_traits<_RandomAccessIterator>::value_type _ValueType; typedef typename iterator_traits<_RandomAccessIterator>::difference_type _DistanceType; if (__last - __first < 2) return; const _DistanceType __len = __last - __first; _DistanceType __parent = (__len - 2) / 2; while (true) { _ValueType __value = _GLIBCXX_MOVE(*(__first + __parent)); std::__adjust_heap(__first, __parent, __len, _GLIBCXX_MOVE(__value), __comp); if (__parent == 0) return; __parent--; } } /** * @brief Construct a heap over a range. * @param __first Start of heap. * @param __last End of heap. * @ingroup heap_algorithms * * This operation makes the elements in [__first,__last) into a heap. */ template<typename _RandomAccessIterator> inline void make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) { // concept requirements __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< _RandomAccessIterator>) __glibcxx_function_requires(_LessThanComparableConcept< typename iterator_traits<_RandomAccessIterator>::value_type>) __glibcxx_requires_valid_range(__first, __last); std::__make_heap(__first, __last, __gnu_cxx::__ops::__iter_less_iter()); } /** * @brief Construct a heap over a range using comparison functor. * @param __first Start of heap. * @param __last End of heap. * @param __comp Comparison functor to use. * @ingroup heap_algorithms * * This operation makes the elements in [__first,__last) into a heap. * Comparisons are made using __comp. */ template<typename _RandomAccessIterator, typename _Compare> inline void make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { // concept requirements __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< _RandomAccessIterator>) __glibcxx_requires_valid_range(__first, __last); std::__make_heap(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp)); } template<typename _RandomAccessIterator, typename _Compare> void __sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { while (__last - __first > 1) { --__last; std::__pop_heap(__first, __last, __last, __comp); } } /** * @brief Sort a heap. * @param __first Start of heap. * @param __last End of heap. * @ingroup heap_algorithms * * This operation sorts the valid heap in the range [__first,__last). */ template<typename _RandomAccessIterator> inline void sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) { // concept requirements __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< _RandomAccessIterator>) __glibcxx_function_requires(_LessThanComparableConcept< typename iterator_traits<_RandomAccessIterator>::value_type>) __glibcxx_requires_valid_range(__first, __last); __glibcxx_requires_heap(__first, __last); std::__sort_heap(__first, __last, __gnu_cxx::__ops::__iter_less_iter()); } /** * @brief Sort a heap using comparison functor. * @param __first Start of heap. * @param __last End of heap. * @param __comp Comparison functor to use. * @ingroup heap_algorithms * * This operation sorts the valid heap in the range [__first,__last). * Comparisons are made using __comp. */ template<typename _RandomAccessIterator, typename _Compare> inline void sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { // concept requirements __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< _RandomAccessIterator>) __glibcxx_requires_valid_range(__first, __last); __glibcxx_requires_heap_pred(__first, __last, __comp); std::__sort_heap(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp)); } #if __cplusplus >= 201103L /** * @brief Search the end of a heap. * @param __first Start of range. * @param __last End of range. * @return An iterator pointing to the first element not in the heap. * @ingroup heap_algorithms * * This operation returns the last iterator i in [__first, __last) for which * the range [__first, i) is a heap. */ template<typename _RandomAccessIterator> inline _RandomAccessIterator is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last) { // concept requirements __glibcxx_function_requires(_RandomAccessIteratorConcept< _RandomAccessIterator>) __glibcxx_function_requires(_LessThanComparableConcept< typename iterator_traits<_RandomAccessIterator>::value_type>) __glibcxx_requires_valid_range(__first, __last); return __first + std::__is_heap_until(__first, std::distance(__first, __last), __gnu_cxx::__ops::__iter_less_iter()); } /** * @brief Search the end of a heap using comparison functor. * @param __first Start of range. * @param __last End of range. * @param __comp Comparison functor to use. * @return An iterator pointing to the first element not in the heap. * @ingroup heap_algorithms * * This operation returns the last iterator i in [__first, __last) for which * the range [__first, i) is a heap. Comparisons are made using __comp. */ template<typename _RandomAccessIterator, typename _Compare> inline _RandomAccessIterator is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { // concept requirements __glibcxx_function_requires(_RandomAccessIteratorConcept< _RandomAccessIterator>) __glibcxx_requires_valid_range(__first, __last); return __first + std::__is_heap_until(__first, std::distance(__first, __last), __gnu_cxx::__ops::__iter_comp_iter(__comp)); } /** * @brief Determines whether a range is a heap. * @param __first Start of range. * @param __last End of range. * @return True if range is a heap, false otherwise. * @ingroup heap_algorithms */ template<typename _RandomAccessIterator> inline bool is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) { return std::is_heap_until(__first, __last) == __last; } /** * @brief Determines whether a range is a heap using comparison functor. * @param __first Start of range. * @param __last End of range. * @param __comp Comparison functor to use. * @return True if range is a heap, false otherwise. * @ingroup heap_algorithms */ template<typename _RandomAccessIterator, typename _Compare> inline bool is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { return std::is_heap_until(__first, __last, __comp) == __last; } #endif _GLIBCXX_END_NAMESPACE_VERSION } // namespace #endif /* _STL_HEAP_H */