mirror/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout.git synced 2025-07-12 14:54:10 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

add doc: array members

Browse source
This commit is contained in:
Bolero-MURAKAMI 2013-08-25 23:14:03 +09:00
parent 227a35c29c
commit 3a5283e165
91 changed files with 6507 additions and 572 deletions
Download patch file Download diff file Expand all files Collapse all files

14
docs/libs/sprout/algorithm/find_end.html
View file

@ -56,17 +56,17 @@
<div class="highlight-c++"><div class="highlight"><pre><span class="k">template</span><span class="o">&lt;</span><span class="k">typename</span> <span class="n">ForwardIterator1</span><span class="p">,</span> <span class="k">typename</span> <span class="n">ForwardIterator2</span><span class="o">&gt;</span>
<span class="kr">inline</span> <span class="n">SPROUT_CONSTEXPR</span> <span class="n">ForwardIterator1</span>
<span class="n">find_end</span><span class="p">(</span>
<span class="n">ForwardIterator1</span> <span class="n">first1</span><span class="p">,</span> <span class="n">ForwardIterator1</span> <span class="n">last1</span><span class="p">,</span>
<span class="n">ForwardIterator2</span> <span class="n">first2</span><span class="p">,</span> <span class="n">ForwardIterator2</span> <span class="n">last2</span>
<span class="p">);</span>
<span class="n">ForwardIterator1</span> <span class="n">first1</span><span class="p">,</span> <span class="n">ForwardIterator1</span> <span class="n">last1</span><span class="p">,</span>
<span class="n">ForwardIterator2</span> <span class="n">first2</span><span class="p">,</span> <span class="n">ForwardIterator2</span> <span class="n">last2</span>
<span class="p">);</span>
<span class="k">template</span><span class="o">&lt;</span><span class="k">typename</span> <span class="n">ForwardIterator1</span><span class="p">,</span> <span class="k">typename</span> <span class="n">ForwardIterator2</span><span class="p">,</span> <span class="k">typename</span> <span class="n">BinaryPredicate</span><span class="o">&gt;</span>
<span class="kr">inline</span> <span class="n">SPROUT_CONSTEXPR</span> <span class="n">ForwardIterator1</span>
<span class="n">find_end</span><span class="p">(</span>
<span class="n">ForwardIterator1</span> <span class="n">first1</span><span class="p">,</span> <span class="n">ForwardIterator1</span> <span class="n">last1</span><span class="p">,</span>
<span class="n">ForwardIterator2</span> <span class="n">first2</span><span class="p">,</span> <span class="n">ForwardIterator2</span> <span class="n">last2</span><span class="p">,</span>
<span class="n">BinaryPredicate</span> <span class="n">pred</span>
<span class="p">);</span>
<span class="n">ForwardIterator1</span> <span class="n">first1</span><span class="p">,</span> <span class="n">ForwardIterator1</span> <span class="n">last1</span><span class="p">,</span>
<span class="n">ForwardIterator2</span> <span class="n">first2</span><span class="p">,</span> <span class="n">ForwardIterator2</span> <span class="n">last2</span><span class="p">,</span>
<span class="n">BinaryPredicate</span> <span class="n">pred</span>
<span class="p">);</span>
</pre></div>
</div>
</div>

14
docs/libs/sprout/algorithm/find_first_of.html
View file

