<!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++: find_selectors.h 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('a00872.html','');
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">find_selectors.h</div> </div>
</div>
<div class="contents">
<a href="a00872.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 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">/** @file parallel/find_selectors.h</span>
<a name="l00026"></a>00026 <span class="comment"> * @brief _Function objects representing different tasks to be plugged</span>
<a name="l00027"></a>00027 <span class="comment"> * into the parallel find algorithm.</span>
<a name="l00028"></a>00028 <span class="comment"> * This file is a GNU parallel extension to the Standard C++ Library.</span>
<a name="l00029"></a>00029 <span class="comment"> */</span>
<a name="l00030"></a>00030
<a name="l00031"></a>00031 <span class="comment">// Written by Felix Putze.</span>
<a name="l00032"></a>00032
<a name="l00033"></a>00033 <span class="preprocessor">#ifndef _GLIBCXX_PARALLEL_FIND_SELECTORS_H</span>
<a name="l00034"></a>00034 <span class="preprocessor"></span><span class="preprocessor">#define _GLIBCXX_PARALLEL_FIND_SELECTORS_H 1</span>
<a name="l00035"></a>00035 <span class="preprocessor"></span>
<a name="l00036"></a>00036 <span class="preprocessor">#include <<a class="code" href="a01081.html" title="Tags for compile-time selection. This file is a GNU parallel extension to the Standard C++ Library...">parallel/tags.h</a>></span>
<a name="l00037"></a>00037 <span class="preprocessor">#include <<a class="code" href="a00769.html" title="Includes the original header files concerned with iterators except for stream iterators. This file is a GNU parallel extension to the Standard C++ Library.">parallel/basic_iterator.h</a>></span>
<a name="l00038"></a>00038 <span class="preprocessor">#include <<a class="code" href="a01060.html">bits/stl_pair.h</a>></span>
<a name="l00039"></a>00039
<a name="l00040"></a>00040 <span class="keyword">namespace </span>__gnu_parallel
<a name="l00041"></a>00041 {<span class="comment"></span>
<a name="l00042"></a>00042 <span class="comment"> /** @brief Base class of all __gnu_parallel::__find_template selectors. */</span>
<a name="l00043"></a><a class="code" href="a00101.html">00043</a> <span class="keyword">struct </span><a class="code" href="a00101.html" title="Base class of all __gnu_parallel::__find_template selectors.">__generic_find_selector</a>
<a name="l00044"></a>00044 { };
<a name="l00045"></a>00045 <span class="comment"></span>
<a name="l00046"></a>00046 <span class="comment"> /** </span>
<a name="l00047"></a>00047 <span class="comment"> * @brief Test predicate on a single element, used for std::find()</span>
<a name="l00048"></a>00048 <span class="comment"> * and std::find_if ().</span>
<a name="l00049"></a>00049 <span class="comment"> */</span>
<a name="l00050"></a><a class="code" href="a00098.html">00050</a> <span class="keyword">struct </span><a class="code" href="a00098.html" title="Test predicate on a single element, used for std::find() and std::find_if ().">__find_if_selector</a> : <span class="keyword">public</span> <a class="code" href="a00101.html" title="Base class of all __gnu_parallel::__find_template selectors.">__generic_find_selector</a>
<a name="l00051"></a>00051 {<span class="comment"></span>
<a name="l00052"></a>00052 <span class="comment"> /** @brief Test on one position.</span>
<a name="l00053"></a>00053 <span class="comment"> * @param __i1 _Iterator on first sequence.</span>
<a name="l00054"></a>00054 <span class="comment"> * @param __i2 _Iterator on second sequence (unused).</span>
<a name="l00055"></a>00055 <span class="comment"> * @param __pred Find predicate.</span>
<a name="l00056"></a>00056 <span class="comment"> */</span>
<a name="l00057"></a>00057 <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter2,
<a name="l00058"></a>00058 <span class="keyword">typename</span> _Pred>
<a name="l00059"></a>00059 <span class="keywordtype">bool</span>
<a name="l00060"></a><a class="code" href="a00098.html#a21cc46960e1c2705741f83c1ce254831">00060</a> <a class="code" href="a00098.html#a21cc46960e1c2705741f83c1ce254831" title="Test on one position.">operator()</a>(_RAIter1 __i1, _RAIter2 __i2, _Pred __pred)
<a name="l00061"></a>00061 { <span class="keywordflow">return</span> __pred(*__i1); }
<a name="l00062"></a>00062 <span class="comment"></span>
<a name="l00063"></a>00063 <span class="comment"> /** @brief Corresponding sequential algorithm on a sequence.</span>
<a name="l00064"></a>00064 <span class="comment"> * @param __begin1 Begin iterator of first sequence.</span>
<a name="l00065"></a>00065 <span class="comment"> * @param __end1 End iterator of first sequence.</span>
<a name="l00066"></a>00066 <span class="comment"> * @param __begin2 Begin iterator of second sequence.</span>
<a name="l00067"></a>00067 <span class="comment"> * @param __pred Find predicate.</span>
<a name="l00068"></a>00068 <span class="comment"> */</span>
<a name="l00069"></a>00069 <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter2,
<a name="l00070"></a>00070 <span class="keyword">typename</span> _Pred>
<a name="l00071"></a>00071 <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">std::pair<_RAIter1, _RAIter2></a>
<a name="l00072"></a><a class="code" href="a00098.html#ac30e3d444e30e0311ab7c190222f6947">00072</a> <a class="code" href="a00098.html#ac30e3d444e30e0311ab7c190222f6947" title="Corresponding sequential algorithm on a sequence.">_M_sequential_algorithm</a>(_RAIter1 __begin1,
<a name="l00073"></a>00073 _RAIter1 __end1,
<a name="l00074"></a>00074 _RAIter2 __begin2, _Pred __pred)
<a name="l00075"></a>00075 { <span class="keywordflow">return</span> <a class="code" href="a01137.html#a9345a6e2e39831b4291cac2e52a15792" title="A convenience wrapper for creating a pair from two objects.">std::make_pair</a>(find_if(__begin1, __end1, __pred,
<a name="l00076"></a>00076 <a class="code" href="a00178.html" title="Forces sequential execution at compile time.">sequential_tag</a>()), __begin2); }
<a name="l00077"></a>00077 };
<a name="l00078"></a>00078 <span class="comment"></span>
<a name="l00079"></a>00079 <span class="comment"> /** @brief Test predicate on two adjacent elements. */</span>
<a name="l00080"></a><a class="code" href="a00091.html">00080</a> <span class="keyword">struct </span><a class="code" href="a00091.html" title="Test predicate on two adjacent elements.">__adjacent_find_selector</a> : <span class="keyword">public</span> <a class="code" href="a00101.html" title="Base class of all __gnu_parallel::__find_template selectors.">__generic_find_selector</a>
<a name="l00081"></a>00081 {<span class="comment"></span>
<a name="l00082"></a>00082 <span class="comment"> /** @brief Test on one position.</span>
<a name="l00083"></a>00083 <span class="comment"> * @param __i1 _Iterator on first sequence.</span>
<a name="l00084"></a>00084 <span class="comment"> * @param __i2 _Iterator on second sequence (unused).</span>
<a name="l00085"></a>00085 <span class="comment"> * @param __pred Find predicate.</span>
<a name="l00086"></a>00086 <span class="comment"> */</span>
<a name="l00087"></a>00087 <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter2,
<a name="l00088"></a>00088 <span class="keyword">typename</span> _Pred>
<a name="l00089"></a>00089 <span class="keywordtype">bool</span>
<a name="l00090"></a><a class="code" href="a00091.html#a1df0ff50ba0aa9152c2ba5ed6e8314d6">00090</a> <a class="code" href="a00091.html#a1df0ff50ba0aa9152c2ba5ed6e8314d6" title="Test on one position.">operator()</a>(_RAIter1 __i1, _RAIter2 __i2, _Pred __pred)
<a name="l00091"></a>00091 {
<a name="l00092"></a>00092 <span class="comment">// Passed end iterator is one short.</span>
<a name="l00093"></a>00093 <span class="keywordflow">return</span> __pred(*__i1, *(__i1 + 1));
<a name="l00094"></a>00094 }
<a name="l00095"></a>00095 <span class="comment"></span>
<a name="l00096"></a>00096 <span class="comment"> /** @brief Corresponding sequential algorithm on a sequence.</span>
<a name="l00097"></a>00097 <span class="comment"> * @param __begin1 Begin iterator of first sequence.</span>
<a name="l00098"></a>00098 <span class="comment"> * @param __end1 End iterator of first sequence.</span>
<a name="l00099"></a>00099 <span class="comment"> * @param __begin2 Begin iterator of second sequence.</span>
<a name="l00100"></a>00100 <span class="comment"> * @param __pred Find predicate.</span>
<a name="l00101"></a>00101 <span class="comment"> */</span>
<a name="l00102"></a>00102 <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter2,
<a name="l00103"></a>00103 <span class="keyword">typename</span> _Pred>
<a name="l00104"></a>00104 <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">std::pair<_RAIter1, _RAIter2></a>
<a name="l00105"></a><a class="code" href="a00091.html#a5e70a0f4689a7901e1517097cf0f07f4">00105</a> <a class="code" href="a00091.html#a5e70a0f4689a7901e1517097cf0f07f4" title="Corresponding sequential algorithm on a sequence.">_M_sequential_algorithm</a>(_RAIter1 __begin1,
<a name="l00106"></a>00106 _RAIter1 __end1,
<a name="l00107"></a>00107 _RAIter2 __begin2, _Pred __pred)
<a name="l00108"></a>00108 {
<a name="l00109"></a>00109 <span class="comment">// Passed end iterator is one short.</span>
<a name="l00110"></a>00110 _RAIter1 __spot = adjacent_find(__begin1, __end1 + 1,
<a name="l00111"></a>00111 __pred, <a class="code" href="a00178.html" title="Forces sequential execution at compile time.">sequential_tag</a>());
<a name="l00112"></a>00112 <span class="keywordflow">if</span> (__spot == (__end1 + 1))
<a name="l00113"></a>00113 __spot = __end1;
<a name="l00114"></a>00114 <span class="keywordflow">return</span> <a class="code" href="a01137.html#a9345a6e2e39831b4291cac2e52a15792" title="A convenience wrapper for creating a pair from two objects.">std::make_pair</a>(__spot, __begin2);
<a name="l00115"></a>00115 }
<a name="l00116"></a>00116 };
<a name="l00117"></a>00117 <span class="comment"></span>
<a name="l00118"></a>00118 <span class="comment"> /** @brief Test inverted predicate on a single element. */</span>
<a name="l00119"></a><a class="code" href="a00107.html">00119</a> <span class="keyword">struct </span><a class="code" href="a00107.html" title="Test inverted predicate on a single element.">__mismatch_selector</a> : <span class="keyword">public</span> <a class="code" href="a00101.html" title="Base class of all __gnu_parallel::__find_template selectors.">__generic_find_selector</a>
<a name="l00120"></a>00120 {<span class="comment"></span>
<a name="l00121"></a>00121 <span class="comment"> /** </span>
<a name="l00122"></a>00122 <span class="comment"> * @brief Test on one position.</span>
<a name="l00123"></a>00123 <span class="comment"> * @param __i1 _Iterator on first sequence.</span>
<a name="l00124"></a>00124 <span class="comment"> * @param __i2 _Iterator on second sequence (unused).</span>
<a name="l00125"></a>00125 <span class="comment"> * @param __pred Find predicate. </span>
<a name="l00126"></a>00126 <span class="comment"> */</span>
<a name="l00127"></a>00127 <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter2,
<a name="l00128"></a>00128 <span class="keyword">typename</span> _Pred>
<a name="l00129"></a>00129 <span class="keywordtype">bool</span>
<a name="l00130"></a><a class="code" href="a00107.html#a4a5e4866ea59cd20b6c48f98ad586957">00130</a> <a class="code" href="a00107.html#a4a5e4866ea59cd20b6c48f98ad586957" title="Test on one position.">operator()</a>(_RAIter1 __i1, _RAIter2 __i2, _Pred __pred)
<a name="l00131"></a>00131 { <span class="keywordflow">return</span> !__pred(*__i1, *__i2); }
<a name="l00132"></a>00132 <span class="comment"></span>
<a name="l00133"></a>00133 <span class="comment"> /** </span>
<a name="l00134"></a>00134 <span class="comment"> * @brief Corresponding sequential algorithm on a sequence.</span>
<a name="l00135"></a>00135 <span class="comment"> * @param __begin1 Begin iterator of first sequence.</span>
<a name="l00136"></a>00136 <span class="comment"> * @param __end1 End iterator of first sequence.</span>
<a name="l00137"></a>00137 <span class="comment"> * @param __begin2 Begin iterator of second sequence.</span>
<a name="l00138"></a>00138 <span class="comment"> * @param __pred Find predicate. </span>
<a name="l00139"></a>00139 <span class="comment"> */</span>
<a name="l00140"></a>00140 <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter2,
<a name="l00141"></a>00141 <span class="keyword">typename</span> _Pred>
<a name="l00142"></a>00142 <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">std::pair<_RAIter1, _RAIter2></a>
<a name="l00143"></a><a class="code" href="a00107.html#a6ae29814f33ac94fe32d43e207b3592a">00143</a> <a class="code" href="a00107.html#a6ae29814f33ac94fe32d43e207b3592a" title="Corresponding sequential algorithm on a sequence.">_M_sequential_algorithm</a>(_RAIter1 __begin1,
<a name="l00144"></a>00144 _RAIter1 __end1,
<a name="l00145"></a>00145 _RAIter2 __begin2, _Pred __pred)
<a name="l00146"></a>00146 { <span class="keywordflow">return</span> mismatch(__begin1, __end1, __begin2,
<a name="l00147"></a>00147 __pred, <a class="code" href="a00178.html" title="Forces sequential execution at compile time.">sequential_tag</a>()); }
<a name="l00148"></a>00148 };
<a name="l00149"></a>00149
<a name="l00150"></a>00150 <span class="comment"></span>
<a name="l00151"></a>00151 <span class="comment"> /** @brief Test predicate on several elements. */</span>
<a name="l00152"></a>00152 <span class="keyword">template</span><<span class="keyword">typename</span> _FIterator>
<a name="l00153"></a><a class="code" href="a00097.html">00153</a> <span class="keyword">struct </span><a class="code" href="a00097.html" title="Test predicate on several elements.">__find_first_of_selector</a> : <span class="keyword">public</span> <a class="code" href="a00101.html" title="Base class of all __gnu_parallel::__find_template selectors.">__generic_find_selector</a>
<a name="l00154"></a>00154 {
<a name="l00155"></a>00155 _FIterator _M_begin;
<a name="l00156"></a>00156 _FIterator _M_end;
<a name="l00157"></a>00157
<a name="l00158"></a>00158 <span class="keyword">explicit</span> <a class="code" href="a00097.html" title="Test predicate on several elements.">__find_first_of_selector</a>(_FIterator __begin,
<a name="l00159"></a>00159 _FIterator __end)
<a name="l00160"></a>00160 : _M_begin(__begin), _M_end(__end) { }
<a name="l00161"></a>00161 <span class="comment"></span>
<a name="l00162"></a>00162 <span class="comment"> /** @brief Test on one position.</span>
<a name="l00163"></a>00163 <span class="comment"> * @param __i1 _Iterator on first sequence.</span>
<a name="l00164"></a>00164 <span class="comment"> * @param __i2 _Iterator on second sequence (unused).</span>
<a name="l00165"></a>00165 <span class="comment"> * @param __pred Find predicate. */</span>
<a name="l00166"></a>00166 <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter2,
<a name="l00167"></a>00167 <span class="keyword">typename</span> _Pred>
<a name="l00168"></a>00168 <span class="keywordtype">bool</span>
<a name="l00169"></a><a class="code" href="a00097.html#a139fa0869dba8ecda2b7e96cdff22272">00169</a> <a class="code" href="a00097.html#a139fa0869dba8ecda2b7e96cdff22272" title="Test on one position.">operator()</a>(_RAIter1 __i1, _RAIter2 __i2, _Pred __pred)
<a name="l00170"></a>00170 {
<a name="l00171"></a>00171 <span class="keywordflow">for</span> (_FIterator __pos_in_candidates = _M_begin;
<a name="l00172"></a>00172 __pos_in_candidates != _M_end; ++__pos_in_candidates)
<a name="l00173"></a>00173 <span class="keywordflow">if</span> (__pred(*__i1, *__pos_in_candidates))
<a name="l00174"></a>00174 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00175"></a>00175 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00176"></a>00176 }
<a name="l00177"></a>00177 <span class="comment"></span>
<a name="l00178"></a>00178 <span class="comment"> /** @brief Corresponding sequential algorithm on a sequence.</span>
<a name="l00179"></a>00179 <span class="comment"> * @param __begin1 Begin iterator of first sequence.</span>
<a name="l00180"></a>00180 <span class="comment"> * @param __end1 End iterator of first sequence.</span>
<a name="l00181"></a>00181 <span class="comment"> * @param __begin2 Begin iterator of second sequence.</span>
<a name="l00182"></a>00182 <span class="comment"> * @param __pred Find predicate. */</span>
<a name="l00183"></a>00183 <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter2,
<a name="l00184"></a>00184 <span class="keyword">typename</span> _Pred>
<a name="l00185"></a>00185 <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">std::pair<_RAIter1, _RAIter2></a>
<a name="l00186"></a><a class="code" href="a00097.html#a11dd19a8348b37d763edd6bbb0cb6696">00186</a> <a class="code" href="a00097.html#a11dd19a8348b37d763edd6bbb0cb6696" title="Corresponding sequential algorithm on a sequence.">_M_sequential_algorithm</a>(_RAIter1 __begin1,
<a name="l00187"></a>00187 _RAIter1 __end1,
<a name="l00188"></a>00188 _RAIter2 __begin2, _Pred __pred)
<a name="l00189"></a>00189 {
<a name="l00190"></a>00190 <span class="keywordflow">return</span> <a class="code" href="a01137.html#a9345a6e2e39831b4291cac2e52a15792" title="A convenience wrapper for creating a pair from two objects.">std::make_pair</a>(find_first_of(__begin1, __end1,
<a name="l00191"></a>00191 _M_begin, _M_end, __pred,
<a name="l00192"></a>00192 <a class="code" href="a00178.html" title="Forces sequential execution at compile time.">sequential_tag</a>()), __begin2);
<a name="l00193"></a>00193 }
<a name="l00194"></a>00194 };
<a name="l00195"></a>00195 }
<a name="l00196"></a>00196
<a name="l00197"></a>00197 <span class="preprocessor">#endif </span><span class="comment">/* _GLIBCXX_PARALLEL_FIND_SELECTORS_H */</span>
</pre></div></div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="a00872.html">find_selectors.h</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>
