Gecko [ www.foryou-vip.com ]

Name	Size	Permission	Date
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

Rename

// Numeric functions 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_numeric.h
 *  This is an internal header file, included by other library headers.
 *  Do not attempt to use it directly. @headername{numeric}
 */

#ifndef _STL_NUMERIC_H
#define _STL_NUMERIC_H 1

#include <bits/concept_check.h>
#include <debug/debug.h>
#include <bits/move.h> // For _GLIBCXX_MOVE

#if __cplusplus >= 201103L

namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION

/**
   *  @brief  Create a range of sequentially increasing values.
   *
   *  For each element in the range @p [first,last) assigns @p value and
   *  increments @p value as if by @p ++value.
   *
   *  @param  __first  Start of range.
   *  @param  __last  End of range.
   *  @param  __value  Starting value.
   *  @return  Nothing.
   */
  template<typename _ForwardIterator, typename _Tp>
    void
    iota(_ForwardIterator __first, _ForwardIterator __last, _Tp __value)
    {
      // concept requirements
      __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<
				  _ForwardIterator>)
      __glibcxx_function_requires(_ConvertibleConcept<_Tp,
	    typename iterator_traits<_ForwardIterator>::value_type>)
      __glibcxx_requires_valid_range(__first, __last);

for (; __first != __last; ++__first)
	{
	  *__first = __value;
	  ++__value;
	}
    }

_GLIBCXX_END_NAMESPACE_VERSION
} // namespace std

#endif

namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_ALGO

/**
   *  @brief  Accumulate values in a range.
   *
   *  Accumulates the values in the range [first,last) using operator+().  The
   *  initial value is @a init.  The values are processed in order.
   *
   *  @param  __first  Start of range.
   *  @param  __last  End of range.
   *  @param  __init  Starting value to add other values to.
   *  @return  The final sum.
   */
  template<typename _InputIterator, typename _Tp>
    inline _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;
    }

/**
   *  @brief  Accumulate values in a range with operation.
   *
   *  Accumulates the values in the range [first,last) using the function
   *  object @p __binary_op.  The initial value is @p __init.  The values are
   *  processed in order.
   *
   *  @param  __first  Start of range.
   *  @param  __last  End of range.
   *  @param  __init  Starting value to add other values to.
   *  @param  __binary_op  Function object to accumulate with.
   *  @return  The final sum.
   */
  template<typename _InputIterator, typename _Tp, typename _BinaryOperation>
    inline _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;
    }

/**
   *  @brief  Compute inner product of two ranges.
   *
   *  Starting with an initial value of @p __init, multiplies successive
   *  elements from the two ranges and adds each product into the accumulated
   *  value using operator+().  The values in the ranges are processed in
   *  order.
   *
   *  @param  __first1  Start of range 1.
   *  @param  __last1  End of range 1.
   *  @param  __first2  Start of range 2.
   *  @param  __init  Starting value to add other values to.
   *  @return  The final inner product.
   */
  template<typename _InputIterator1, typename _InputIterator2, typename _Tp>
    inline _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, (void)++__first2)
	__init = __init + (*__first1 * *__first2);
      return __init;
    }

/**
   *  @brief  Compute inner product of two ranges.
   *
   *  Starting with an initial value of @p __init, applies @p __binary_op2 to
   *  successive elements from the two ranges and accumulates each result into
   *  the accumulated value using @p __binary_op1.  The values in the ranges are
   *  processed in order.
   *
   *  @param  __first1  Start of range 1.
   *  @param  __last1  End of range 1.
   *  @param  __first2  Start of range 2.
   *  @param  __init  Starting value to add other values to.
   *  @param  __binary_op1  Function object to accumulate with.
   *  @param  __binary_op2  Function object to apply to pairs of input values.
   *  @return  The final inner product.
   */
  template<typename _InputIterator1, typename _InputIterator2, typename _Tp,
	   typename _BinaryOperation1, typename _BinaryOperation2>
    inline _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, (void)++__first2)
	__init = __binary_op1(__init, __binary_op2(*__first1, *__first2));
      return __init;
    }