@ -56,17 +56,17 @@
<div class="highlight-c++"><div class="highlight"><pre><span class="k">template</span><span class="o">&lt;</span><span class="k">typename</span> <span class="n">InputIterator1</span><span class="p">,</span> <span class="k">typename</span> <span class="n">ForwardIterator2</span><span class="o">&gt;</span>
<span class="kr">inline</span> <span class="n">SPROUT_CONSTEXPR</span> <span class="n">InputIterator1</span>
<span class="n">find_first_of</span><span class="p">(</span>
<span class="n">InputIterator1</span> <span class="n">first1</span><span class="p">,</span> <span class="n">InputIterator1</span> <span class="n">last1</span><span class="p">,</span>
<span class="n">ForwardIterator2</span> <span class="n">first2</span><span class="p">,</span> <span class="n">ForwardIterator2</span> <span class="n">last2</span>
<span class="p">);</span>
<span class="n">InputIterator1</span> <span class="n">first1</span><span class="p">,</span> <span class="n">InputIterator1</span> <span class="n">last1</span><span class="p">,</span>
<span class="n">ForwardIterator2</span> <span class="n">first2</span><span class="p">,</span> <span class="n">ForwardIterator2</span> <span class="n">last2</span>
<span class="p">);</span>
<span class="k">template</span><span class="o">&lt;</span><span class="k">typename</span> <span class="n">InputIterator1</span><span class="p">,</span> <span class="k">typename</span> <span class="n">ForwardIterator2</span><span class="p">,</span> <span class="k">typename</span> <span class="n">BinaryPredicate</span><span class="o">&gt;</span>
<span class="kr">inline</span> <span class="n">SPROUT_CONSTEXPR</span> <span class="n">InputIterator1</span>
<span class="n">find_first_of</span><span class="p">(</span>
<span class="n">InputIterator1</span> <span class="n">first1</span><span class="p">,</span> <span class="n">InputIterator1</span> <span class="n">last1</span><span class="p">,</span>
<span class="n">ForwardIterator2</span> <span class="n">first2</span><span class="p">,</span> <span class="n">ForwardIterator2</span> <span class="n">last2</span><span class="p">,</span>
<span class="n">BinaryPredicate</span> <span class="n">pred</span>
<span class="p">);</span>
<span class="n">InputIterator1</span> <span class="n">first1</span><span class="p">,</span> <span class="n">InputIterator1</span> <span class="n">last1</span><span class="p">,</span>
<span class="n">ForwardIterator2</span> <span class="n">first2</span><span class="p">,</span> <span class="n">ForwardIterator2</span> <span class="n">last2</span><span class="p">,</span>
<span class="n">BinaryPredicate</span> <span class="n">pred</span>
<span class="p">);</span>
</pre></div>
</div>
</div>

283
docs/libs/sprout/algorithm/index.html
View file

