forked from boostorg/range
82 lines
4.9 KiB
HTML
82 lines
4.9 KiB
HTML
|
<html>
|
||
|
|
<head>
|
||
|
|
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
|
||
|
|
<title>Non-mutating algorithms</title>
|
||
|
|
<link rel="stylesheet" href="../../../../../../../doc/html/boostbook.css" type="text/css">
|
||
|
|
<meta name="generator" content="DocBook XSL Stylesheets V1.75.1">
|
||
|
|
<link rel="home" href="../../../index.html" title="Chapter 1. Range 2.0">
|
||
|
|
<link rel="up" href="../algorithms.html" title="Range Algorithm">
|
||
|
|
<link rel="prev" href="mutating/unique_copy.html" title="unique_copy">
|
||
|
|
<link rel="next" href="non_mutating/adjacent_find.html" title="adjacent_find">
|
||
|
|
</head>
|
||
|
|
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
|
||
|
|
<table cellpadding="2" width="100%"><tr>
|
||
|
|
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td>
|
||
|
|
<td align="center"><a href="../../../../../../../index.html">Home</a></td>
|
||
|
|
<td align="center"><a href="../../../../../../libraries.htm">Libraries</a></td>
|
||
|
|
<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
|
||
|
|
<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
|
||
|
|
<td align="center"><a href="../../../../../../../more/index.htm">More</a></td>
|
||
|
|
</tr></table>
|
||
|
|
<hr>
|
||
|
|
<div class="spirit-nav">
|
||
|
|
<a accesskey="p" href="mutating/unique_copy.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="non_mutating/adjacent_find.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
|
||
|
|
</div>
|
||
|
|
<div class="section" title="Non-mutating algorithms">
|
||
|
|
<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
|
||
|
|
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>
|
||
|
|
</dl></div>
|
||
|
|
</div>
|
||
|
|
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
|
||
|
|
<td align="left"></td>
|
||
|
|
<td align="right"><div class="copyright-footer">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves<p>
|
||
|
|
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||
|
|
file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
|
||
|
|
</p>
|
||
|
|
</div></td>
|
||
|
|
</tr></table>
|
||
|
|
<hr>
|
||
|
|
<div class="spirit-nav">
|
||
|
|
<a accesskey="p" href="mutating/unique_copy.html"><img src="../../../../../../../doc/html/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/html/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/html/images/home.png" alt="Home"></a><a accesskey="n" href="non_mutating/adjacent_find.html"><img src="../../../../../../../doc/html/images/next.png" alt="Next"></a>
|
||
|
|
</div>
|
||
|
|
</body>
|
||
|
|
</html>
|