285b36d6a5
2003-11-11 Doug Gregor <gregod@cs.rpi.edu> * docs/html/debug.html: Document libstdc++ debug mode. * docs/html/debug_mode.html: Document libstdc++ debug mode design. * docs/html/test.html: Document how to test under debug mode. * docs/html/17_intro/howto.html: Document debug-mode macros. * include/Makefile.am: Install debug-mode headers. * src/Makefile.am: Include debug.cc. * include/bits/basic_string.tcc: (basic_string::_S_construct): Fix NULL pointer check. (__is_null_pointer): New. Add precondition annotations. * include/bits/stream_iterator.h (istream_iterator, ostream_iterator): Added precondition annotations. * include/bits/streambuf_iterator.h (istreambuf_iterator): Ditto. * include/bits/stl_queue.h (queue, priority_queue): Ditto. * include/bits/stl_stack.h (stack): Ditto. * include/bits/basic_string.h (basic_string): Ditto. * include/bits/basic_string.tcc (basic_string): Ditto. * include/std/std_memory.h (auto_ptr): Ditto. * include/std/std_valarray.h (valarray): Ditto. * include/bits/stl_algo.h: Added algorithm precondition annotations. * include/bits/stl_algobase.h: Added algorithm precondition annotations. * include/bits/stl_numeric.h: Ditto. * include/ext/algorithm: Added algorithm precondition annotations. (__is_heap): Moved away from here. * include/bits/stl_heap.h: Added algorithm precondition annotations. (__is_heap): Moved to the top of this file. (__is_heap): Added iterator range overloads. * testsuite/20_util/auto_ptr_neg.cc: Fix line numbers to match up with changes in std_memory.h. * testsuite/23_containers/list/operators/4.cc: Don't verify performance guarantees when in debug mode. * testsuite/23_containers/bitset/invalidation/1.cc: New. * testsuite/23_containers/deque/invalidation/1.cc: New. * testsuite/23_containers/deque/invalidation/2.cc: New. * testsuite/23_containers/deque/invalidation/3.cc: New. * testsuite/23_containers/deque/invalidation/4.cc: New. * testsuite/23_containers/list/invalidation/1.cc: New. * testsuite/23_containers/list/invalidation/2.cc: New. * testsuite/23_containers/list/invalidation/3.cc: New. * testsuite/23_containers/list/invalidation/4.cc: New. * testsuite/23_containers/map/invalidation/1.cc: New. * testsuite/23_containers/map/invalidation/2.cc: New. * testsuite/23_containers/multimap/invalidation/1.cc: New. * testsuite/23_containers/multimap/invalidation/2.cc: New. * testsuite/23_containers/multiset/invalidation/1.cc: New. * testsuite/23_containers/multiset/invalidation/2.cc: New. * testsuite/23_containers/set/invalidation/1.cc: New. * testsuite/23_containers/set/invalidation/2.cc: New. * testsuite/23_containers/vector/invalidation/1.cc: New. * testsuite/23_containers/vector/invalidation/2.cc: New. * testsuite/23_containers/vector/invalidation/3.cc: New. * testsuite/23_containers/vector/invalidation/4.cc: New. * testsuite/25_algorithms/heap.cc: Don't verify performance guarantees when in debug mode. * include/debug/bitset: New. * include/debug/debug.h: New. * include/debug/deque: New. * include/debug/formatter.h: New. * include/debug/hash_map: New. * include/debug/hash_map.h: New. * include/debug/hash_multimap.h: New. * include/debug/hash_set: New. * include/debug/hash_set.h: New. * include/debug/hash_multiset.h: New. * include/debug/list: New. * include/debug/map: New. * include/debug/map.h: New. * include/debug/multimap.h: New. * include/debug/multiset.h: New. * include/debug/safe_base.h: New. * include/debug/safe_iterator.h: New. * include/debug/safe_iterator.tcc: New. * include/debug/safe_sequence.h: New. * include/debug/set: New. * include/debug/set.h: New. * include/debug/string: New. * include/debug/vector: New. * src/debug.cc: New. * config/linker-map.gnu: Add debug mode symbols. 2003-11-11 Benjamin Kosnik <bkoz@redhat.com> * src/string-inst.cc: Tweak namespaces. * src/misc-inst.cc: Same. * docs/html/debug.html: Edits. * config/link-map.gnu: Remove cruft. * include/bits/c++config: Add in namespace associations. * include/std/std_bitset.h: Adjust namespace to __gnu_norm, comment tweaks. * include/bits/deque.tcc: Same. * include/bits/list.tcc: Same. * include/bits/stl_bvector.h: Same. * include/bits/stl_deque.h: Same. * include/bits/stl_list.h: Same. * include/bits/stl_map.h: Same. * include/bits/stl_multimap.h: Same. * include/bits/stl_multiset.h: Same. * include/bits/stl_set.h: Same. * include/bits/stl_vector.h: Same. * include/bits/vector.tcc: Same. * include/std/std_algorithm.h: Remove markup comments. * include/std/std_functional.h: Same. * include/std/std_iterator.h: Same. * include/std/std_numeric.h: Same. * include/std/std_utility.h: Same. * include/bits/stl_queue.h: Formatting tweaks. * include/bits/stl_stack.h: Same. * include/std/std_deque.h: Include debugging version in debug mode. * include/std/std_list.h: Same. * include/std/std_map.h: Same. * include/std/std_set.h: Same. * include/std/std_vector.h: Same. * include/std/std_queue.h: Use deque, vector. * include/std/std_stack.h: Same. From-SVN: r73459
222 lines
8.0 KiB
C++
222 lines
8.0 KiB
C++
// Numeric functions 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) 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 stl_numeric.h
|
|
* This is an internal header file, included by other library headers.
|
|
* You should not attempt to use it directly.
|
|
*/
|
|
|
|
#ifndef _STL_NUMERIC_H
|
|
#define _STL_NUMERIC_H 1
|
|
|
|
#include <debug/debug.h>
|
|
|
|
namespace std
|
|
{
|
|
|
|
template<typename _InputIterator, typename _Tp>
|
|
_Tp
|
|
accumulate(_InputIterator __first, _InputIterator __last, _Tp __init)
|
|
{
|
|
// concept requirements
|
|
__glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
|
|
__glibcxx_requires_valid_range(__first, __last);
|
|
|
|
for ( ; __first != __last; ++__first)
|
|
__init = __init + *__first;
|
|
return __init;
|
|
}
|
|
|
|
template<typename _InputIterator, typename _Tp, typename _BinaryOperation>
|
|
_Tp
|
|
accumulate(_InputIterator __first, _InputIterator __last, _Tp __init,
|
|
_BinaryOperation __binary_op)
|
|
{
|
|
// concept requirements
|
|
__glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
|
|
__glibcxx_requires_valid_range(__first, __last);
|
|
|
|
for ( ; __first != __last; ++__first)
|
|
__init = __binary_op(__init, *__first);
|
|
return __init;
|
|
}
|
|
|
|
template<typename _InputIterator1, typename _InputIterator2, typename _Tp>
|
|
_Tp
|
|
inner_product(_InputIterator1 __first1, _InputIterator1 __last1,
|
|
_InputIterator2 __first2, _Tp __init)
|
|
{
|
|
// concept requirements
|
|
__glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
|
|
__glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
|
|
__glibcxx_requires_valid_range(__first1, __last1);
|
|
|
|
for ( ; __first1 != __last1; ++__first1, ++__first2)
|
|
__init = __init + (*__first1 * *__first2);
|
|
return __init;
|
|
}
|
|
|
|
template<typename _InputIterator1, typename _InputIterator2, typename _Tp,
|
|
typename _BinaryOperation1, typename _BinaryOperation2>
|
|
_Tp
|
|
inner_product(_InputIterator1 __first1, _InputIterator1 __last1,
|
|
_InputIterator2 __first2, _Tp __init,
|
|
_BinaryOperation1 __binary_op1,
|
|
_BinaryOperation2 __binary_op2)
|
|
{
|
|
// concept requirements
|
|
__glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
|
|
__glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
|
|
__glibcxx_requires_valid_range(__first1, __last1);
|
|
|
|
for ( ; __first1 != __last1; ++__first1, ++__first2)
|
|
__init = __binary_op1(__init, __binary_op2(*__first1, *__first2));
|
|
return __init;
|
|
}
|
|
|
|
template<typename _InputIterator, typename _OutputIterator>
|
|
_OutputIterator
|
|
partial_sum(_InputIterator __first, _InputIterator __last,
|
|
_OutputIterator __result)
|
|
{
|
|
typedef typename iterator_traits<_InputIterator>::value_type _ValueType;
|
|
|
|
// concept requirements
|
|
__glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
|
|
__glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, _ValueType>)
|
|
__glibcxx_requires_valid_range(__first, __last);
|
|
|
|
if (__first == __last) return __result;
|
|
*__result = *__first;
|
|
_ValueType __value = *__first;
|
|
while (++__first != __last) {
|
|
__value = __value + *__first;
|
|
*++__result = __value;
|
|
}
|
|
return ++__result;
|
|
}
|
|
|
|
template<typename _InputIterator, typename _OutputIterator, typename _BinaryOperation>
|
|
_OutputIterator
|
|
partial_sum(_InputIterator __first, _InputIterator __last,
|
|
_OutputIterator __result, _BinaryOperation __binary_op)
|
|
{
|
|
typedef typename iterator_traits<_InputIterator>::value_type _ValueType;
|
|
|
|
// concept requirements
|
|
__glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
|
|
__glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, _ValueType>)
|
|
__glibcxx_requires_valid_range(__first, __last);
|
|
|
|
if (__first == __last) return __result;
|
|
*__result = *__first;
|
|
_ValueType __value = *__first;
|
|
while (++__first != __last) {
|
|
__value = __binary_op(__value, *__first);
|
|
*++__result = __value;
|
|
}
|
|
return ++__result;
|
|
}
|
|
|
|
template<typename _InputIterator, typename _OutputIterator>
|
|
_OutputIterator
|
|
adjacent_difference(_InputIterator __first,
|
|
_InputIterator __last, _OutputIterator __result)
|
|
{
|
|
typedef typename iterator_traits<_InputIterator>::value_type _ValueType;
|
|
|
|
// concept requirements
|
|
__glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
|
|
__glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, _ValueType>)
|
|
__glibcxx_requires_valid_range(__first, __last);
|
|
|
|
if (__first == __last) return __result;
|
|
*__result = *__first;
|
|
_ValueType __value = *__first;
|
|
while (++__first != __last) {
|
|
_ValueType __tmp = *__first;
|
|
*++__result = __tmp - __value;
|
|
__value = __tmp;
|
|
}
|
|
return ++__result;
|
|
}
|
|
|
|
template<typename _InputIterator, typename _OutputIterator, typename _BinaryOperation>
|
|
_OutputIterator
|
|
adjacent_difference(_InputIterator __first, _InputIterator __last,
|
|
_OutputIterator __result, _BinaryOperation __binary_op)
|
|
{
|
|
typedef typename iterator_traits<_InputIterator>::value_type _ValueType;
|
|
|
|
// concept requirements
|
|
__glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)
|
|
__glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, _ValueType>)
|
|
__glibcxx_requires_valid_range(__first, __last);
|
|
|
|
if (__first == __last) return __result;
|
|
*__result = *__first;
|
|
_ValueType __value = *__first;
|
|
while (++__first != __last) {
|
|
_ValueType __tmp = *__first;
|
|
*++__result = __binary_op(__tmp, __value);
|
|
__value = __tmp;
|
|
}
|
|
return ++__result;
|
|
}
|
|
|
|
} // namespace std
|
|
|
|
#endif /* _STL_NUMERIC_H */
|