@ -22,7 +22,7 @@
<link rel="top" title="Sprout v1.0 documentation" href="../../../index.html" />
<link rel="up" title="Libraries" href="../../libraries.html" />
<link rel="next" title="all_of" href="all_of.html" />
<link rel="prev" title="Class template array" href="../array/array/index.html" />
<link rel="prev" title="back" href="../array/array/c_array.html" />
</head>
<body>
<div class="related">
@ -35,7 +35,7 @@
<a href="all_of.html" title="all_of"
accesskey="N">next</a> |</li>
<li class="right" >
<a href="../array/array/index.html" title="Class template array"
<a href="../array/array/c_array.html" title="back"
accesskey="P">previous</a> |</li>
<li><a href="../../../index.html">Sprout v1.0 documentation</a> &raquo;</li>
<li><a href="../../index.html" >Sprout C++ Libraries</a> &raquo;</li>
@ -52,79 +52,240 @@
<h1>Sprout.Algorithm<a class="headerlink" href="#id1" title="Permalink to this headline"></a></h1>
<div class="section" id="non-modifying-sequence-operations">
<h2>Non-modifying sequence operations<a class="headerlink" href="#non-modifying-sequence-operations" title="Permalink to this headline"></a></h2>
<ul class="simple">
<li><a class="reference external" href="all_of.html"><em>all_of</em></a></li>
<li><a class="reference external" href="all_of_equal.html"><em>all_of_equal</em></a></li>
<li><a class="reference external" href="any_of.html"><em>any_of</em></a></li>
<li><a class="reference external" href="any_of_equal.html"><em>any_of_equal</em></a></li>
<li><a class="reference external" href="none_of.html"><em>none_of</em></a></li>
<li><a class="reference external" href="none_of_equal.html"><em>none_of_equal</em></a></li>
<li><a class="reference external" href="one_of.html"><em>one_of</em></a></li>
<li><a class="reference external" href="one_of_equal.html"><em>one_of_equal</em></a></li>
<li><a class="reference external" href="find.html"><em>find</em></a></li>
<li><a class="reference external" href="find_if.html"><em>find_if</em></a></li>
<li><a class="reference external" href="find_if_not.html"><em>find_if_not</em></a></li>
<li><a class="reference external" href="find_end.html"><em>find_end</em></a></li>
<li><a class="reference external" href="find_first_of.html"><em>find_first_of</em></a></li>
<li><a class="reference external" href="adjacent_find.html"><em>adjacent_find</em></a></li>
<li><a class="reference external" href="count.html"><em>count</em></a></li>
<li><a class="reference external" href="count_if.html"><em>count_if</em></a></li>
<li><a class="reference external" href="mismatch.html"><em>mismatch</em></a></li>
<li><a class="reference external" href="equal.html"><em>equal</em></a></li>
<li><a class="reference external" href="is_permutation.html"><em>is_permutation</em></a></li>
<li><a class="reference external" href="search.html"><em>search</em></a></li>
<li><a class="reference external" href="search_n.html"><em>search_n</em></a></li>
</ul>
<table border="1" class="docutils">
<colgroup>
<col width="34%" />
<col width="66%" />
</colgroup>
<thead valign="bottom">
<tr><th class="head">function</th>
<th class="head">&nbsp;</th>
</tr>
</thead>
<tbody valign="top">
<tr><td><a class="reference external" href="all_of.html"><em>all_of</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="all_of_equal.html"><em>all_of_equal</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="any_of.html"><em>any_of</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="any_of_equal.html"><em>any_of_equal</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="none_of.html"><em>none_of</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="none_of_equal.html"><em>none_of_equal</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="one_of.html"><em>one_of</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="one_of_equal.html"><em>one_of_equal</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="find.html"><em>find</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="find_if.html"><em>find_if</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="find_if_not.html"><em>find_if_not</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="find_end.html"><em>find_end</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="find_first_of.html"><em>find_first_of</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="adjacent_find.html"><em>adjacent_find</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="count.html"><em>count</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="count_if.html"><em>count_if</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="mismatch.html"><em>mismatch</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="equal.html"><em>equal</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="is_permutation.html"><em>is_permutation</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="search.html"><em>search</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="search_n.html"><em>search_n</em></a></td>
<td>&nbsp;</td>
</tr>
</tbody>
</table>
<div class="section" id="sorting">
<h3>Sorting<a class="headerlink" href="#sorting" title="Permalink to this headline"></a></h3>
<ul class="simple">
<li><a class="reference external" href="is_sorted.html"><em>is_sorted</em></a></li>
<li><a class="reference external" href="is_sorted_until.html"><em>is_sorted_until</em></a></li>
<li><a class="reference external" href="is_increasing.html"><em>is_increasing</em></a></li>
<li><a class="reference external" href="is_decreasing.html"><em>is_decreasing</em></a></li>
<li><a class="reference external" href="is_strictly_increasing.html"><em>is_strictly_increasing</em></a></li>
<li><a class="reference external" href="is_strictly_decreasing.html"><em>is_strictly_decreasing</em></a></li>
</ul>
<table border="1" class="docutils">
<colgroup>
<col width="50%" />
<col width="50%" />
</colgroup>
<thead valign="bottom">
<tr><th class="head">function</th>
<th class="head">&nbsp;</th>
</tr>
</thead>
<tbody valign="top">
<tr><td><a class="reference external" href="is_sorted.html"><em>is_sorted</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="is_sorted_until.html"><em>is_sorted_until</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="is_increasing.html"><em>is_increasing</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="is_decreasing.html"><em>is_decreasing</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="is_strictly_increasing.html"><em>is_strictly_increasing</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="is_strictly_decreasing.html"><em>is_strictly_decreasing</em></a></td>
<td>&nbsp;</td>
</tr>
</tbody>
</table>
</div>
<div class="section" id="binary-search">
<h3>Binary search<a class="headerlink" href="#binary-search" title="Permalink to this headline"></a></h3>
<ul class="simple">
<li><a class="reference external" href="lower_bound.html"><em>lower_bound</em></a></li>
<li><a class="reference external" href="upper_bound.html"><em>upper_bound</em></a></li>
<li><a class="reference external" href="equal_range.html"><em>equal_range</em></a></li>
<li><a class="reference external" href="binary_search.html"><em>binary_search</em></a></li>
</ul>
<table border="1" class="docutils">
<colgroup>
<col width="34%" />
<col width="66%" />
</colgroup>
<thead valign="bottom">
<tr><th class="head">function</th>
<th class="head">&nbsp;</th>
</tr>
</thead>
<tbody valign="top">
<tr><td><a class="reference external" href="lower_bound.html"><em>lower_bound</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="upper_bound.html"><em>upper_bound</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="equal_range.html"><em>equal_range</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="binary_search.html"><em>binary_search</em></a></td>
<td>&nbsp;</td>
</tr>
</tbody>
</table>
</div>
<div class="section" id="heap-operations">
<h3>Heap operations<a class="headerlink" href="#heap-operations" title="Permalink to this headline"></a></h3>
<ul class="simple">
<li><a class="reference external" href="is_heap.html"><em>is_heap</em></a></li>
<li><a class="reference external" href="is_heap_until.html"><em>is_heap_until</em></a></li>
</ul>
<table border="1" class="docutils">
<colgroup>
<col width="34%" />
<col width="66%" />
</colgroup>
<thead valign="bottom">
<tr><th class="head">function</th>
<th class="head">&nbsp;</th>
</tr>
</thead>
<tbody valign="top">
<tr><td><a class="reference external" href="is_heap.html"><em>is_heap</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="is_heap_until.html"><em>is_heap_until</em></a></td>
<td>&nbsp;</td>
</tr>
</tbody>
</table>
</div>
<div class="section" id="minimum-and-maximum">
<h3>Minimum and maximum<a class="headerlink" href="#minimum-and-maximum" title="Permalink to this headline"></a></h3>
<ul class="simple">
<li><a class="reference external" href="min.html"><em>min</em></a></li>
<li><a class="reference external" href="max.html"><em>max</em></a></li>
<li><a class="reference external" href="minmax.html"><em>minmax</em></a></li>
<li><a class="reference external" href="min_element.html"><em>min_element</em></a></li>
<li><a class="reference external" href="max_element.html"><em>max_element</em></a></li>
<li><a class="reference external" href="minmax_element.html"><em>minmax_element</em></a></li>
</ul>
<table border="1" class="docutils">
<colgroup>
<col width="34%" />
<col width="66%" />
</colgroup>
<thead valign="bottom">
<tr><th class="head">function</th>
<th class="head">&nbsp;</th>
</tr>
</thead>
<tbody valign="top">
<tr><td><a class="reference external" href="min.html"><em>min</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="max.html"><em>max</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="minmax.html"><em>minmax</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="min_element.html"><em>min_element</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="max_element.html"><em>max_element</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="minmax_element.html"><em>minmax_element</em></a></td>
<td>&nbsp;</td>
</tr>
</tbody>
</table>
</div>
<div class="section" id="lexicographical-comparison">
<h3>Lexicographical comparison<a class="headerlink" href="#lexicographical-comparison" title="Permalink to this headline"></a></h3>
<ul class="simple">
<li><a class="reference external" href="lexicographical_compare.html"><em>lexicographical_compare</em></a></li>
<li><a class="reference external" href="tristate_lexicographical_compare.html"><em>tristate_lexicographical_compare</em></a></li>
</ul>
<table border="1" class="docutils">
<colgroup>
<col width="50%" />
<col width="50%" />
</colgroup>
<thead valign="bottom">
<tr><th class="head">function</th>
<th class="head">&nbsp;</th>
</tr>
</thead>
<tbody valign="top">
<tr><td><a class="reference external" href="lexicographical_compare.html"><em>lexicographical_compare</em></a></td>
<td>&nbsp;</td>
</tr>
<tr><td><a class="reference external" href="tristate_lexicographical_compare.html"><em>tristate_lexicographical_compare</em></a></td>
<td>&nbsp;</td>
</tr>
</tbody>
</table>
</div>
<div class="section" id="clamp-algorithm">
<h3>Clamp algorithm<a class="headerlink" href="#clamp-algorithm" title="Permalink to this headline"></a></h3>
<ul class="simple">
<li><a class="reference external" href="clamp.html"><em>clamp</em></a></li>
</ul>
<table border="1" class="docutils">
<colgroup>
<col width="34%" />
<col width="66%" />
</colgroup>
<thead valign="bottom">
<tr><th class="head">function</th>
<th class="head">&nbsp;</th>
</tr>
</thead>
<tbody valign="top">
<tr><td><a class="reference external" href="clamp.html"><em>clamp</em></a></td>
<td>&nbsp;</td>
</tr>
</tbody>
</table>
</div>
<div class="section" id="header">
<h3>Header<a class="headerlink" href="#header" title="Permalink to this headline"></a></h3>
@ -157,8 +318,8 @@
</ul>
<h4>Previous topic</h4>
<p class="topless"><a href="../array/array/index.html"
title="previous chapter">Class template array</a></p>
<p class="topless"><a href="../array/array/c_array.html"
title="previous chapter">back</a></p>
<h4>Next topic</h4>
<p class="topless"><a href="all_of.html"
title="next chapter">all_of</a></p>
@ -194,7 +355,7 @@
<a href="all_of.html" title="all_of"
>next</a> |</li>
<li class="right" >
<a href="../array/array/index.html" title="Class template array"
<a href="../array/array/c_array.html" title="back"
>previous</a> |</li>
<li><a href="../../../index.html">Sprout v1.0 documentation</a> &raquo;</li>
<li><a href="../../index.html" >Sprout C++ Libraries</a> &raquo;</li>

