feedc0de/boost_range
1
0
Fork 0
forked from boostorg/range
Code Pull Requests Activity

[boost][range] - Update to relax preconditions for the strided adaptor, and numerous fixes to inspection report issues.

Browse Source 
[SVN r67418]
This commit is contained in:
Neil Groves
2010-12-22 22:31:33 +00:00
parent 1ff26bc99b
commit 612cec17bb
286 changed files with 4007 additions and 1192 deletions
Download Patch File Download Diff File Expand all files Collapse all files

58
doc/html/range/reference/algorithms/non_mutating.html
View File

@ -5,7 +5,7 @@
<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../../../index.html" title="Chapter&#160;1.&#160;Range 2.0">
<link rel="up" href="../algorithms.html" title="Range Algorithm">
<link rel="up" href="../algorithms.html" title="Range Algorithms">
<link rel="prev" href="mutating/unique_copy.html" title="unique_copy">
<link rel="next" href="non_mutating/adjacent_find.html" title="adjacent_find">
</head>
@ -24,45 +24,29 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h4 class="title">
<a name="range.reference.algorithms.non_mutating"></a><a class="link" href="non_mutating.html" title="Non-mutating algorithms"> Non-mutating
<a name="range.reference.algorithms.non_mutating"></a><a class="link" href="non_mutating.html" title="Non-mutating algorithms">Non-mutating
algorithms</a>
</h4></div></div></div>
<div class="toc"><dl>
<dt><span class="section"><a href="non_mutating/adjacent_find.html">
adjacent_find</a></span></dt>
<dt><span class="section"><a href="non_mutating/binary_search.html">
binary_search</a></span></dt>
<dt><span class="section"><a href="non_mutating/count.html"> count</a></span></dt>
<dt><span class="section"><a href="non_mutating/count_if.html">
count_if</a></span></dt>
<dt><span class="section"><a href="non_mutating/equal.html"> equal</a></span></dt>
<dt><span class="section"><a href="non_mutating/equal_range.html">
equal_range</a></span></dt>
<dt><span class="section"><a href="non_mutating/for_each.html">
for_each</a></span></dt>
<dt><span class="section"><a href="non_mutating/find.html"> find</a></span></dt>
<dt><span class="section"><a href="non_mutating/find_end.html">
find_end</a></span></dt>
<dt><span class="section"><a href="non_mutating/find_first_of.html">
find_first_of</a></span></dt>
<dt><span class="section"><a href="non_mutating/find_if.html">
find_if</a></span></dt>
<dt><span class="section"><a href="non_mutating/lexicographical_compare.html">
lexicographical_compare</a></span></dt>
<dt><span class="section"><a href="non_mutating/lower_bound.html">
lower_bound</a></span></dt>
<dt><span class="section"><a href="non_mutating/max_element.html">
max_element</a></span></dt>
<dt><span class="section"><a href="non_mutating/min_element.html">
min_element</a></span></dt>
<dt><span class="section"><a href="non_mutating/mismatch.html">
mismatch</a></span></dt>
<dt><span class="section"><a href="non_mutating/search.html">
search</a></span></dt>
<dt><span class="section"><a href="non_mutating/search_n.html">
search_n</a></span></dt>
<dt><span class="section"><a href="non_mutating/upper_bound.html">
upper_bound</a></span></dt>
<dt><span class="section"><a href="non_mutating/adjacent_find.html">adjacent_find</a></span></dt>
<dt><span class="section"><a href="non_mutating/binary_search.html">binary_search</a></span></dt>
<dt><span class="section"><a href="non_mutating/count.html">count</a></span></dt>
<dt><span class="section"><a href="non_mutating/count_if.html">count_if</a></span></dt>
<dt><span class="section"><a href="non_mutating/equal.html">equal</a></span></dt>
<dt><span class="section"><a href="non_mutating/equal_range.html">equal_range</a></span></dt>
<dt><span class="section"><a href="non_mutating/for_each.html">for_each</a></span></dt>
<dt><span class="section"><a href="non_mutating/find.html">find</a></span></dt>
<dt><span class="section"><a href="non_mutating/find_end.html">find_end</a></span></dt>
<dt><span class="section"><a href="non_mutating/find_first_of.html">find_first_of</a></span></dt>
<dt><span class="section"><a href="non_mutating/find_if.html">find_if</a></span></dt>
<dt><span class="section"><a href="non_mutating/lexicographical_compare.html">lexicographical_compare</a></span></dt>
<dt><span class="section"><a href="non_mutating/lower_bound.html">lower_bound</a></span></dt>
<dt><span class="section"><a href="non_mutating/max_element.html">max_element</a></span></dt>
<dt><span class="section"><a href="non_mutating/min_element.html">min_element</a></span></dt>
<dt><span class="section"><a href="non_mutating/mismatch.html">mismatch</a></span></dt>
<dt><span class="section"><a href="non_mutating/search.html">search</a></span></dt>
<dt><span class="section"><a href="non_mutating/search_n.html">search_n</a></span></dt>
<dt><span class="section"><a href="non_mutating/upper_bound.html">upper_bound</a></span></dt>
</dl></div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>