02d92e3b70
2001-07-17 Stephen M. Webb <stephen@bregmasoft.com>r All occurrences of the __value_type() and __distance_type() functions, which were required to support the HP STL, have been removed along with all the auxiliary forwarding functions that were required to support their use. The __iterator_category() function was pretty much left alone because there was no benefit to removing it and its use made code just a little more readable. Incidences of distance() with nonstandard argument list were replaced by calls to the standard function (only in the files affected by the removal of the other HP functions). The signature of the rotate() algorithm was changed to match the standard. Headers were reformatted under C++STYLE guidelines (indentation, linebreaks, typename keyword). * include/bits/stl_algo.h: replaced __value_type() and __distance_type() with iterator_traits, eliminated auxiliary support functions required to support said function usage. Changed nonstandard distance() call to standard call. * include/bits/stl_algobase.h: Same. * include/bits/stl_heap.h: Same. * include/bits/stl_numeric.h: Same. * include/bits/stl_uninitialized.h: Same. * include/bits/stl_iterator_base_types.h (__value_type()): Removed. (__distance_type()): Removed. (value_type()): Gone. (distance_type()): Done in. (iterator_category()): Hasta la vista, baby. * include/bits/stl_iterator_base_funcs.h (iterator_category()): Replaced with __iterator_category(). * include/backward/iterator.h: moved definition of value_type(), distance_type(), and iterator_category() out of std:: and into here. * testsuite/23_containers/vector_ctor.cc (test03): New testcases. * testsuite/23_containers/vector_modifiers.cc (test03): New testcases. * testsuite/25_algorithms/rotate.cc: New testcase. * testsuite/25_algorithms/copy.cc: New testcase. * testsuite/25_algorithms/sort.cc: Same. * testsuite/25_algorithms/heap.cc: Same. * testsuite/25_algorithms/partition.cc: Same. * testsuite/25_algorithms/binary_search.cc: Same. * testsuite/26_numerics/sum_diff.cc: Ditto. From-SVN: r44117
308 lines
11 KiB
C++
308 lines
11 KiB
C++
// Heap implementation -*- C++ -*-
|
|
|
|
// Copyright (C) 2001 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 2, 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.
|
|
|
|
// You should have received a copy of the GNU General Public License along
|
|
// with this library; see the file COPYING. If not, write to the Free
|
|
// Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
|
|
// USA.
|
|
|
|
// As a special exception, you may use this file as part of a free software
|
|
// library without restriction. Specifically, if other files instantiate
|
|
// templates or use macros or inline functions from this file, or you compile
|
|
// this file and link it with other files to produce an executable, this
|
|
// file does not by itself cause the resulting executable to be covered by
|
|
// the GNU General Public License. This exception does not however
|
|
// invalidate any other reasons why the executable file might be covered by
|
|
// the GNU General Public License.
|
|
|
|
/*
|
|
*
|
|
* 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.
|
|
*/
|
|
|
|
/* NOTE: This is an internal header file, included by other STL headers.
|
|
* You should not attempt to use it directly.
|
|
*/
|
|
|
|
#ifndef _CPP_BITS_STL_HEAP_H
|
|
#define _CPP_BITS_STL_HEAP_H 1
|
|
|
|
namespace std
|
|
{
|
|
|
|
// Heap-manipulation functions: push_heap, pop_heap, make_heap, sort_heap.
|
|
|
|
template<typename _RandomAccessIterator, typename _Distance, typename _Tp>
|
|
void
|
|
__push_heap(_RandomAccessIterator __first,
|
|
_Distance __holeIndex, _Distance __topIndex, _Tp __value)
|
|
{
|
|
_Distance __parent = (__holeIndex - 1) / 2;
|
|
while (__holeIndex > __topIndex && *(__first + __parent) < __value) {
|
|
*(__first + __holeIndex) = *(__first + __parent);
|
|
__holeIndex = __parent;
|
|
__parent = (__holeIndex - 1) / 2;
|
|
}
|
|
*(__first + __holeIndex) = __value;
|
|
}
|
|
|
|
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
|
|
__glibcpp_function_requires(_Mutable_RandomAccessIteratorConcept<
|
|
_RandomAccessIterator>);
|
|
__glibcpp_function_requires(_LessThanComparableConcept<_ValueType>);
|
|
|
|
__push_heap(__first, _DistanceType((__last - __first) - 1), _DistanceType(0),
|
|
_ValueType(*(__last - 1)));
|
|
}
|
|
|
|
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) = *(__first + __parent);
|
|
__holeIndex = __parent;
|
|
__parent = (__holeIndex - 1) / 2;
|
|
}
|
|
*(__first + __holeIndex) = __value;
|
|
}
|
|
|
|
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
|
|
__glibcpp_function_requires(_Mutable_RandomAccessIteratorConcept<
|
|
_RandomAccessIterator>);
|
|
|
|
__push_heap(__first, _DistanceType((__last - __first) - 1), _DistanceType(0),
|
|
_ValueType(*(__last - 1)), __comp);
|
|
}
|
|
|
|
template<typename _RandomAccessIterator, typename _Distance, typename _Tp>
|
|
void
|
|
__adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
|
|
_Distance __len, _Tp __value)
|
|
{
|
|
_Distance __topIndex = __holeIndex;
|
|
_Distance __secondChild = 2 * __holeIndex + 2;
|
|
while (__secondChild < __len) {
|
|
if (*(__first + __secondChild) < *(__first + (__secondChild - 1)))
|
|
__secondChild--;
|
|
*(__first + __holeIndex) = *(__first + __secondChild);
|
|
__holeIndex = __secondChild;
|
|
__secondChild = 2 * (__secondChild + 1);
|
|
}
|
|
if (__secondChild == __len) {
|
|
*(__first + __holeIndex) = *(__first + (__secondChild - 1));
|
|
__holeIndex = __secondChild - 1;
|
|
}
|
|
__push_heap(__first, __holeIndex, __topIndex, __value);
|
|
}
|
|
|
|
template<typename _RandomAccessIterator, typename _Tp>
|
|
inline void
|
|
__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
|
|
_RandomAccessIterator __result, _Tp __value)
|
|
{
|
|
typedef typename iterator_traits<_RandomAccessIterator>::difference_type _Distance;
|
|
*__result = *__first;
|
|
__adjust_heap(__first, _Distance(0), _Distance(__last - __first), __value);
|
|
}
|
|
|
|
template<typename _RandomAccessIterator>
|
|
inline void
|
|
pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
|
|
{
|
|
typedef typename iterator_traits<_RandomAccessIterator>::value_type _ValueType;
|
|
|
|
// concept requirements
|
|
__glibcpp_function_requires(_Mutable_RandomAccessIteratorConcept<
|
|
_RandomAccessIterator>);
|
|
__glibcpp_function_requires(_LessThanComparableConcept<_ValueType>);
|
|
|
|
__pop_heap(__first, __last - 1, __last - 1, _ValueType(*(__last - 1)));
|
|
}
|
|
|
|
template<typename _RandomAccessIterator, typename _Distance,
|
|
typename _Tp, typename _Compare>
|
|
void
|
|
__adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
|
|
_Distance __len, _Tp __value, _Compare __comp)
|
|
{
|
|
_Distance __topIndex = __holeIndex;
|
|
_Distance __secondChild = 2 * __holeIndex + 2;
|
|
while (__secondChild < __len) {
|
|
if (__comp(*(__first + __secondChild), *(__first + (__secondChild - 1))))
|
|
__secondChild--;
|
|
*(__first + __holeIndex) = *(__first + __secondChild);
|
|
__holeIndex = __secondChild;
|
|
__secondChild = 2 * (__secondChild + 1);
|
|
}
|
|
if (__secondChild == __len) {
|
|
*(__first + __holeIndex) = *(__first + (__secondChild - 1));
|
|
__holeIndex = __secondChild - 1;
|
|
}
|
|
__push_heap(__first, __holeIndex, __topIndex, __value, __comp);
|
|
}
|
|
|
|
template<typename _RandomAccessIterator, typename _Tp, typename _Compare>
|
|
inline void
|
|
__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
|
|
_RandomAccessIterator __result, _Tp __value, _Compare __comp)
|
|
{
|
|
typedef typename iterator_traits<_RandomAccessIterator>::difference_type _Distance;
|
|
*__result = *__first;
|
|
__adjust_heap(__first, _Distance(0), _Distance(__last - __first),
|
|
__value, __comp);
|
|
}
|
|
|
|
template<typename _RandomAccessIterator, typename _Compare>
|
|
inline void
|
|
pop_heap(_RandomAccessIterator __first,
|
|
_RandomAccessIterator __last, _Compare __comp)
|
|
{
|
|
// concept requirements
|
|
__glibcpp_function_requires(_Mutable_RandomAccessIteratorConcept<
|
|
_RandomAccessIterator>);
|
|
|
|
typedef typename iterator_traits<_RandomAccessIterator>::value_type _ValueType;
|
|
__pop_heap(__first, __last - 1, __last - 1, _ValueType(*(__last - 1)), __comp);
|
|
}
|
|
|
|
template<typename _RandomAccessIterator>
|
|
void
|
|
make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
|
|
{
|
|
typedef typename iterator_traits<_RandomAccessIterator>::value_type
|
|
_ValueType;
|
|
typedef typename iterator_traits<_RandomAccessIterator>::difference_type
|
|
_DistanceType;
|
|
|
|
// concept requirements
|
|
__glibcpp_function_requires(_Mutable_RandomAccessIteratorConcept<
|
|
_RandomAccessIterator>);
|
|
__glibcpp_function_requires(_LessThanComparableConcept<_ValueType>);
|
|
|
|
if (__last - __first < 2) return;
|
|
_DistanceType __len = __last - __first;
|
|
_DistanceType __parent = (__len - 2)/2;
|
|
|
|
while (true) {
|
|
__adjust_heap(__first, __parent, __len, _ValueType(*(__first + __parent)));
|
|
if (__parent == 0) return;
|
|
__parent--;
|
|
}
|
|
}
|
|
|
|
template<typename _RandomAccessIterator, typename _Compare>
|
|
inline 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;
|
|
|
|
// concept requirements
|
|
__glibcpp_function_requires(_Mutable_RandomAccessIteratorConcept<
|
|
_RandomAccessIterator>);
|
|
|
|
if (__last - __first < 2) return;
|
|
_DistanceType __len = __last - __first;
|
|
_DistanceType __parent = (__len - 2)/2;
|
|
|
|
while (true) {
|
|
__adjust_heap(__first, __parent, __len,
|
|
_ValueType(*(__first + __parent)), __comp);
|
|
if (__parent == 0) return;
|
|
__parent--;
|
|
}
|
|
}
|
|
|
|
template<typename _RandomAccessIterator>
|
|
void
|
|
sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)
|
|
{
|
|
// concept requirements
|
|
__glibcpp_function_requires(_Mutable_RandomAccessIteratorConcept<
|
|
_RandomAccessIterator>);
|
|
__glibcpp_function_requires(_LessThanComparableConcept<
|
|
typename iterator_traits<_RandomAccessIterator>::value_type>);
|
|
|
|
while (__last - __first > 1)
|
|
pop_heap(__first, __last--);
|
|
}
|
|
|
|
template<typename _RandomAccessIterator, typename _Compare>
|
|
void
|
|
sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
|
|
_Compare __comp)
|
|
{
|
|
// concept requirements
|
|
__glibcpp_function_requires(_Mutable_RandomAccessIteratorConcept<
|
|
_RandomAccessIterator>);
|
|
|
|
while (__last - __first > 1)
|
|
pop_heap(__first, __last--, __comp);
|
|
}
|
|
|
|
} // namespace std
|
|
|
|
#endif /* _CPP_BITS_STL_HEAP_H */
|
|
|
|
// Local Variables:
|
|
// mode:C++
|
|
// End:
|