18
docs/libs/sprout/algorithm/lexicographical_compare.html
View file

@ -56,17 +56,17 @@
<div class="highlight-c++"><div class="highlight"><pre><span class="k">template</span><span class="o">&lt;</span><span class="k">typename</span> <span class="n">InputIterator1</span><span class="p">,</span> <span class="k">typename</span> <span class="n">InputIterator2</span><span class="o">&gt;</span>
<span class="kr">inline</span> <span class="n">SPROUT_CONSTEXPR</span> <span class="kt">bool</span>
<span class="n">lexicographical_compare</span><span class="p">(</span>
<span class="n">InputIterator1</span> <span class="n">first1</span><span class="p">,</span> <span class="n">InputIterator1</span> <span class="n">last1</span><span class="p">,</span>
<span class="n">InputIterator2</span> <span class="n">first2</span><span class="p">,</span> <span class="n">InputIterator2</span> <span class="n">last2</span>
<span class="p">);</span>
<span class="n">InputIterator1</span> <span class="n">first1</span><span class="p">,</span> <span class="n">InputIterator1</span> <span class="n">last1</span><span class="p">,</span>
<span class="n">InputIterator2</span> <span class="n">first2</span><span class="p">,</span> <span class="n">InputIterator2</span> <span class="n">last2</span>
<span class="p">);</span>
<span class="k">template</span><span class="o">&lt;</span><span class="k">typename</span> <span class="n">InputIterator1</span><span class="p">,</span> <span class="k">typename</span> <span class="n">InputIterator2</span><span class="p">,</span> <span class="k">typename</span> <span class="n">Compare</span><span class="o">&gt;</span>
<span class="kr">inline</span> <span class="n">SPROUT_CONSTEXPR</span> <span class="kt">bool</span>
<span class="n">lexicographical_compare</span><span class="p">(</span>
<span class="n">InputIterator1</span> <span class="n">first1</span><span class="p">,</span> <span class="n">InputIterator1</span> <span class="n">last1</span><span class="p">,</span>
<span class="n">InputIterator2</span> <span class="n">first2</span><span class="p">,</span> <span class="n">InputIterator2</span> <span class="n">last2</span><span class="p">,</span>
<span class="n">Compare</span> <span class="n">comp</span>
<span class="p">);</span>
<span class="n">InputIterator1</span> <span class="n">first1</span><span class="p">,</span> <span class="n">InputIterator1</span> <span class="n">last1</span><span class="p">,</span>
<span class="n">InputIterator2</span> <span class="n">first2</span><span class="p">,</span> <span class="n">InputIterator2</span> <span class="n">last2</span><span class="p">,</span>
<span class="n">Compare</span> <span class="n">comp</span>
<span class="p">);</span>
</pre></div>
</div>
</div>
@ -84,8 +84,8 @@
<div class="line">Otherwise, the lexicographical comparison of the sequences yields the same result as the comparison of the first corresponding pair of elements that are not equivalent.</div>
</div>
<div class="highlight-c++"><div class="highlight"><pre><span class="k">for</span> <span class="p">(;</span> <span class="n">first1</span> <span class="o">!=</span> <span class="n">last1</span> <span class="o">&amp;&amp;</span> <span class="n">first2</span> <span class="o">!=</span> <span class="n">last2</span><span class="p">;</span> <span class="o">++</span><span class="n">first1</span><span class="p">,</span> <span class="o">++</span><span class="n">first2</span><span class="p">)</span> <span class="p">{</span>
<span class="k">if</span> <span class="p">(</span><span class="o">*</span><span class="n">first1</span> <span class="o">&lt;</span> <span class="o">*</span><span class="n">first2</span><span class="p">)</span> <span class="k">return</span> <span class="kc">true</span><span class="p">;</span>
<span class="k">if</span> <span class="p">(</span><span class="o">*</span><span class="n">first2</span> <span class="o">&lt;</span> <span class="o">*</span><span class="n">first1</span><span class="p">)</span> <span class="k">return</span> <span class="kc">false</span><span class="p">;</span>
<span class="k">if</span> <span class="p">(</span><span class="o">*</span><span class="n">first1</span> <span class="o">&lt;</span> <span class="o">*</span><span class="n">first2</span><span class="p">)</span> <span class="k">return</span> <span class="kc">true</span><span class="p">;</span>
<span class="k">if</span> <span class="p">(</span><span class="o">*</span><span class="n">first2</span> <span class="o">&lt;</span> <span class="o">*</span><span class="n">first1</span><span class="p">)</span> <span class="k">return</span> <span class="kc">false</span><span class="p">;</span>
<span class="p">}</span>
<span class="k">return</span> <span class="n">first1</span> <span class="o">==</span> <span class="n">last1</span> <span class="o">&amp;&amp;</span> <span class="n">first2</span> <span class="o">!=</span> <span class="n">last2</span><span class="p">;</span>
</pre></div>