/**
   *  @brief  Return list of partial sums
   *
   *  Accumulates the values in the range [first,last) using the @c + operator.
   *  As each successive input value is added into the total, that partial sum
   *  is written to @p __result.  Therefore, the first value in @p __result is
   *  the first value of the input, the second value in @p __result is the sum
   *  of the first and second input values, and so on.
   *
   *  @param  __first  Start of input range.
   *  @param  __last  End of input range.
   *  @param  __result  Output sum.
   *  @return  Iterator pointing just beyond the values written to __result.
   */
  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;
      _ValueType __value = *__first;
      *__result = __value;
      while (++__first != __last)
	{
	  __value = __value + *__first;
	  *++__result = __value;
	}
      return ++__result;
    }

/**
   *  @brief  Return list of partial sums
   *
   *  Accumulates the values in the range [first,last) using @p __binary_op.
   *  As each successive input value is added into the total, that partial sum
   *  is written to @p __result.  Therefore, the first value in @p __result is
   *  the first value of the input, the second value in @p __result is the sum
   *  of the first and second input values, and so on.
   *
   *  @param  __first  Start of input range.
   *  @param  __last  End of input range.
   *  @param  __result  Output sum.
   *  @param  __binary_op  Function object.
   *  @return  Iterator pointing just beyond the values written to __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;

if (__first == __last)
	return __result;
      _ValueType __value = *__first;
      *__result = __value;
      while (++__first != __last)
	{
	  __value = __binary_op(__value, *__first);
	  *++__result = __value;
	}
      return ++__result;
    }

/**
   *  @brief  Return differences between adjacent values.
   *
   *  Computes the difference between adjacent values in the range
   *  [first,last) using operator-() and writes the result to @p __result.
   *
   *  @param  __first  Start of input range.
   *  @param  __last  End of input range.
   *  @param  __result  Output sums.
   *  @return  Iterator pointing just beyond the values written to result.
   *
   *  _GLIBCXX_RESOLVE_LIB_DEFECTS
   *  DR 539. partial_sum and adjacent_difference should mention requirements
   */
  template<typename _InputIterator, typename _OutputIterator>
    _OutputIterator
    adjacent_difference(_InputIterator __first,
			_InputIterator __last, _OutputIterator __result)
    {
      typedef typename iterator_traits<_InputIterator>::value_type _ValueType;

if (__first == __last)
	return __result;
      _ValueType __value = *__first;
      *__result = __value;
      while (++__first != __last)
	{
	  _ValueType __tmp = *__first;
	  *++__result = __tmp - __value;
	  __value = _GLIBCXX_MOVE(__tmp);
	}
      return ++__result;
    }

/**
   *  @brief  Return differences between adjacent values.
   *
   *  Computes the difference between adjacent values in the range
   *  [__first,__last) using the function object @p __binary_op and writes the
   *  result to @p __result.
   *
   *  @param  __first  Start of input range.
   *  @param  __last  End of input range.
   *  @param  __result  Output sum.
   *  @param  __binary_op Function object.
   *  @return  Iterator pointing just beyond the values written to result.
   *
   *  _GLIBCXX_RESOLVE_LIB_DEFECTS
   *  DR 539. partial_sum and adjacent_difference should mention requirements
   */
  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;

if (__first == __last)
	return __result;
      _ValueType __value = *__first;
      *__result = __value;
      while (++__first != __last)
	{
	  _ValueType __tmp = *__first;
	  *++__result = __binary_op(__tmp, __value);
	  __value = _GLIBCXX_MOVE(__tmp);
	}
      return ++__result;
    }

_GLIBCXX_END_NAMESPACE_ALGO
} // namespace std

#endif /* _STL_NUMERIC_H */