<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>libstdc++: numeric Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.4 -->
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">libstdc++</div>
</td>
</tr>
</tbody>
</table>
</div>
</div>
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
initNavTree('a00961.html','');
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">parallel/numeric</div> </div>
</div>
<div class="contents">
<a href="a00961.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// -*- C++ -*-</span>
<a name="l00002"></a>00002
<a name="l00003"></a>00003 <span class="comment">// Copyright (C) 2007, 2008, 2009, 2010 Free Software Foundation, Inc.</span>
<a name="l00004"></a>00004 <span class="comment">//</span>
<a name="l00005"></a>00005 <span class="comment">// This file is part of the GNU ISO C++ Library. This library is free</span>
<a name="l00006"></a>00006 <span class="comment">// software; you can redistribute it and/or modify it under the terms</span>
<a name="l00007"></a>00007 <span class="comment">// of the GNU General Public License as published by the Free Software</span>
<a name="l00008"></a>00008 <span class="comment">// Foundation; either version 3, or (at your option) any later</span>
<a name="l00009"></a>00009 <span class="comment">// version.</span>
<a name="l00010"></a>00010
<a name="l00011"></a>00011 <span class="comment">// This library is distributed in the hope that it will be useful, but</span>
<a name="l00012"></a>00012 <span class="comment">// WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00013"></a>00013 <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU</span>
<a name="l00014"></a>00014 <span class="comment">// General Public License for more details.</span>
<a name="l00015"></a>00015
<a name="l00016"></a>00016 <span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span>
<a name="l00017"></a>00017 <span class="comment">// permissions described in the GCC Runtime Library Exception, version</span>
<a name="l00018"></a>00018 <span class="comment">// 3.1, as published by the Free Software Foundation.</span>
<a name="l00019"></a>00019
<a name="l00020"></a>00020 <span class="comment">// You should have received a copy of the GNU General Public License and</span>
<a name="l00021"></a>00021 <span class="comment">// a copy of the GCC Runtime Library Exception along with this program;</span>
<a name="l00022"></a>00022 <span class="comment">// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</span>
<a name="l00023"></a>00023 <span class="comment">// <http://www.gnu.org/licenses/>.</span>
<a name="l00024"></a>00024 <span class="comment"></span>
<a name="l00025"></a>00025 <span class="comment">/**</span>
<a name="l00026"></a>00026 <span class="comment"> * @file parallel/numeric</span>
<a name="l00027"></a>00027 <span class="comment">*</span>
<a name="l00028"></a>00028 <span class="comment"> * @brief Parallel STL function calls corresponding to stl_numeric.h.</span>
<a name="l00029"></a>00029 <span class="comment"> * The functions defined here mainly do case switches and</span>
<a name="l00030"></a>00030 <span class="comment"> * call the actual parallelized versions in other files.</span>
<a name="l00031"></a>00031 <span class="comment"> * Inlining policy: Functions that basically only contain one function call,</span>
<a name="l00032"></a>00032 <span class="comment"> * are declared inline.</span>
<a name="l00033"></a>00033 <span class="comment"> * This file is a GNU parallel extension to the Standard C++ Library.</span>
<a name="l00034"></a>00034 <span class="comment"> */</span>
<a name="l00035"></a>00035
<a name="l00036"></a>00036 <span class="comment">// Written by Johannes Singler and Felix Putze.</span>
<a name="l00037"></a>00037
<a name="l00038"></a>00038 <span class="preprocessor">#ifndef _GLIBCXX_PARALLEL_NUMERIC_H</span>
<a name="l00039"></a>00039 <span class="preprocessor"></span><span class="preprocessor">#define _GLIBCXX_PARALLEL_NUMERIC_H 1</span>
<a name="l00040"></a>00040 <span class="preprocessor"></span>
<a name="l00041"></a>00041 <span class="preprocessor">#include <numeric></span>
<a name="l00042"></a>00042 <span class="preprocessor">#include <<a class="code" href="a01050.html">bits/stl_function.h</a>></span>
<a name="l00043"></a>00043 <span class="preprocessor">#include <<a class="code" href="a00963.html">parallel/numericfwd.h</a>></span>
<a name="l00044"></a>00044 <span class="preprocessor">#include <<a class="code" href="a00916.html" title="Helper iterator classes for the std::transform() functions. This file is a GNU parallel extension to ...">parallel/iterator.h</a>></span>
<a name="l00045"></a>00045 <span class="preprocessor">#include <<a class="code" href="a00873.html" title="Main interface for embarrassingly parallel functions.">parallel/for_each.h</a>></span>
<a name="l00046"></a>00046 <span class="preprocessor">#include <<a class="code" href="a00874.html" title="Functors representing different tasks to be plugged into the generic parallelization methods for emba...">parallel/for_each_selectors.h</a>></span>
<a name="l00047"></a>00047 <span class="preprocessor">#include <<a class="code" href="a00972.html" title="Parallel implementation of std::partial_sum(), i.e. prefix sums. This file is a GNU parallel extensio...">parallel/partial_sum.h</a>></span>
<a name="l00048"></a>00048
<a name="l00049"></a>00049 <span class="keyword">namespace </span>std _GLIBCXX_VISIBILITY(default)
<a name="l00050"></a>00050 {
<a name="l00051"></a><a class="code" href="a01145.html">00051</a> <span class="keyword">namespace </span>__parallel
<a name="l00052"></a>00052 {
<a name="l00053"></a>00053 <span class="comment">// Sequential fallback.</span>
<a name="l00054"></a>00054 <span class="keyword">template</span><<span class="keyword">typename</span> _IIter, <span class="keyword">typename</span> _Tp>
<a name="l00055"></a>00055 <span class="keyword">inline</span> _Tp
<a name="l00056"></a>00056 accumulate(_IIter __begin, _IIter __end, _Tp __init,
<a name="l00057"></a>00057 <a class="code" href="a00178.html" title="Forces sequential execution at compile time.">__gnu_parallel::sequential_tag</a>)
<a name="l00058"></a>00058 { <span class="keywordflow">return</span> _GLIBCXX_STD_A::accumulate(__begin, __end, __init); }
<a name="l00059"></a>00059
<a name="l00060"></a>00060 <span class="keyword">template</span><<span class="keyword">typename</span> _IIter, <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _BinaryOperation>
<a name="l00061"></a>00061 <span class="keyword">inline</span> _Tp
<a name="l00062"></a>00062 accumulate(_IIter __begin, _IIter __end, _Tp __init,
<a name="l00063"></a>00063 _BinaryOperation __binary_op, <a class="code" href="a00178.html" title="Forces sequential execution at compile time.">__gnu_parallel::sequential_tag</a>)
<a name="l00064"></a>00064 { <span class="keywordflow">return</span> _GLIBCXX_STD_A::accumulate(__begin, __end, __init, __binary_op); }
<a name="l00065"></a>00065
<a name="l00066"></a>00066 <span class="comment">// Sequential fallback for input iterator case.</span>
<a name="l00067"></a>00067 <span class="keyword">template</span><<span class="keyword">typename</span> _IIter, <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _IteratorTag>
<a name="l00068"></a>00068 <span class="keyword">inline</span> _Tp
<a name="l00069"></a>00069 __accumulate_switch(_IIter __begin, _IIter __end,
<a name="l00070"></a>00070 _Tp __init, _IteratorTag)
<a name="l00071"></a>00071 { <span class="keywordflow">return</span> accumulate(__begin, __end, __init,
<a name="l00072"></a>00072 <a class="code" href="a00178.html" title="Forces sequential execution at compile time.">__gnu_parallel::sequential_tag</a>()); }
<a name="l00073"></a>00073
<a name="l00074"></a>00074 <span class="keyword">template</span><<span class="keyword">typename</span> _IIter, <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _BinaryOperation,
<a name="l00075"></a>00075 <span class="keyword">typename</span> _IteratorTag>
<a name="l00076"></a>00076 <span class="keyword">inline</span> _Tp
<a name="l00077"></a>00077 __accumulate_switch(_IIter __begin, _IIter __end, _Tp __init,
<a name="l00078"></a>00078 _BinaryOperation __binary_op, _IteratorTag)
<a name="l00079"></a>00079 { <span class="keywordflow">return</span> accumulate(__begin, __end, __init, __binary_op,
<a name="l00080"></a>00080 <a class="code" href="a00178.html" title="Forces sequential execution at compile time.">__gnu_parallel::sequential_tag</a>()); }
<a name="l00081"></a>00081
<a name="l00082"></a>00082 <span class="comment">// Parallel algorithm for random access iterators.</span>
<a name="l00083"></a>00083 <span class="keyword">template</span><<span class="keyword">typename</span> __RAIter, <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _BinaryOperation>
<a name="l00084"></a>00084 _Tp
<a name="l00085"></a>00085 __accumulate_switch(__RAIter __begin, __RAIter __end,
<a name="l00086"></a>00086 _Tp __init, _BinaryOperation __binary_op,
<a name="l00087"></a>00087 <a class="code" href="a00667.html" title="Random-access iterators support a superset of bidirectional iterator operations.">random_access_iterator_tag</a>,
<a name="l00088"></a>00088 <a class="code" href="a01131.html#a76f6cbf29b1b8d57762cce1ed9bd01a8" title="Run-time equivalents for the compile-time tags.">__gnu_parallel::_Parallelism</a> __parallelism_tag
<a name="l00089"></a>00089 = <a class="code" href="a01131.html#a76f6cbf29b1b8d57762cce1ed9bd01a8ac530f35e669c50e9676af20454e1676f" title="Parallel unbalanced (equal-sized chunks).">__gnu_parallel::parallel_unbalanced</a>)
<a name="l00090"></a>00090 {
<a name="l00091"></a>00091 <span class="keywordflow">if</span> (<a class="code" href="a01029.html#ad816e8f52b933c9300598977cada7d18" title="Determine at compile(?)-time if the parallel variant of an algorithm should be called.">_GLIBCXX_PARALLEL_CONDITION</a>(
<a name="l00092"></a>00092 static_cast<__gnu_parallel::_SequenceIndex>(__end - __begin)
<a name="l00093"></a>00093 >= <a class="code" href="a00158.html#abc4965eacae0b49945ebc887cb11adc1" title="Get the global settings.">__gnu_parallel::_Settings::get</a>().accumulate_minimal_n
<a name="l00094"></a>00094 && __gnu_parallel::__is_parallel(__parallelism_tag)))
<a name="l00095"></a>00095 {
<a name="l00096"></a>00096 _Tp __res = __init;
<a name="l00097"></a>00097 <a class="code" href="a00089.html" title="std::accumulate() selector.">__gnu_parallel::__accumulate_selector<__RAIter></a>
<a name="l00098"></a>00098 __my_selector;
<a name="l00099"></a>00099 <a class="code" href="a01131.html#a0453e79d37dc4bff76695e07d8a72f31" title="Embarrassingly parallel algorithm for random access iterators, using hand-crafted parallelization by ...">__gnu_parallel::</a>
<a name="l00100"></a>00100 <a class="code" href="a01131.html#a0453e79d37dc4bff76695e07d8a72f31" title="Embarrassingly parallel algorithm for random access iterators, using hand-crafted parallelization by ..."> __for_each_template_random_access_ed</a>(__begin, __end,
<a name="l00101"></a>00101 <a class="code" href="a00147.html" title="Functor doing nothing.">__gnu_parallel::_Nothing</a>(),
<a name="l00102"></a>00102 __my_selector,
<a name="l00103"></a>00103 __gnu_parallel::
<a name="l00104"></a>00104 __accumulate_binop_reduct
<a name="l00105"></a>00105 <_BinaryOperation>(__binary_op),
<a name="l00106"></a>00106 __res, __res, -1);
<a name="l00107"></a>00107 <span class="keywordflow">return</span> __res;
<a name="l00108"></a>00108 }
<a name="l00109"></a>00109 <span class="keywordflow">else</span>
<a name="l00110"></a>00110 <span class="keywordflow">return</span> accumulate(__begin, __end, __init, __binary_op,
<a name="l00111"></a>00111 <a class="code" href="a00178.html" title="Forces sequential execution at compile time.">__gnu_parallel::sequential_tag</a>());
<a name="l00112"></a>00112 }
<a name="l00113"></a>00113
<a name="l00114"></a>00114 <span class="comment">// Public interface.</span>
<a name="l00115"></a>00115 <span class="keyword">template</span><<span class="keyword">typename</span> _IIter, <span class="keyword">typename</span> _Tp>
<a name="l00116"></a>00116 <span class="keyword">inline</span> _Tp
<a name="l00117"></a>00117 accumulate(_IIter __begin, _IIter __end, _Tp __init,
<a name="l00118"></a>00118 <a class="code" href="a01131.html#a76f6cbf29b1b8d57762cce1ed9bd01a8" title="Run-time equivalents for the compile-time tags.">__gnu_parallel::_Parallelism</a> __parallelism_tag)
<a name="l00119"></a>00119 {
<a name="l00120"></a>00120 <span class="keyword">typedef</span> std::iterator_traits<_IIter> _IteratorTraits;
<a name="l00121"></a>00121 <span class="keyword">typedef</span> <span class="keyword">typename</span> _IteratorTraits::value_type _ValueType;
<a name="l00122"></a>00122 <span class="keyword">typedef</span> <span class="keyword">typename</span> _IteratorTraits::iterator_category _IteratorCategory;
<a name="l00123"></a>00123
<a name="l00124"></a>00124 <span class="keywordflow">return</span> __accumulate_switch(__begin, __end, __init,
<a name="l00125"></a>00125 <a class="code" href="a00149.html" title="Similar to std::plus, but allows two different types.">__gnu_parallel::_Plus<_Tp, _ValueType></a>(),
<a name="l00126"></a>00126 _IteratorCategory(), __parallelism_tag);
<a name="l00127"></a>00127 }
<a name="l00128"></a>00128
<a name="l00129"></a>00129 <span class="keyword">template</span><<span class="keyword">typename</span> _IIter, <span class="keyword">typename</span> _Tp>
<a name="l00130"></a>00130 <span class="keyword">inline</span> _Tp
<a name="l00131"></a>00131 accumulate(_IIter __begin, _IIter __end, _Tp __init)
<a name="l00132"></a>00132 {
<a name="l00133"></a>00133 <span class="keyword">typedef</span> std::iterator_traits<_IIter> _IteratorTraits;
<a name="l00134"></a>00134 <span class="keyword">typedef</span> <span class="keyword">typename</span> _IteratorTraits::value_type _ValueType;
<a name="l00135"></a>00135 <span class="keyword">typedef</span> <span class="keyword">typename</span> _IteratorTraits::iterator_category _IteratorCategory;
<a name="l00136"></a>00136
<a name="l00137"></a>00137 <span class="keywordflow">return</span> __accumulate_switch(__begin, __end, __init,
<a name="l00138"></a>00138 <a class="code" href="a00149.html" title="Similar to std::plus, but allows two different types.">__gnu_parallel::_Plus<_Tp, _ValueType></a>(),
<a name="l00139"></a>00139 _IteratorCategory());
<a name="l00140"></a>00140 }
<a name="l00141"></a>00141
<a name="l00142"></a>00142 <span class="keyword">template</span><<span class="keyword">typename</span> _IIter, <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _BinaryOperation>
<a name="l00143"></a>00143 <span class="keyword">inline</span> _Tp
<a name="l00144"></a>00144 accumulate(_IIter __begin, _IIter __end, _Tp __init,
<a name="l00145"></a>00145 _BinaryOperation __binary_op,
<a name="l00146"></a>00146 <a class="code" href="a01131.html#a76f6cbf29b1b8d57762cce1ed9bd01a8" title="Run-time equivalents for the compile-time tags.">__gnu_parallel::_Parallelism</a> __parallelism_tag)
<a name="l00147"></a>00147 {
<a name="l00148"></a>00148 <span class="keyword">typedef</span> iterator_traits<_IIter> _IteratorTraits;
<a name="l00149"></a>00149 <span class="keyword">typedef</span> <span class="keyword">typename</span> _IteratorTraits::iterator_category _IteratorCategory;
<a name="l00150"></a>00150 <span class="keywordflow">return</span> __accumulate_switch(__begin, __end, __init, __binary_op,
<a name="l00151"></a>00151 _IteratorCategory(), __parallelism_tag);
<a name="l00152"></a>00152 }
<a name="l00153"></a>00153
<a name="l00154"></a>00154 <span class="keyword">template</span><<span class="keyword">typename</span> _IIter, <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _BinaryOperation>
<a name="l00155"></a>00155 <span class="keyword">inline</span> _Tp
<a name="l00156"></a>00156 accumulate(_IIter __begin, _IIter __end, _Tp __init,
<a name="l00157"></a>00157 _BinaryOperation __binary_op)
<a name="l00158"></a>00158 {
<a name="l00159"></a>00159 <span class="keyword">typedef</span> iterator_traits<_IIter> _IteratorTraits;
<a name="l00160"></a>00160 <span class="keyword">typedef</span> <span class="keyword">typename</span> _IteratorTraits::iterator_category _IteratorCategory;
<a name="l00161"></a>00161 <span class="keywordflow">return</span> __accumulate_switch(__begin, __end, __init, __binary_op,
<a name="l00162"></a>00162 _IteratorCategory());
<a name="l00163"></a>00163 }
<a name="l00164"></a>00164
<a name="l00165"></a>00165
<a name="l00166"></a>00166 <span class="comment">// Sequential fallback.</span>
<a name="l00167"></a>00167 <span class="keyword">template</span><<span class="keyword">typename</span> _IIter1, <span class="keyword">typename</span> _IIter2, <span class="keyword">typename</span> _Tp>
<a name="l00168"></a>00168 <span class="keyword">inline</span> _Tp
<a name="l00169"></a>00169 inner_product(_IIter1 __first1, _IIter1 __last1,
<a name="l00170"></a>00170 _IIter2 __first2, _Tp __init,
<a name="l00171"></a>00171 <a class="code" href="a00178.html" title="Forces sequential execution at compile time.">__gnu_parallel::sequential_tag</a>)
<a name="l00172"></a>00172 { <span class="keywordflow">return</span> _GLIBCXX_STD_A::inner_product(
<a name="l00173"></a>00173 __first1, __last1, __first2, __init); }
<a name="l00174"></a>00174
<a name="l00175"></a>00175 <span class="keyword">template</span><<span class="keyword">typename</span> _IIter1, <span class="keyword">typename</span> _IIter2, <span class="keyword">typename</span> _Tp,
<a name="l00176"></a>00176 <span class="keyword">typename</span> _BinaryFunction1, <span class="keyword">typename</span> _BinaryFunction2>
<a name="l00177"></a>00177 <span class="keyword">inline</span> _Tp
<a name="l00178"></a>00178 inner_product(_IIter1 __first1, _IIter1 __last1,
<a name="l00179"></a>00179 _IIter2 __first2, _Tp __init, _BinaryFunction1 __binary_op1,
<a name="l00180"></a>00180 _BinaryFunction2 __binary_op2,
<a name="l00181"></a>00181 <a class="code" href="a00178.html" title="Forces sequential execution at compile time.">__gnu_parallel::sequential_tag</a>)
<a name="l00182"></a>00182 { <span class="keywordflow">return</span> _GLIBCXX_STD_A::inner_product(__first1, __last1, __first2, __init,
<a name="l00183"></a>00183 __binary_op1, __binary_op2); }
<a name="l00184"></a>00184
<a name="l00185"></a>00185 <span class="comment">// Parallel algorithm for random access iterators.</span>
<a name="l00186"></a>00186 <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter2,
<a name="l00187"></a>00187 <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _BinaryFunction1, <span class="keyword">typename</span> _BinaryFunction2>
<a name="l00188"></a>00188 _Tp
<a name="l00189"></a>00189 __inner_product_switch(_RAIter1 __first1,
<a name="l00190"></a>00190 _RAIter1 __last1,
<a name="l00191"></a>00191 _RAIter2 __first2, _Tp __init,
<a name="l00192"></a>00192 _BinaryFunction1 __binary_op1,
<a name="l00193"></a>00193 _BinaryFunction2 __binary_op2,
<a name="l00194"></a>00194 <a class="code" href="a00667.html" title="Random-access iterators support a superset of bidirectional iterator operations.">random_access_iterator_tag</a>,
<a name="l00195"></a>00195 <a class="code" href="a00667.html" title="Random-access iterators support a superset of bidirectional iterator operations.">random_access_iterator_tag</a>,
<a name="l00196"></a>00196 <a class="code" href="a01131.html#a76f6cbf29b1b8d57762cce1ed9bd01a8" title="Run-time equivalents for the compile-time tags.">__gnu_parallel::_Parallelism</a> __parallelism_tag
<a name="l00197"></a>00197 = <a class="code" href="a01131.html#a76f6cbf29b1b8d57762cce1ed9bd01a8ac530f35e669c50e9676af20454e1676f" title="Parallel unbalanced (equal-sized chunks).">__gnu_parallel::parallel_unbalanced</a>)
<a name="l00198"></a>00198 {
<a name="l00199"></a>00199 <span class="keywordflow">if</span> (<a class="code" href="a01029.html#ad816e8f52b933c9300598977cada7d18" title="Determine at compile(?)-time if the parallel variant of an algorithm should be called.">_GLIBCXX_PARALLEL_CONDITION</a>((__last1 - __first1)
<a name="l00200"></a>00200 >= <a class="code" href="a00158.html#abc4965eacae0b49945ebc887cb11adc1" title="Get the global settings.">__gnu_parallel::_Settings::get</a>().
<a name="l00201"></a>00201 accumulate_minimal_n
<a name="l00202"></a>00202 && __gnu_parallel::
<a name="l00203"></a>00203 __is_parallel(__parallelism_tag)))
<a name="l00204"></a>00204 {
<a name="l00205"></a>00205 _Tp __res = __init;
<a name="l00206"></a>00206 <a class="code" href="a00104.html" title="std::inner_product() selector.">__gnu_parallel::</a>
<a name="l00207"></a>00207 <a class="code" href="a00104.html" title="std::inner_product() selector."> __inner_product_selector</a><_RAIter1,
<a name="l00208"></a>00208 _RAIter2, _Tp> __my_selector(__first1, __first2);
<a name="l00209"></a>00209 <a class="code" href="a01131.html#a0453e79d37dc4bff76695e07d8a72f31" title="Embarrassingly parallel algorithm for random access iterators, using hand-crafted parallelization by ...">__gnu_parallel::</a>
<a name="l00210"></a>00210 <a class="code" href="a01131.html#a0453e79d37dc4bff76695e07d8a72f31" title="Embarrassingly parallel algorithm for random access iterators, using hand-crafted parallelization by ..."> __for_each_template_random_access_ed</a>(
<a name="l00211"></a>00211 __first1, __last1, __binary_op2, __my_selector, __binary_op1,
<a name="l00212"></a>00212 __res, __res, -1);
<a name="l00213"></a>00213 <span class="keywordflow">return</span> __res;
<a name="l00214"></a>00214 }
<a name="l00215"></a>00215 <span class="keywordflow">else</span>
<a name="l00216"></a>00216 <span class="keywordflow">return</span> inner_product(__first1, __last1, __first2, __init,
<a name="l00217"></a>00217 <a class="code" href="a00178.html" title="Forces sequential execution at compile time.">__gnu_parallel::sequential_tag</a>());
<a name="l00218"></a>00218 }
<a name="l00219"></a>00219
<a name="l00220"></a>00220 <span class="comment">// No parallelism for input iterators.</span>
<a name="l00221"></a>00221 <span class="keyword">template</span><<span class="keyword">typename</span> _IIter1, <span class="keyword">typename</span> _IIter2, <span class="keyword">typename</span> _Tp,
<a name="l00222"></a>00222 <span class="keyword">typename</span> _BinaryFunction1, <span class="keyword">typename</span> _BinaryFunction2,
<a name="l00223"></a>00223 <span class="keyword">typename</span> _IteratorTag1, <span class="keyword">typename</span> _IteratorTag2>
<a name="l00224"></a>00224 <span class="keyword">inline</span> _Tp
<a name="l00225"></a>00225 __inner_product_switch(_IIter1 __first1, _IIter1 __last1,
<a name="l00226"></a>00226 _IIter2 __first2, _Tp __init,
<a name="l00227"></a>00227 _BinaryFunction1 __binary_op1,
<a name="l00228"></a>00228 _BinaryFunction2 __binary_op2,
<a name="l00229"></a>00229 _IteratorTag1, _IteratorTag2)
<a name="l00230"></a>00230 { <span class="keywordflow">return</span> inner_product(__first1, __last1, __first2, __init, __binary_op1,
<a name="l00231"></a>00231 __binary_op2, <a class="code" href="a00178.html" title="Forces sequential execution at compile time.">__gnu_parallel::sequential_tag</a>()); }
<a name="l00232"></a>00232
<a name="l00233"></a>00233 <span class="keyword">template</span><<span class="keyword">typename</span> _IIter1, <span class="keyword">typename</span> _IIter2, <span class="keyword">typename</span> _Tp,
<a name="l00234"></a>00234 <span class="keyword">typename</span> _BinaryFunction1, <span class="keyword">typename</span> _BinaryFunction2>
<a name="l00235"></a>00235 <span class="keyword">inline</span> _Tp
<a name="l00236"></a>00236 inner_product(_IIter1 __first1, _IIter1 __last1,
<a name="l00237"></a>00237 _IIter2 __first2, _Tp __init, _BinaryFunction1 __binary_op1,
<a name="l00238"></a>00238 _BinaryFunction2 __binary_op2,
<a name="l00239"></a>00239 <a class="code" href="a01131.html#a76f6cbf29b1b8d57762cce1ed9bd01a8" title="Run-time equivalents for the compile-time tags.">__gnu_parallel::_Parallelism</a> __parallelism_tag)
<a name="l00240"></a>00240 {
<a name="l00241"></a>00241 <span class="keyword">typedef</span> iterator_traits<_IIter1> _TraitsType1;
<a name="l00242"></a>00242 <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType1::iterator_category _IteratorCategory1;
<a name="l00243"></a>00243
<a name="l00244"></a>00244 <span class="keyword">typedef</span> iterator_traits<_IIter2> _TraitsType2;
<a name="l00245"></a>00245 <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType2::iterator_category _IteratorCategory2;
<a name="l00246"></a>00246
<a name="l00247"></a>00247 <span class="keywordflow">return</span> __inner_product_switch(__first1, __last1, __first2, __init,
<a name="l00248"></a>00248 __binary_op1, __binary_op2,
<a name="l00249"></a>00249 _IteratorCategory1(), _IteratorCategory2(),
<a name="l00250"></a>00250 __parallelism_tag);
<a name="l00251"></a>00251 }
<a name="l00252"></a>00252
<a name="l00253"></a>00253 <span class="keyword">template</span><<span class="keyword">typename</span> _IIter1, <span class="keyword">typename</span> _IIter2, <span class="keyword">typename</span> _Tp,
<a name="l00254"></a>00254 <span class="keyword">typename</span> _BinaryFunction1, <span class="keyword">typename</span> _BinaryFunction2>
<a name="l00255"></a>00255 <span class="keyword">inline</span> _Tp
<a name="l00256"></a>00256 inner_product(_IIter1 __first1, _IIter1 __last1,
<a name="l00257"></a>00257 _IIter2 __first2, _Tp __init, _BinaryFunction1 __binary_op1,
<a name="l00258"></a>00258 _BinaryFunction2 __binary_op2)
<a name="l00259"></a>00259 {
<a name="l00260"></a>00260 <span class="keyword">typedef</span> iterator_traits<_IIter1> _TraitsType1;
<a name="l00261"></a>00261 <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType1::iterator_category _IteratorCategory1;
<a name="l00262"></a>00262
<a name="l00263"></a>00263 <span class="keyword">typedef</span> iterator_traits<_IIter2> _TraitsType2;
<a name="l00264"></a>00264 <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType2::iterator_category _IteratorCategory2;
<a name="l00265"></a>00265
<a name="l00266"></a>00266 <span class="keywordflow">return</span> __inner_product_switch(__first1, __last1, __first2, __init,
<a name="l00267"></a>00267 __binary_op1, __binary_op2,
<a name="l00268"></a>00268 _IteratorCategory1(),
<a name="l00269"></a>00269 _IteratorCategory2());
<a name="l00270"></a>00270 }
<a name="l00271"></a>00271
<a name="l00272"></a>00272 <span class="keyword">template</span><<span class="keyword">typename</span> _IIter1, <span class="keyword">typename</span> _IIter2, <span class="keyword">typename</span> _Tp>
<a name="l00273"></a>00273 <span class="keyword">inline</span> _Tp
<a name="l00274"></a>00274 inner_product(_IIter1 __first1, _IIter1 __last1,
<a name="l00275"></a>00275 _IIter2 __first2, _Tp __init,
<a name="l00276"></a>00276 <a class="code" href="a01131.html#a76f6cbf29b1b8d57762cce1ed9bd01a8" title="Run-time equivalents for the compile-time tags.">__gnu_parallel::_Parallelism</a> __parallelism_tag)
<a name="l00277"></a>00277 {
<a name="l00278"></a>00278 <span class="keyword">typedef</span> iterator_traits<_IIter1> _TraitsType1;
<a name="l00279"></a>00279 <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType1::value_type _ValueType1;
<a name="l00280"></a>00280 <span class="keyword">typedef</span> iterator_traits<_IIter2> _TraitsType2;
<a name="l00281"></a>00281 <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType2::value_type _ValueType2;
<a name="l00282"></a>00282
<a name="l00283"></a>00283 <span class="keyword">typedef</span> <span class="keyword">typename</span>
<a name="l00284"></a>00284 <a class="code" href="a00254.html#a5fe0082d5851e1be6383ad8d8493264e" title="result_type is the return type">__gnu_parallel::_Multiplies<_ValueType1, _ValueType2>::result_type</a>
<a name="l00285"></a>00285 _MultipliesResultType;
<a name="l00286"></a>00286 <span class="keywordflow">return</span> __gnu_parallel::inner_product(__first1, __last1, __first2, __init,
<a name="l00287"></a>00287 <a class="code" href="a00149.html" title="Similar to std::plus, but allows two different types.">__gnu_parallel::_Plus<_Tp, _MultipliesResultType></a>(),
<a name="l00288"></a>00288 __gnu_parallel::
<a name="l00289"></a>00289 _Multiplies<_ValueType1, _ValueType2>(),
<a name="l00290"></a>00290 __parallelism_tag);
<a name="l00291"></a>00291 }
<a name="l00292"></a>00292
<a name="l00293"></a>00293 <span class="keyword">template</span><<span class="keyword">typename</span> _IIter1, <span class="keyword">typename</span> _IIter2, <span class="keyword">typename</span> _Tp>
<a name="l00294"></a>00294 <span class="keyword">inline</span> _Tp
<a name="l00295"></a>00295 inner_product(_IIter1 __first1, _IIter1 __last1,
<a name="l00296"></a>00296 _IIter2 __first2, _Tp __init)
<a name="l00297"></a>00297 {
<a name="l00298"></a>00298 <span class="keyword">typedef</span> iterator_traits<_IIter1> _TraitsType1;
<a name="l00299"></a>00299 <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType1::value_type _ValueType1;
<a name="l00300"></a>00300 <span class="keyword">typedef</span> iterator_traits<_IIter2> _TraitsType2;
<a name="l00301"></a>00301 <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType2::value_type _ValueType2;
<a name="l00302"></a>00302
<a name="l00303"></a>00303 <span class="keyword">typedef</span> <span class="keyword">typename</span>
<a name="l00304"></a>00304 <a class="code" href="a00254.html#a5fe0082d5851e1be6383ad8d8493264e" title="result_type is the return type">__gnu_parallel::_Multiplies<_ValueType1, _ValueType2>::result_type</a>
<a name="l00305"></a>00305 _MultipliesResultType;
<a name="l00306"></a>00306 <span class="keywordflow">return</span> __gnu_parallel::inner_product(__first1, __last1, __first2, __init,
<a name="l00307"></a>00307 <a class="code" href="a00149.html" title="Similar to std::plus, but allows two different types.">__gnu_parallel::_Plus<_Tp, _MultipliesResultType></a>(),
<a name="l00308"></a>00308 __gnu_parallel::
<a name="l00309"></a>00309 _Multiplies<_ValueType1, _ValueType2>());
<a name="l00310"></a>00310 }
<a name="l00311"></a>00311
<a name="l00312"></a>00312 <span class="comment">// Sequential fallback.</span>
<a name="l00313"></a>00313 <span class="keyword">template</span><<span class="keyword">typename</span> _IIter, <span class="keyword">typename</span> _OutputIterator>
<a name="l00314"></a>00314 <span class="keyword">inline</span> _OutputIterator
<a name="l00315"></a>00315 partial_sum(_IIter __begin, _IIter __end, _OutputIterator __result,
<a name="l00316"></a>00316 <a class="code" href="a00178.html" title="Forces sequential execution at compile time.">__gnu_parallel::sequential_tag</a>)
<a name="l00317"></a>00317 { <span class="keywordflow">return</span> _GLIBCXX_STD_A::partial_sum(__begin, __end, __result); }
<a name="l00318"></a>00318
<a name="l00319"></a>00319 <span class="comment">// Sequential fallback.</span>
<a name="l00320"></a>00320 <span class="keyword">template</span><<span class="keyword">typename</span> _IIter, <span class="keyword">typename</span> _OutputIterator,
<a name="l00321"></a>00321 <span class="keyword">typename</span> _BinaryOperation>
<a name="l00322"></a>00322 <span class="keyword">inline</span> _OutputIterator
<a name="l00323"></a>00323 partial_sum(_IIter __begin, _IIter __end, _OutputIterator __result,
<a name="l00324"></a>00324 _BinaryOperation __bin_op, <a class="code" href="a00178.html" title="Forces sequential execution at compile time.">__gnu_parallel::sequential_tag</a>)
<a name="l00325"></a>00325 { <span class="keywordflow">return</span> _GLIBCXX_STD_A::partial_sum(__begin, __end, __result, __bin_op); }
<a name="l00326"></a>00326
<a name="l00327"></a>00327 <span class="comment">// Sequential fallback for input iterator case.</span>
<a name="l00328"></a>00328 <span class="keyword">template</span><<span class="keyword">typename</span> _IIter, <span class="keyword">typename</span> _OutputIterator,
<a name="l00329"></a>00329 <span class="keyword">typename</span> _BinaryOperation, <span class="keyword">typename</span> _IteratorTag1,
<a name="l00330"></a>00330 <span class="keyword">typename</span> _IteratorTag2>
<a name="l00331"></a>00331 <span class="keyword">inline</span> _OutputIterator
<a name="l00332"></a>00332 __partial_sum_switch(_IIter __begin, _IIter __end,
<a name="l00333"></a>00333 _OutputIterator __result, _BinaryOperation __bin_op,
<a name="l00334"></a>00334 _IteratorTag1, _IteratorTag2)
<a name="l00335"></a>00335 { <span class="keywordflow">return</span> _GLIBCXX_STD_A::partial_sum(__begin, __end, __result, __bin_op); }
<a name="l00336"></a>00336
<a name="l00337"></a>00337 <span class="comment">// Parallel algorithm for random access iterators.</span>
<a name="l00338"></a>00338 <span class="keyword">template</span><<span class="keyword">typename</span> _IIter, <span class="keyword">typename</span> _OutputIterator,
<a name="l00339"></a>00339 <span class="keyword">typename</span> _BinaryOperation>
<a name="l00340"></a>00340 _OutputIterator
<a name="l00341"></a>00341 __partial_sum_switch(_IIter __begin, _IIter __end,
<a name="l00342"></a>00342 _OutputIterator __result, _BinaryOperation __bin_op,
<a name="l00343"></a>00343 <a class="code" href="a00667.html" title="Random-access iterators support a superset of bidirectional iterator operations.">random_access_iterator_tag</a>,
<a name="l00344"></a>00344 <a class="code" href="a00667.html" title="Random-access iterators support a superset of bidirectional iterator operations.">random_access_iterator_tag</a>)
<a name="l00345"></a>00345 {
<a name="l00346"></a>00346 <span class="keywordflow">if</span> (<a class="code" href="a01029.html#ad816e8f52b933c9300598977cada7d18" title="Determine at compile(?)-time if the parallel variant of an algorithm should be called.">_GLIBCXX_PARALLEL_CONDITION</a>(
<a name="l00347"></a>00347 static_cast<__gnu_parallel::_SequenceIndex>(__end - __begin)
<a name="l00348"></a>00348 >= <a class="code" href="a00158.html#abc4965eacae0b49945ebc887cb11adc1" title="Get the global settings.">__gnu_parallel::_Settings::get</a>().partial_sum_minimal_n))
<a name="l00349"></a>00349 <span class="keywordflow">return</span> <a class="code" href="a01131.html#a1f850caaaf56329ce3b9a358cf6a0cc6" title="Parallel partial sum front-__end.">__gnu_parallel::__parallel_partial_sum</a>(__begin, __end,
<a name="l00350"></a>00350 __result, __bin_op);
<a name="l00351"></a>00351 <span class="keywordflow">else</span>
<a name="l00352"></a>00352 <span class="keywordflow">return</span> partial_sum(__begin, __end, __result, __bin_op,
<a name="l00353"></a>00353 <a class="code" href="a00178.html" title="Forces sequential execution at compile time.">__gnu_parallel::sequential_tag</a>());
<a name="l00354"></a>00354 }
<a name="l00355"></a>00355
<a name="l00356"></a>00356 <span class="comment">// Public interface.</span>
<a name="l00357"></a>00357 <span class="keyword">template</span><<span class="keyword">typename</span> _IIter, <span class="keyword">typename</span> _OutputIterator>
<a name="l00358"></a>00358 <span class="keyword">inline</span> _OutputIterator
<a name="l00359"></a>00359 partial_sum(_IIter __begin, _IIter __end, _OutputIterator __result)
<a name="l00360"></a>00360 {
<a name="l00361"></a>00361 <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_IIter>::value_type _ValueType;
<a name="l00362"></a>00362 <span class="keywordflow">return</span> __gnu_parallel::partial_sum(__begin, __end,
<a name="l00363"></a>00363 __result, <a class="code" href="a00657.html" title="One of the math functors.">std::plus<_ValueType></a>());
<a name="l00364"></a>00364 }
<a name="l00365"></a>00365
<a name="l00366"></a>00366 <span class="comment">// Public interface</span>
<a name="l00367"></a>00367 <span class="keyword">template</span><<span class="keyword">typename</span> _IIter, <span class="keyword">typename</span> _OutputIterator,
<a name="l00368"></a>00368 <span class="keyword">typename</span> _BinaryOperation>
<a name="l00369"></a>00369 <span class="keyword">inline</span> _OutputIterator
<a name="l00370"></a>00370 partial_sum(_IIter __begin, _IIter __end, _OutputIterator __result,
<a name="l00371"></a>00371 _BinaryOperation __binary_op)
<a name="l00372"></a>00372 {
<a name="l00373"></a>00373 <span class="keyword">typedef</span> iterator_traits<_IIter> _ITraitsType;
<a name="l00374"></a>00374 <span class="keyword">typedef</span> <span class="keyword">typename</span> _ITraitsType::iterator_category _IIteratorCategory;
<a name="l00375"></a>00375
<a name="l00376"></a>00376 <span class="keyword">typedef</span> iterator_traits<_OutputIterator> _OTraitsType;
<a name="l00377"></a>00377 <span class="keyword">typedef</span> <span class="keyword">typename</span> _OTraitsType::iterator_category _OIterCategory;
<a name="l00378"></a>00378
<a name="l00379"></a>00379 <span class="keywordflow">return</span> __partial_sum_switch(__begin, __end, __result, __binary_op,
<a name="l00380"></a>00380 _IIteratorCategory(), _OIterCategory());
<a name="l00381"></a>00381 }
<a name="l00382"></a>00382
<a name="l00383"></a>00383 <span class="comment">// Sequential fallback.</span>
<a name="l00384"></a>00384 <span class="keyword">template</span><<span class="keyword">typename</span> _IIter, <span class="keyword">typename</span> _OutputIterator>
<a name="l00385"></a>00385 <span class="keyword">inline</span> _OutputIterator
<a name="l00386"></a>00386 adjacent_difference(_IIter __begin, _IIter __end, _OutputIterator __result,
<a name="l00387"></a>00387 <a class="code" href="a00178.html" title="Forces sequential execution at compile time.">__gnu_parallel::sequential_tag</a>)
<a name="l00388"></a>00388 { <span class="keywordflow">return</span> _GLIBCXX_STD_A::adjacent_difference(__begin, __end, __result); }
<a name="l00389"></a>00389
<a name="l00390"></a>00390 <span class="comment">// Sequential fallback.</span>
<a name="l00391"></a>00391 <span class="keyword">template</span><<span class="keyword">typename</span> _IIter, <span class="keyword">typename</span> _OutputIterator,
<a name="l00392"></a>00392 <span class="keyword">typename</span> _BinaryOperation>
<a name="l00393"></a>00393 <span class="keyword">inline</span> _OutputIterator
<a name="l00394"></a>00394 adjacent_difference(_IIter __begin, _IIter __end,
<a name="l00395"></a>00395 _OutputIterator __result, _BinaryOperation __bin_op,
<a name="l00396"></a>00396 <a class="code" href="a00178.html" title="Forces sequential execution at compile time.">__gnu_parallel::sequential_tag</a>)
<a name="l00397"></a>00397 { <span class="keywordflow">return</span> _GLIBCXX_STD_A::adjacent_difference(__begin, __end,
<a name="l00398"></a>00398 __result, __bin_op); }
<a name="l00399"></a>00399
<a name="l00400"></a>00400 <span class="comment">// Sequential fallback for input iterator case.</span>
<a name="l00401"></a>00401 <span class="keyword">template</span><<span class="keyword">typename</span> _IIter, <span class="keyword">typename</span> _OutputIterator,
<a name="l00402"></a>00402 <span class="keyword">typename</span> _BinaryOperation, <span class="keyword">typename</span> _IteratorTag1,
<a name="l00403"></a>00403 <span class="keyword">typename</span> _IteratorTag2>
<a name="l00404"></a>00404 <span class="keyword">inline</span> _OutputIterator
<a name="l00405"></a>00405 __adjacent_difference_switch(_IIter __begin, _IIter __end,
<a name="l00406"></a>00406 _OutputIterator __result,
<a name="l00407"></a>00407 _BinaryOperation __bin_op, _IteratorTag1,
<a name="l00408"></a>00408 _IteratorTag2)
<a name="l00409"></a>00409 { <span class="keywordflow">return</span> adjacent_difference(__begin, __end, __result, __bin_op,
<a name="l00410"></a>00410 <a class="code" href="a00178.html" title="Forces sequential execution at compile time.">__gnu_parallel::sequential_tag</a>()); }
<a name="l00411"></a>00411
<a name="l00412"></a>00412 <span class="comment">// Parallel algorithm for random access iterators.</span>
<a name="l00413"></a>00413 <span class="keyword">template</span><<span class="keyword">typename</span> _IIter, <span class="keyword">typename</span> _OutputIterator,
<a name="l00414"></a>00414 <span class="keyword">typename</span> _BinaryOperation>
<a name="l00415"></a>00415 _OutputIterator
<a name="l00416"></a>00416 __adjacent_difference_switch(_IIter __begin, _IIter __end,
<a name="l00417"></a>00417 _OutputIterator __result,
<a name="l00418"></a>00418 _BinaryOperation __bin_op,
<a name="l00419"></a>00419 <a class="code" href="a00667.html" title="Random-access iterators support a superset of bidirectional iterator operations.">random_access_iterator_tag</a>,
<a name="l00420"></a>00420 <a class="code" href="a00667.html" title="Random-access iterators support a superset of bidirectional iterator operations.">random_access_iterator_tag</a>,
<a name="l00421"></a>00421 <a class="code" href="a01131.html#a76f6cbf29b1b8d57762cce1ed9bd01a8" title="Run-time equivalents for the compile-time tags.">__gnu_parallel::_Parallelism</a>
<a name="l00422"></a>00422 __parallelism_tag
<a name="l00423"></a>00423 = <a class="code" href="a01131.html#a76f6cbf29b1b8d57762cce1ed9bd01a8a44044e5486122945728060ea6de7d32c" title="Parallel balanced (work-stealing).">__gnu_parallel::parallel_balanced</a>)
<a name="l00424"></a>00424 {
<a name="l00425"></a>00425 <span class="keywordflow">if</span> (<a class="code" href="a01029.html#ad816e8f52b933c9300598977cada7d18" title="Determine at compile(?)-time if the parallel variant of an algorithm should be called.">_GLIBCXX_PARALLEL_CONDITION</a>(
<a name="l00426"></a>00426 static_cast<__gnu_parallel::_SequenceIndex>(__end - __begin)
<a name="l00427"></a>00427 >= <a class="code" href="a00158.html#abc4965eacae0b49945ebc887cb11adc1" title="Get the global settings.">__gnu_parallel::_Settings::get</a>().adjacent_difference_minimal_n
<a name="l00428"></a>00428 && __gnu_parallel::__is_parallel(__parallelism_tag)))
<a name="l00429"></a>00429 {
<a name="l00430"></a>00430 <span class="keywordtype">bool</span> __dummy = <span class="keyword">true</span>;
<a name="l00431"></a>00431 <span class="keyword">typedef</span> <a class="code" href="a00125.html" title="A pair of iterators. The usual iterator operations are applied to both child iterators.">__gnu_parallel::_IteratorPair</a><_IIter, _OutputIterator,
<a name="l00432"></a>00432 <a class="code" href="a00667.html" title="Random-access iterators support a superset of bidirectional iterator operations.">random_access_iterator_tag</a>> _ItTrip;
<a name="l00433"></a>00433 *__result = *__begin;
<a name="l00434"></a>00434 _ItTrip __begin_pair(__begin + 1, __result + 1),
<a name="l00435"></a>00435 __end_pair(__end, __result + (__end - __begin));
<a name="l00436"></a>00436 <a class="code" href="a00090.html" title="Selector that returns the difference between two adjacent __elements.">__gnu_parallel::__adjacent_difference_selector<_ItTrip></a>
<a name="l00437"></a>00437 __functionality;
<a name="l00438"></a>00438 <a class="code" href="a01131.html#a0453e79d37dc4bff76695e07d8a72f31" title="Embarrassingly parallel algorithm for random access iterators, using hand-crafted parallelization by ...">__gnu_parallel::</a>
<a name="l00439"></a>00439 <a class="code" href="a01131.html#a0453e79d37dc4bff76695e07d8a72f31" title="Embarrassingly parallel algorithm for random access iterators, using hand-crafted parallelization by ..."> __for_each_template_random_access_ed</a>(
<a name="l00440"></a>00440 __begin_pair, __end_pair, __bin_op, __functionality,
<a name="l00441"></a>00441 <a class="code" href="a00121.html" title="Reduction function doing nothing.">__gnu_parallel::_DummyReduct</a>(), __dummy, __dummy, -1);
<a name="l00442"></a>00442 <span class="keywordflow">return</span> __functionality.<a class="code" href="a00102.html#a3b43c6fa8f1aa9bf6a3506102d0755c9" title="_Iterator on last element processed; needed for some algorithms (e. g. std::transform()).">_M_finish_iterator</a>;
<a name="l00443"></a>00443 }
<a name="l00444"></a>00444 <span class="keywordflow">else</span>
<a name="l00445"></a>00445 <span class="keywordflow">return</span> adjacent_difference(__begin, __end, __result, __bin_op,
<a name="l00446"></a>00446 <a class="code" href="a00178.html" title="Forces sequential execution at compile time.">__gnu_parallel::sequential_tag</a>());
<a name="l00447"></a>00447 }
<a name="l00448"></a>00448
<a name="l00449"></a>00449 <span class="comment">// Public interface.</span>
<a name="l00450"></a>00450 <span class="keyword">template</span><<span class="keyword">typename</span> _IIter, <span class="keyword">typename</span> _OutputIterator>
<a name="l00451"></a>00451 <span class="keyword">inline</span> _OutputIterator
<a name="l00452"></a>00452 adjacent_difference(_IIter __begin, _IIter __end,
<a name="l00453"></a>00453 _OutputIterator __result,
<a name="l00454"></a>00454 <a class="code" href="a01131.html#a76f6cbf29b1b8d57762cce1ed9bd01a8" title="Run-time equivalents for the compile-time tags.">__gnu_parallel::_Parallelism</a> __parallelism_tag)
<a name="l00455"></a>00455 {
<a name="l00456"></a>00456 <span class="keyword">typedef</span> iterator_traits<_IIter> _TraitsType;
<a name="l00457"></a>00457 <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::value_type _ValueType;
<a name="l00458"></a>00458 <span class="keywordflow">return</span> adjacent_difference(__begin, __end, __result,
<a name="l00459"></a>00459 <a class="code" href="a00602.html" title="One of the math functors.">std::minus<_ValueType></a>(),
<a name="l00460"></a>00460 __parallelism_tag);
<a name="l00461"></a>00461 }
<a name="l00462"></a>00462
<a name="l00463"></a>00463 <span class="keyword">template</span><<span class="keyword">typename</span> _IIter, <span class="keyword">typename</span> _OutputIterator>
<a name="l00464"></a>00464 <span class="keyword">inline</span> _OutputIterator
<a name="l00465"></a>00465 adjacent_difference(_IIter __begin, _IIter __end,
<a name="l00466"></a>00466 _OutputIterator __result)
<a name="l00467"></a>00467 {
<a name="l00468"></a>00468 <span class="keyword">typedef</span> iterator_traits<_IIter> _TraitsType;
<a name="l00469"></a>00469 <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::value_type _ValueType;
<a name="l00470"></a>00470 <span class="keywordflow">return</span> adjacent_difference(__begin, __end, __result,
<a name="l00471"></a>00471 <a class="code" href="a00602.html" title="One of the math functors.">std::minus<_ValueType></a>());
<a name="l00472"></a>00472 }
<a name="l00473"></a>00473
<a name="l00474"></a>00474 <span class="keyword">template</span><<span class="keyword">typename</span> _IIter, <span class="keyword">typename</span> _OutputIterator,
<a name="l00475"></a>00475 <span class="keyword">typename</span> _BinaryOperation>
<a name="l00476"></a>00476 <span class="keyword">inline</span> _OutputIterator
<a name="l00477"></a>00477 adjacent_difference(_IIter __begin, _IIter __end,
<a name="l00478"></a>00478 _OutputIterator __result, _BinaryOperation __binary_op,
<a name="l00479"></a>00479 <a class="code" href="a01131.html#a76f6cbf29b1b8d57762cce1ed9bd01a8" title="Run-time equivalents for the compile-time tags.">__gnu_parallel::_Parallelism</a> __parallelism_tag)
<a name="l00480"></a>00480 {
<a name="l00481"></a>00481 <span class="keyword">typedef</span> iterator_traits<_IIter> _ITraitsType;
<a name="l00482"></a>00482 <span class="keyword">typedef</span> <span class="keyword">typename</span> _ITraitsType::iterator_category _IIteratorCategory;
<a name="l00483"></a>00483
<a name="l00484"></a>00484 <span class="keyword">typedef</span> iterator_traits<_OutputIterator> _OTraitsType;
<a name="l00485"></a>00485 <span class="keyword">typedef</span> <span class="keyword">typename</span> _OTraitsType::iterator_category _OIterCategory;
<a name="l00486"></a>00486
<a name="l00487"></a>00487 <span class="keywordflow">return</span> __adjacent_difference_switch(__begin, __end, __result,
<a name="l00488"></a>00488 __binary_op,
<a name="l00489"></a>00489 _IIteratorCategory(),
<a name="l00490"></a>00490 _OIterCategory(),
<a name="l00491"></a>00491 __parallelism_tag);
<a name="l00492"></a>00492 }
<a name="l00493"></a>00493
<a name="l00494"></a>00494 <span class="keyword">template</span><<span class="keyword">typename</span> _IIter, <span class="keyword">typename</span> _OutputIterator,
<a name="l00495"></a>00495 <span class="keyword">typename</span> _BinaryOperation>
<a name="l00496"></a>00496 <span class="keyword">inline</span> _OutputIterator
<a name="l00497"></a>00497 adjacent_difference(_IIter __begin, _IIter __end,
<a name="l00498"></a>00498 _OutputIterator __result, _BinaryOperation __binary_op)
<a name="l00499"></a>00499 {
<a name="l00500"></a>00500 <span class="keyword">typedef</span> iterator_traits<_IIter> _ITraitsType;
<a name="l00501"></a>00501 <span class="keyword">typedef</span> <span class="keyword">typename</span> _ITraitsType::iterator_category _IIteratorCategory;
<a name="l00502"></a>00502
<a name="l00503"></a>00503 <span class="keyword">typedef</span> iterator_traits<_OutputIterator> _OTraitsType;
<a name="l00504"></a>00504 <span class="keyword">typedef</span> <span class="keyword">typename</span> _OTraitsType::iterator_category _OIterCategory;
<a name="l00505"></a>00505
<a name="l00506"></a>00506 <span class="keywordflow">return</span> __adjacent_difference_switch(__begin, __end, __result,
<a name="l00507"></a>00507 __binary_op,
<a name="l00508"></a>00508 _IIteratorCategory(),
<a name="l00509"></a>00509 _OIterCategory());
<a name="l00510"></a>00510 }
<a name="l00511"></a>00511 } <span class="comment">// end namespace</span>
<a name="l00512"></a>00512 } <span class="comment">// end namespace</span>
<a name="l00513"></a>00513
<a name="l00514"></a>00514 <span class="preprocessor">#endif </span><span class="comment">/* _GLIBCXX_NUMERIC_H */</span>
</pre></div></div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="a00961.html">numeric</a> </li>
<li class="footer">Generated by 
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.4 </li>
</ul>
</div>
</body>
</html>