14
docs/libs/sprout/algorithm/search.html
View file

@ -56,17 +56,17 @@
<div class="highlight-c++"><div class="highlight"><pre><span class="k">template</span><span class="o">&lt;</span><span class="k">typename</span> <span class="n">ForwardIterator1</span><span class="p">,</span> <span class="k">typename</span> <span class="n">ForwardIterator2</span><span class="o">&gt;</span>
<span class="kr">inline</span> <span class="n">SPROUT_CONSTEXPR</span> <span class="n">ForwardIterator1</span>
<span class="n">search</span><span class="p">(</span>
<span class="n">ForwardIterator1</span> <span class="n">first1</span><span class="p">,</span> <span class="n">ForwardIterator1</span> <span class="n">last1</span><span class="p">,</span>
<span class="n">ForwardIterator2</span> <span class="n">first2</span><span class="p">,</span> <span class="n">ForwardIterator2</span> <span class="n">last2</span>
<span class="p">);</span>
<span class="n">ForwardIterator1</span> <span class="n">first1</span><span class="p">,</span> <span class="n">ForwardIterator1</span> <span class="n">last1</span><span class="p">,</span>
<span class="n">ForwardIterator2</span> <span class="n">first2</span><span class="p">,</span> <span class="n">ForwardIterator2</span> <span class="n">last2</span>
<span class="p">);</span>
<span class="k">template</span><span class="o">&lt;</span><span class="k">typename</span> <span class="n">ForwardIterator1</span><span class="p">,</span> <span class="k">typename</span> <span class="n">ForwardIterator2</span><span class="p">,</span> <span class="k">typename</span> <span class="n">BinaryPredicate</span><span class="o">&gt;</span>
<span class="kr">inline</span> <span class="n">SPROUT_CONSTEXPR</span> <span class="n">ForwardIterator1</span>
<span class="n">search</span><span class="p">(</span>
<span class="n">ForwardIterator1</span> <span class="n">first1</span><span class="p">,</span> <span class="n">ForwardIterator1</span> <span class="n">last1</span><span class="p">,</span>
<span class="n">ForwardIterator2</span> <span class="n">first2</span><span class="p">,</span> <span class="n">ForwardIterator2</span> <span class="n">last2</span><span class="p">,</span>
<span class="n">BinaryPredicate</span> <span class="n">pred</span>
<span class="p">);</span>
<span class="n">ForwardIterator1</span> <span class="n">first1</span><span class="p">,</span> <span class="n">ForwardIterator1</span> <span class="n">last1</span><span class="p">,</span>
<span class="n">ForwardIterator2</span> <span class="n">first2</span><span class="p">,</span> <span class="n">ForwardIterator2</span> <span class="n">last2</span><span class="p">,</span>
<span class="n">BinaryPredicate</span> <span class="n">pred</span>
<span class="p">);</span>
</pre></div>
</div>
</div>

14
docs/libs/sprout/algorithm/tristate_lexicographical_compare.html
View file

@ -56,17 +56,17 @@
<div class="highlight-c++"><div class="highlight"><pre><span class="k">template</span><span class="o">&lt;</span><span class="k">typename</span> <span class="n">InputIterator1</span><span class="p">,</span> <span class="k">typename</span> <span class="n">InputIterator2</span><span class="o">&gt;</span>
<span class="kr">inline</span> <span class="n">SPROUT_CONSTEXPR</span> <span class="kt">int</span>
<span class="n">tristate_lexicographical_compare</span><span class="p">(</span>
<span class="n">InputIterator1</span> <span class="n">first1</span><span class="p">,</span> <span class="n">InputIterator1</span> <span class="n">last1</span><span class="p">,</span>
<span class="n">InputIterator2</span> <span class="n">first2</span><span class="p">,</span> <span class="n">InputIterator2</span> <span class="n">last2</span>
<span class="p">);</span>
<span class="n">InputIterator1</span> <span class="n">first1</span><span class="p">,</span> <span class="n">InputIterator1</span> <span class="n">last1</span><span class="p">,</span>
<span class="n">InputIterator2</span> <span class="n">first2</span><span class="p">,</span> <span class="n">InputIterator2</span> <span class="n">last2</span>
<span class="p">);</span>
<span class="k">template</span><span class="o">&lt;</span><span class="k">typename</span> <span class="n">InputIterator1</span><span class="p">,</span> <span class="k">typename</span> <span class="n">InputIterator2</span><span class="p">,</span> <span class="k">typename</span> <span class="n">Compare</span><span class="o">&gt;</span>
<span class="kr">inline</span> <span class="n">SPROUT_CONSTEXPR</span> <span class="kt">int</span>
<span class="n">tristate_lexicographical_compare</span><span class="p">(</span>
<span class="n">InputIterator1</span> <span class="n">first1</span><span class="p">,</span> <span class="n">InputIterator1</span> <span class="n">last1</span><span class="p">,</span>
<span class="n">InputIterator2</span> <span class="n">first2</span><span class="p">,</span> <span class="n">InputIterator2</span> <span class="n">last2</span><span class="p">,</span>
<span class="n">Compare</span> <span class="n">comp</span>
<span class="p">);</span>
<span class="n">InputIterator1</span> <span class="n">first1</span><span class="p">,</span> <span class="n">InputIterator1</span> <span class="n">last1</span><span class="p">,</span>
<span class="n">InputIterator2</span> <span class="n">first2</span><span class="p">,</span> <span class="n">InputIterator2</span> <span class="n">last2</span><span class="p">,</span>
<span class="n">Compare</span> <span class="n">comp</span>
<span class="p">);</span>
</pre></div>
</div>
</div>