|
|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r82138 - in branches/release/libs/range: . doc doc/html doc/html/range doc/html/range/concepts doc/html/range/headers doc/html/range/mfc_atl doc/html/range/reference doc/html/range/reference/adaptors doc/html/range/reference/adaptors/reference doc/html/range/reference/algorithms doc/html/range/reference/algorithms/heap doc/html/range/reference/algorithms/mutating doc/html/range/reference/algorithms/new doc/html/range/reference/algorithms/non_mutating doc/html/range/reference/algorithms/numeric doc/html/range/reference/algorithms/permutation doc/html/range/reference/algorithms/set doc/html/range/reference/concept_implementation doc/html/range/reference/concept_implementation/semantics doc/html/range/reference/extending doc/html/range/reference/extending/method_3 doc/html/range/reference/ranges doc/html/range/reference/utilities doc/html/range/upgrade doc/reference doc/reference/adaptors doc/reference/algorithm doc/reference/numeric
From: zeratul976_at_[hidden]
Date: 2012-12-21 03:44:56
Author: nathanridge
Date: 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
New Revision: 82138
URL: http://svn.boost.org/trac/boost/changeset/82138
Log:
[range] merge doc fixes (r81888, r81889) from trunk
Added:
branches/release/libs/range/doc/html/range/upgrade/upgrade_from_1_49.html
- copied unchanged from r82136, /trunk/libs/range/doc/html/range/upgrade/upgrade_from_1_49.html
Properties modified:
branches/release/libs/range/ (props changed)
Text files modified:
branches/release/libs/range/doc/history_ack.qbk | 2
branches/release/libs/range/doc/html/index.html | 9 +
branches/release/libs/range/doc/html/quickbook_HTML.manifest | 1
branches/release/libs/range/doc/html/range/concepts.html | 5
branches/release/libs/range/doc/html/range/concepts/bidirectional_range.html | 55 ++++++------
branches/release/libs/range/doc/html/range/concepts/concept_checking.html | 14 +-
branches/release/libs/range/doc/html/range/concepts/forward_range.html | 37 ++++----
branches/release/libs/range/doc/html/range/concepts/overview.html | 5
branches/release/libs/range/doc/html/range/concepts/random_access_range.html | 42 +++++-----
branches/release/libs/range/doc/html/range/concepts/single_pass_range.html | 54 ++++++------
branches/release/libs/range/doc/html/range/examples.html | 5
branches/release/libs/range/doc/html/range/faq.html | 5
branches/release/libs/range/doc/html/range/headers.html | 5
branches/release/libs/range/doc/html/range/headers/adaptors.html | 5
branches/release/libs/range/doc/html/range/headers/algorithm.html | 5
branches/release/libs/range/doc/html/range/headers/algorithm_ext.html | 5
branches/release/libs/range/doc/html/range/headers/general.html | 5
branches/release/libs/range/doc/html/range/history_ack.html | 21 ++--
branches/release/libs/range/doc/html/range/introduction.html | 30 +++---
branches/release/libs/range/doc/html/range/mfc_atl.html | 18 ++--
branches/release/libs/range/doc/html/range/mfc_atl/atl_ranges.html | 5
branches/release/libs/range/doc/html/range/mfc_atl/const_ranges.html | 6
branches/release/libs/range/doc/html/range/mfc_atl/mfc_ranges.html | 5
branches/release/libs/range/doc/html/range/mfc_atl/references.html | 5
branches/release/libs/range/doc/html/range/mfc_atl/requirements.html | 5
branches/release/libs/range/doc/html/range/portability.html | 21 ++--
branches/release/libs/range/doc/html/range/reference.html | 5
branches/release/libs/range/doc/html/range/reference/adaptors.html | 5
branches/release/libs/range/doc/html/range/reference/adaptors/general_requirements.html | 7
branches/release/libs/range/doc/html/range/reference/adaptors/introduction.html | 38 +++-----
branches/release/libs/range/doc/html/range/reference/adaptors/reference.html | 5
branches/release/libs/range/doc/html/range/reference/adaptors/reference/adjacent_filtered.html | 10 +-
branches/release/libs/range/doc/html/range/reference/adaptors/reference/copied.html | 10 +-
branches/release/libs/range/doc/html/range/reference/adaptors/reference/filtered.html | 10 +-
branches/release/libs/range/doc/html/range/reference/adaptors/reference/indexed.html | 10 +-
branches/release/libs/range/doc/html/range/reference/adaptors/reference/indirected.html | 10 +-
branches/release/libs/range/doc/html/range/reference/adaptors/reference/map_keys.html | 10 +-
branches/release/libs/range/doc/html/range/reference/adaptors/reference/map_values.html | 10 +-
branches/release/libs/range/doc/html/range/reference/adaptors/reference/replaced.html | 34 +++----
branches/release/libs/range/doc/html/range/reference/adaptors/reference/replaced_if.html | 32 +++----
branches/release/libs/range/doc/html/range/reference/adaptors/reference/reversed.html | 10 +-
branches/release/libs/range/doc/html/range/reference/adaptors/reference/sliced.html | 10 +-
branches/release/libs/range/doc/html/range/reference/adaptors/reference/strided.html | 10 +-
branches/release/libs/range/doc/html/range/reference/adaptors/reference/tokenized.html | 51 +++++------
branches/release/libs/range/doc/html/range/reference/adaptors/reference/transformed.html | 10 +-
branches/release/libs/range/doc/html/range/reference/adaptors/reference/type_erased.html | 163 +++++++++++++++++++--------------------
branches/release/libs/range/doc/html/range/reference/adaptors/reference/uniqued.html | 10 +-
branches/release/libs/range/doc/html/range/reference/algorithms.html | 5
branches/release/libs/range/doc/html/range/reference/algorithms/heap.html | 5
branches/release/libs/range/doc/html/range/reference/algorithms/heap/make_heap.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/heap/pop_heap.html | 42 +++++-----
branches/release/libs/range/doc/html/range/reference/algorithms/heap/push_heap.html | 42 +++++-----
branches/release/libs/range/doc/html/range/reference/algorithms/heap/sort_heap.html | 42 +++++-----
branches/release/libs/range/doc/html/range/reference/algorithms/introduction.html | 23 ++---
branches/release/libs/range/doc/html/range/reference/algorithms/mutating.html | 5
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/copy.html | 42 +++++-----
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/copy_backward.html | 42 +++++-----
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/fill.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/fill_n.html | 38 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/generate.html | 42 +++++-----
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/inplace_merge.html | 56 ++++++------
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/merge.html | 56 ++++++------
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/nth_element.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/partial_sort.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/partition.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/random_shuffle.html | 42 +++++-----
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy_if.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove_if.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy_if.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace_if.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/reverse.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/reverse_copy.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/rotate.html | 42 +++++-----
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/rotate_copy.html | 42 +++++-----
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/sort.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/stable_partition.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/stable_sort.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/swap_ranges.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/transform.html | 42 +++++-----
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/unique.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/mutating/unique_copy.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/new.html | 5
branches/release/libs/range/doc/html/range/reference/algorithms/new/copy_n.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/new/erase.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/new/for_each.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/new/insert.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/new/iota.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/new/is_sorted.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/new/overwrite.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/new/push_back.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/new/push_front.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/new/remove_erase.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/new/remove_erase_if.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating.html | 5
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/binary_search.html | 42 +++++-----
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/count.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/count_if.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/equal.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/equal_range.html | 46 +++++-----
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find_end.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find_first_of.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find_if.html | 42 +++++-----
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/for_each.html | 38 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html | 40 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/lower_bound.html | 42 +++++-----
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/max_element.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/min_element.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/mismatch.html | 44 +++++-----
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/search.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/search_n.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/upper_bound.html | 42 +++++-----
branches/release/libs/range/doc/html/range/reference/algorithms/numeric.html | 5
branches/release/libs/range/doc/html/range/reference/algorithms/numeric/accumulate.html | 52 ++++++------
branches/release/libs/range/doc/html/range/reference/algorithms/numeric/adjacent_difference.html | 56 ++++++------
branches/release/libs/range/doc/html/range/reference/algorithms/numeric/inner_product.html | 56 ++++++------
branches/release/libs/range/doc/html/range/reference/algorithms/numeric/partial_sum.html | 56 ++++++------
branches/release/libs/range/doc/html/range/reference/algorithms/permutation.html | 5
branches/release/libs/range/doc/html/range/reference/algorithms/permutation/next_permutation.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/permutation/prev_permutation.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/algorithms/set.html | 5
branches/release/libs/range/doc/html/range/reference/algorithms/set/includes.html | 44 +++++-----
branches/release/libs/range/doc/html/range/reference/algorithms/set/set_difference.html | 42 +++++-----
branches/release/libs/range/doc/html/range/reference/algorithms/set/set_intersection.html | 44 +++++-----
branches/release/libs/range/doc/html/range/reference/algorithms/set/set_symmetric_difference.html | 44 +++++-----
branches/release/libs/range/doc/html/range/reference/algorithms/set/set_union.html | 46 +++++-----
branches/release/libs/range/doc/html/range/reference/concept_implementation.html | 5
branches/release/libs/range/doc/html/range/reference/concept_implementation/semantics.html | 11 +-
branches/release/libs/range/doc/html/range/reference/concept_implementation/semantics/functions.html | 7
branches/release/libs/range/doc/html/range/reference/concept_implementation/semantics/metafunctions.html | 7
branches/release/libs/range/doc/html/range/reference/concept_implementation/synopsis.html | 104 ++++++++++++------------
branches/release/libs/range/doc/html/range/reference/extending.html | 5
branches/release/libs/range/doc/html/range/reference/extending/method_1.html | 5
branches/release/libs/range/doc/html/range/reference/extending/method_2.html | 76 +++++++++---------
branches/release/libs/range/doc/html/range/reference/extending/method_3.html | 5
branches/release/libs/range/doc/html/range/reference/extending/method_3/method_3_1.html | 10 +-
branches/release/libs/range/doc/html/range/reference/extending/method_3/method_3_2.html | 10 -
branches/release/libs/range/doc/html/range/reference/overview.html | 5
branches/release/libs/range/doc/html/range/reference/ranges.html | 5
branches/release/libs/range/doc/html/range/reference/ranges/any_range.html | 24 ++--
branches/release/libs/range/doc/html/range/reference/ranges/counting_range.html | 30 +++---
branches/release/libs/range/doc/html/range/reference/ranges/irange.html | 36 ++++----
branches/release/libs/range/doc/html/range/reference/ranges/istream_range.html | 24 ++--
branches/release/libs/range/doc/html/range/reference/utilities.html | 5
branches/release/libs/range/doc/html/range/reference/utilities/iterator_range.html | 112 +++++++++++++-------------
branches/release/libs/range/doc/html/range/reference/utilities/join.html | 18 ++--
branches/release/libs/range/doc/html/range/reference/utilities/sub_range.html | 57 ++++++-------
branches/release/libs/range/doc/html/range/style_guide.html | 53 ++++++------
branches/release/libs/range/doc/html/range/upgrade.html | 13 +-
branches/release/libs/range/doc/html/range/upgrade/upgrade_from_1_34.html | 5
branches/release/libs/range/doc/html/range/upgrade/upgrade_from_1_42.html | 5
branches/release/libs/range/doc/html/range/upgrade/upgrade_from_1_45.html | 11 +-
branches/release/libs/range/doc/reference/adaptors/type_erased.qbk | 2
branches/release/libs/range/doc/reference/algorithm/fill_n.qbk | 2
branches/release/libs/range/doc/reference/algorithm/lexicographical_compare.qbk | 2
branches/release/libs/range/doc/reference/algorithm/mismatch.qbk | 2
branches/release/libs/range/doc/reference/numeric/accumulate.qbk | 2
branches/release/libs/range/doc/reference/utilities.qbk | 2
branches/release/libs/range/doc/upgrade.qbk | 2
164 files changed, 2274 insertions(+), 2252 deletions(-)
Modified: branches/release/libs/range/doc/history_ack.qbk
==============================================================================
--- branches/release/libs/range/doc/history_ack.qbk (original)
+++ branches/release/libs/range/doc/history_ack.qbk 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -20,7 +20,7 @@
* Pavel Vozenilek for help with porting the library
* Jonathan Turkanis and John Torjo for help with documentation
* Hartmut Kaiser for being review manager
-* Jonathan Turkanis for porting the lib (as far sa possible) to vc6 and vc7.
+* Jonathan Turkanis for porting the lib (as far as possible) to vc6 and vc7.
The concept checks and their documentation was provided by Daniel Walker.
Modified: branches/release/libs/range/doc/html/index.html
==============================================================================
--- branches/release/libs/range/doc/html/index.html (original)
+++ branches/release/libs/range/doc/html/index.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -28,9 +28,10 @@
<div><div class="author"><h3 class="author">
<span class="firstname">Neil</span> <span class="surname">Groves</span>
</h3></div></div>
-<div><p class="copyright">Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves</p></div>
+<div><p class="copyright">Copyright © 2003-2010 Thorsten Ottosen,
+ Neil Groves</p></div>
<div><div class="legalnotice">
-<a name="id607962"></a><p>
+<a name="range.legal"></a><p>
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
</p>
@@ -122,6 +123,8 @@
</dl></dd>
<dt><span class="section">Upgrade version of Boost.Range</span></dt>
<dd><dl>
+<dt><span class="section"><a href="range/upgrade/upgrade_from_1_49.html">Upgrade from version
+ 1.49</a></span></dt>
<dt><span class="section"><a href="range/upgrade/upgrade_from_1_45.html">Upgrade from version
1.45</a></span></dt>
<dt><span class="section"><a href="range/upgrade/upgrade_from_1_42.html">Upgrade from version
@@ -144,7 +147,7 @@
</p>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: January 01, 2011 at 16:31:27 GMT</small></p></td>
+<td align="left"><p><small>Last revised: December 13, 2012 at 06:53:49 GMT</small></p></td>
<td align="right"><div class="copyright-footer"></div></td>
</tr></table>
<hr>
Modified: branches/release/libs/range/doc/html/quickbook_HTML.manifest
==============================================================================
--- branches/release/libs/range/doc/html/quickbook_HTML.manifest (original)
+++ branches/release/libs/range/doc/html/quickbook_HTML.manifest 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -147,6 +147,7 @@
range/mfc_atl/const_ranges.html
range/mfc_atl/references.html
range/upgrade.html
+range/upgrade/upgrade_from_1_49.html
range/upgrade/upgrade_from_1_45.html
range/upgrade/upgrade_from_1_42.html
range/upgrade/upgrade_from_1_34.html
Modified: branches/release/libs/range/doc/html/range/concepts.html
==============================================================================
--- branches/release/libs/range/doc/html/range/concepts.html (original)
+++ branches/release/libs/range/doc/html/range/concepts.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="introduction.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="concepts/overview.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_concepts">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="range.concepts"></a><a class="link" href="concepts.html" title="Range Concepts">Range Concepts</a>
</h2></div></div></div>
@@ -37,7 +37,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/concepts/bidirectional_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/concepts/bidirectional_range.html (original)
+++ branches/release/libs/range/doc/html/range/concepts/bidirectional_range.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,13 +22,13 @@
<div class="spirit-nav">
<a accesskey="p" href="forward_range.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="random_access_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_concepts_bidirectional_range">
<div class="titlepage"><div><div><h3 class="title">
<a name="range.concepts.bidirectional_range"></a><a class="link" href="bidirectional_range.html" title="Bidirectional Range">Bidirectional Range</a>
</h3></div></div></div>
-<a name="range.concepts.bidirectional_range.notation"></a><h5>
-<a name="id650256"></a>
- <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.notation">Notation</a>
+<h5>
+<a name="range.concepts.bidirectional_range.h0"></a>
+ <span><a name="range.concepts.bidirectional_range.notation"></a></span><a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.notation">Notation</a>
</h5>
<div class="informaltable"><table class="table">
<colgroup>
@@ -64,9 +64,9 @@
</tr>
</tbody>
</table></div>
-<a name="range.concepts.bidirectional_range.description"></a><h5>
-<a name="id650345"></a>
- <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.description">Description</a>
+<h5>
+<a name="range.concepts.bidirectional_range.h1"></a>
+ <span><a name="range.concepts.bidirectional_range.description"></a></span><a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.description">Description</a>
</h5>
<p>
This concept provides access to iterators that traverse in both directions
@@ -74,17 +74,17 @@
of <a href="../../../../../../libs/iterator/doc/new-iter-concepts.html#bidirectional-traversal-iterators-lib-bidirectional-traversal-iterators" target="_top">Bidirectional
Traversal Iterator</a>.
</p>
-<a name="range.concepts.bidirectional_range.refinement_of"></a><h5>
-<a name="id650403"></a>
- <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.refinement_of">Refinement
+<h5>
+<a name="range.concepts.bidirectional_range.h2"></a>
+ <span><a name="range.concepts.bidirectional_range.refinement_of"></a></span><a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.refinement_of">Refinement
of</a>
</h5>
<p>
<a class="link" href="forward_range.html" title="Forward Range">Forward Range</a>
</p>
-<a name="range.concepts.bidirectional_range.associated_types"></a><h5>
-<a name="id650426"></a>
- <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.associated_types">Associated
+<h5>
+<a name="range.concepts.bidirectional_range.h3"></a>
+ <span><a name="range.concepts.bidirectional_range.associated_types"></a></span><a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.associated_types">Associated
types</a>
</h5>
<div class="informaltable"><table class="table">
@@ -135,10 +135,9 @@
</tr>
</tbody>
</table></div>
-<a name="range.concepts.bidirectional_range.valid_expressions"></a><h5>
-<a name="id650581"></a>
- <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.valid_expressions">Valid
- expressions</a>
+<h5>
+<a name="range.concepts.bidirectional_range.h4"></a>
+ <span><a name="range.concepts.bidirectional_range.valid_expressions"></a></span><a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.valid_expressions">Valid expressions</a>
</h5>
<div class="informaltable"><table class="table">
<colgroup>
@@ -220,9 +219,9 @@
</tr>
</tbody>
</table></div>
-<a name="range.concepts.bidirectional_range.complexity_guarantees"></a><h5>
-<a name="id651042"></a>
- <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.complexity_guarantees">Complexity
+<h5>
+<a name="range.concepts.bidirectional_range.h5"></a>
+ <span><a name="range.concepts.bidirectional_range.complexity_guarantees"></a></span><a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.complexity_guarantees">Complexity
guarantees</a>
</h5>
<p>
@@ -231,9 +230,9 @@
<code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">rend</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code> has the same complexity as <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code> from
<a class="link" href="forward_range.html" title="Forward Range">Forward Range</a>.
</p>
-<a name="range.concepts.bidirectional_range.invariants"></a><h5>
-<a name="id651182"></a>
- <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.invariants">Invariants</a>
+<h5>
+<a name="range.concepts.bidirectional_range.h6"></a>
+ <span><a name="range.concepts.bidirectional_range.invariants"></a></span><a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.invariants">Invariants</a>
</h5>
<div class="informaltable"><table class="table">
<colgroup>
@@ -271,9 +270,10 @@
</tr>
</tbody>
</table></div>
-<a name="range.concepts.bidirectional_range.see_also"></a><h5>
-<a name="id651431"></a>
- <a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.see_also">See also</a>
+<h5>
+<a name="range.concepts.bidirectional_range.h7"></a>
+ <span><a name="range.concepts.bidirectional_range.see_also"></a></span><a class="link" href="bidirectional_range.html#range.concepts.bidirectional_range.see_also">See
+ also</a>
</h5>
<p>
<a class="link" href="../reference/concept_implementation/semantics/metafunctions.html" title="Metafunctions">Implementation
@@ -286,7 +286,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/concepts/concept_checking.html
==============================================================================
--- branches/release/libs/range/doc/html/range/concepts/concept_checking.html (original)
+++ branches/release/libs/range/doc/html/range/concepts/concept_checking.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="random_access_range.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../reference.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_concepts_concept_checking">
<div class="titlepage"><div><div><h3 class="title">
<a name="range.concepts.concept_checking"></a><a class="link" href="concept_checking.html" title="Concept Checking">Concept Checking</a>
</h3></div></div></div>
@@ -38,7 +38,6 @@
Range</a> concept.
</p>
<p>
-
</p>
<pre class="programlisting"><span class="identifier">BOOST_CONCEPT_ASSERT</span><span class="special">((</span> <span class="identifier">ForwardRangeConcept</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="special">));</span>
</pre>
@@ -50,7 +49,6 @@
ForwardReadableRange, the following code is required.
</p>
<p>
-
</p>
<pre class="programlisting"><span class="identifier">BOOST_CONCEPT_ASSERT</span><span class="special">((</span> <span class="identifier">ForwardRangeConcept</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="special">));</span>
<span class="identifier">BOOST_CONCEPT_ASSERT</span><span class="special">((</span> <span class="identifier">ReadableIteratorConcept</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span><span class="special">></span> <span class="special">));</span>
@@ -78,9 +76,10 @@
Access Range</a>
</li>
</ul></div>
-<a name="range.concepts.concept_checking.see_also"></a><h5>
-<a name="id652377"></a>
- <a class="link" href="concept_checking.html#range.concepts.concept_checking.see_also">See also</a>
+<h5>
+<a name="range.concepts.concept_checking.h0"></a>
+ <span><a name="range.concepts.concept_checking.see_also"></a></span><a class="link" href="concept_checking.html#range.concepts.concept_checking.see_also">See
+ also</a>
</h5>
<p>
<a class="link" href="../style_guide.html" title="Terminology and style guidelines">Range Terminology and style guidelines</a>
@@ -94,7 +93,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/concepts/forward_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/concepts/forward_range.html (original)
+++ branches/release/libs/range/doc/html/range/concepts/forward_range.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,13 +22,13 @@
<div class="spirit-nav">
<a accesskey="p" href="single_pass_range.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="bidirectional_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_concepts_forward_range">
<div class="titlepage"><div><div><h3 class="title">
<a name="range.concepts.forward_range"></a><a class="link" href="forward_range.html" title="Forward Range">Forward Range</a>
</h3></div></div></div>
-<a name="range.concepts.forward_range.notation"></a><h5>
-<a name="id649886"></a>
- <a class="link" href="forward_range.html#range.concepts.forward_range.notation">Notation</a>
+<h5>
+<a name="range.concepts.forward_range.h0"></a>
+ <span><a name="range.concepts.forward_range.notation"></a></span><a class="link" href="forward_range.html#range.concepts.forward_range.notation">Notation</a>
</h5>
<div class="informaltable"><table class="table">
<colgroup>
@@ -64,24 +64,25 @@
</tr>
</tbody>
</table></div>
-<a name="range.concepts.forward_range.description"></a><h5>
-<a name="id649974"></a>
- <a class="link" href="forward_range.html#range.concepts.forward_range.description">Description</a>
+<h5>
+<a name="range.concepts.forward_range.h1"></a>
+ <span><a name="range.concepts.forward_range.description"></a></span><a class="link" href="forward_range.html#range.concepts.forward_range.description">Description</a>
</h5>
<p>
A range <code class="computeroutput"><span class="identifier">X</span></code> where <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code> is a model of <a href="../../../../../../libs/iterator/doc/new-iter-concepts.html#forward-traversal-iterators-lib-forward-traversal-iterators" target="_top">Forward
Traversal Iterator</a>.
</p>
-<a name="range.concepts.forward_range.refinement_of"></a><h5>
-<a name="id650039"></a>
- <a class="link" href="forward_range.html#range.concepts.forward_range.refinement_of">Refinement of</a>
+<h5>
+<a name="range.concepts.forward_range.h2"></a>
+ <span><a name="range.concepts.forward_range.refinement_of"></a></span><a class="link" href="forward_range.html#range.concepts.forward_range.refinement_of">Refinement
+ of</a>
</h5>
<p>
<a class="link" href="single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
</p>
-<a name="range.concepts.forward_range.associated_types"></a><h5>
-<a name="id650062"></a>
- <a class="link" href="forward_range.html#range.concepts.forward_range.associated_types">Associated
+<h5>
+<a name="range.concepts.forward_range.h3"></a>
+ <span><a name="range.concepts.forward_range.associated_types"></a></span><a class="link" href="forward_range.html#range.concepts.forward_range.associated_types">Associated
types</a>
</h5>
<div class="informaltable"><table class="table">
@@ -131,9 +132,10 @@
</tr>
</tbody>
</table></div>
-<a name="range.concepts.forward_range.see_also"></a><h5>
-<a name="id650211"></a>
- <a class="link" href="forward_range.html#range.concepts.forward_range.see_also">See also</a>
+<h5>
+<a name="range.concepts.forward_range.h4"></a>
+ <span><a name="range.concepts.forward_range.see_also"></a></span><a class="link" href="forward_range.html#range.concepts.forward_range.see_also">See
+ also</a>
</h5>
<p>
<a class="link" href="../reference/concept_implementation/semantics/metafunctions.html" title="Metafunctions">Implementation
@@ -146,7 +148,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/concepts/overview.html
==============================================================================
--- branches/release/libs/range/doc/html/range/concepts/overview.html (original)
+++ branches/release/libs/range/doc/html/range/concepts/overview.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../concepts.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="single_pass_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_concepts_overview">
<div class="titlepage"><div><div><h3 class="title">
<a name="range.concepts.overview"></a><a class="link" href="overview.html" title="Overview">Overview</a>
</h3></div></div></div>
@@ -65,7 +65,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/concepts/random_access_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/concepts/random_access_range.html (original)
+++ branches/release/libs/range/doc/html/range/concepts/random_access_range.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,30 +22,29 @@
<div class="spirit-nav">
<a accesskey="p" href="bidirectional_range.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="concept_checking.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_concepts_random_access_range">
<div class="titlepage"><div><div><h3 class="title">
<a name="range.concepts.random_access_range"></a><a class="link" href="random_access_range.html" title="Random Access Range">Random Access Range</a>
</h3></div></div></div>
-<a name="range.concepts.random_access_range.description"></a><h5>
-<a name="id651477"></a>
- <a class="link" href="random_access_range.html#range.concepts.random_access_range.description">Description</a>
+<h5>
+<a name="range.concepts.random_access_range.h0"></a>
+ <span><a name="range.concepts.random_access_range.description"></a></span><a class="link" href="random_access_range.html#range.concepts.random_access_range.description">Description</a>
</h5>
<p>
A range <code class="computeroutput"><span class="identifier">X</span></code> where <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code> is a model of <a href="../../../../../../libs/iterator/doc/new-iter-concepts.html#random-access-traversal-iterators-lib-random-access-traversal-iterators" target="_top">Random
Access Traversal Iterator</a>.
</p>
-<a name="range.concepts.random_access_range.refinement_of"></a><h5>
-<a name="id651543"></a>
- <a class="link" href="random_access_range.html#range.concepts.random_access_range.refinement_of">Refinement
+<h5>
+<a name="range.concepts.random_access_range.h1"></a>
+ <span><a name="range.concepts.random_access_range.refinement_of"></a></span><a class="link" href="random_access_range.html#range.concepts.random_access_range.refinement_of">Refinement
of</a>
</h5>
<p>
<a class="link" href="bidirectional_range.html" title="Bidirectional Range">Bidirectional Range</a>
</p>
-<a name="range.concepts.random_access_range.valid_expressions"></a><h5>
-<a name="id651566"></a>
- <a class="link" href="random_access_range.html#range.concepts.random_access_range.valid_expressions">Valid
- expressions</a>
+<h5>
+<a name="range.concepts.random_access_range.h2"></a>
+ <span><a name="range.concepts.random_access_range.valid_expressions"></a></span><a class="link" href="random_access_range.html#range.concepts.random_access_range.valid_expressions">Valid expressions</a>
</h5>
<div class="informaltable"><table class="table">
<colgroup>
@@ -88,9 +87,9 @@
</td>
</tr></tbody>
</table></div>
-<a name="range.concepts.random_access_range.expression_semantics"></a><h5>
-<a name="id651704"></a>
- <a class="link" href="random_access_range.html#range.concepts.random_access_range.expression_semantics">Expression
+<h5>
+<a name="range.concepts.random_access_range.h3"></a>
+ <span><a name="range.concepts.random_access_range.expression_semantics"></a></span><a class="link" href="random_access_range.html#range.concepts.random_access_range.expression_semantics">Expression
semantics</a>
</h5>
<div class="informaltable"><table class="table">
@@ -138,17 +137,17 @@
</td>
</tr></tbody>
</table></div>
-<a name="range.concepts.random_access_range.complexity_guarantees"></a><h5>
-<a name="id651919"></a>
- <a class="link" href="random_access_range.html#range.concepts.random_access_range.complexity_guarantees">Complexity
+<h5>
+<a name="range.concepts.random_access_range.h4"></a>
+ <span><a name="range.concepts.random_access_range.complexity_guarantees"></a></span><a class="link" href="random_access_range.html#range.concepts.random_access_range.complexity_guarantees">Complexity
guarantees</a>
</h5>
<p>
<code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">size</span><span class="special">(</span><span class="identifier">a</span><span class="special">)</span></code> completes in amortized constant time.
</p>
-<a name="range.concepts.random_access_range.invariants"></a><h5>
-<a name="id651967"></a>
- <a class="link" href="random_access_range.html#range.concepts.random_access_range.invariants">Invariants</a>
+<h5>
+<a name="range.concepts.random_access_range.h5"></a>
+ <span><a name="range.concepts.random_access_range.invariants"></a></span><a class="link" href="random_access_range.html#range.concepts.random_access_range.invariants">Invariants</a>
</h5>
<div class="informaltable"><table class="table">
<colgroup>
@@ -173,7 +172,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/concepts/single_pass_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/concepts/single_pass_range.html (original)
+++ branches/release/libs/range/doc/html/range/concepts/single_pass_range.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,13 +22,13 @@
<div class="spirit-nav">
<a accesskey="p" href="overview.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concepts.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="forward_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_concepts_single_pass_range">
<div class="titlepage"><div><div><h3 class="title">
<a name="range.concepts.single_pass_range"></a><a class="link" href="single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
</h3></div></div></div>
-<a name="range.concepts.single_pass_range.notation"></a><h5>
-<a name="id648593"></a>
- <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.notation">Notation</a>
+<h5>
+<a name="range.concepts.single_pass_range.h0"></a>
+ <span><a name="range.concepts.single_pass_range.notation"></a></span><a class="link" href="single_pass_range.html#range.concepts.single_pass_range.notation">Notation</a>
</h5>
<div class="informaltable"><table class="table">
<colgroup>
@@ -64,17 +64,17 @@
</tr>
</tbody>
</table></div>
-<a name="range.concepts.single_pass_range.description"></a><h5>
-<a name="id648686"></a>
- <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.description">Description</a>
+<h5>
+<a name="range.concepts.single_pass_range.h1"></a>
+ <span><a name="range.concepts.single_pass_range.description"></a></span><a class="link" href="single_pass_range.html#range.concepts.single_pass_range.description">Description</a>
</h5>
<p>
A range <code class="computeroutput"><span class="identifier">X</span></code> where <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code> is a model of <a href="../../../../../../libs/iterator/doc/new-iter-concepts.html#singls-pass-iterators-lib-single-pass-iterators" target="_top">Single
Pass Iterator</a>.
</p>
-<a name="range.concepts.single_pass_range.associated_types"></a><h5>
-<a name="id648751"></a>
- <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.associated_types">Associated
+<h5>
+<a name="range.concepts.single_pass_range.h2"></a>
+ <span><a name="range.concepts.single_pass_range.associated_types"></a></span><a class="link" href="single_pass_range.html#range.concepts.single_pass_range.associated_types">Associated
types</a>
</h5>
<div class="informaltable"><table class="table">
@@ -125,9 +125,9 @@
</tr>
</tbody>
</table></div>
-<a name="range.concepts.single_pass_range.valid_expressions"></a><h5>
-<a name="id648914"></a>
- <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.valid_expressions">Valid
+<h5>
+<a name="range.concepts.single_pass_range.h3"></a>
+ <span><a name="range.concepts.single_pass_range.valid_expressions"></a></span><a class="link" href="single_pass_range.html#range.concepts.single_pass_range.valid_expressions">Valid
expressions</a>
</h5>
<p>
@@ -197,9 +197,9 @@
</tr>
</tbody>
</table></div>
-<a name="range.concepts.single_pass_range.expression_semantics"></a><h5>
-<a name="id649233"></a>
- <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.expression_semantics">Expression
+<h5>
+<a name="range.concepts.single_pass_range.h4"></a>
+ <span><a name="range.concepts.single_pass_range.expression_semantics"></a></span><a class="link" href="single_pass_range.html#range.concepts.single_pass_range.expression_semantics">Expression
semantics</a>
</h5>
<div class="informaltable"><table class="table">
@@ -265,9 +265,9 @@
</tr>
</tbody>
</table></div>
-<a name="range.concepts.single_pass_range.complexity_guarantees"></a><h5>
-<a name="id649490"></a>
- <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.complexity_guarantees">Complexity
+<h5>
+<a name="range.concepts.single_pass_range.h5"></a>
+ <span><a name="range.concepts.single_pass_range.complexity_guarantees"></a></span><a class="link" href="single_pass_range.html#range.concepts.single_pass_range.complexity_guarantees">Complexity
guarantees</a>
</h5>
<p>
@@ -275,9 +275,9 @@
constant time. For most practical purposes, one can expect both to be amortized
constant time.
</p>
-<a name="range.concepts.single_pass_range.invariants"></a><h5>
-<a name="id649567"></a>
- <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.invariants">Invariants</a>
+<h5>
+<a name="range.concepts.single_pass_range.h6"></a>
+ <span><a name="range.concepts.single_pass_range.invariants"></a></span><a class="link" href="single_pass_range.html#range.concepts.single_pass_range.invariants">Invariants</a>
</h5>
<div class="informaltable"><table class="table">
<colgroup>
@@ -315,9 +315,10 @@
</tr>
</tbody>
</table></div>
-<a name="range.concepts.single_pass_range.see_also"></a><h5>
-<a name="id649823"></a>
- <a class="link" href="single_pass_range.html#range.concepts.single_pass_range.see_also">See also</a>
+<h5>
+<a name="range.concepts.single_pass_range.h7"></a>
+ <span><a name="range.concepts.single_pass_range.see_also"></a></span><a class="link" href="single_pass_range.html#range.concepts.single_pass_range.see_also">See
+ also</a>
</h5>
<p>
<a class="link" href="../reference/extending.html" title="Extending the library">Extending the library for UDTs</a>
@@ -336,7 +337,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/examples.html
==============================================================================
--- branches/release/libs/range/doc/html/range/examples.html (original)
+++ branches/release/libs/range/doc/html/range/examples.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="headers/algorithm_ext.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="mfc_atl.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_examples">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="range.examples"></a><a class="link" href="examples.html" title="Examples">Examples</a>
</h2></div></div></div>
@@ -60,7 +60,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/faq.html
==============================================================================
--- branches/release/libs/range/doc/html/range/faq.html (original)
+++ branches/release/libs/range/doc/html/range/faq.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="portability.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="history_ack.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_faq">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="range.faq"></a><a class="link" href="faq.html" title="FAQ">FAQ</a>
</h2></div></div></div>
@@ -75,7 +75,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/headers.html
==============================================================================
--- branches/release/libs/range/doc/html/range/headers.html (original)
+++ branches/release/libs/range/doc/html/range/headers.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="style_guide.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="headers/general.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_headers">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="range.headers"></a><a class="link" href="headers.html" title="Library Headers">Library Headers</a>
</h2></div></div></div>
@@ -35,7 +35,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/headers/adaptors.html
==============================================================================
--- branches/release/libs/range/doc/html/range/headers/adaptors.html (original)
+++ branches/release/libs/range/doc/html/range/headers/adaptors.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="general.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../headers.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="algorithm.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_headers_adaptors">
<div class="titlepage"><div><div><h3 class="title">
<a name="range.headers.adaptors"></a><a class="link" href="adaptors.html" title="Adaptors">Adaptors</a>
</h3></div></div></div>
@@ -218,7 +218,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/headers/algorithm.html
==============================================================================
--- branches/release/libs/range/doc/html/range/headers/algorithm.html (original)
+++ branches/release/libs/range/doc/html/range/headers/algorithm.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="adaptors.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../headers.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="algorithm_ext.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_headers_algorithm">
<div class="titlepage"><div><div><h3 class="title">
<a name="range.headers.algorithm"></a><a class="link" href="algorithm.html" title="Algorithm">Algorithm</a>
</h3></div></div></div>
@@ -669,7 +669,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/headers/algorithm_ext.html
==============================================================================
--- branches/release/libs/range/doc/html/range/headers/algorithm_ext.html (original)
+++ branches/release/libs/range/doc/html/range/headers/algorithm_ext.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="algorithm.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../headers.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../examples.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_headers_algorithm_ext">
<div class="titlepage"><div><div><h3 class="title">
<a name="range.headers.algorithm_ext"></a><a class="link" href="algorithm_ext.html" title="Algorithm Extensions">Algorithm Extensions</a>
</h3></div></div></div>
@@ -157,7 +157,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/headers/general.html
==============================================================================
--- branches/release/libs/range/doc/html/range/headers/general.html (original)
+++ branches/release/libs/range/doc/html/range/headers/general.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../headers.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../headers.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="adaptors.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_headers_general">
<div class="titlepage"><div><div><h3 class="title">
<a name="range.headers.general"></a><a class="link" href="general.html" title="General">General</a>
</h3></div></div></div>
@@ -537,7 +537,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/history_ack.html
==============================================================================
--- branches/release/libs/range/doc/html/range/history_ack.html (original)
+++ branches/release/libs/range/doc/html/range/history_ack.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -21,14 +21,14 @@
<div class="spirit-nav">
<a accesskey="p" href="faq.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a>
</div>
-<div class="section">
+<div class="section range_history_ack">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="range.history_ack"></a><a class="link" href="history_ack.html" title="History and Acknowledgement">History and Acknowledgement</a>
</h2></div></div></div>
-<a name="range.history_ack.version_1___before_boost_1_43"></a><h4>
-<a name="id786758"></a>
- <a class="link" href="history_ack.html#range.history_ack.version_1___before_boost_1_43">Version 1 -
- before Boost 1.43</a>
+<h4>
+<a name="range.history_ack.h0"></a>
+ <span><a name="range.history_ack.version_1___before_boost_1_43"></a></span><a class="link" href="history_ack.html#range.history_ack.version_1___before_boost_1_43">Version
+ 1 - before Boost 1.43</a>
</h4>
<p>
The library have been under way for a long time. Dietmar Kühl originally intended
@@ -72,15 +72,15 @@
Hartmut Kaiser for being review manager
</li>
<li class="listitem">
- Jonathan Turkanis for porting the lib (as far sa possible) to vc6 and vc7.
+ Jonathan Turkanis for porting the lib (as far as possible) to vc6 and vc7.
</li>
</ul></div>
<p>
The concept checks and their documentation was provided by Daniel Walker.
</p>
-<a name="range.history_ack.version_2___boost_1_43_and_beyond"></a><h4>
-<a name="id786859"></a>
- <a class="link" href="history_ack.html#range.history_ack.version_2___boost_1_43_and_beyond">Version
+<h4>
+<a name="range.history_ack.h1"></a>
+ <span><a name="range.history_ack.version_2___boost_1_43_and_beyond"></a></span><a class="link" href="history_ack.html#range.history_ack.version_2___boost_1_43_and_beyond">Version
2 - Boost 1.43 and beyond</a>
</h4>
<p>
@@ -142,7 +142,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/introduction.html
==============================================================================
--- branches/release/libs/range/doc/html/range/introduction.html (original)
+++ branches/release/libs/range/doc/html/range/introduction.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../index.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="concepts.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_introduction">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="range.introduction"></a><a class="link" href="introduction.html" title="Introduction">Introduction</a>
</h2></div></div></div>
@@ -69,13 +69,12 @@
arrays?)
</li>
</ul></div>
-<a name="range.introduction.example___iterate_over_the_values_in_a_map"></a><h4>
-<a name="id607240"></a>
- <a class="link" href="introduction.html#range.introduction.example___iterate_over_the_values_in_a_map">Example
+<h4>
+<a name="range.introduction.h0"></a>
+ <span><a name="range.introduction.example___iterate_over_the_values_in_a_map"></a></span><a class="link" href="introduction.html#range.introduction.example___iterate_over_the_values_in_a_map">Example
- Iterate over the values in a map</a>
</h4>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">;</span>
<span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
@@ -83,13 +82,12 @@
</pre>
<p>
</p>
-<a name="range.introduction.example___iterate_over_the_keys_in_a_map"></a><h4>
-<a name="id607360"></a>
- <a class="link" href="introduction.html#range.introduction.example___iterate_over_the_keys_in_a_map">Example
+<h4>
+<a name="range.introduction.h1"></a>
+ <span><a name="range.introduction.example___iterate_over_the_keys_in_a_map"></a></span><a class="link" href="introduction.html#range.introduction.example___iterate_over_the_keys_in_a_map">Example
- Iterate over the keys in a map</a>
</h4>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">;</span>
<span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
@@ -97,25 +95,25 @@
</pre>
<p>
</p>
-<a name="range.introduction.example___push_the_even_values_from_a_map_in_reverse_order_into_the_container__code__phrase_role__identifier__target__phrase___code_"></a><h4>
-<a name="id648314"></a>
- <a class="link" href="introduction.html#range.introduction.example___push_the_even_values_from_a_map_in_reverse_order_into_the_container__code__phrase_role__identifier__target__phrase___code_">Example
+<h4>
+<a name="range.introduction.h2"></a>
+ <span><a name="range.introduction.example___push_the_even_values_from_a_map_in_reverse_order_into_the_container__code__phrase_role__identifier__target__phrase___code_"></a></span><a class="link" href="introduction.html#range.introduction.example___push_the_even_values_from_a_map_in_reverse_order_into_the_container__code__phrase_role__identifier__target__phrase___code_">Example
- Push the even values from a map in reverse order into the container <code class="computeroutput"><span class="identifier">target</span></code></a>
</h4>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">;</span>
<span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
-<span class="comment">// Assume that is_even is a predicate that has been implemented elsewhere...
-</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">target</span><span class="special">,</span> <span class="identifier">my_map</span> <span class="special">|</span> <span class="identifier">map_values</span> <span class="special">|</span> <span class="identifier">filtered</span><span class="special">(</span><span class="identifier">is_even</span><span class="special">())</span> <span class="special">|</span> <span class="identifier">reversed</span><span class="special">);</span>
+<span class="comment">// Assume that is_even is a predicate that has been implemented elsewhere...</span>
+<span class="identifier">push_back</span><span class="special">(</span><span class="identifier">target</span><span class="special">,</span> <span class="identifier">my_map</span> <span class="special">|</span> <span class="identifier">map_values</span> <span class="special">|</span> <span class="identifier">filtered</span><span class="special">(</span><span class="identifier">is_even</span><span class="special">())</span> <span class="special">|</span> <span class="identifier">reversed</span><span class="special">);</span>
</pre>
<p>
</p>
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/mfc_atl.html
==============================================================================
--- branches/release/libs/range/doc/html/range/mfc_atl.html (original)
+++ branches/release/libs/range/doc/html/range/mfc_atl.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="examples.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="mfc_atl/requirements.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_mfc_atl">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="range.mfc_atl"></a><a class="link" href="mfc_atl.html" title="MFC/ATL (courtesy of Shunsuke Sogame)">MFC/ATL (courtesy of Shunsuke Sogame)</a>
</h2></div></div></div>
@@ -33,9 +33,9 @@
<dt><span class="section">const Ranges</span></dt>
<dt><span class="section">References</span></dt>
</dl></div>
-<a name="range.mfc_atl.introduction"></a><h5>
-<a name="id780286"></a>
- <a class="link" href="mfc_atl.html#range.mfc_atl.introduction">Introduction</a>
+<h5>
+<a name="range.mfc_atl.h0"></a>
+ <span><a name="range.mfc_atl.introduction"></a></span><a class="link" href="mfc_atl.html#range.mfc_atl.introduction">Introduction</a>
</h5>
<p>
This implementation was kindly donated by Shunsuke Sogame. This header adapts
@@ -99,16 +99,15 @@
</tr>
</tbody>
</table></div>
-<a name="range.mfc_atl.overview"></a><h5>
-<a name="id780420"></a>
- <a class="link" href="mfc_atl.html#range.mfc_atl.overview">Overview</a>
+<h5>
+<a name="range.mfc_atl.h1"></a>
+ <span><a name="range.mfc_atl.overview"></a></span><a class="link" href="mfc_atl.html#range.mfc_atl.overview">Overview</a>
</h5>
<p>
Boost.Range MFC/ATL Extension provides Boost.Range support for MFC/ATL collection
and string types.
</p>
<p>
-
</p>
<pre class="programlisting"><span class="identifier">CTypedPtrArray</span><span class="special"><</span><span class="identifier">CPtrArray</span><span class="special">,</span> <span class="identifier">CList</span><span class="special"><</span><span class="identifier">CString</span><span class="special">></span> <span class="special">*></span> <span class="identifier">myArray</span><span class="special">;</span>
<span class="special">...</span>
@@ -127,7 +126,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/mfc_atl/atl_ranges.html
==============================================================================
--- branches/release/libs/range/doc/html/range/mfc_atl/atl_ranges.html (original)
+++ branches/release/libs/range/doc/html/range/mfc_atl/atl_ranges.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="mfc_ranges.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="const_ranges.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_mfc_atl_atl_ranges">
<div class="titlepage"><div><div><h3 class="title">
<a name="range.mfc_atl.atl_ranges"></a><a class="link" href="atl_ranges.html" title="ATL Ranges">ATL Ranges</a>
</h3></div></div></div>
@@ -360,7 +360,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/mfc_atl/const_ranges.html
==============================================================================
--- branches/release/libs/range/doc/html/range/mfc_atl/const_ranges.html (original)
+++ branches/release/libs/range/doc/html/range/mfc_atl/const_ranges.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="atl_ranges.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="references.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_mfc_atl_const_ranges">
<div class="titlepage"><div><div><h3 class="title">
<a name="range.mfc_atl.const_ranges"></a><a class="link" href="const_ranges.html" title="const Ranges">const Ranges</a>
</h3></div></div></div>
@@ -33,7 +33,6 @@
be the same as <code class="computeroutput"><span class="identifier">range_reference</span><span class="special"><</span><span class="identifier">Range</span><span class="special">>::</span><span class="identifier">type</span></code>.
</p>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">if</span> <span class="special">(</span><span class="identifier">Range</span> <span class="identifier">is</span> <span class="identifier">CObArray</span> <span class="special">||</span> <span class="identifier">Range</span> <span class="identifier">is</span> <span class="identifier">CObList</span><span class="special">)</span>
<span class="keyword">return</span> <span class="identifier">CObject</span> <span class="keyword">const</span> <span class="special">*</span> <span class="special">&</span>
@@ -111,7 +110,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/mfc_atl/mfc_ranges.html
==============================================================================
--- branches/release/libs/range/doc/html/range/mfc_atl/mfc_ranges.html (original)
+++ branches/release/libs/range/doc/html/range/mfc_atl/mfc_ranges.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="requirements.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="atl_ranges.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_mfc_atl_mfc_ranges">
<div class="titlepage"><div><div><h3 class="title">
<a name="range.mfc_atl.mfc_ranges"></a><a class="link" href="mfc_ranges.html" title="MFC Ranges">MFC Ranges</a>
</h3></div></div></div>
@@ -466,7 +466,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/mfc_atl/references.html
==============================================================================
--- branches/release/libs/range/doc/html/range/mfc_atl/references.html (original)
+++ branches/release/libs/range/doc/html/range/mfc_atl/references.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="const_ranges.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../upgrade.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_mfc_atl_references">
<div class="titlepage"><div><div><h3 class="title">
<a name="range.mfc_atl.references"></a><a class="link" href="references.html" title="References">References</a>
</h3></div></div></div>
@@ -42,7 +42,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/mfc_atl/requirements.html
==============================================================================
--- branches/release/libs/range/doc/html/range/mfc_atl/requirements.html (original)
+++ branches/release/libs/range/doc/html/range/mfc_atl/requirements.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../mfc_atl.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mfc_atl.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="mfc_ranges.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_mfc_atl_requirements">
<div class="titlepage"><div><div><h3 class="title">
<a name="range.mfc_atl.requirements"></a><a class="link" href="requirements.html" title="Requirements">Requirements</a>
</h3></div></div></div>
@@ -37,7 +37,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/portability.html
==============================================================================
--- branches/release/libs/range/doc/html/range/portability.html (original)
+++ branches/release/libs/range/doc/html/range/portability.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="upgrade/upgrade_from_1_34.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="faq.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_portability">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="range.portability"></a><a class="link" href="portability.html" title="Portability">Portability</a>
</h2></div></div></div>
@@ -62,24 +62,23 @@
rvalue problems,
</li>
<li class="listitem">
-<p class="simpara">
do not rely on ADL:
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+ <div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
- if you overload functions, include that header before the headers in
- this library,
- </li>
+ if you overload functions, include that header before the headers
+ in this library,
+ </li>
<li class="listitem">
- put all overloads in namespace boost.
- </li>
+ put all overloads in namespace boost.
+ </li>
</ul></div>
-</li>
+ </li>
</ol></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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference.html (original)
+++ branches/release/libs/range/doc/html/range/reference.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="concepts/concept_checking.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="reference/overview.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="range.reference"></a><a class="link" href="reference.html" title="Reference">Reference</a>
</h2></div></div></div>
@@ -82,7 +82,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="concept_implementation/semantics/functions.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="adaptors/introduction.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_adaptors">
<div class="titlepage"><div><div><h3 class="title">
<a name="range.reference.adaptors"></a><a class="link" href="adaptors.html" title="Range Adaptors">Range Adaptors</a>
</h3></div></div></div>
@@ -36,7 +36,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/general_requirements.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/general_requirements.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/general_requirements.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="introduction.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="reference.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_adaptors_general_requirements">
<div class="titlepage"><div><div><h4 class="title">
<a name="range.reference.adaptors.general_requirements"></a><a class="link" href="general_requirements.html" title="General Requirements">General
Requirements</a>
@@ -87,7 +87,7 @@
regardless of the input.
</p>
<p>
- Furthermore, the following rules apply to any expression of the form
+ Furthermore, the following rules apply to any expression of the form
</p>
<pre class="programlisting"><span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">adaptor_generator</span>
</pre>
@@ -127,7 +127,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/introduction.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/introduction.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/introduction.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../adaptors.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="general_requirements.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_adaptors_introduction">
<div class="titlepage"><div><div><h4 class="title">
<a name="range.reference.adaptors.introduction"></a><a class="link" href="introduction.html" title="Introduction and motivation">Introduction
and motivation</a>
@@ -35,7 +35,6 @@
In this example
</p>
<p>
-
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptors</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
@@ -55,7 +54,6 @@
do not need to know it. All that is relevant is that the expression
</p>
<p>
-
</p>
<pre class="programlisting"><span class="identifier">vec</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reversed</span>
</pre>
@@ -82,7 +80,6 @@
Why do I prefer the <code class="computeroutput"><span class="keyword">operator</span><span class="special">|</span></code> syntax? The answer is readability:
</p>
<p>
-
</p>
<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="identifier">vec</span><span class="special">;</span>
<span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reverse</span><span class="special">(</span><span class="identifier">vec</span><span class="special">),</span>
@@ -95,7 +92,6 @@
much worse. Just compare
</p>
<p>
-
</p>
<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="identifier">vec</span><span class="special">;</span>
<span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">unique</span><span class="special">(</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reverse</span><span class="special">(</span> <span class="identifier">vec</span> <span class="special">)</span> <span class="special">),</span>
@@ -107,7 +103,6 @@
to
</p>
<p>
-
</p>
<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="identifier">vec</span><span class="special">;</span>
<span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span> <span class="identifier">vec</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reversed</span>
@@ -121,9 +116,9 @@
these arguments are expressed with function call notation too. In those
situations, you will really appreciate the succinctness of <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>.
</p>
-<a name="range.reference.adaptors.introduction.composition_of_adaptors"></a><h6>
-<a name="id659630"></a>
- <a class="link" href="introduction.html#range.reference.adaptors.introduction.composition_of_adaptors">Composition
+<h6>
+<a name="range.reference.adaptors.introduction.h0"></a>
+ <span><a name="range.reference.adaptors.introduction.composition_of_adaptors"></a></span><a class="link" href="introduction.html#range.reference.adaptors.introduction.composition_of_adaptors">Composition
of Adaptors</a>
</h6>
<p>
@@ -168,35 +163,33 @@
is redundant development overhead for each new algorithm. The Adaptor Generator
is the design solution to this problem.
</p>
-<a name="range.reference.adaptors.introduction.range_adaptor_alternative_to_copy_if_algorithm"></a><h6>
-<a name="id659939"></a>
- <a class="link" href="introduction.html#range.reference.adaptors.introduction.range_adaptor_alternative_to_copy_if_algorithm">Range
+<h6>
+<a name="range.reference.adaptors.introduction.h1"></a>
+ <span><a name="range.reference.adaptors.introduction.range_adaptor_alternative_to_copy_if_algorithm"></a></span><a class="link" href="introduction.html#range.reference.adaptors.introduction.range_adaptor_alternative_to_copy_if_algorithm">Range
Adaptor alternative to copy_if algorithm</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy_if</span><span class="special">(</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">pred</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">);</span>
</pre>
<p>
- can be expressed as
+ can be expressed as
</p>
<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span> <span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">filtered</span><span class="special">(</span><span class="identifier">pred</span><span class="special">),</span> <span class="identifier">out</span> <span class="special">);</span>
</pre>
<p>
</p>
-<a name="range.reference.adaptors.introduction.range_adaptor_alternative_to_count_if_algorithm"></a><h6>
-<a name="id660104"></a>
- <a class="link" href="introduction.html#range.reference.adaptors.introduction.range_adaptor_alternative_to_count_if_algorithm">Range
+<h6>
+<a name="range.reference.adaptors.introduction.h2"></a>
+ <span><a name="range.reference.adaptors.introduction.range_adaptor_alternative_to_count_if_algorithm"></a></span><a class="link" href="introduction.html#range.reference.adaptors.introduction.range_adaptor_alternative_to_count_if_algorithm">Range
Adaptor alternative to count_if algorithm</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">count_if</span><span class="special">(</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">pred</span> <span class="special">);</span>
</pre>
<p>
- can be expressed as
+ can be expressed as
</p>
<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">count</span><span class="special">(</span> <span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">filtered</span><span class="special">(</span><span class="identifier">pred</span><span class="special">),</span> <span class="identifier">out</span> <span class="special">);</span>
</pre>
@@ -209,7 +202,6 @@
the somewhat misdesigned <code class="computeroutput"><span class="identifier">replace_copy_if</span><span class="special">()</span></code> which may be used as
</p>
<p>
-
</p>
<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="identifier">vec</span><span class="special">;</span>
<span class="identifier">boost</span><span class="special">::</span><span class="identifier">replace_copy_if</span><span class="special">(</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">back_inserter</span><span class="special">(</span><span class="identifier">vec</span><span class="special">),</span> <span class="identifier">pred</span> <span class="special">);</span>
@@ -220,7 +212,6 @@
With adaptors and algorithms we can express this as
</p>
<p>
-
</p>
<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="identifier">vec</span><span class="special">;</span>
<span class="identifier">boost</span><span class="special">::</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">vec</span><span class="special">,</span> <span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">replaced_if</span><span class="special">(</span><span class="identifier">pred</span><span class="special">,</span> <span class="identifier">new_value</span><span class="special">));</span>
@@ -236,7 +227,7 @@
</p>
<p>
2. it is <span class="emphasis"><em><span class="bold"><strong>flexible</strong></span></em></span>
- as we can subsequently apply even more adaptors, for example:
+ as we can subsequently apply even more adaptors, for example:
</p>
<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">push_back</span><span class="special">(</span><span class="identifier">vec</span><span class="special">,</span> <span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">replaced_if</span><span class="special">(</span><span class="identifier">pred</span><span class="special">,</span> <span class="identifier">new_value</span><span class="special">)</span>
<span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">reversed</span><span class="special">);</span>
@@ -270,7 +261,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="general_requirements.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../adaptors.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="reference/adjacent_filtered.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_adaptors_reference">
<div class="titlepage"><div><div><h4 class="title">
<a name="range.reference.adaptors.reference"></a><a class="link" href="reference.html" title="Reference">Reference</a>
</h4></div></div></div>
@@ -47,7 +47,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/adjacent_filtered.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/adjacent_filtered.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/adjacent_filtered.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../reference.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="copied.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_adjacent_filtered">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.adaptors.reference.adjacent_filtered"></a><a class="link" href="adjacent_filtered.html" title="adjacent_filtered">adjacent_filtered</a>
</h5></div></div></div>
@@ -102,13 +102,12 @@
and <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>
</li>
</ul></div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_adjacent_filtered_adjacent_filtered_example">
<div class="titlepage"><div><div><h6 class="title">
<a name="range.reference.adaptors.reference.adjacent_filtered.adjacent_filtered_example"></a><a class="link" href="adjacent_filtered.html#range.reference.adaptors.reference.adjacent_filtered.adjacent_filtered_example" title="adjacent_filtered example">adjacent_filtered
example</a>
</h6></div></div></div>
<p>
-
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">adjacent_filtered</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
@@ -137,7 +136,7 @@
</p>
</div>
<p>
- This would produce the output:
+ This would produce the output:
</p>
<pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span>
</pre>
@@ -146,7 +145,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/copied.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/copied.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/copied.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="adjacent_filtered.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="filtered.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_copied">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.adaptors.reference.copied"></a><a class="link" href="copied.html" title="copied">copied</a>
</h5></div></div></div>
@@ -99,13 +99,12 @@
Access Range</a>
</li>
</ul></div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_copied_copied_example">
<div class="titlepage"><div><div><h6 class="title">
<a name="range.reference.adaptors.reference.copied.copied_example"></a><a class="link" href="copied.html#range.reference.adaptors.reference.copied.copied_example" title="copied example">copied
example</a>
</h6></div></div></div>
<p>
-
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">copied</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
@@ -133,7 +132,7 @@
</p>
</div>
<p>
- This would produce the output:
+ This would produce the output:
</p>
<pre class="programlisting"><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span>
</pre>
@@ -142,7 +141,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/filtered.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/filtered.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/filtered.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="copied.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="indexed.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_filtered">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.adaptors.reference.filtered"></a><a class="link" href="filtered.html" title="filtered">filtered</a>
</h5></div></div></div>
@@ -102,13 +102,12 @@
Range</a>
</li>
</ul></div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_filtered_filtered_example">
<div class="titlepage"><div><div><h6 class="title">
<a name="range.reference.adaptors.reference.filtered.filtered_example"></a><a class="link" href="filtered.html#range.reference.adaptors.reference.filtered.filtered_example" title="filtered example">filtered
example</a>
</h6></div></div></div>
<p>
-
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">filtered</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
@@ -139,7 +138,7 @@
</p>
</div>
<p>
- This would produce the output:
+ This would produce the output:
</p>
<pre class="programlisting"><span class="number">2</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">8</span>
</pre>
@@ -148,7 +147,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/indexed.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/indexed.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/indexed.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="filtered.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="indirected.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_indexed">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.adaptors.reference.indexed"></a><a class="link" href="indexed.html" title="indexed">indexed</a>
</h5></div></div></div>
@@ -94,13 +94,12 @@
category of <code class="computeroutput"><span class="identifier">rng</span></code>
</li>
</ul></div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_indexed_indexed_example">
<div class="titlepage"><div><div><h6 class="title">
<a name="range.reference.adaptors.reference.indexed.indexed_example"></a><a class="link" href="indexed.html#range.reference.adaptors.reference.indexed.indexed_example" title="indexed example">indexed
example</a>
</h6></div></div></div>
<p>
-
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">indexed</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
@@ -162,7 +161,7 @@
</p>
</div>
<p>
- This would produce the output:
+ This would produce the output:
</p>
<pre class="programlisting"><span class="identifier">Element</span> <span class="special">=</span> <span class="number">10</span> <span class="identifier">Index</span> <span class="special">=</span> <span class="number">0</span>
<span class="identifier">Element</span> <span class="special">=</span> <span class="number">20</span> <span class="identifier">Index</span> <span class="special">=</span> <span class="number">1</span>
@@ -179,7 +178,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/indirected.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/indirected.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/indirected.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="indexed.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="map_keys.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_indirected">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.adaptors.reference.indirected"></a><a class="link" href="indirected.html" title="indirected">indirected</a>
</h5></div></div></div>
@@ -98,13 +98,12 @@
category of <code class="computeroutput"><span class="identifier">rng</span></code>
</li>
</ul></div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_indirected_indirected_example">
<div class="titlepage"><div><div><h6 class="title">
<a name="range.reference.adaptors.reference.indirected.indirected_example"></a><a class="link" href="indirected.html#range.reference.adaptors.reference.indirected.indirected_example" title="indirected example">indirected
example</a>
</h6></div></div></div>
<p>
-
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">indirected</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
@@ -133,7 +132,7 @@
</p>
</div>
<p>
- This would produce the output:
+ This would produce the output:
</p>
<pre class="programlisting"><span class="number">0</span><span class="special">,</span><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span>
</pre>
@@ -142,7 +141,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/map_keys.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/map_keys.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/map_keys.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="indirected.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="map_values.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_map_keys">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.adaptors.reference.map_keys"></a><a class="link" href="map_keys.html" title="map_keys">map_keys</a>
</h5></div></div></div>
@@ -97,13 +97,12 @@
category of <code class="computeroutput"><span class="identifier">rng</span></code>.
</li>
</ul></div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_map_keys_map_keys_example">
<div class="titlepage"><div><div><h6 class="title">
<a name="range.reference.adaptors.reference.map_keys.map_keys_example"></a><a class="link" href="map_keys.html#range.reference.adaptors.reference.map_keys.map_keys_example" title="map_keys example">map_keys
example</a>
</h6></div></div></div>
<p>
-
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">map</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
@@ -133,7 +132,7 @@
</p>
</div>
<p>
- This would produce the output:
+ This would produce the output:
</p>
<pre class="programlisting"><span class="number">0</span><span class="special">,</span><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span>
</pre>
@@ -142,7 +141,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/map_values.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/map_values.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/map_values.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="map_keys.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="replaced.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_map_values">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.adaptors.reference.map_values"></a><a class="link" href="map_values.html" title="map_values">map_values</a>
</h5></div></div></div>
@@ -99,13 +99,12 @@
category of <code class="computeroutput"><span class="identifier">rng</span></code>.
</li>
</ul></div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_map_values_map_values_example">
<div class="titlepage"><div><div><h6 class="title">
<a name="range.reference.adaptors.reference.map_values.map_values_example"></a><a class="link" href="map_values.html#range.reference.adaptors.reference.map_values.map_values_example" title="map_values example">map_values
example</a>
</h6></div></div></div>
<p>
-
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">map</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
@@ -135,7 +134,7 @@
</p>
</div>
<p>
- This would produce the output:
+ This would produce the output:
</p>
<pre class="programlisting"><span class="number">0</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">20</span><span class="special">,</span><span class="number">30</span><span class="special">,</span><span class="number">40</span><span class="special">,</span><span class="number">50</span><span class="special">,</span><span class="number">60</span><span class="special">,</span><span class="number">70</span><span class="special">,</span><span class="number">80</span><span class="special">,</span><span class="number">90</span>
</pre>
@@ -144,7 +143,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/replaced.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/replaced.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/replaced.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="map_values.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="replaced_if.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_replaced">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.adaptors.reference.replaced"></a><a class="link" href="replaced.html" title="replaced">replaced</a>
</h5></div></div></div>
@@ -78,22 +78,20 @@
</table></div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<p class="simpara">
<span class="bold"><strong>Precondition:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="circle">
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
<li class="listitem">
- <code class="computeroutput"><span class="identifier">new_value</span></code> is
- convertible to the <code class="computeroutput"><span class="identifier">value_type</span></code>
- of the range.
- </li>
-<li class="listitem">
- <code class="computeroutput"><span class="identifier">old_value</span></code> is
- convertible to the <code class="computeroutput"><span class="identifier">value_type</span></code>
- of the range.
- </li>
+ <code class="computeroutput"><span class="identifier">new_value</span></code> is
+ convertible to the <code class="computeroutput"><span class="identifier">value_type</span></code>
+ of the range.
+ </li>
+<li class="listitem">
+ <code class="computeroutput"><span class="identifier">old_value</span></code> is
+ convertible to the <code class="computeroutput"><span class="identifier">value_type</span></code>
+ of the range.
+ </li>
</ul></div>
-</li>
+ </li>
<li class="listitem">
<span class="bold"><strong>Postcondition:</strong></span> For all elements
<code class="computeroutput"><span class="identifier">x</span></code> in the returned
@@ -117,13 +115,12 @@
category of <code class="computeroutput"><span class="identifier">rng</span></code>.
</li>
</ul></div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_replaced_replaced_example">
<div class="titlepage"><div><div><h6 class="title">
<a name="range.reference.adaptors.reference.replaced.replaced_example"></a><a class="link" href="replaced.html#range.reference.adaptors.reference.replaced.replaced_example" title="replaced example">replaced
example</a>
</h6></div></div></div>
<p>
-
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">replaced</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
@@ -151,7 +148,7 @@
</p>
</div>
<p>
- This would produce the output:
+ This would produce the output:
</p>
<pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">9</span>
</pre>
@@ -160,7 +157,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/replaced_if.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/replaced_if.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/replaced_if.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="replaced.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="reversed.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_replaced_if">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.adaptors.reference.replaced_if"></a><a class="link" href="replaced_if.html" title="replaced_if">replaced_if</a>
</h5></div></div></div>
@@ -78,21 +78,19 @@
</table></div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<p class="simpara">
<span class="bold"><strong>Precondition:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="circle">
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
<li class="listitem">
- The range <code class="computeroutput"><span class="identifier">value_type</span></code>
- is convertible to the argument type of <code class="computeroutput"><span class="identifier">pred</span></code>.
- </li>
-<li class="listitem">
- <code class="computeroutput"><span class="identifier">new_value</span></code> is
- convertible to the <code class="computeroutput"><span class="identifier">value_type</span></code>
- of the range.
- </li>
+ The range <code class="computeroutput"><span class="identifier">value_type</span></code>
+ is convertible to the argument type of <code class="computeroutput"><span class="identifier">pred</span></code>.
+ </li>
+<li class="listitem">
+ <code class="computeroutput"><span class="identifier">new_value</span></code> is
+ convertible to the <code class="computeroutput"><span class="identifier">value_type</span></code>
+ of the range.
+ </li>
</ul></div>
-</li>
+ </li>
<li class="listitem">
<span class="bold"><strong>Postconditions:</strong></span> For all elements
<code class="computeroutput"><span class="identifier">x</span></code> in the returned
@@ -113,13 +111,12 @@
category of <code class="computeroutput"><span class="identifier">rng</span></code>.
</li>
</ul></div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_replaced_if_replaced_if_example">
<div class="titlepage"><div><div><h6 class="title">
<a name="range.reference.adaptors.reference.replaced_if.replaced_if_example"></a><a class="link" href="replaced_if.html#range.reference.adaptors.reference.replaced_if.replaced_if_example" title="replaced_if example">replaced_if
example</a>
</h6></div></div></div>
<p>
-
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">replaced_if</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
@@ -152,7 +149,7 @@
</p>
</div>
<p>
- This would produce the output:
+ This would produce the output:
</p>
<pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">9</span>
</pre>
@@ -161,7 +158,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/reversed.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/reversed.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/reversed.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="replaced_if.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="sliced.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_reversed">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.adaptors.reference.reversed"></a><a class="link" href="reversed.html" title="reversed">reversed</a>
</h5></div></div></div>
@@ -90,13 +90,12 @@
category of <code class="computeroutput"><span class="identifier">rng</span></code>.
</li>
</ul></div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_reversed_reversed_example">
<div class="titlepage"><div><div><h6 class="title">
<a name="range.reference.adaptors.reference.reversed.reversed_example"></a><a class="link" href="reversed.html#range.reference.adaptors.reference.reversed.reversed_example" title="reversed example">reversed
example</a>
</h6></div></div></div>
<p>
-
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">reversed</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
@@ -124,7 +123,7 @@
</p>
</div>
<p>
- This would produce the output:
+ This would produce the output:
</p>
<pre class="programlisting"><span class="number">9</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">1</span>
</pre>
@@ -133,7 +132,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/sliced.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/sliced.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/sliced.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="reversed.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="strided.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_sliced">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.adaptors.reference.sliced"></a><a class="link" href="sliced.html" title="sliced">sliced</a>
</h5></div></div></div>
@@ -100,13 +100,12 @@
Access Range</a>
</li>
</ul></div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_sliced_sliced_example">
<div class="titlepage"><div><div><h6 class="title">
<a name="range.reference.adaptors.reference.sliced.sliced_example"></a><a class="link" href="sliced.html#range.reference.adaptors.reference.sliced.sliced_example" title="sliced example">sliced
example</a>
</h6></div></div></div>
<p>
-
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">sliced</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
@@ -134,7 +133,7 @@
</p>
</div>
<p>
- This would produce the output:
+ This would produce the output:
</p>
<pre class="programlisting"><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span>
</pre>
@@ -143,7 +142,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/strided.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/strided.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/strided.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="sliced.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="type_erased.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_strided">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.adaptors.reference.strided"></a><a class="link" href="strided.html" title="strided">strided</a>
</h5></div></div></div>
@@ -92,13 +92,12 @@
category of <code class="computeroutput"><span class="identifier">rng</span></code>.
</li>
</ul></div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_strided_strided_example">
<div class="titlepage"><div><div><h6 class="title">
<a name="range.reference.adaptors.reference.strided.strided_example"></a><a class="link" href="strided.html#range.reference.adaptors.reference.strided.strided_example" title="strided example">strided
example</a>
</h6></div></div></div>
<p>
-
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">strided</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
@@ -126,7 +125,7 @@
</p>
</div>
<p>
- This would produce the output:
+ This would produce the output:
</p>
<pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">9</span>
</pre>
@@ -135,7 +134,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/tokenized.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/tokenized.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/tokenized.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="type_erased.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="transformed.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_tokenized">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.adaptors.reference.tokenized"></a><a class="link" href="tokenized.html" title="tokenized">tokenized</a>
</h5></div></div></div>
@@ -52,7 +52,6 @@
</td>
<td>
<p>
-
</p>
<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">tokenized</span><span class="special">(</span><span class="identifier">regex</span><span class="special">)</span>
<span class="identifier">rng</span> <span class="special">|</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">tokenized</span><span class="special">(</span><span class="identifier">regex</span><span class="special">,</span> <span class="identifier">i</span><span class="special">)</span>
@@ -72,7 +71,6 @@
</td>
<td>
<p>
-
</p>
<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">tokenize</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span> <span class="identifier">regex</span><span class="special">)</span>
<span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">tokenize</span><span class="special">(</span><span class="identifier">rng</span><span class="special">,</span> <span class="identifier">regex</span><span class="special">,</span> <span class="identifier">i</span><span class="special">)</span>
@@ -88,32 +86,30 @@
</table></div>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<p class="simpara">
<span class="bold"><strong>Precondition:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="circle">
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
<li class="listitem">
- Let <code class="computeroutput"><span class="identifier">T</span></code> denote
- <code class="computeroutput"><span class="keyword">typename</span> <span class="identifier">range_value</span><span class="special"><</span><span class="identifier">decltype</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)>::</span><span class="identifier">type</span></code>,
- then <code class="computeroutput"><span class="identifier">regex</span></code> has
- the type <code class="computeroutput"><span class="identifier">basic_regex</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span></code> or is implicitly convertible
- to one of these types.
- </li>
-<li class="listitem">
- <code class="computeroutput"><span class="identifier">i</span></code> has the type
- <code class="computeroutput"><span class="keyword">int</span></code>.
- </li>
-<li class="listitem">
- the <code class="computeroutput"><span class="identifier">value_type</span></code>
- of <code class="computeroutput"><span class="identifier">rndRng</span></code> is
- <code class="computeroutput"><span class="keyword">int</span></code>.
- </li>
-<li class="listitem">
- <code class="computeroutput"><span class="identifier">flags</span></code> has the
- type <code class="computeroutput"><span class="identifier">regex_constants</span><span class="special">::</span><span class="identifier">syntax_option_type</span></code>.
- </li>
+ Let <code class="computeroutput"><span class="identifier">T</span></code> denote
+ <code class="computeroutput"><span class="keyword">typename</span> <span class="identifier">range_value</span><span class="special"><</span><span class="identifier">decltype</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)>::</span><span class="identifier">type</span></code>,
+ then <code class="computeroutput"><span class="identifier">regex</span></code>
+ has the type <code class="computeroutput"><span class="identifier">basic_regex</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span></code> or is implicitly convertible
+ to one of these types.
+ </li>
+<li class="listitem">
+ <code class="computeroutput"><span class="identifier">i</span></code> has the type
+ <code class="computeroutput"><span class="keyword">int</span></code>.
+ </li>
+<li class="listitem">
+ the <code class="computeroutput"><span class="identifier">value_type</span></code>
+ of <code class="computeroutput"><span class="identifier">rndRng</span></code> is
+ <code class="computeroutput"><span class="keyword">int</span></code>.
+ </li>
+<li class="listitem">
+ <code class="computeroutput"><span class="identifier">flags</span></code> has the
+ type <code class="computeroutput"><span class="identifier">regex_constants</span><span class="special">::</span><span class="identifier">syntax_option_type</span></code>.
+ </li>
</ul></div>
-</li>
+ </li>
<li class="listitem">
<span class="bold"><strong>Returns:</strong></span> A range whose iterators
behave as if they were the original iterators wrapped in <code class="computeroutput"><span class="identifier">regex_token_iterator</span></code>. The first
@@ -141,7 +137,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/transformed.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/transformed.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/transformed.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="tokenized.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="uniqued.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_transformed">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.adaptors.reference.transformed"></a><a class="link" href="transformed.html" title="transformed">transformed</a>
</h5></div></div></div>
@@ -103,13 +103,12 @@
category of <code class="computeroutput"><span class="identifier">rng</span></code>.
</li>
</ul></div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_transformed_transformed_example">
<div class="titlepage"><div><div><h6 class="title">
<a name="range.reference.adaptors.reference.transformed.transformed_example"></a><a class="link" href="transformed.html#range.reference.adaptors.reference.transformed.transformed_example" title="transformed example">transformed
example</a>
</h6></div></div></div>
<p>
-
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">transformed</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
@@ -143,7 +142,7 @@
</p>
</div>
<p>
- This would produce the output:
+ This would produce the output:
</p>
<pre class="programlisting"><span class="number">2</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">6</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">10</span><span class="special">,</span><span class="number">12</span><span class="special">,</span><span class="number">14</span><span class="special">,</span><span class="number">16</span><span class="special">,</span><span class="number">18</span><span class="special">,</span><span class="number">20</span>
</pre>
@@ -152,7 +151,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/type_erased.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/type_erased.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/type_erased.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="strided.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="tokenized.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_type_erased">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.adaptors.reference.type_erased"></a><a class="link" href="type_erased.html" title="type_erased">type_erased</a>
</h5></div></div></div>
@@ -92,48 +92,48 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<p class="simpara">
<span class="bold"><strong>Template parameters:</strong></span>
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="circle">
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
<li class="listitem">
- <code class="computeroutput"><span class="identifier">Value</span></code> is the
- <code class="computeroutput"><span class="identifier">value_type</span></code> for
- the <code class="computeroutput"><span class="identifier">any_range</span></code>.
- If this is set to boost::use_default, <code class="computeroutput"><span class="identifier">Value</span></code>
- will be calculated from the range type when the adaptor is applied.
- </li>
+ <code class="computeroutput"><span class="identifier">Value</span></code> is the
+ <code class="computeroutput"><span class="identifier">value_type</span></code>
+ for the <code class="computeroutput"><span class="identifier">any_range</span></code>.
+ If this is set to boost::use_default, <code class="computeroutput"><span class="identifier">Value</span></code>
+ will be calculated from the range type when the adaptor is
+ applied.
+ </li>
<li class="listitem">
- <code class="computeroutput"><span class="identifier">Traversal</span></code> is
- the tag used to identify the traversal of the resultant range.
- Frequently it is desireable to set a traversal category lower
- than the source container or range to maximize the number of
- ranges that can convert to the <code class="computeroutput"><span class="identifier">any_range</span></code>.
- If this is left as boost::use_default then <code class="computeroutput"><span class="identifier">Traversal</span></code>
- will be <code class="computeroutput"><span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_traversal</span><span class="special"><</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">Rng</span><span class="special">>::</span><span class="identifier">type</span><span class="special">>::</span><span class="identifier">type</span></code>
- </li>
+ <code class="computeroutput"><span class="identifier">Traversal</span></code> is
+ the tag used to identify the traversal of the resultant range.
+ Frequently it is desirable to set a traversal category lower
+ than the source container or range to maximize the number of
+ ranges that can convert to the <code class="computeroutput"><span class="identifier">any_range</span></code>.
+ If this is left as boost::use_default then <code class="computeroutput"><span class="identifier">Traversal</span></code>
+ will be <code class="computeroutput"><span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">iterator_traversal</span><span class="special"><</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">Rng</span><span class="special">>::</span><span class="identifier">type</span><span class="special">>::</span><span class="identifier">type</span></code>
+ </li>
<li class="listitem">
- <code class="computeroutput"><span class="identifier">Reference</span></code> is
- the <code class="computeroutput"><span class="identifier">reference</span></code>
- for the <code class="computeroutput"><span class="identifier">any_range</span></code>.
- <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">use_default</span></code> will equate to
- <code class="computeroutput"><span class="keyword">typename</span> <span class="identifier">range_reference</span><span class="special"><</span><span class="identifier">Rng</span><span class="special">>::</span><span class="identifier">type</span></code>.
- </li>
+ <code class="computeroutput"><span class="identifier">Reference</span></code> is
+ the <code class="computeroutput"><span class="identifier">reference</span></code>
+ for the <code class="computeroutput"><span class="identifier">any_range</span></code>.
+ <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">use_default</span></code> will equate to
+ <code class="computeroutput"><span class="keyword">typename</span> <span class="identifier">range_reference</span><span class="special"><</span><span class="identifier">Rng</span><span class="special">>::</span><span class="identifier">type</span></code>.
+ </li>
<li class="listitem">
- <code class="computeroutput"><span class="identifier">Difference</span></code> is
- the <code class="computeroutput"><span class="identifier">difference_type</span></code>
- for the any_range. <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">use_default</span></code>
- will equate to <code class="computeroutput"><span class="keyword">typename</span>
- <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_difference</span><span class="special"><</span><span class="identifier">Rng</span><span class="special">>::</span><span class="identifier">type</span></code>
- </li>
+ <code class="computeroutput"><span class="identifier">Difference</span></code>
+ is the <code class="computeroutput"><span class="identifier">difference_type</span></code>
+ for the any_range. <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">use_default</span></code>
+ will equate to <code class="computeroutput"><span class="keyword">typename</span>
+ <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_difference</span><span class="special"><</span><span class="identifier">Rng</span><span class="special">>::</span><span class="identifier">type</span></code>
+ </li>
<li class="listitem">
- <code class="computeroutput"><span class="identifier">Buffer</span></code> is the
- storage used to allocate the underlying iterator wrappers. This
- can typically be ignored, but is available as a template parameter
- for customization. Buffer must be a model of the <code class="computeroutput"><span class="identifier">AnyIteratorBufferConcept</span></code>.
- </li>
+ <code class="computeroutput"><span class="identifier">Buffer</span></code> is the
+ storage used to allocate the underlying iterator wrappers.
+ This can typically be ignored, but is available as a template
+ parameter for customization. Buffer must be a model of the
+ <code class="computeroutput"><span class="identifier">AnyIteratorBufferConcept</span></code>.
+ </li>
</ul></div>
-</li>
+ </li>
<li class="listitem">
<span class="bold"><strong>Precondition:</strong></span> <code class="computeroutput"><span class="identifier">Traversal</span></code>
is one of <code class="computeroutput"><span class="special">{</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">use_default</span><span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">single_pass_traversal_tag</span><span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">forward_traversal_tag</span><span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">bidirectional_traversal_tag</span><span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">random_access_traversal_tag</span>
@@ -153,12 +153,11 @@
otherwise <code class="computeroutput"><span class="identifier">Traversal</span></code>.
</li>
</ul></div>
-<a name="range.reference.adaptors.reference.type_erased.anyiteratorbufferconcept"></a><h6>
-<a name="id677095"></a>
- <a class="link" href="type_erased.html#range.reference.adaptors.reference.type_erased.anyiteratorbufferconcept">AnyIteratorBufferConcept</a>
+<h6>
+<a name="range.reference.adaptors.reference.type_erased.h0"></a>
+ <span><a name="range.reference.adaptors.reference.type_erased.anyiteratorbufferconcept"></a></span><a class="link" href="type_erased.html#range.reference.adaptors.reference.type_erased.anyiteratorbufferconcept">AnyIteratorBufferConcept</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">class</span> <span class="identifier">AnyIteratorBufferConcept</span>
<span class="special">{</span>
@@ -166,27 +165,26 @@
<span class="identifier">AnyIteratorBufferConcept</span><span class="special">();</span>
<span class="special">~</span><span class="identifier">AnyIteratorBufferConcept</span><span class="special">();</span>
- <span class="comment">// bytes is the requested size to allocate. This function
-</span> <span class="comment">// must return a pointer to an adequate area of memory.
-</span> <span class="comment">// throws: bad_alloc
-</span> <span class="comment">//
-</span> <span class="comment">// The buffer will only ever have zero or one
-</span> <span class="comment">// outstanding memory allocations.
-</span> <span class="keyword">void</span><span class="special">*</span> <span class="identifier">allocate</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> <span class="identifier">bytes</span><span class="special">);</span>
+ <span class="comment">// bytes is the requested size to allocate. This function</span>
+ <span class="comment">// must return a pointer to an adequate area of memory.</span>
+ <span class="comment">// throws: bad_alloc</span>
+ <span class="comment">//</span>
+ <span class="comment">// The buffer will only ever have zero or one</span>
+ <span class="comment">// outstanding memory allocations.</span>
+ <span class="keyword">void</span><span class="special">*</span> <span class="identifier">allocate</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> <span class="identifier">bytes</span><span class="special">);</span>
- <span class="comment">// deallocate this buffer
-</span> <span class="keyword">void</span> <span class="identifier">deallocate</span><span class="special">();</span>
+ <span class="comment">// deallocate this buffer</span>
+ <span class="keyword">void</span> <span class="identifier">deallocate</span><span class="special">();</span>
<span class="special">};</span>
</pre>
<p>
</p>
-<div class="section">
+<div class="section range_reference_adaptors_reference_type_erased_type_erased_example">
<div class="titlepage"><div><div><h6 class="title">
<a name="range.reference.adaptors.reference.type_erased.type_erased_example"></a><a class="link" href="type_erased.html#range.reference.adaptors.reference.type_erased.type_erased_example" title="type-erased example">type-erased
example</a>
</h6></div></div></div>
<p>
-
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">type_erased</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
@@ -197,9 +195,9 @@
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">list</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">vector</span><span class="special">></span>
-<span class="comment">// The client interface from an OO perspective merely requires a sequence
-</span><span class="comment">// of integers that can be forward traversed
-</span><span class="keyword">typedef</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">any_range</span><span class="special"><</span>
+<span class="comment">// The client interface from an OO perspective merely requires a sequence</span>
+<span class="comment">// of integers that can be forward traversed</span>
+<span class="keyword">typedef</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">any_range</span><span class="special"><</span>
<span class="keyword">int</span>
<span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">forward_traversal_tag</span>
<span class="special">,</span> <span class="keyword">int</span>
@@ -224,47 +222,47 @@
<span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">assign</span><span class="special">;</span>
<span class="keyword">using</span> <span class="keyword">namespace</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">;</span>
- <span class="comment">// Under most conditions one would simply use an appropriate
-</span> <span class="comment">// any_range as a function parameter. The type_erased adaptor
-</span> <span class="comment">// is often superfluous. However because the type_erased
-</span> <span class="comment">// adaptor is applied to a range, we can use default template
-</span> <span class="comment">// arguments that are generated in conjunction with the
-</span> <span class="comment">// range type to which we are applying the adaptor.
-</span>
+ <span class="comment">// Under most conditions one would simply use an appropriate</span>
+ <span class="comment">// any_range as a function parameter. The type_erased adaptor</span>
+ <span class="comment">// is often superfluous. However because the type_erased</span>
+ <span class="comment">// adaptor is applied to a range, we can use default template</span>
+ <span class="comment">// arguments that are generated in conjunction with the</span>
+ <span class="comment">// range type to which we are applying the adaptor.</span>
+
<span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="identifier">input</span><span class="special">;</span>
<span class="identifier">input</span> <span class="special">+=</span> <span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">;</span>
- <span class="comment">// Note that this call is to a non-template function
-</span> <span class="identifier">server</span><span class="special">::</span><span class="identifier">display_integers</span><span class="special">(</span><span class="identifier">input</span><span class="special">);</span>
+ <span class="comment">// Note that this call is to a non-template function</span>
+ <span class="identifier">server</span><span class="special">::</span><span class="identifier">display_integers</span><span class="special">(</span><span class="identifier">input</span><span class="special">);</span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">list</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="identifier">input2</span><span class="special">;</span>
<span class="identifier">input2</span> <span class="special">+=</span> <span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span><span class="special">,</span><span class="number">10</span><span class="special">;</span>
- <span class="comment">// Note that this call is to the same non-tempate function
-</span> <span class="identifier">server</span><span class="special">::</span><span class="identifier">display_integers</span><span class="special">(</span><span class="identifier">input2</span><span class="special">);</span>
+ <span class="comment">// Note that this call is to the same non-tempate function</span>
+ <span class="identifier">server</span><span class="special">::</span><span class="identifier">display_integers</span><span class="special">(</span><span class="identifier">input2</span><span class="special">);</span>
<span class="identifier">input2</span><span class="special">.</span><span class="identifier">clear</span><span class="special">();</span>
<span class="identifier">input2</span> <span class="special">+=</span> <span class="number">11</span><span class="special">,</span><span class="number">12</span><span class="special">,</span><span class="number">13</span><span class="special">,</span><span class="number">14</span><span class="special">,</span><span class="number">15</span><span class="special">;</span>
- <span class="comment">// Calling using the adaptor looks like this:
-</span> <span class="comment">// Notice that here I have a type_erased that would be a
-</span> <span class="comment">// bidirectional_traversal_tag, but this is convertible
-</span> <span class="comment">// to the forward_traversal_tag equivalent hence this
-</span> <span class="comment">// works.
-</span> <span class="identifier">server</span><span class="special">::</span><span class="identifier">display_integers</span><span class="special">(</span><span class="identifier">input2</span> <span class="special">|</span> <span class="identifier">type_erased</span><span class="special"><>());</span>
-
- <span class="comment">// However we may simply wish to define an adaptor that
-</span> <span class="comment">// takes a range and makes it into an appropriate
-</span> <span class="comment">// forward_traversal any_range...
-</span> <span class="keyword">typedef</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">type_erased</span><span class="special"><</span>
+ <span class="comment">// Calling using the adaptor looks like this:</span>
+ <span class="comment">// Notice that here I have a type_erased that would be a</span>
+ <span class="comment">// bidirectional_traversal_tag, but this is convertible</span>
+ <span class="comment">// to the forward_traversal_tag equivalent hence this</span>
+ <span class="comment">// works.</span>
+ <span class="identifier">server</span><span class="special">::</span><span class="identifier">display_integers</span><span class="special">(</span><span class="identifier">input2</span> <span class="special">|</span> <span class="identifier">type_erased</span><span class="special"><>());</span>
+
+ <span class="comment">// However we may simply wish to define an adaptor that</span>
+ <span class="comment">// takes a range and makes it into an appropriate</span>
+ <span class="comment">// forward_traversal any_range...</span>
+ <span class="keyword">typedef</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">adaptors</span><span class="special">::</span><span class="identifier">type_erased</span><span class="special"><</span>
<span class="identifier">boost</span><span class="special">::</span><span class="identifier">use_default</span>
<span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">forward_traversal_tag</span>
<span class="special">></span> <span class="identifier">type_erased_forward</span><span class="special">;</span>
- <span class="comment">// This adaptor can turn other containers with different
-</span> <span class="comment">// value_types and reference_types into the appropriate
-</span> <span class="comment">// any_range.
-</span>
+ <span class="comment">// This adaptor can turn other containers with different</span>
+ <span class="comment">// value_types and reference_types into the appropriate</span>
+ <span class="comment">// any_range.</span>
+
<span class="identifier">server</span><span class="special">::</span><span class="identifier">display_integers</span><span class="special">(</span><span class="identifier">input2</span> <span class="special">|</span> <span class="identifier">type_erased_forward</span><span class="special">());</span>
<span class="special">}</span>
<span class="special">}</span>
@@ -279,7 +277,7 @@
</p>
</div>
<p>
- This would produce the output:
+ This would produce the output:
</p>
<pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span>
<span class="number">6</span><span class="special">,</span><span class="number">7</span><span class="special">,</span><span class="number">8</span><span class="special">,</span><span class="number">9</span><span class="special">,</span><span class="number">10</span>
@@ -291,7 +289,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/adaptors/reference/uniqued.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/adaptors/reference/uniqued.html (original)
+++ branches/release/libs/range/doc/html/range/reference/adaptors/reference/uniqued.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="transformed.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../algorithms.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_uniqued">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.adaptors.reference.uniqued"></a><a class="link" href="uniqued.html" title="uniqued">uniqued</a>
</h5></div></div></div>
@@ -95,13 +95,12 @@
and <a class="link" href="../../../concepts/forward_range.html" title="Forward Range">Forward Range</a>.
</li>
</ul></div>
-<div class="section">
+<div class="section range_reference_adaptors_reference_uniqued_uniqued_example">
<div class="titlepage"><div><div><h6 class="title">
<a name="range.reference.adaptors.reference.uniqued.uniqued_example"></a><a class="link" href="uniqued.html#range.reference.adaptors.reference.uniqued.uniqued_example" title="uniqued example">uniqued
example</a>
</h6></div></div></div>
<p>
-
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">uniqued</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
@@ -127,7 +126,7 @@
</p>
</div>
<p>
- This would produce the output:
+ This would produce the output:
</p>
<pre class="programlisting"><span class="number">1</span><span class="special">,</span><span class="number">2</span><span class="special">,</span><span class="number">3</span><span class="special">,</span><span class="number">4</span><span class="special">,</span><span class="number">5</span><span class="special">,</span><span class="number">6</span>
</pre>
@@ -136,7 +135,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="adaptors/reference/uniqued.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="algorithms/introduction.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms">
<div class="titlepage"><div><div><h3 class="title">
<a name="range.reference.algorithms"></a><a class="link" href="algorithms.html" title="Range Algorithms">Range Algorithms</a>
</h3></div></div></div>
@@ -42,7 +42,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/heap.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/heap.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/heap.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="set/set_symmetric_difference.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="heap/push_heap.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_heap">
<div class="titlepage"><div><div><h4 class="title">
<a name="range.reference.algorithms.heap"></a><a class="link" href="heap.html" title="Heap algorithms">Heap algorithms</a>
</h4></div></div></div>
@@ -35,7 +35,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/heap/make_heap.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/heap/make_heap.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/heap/make_heap.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="pop_heap.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="sort_heap.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_heap_make_heap">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.heap.make_heap"></a><a class="link" href="make_heap.html" title="make_heap">make_heap</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.heap.make_heap.prototype"></a><h6>
-<a name="id741272"></a>
- <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.heap.make_heap.h0"></a>
+ <span><a name="range.reference.algorithms.heap.make_heap.prototype"></a></span><a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">></span>
<span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">make_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
@@ -47,9 +46,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.heap.make_heap.description"></a><h6>
-<a name="id741648"></a>
- <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.heap.make_heap.h1"></a>
+ <span><a name="range.reference.algorithms.heap.make_heap.description"></a></span><a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">make_heap</span></code> turns <code class="computeroutput"><span class="identifier">rng</span></code> into a heap.
@@ -59,16 +58,16 @@
by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
the predicate versions.
</p>
-<a name="range.reference.algorithms.heap.make_heap.definition"></a><h6>
-<a name="id741722"></a>
- <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.heap.make_heap.h2"></a>
+ <span><a name="range.reference.algorithms.heap.make_heap.definition"></a></span><a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">heap_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.heap.make_heap.requirements"></a><h6>
-<a name="id741791"></a>
- <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.heap.make_heap.h3"></a>
+ <span><a name="range.reference.algorithms.heap.make_heap.requirements"></a></span><a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -117,9 +116,9 @@
argument types.
</li>
</ul></div>
-<a name="range.reference.algorithms.heap.make_heap.complexity"></a><h6>
-<a name="id742039"></a>
- <a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.heap.make_heap.h4"></a>
+ <span><a name="range.reference.algorithms.heap.make_heap.complexity"></a></span><a class="link" href="make_heap.html#range.reference.algorithms.heap.make_heap.complexity">Complexity</a>
</h6>
<p>
Linear. At most <code class="computeroutput"><span class="number">3</span> <span class="special">*</span>
@@ -129,7 +128,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/heap/pop_heap.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/heap/pop_heap.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/heap/pop_heap.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="push_heap.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="make_heap.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_heap_pop_heap">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.heap.pop_heap"></a><a class="link" href="pop_heap.html" title="pop_heap">pop_heap</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.heap.pop_heap.prototype"></a><h6>
-<a name="id740266"></a>
- <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.heap.pop_heap.h0"></a>
+ <span><a name="range.reference.algorithms.heap.pop_heap.prototype"></a></span><a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">></span>
<span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">pop_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
@@ -47,9 +46,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.heap.pop_heap.description"></a><h6>
-<a name="id740642"></a>
- <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.heap.pop_heap.h1"></a>
+ <span><a name="range.reference.algorithms.heap.pop_heap.description"></a></span><a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">pop_heap</span></code> removes the
@@ -61,16 +60,16 @@
by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
the predicate versions.
</p>
-<a name="range.reference.algorithms.heap.pop_heap.definition"></a><h6>
-<a name="id740796"></a>
- <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.heap.pop_heap.h2"></a>
+ <span><a name="range.reference.algorithms.heap.pop_heap.definition"></a></span><a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">heap_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.heap.pop_heap.requirements"></a><h6>
-<a name="id740866"></a>
- <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.heap.pop_heap.h3"></a>
+ <span><a name="range.reference.algorithms.heap.pop_heap.requirements"></a></span><a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -119,9 +118,9 @@
argument types.
</li>
</ul></div>
-<a name="range.reference.algorithms.heap.pop_heap.precondition_"></a><h6>
-<a name="id741114"></a>
- <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.heap.pop_heap.h4"></a>
+ <span><a name="range.reference.algorithms.heap.pop_heap.precondition_"></a></span><a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.precondition_">Precondition:</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -131,9 +130,9 @@
<code class="computeroutput"><span class="identifier">rng</span></code> is a heap.
</li>
</ul></div>
-<a name="range.reference.algorithms.heap.pop_heap.complexity"></a><h6>
-<a name="id741189"></a>
- <a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.heap.pop_heap.h5"></a>
+ <span><a name="range.reference.algorithms.heap.pop_heap.complexity"></a></span><a class="link" href="pop_heap.html#range.reference.algorithms.heap.pop_heap.complexity">Complexity</a>
</h6>
<p>
Logarithmic. At most <code class="computeroutput"><span class="number">2</span> <span class="special">*</span>
@@ -143,7 +142,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/heap/push_heap.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/heap/push_heap.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/heap/push_heap.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="../heap.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="pop_heap.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_heap_push_heap">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.heap.push_heap"></a><a class="link" href="push_heap.html" title="push_heap">push_heap</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.heap.push_heap.prototype"></a><h6>
-<a name="id739222"></a>
- <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.heap.push_heap.h0"></a>
+ <span><a name="range.reference.algorithms.heap.push_heap.prototype"></a></span><a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">></span>
<span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">push_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
@@ -47,9 +46,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.heap.push_heap.description"></a><h6>
-<a name="id739596"></a>
- <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.heap.push_heap.h1"></a>
+ <span><a name="range.reference.algorithms.heap.push_heap.description"></a></span><a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">push_heap</span></code> adds an element
@@ -61,16 +60,16 @@
by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
the predicate versions.
</p>
-<a name="range.reference.algorithms.heap.push_heap.definition"></a><h6>
-<a name="id739755"></a>
- <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.heap.push_heap.h2"></a>
+ <span><a name="range.reference.algorithms.heap.push_heap.definition"></a></span><a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">heap_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.heap.push_heap.requirements"></a><h6>
-<a name="id739825"></a>
- <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.heap.push_heap.h3"></a>
+ <span><a name="range.reference.algorithms.heap.push_heap.requirements"></a></span><a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -119,9 +118,9 @@
argument types.
</li>
</ul></div>
-<a name="range.reference.algorithms.heap.push_heap.precondition_"></a><h6>
-<a name="id740073"></a>
- <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.heap.push_heap.h4"></a>
+ <span><a name="range.reference.algorithms.heap.push_heap.precondition_"></a></span><a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.precondition_">Precondition:</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -131,9 +130,9 @@
<code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">prior</span><span class="special">(</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)))</span></code> is a heap.
</li>
</ul></div>
-<a name="range.reference.algorithms.heap.push_heap.complexity"></a><h6>
-<a name="id740193"></a>
- <a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.heap.push_heap.h5"></a>
+ <span><a name="range.reference.algorithms.heap.push_heap.complexity"></a></span><a class="link" href="push_heap.html#range.reference.algorithms.heap.push_heap.complexity">Complexity</a>
</h6>
<p>
Logarithmic. At most <code class="computeroutput"><span class="identifier">log</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> comparisons.
@@ -141,7 +140,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/heap/sort_heap.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/heap/sort_heap.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/heap/sort_heap.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="make_heap.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../heap.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../permutation.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_heap_sort_heap">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.heap.sort_heap"></a><a class="link" href="sort_heap.html" title="sort_heap">sort_heap</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.heap.sort_heap.prototype"></a><h6>
-<a name="id742115"></a>
- <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.heap.sort_heap.h0"></a>
+ <span><a name="range.reference.algorithms.heap.sort_heap.prototype"></a></span><a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">></span>
<span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">sort_heap</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
@@ -47,9 +46,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.heap.sort_heap.description"></a><h6>
-<a name="id742491"></a>
- <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.heap.sort_heap.h1"></a>
+ <span><a name="range.reference.algorithms.heap.sort_heap.description"></a></span><a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">sort_heap</span></code> turns a heap
@@ -60,16 +59,16 @@
by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
the predicate versions.
</p>
-<a name="range.reference.algorithms.heap.sort_heap.definition"></a><h6>
-<a name="id742555"></a>
- <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.heap.sort_heap.h2"></a>
+ <span><a name="range.reference.algorithms.heap.sort_heap.definition"></a></span><a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">heap_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.heap.sort_heap.requirements"></a><h6>
-<a name="id742626"></a>
- <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.heap.sort_heap.h3"></a>
+ <span><a name="range.reference.algorithms.heap.sort_heap.requirements"></a></span><a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -118,16 +117,16 @@
argument types.
</li>
</ul></div>
-<a name="range.reference.algorithms.heap.sort_heap.precondition_"></a><h6>
-<a name="id742873"></a>
- <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.heap.sort_heap.h4"></a>
+ <span><a name="range.reference.algorithms.heap.sort_heap.precondition_"></a></span><a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.precondition_">Precondition:</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">rng</span></code> is a heap.
</p>
-<a name="range.reference.algorithms.heap.sort_heap.complexity"></a><h6>
-<a name="id742906"></a>
- <a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.heap.sort_heap.h5"></a>
+ <span><a name="range.reference.algorithms.heap.sort_heap.complexity"></a></span><a class="link" href="sort_heap.html#range.reference.algorithms.heap.sort_heap.complexity">Complexity</a>
</h6>
<p>
At most <code class="computeroutput"><span class="identifier">N</span> <span class="special">*</span>
@@ -138,7 +137,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/introduction.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/introduction.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/introduction.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../algorithms.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="mutating.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_introduction">
<div class="titlepage"><div><div><h4 class="title">
<a name="range.reference.algorithms.introduction"></a><a class="link" href="introduction.html" title="Introduction and motivation">Introduction
and motivation</a>
@@ -34,7 +34,6 @@
<span class="emphasis"><em>one</em></span> range argument. For example, we may write
</p>
<p>
-
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">vector</span><span class="special">></span>
@@ -48,7 +47,6 @@
instead of
</p>
<p>
-
</p>
<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">sort</span><span class="special">(</span><span class="identifier">vec</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span>
</pre>
@@ -61,7 +59,7 @@
<p>
One group of algorithms, like <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">sort</span><span class="special">()</span></code>, will simply return the same range so
that we can continue to pass the range around and/or further modify it.
- Because of this we may write
+ Because of this we may write
</p>
<pre class="programlisting"><span class="identifier">boost</span><span class="special">:</span><span class="identifier">unique</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">sort</span><span class="special">(</span><span class="identifier">vec</span><span class="special">));</span>
</pre>
@@ -76,7 +74,7 @@
iterator returned by <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">unique</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code>
</p>
<p>
- Therefore exactly the unique values can be copied by writing
+ Therefore exactly the unique values can be copied by writing
</p>
<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">copy</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">sort</span><span class="special">(</span><span class="identifier">vec</span><span class="special">)),</span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">ostream_iterator</span><span class="special"><</span><span class="keyword">int</span><span class="special">>(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">cout</span><span class="special">));</span>
@@ -204,7 +202,6 @@
container:
</p>
<p>
-
</p>
<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="identifier">vec</span> <span class="special">=</span> <span class="special">...;</span>
<span class="identifier">boost</span><span class="special">::</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">vec</span><span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special"><</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">return_found_end</span><span class="special">>(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">sort</span><span class="special">(</span><span class="identifier">vec</span><span class="special">)));</span>
@@ -217,13 +214,12 @@
STL-programming we might write
</p>
<p>
-
</p>
-<pre class="programlisting"><span class="comment">// assume 'vec' is already sorted
-</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special"><</span><span class="keyword">int</span><span class="special">>::</span><span class="identifier">iterator</span> <span class="identifier">i</span> <span class="special">=</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">unique</span><span class="special">(</span><span class="identifier">vec</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span>
+<pre class="programlisting"><span class="comment">// assume 'vec' is already sorted</span>
+<span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special"><</span><span class="keyword">int</span><span class="special">>::</span><span class="identifier">iterator</span> <span class="identifier">i</span> <span class="special">=</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">unique</span><span class="special">(</span><span class="identifier">vec</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span>
-<span class="comment">// remember this check or you get into problems
-</span><span class="keyword">if</span> <span class="special">(</span><span class="identifier">i</span> <span class="special">!=</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">())</span>
+<span class="comment">// remember this check or you get into problems</span>
+<span class="keyword">if</span> <span class="special">(</span><span class="identifier">i</span> <span class="special">!=</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">())</span>
<span class="special">++</span><span class="identifier">i</span><span class="special">;</span>
<span class="identifier">vec</span><span class="special">.</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">i</span><span class="special">,</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span>
@@ -231,7 +227,7 @@
<p>
</p>
<p>
- The same task may be accomplished simply with
+ The same task may be accomplished simply with
</p>
<pre class="programlisting"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">vec</span><span class="special">,</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">unique</span><span class="special"><</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">return_next_end</span><span class="special">>(</span><span class="identifier">vec</span><span class="special">));</span>
</pre>
@@ -243,7 +239,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="introduction.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="mutating/copy.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating">
<div class="titlepage"><div><div><h4 class="title">
<a name="range.reference.algorithms.mutating"></a><a class="link" href="mutating.html" title="Mutating algorithms">Mutating algorithms</a>
</h4></div></div></div>
@@ -61,7 +61,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/copy.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/copy.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/copy.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,25 +22,24 @@
<div class="spirit-nav">
<a accesskey="p" href="../mutating.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="copy_backward.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_copy">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.copy"></a><a class="link" href="copy.html" title="copy">copy</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.copy.prototype"></a><h6>
-<a name="id684203"></a>
- <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.copy.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.copy.prototype"></a></span><a class="link" href="copy.html#range.reference.algorithms.mutating.copy.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">></span>
<span class="identifier">OutputIterator</span> <span class="identifier">copy</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&</span> <span class="identifier">source_rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out_it</span><span class="special">);</span>
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.copy.description"></a><h6>
-<a name="id684330"></a>
- <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.copy.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.copy.description"></a></span><a class="link" href="copy.html#range.reference.algorithms.mutating.copy.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">copy</span></code> copies all elements
@@ -49,16 +48,16 @@
<span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">))</span></code>. The return value is <code class="computeroutput"><span class="identifier">out_it</span> <span class="special">+</span>
<span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">)</span></code>
</p>
-<a name="range.reference.algorithms.mutating.copy.definition"></a><h6>
-<a name="id684459"></a>
- <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.copy.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.copy.definition"></a></span><a class="link" href="copy.html#range.reference.algorithms.mutating.copy.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.copy.requirements"></a><h6>
-<a name="id684528"></a>
- <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.copy.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.copy.requirements"></a></span><a class="link" href="copy.html#range.reference.algorithms.mutating.copy.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -77,9 +76,9 @@
set of value types.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.copy.precondition_"></a><h6>
-<a name="id684638"></a>
- <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.mutating.copy.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.copy.precondition_"></a></span><a class="link" href="copy.html#range.reference.algorithms.mutating.copy.precondition_">Precondition:</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -91,9 +90,9 @@
<span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">))</span></code> is a valid range.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.copy.complexity"></a><h6>
-<a name="id684744"></a>
- <a class="link" href="copy.html#range.reference.algorithms.mutating.copy.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.copy.h5"></a>
+ <span><a name="range.reference.algorithms.mutating.copy.complexity"></a></span><a class="link" href="copy.html#range.reference.algorithms.mutating.copy.complexity">Complexity</a>
</h6>
<p>
Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">)</span></code> assignments are performed.
@@ -101,7 +100,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/copy_backward.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/copy_backward.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/copy_backward.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="copy.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="fill.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_copy_backward">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.copy_backward"></a><a class="link" href="copy_backward.html" title="copy_backward">copy_backward</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.copy_backward.prototype"></a><h6>
-<a name="id684808"></a>
- <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.copy_backward.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.copy_backward.prototype"></a></span><a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BidirectionalOutputIterator</span><span class="special">></span>
<span class="identifier">BidirectionalOutputIterator</span>
@@ -40,9 +39,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.copy_backward.description"></a><h6>
-<a name="id684936"></a>
- <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.copy_backward.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.copy_backward.description"></a></span><a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">copy_backward</span></code> copies
@@ -58,16 +57,16 @@
Note well that unlike all other standard algorithms <code class="computeroutput"><span class="identifier">out_it</span></code>
denotes the <span class="bold"><strong>end</strong></span> of the output sequence.
</p>
-<a name="range.reference.algorithms.mutating.copy_backward.definition"></a><h6>
-<a name="id685090"></a>
- <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.copy_backward.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.copy_backward.definition"></a></span><a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">copy_backward</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.copy_backward.requirements"></a><h6>
-<a name="id685160"></a>
- <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.copy_backward.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.copy_backward.requirements"></a></span><a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -86,9 +85,9 @@
set of value types.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.copy_backward.precondition_"></a><h6>
-<a name="id685270"></a>
- <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.mutating.copy_backward.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.copy_backward.precondition_"></a></span><a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.precondition_">Precondition:</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -100,9 +99,9 @@
<span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">))</span></code> is a valid range.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.copy_backward.complexity"></a><h6>
-<a name="id685378"></a>
- <a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.copy_backward.h5"></a>
+ <span><a name="range.reference.algorithms.mutating.copy_backward.complexity"></a></span><a class="link" href="copy_backward.html#range.reference.algorithms.mutating.copy_backward.complexity">Complexity</a>
</h6>
<p>
Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">)</span></code> assignments are performed.
@@ -110,7 +109,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/fill.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/fill.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/fill.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,41 +22,40 @@
<div class="spirit-nav">
<a accesskey="p" href="copy_backward.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="fill_n.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_fill">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.fill"></a><a class="link" href="fill.html" title="fill">fill</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.fill.prototype"></a><h6>
-<a name="id685443"></a>
- <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.fill.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.fill.prototype"></a></span><a class="link" href="fill.html#range.reference.algorithms.mutating.fill.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">></span>
<span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">fill</span><span class="special">(</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&</span> <span class="identifier">val</span> <span class="special">);</span>
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.fill.description"></a><h6>
-<a name="id685579"></a>
- <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.fill.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.fill.description"></a></span><a class="link" href="fill.html#range.reference.algorithms.mutating.fill.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">fill</span></code> assigns the value
<code class="computeroutput"><span class="identifier">val</span></code> to every element
in the range <code class="computeroutput"><span class="identifier">rng</span></code>.
</p>
-<a name="range.reference.algorithms.mutating.fill.definition"></a><h6>
-<a name="id685634"></a>
- <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.fill.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.fill.definition"></a></span><a class="link" href="fill.html#range.reference.algorithms.mutating.fill.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">fill</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.fill.requirements"></a><h6>
-<a name="id685703"></a>
- <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.fill.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.fill.requirements"></a></span><a class="link" href="fill.html#range.reference.algorithms.mutating.fill.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -77,9 +76,9 @@
value type.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.fill.complexity"></a><h6>
-<a name="id685823"></a>
- <a class="link" href="fill.html#range.reference.algorithms.mutating.fill.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.fill.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.fill.complexity"></a></span><a class="link" href="fill.html#range.reference.algorithms.mutating.fill.complexity">Complexity</a>
</h6>
<p>
Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> assignments are performed.
@@ -87,7 +86,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/fill_n.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/fill_n.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/fill_n.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,40 +22,39 @@
<div class="spirit-nav">
<a accesskey="p" href="fill.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="generate.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_fill_n">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.fill_n"></a><a class="link" href="fill_n.html" title="fill_n">fill_n</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.fill_n.prototype"></a><h6>
-<a name="id685887"></a>
- <a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.fill_n.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.fill_n.prototype"></a></span><a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Size</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">></span>
<span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">fill</span><span class="special">(</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Size</span> <span class="identifier">n</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&</span> <span class="identifier">val</span> <span class="special">);</span>
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.fill_n.description"></a><h6>
-<a name="id686056"></a>
- <a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.fill_n.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.fill_n.description"></a></span><a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">fill_n</span></code> assigns the value
- <code class="computeroutput"><span class="identifier">val</span></code> to <code class="computeroutput"><span class="identifier">n</span></code> elements in the range <code class="computeroutput"><span class="identifier">rng</span></code> begining with <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
+ <code class="computeroutput"><span class="identifier">val</span></code> to <code class="computeroutput"><span class="identifier">n</span></code> elements in the range <code class="computeroutput"><span class="identifier">rng</span></code> beginning with <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
</p>
-<a name="range.reference.algorithms.mutating.fill_n.definition"></a><h6>
-<a name="id686152"></a>
- <a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.fill_n.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.fill_n.definition"></a></span><a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">fill_n</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.fill_n.requirements"></a><h6>
-<a name="id686222"></a>
- <a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.fill_n.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.fill_n.requirements"></a></span><a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -76,9 +75,9 @@
value type.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.fill_n.complexity"></a><h6>
-<a name="id686341"></a>
- <a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.fill_n.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.fill_n.complexity"></a></span><a class="link" href="fill_n.html#range.reference.algorithms.mutating.fill_n.complexity">Complexity</a>
</h6>
<p>
Linear. Exactly <code class="computeroutput"><span class="identifier">n</span></code> assignments
@@ -87,7 +86,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/generate.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/generate.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/generate.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="fill_n.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="inplace_merge.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_generate">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.generate"></a><a class="link" href="generate.html" title="generate">generate</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.generate.prototype"></a><h6>
-<a name="id686391"></a>
- <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.generate.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.generate.prototype"></a></span><a class="link" href="generate.html#range.reference.algorithms.mutating.generate.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Generator</span><span class="special">></span>
<span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">generate</span><span class="special">(</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Generator</span> <span class="identifier">gen</span> <span class="special">);</span>
@@ -41,9 +40,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.generate.description"></a><h6>
-<a name="id686629"></a>
- <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.generate.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.generate.description"></a></span><a class="link" href="generate.html#range.reference.algorithms.mutating.generate.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">generate</span></code> assigns the
@@ -51,16 +50,16 @@
to each element in range <code class="computeroutput"><span class="identifier">rng</span></code>.
Returns the resultant range.
</p>
-<a name="range.reference.algorithms.mutating.generate.definition"></a><h6>
-<a name="id686689"></a>
- <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.generate.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.generate.definition"></a></span><a class="link" href="generate.html#range.reference.algorithms.mutating.generate.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">generate</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.generate.requirements"></a><h6>
-<a name="id686758"></a>
- <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.generate.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.generate.requirements"></a></span><a class="link" href="generate.html#range.reference.algorithms.mutating.generate.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -82,9 +81,9 @@
set of value types.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.generate.precondition_"></a><h6>
-<a name="id686889"></a>
- <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.mutating.generate.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.generate.precondition_"></a></span><a class="link" href="generate.html#range.reference.algorithms.mutating.generate.precondition_">Precondition:</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -96,9 +95,9 @@
<span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is a valid range.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.generate.complexity"></a><h6>
-<a name="id686995"></a>
- <a class="link" href="generate.html#range.reference.algorithms.mutating.generate.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.generate.h5"></a>
+ <span><a name="range.reference.algorithms.mutating.generate.complexity"></a></span><a class="link" href="generate.html#range.reference.algorithms.mutating.generate.complexity">Complexity</a>
</h6>
<p>
Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> assignments are performed.
@@ -106,7 +105,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/inplace_merge.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/inplace_merge.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/inplace_merge.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="generate.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="merge.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_inplace_merge">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.inplace_merge"></a><a class="link" href="inplace_merge.html" title="inplace_merge">inplace_merge</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.inplace_merge.prototype"></a><h6>
-<a name="id687058"></a>
- <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.inplace_merge.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.inplace_merge.prototype"></a></span><a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">></span>
<span class="identifier">BidirectionalRange</span><span class="special">&</span>
@@ -57,9 +56,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.inplace_merge.description"></a><h6>
-<a name="id687615"></a>
- <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.inplace_merge.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.inplace_merge.description"></a></span><a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">inplace_merge</span></code> combines
@@ -70,16 +69,16 @@
is stable, meaning both that the relative order of elements within each
input range is preserved.
</p>
-<a name="range.reference.algorithms.mutating.inplace_merge.definition"></a><h6>
-<a name="id687833"></a>
- <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.inplace_merge.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.inplace_merge.definition"></a></span><a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">inplace_merge</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.inplace_merge.requirements"></a><h6>
-<a name="id687903"></a>
- <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.inplace_merge.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.inplace_merge.requirements"></a></span><a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate version:</strong></span>
@@ -114,13 +113,13 @@
value type is convertible to both <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>'s
argument types.
</p>
-<a name="range.reference.algorithms.mutating.inplace_merge.precondition_"></a><h6>
-<a name="id688158"></a>
- <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.precondition_">Precondition:</a>
- </h6>
-<a name="range.reference.algorithms.mutating.inplace_merge.for_the_non_predicate_version_"></a><h6>
-<a name="id688178"></a>
- <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.for_the_non_predicate_version_">For
+<h6>
+<a name="range.reference.algorithms.mutating.inplace_merge.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.inplace_merge.precondition_"></a></span><a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.precondition_">Precondition:</a>
+ </h6>
+<h6>
+<a name="range.reference.algorithms.mutating.inplace_merge.h5"></a>
+ <span><a name="range.reference.algorithms.mutating.inplace_merge.for_the_non_predicate_version_"></a></span><a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.for_the_non_predicate_version_">For
the non-predicate version:</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -141,9 +140,9 @@
<span class="identifier">x</span></code> is <code class="computeroutput"><span class="keyword">false</span></code>.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.inplace_merge.for_the_predicate_version_"></a><h6>
-<a name="id688439"></a>
- <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.for_the_predicate_version_">For
+<h6>
+<a name="range.reference.algorithms.mutating.inplace_merge.h6"></a>
+ <span><a name="range.reference.algorithms.mutating.inplace_merge.for_the_predicate_version_"></a></span><a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.for_the_predicate_version_">For
the predicate version:</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -162,9 +161,9 @@
<code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">y</span><span class="special">,</span><span class="identifier">x</span><span class="special">)</span> <span class="special">==</span> <span class="keyword">false</span></code>.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.inplace_merge.complexity"></a><h6>
-<a name="id688724"></a>
- <a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.inplace_merge.h7"></a>
+ <span><a name="range.reference.algorithms.mutating.inplace_merge.complexity"></a></span><a class="link" href="inplace_merge.html#range.reference.algorithms.mutating.inplace_merge.complexity">Complexity</a>
</h6>
<p>
Worst case: <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">N</span><span class="special">))</span></code>
@@ -172,7 +171,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/merge.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/merge.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/merge.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="inplace_merge.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="nth_element.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_merge">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.merge"></a><a class="link" href="merge.html" title="merge">merge</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.merge.prototype"></a><h6>
-<a name="id688803"></a>
- <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.merge.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.merge.prototype"></a></span><a class="link" href="merge.html#range.reference.algorithms.mutating.merge.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span>
<span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
@@ -55,9 +54,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.merge.description"></a><h6>
-<a name="id689149"></a>
- <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.merge.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.merge.description"></a></span><a class="link" href="merge.html#range.reference.algorithms.mutating.merge.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">merge</span></code> combines two sorted
@@ -74,16 +73,16 @@
The non-predicate version uses the <code class="computeroutput"><span class="keyword">operator</span><span class="special"><()</span></code> for the range value type. The predicate
version uses the predicate instead of <code class="computeroutput"><span class="keyword">operator</span><span class="special"><()</span></code>.
</p>
-<a name="range.reference.algorithms.mutating.merge.definition"></a><h6>
-<a name="id689324"></a>
- <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.merge.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.merge.definition"></a></span><a class="link" href="merge.html#range.reference.algorithms.mutating.merge.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">merge</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.merge.requirements"></a><h6>
-<a name="id689393"></a>
- <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.merge.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.merge.requirements"></a></span><a class="link" href="merge.html#range.reference.algorithms.mutating.merge.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate version:</strong></span>
@@ -149,13 +148,13 @@
set of value types.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.merge.precondition_"></a><h6>
-<a name="id689915"></a>
- <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.precondition_">Precondition:</a>
- </h6>
-<a name="range.reference.algorithms.mutating.merge.for_the_non_predicate_version_"></a><h6>
-<a name="id689935"></a>
- <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.for_the_non_predicate_version_">For
+<h6>
+<a name="range.reference.algorithms.mutating.merge.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.merge.precondition_"></a></span><a class="link" href="merge.html#range.reference.algorithms.mutating.merge.precondition_">Precondition:</a>
+ </h6>
+<h6>
+<a name="range.reference.algorithms.mutating.merge.h5"></a>
+ <span><a name="range.reference.algorithms.mutating.merge.for_the_non_predicate_version_"></a></span><a class="link" href="merge.html#range.reference.algorithms.mutating.merge.for_the_non_predicate_version_">For
the non-predicate version:</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -193,9 +192,9 @@
is a valid range.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.merge.for_the_predicate_version_"></a><h6>
-<a name="id690400"></a>
- <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.for_the_predicate_version_">For
+<h6>
+<a name="range.reference.algorithms.mutating.merge.h6"></a>
+ <span><a name="range.reference.algorithms.mutating.merge.for_the_predicate_version_"></a></span><a class="link" href="merge.html#range.reference.algorithms.mutating.merge.for_the_predicate_version_">For
the predicate version:</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
@@ -229,9 +228,9 @@
is a valid range.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.merge.complexity"></a><h6>
-<a name="id690889"></a>
- <a class="link" href="merge.html#range.reference.algorithms.mutating.merge.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.merge.h7"></a>
+ <span><a name="range.reference.algorithms.mutating.merge.complexity"></a></span><a class="link" href="merge.html#range.reference.algorithms.mutating.merge.complexity">Complexity</a>
</h6>
<p>
Linear. There are no comparisons if both <code class="computeroutput"><span class="identifier">rng1</span></code>
@@ -242,7 +241,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/nth_element.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/nth_element.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/nth_element.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="merge.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="partial_sort.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_nth_element">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.nth_element"></a><a class="link" href="nth_element.html" title="nth_element">nth_element</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.nth_element.prototype"></a><h6>
-<a name="id691010"></a>
- <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.nth_element.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.nth_element.prototype"></a></span><a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">></span>
<span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">nth_element</span><span class="special">(</span>
@@ -57,9 +56,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.nth_element.description"></a><h6>
-<a name="id691529"></a>
- <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.nth_element.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.nth_element.description"></a></span><a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">nth_element</span></code> partially
@@ -68,16 +67,16 @@
such that the element corresponding with the iterator <code class="computeroutput"><span class="identifier">nth</span></code>
is the same as the element that would be in that position if <code class="computeroutput"><span class="identifier">rng</span></code> has been sorted.
</p>
-<a name="range.reference.algorithms.mutating.nth_element.definition"></a><h6>
-<a name="id691606"></a>
- <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.nth_element.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.nth_element.definition"></a></span><a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">nth_element</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.nth_element.requirements"></a><h6>
-<a name="id691676"></a>
- <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.nth_element.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.nth_element.requirements"></a></span><a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate version:</strong></span>
@@ -126,9 +125,9 @@
argument types.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.nth_element.complexity"></a><h6>
-<a name="id691923"></a>
- <a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.nth_element.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.nth_element.complexity"></a></span><a class="link" href="nth_element.html#range.reference.algorithms.mutating.nth_element.complexity">Complexity</a>
</h6>
<p>
On average, linear in <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
@@ -136,7 +135,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/partial_sort.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/partial_sort.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/partial_sort.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="nth_element.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="partition.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_partial_sort">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.partial_sort"></a><a class="link" href="partial_sort.html" title="partial_sort">partial_sort</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.partial_sort.prototype"></a><h6>
-<a name="id691988"></a>
- <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.partial_sort.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.partial_sort.prototype"></a></span><a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">></span>
<span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">partial_sort</span><span class="special">(</span>
@@ -57,9 +56,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.partial_sort.description"></a><h6>
-<a name="id692508"></a>
- <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.partial_sort.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.partial_sort.description"></a></span><a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">partial_sort</span></code> rearranges
@@ -73,16 +72,16 @@
is less than another by using <code class="computeroutput"><span class="keyword">operator</span><span class="special"><()</span></code>. The predicate versions use the
predicate instead.
</p>
-<a name="range.reference.algorithms.mutating.partial_sort.definition"></a><h6>
-<a name="id692685"></a>
- <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.partial_sort.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.partial_sort.definition"></a></span><a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">partial_sort</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.partial_sort.requirements"></a><h6>
-<a name="id692756"></a>
- <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.partial_sort.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.partial_sort.requirements"></a></span><a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate version:</strong></span>
@@ -131,9 +130,9 @@
argument types.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.partial_sort.complexity"></a><h6>
-<a name="id693003"></a>
- <a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.partial_sort.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.partial_sort.complexity"></a></span><a class="link" href="partial_sort.html#range.reference.algorithms.mutating.partial_sort.complexity">Complexity</a>
</h6>
<p>
Approximately <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">*</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">middle</span><span class="special">))</span></code> comparisons.
@@ -141,7 +140,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/partition.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/partition.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/partition.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="partial_sort.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="random_shuffle.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_partition">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.partition"></a><a class="link" href="partition.html" title="partition">partition</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.partition.prototype"></a><h6>
-<a name="id693119"></a>
- <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.partition.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.partition.prototype"></a></span><a class="link" href="partition.html#range.reference.algorithms.mutating.partition.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span>
<span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
@@ -65,9 +64,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.partition.description"></a><h6>
-<a name="id693695"></a>
- <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.partition.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.partition.description"></a></span><a class="link" href="partition.html#range.reference.algorithms.mutating.partition.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">partition</span></code> orders the
@@ -79,16 +78,16 @@
have a configurable range_return, <code class="computeroutput"><span class="identifier">found</span></code>
corresponds to the middle iterator.
</p>
-<a name="range.reference.algorithms.mutating.partition.definition"></a><h6>
-<a name="id693774"></a>
- <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.partition.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.partition.definition"></a></span><a class="link" href="partition.html#range.reference.algorithms.mutating.partition.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">partition</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.partition.requirements"></a><h6>
-<a name="id693845"></a>
- <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.partition.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.partition.requirements"></a></span><a class="link" href="partition.html#range.reference.algorithms.mutating.partition.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -106,9 +105,9 @@
argument type.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.partition.complexity"></a><h6>
-<a name="id693947"></a>
- <a class="link" href="partition.html#range.reference.algorithms.mutating.partition.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.partition.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.partition.complexity"></a></span><a class="link" href="partition.html#range.reference.algorithms.mutating.partition.complexity">Complexity</a>
</h6>
<p>
Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> applications of <code class="computeroutput"><span class="identifier">pred</span></code>,
@@ -118,7 +117,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/random_shuffle.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/random_shuffle.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/random_shuffle.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="partition.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="remove.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_random_shuffle">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.random_shuffle"></a><a class="link" href="random_shuffle.html" title="random_shuffle">random_shuffle</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.random_shuffle.prototype"></a><h6>
-<a name="id694058"></a>
- <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.random_shuffle.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.random_shuffle.prototype"></a></span><a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">></span>
<span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">random_shuffle</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
@@ -47,9 +46,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.random_shuffle.description"></a><h6>
-<a name="id694442"></a>
- <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.random_shuffle.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.random_shuffle.description"></a></span><a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">random_shuffle</span></code> randomly
@@ -59,16 +58,16 @@
use an internal random number generator. The versions of <code class="computeroutput"><span class="identifier">random_shuffle</span></code> that do specify a <code class="computeroutput"><span class="identifier">Generator</span></code> use this instead. Returns
the shuffles range.
</p>
-<a name="range.reference.algorithms.mutating.random_shuffle.definition"></a><h6>
-<a name="id694530"></a>
- <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.random_shuffle.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.random_shuffle.definition"></a></span><a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">random_shuffle</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.random_shuffle.requirements"></a><h6>
-<a name="id694601"></a>
- <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.random_shuffle.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.random_shuffle.requirements"></a></span><a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the version without a Generator:</strong></span>
@@ -97,18 +96,18 @@
argument type.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.random_shuffle.precondition_"></a><h6>
-<a name="id694751"></a>
- <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.mutating.random_shuffle.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.random_shuffle.precondition_"></a></span><a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.precondition_">Precondition:</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
<code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
is less than <code class="computeroutput"><span class="identifier">gen</span></code>'s
maximum value.
</li></ul></div>
-<a name="range.reference.algorithms.mutating.random_shuffle.complexity"></a><h6>
-<a name="id694815"></a>
- <a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.random_shuffle.h5"></a>
+ <span><a name="range.reference.algorithms.mutating.random_shuffle.complexity"></a></span><a class="link" href="random_shuffle.html#range.reference.algorithms.mutating.random_shuffle.complexity">Complexity</a>
</h6>
<p>
Linear. If <code class="computeroutput"><span class="special">!</span><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>, exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">-</span> <span class="number">1</span></code>
@@ -117,7 +116,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="random_shuffle.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="remove_copy.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_remove">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.remove"></a><a class="link" href="remove.html" title="remove">remove</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.remove.prototype"></a><h6>
-<a name="id694919"></a>
- <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.remove.prototype"></a></span><a class="link" href="remove.html#range.reference.algorithms.mutating.remove.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span>
<span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
@@ -65,9 +64,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.remove.description"></a><h6>
-<a name="id695536"></a>
- <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.remove.description"></a></span><a class="link" href="remove.html#range.reference.algorithms.mutating.remove.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">remove</span></code> removes from
@@ -82,16 +81,16 @@
<span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code>
are dereferenceable, but the elements are unspecified.
</p>
-<a name="range.reference.algorithms.mutating.remove.definition"></a><h6>
-<a name="id695762"></a>
- <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.remove.definition"></a></span><a class="link" href="remove.html#range.reference.algorithms.mutating.remove.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">remove</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.remove.requirements"></a><h6>
-<a name="id695833"></a>
- <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.remove.requirements"></a></span><a class="link" href="remove.html#range.reference.algorithms.mutating.remove.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -112,9 +111,9 @@
value type.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.remove.complexity"></a><h6>
-<a name="id695954"></a>
- <a class="link" href="remove.html#range.reference.algorithms.mutating.remove.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.remove.complexity"></a></span><a class="link" href="remove.html#range.reference.algorithms.mutating.remove.complexity">Complexity</a>
</h6>
<p>
Linear. <code class="computeroutput"><span class="identifier">remove</span></code> performs
@@ -124,7 +123,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="remove.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="remove_copy_if.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_remove_copy">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.remove_copy"></a><a class="link" href="remove_copy.html" title="remove_copy">remove_copy</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.remove_copy.prototype"></a><h6>
-<a name="id696029"></a>
- <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_copy.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.remove_copy.prototype"></a></span><a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Outputiterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">></span>
<span class="identifier">OutputIterator</span>
@@ -43,25 +42,25 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.remove_copy.description"></a><h6>
-<a name="id696332"></a>
- <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_copy.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.remove_copy.description"></a></span><a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">remove_copy</span></code> copied all
of the elements <code class="computeroutput"><span class="identifier">x</span></code> from
<code class="computeroutput"><span class="identifier">rng</span></code> for which <code class="computeroutput"><span class="identifier">x</span> <span class="special">==</span> <span class="identifier">val</span></code> is <code class="computeroutput"><span class="keyword">false</span></code>.
</p>
-<a name="range.reference.algorithms.mutating.remove_copy.definition"></a><h6>
-<a name="id696418"></a>
- <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_copy.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.remove_copy.definition"></a></span><a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">remove_copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.remove_copy.requirements"></a><h6>
-<a name="id696488"></a>
- <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_copy.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.remove_copy.requirements"></a></span><a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -82,9 +81,9 @@
value type.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.remove_copy.complexity"></a><h6>
-<a name="id696609"></a>
- <a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_copy.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.remove_copy.complexity"></a></span><a class="link" href="remove_copy.html#range.reference.algorithms.mutating.remove_copy.complexity">Complexity</a>
</h6>
<p>
Linear. <code class="computeroutput"><span class="identifier">remove_copy</span></code> performs
@@ -94,7 +93,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy_if.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy_if.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove_copy_if.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="remove_copy.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="remove_if.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_remove_copy_if">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.remove_copy_if"></a><a class="link" href="remove_copy_if.html" title="remove_copy_if">remove_copy_if</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.remove_copy_if.prototype"></a><h6>
-<a name="id696683"></a>
- <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_copy_if.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.remove_copy_if.prototype"></a></span><a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Outputiterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPred</span><span class="special">></span>
<span class="identifier">OutputIterator</span>
@@ -43,9 +42,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.remove_copy_if.description"></a><h6>
-<a name="id696964"></a>
- <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_copy_if.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.remove_copy_if.description"></a></span><a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">remove_copy_if</span></code> copied
@@ -53,16 +52,16 @@
from <code class="computeroutput"><span class="identifier">rng</span></code> for which <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
is <code class="computeroutput"><span class="keyword">false</span></code>.
</p>
-<a name="range.reference.algorithms.mutating.remove_copy_if.definition"></a><h6>
-<a name="id697054"></a>
- <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_copy_if.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.remove_copy_if.definition"></a></span><a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">remove_copy_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.remove_copy_if.requirements"></a><h6>
-<a name="id697124"></a>
- <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_copy_if.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.remove_copy_if.requirements"></a></span><a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -78,9 +77,9 @@
of the <code class="computeroutput"><span class="identifier">UnaryPredicateConcept</span></code>.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.remove_copy_if.complexity"></a><h6>
-<a name="id697217"></a>
- <a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_copy_if.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.remove_copy_if.complexity"></a></span><a class="link" href="remove_copy_if.html#range.reference.algorithms.mutating.remove_copy_if.complexity">Complexity</a>
</h6>
<p>
Linear. <code class="computeroutput"><span class="identifier">remove_copy_if</span></code>
@@ -89,7 +88,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove_if.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove_if.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/remove_if.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="remove_copy_if.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="replace.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_remove_if">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.remove_if"></a><a class="link" href="remove_if.html" title="remove_if">remove_if</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.remove_if.prototype"></a><h6>
-<a name="id697291"></a>
- <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_if.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.remove_if.prototype"></a></span><a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span>
<span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
@@ -65,9 +64,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.remove_if.description"></a><h6>
-<a name="id697867"></a>
- <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_if.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.remove_if.description"></a></span><a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">remove_if</span></code> removes from
@@ -81,16 +80,16 @@
the range <code class="computeroutput"><span class="special">[</span><span class="identifier">new_last</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> are dereferenceable, but the elements
are unspecified.
</p>
-<a name="range.reference.algorithms.mutating.remove_if.definition"></a><h6>
-<a name="id698089"></a>
- <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_if.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.remove_if.definition"></a></span><a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">remove_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.remove_if.requirements"></a><h6>
-<a name="id698160"></a>
- <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_if.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.remove_if.requirements"></a></span><a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -111,9 +110,9 @@
argument type.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.remove_if.complexity"></a><h6>
-<a name="id698282"></a>
- <a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.remove_if.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.remove_if.complexity"></a></span><a class="link" href="remove_if.html#range.reference.algorithms.mutating.remove_if.complexity">Complexity</a>
</h6>
<p>
Linear. <code class="computeroutput"><span class="identifier">remove_if</span></code> performs
@@ -123,7 +122,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="remove_if.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="replace_copy.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_replace">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.replace"></a><a class="link" href="replace.html" title="replace">replace</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.replace.prototype"></a><h6>
-<a name="id698368"></a>
- <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.replace.prototype"></a></span><a class="link" href="replace.html#range.reference.algorithms.mutating.replace.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span>
<span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
@@ -47,25 +46,25 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.replace.description"></a><h6>
-<a name="id698680"></a>
- <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.replace.description"></a></span><a class="link" href="replace.html#range.reference.algorithms.mutating.replace.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">replace</span></code> every element
in <code class="computeroutput"><span class="identifier">rng</span></code> equal to <code class="computeroutput"><span class="identifier">what</span></code> with <code class="computeroutput"><span class="identifier">with_what</span></code>.
Return a reference to <code class="computeroutput"><span class="identifier">rng</span></code>.
</p>
-<a name="range.reference.algorithms.mutating.replace.definition"></a><h6>
-<a name="id698755"></a>
- <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.replace.definition"></a></span><a class="link" href="replace.html#range.reference.algorithms.mutating.replace.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">replace</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.replace.requirements"></a><h6>
-<a name="id698825"></a>
- <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.replace.requirements"></a></span><a class="link" href="replace.html#range.reference.algorithms.mutating.replace.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -92,9 +91,9 @@
value type.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.replace.complexity"></a><h6>
-<a name="id698985"></a>
- <a class="link" href="replace.html#range.reference.algorithms.mutating.replace.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.replace.complexity"></a></span><a class="link" href="replace.html#range.reference.algorithms.mutating.replace.complexity">Complexity</a>
</h6>
<p>
Linear. <code class="computeroutput"><span class="identifier">replace</span></code> performs
@@ -104,7 +103,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="replace.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="replace_copy_if.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_replace_copy">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.replace_copy"></a><a class="link" href="replace_copy.html" title="replace_copy">replace_copy</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.replace_copy.prototype"></a><h6>
-<a name="id699084"></a>
- <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_copy.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.replace_copy.prototype"></a></span><a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">></span>
<span class="identifier">OutputIterator</span> <span class="identifier">replace_copy</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span>
@@ -39,9 +38,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.replace_copy.description"></a><h6>
-<a name="id699279"></a>
- <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_copy.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.replace_copy.description"></a></span><a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">replace_copy</span></code> copy every
@@ -52,16 +51,16 @@
<span class="identifier">with_what</span> <span class="special">:</span>
<span class="identifier">x</span></code>.
</p>
-<a name="range.reference.algorithms.mutating.replace_copy.definition"></a><h6>
-<a name="id699388"></a>
- <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_copy.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.replace_copy.definition"></a></span><a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">replace_copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.replace_copy.requirements"></a><h6>
-<a name="id699458"></a>
- <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_copy.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.replace_copy.requirements"></a></span><a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -86,9 +85,9 @@
a model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.replace_copy.complexity"></a><h6>
-<a name="id699606"></a>
- <a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_copy.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.replace_copy.complexity"></a></span><a class="link" href="replace_copy.html#range.reference.algorithms.mutating.replace_copy.complexity">Complexity</a>
</h6>
<p>
Linear. <code class="computeroutput"><span class="identifier">replace_copy</span></code>
@@ -97,7 +96,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy_if.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy_if.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace_copy_if.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="replace_copy.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="replace_if.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_replace_copy_if">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.replace_copy_if"></a><a class="link" href="replace_copy_if.html" title="replace_copy_if">replace_copy_if</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.replace_copy_if.prototype"></a><h6>
-<a name="id699680"></a>
- <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_copy_if.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.replace_copy_if.prototype"></a></span><a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">></span>
<span class="identifier">OutputIterator</span> <span class="identifier">replace_copy_if</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span>
@@ -39,9 +38,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.replace_copy_if.description"></a><h6>
-<a name="id699881"></a>
- <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_copy_if.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.replace_copy_if.description"></a></span><a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">replace_copy_if</span></code> copy
@@ -50,16 +49,16 @@
is <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span> <span class="special">?</span> <span class="identifier">with_what</span>
<span class="special">:</span> <span class="identifier">x</span></code>.
</p>
-<a name="range.reference.algorithms.mutating.replace_copy_if.definition"></a><h6>
-<a name="id699992"></a>
- <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_copy_if.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.replace_copy_if.definition"></a></span><a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">replace_copy_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.replace_copy_if.requirements"></a><h6>
-<a name="id700063"></a>
- <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_copy_if.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.replace_copy_if.requirements"></a></span><a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -88,9 +87,9 @@
a model of the <code class="computeroutput"><span class="identifier">UnaryPredicateConcept</span></code>.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.replace_copy_if.complexity"></a><h6>
-<a name="id700239"></a>
- <a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_copy_if.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.replace_copy_if.complexity"></a></span><a class="link" href="replace_copy_if.html#range.reference.algorithms.mutating.replace_copy_if.complexity">Complexity</a>
</h6>
<p>
Linear. <code class="computeroutput"><span class="identifier">replace_copy_if</span></code>
@@ -99,7 +98,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace_if.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace_if.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/replace_if.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="replace_copy_if.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="reverse.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_replace_if">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.replace_if"></a><a class="link" href="replace_if.html" title="replace_if">replace_if</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.replace_if.prototype"></a><h6>
-<a name="id700324"></a>
- <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_if.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.replace_if.prototype"></a></span><a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">></span>
<span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">replace_if</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryPredicate</span> <span class="identifier">pred</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&</span> <span class="identifier">with_what</span><span class="special">);</span>
@@ -41,25 +40,25 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.replace_if.description"></a><h6>
-<a name="id700643"></a>
- <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_if.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.replace_if.description"></a></span><a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">replace_if</span></code> replaces every
element <code class="computeroutput"><span class="identifier">x</span></code> in <code class="computeroutput"><span class="identifier">rng</span></code> for which <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span> <span class="special">==</span> <span class="keyword">true</span></code> with <code class="computeroutput"><span class="identifier">with_what</span></code>.
Returns a reference to <code class="computeroutput"><span class="identifier">rng</span></code>.
</p>
-<a name="range.reference.algorithms.mutating.replace_if.definition"></a><h6>
-<a name="id700754"></a>
- <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_if.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.replace_if.definition"></a></span><a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">replace_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.replace_if.requirements"></a><h6>
-<a name="id700825"></a>
- <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_if.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.replace_if.requirements"></a></span><a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -89,9 +88,9 @@
of the <code class="computeroutput"><span class="identifier">AssignableConcept</span></code>.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.replace_if.complexity"></a><h6>
-<a name="id701001"></a>
- <a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.replace_if.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.replace_if.complexity"></a></span><a class="link" href="replace_if.html#range.reference.algorithms.mutating.replace_if.complexity">Complexity</a>
</h6>
<p>
Linear. <code class="computeroutput"><span class="identifier">replace_if</span></code> performs
@@ -102,7 +101,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/reverse.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/reverse.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/reverse.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="replace_if.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="reverse_copy.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_reverse">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.reverse"></a><a class="link" href="reverse.html" title="reverse">reverse</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.reverse.prototype"></a><h6>
-<a name="id701111"></a>
- <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.reverse.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.reverse.prototype"></a></span><a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">></span>
<span class="identifier">BidirectionalRange</span><span class="special">&</span> <span class="identifier">reverse</span><span class="special">(</span><span class="identifier">BidirectionalRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
@@ -41,24 +40,24 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.reverse.description"></a><h6>
-<a name="id701281"></a>
- <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.reverse.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.reverse.description"></a></span><a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">reverse</span></code> reverses a range.
Returns a reference to the reversed range.
</p>
-<a name="range.reference.algorithms.mutating.reverse.definition"></a><h6>
-<a name="id701314"></a>
- <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.reverse.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.reverse.definition"></a></span><a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">reverse</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.reverse.requirements"></a><h6>
-<a name="id701385"></a>
- <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.reverse.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.reverse.requirements"></a></span><a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -71,9 +70,9 @@
is mutable.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.reverse.complexity"></a><h6>
-<a name="id701451"></a>
- <a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.reverse.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.reverse.complexity"></a></span><a class="link" href="reverse.html#range.reference.algorithms.mutating.reverse.complexity">Complexity</a>
</h6>
<p>
Linear. <code class="computeroutput"><span class="identifier">reverse</span></code> makes
@@ -82,7 +81,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/reverse_copy.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/reverse_copy.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/reverse_copy.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,25 +22,24 @@
<div class="spirit-nav">
<a accesskey="p" href="reverse.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="rotate.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_reverse_copy">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.reverse_copy"></a><a class="link" href="reverse_copy.html" title="reverse_copy">reverse_copy</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.reverse_copy.prototype"></a><h6>
-<a name="id701540"></a>
- <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.reverse_copy.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.reverse_copy.prototype"></a></span><a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">></span>
<span class="identifier">OutputIterator</span> <span class="identifier">reverse_copy</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">);</span>
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.reverse_copy.description"></a><h6>
-<a name="id701667"></a>
- <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.reverse_copy.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.reverse_copy.description"></a></span><a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">reverse_copy</span></code> copies the
@@ -48,16 +47,16 @@
reverse order to <code class="computeroutput"><span class="identifier">out</span></code>.
Returns the output iterator one passed the last copied element.
</p>
-<a name="range.reference.algorithms.mutating.reverse_copy.definition"></a><h6>
-<a name="id701723"></a>
- <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.reverse_copy.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.reverse_copy.definition"></a></span><a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">reverse_copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.reverse_copy.requirements"></a><h6>
-<a name="id701792"></a>
- <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.reverse_copy.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.reverse_copy.requirements"></a></span><a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -74,9 +73,9 @@
a model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.reverse_copy.complexity"></a><h6>
-<a name="id701885"></a>
- <a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.reverse_copy.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.reverse_copy.complexity"></a></span><a class="link" href="reverse_copy.html#range.reference.algorithms.mutating.reverse_copy.complexity">Complexity</a>
</h6>
<p>
Linear. <code class="computeroutput"><span class="identifier">reverse_copy</span></code>
@@ -86,7 +85,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/rotate.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/rotate.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/rotate.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="reverse_copy.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="rotate_copy.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_rotate">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.rotate"></a><a class="link" href="rotate.html" title="rotate">rotate</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.rotate.prototype"></a><h6>
-<a name="id701961"></a>
- <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.rotate.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.rotate.prototype"></a></span><a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">></span>
<span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">rotate</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span>
@@ -43,25 +42,25 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.rotate.description"></a><h6>
-<a name="id702217"></a>
- <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.rotate.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.rotate.description"></a></span><a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">rotate</span></code> rotates the elements
in a range. It exchanges the two ranges <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">middle</span><span class="special">)</span></code>
and <code class="computeroutput"><span class="special">[</span><span class="identifier">middle</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code>. Returns a reference to <code class="computeroutput"><span class="identifier">rng</span></code>.
</p>
-<a name="range.reference.algorithms.mutating.rotate.definition"></a><h6>
-<a name="id702338"></a>
- <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.rotate.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.rotate.definition"></a></span><a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">rotate</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.rotate.requirements"></a><h6>
-<a name="id702407"></a>
- <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.rotate.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.rotate.requirements"></a></span><a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -73,9 +72,9 @@
<code class="computeroutput"><span class="identifier">ForwardRange</span></code> is mutable.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.rotate.precondition_"></a><h6>
-<a name="id702473"></a>
- <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.mutating.rotate.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.rotate.precondition_"></a></span><a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.precondition_">Precondition:</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -85,9 +84,9 @@
<code class="computeroutput"><span class="special">[</span><span class="identifier">middle</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is a valid range.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.rotate.complexity"></a><h6>
-<a name="id702586"></a>
- <a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.rotate.h5"></a>
+ <span><a name="range.reference.algorithms.mutating.rotate.complexity"></a></span><a class="link" href="rotate.html#range.reference.algorithms.mutating.rotate.complexity">Complexity</a>
</h6>
<p>
Linear. At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> swaps are performed.
@@ -95,7 +94,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/rotate_copy.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/rotate_copy.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/rotate_copy.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="rotate.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="sort.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_rotate_copy">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.rotate_copy"></a><a class="link" href="rotate_copy.html" title="rotate_copy">rotate_copy</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.rotate_copy.prototype"></a><h6>
-<a name="id702649"></a>
- <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.rotate_copy.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.rotate_copy.prototype"></a></span><a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">></span>
<span class="identifier">OutputIterator</span> <span class="identifier">rotate_copy</span><span class="special">(</span>
@@ -41,25 +40,25 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.rotate_copy.description"></a><h6>
-<a name="id702817"></a>
- <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.rotate_copy.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.rotate_copy.description"></a></span><a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">rotate_copy</span></code> rotates the
elements in a range. It copies the two ranges <code class="computeroutput"><span class="special">[</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">middle</span><span class="special">)</span></code>
and <code class="computeroutput"><span class="special">[</span><span class="identifier">middle</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> to <code class="computeroutput"><span class="identifier">out</span></code>.
</p>
-<a name="range.reference.algorithms.mutating.rotate_copy.definition"></a><h6>
-<a name="id702938"></a>
- <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.rotate_copy.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.rotate_copy.definition"></a></span><a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">rotate_copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.rotate_copy.requirements"></a><h6>
-<a name="id703007"></a>
- <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.rotate_copy.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.rotate_copy.requirements"></a></span><a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -75,9 +74,9 @@
a model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.rotate_copy.precondition_"></a><h6>
-<a name="id703100"></a>
- <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.mutating.rotate_copy.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.rotate_copy.precondition_"></a></span><a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.precondition_">Precondition:</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -87,9 +86,9 @@
<code class="computeroutput"><span class="special">[</span><span class="identifier">middle</span><span class="special">,</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is a valid range.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.rotate_copy.complexity"></a><h6>
-<a name="id703212"></a>
- <a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.rotate_copy.h5"></a>
+ <span><a name="range.reference.algorithms.mutating.rotate_copy.complexity"></a></span><a class="link" href="rotate_copy.html#range.reference.algorithms.mutating.rotate_copy.complexity">Complexity</a>
</h6>
<p>
Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> elements are copied.
@@ -97,7 +96,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/sort.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/sort.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/sort.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="rotate_copy.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="stable_partition.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_sort">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.sort"></a><a class="link" href="sort.html" title="sort">sort</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.sort.prototype"></a><h6>
-<a name="id703276"></a>
- <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.sort.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.sort.prototype"></a></span><a class="link" href="sort.html#range.reference.algorithms.mutating.sort.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">></span>
<span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">sort</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
@@ -47,9 +46,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.sort.description"></a><h6>
-<a name="id703652"></a>
- <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.sort.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.sort.description"></a></span><a class="link" href="sort.html#range.reference.algorithms.mutating.sort.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">sort</span></code> sorts the elements
@@ -70,16 +69,16 @@
function with a predicate, ascending order is defined by <code class="computeroutput"><span class="identifier">pred</span></code> such that for all adjacent elements
<code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>, <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">y</span><span class="special">,</span> <span class="identifier">x</span><span class="special">)</span> <span class="special">==</span> <span class="keyword">false</span></code>.
</p>
-<a name="range.reference.algorithms.mutating.sort.definition"></a><h6>
-<a name="id703896"></a>
- <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.sort.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.sort.definition"></a></span><a class="link" href="sort.html#range.reference.algorithms.mutating.sort.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">sort</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.sort.requirements"></a><h6>
-<a name="id703965"></a>
- <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.sort.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.sort.requirements"></a></span><a class="link" href="sort.html#range.reference.algorithms.mutating.sort.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For versions of sort without a predicate:</strong></span>
@@ -128,9 +127,9 @@
argument types.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.sort.complexity"></a><h6>
-<a name="id704212"></a>
- <a class="link" href="sort.html#range.reference.algorithms.mutating.sort.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.sort.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.sort.complexity"></a></span><a class="link" href="sort.html#range.reference.algorithms.mutating.sort.complexity">Complexity</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span> <span class="identifier">log</span><span class="special">(</span><span class="identifier">N</span><span class="special">))</span></code> comparisons (both average and worst-case),
@@ -139,7 +138,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/stable_partition.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/stable_partition.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/stable_partition.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="sort.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="stable_sort.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_stable_partition">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.stable_partition"></a><a class="link" href="stable_partition.html" title="stable_partition">stable_partition</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.stable_partition.prototype"></a><h6>
-<a name="id704324"></a>
- <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.stable_partition.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.stable_partition.prototype"></a></span><a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">></span>
<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span>
@@ -59,9 +58,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.stable_partition.description"></a><h6>
-<a name="id704898"></a>
- <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.stable_partition.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.stable_partition.description"></a></span><a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">stable_partition</span></code> reorders
@@ -81,16 +80,16 @@
the <code class="computeroutput"><span class="identifier">found</span></code> iterator is
the iterator to the first element that fails to satisfy <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
-<a name="range.reference.algorithms.mutating.stable_partition.definition"></a><h6>
-<a name="id705039"></a>
- <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.stable_partition.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.stable_partition.definition"></a></span><a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">stable_partition</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.stable_partition.requirements"></a><h6>
-<a name="id705110"></a>
- <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.stable_partition.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.stable_partition.requirements"></a></span><a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -106,9 +105,9 @@
a model of the <code class="computeroutput"><span class="identifier">PredicateConcept</span></code>.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.stable_partition.complexity"></a><h6>
-<a name="id705203"></a>
- <a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.stable_partition.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.stable_partition.complexity"></a></span><a class="link" href="stable_partition.html#range.reference.algorithms.mutating.stable_partition.complexity">Complexity</a>
</h6>
<p>
Best case: <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>
@@ -120,7 +119,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/stable_sort.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/stable_sort.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/stable_sort.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="stable_partition.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="swap_ranges.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_stable_sort">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.stable_sort"></a><a class="link" href="stable_sort.html" title="stable_sort">stable_sort</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.stable_sort.prototype"></a><h6>
-<a name="id705369"></a>
- <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.stable_sort.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.stable_sort.prototype"></a></span><a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">RandomAccessRange</span><span class="special">></span>
<span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">stable_sort</span><span class="special">(</span><span class="identifier">RandomAccessRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
@@ -47,9 +46,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.stable_sort.description"></a><h6>
-<a name="id705745"></a>
- <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.stable_sort.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.stable_sort.description"></a></span><a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">stable_sort</span></code> sorts the
@@ -70,16 +69,16 @@
function with a predicate, ascending order is designed by <code class="computeroutput"><span class="identifier">pred</span></code> such that for all adjacent elements
<code class="computeroutput"><span class="special">[</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">]</span></code>, <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">y</span><span class="special">,</span><span class="identifier">x</span><span class="special">)</span> <span class="special">==</span> <span class="keyword">false</span></code>.
</p>
-<a name="range.reference.algorithms.mutating.stable_sort.definition"></a><h6>
-<a name="id705989"></a>
- <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.stable_sort.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.stable_sort.definition"></a></span><a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">stable_sort</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.stable_sort.requirements"></a><h6>
-<a name="id706060"></a>
- <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.stable_sort.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.stable_sort.requirements"></a></span><a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For versions of stable_sort without a predicate</strong></span>
@@ -128,9 +127,9 @@
argument types.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.stable_sort.complexity"></a><h6>
-<a name="id706307"></a>
- <a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.stable_sort.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.stable_sort.complexity"></a></span><a class="link" href="stable_sort.html#range.reference.algorithms.mutating.stable_sort.complexity">Complexity</a>
</h6>
<p>
Best case: <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>
@@ -142,7 +141,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/swap_ranges.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/swap_ranges.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/swap_ranges.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,25 +22,24 @@
<div class="spirit-nav">
<a accesskey="p" href="stable_sort.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="transform.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_swap_ranges">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.swap_ranges"></a><a class="link" href="swap_ranges.html" title="swap_ranges">swap_ranges</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.swap_ranges.prototype"></a><h6>
-<a name="id706485"></a>
- <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.swap_ranges.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.swap_ranges.prototype"></a></span><a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">></span>
<span class="identifier">SinglePassRange2</span><span class="special">&</span> <span class="identifier">swap_ranges</span><span class="special">(</span><span class="identifier">SinglePassRange1</span><span class="special">&</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="identifier">SinglePassRange</span><span class="special">&</span> <span class="identifier">rng2</span><span class="special">);</span>
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.swap_ranges.description"></a><h6>
-<a name="id706616"></a>
- <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.swap_ranges.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.swap_ranges.description"></a></span><a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">swap_ranges</span></code> swaps each
@@ -48,16 +47,16 @@
<code class="computeroutput"><span class="identifier">y</span></code> in <code class="computeroutput"><span class="identifier">rng2</span></code>.
Returns a reference to <code class="computeroutput"><span class="identifier">rng2</span></code>.
</p>
-<a name="range.reference.algorithms.mutating.swap_ranges.definition"></a><h6>
-<a name="id706703"></a>
- <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.swap_ranges.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.swap_ranges.definition"></a></span><a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">swap_ranges</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.swap_ranges.requirements"></a><h6>
-<a name="id706773"></a>
- <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.swap_ranges.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.swap_ranges.requirements"></a></span><a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -79,9 +78,9 @@
is mutable.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.swap_ranges.complexity"></a><h6>
-<a name="id706880"></a>
- <a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.swap_ranges.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.swap_ranges.complexity"></a></span><a class="link" href="swap_ranges.html#range.reference.algorithms.mutating.swap_ranges.complexity">Complexity</a>
</h6>
<p>
Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code> elements are swapped.
@@ -89,7 +88,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/transform.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/transform.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/transform.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="swap_ranges.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unique.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_transform">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.transform"></a><a class="link" href="transform.html" title="transform">transform</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.transform.prototype"></a><h6>
-<a name="id706944"></a>
- <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.transform.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.transform.prototype"></a></span><a class="link" href="transform.html#range.reference.algorithms.mutating.transform.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span>
<span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
@@ -55,9 +54,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.transform.description"></a><h6>
-<a name="id707279"></a>
- <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.transform.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.transform.description"></a></span><a class="link" href="transform.html#range.reference.algorithms.mutating.transform.description">Description</a>
</h6>
<p>
<span class="bold"><strong>UnaryOperation version:</strong></span>
@@ -91,16 +90,16 @@
<p>
The return value is <code class="computeroutput"><span class="identifier">out</span> <span class="special">+</span> <span class="identifier">min</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">),</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>.
</p>
-<a name="range.reference.algorithms.mutating.transform.definition"></a><h6>
-<a name="id707818"></a>
- <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.transform.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.transform.definition"></a></span><a class="link" href="transform.html#range.reference.algorithms.mutating.transform.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">transform</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.transform.requirements"></a><h6>
-<a name="id707889"></a>
- <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.transform.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.transform.requirements"></a></span><a class="link" href="transform.html#range.reference.algorithms.mutating.transform.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the unary versions of transform:</strong></span>
@@ -168,9 +167,9 @@
set of value types.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.transform.precondition_"></a><h6>
-<a name="id708258"></a>
- <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.mutating.transform.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.transform.precondition_"></a></span><a class="link" href="transform.html#range.reference.algorithms.mutating.transform.precondition_">Precondition:</a>
</h6>
<p>
<span class="bold"><strong>For the unary version of transform:</strong></span>
@@ -202,9 +201,9 @@
<span class="special">+</span> <span class="identifier">min</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">),</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)))</span></code> is a valid range.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.transform.complexity"></a><h6>
-<a name="id708682"></a>
- <a class="link" href="transform.html#range.reference.algorithms.mutating.transform.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.transform.h5"></a>
+ <span><a name="range.reference.algorithms.mutating.transform.complexity"></a></span><a class="link" href="transform.html#range.reference.algorithms.mutating.transform.complexity">Complexity</a>
</h6>
<p>
Linear. The operation is applied exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code> for the unary version and <code class="computeroutput"><span class="identifier">min</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">),</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>
@@ -213,7 +212,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/unique.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/unique.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/unique.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="transform.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unique_copy.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_unique">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.unique"></a><a class="link" href="unique.html" title="unique">unique</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.unique.prototype"></a><h6>
-<a name="id708800"></a>
- <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.unique.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.unique.prototype"></a></span><a class="link" href="unique.html#range.reference.algorithms.mutating.unique.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">></span>
<span class="keyword">typename</span> <span class="identifier">range_return</span><span class="special"><</span><span class="identifier">ForwardRange</span><span class="special">,</span> <span class="identifier">return_begin_found</span><span class="special">>::</span><span class="identifier">type</span>
@@ -67,9 +66,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.unique.description"></a><h6>
-<a name="id709822"></a>
- <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.unique.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.unique.description"></a></span><a class="link" href="unique.html#range.reference.algorithms.mutating.unique.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">unique</span></code> removes all but
@@ -85,16 +84,16 @@
for <code class="computeroutput"><span class="identifier">ForwardRange</span></code>'s value
type.
</p>
-<a name="range.reference.algorithms.mutating.unique.definition"></a><h6>
-<a name="id709940"></a>
- <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.unique.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.unique.definition"></a></span><a class="link" href="unique.html#range.reference.algorithms.mutating.unique.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">unique</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.unique.requirements"></a><h6>
-<a name="id710010"></a>
- <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.unique.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.unique.requirements"></a></span><a class="link" href="unique.html#range.reference.algorithms.mutating.unique.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions of unique:</strong></span>
@@ -136,9 +135,9 @@
second argument type.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.unique.complexity"></a><h6>
-<a name="id710232"></a>
- <a class="link" href="unique.html#range.reference.algorithms.mutating.unique.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.unique.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.unique.complexity"></a></span><a class="link" href="unique.html#range.reference.algorithms.mutating.unique.complexity">Complexity</a>
</h6>
<p>
Linear. <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>
@@ -149,7 +148,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/mutating/unique_copy.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/mutating/unique_copy.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/mutating/unique_copy.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="unique.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_mutating_unique_copy">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.mutating.unique_copy"></a><a class="link" href="unique_copy.html" title="unique_copy">unique_copy</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.mutating.unique_copy.prototype"></a><h6>
-<a name="id710354"></a>
- <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.mutating.unique_copy.h0"></a>
+ <span><a name="range.reference.algorithms.mutating.unique_copy.prototype"></a></span><a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">></span>
<span class="identifier">OutputIterator</span> <span class="identifier">unique_copy</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">);</span>
@@ -41,9 +40,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.mutating.unique_copy.description"></a><h6>
-<a name="id710611"></a>
- <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.mutating.unique_copy.h1"></a>
+ <span><a name="range.reference.algorithms.mutating.unique_copy.description"></a></span><a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">unique_copy</span></code> copies the
@@ -54,16 +53,16 @@
for <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>'s
value type.
</p>
-<a name="range.reference.algorithms.mutating.unique_copy.definition"></a><h6>
-<a name="id710696"></a>
- <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.mutating.unique_copy.h2"></a>
+ <span><a name="range.reference.algorithms.mutating.unique_copy.definition"></a></span><a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">unique_copy</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.mutating.unique_copy.requirements"></a><h6>
-<a name="id710767"></a>
- <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.mutating.unique_copy.h3"></a>
+ <span><a name="range.reference.algorithms.mutating.unique_copy.requirements"></a></span><a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions of unique:</strong></span>
@@ -115,9 +114,9 @@
a model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
</li>
</ul></div>
-<a name="range.reference.algorithms.mutating.unique_copy.complexity"></a><h6>
-<a name="id711046"></a>
- <a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.mutating.unique_copy.h4"></a>
+ <span><a name="range.reference.algorithms.mutating.unique_copy.complexity"></a></span><a class="link" href="unique_copy.html#range.reference.algorithms.mutating.unique_copy.complexity">Complexity</a>
</h6>
<p>
Linear. <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>
@@ -128,7 +127,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/new.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/new.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/new.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="permutation/prev_permutation.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="new/copy_n.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_new">
<div class="titlepage"><div><div><h4 class="title">
<a name="range.reference.algorithms.new"></a><a class="link" href="new.html" title="New algorithms">New algorithms</a>
</h4></div></div></div>
@@ -42,7 +42,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/new/copy_n.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/new/copy_n.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/new/copy_n.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,25 +22,24 @@
<div class="spirit-nav">
<a accesskey="p" href="../new.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="erase.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_new_copy_n">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.new.copy_n"></a><a class="link" href="copy_n.html" title="copy_n">copy_n</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.new.copy_n.prototype"></a><h6>
-<a name="id744730"></a>
- <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.new.copy_n.h0"></a>
+ <span><a name="range.reference.algorithms.new.copy_n.prototype"></a></span><a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Size</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">></span>
<span class="identifier">OutputIterator</span> <span class="identifier">copy_n</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Size</span> <span class="identifier">n</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">);</span>
</pre>
<p>
</p>
-<a name="range.reference.algorithms.new.copy_n.description"></a><h6>
-<a name="id744888"></a>
- <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.new.copy_n.h1"></a>
+ <span><a name="range.reference.algorithms.new.copy_n.description"></a></span><a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">copy_n</span></code> is provided to
@@ -52,16 +51,16 @@
<code class="computeroutput"><span class="identifier">copy_n</span></code> copies elements
from <code class="computeroutput"><span class="special">[</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">+</span> <span class="identifier">n</span><span class="special">)</span></code> to the range <code class="computeroutput"><span class="special">[</span><span class="identifier">out</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">+</span> <span class="identifier">n</span><span class="special">)</span></code>
</p>
-<a name="range.reference.algorithms.new.copy_n.definition"></a><h6>
-<a name="id745058"></a>
- <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.new.copy_n.h2"></a>
+ <span><a name="range.reference.algorithms.new.copy_n.definition"></a></span><a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">copy_n</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.new.copy_n.requirements"></a><h6>
-<a name="id745129"></a>
- <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.new.copy_n.h3"></a>
+ <span><a name="range.reference.algorithms.new.copy_n.requirements"></a></span><a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
@@ -78,9 +77,9 @@
a model of the <code class="computeroutput"><span class="identifier">OutputIteratorConcept</span></code>.
</li>
</ol></div>
-<a name="range.reference.algorithms.new.copy_n.complexity"></a><h6>
-<a name="id745236"></a>
- <a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.new.copy_n.h4"></a>
+ <span><a name="range.reference.algorithms.new.copy_n.complexity"></a></span><a class="link" href="copy_n.html#range.reference.algorithms.new.copy_n.complexity">Complexity</a>
</h6>
<p>
Linear. Exactly <code class="computeroutput"><span class="identifier">n</span></code> elements
@@ -89,7 +88,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/new/erase.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/new/erase.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/new/erase.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="copy_n.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="for_each.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_new_erase">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.new.erase"></a><a class="link" href="erase.html" title="erase">erase</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.new.erase.prototype"></a><h6>
-<a name="id745287"></a>
- <a class="link" href="erase.html#range.reference.algorithms.new.erase.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.new.erase.h0"></a>
+ <span><a name="range.reference.algorithms.new.erase.prototype"></a></span><a class="link" href="erase.html#range.reference.algorithms.new.erase.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">Container</span><span class="special">></span>
<span class="identifier">Container</span><span class="special">&</span> <span class="identifier">erase</span><span class="special">(</span>
@@ -40,9 +39,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.new.erase.description"></a><h6>
-<a name="id745427"></a>
- <a class="link" href="erase.html#range.reference.algorithms.new.erase.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.new.erase.h1"></a>
+ <span><a name="range.reference.algorithms.new.erase.description"></a></span><a class="link" href="erase.html#range.reference.algorithms.new.erase.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">erase</span></code> the iterator range
@@ -57,24 +56,24 @@
<code class="computeroutput"><span class="identifier">remove_erase_if</span></code> performs
the frequently used combination equivalent to <code class="computeroutput"><span class="identifier">target</span><span class="special">.</span><span class="identifier">erase</span><span class="special">(</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">remove_if</span><span class="special">(</span><span class="identifier">target</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">target</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">pred</span><span class="special">),</span> <span class="identifier">target</span><span class="special">.</span><span class="identifier">end</span><span class="special">());</span></code>
</p>
-<a name="range.reference.algorithms.new.erase.definition"></a><h6>
-<a name="id745727"></a>
- <a class="link" href="erase.html#range.reference.algorithms.new.erase.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.new.erase.h2"></a>
+ <span><a name="range.reference.algorithms.new.erase.definition"></a></span><a class="link" href="erase.html#range.reference.algorithms.new.erase.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">erase</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.new.erase.requirements"></a><h6>
-<a name="id745796"></a>
- <a class="link" href="erase.html#range.reference.algorithms.new.erase.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.new.erase.h3"></a>
+ <span><a name="range.reference.algorithms.new.erase.requirements"></a></span><a class="link" href="erase.html#range.reference.algorithms.new.erase.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
<code class="computeroutput"><span class="identifier">Container</span></code> supports
erase of an iterator range.
</li></ol></div>
-<a name="range.reference.algorithms.new.erase.complexity"></a><h6>
-<a name="id745840"></a>
- <a class="link" href="erase.html#range.reference.algorithms.new.erase.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.new.erase.h4"></a>
+ <span><a name="range.reference.algorithms.new.erase.complexity"></a></span><a class="link" href="erase.html#range.reference.algorithms.new.erase.complexity">Complexity</a>
</h6>
<p>
Linear. Proprotional to <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">to_erase</span><span class="special">)</span></code>.
@@ -82,7 +81,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/new/for_each.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/new/for_each.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/new/for_each.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="erase.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="insert.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_new_for_each">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.new.for_each"></a><a class="link" href="for_each.html" title="for_each">for_each</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.new.for_each.prototype"></a><h6>
-<a name="id745904"></a>
- <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.new.for_each.h0"></a>
+ <span><a name="range.reference.algorithms.new.for_each.prototype"></a></span><a class="link" href="for_each.html#range.reference.algorithms.new.for_each.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span>
<span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
@@ -71,9 +70,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.new.for_each.description"></a><h6>
-<a name="id746478"></a>
- <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.new.for_each.h1"></a>
+ <span><a name="range.reference.algorithms.new.for_each.description"></a></span><a class="link" href="for_each.html#range.reference.algorithms.new.for_each.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">for_each</span></code> traverses forward
@@ -87,16 +86,16 @@
Iteration is stopped upon reaching the end of the shorter of <code class="computeroutput"><span class="identifier">rng1</span></code>, or <code class="computeroutput"><span class="identifier">rng2</span></code>.
It is safe to call this function with unequal length ranges.
</p>
-<a name="range.reference.algorithms.new.for_each.definition"></a><h6>
-<a name="id746634"></a>
- <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.new.for_each.h2"></a>
+ <span><a name="range.reference.algorithms.new.for_each.definition"></a></span><a class="link" href="for_each.html#range.reference.algorithms.new.for_each.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">for_each</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.new.for_each.requirements"></a><h6>
-<a name="id746705"></a>
- <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.new.for_each.h3"></a>
+ <span><a name="range.reference.algorithms.new.for_each.requirements"></a></span><a class="link" href="for_each.html#range.reference.algorithms.new.for_each.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
@@ -124,9 +123,9 @@
second argument type.
</li>
</ol></div>
-<a name="range.reference.algorithms.new.for_each.complexity"></a><h6>
-<a name="id746866"></a>
- <a class="link" href="for_each.html#range.reference.algorithms.new.for_each.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.new.for_each.h4"></a>
+ <span><a name="range.reference.algorithms.new.for_each.complexity"></a></span><a class="link" href="for_each.html#range.reference.algorithms.new.for_each.complexity">Complexity</a>
</h6>
<p>
Linear. Exactly <code class="computeroutput"><span class="identifier">min</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">),</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>
@@ -135,7 +134,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/new/insert.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/new/insert.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/new/insert.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="for_each.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="iota.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_new_insert">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.new.insert"></a><a class="link" href="insert.html" title="insert">insert</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.new.insert.prototype"></a><h6>
-<a name="id746969"></a>
- <a class="link" href="insert.html#range.reference.algorithms.new.insert.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.new.insert.h0"></a>
+ <span><a name="range.reference.algorithms.new.insert.prototype"></a></span><a class="link" href="insert.html#range.reference.algorithms.new.insert.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span>
<span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span>
@@ -43,9 +42,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.new.insert.description"></a><h6>
-<a name="id747139"></a>
- <a class="link" href="insert.html#range.reference.algorithms.new.insert.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.new.insert.h1"></a>
+ <span><a name="range.reference.algorithms.new.insert.description"></a></span><a class="link" href="insert.html#range.reference.algorithms.new.insert.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">insert</span></code> all of the elements
@@ -53,16 +52,16 @@
the <code class="computeroutput"><span class="identifier">before</span></code> iterator into
<code class="computeroutput"><span class="identifier">target</span></code>.
</p>
-<a name="range.reference.algorithms.new.insert.definition"></a><h6>
-<a name="id747205"></a>
- <a class="link" href="insert.html#range.reference.algorithms.new.insert.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.new.insert.h2"></a>
+ <span><a name="range.reference.algorithms.new.insert.definition"></a></span><a class="link" href="insert.html#range.reference.algorithms.new.insert.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">insert</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.new.insert.requirements"></a><h6>
-<a name="id747275"></a>
- <a class="link" href="insert.html#range.reference.algorithms.new.insert.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.new.insert.h3"></a>
+ <span><a name="range.reference.algorithms.new.insert.requirements"></a></span><a class="link" href="insert.html#range.reference.algorithms.new.insert.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
@@ -80,9 +79,9 @@
value type.
</li>
</ol></div>
-<a name="range.reference.algorithms.new.insert.complexity"></a><h6>
-<a name="id747373"></a>
- <a class="link" href="insert.html#range.reference.algorithms.new.insert.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.new.insert.h4"></a>
+ <span><a name="range.reference.algorithms.new.insert.complexity"></a></span><a class="link" href="insert.html#range.reference.algorithms.new.insert.complexity">Complexity</a>
</h6>
<p>
Linear. <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">from</span><span class="special">)</span></code>
@@ -91,7 +90,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/new/iota.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/new/iota.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/new/iota.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,25 +22,24 @@
<div class="spirit-nav">
<a accesskey="p" href="insert.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="is_sorted.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_new_iota">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.new.iota"></a><a class="link" href="iota.html" title="iota">iota</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.new.iota.prototype"></a><h6>
-<a name="id747438"></a>
- <a class="link" href="iota.html#range.reference.algorithms.new.iota.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.new.iota.h0"></a>
+ <span><a name="range.reference.algorithms.new.iota.prototype"></a></span><a class="link" href="iota.html#range.reference.algorithms.new.iota.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">></span>
<span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">iota</span><span class="special">(</span><span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">Value</span> <span class="identifier">x</span><span class="special">);</span>
</pre>
<p>
</p>
-<a name="range.reference.algorithms.new.iota.description"></a><h6>
-<a name="id747564"></a>
- <a class="link" href="iota.html#range.reference.algorithms.new.iota.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.new.iota.h1"></a>
+ <span><a name="range.reference.algorithms.new.iota.description"></a></span><a class="link" href="iota.html#range.reference.algorithms.new.iota.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">iota</span></code> traverses forward
@@ -49,16 +48,16 @@
is assigned a value equivalent to <code class="computeroutput"><span class="identifier">x</span>
<span class="special">+</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">it</span><span class="special">)</span></code>
</p>
-<a name="range.reference.algorithms.new.iota.definition"></a><h6>
-<a name="id747700"></a>
- <a class="link" href="iota.html#range.reference.algorithms.new.iota.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.new.iota.h2"></a>
+ <span><a name="range.reference.algorithms.new.iota.definition"></a></span><a class="link" href="iota.html#range.reference.algorithms.new.iota.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">iota</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.new.iota.requirements"></a><h6>
-<a name="id747770"></a>
- <a class="link" href="iota.html#range.reference.algorithms.new.iota.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.new.iota.h3"></a>
+ <span><a name="range.reference.algorithms.new.iota.requirements"></a></span><a class="link" href="iota.html#range.reference.algorithms.new.iota.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
@@ -72,9 +71,9 @@
Concept.
</li>
</ol></div>
-<a name="range.reference.algorithms.new.iota.complexity"></a><h6>
-<a name="id747850"></a>
- <a class="link" href="iota.html#range.reference.algorithms.new.iota.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.new.iota.h4"></a>
+ <span><a name="range.reference.algorithms.new.iota.complexity"></a></span><a class="link" href="iota.html#range.reference.algorithms.new.iota.complexity">Complexity</a>
</h6>
<p>
Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> assignments into <code class="computeroutput"><span class="identifier">rng</span></code>.
@@ -82,7 +81,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/new/is_sorted.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/new/is_sorted.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/new/is_sorted.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="iota.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="overwrite.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_new_is_sorted">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.new.is_sorted"></a><a class="link" href="is_sorted.html" title="is_sorted">is_sorted</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.new.is_sorted.prototype"></a><h6>
-<a name="id747924"></a>
- <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.new.is_sorted.h0"></a>
+ <span><a name="range.reference.algorithms.new.is_sorted.prototype"></a></span><a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">></span>
<span class="keyword">bool</span> <span class="identifier">is_sorted</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
@@ -41,9 +40,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.new.is_sorted.description"></a><h6>
-<a name="id748118"></a>
- <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.new.is_sorted.h1"></a>
+ <span><a name="range.reference.algorithms.new.is_sorted.description"></a></span><a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">is_sorted</span></code> determines
@@ -57,16 +56,16 @@
the expression <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">)</span></code>
is <code class="computeroutput"><span class="keyword">true</span></code>.
</p>
-<a name="range.reference.algorithms.new.is_sorted.definition"></a><h6>
-<a name="id748306"></a>
- <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.new.is_sorted.h2"></a>
+ <span><a name="range.reference.algorithms.new.is_sorted.definition"></a></span><a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">is_sorted</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.new.is_sorted.requirements"></a><h6>
-<a name="id748376"></a>
- <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.new.is_sorted.h3"></a>
+ <span><a name="range.reference.algorithms.new.is_sorted.requirements"></a></span><a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
@@ -84,9 +83,9 @@
is convertible to both argument types of <code class="computeroutput"><span class="identifier">BinaryPredicate</span></code>.
</li>
</ol></div>
-<a name="range.reference.algorithms.new.is_sorted.complexity"></a><h6>
-<a name="id748485"></a>
- <a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.new.is_sorted.h4"></a>
+ <span><a name="range.reference.algorithms.new.is_sorted.complexity"></a></span><a class="link" href="is_sorted.html#range.reference.algorithms.new.is_sorted.complexity">Complexity</a>
</h6>
<p>
Linear. A maximum of <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> comparisons are performed.
@@ -94,7 +93,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/new/overwrite.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/new/overwrite.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/new/overwrite.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="is_sorted.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="push_back.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_new_overwrite">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.new.overwrite"></a><a class="link" href="overwrite.html" title="overwrite">overwrite</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.new.overwrite.prototype"></a><h6>
-<a name="id748550"></a>
- <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.new.overwrite.h0"></a>
+ <span><a name="range.reference.algorithms.new.overwrite.prototype"></a></span><a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span>
<span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
@@ -42,25 +41,25 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.new.overwrite.description"></a><h6>
-<a name="id748683"></a>
- <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.new.overwrite.h1"></a>
+ <span><a name="range.reference.algorithms.new.overwrite.description"></a></span><a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">overwrite</span></code> assigns the
values from the range <code class="computeroutput"><span class="identifier">from</span></code>
into the range <code class="computeroutput"><span class="identifier">to</span></code>.
</p>
-<a name="range.reference.algorithms.new.overwrite.definition"></a><h6>
-<a name="id748739"></a>
- <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.new.overwrite.h2"></a>
+ <span><a name="range.reference.algorithms.new.overwrite.definition"></a></span><a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">overwrite</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.new.overwrite.requirements"></a><h6>
-<a name="id748810"></a>
- <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.new.overwrite.h3"></a>
+ <span><a name="range.reference.algorithms.new.overwrite.requirements"></a></span><a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
@@ -87,9 +86,9 @@
value type.
</li>
</ol></div>
-<a name="range.reference.algorithms.new.overwrite.complexity"></a><h6>
-<a name="id748987"></a>
- <a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.new.overwrite.h4"></a>
+ <span><a name="range.reference.algorithms.new.overwrite.complexity"></a></span><a class="link" href="overwrite.html#range.reference.algorithms.new.overwrite.complexity">Complexity</a>
</h6>
<p>
Linear. <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code>
@@ -98,7 +97,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/new/push_back.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/new/push_back.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/new/push_back.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="overwrite.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="push_front.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_new_push_back">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.new.push_back"></a><a class="link" href="push_back.html" title="push_back">push_back</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.new.push_back.prototype"></a><h6>
-<a name="id749051"></a>
- <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.new.push_back.h0"></a>
+ <span><a name="range.reference.algorithms.new.push_back.prototype"></a></span><a class="link" href="push_back.html#range.reference.algorithms.new.push_back.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span>
<span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span>
@@ -42,25 +41,25 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.new.push_back.description"></a><h6>
-<a name="id749190"></a>
- <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.new.push_back.h1"></a>
+ <span><a name="range.reference.algorithms.new.push_back.description"></a></span><a class="link" href="push_back.html#range.reference.algorithms.new.push_back.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">push_back</span></code> all of the
elements in the range <code class="computeroutput"><span class="identifier">from</span></code>
to the back of the container <code class="computeroutput"><span class="identifier">target</span></code>.
</p>
-<a name="range.reference.algorithms.new.push_back.definition"></a><h6>
-<a name="id749246"></a>
- <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.new.push_back.h2"></a>
+ <span><a name="range.reference.algorithms.new.push_back.definition"></a></span><a class="link" href="push_back.html#range.reference.algorithms.new.push_back.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">push_back</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.new.push_back.requirements"></a><h6>
-<a name="id749316"></a>
- <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.new.push_back.h3"></a>
+ <span><a name="range.reference.algorithms.new.push_back.requirements"></a></span><a class="link" href="push_back.html#range.reference.algorithms.new.push_back.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
@@ -78,9 +77,9 @@
value type.
</li>
</ol></div>
-<a name="range.reference.algorithms.new.push_back.complexity"></a><h6>
-<a name="id749427"></a>
- <a class="link" href="push_back.html#range.reference.algorithms.new.push_back.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.new.push_back.h4"></a>
+ <span><a name="range.reference.algorithms.new.push_back.complexity"></a></span><a class="link" href="push_back.html#range.reference.algorithms.new.push_back.complexity">Complexity</a>
</h6>
<p>
Linear. <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">from</span><span class="special">)</span></code>
@@ -89,7 +88,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/new/push_front.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/new/push_front.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/new/push_front.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="push_back.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="remove_erase.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_new_push_front">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.new.push_front"></a><a class="link" href="push_front.html" title="push_front">push_front</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.new.push_front.prototype"></a><h6>
-<a name="id749493"></a>
- <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.new.push_front.h0"></a>
+ <span><a name="range.reference.algorithms.new.push_front.prototype"></a></span><a class="link" href="push_front.html#range.reference.algorithms.new.push_front.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span>
<span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span>
@@ -42,25 +41,25 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.new.push_front.description"></a><h6>
-<a name="id749631"></a>
- <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.new.push_front.h1"></a>
+ <span><a name="range.reference.algorithms.new.push_front.description"></a></span><a class="link" href="push_front.html#range.reference.algorithms.new.push_front.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">push_front</span></code> all of the
elements in the range <code class="computeroutput"><span class="identifier">from</span></code>
to the front of the container <code class="computeroutput"><span class="identifier">target</span></code>.
</p>
-<a name="range.reference.algorithms.new.push_front.definition"></a><h6>
-<a name="id749686"></a>
- <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.new.push_front.h2"></a>
+ <span><a name="range.reference.algorithms.new.push_front.definition"></a></span><a class="link" href="push_front.html#range.reference.algorithms.new.push_front.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">push_front</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.new.push_front.requirements"></a><h6>
-<a name="id749755"></a>
- <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.new.push_front.h3"></a>
+ <span><a name="range.reference.algorithms.new.push_front.requirements"></a></span><a class="link" href="push_front.html#range.reference.algorithms.new.push_front.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
@@ -78,9 +77,9 @@
value type.
</li>
</ol></div>
-<a name="range.reference.algorithms.new.push_front.complexity"></a><h6>
-<a name="id749868"></a>
- <a class="link" href="push_front.html#range.reference.algorithms.new.push_front.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.new.push_front.h4"></a>
+ <span><a name="range.reference.algorithms.new.push_front.complexity"></a></span><a class="link" href="push_front.html#range.reference.algorithms.new.push_front.complexity">Complexity</a>
</h6>
<p>
Linear. <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">from</span><span class="special">)</span></code>
@@ -89,7 +88,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/new/remove_erase.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/new/remove_erase.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/new/remove_erase.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="push_front.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="remove_erase_if.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_new_remove_erase">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.new.remove_erase"></a><a class="link" href="remove_erase.html" title="remove_erase">remove_erase</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.new.remove_erase.prototype"></a><h6>
-<a name="id749933"></a>
- <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.new.remove_erase.h0"></a>
+ <span><a name="range.reference.algorithms.new.remove_erase.prototype"></a></span><a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">></span>
<span class="identifier">Container</span><span class="special">&</span> <span class="identifier">remove_erase</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&</span> <span class="identifier">target</span><span class="special">,</span>
@@ -39,9 +38,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.new.remove_erase.description"></a><h6>
-<a name="id750070"></a>
- <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.new.remove_erase.h1"></a>
+ <span><a name="range.reference.algorithms.new.remove_erase.description"></a></span><a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">remove_erase</span></code> actually
@@ -49,24 +48,24 @@
from the container. This is in contrast to the <code class="computeroutput"><span class="identifier">remove</span></code>
algorithm which merely rearranges elements.
</p>
-<a name="range.reference.algorithms.new.remove_erase.definition"></a><h6>
-<a name="id750126"></a>
- <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.new.remove_erase.h2"></a>
+ <span><a name="range.reference.algorithms.new.remove_erase.definition"></a></span><a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">erase</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.new.remove_erase.requirements"></a><h6>
-<a name="id750197"></a>
- <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.new.remove_erase.h3"></a>
+ <span><a name="range.reference.algorithms.new.remove_erase.requirements"></a></span><a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
<code class="computeroutput"><span class="identifier">Container</span></code> supports
erase of an iterator range.
</li></ol></div>
-<a name="range.reference.algorithms.new.remove_erase.complexity"></a><h6>
-<a name="id750242"></a>
- <a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.new.remove_erase.h4"></a>
+ <span><a name="range.reference.algorithms.new.remove_erase.complexity"></a></span><a class="link" href="remove_erase.html#range.reference.algorithms.new.remove_erase.complexity">Complexity</a>
</h6>
<p>
Linear. Proportional to <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">target</span><span class="special">)</span></code>s.
@@ -74,7 +73,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/new/remove_erase_if.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/new/remove_erase_if.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/new/remove_erase_if.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="remove_erase.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../new.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../numeric.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_new_remove_erase_if">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.new.remove_erase_if"></a><a class="link" href="remove_erase_if.html" title="remove_erase_if">remove_erase_if</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.new.remove_erase_if.prototype"></a><h6>
-<a name="id750307"></a>
- <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.new.remove_erase_if.h0"></a>
+ <span><a name="range.reference.algorithms.new.remove_erase_if.prototype"></a></span><a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">Container</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Pred</span><span class="special">></span>
<span class="identifier">Container</span><span class="special">&</span> <span class="identifier">remove_erase_if</span><span class="special">(</span><span class="identifier">Container</span><span class="special">&</span> <span class="identifier">target</span><span class="special">,</span>
@@ -39,9 +38,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.new.remove_erase_if.description"></a><h6>
-<a name="id750434"></a>
- <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.new.remove_erase_if.h1"></a>
+ <span><a name="range.reference.algorithms.new.remove_erase_if.description"></a></span><a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">remove_erase_if</span></code> removes
@@ -50,16 +49,16 @@
from the container. This is in contrast to the <code class="computeroutput"><span class="identifier">erase</span></code>
algorithm which merely rearranges elements.
</p>
-<a name="range.reference.algorithms.new.remove_erase_if.definition"></a><h6>
-<a name="id750514"></a>
- <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.new.remove_erase_if.h2"></a>
+ <span><a name="range.reference.algorithms.new.remove_erase_if.definition"></a></span><a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm_ext</span><span class="special">/</span><span class="identifier">erase</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.new.remove_erase_if.requirements"></a><h6>
-<a name="id750585"></a>
- <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.new.remove_erase_if.h3"></a>
+ <span><a name="range.reference.algorithms.new.remove_erase_if.requirements"></a></span><a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
@@ -71,9 +70,9 @@
the <code class="computeroutput"><span class="identifier">Predicate</span></code> Concept.
</li>
</ol></div>
-<a name="range.reference.algorithms.new.remove_erase_if.complexity"></a><h6>
-<a name="id750659"></a>
- <a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.new.remove_erase_if.h4"></a>
+ <span><a name="range.reference.algorithms.new.remove_erase_if.complexity"></a></span><a class="link" href="remove_erase_if.html#range.reference.algorithms.new.remove_erase_if.complexity">Complexity</a>
</h6>
<p>
Linear. Proportional to <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">target</span><span class="special">)</span></code>s.
@@ -81,7 +80,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="mutating/unique_copy.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="non_mutating/adjacent_find.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating">
<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>
@@ -51,7 +51,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="binary_search.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_adjacent_find">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.non_mutating.adjacent_find"></a><a class="link" href="adjacent_find.html" title="adjacent_find">adjacent_find</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.adjacent_find.prototype"></a><h6>
-<a name="id711185"></a>
- <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.adjacent_find.h0"></a>
+ <span><a name="range.reference.algorithms.non_mutating.adjacent_find.prototype"></a></span><a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">></span>
<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span>
@@ -75,9 +74,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.non_mutating.adjacent_find.description"></a><h6>
-<a name="id712162"></a>
- <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.adjacent_find.h1"></a>
+ <span><a name="range.reference.algorithms.non_mutating.adjacent_find.description"></a></span><a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.description">Description</a>
</h6>
<p>
<span class="bold"><strong>Non-predicate versions:</strong></span>
@@ -96,16 +95,16 @@
in <code class="computeroutput"><span class="identifier">rng</span></code> where <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">)</span></code>
is <code class="computeroutput"><span class="keyword">true</span></code>.
</p>
-<a name="range.reference.algorithms.non_mutating.adjacent_find.definition"></a><h6>
-<a name="id712369"></a>
- <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.adjacent_find.h2"></a>
+ <span><a name="range.reference.algorithms.non_mutating.adjacent_find.definition"></a></span><a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">adjacent_find</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.non_mutating.adjacent_find.requirements"></a><h6>
-<a name="id712440"></a>
- <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.adjacent_find.h3"></a>
+ <span><a name="range.reference.algorithms.non_mutating.adjacent_find.requirements"></a></span><a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions of adjacent_find:</strong></span>
@@ -141,9 +140,9 @@
second argument type.
</li>
</ul></div>
-<a name="range.reference.algorithms.non_mutating.adjacent_find.complexity"></a><h6>
-<a name="id712629"></a>
- <a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.adjacent_find.h4"></a>
+ <span><a name="range.reference.algorithms.non_mutating.adjacent_find.complexity"></a></span><a class="link" href="adjacent_find.html#range.reference.algorithms.non_mutating.adjacent_find.complexity">Complexity</a>
</h6>
<p>
Linear. If <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
@@ -153,7 +152,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/binary_search.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/binary_search.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/binary_search.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="adjacent_find.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="count.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_binary_search">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.non_mutating.binary_search"></a><a class="link" href="binary_search.html" title="binary_search">binary_search</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.binary_search.prototype"></a><h6>
-<a name="id712729"></a>
- <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.binary_search.h0"></a>
+ <span><a name="range.reference.algorithms.non_mutating.binary_search.prototype"></a></span><a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">></span>
<span class="keyword">bool</span> <span class="identifier">binary_search</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&</span> <span class="identifier">val</span><span class="special">);</span>
@@ -41,9 +40,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.non_mutating.binary_search.description"></a><h6>
-<a name="id713006"></a>
- <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.binary_search.h1"></a>
+ <span><a name="range.reference.algorithms.non_mutating.binary_search.description"></a></span><a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">binary_search</span></code> returns
@@ -51,16 +50,16 @@
value <code class="computeroutput"><span class="identifier">val</span></code> exists in the
range <code class="computeroutput"><span class="identifier">rng</span></code>.
</p>
-<a name="range.reference.algorithms.non_mutating.binary_search.definition"></a><h6>
-<a name="id713072"></a>
- <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.binary_search.h2"></a>
+ <span><a name="range.reference.algorithms.non_mutating.binary_search.definition"></a></span><a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">binary_search</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.non_mutating.binary_search.requirements"></a><h6>
-<a name="id713142"></a>
- <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.binary_search.h3"></a>
+ <span><a name="range.reference.algorithms.non_mutating.binary_search.requirements"></a></span><a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions of binary_search:</strong></span>
@@ -109,9 +108,9 @@
argument type.
</li>
</ul></div>
-<a name="range.reference.algorithms.non_mutating.binary_search.precondition_"></a><h6>
-<a name="id713411"></a>
- <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.binary_search.h4"></a>
+ <span><a name="range.reference.algorithms.non_mutating.binary_search.precondition_"></a></span><a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.precondition_">Precondition:</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate version:</strong></span>
@@ -127,9 +126,9 @@
<code class="computeroutput"><span class="identifier">rng</span></code> is ordered in ascending
order according to the function object <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
-<a name="range.reference.algorithms.non_mutating.binary_search.complexity"></a><h6>
-<a name="id713503"></a>
- <a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.binary_search.h5"></a>
+ <span><a name="range.reference.algorithms.non_mutating.binary_search.complexity"></a></span><a class="link" href="binary_search.html#range.reference.algorithms.non_mutating.binary_search.complexity">Complexity</a>
</h6>
<p>
For non-random-access ranges, the complexity is <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code> where <code class="computeroutput"><span class="identifier">N</span></code>
@@ -142,7 +141,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/count.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/count.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/count.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="binary_search.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="count_if.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_count">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.non_mutating.count"></a><a class="link" href="count.html" title="count">count</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.count.prototype"></a><h6>
-<a name="id713666"></a>
- <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.count.h0"></a>
+ <span><a name="range.reference.algorithms.non_mutating.count.prototype"></a></span><a class="link" href="count.html#range.reference.algorithms.non_mutating.count.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">></span>
<span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special"><</span><span class="identifier">SinglePassRange</span><span class="special">>::</span><span class="identifier">type</span>
@@ -43,9 +42,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.non_mutating.count.description"></a><h6>
-<a name="id713960"></a>
- <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.count.h1"></a>
+ <span><a name="range.reference.algorithms.non_mutating.count.description"></a></span><a class="link" href="count.html#range.reference.algorithms.non_mutating.count.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">count</span></code> returns the number
@@ -53,16 +52,16 @@
<span class="special">==</span> <span class="identifier">val</span></code>
is <code class="computeroutput"><span class="keyword">true</span></code>.
</p>
-<a name="range.reference.algorithms.non_mutating.count.definition"></a><h6>
-<a name="id714048"></a>
- <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.count.h2"></a>
+ <span><a name="range.reference.algorithms.non_mutating.count.definition"></a></span><a class="link" href="count.html#range.reference.algorithms.non_mutating.count.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">count</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.non_mutating.count.requirements"></a><h6>
-<a name="id714118"></a>
- <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.count.h3"></a>
+ <span><a name="range.reference.algorithms.non_mutating.count.requirements"></a></span><a class="link" href="count.html#range.reference.algorithms.non_mutating.count.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -83,9 +82,9 @@
value type can be compared for equality with an object of type <code class="computeroutput"><span class="identifier">Value</span></code>.
</li>
</ul></div>
-<a name="range.reference.algorithms.non_mutating.count.complexity"></a><h6>
-<a name="id714250"></a>
- <a class="link" href="count.html#range.reference.algorithms.non_mutating.count.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.count.h4"></a>
+ <span><a name="range.reference.algorithms.non_mutating.count.complexity"></a></span><a class="link" href="count.html#range.reference.algorithms.non_mutating.count.complexity">Complexity</a>
</h6>
<p>
Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> comparisons.
@@ -93,7 +92,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/count_if.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/count_if.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/count_if.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="count.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="equal.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_count_if">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.non_mutating.count_if"></a><a class="link" href="count_if.html" title="count_if">count_if</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.count_if.prototype"></a><h6>
-<a name="id714315"></a>
- <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.count_if.h0"></a>
+ <span><a name="range.reference.algorithms.non_mutating.count_if.prototype"></a></span><a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">></span>
<span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">>::</span><span class="identifier">type</span>
@@ -39,9 +38,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.non_mutating.count_if.description"></a><h6>
-<a name="id714472"></a>
- <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.count_if.h1"></a>
+ <span><a name="range.reference.algorithms.non_mutating.count_if.description"></a></span><a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">count_if</span></code> returns the
@@ -49,16 +48,16 @@
in <code class="computeroutput"><span class="identifier">rng</span></code> where <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>
is <code class="computeroutput"><span class="keyword">true</span></code>.
</p>
-<a name="range.reference.algorithms.non_mutating.count_if.definition"></a><h6>
-<a name="id714562"></a>
- <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.count_if.h2"></a>
+ <span><a name="range.reference.algorithms.non_mutating.count_if.definition"></a></span><a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">count_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.non_mutating.count_if.requirements"></a><h6>
-<a name="id714631"></a>
- <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.count_if.h3"></a>
+ <span><a name="range.reference.algorithms.non_mutating.count_if.requirements"></a></span><a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -79,9 +78,9 @@
is convertible to the argument type of <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>.
</li>
</ul></div>
-<a name="range.reference.algorithms.non_mutating.count_if.complexity"></a><h6>
-<a name="id714763"></a>
- <a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.count_if.h4"></a>
+ <span><a name="range.reference.algorithms.non_mutating.count_if.complexity"></a></span><a class="link" href="count_if.html#range.reference.algorithms.non_mutating.count_if.complexity">Complexity</a>
</h6>
<p>
Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> invocations of <code class="computeroutput"><span class="identifier">pred</span></code>.
@@ -89,7 +88,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/equal.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/equal.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/equal.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="count_if.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="equal_range.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_equal">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.non_mutating.equal"></a><a class="link" href="equal.html" title="equal">equal</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.equal.prototype"></a><h6>
-<a name="id714837"></a>
- <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.equal.h0"></a>
+ <span><a name="range.reference.algorithms.non_mutating.equal.prototype"></a></span><a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span>
<span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
@@ -51,9 +50,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.non_mutating.equal.description"></a><h6>
-<a name="id715120"></a>
- <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.equal.h1"></a>
+ <span><a name="range.reference.algorithms.non_mutating.equal.description"></a></span><a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">equal</span></code> returns <code class="computeroutput"><span class="keyword">true</span></code> if <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code> is equal to the <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code> and for each element <code class="computeroutput"><span class="identifier">x</span></code>
@@ -69,16 +68,16 @@
returns <code class="computeroutput"><span class="keyword">true</span></code>. Elements are
considered equal in the predicate version if <code class="computeroutput"><span class="identifier">pred</span><span class="special">(</span><span class="identifier">x</span><span class="special">,</span><span class="identifier">y</span><span class="special">)</span></code> is <code class="computeroutput"><span class="keyword">true</span></code>.
</p>
-<a name="range.reference.algorithms.non_mutating.equal.definition"></a><h6>
-<a name="id715354"></a>
- <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.equal.h2"></a>
+ <span><a name="range.reference.algorithms.non_mutating.equal.definition"></a></span><a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">equal</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.non_mutating.equal.requirements"></a><h6>
-<a name="id715424"></a>
- <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.equal.h3"></a>
+ <span><a name="range.reference.algorithms.non_mutating.equal.requirements"></a></span><a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -137,9 +136,9 @@
second argument type.
</li>
</ul></div>
-<a name="range.reference.algorithms.non_mutating.equal.complexity"></a><h6>
-<a name="id715734"></a>
- <a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.equal.h4"></a>
+ <span><a name="range.reference.algorithms.non_mutating.equal.complexity"></a></span><a class="link" href="equal.html#range.reference.algorithms.non_mutating.equal.complexity">Complexity</a>
</h6>
<p>
Linear. At most <code class="computeroutput"><span class="identifier">min</span><span class="special">(</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">),</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">))</span></code>
@@ -148,7 +147,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/equal_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/equal_range.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/equal_range.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="equal.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="for_each.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_equal_range">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.non_mutating.equal_range"></a><a class="link" href="equal_range.html" title="equal_range">equal_range</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.equal_range.prototype"></a><h6>
-<a name="id715826"></a>
- <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.equal_range.h0"></a>
+ <span><a name="range.reference.algorithms.non_mutating.equal_range.prototype"></a></span><a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span>
<span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span>
@@ -65,13 +64,13 @@
<span class="special">></span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span><span class="special">,</span>
<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span><span class="special">></span>
-<span class="identifier">equal_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&</span> <span class="identifier">val</span><span class="special">,</span> <span class="identifier">SortPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
- </pre>
+<span class="identifier">equal_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Value</span><span class="special">&</span> <span class="identifier">val</span><span class="special">,</span> <span class="identifier">SortPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
<p>
</p>
-<a name="range.reference.algorithms.non_mutating.equal_range.description"></a><h6>
-<a name="id716698"></a>
- <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.equal_range.h1"></a>
+ <span><a name="range.reference.algorithms.non_mutating.equal_range.description"></a></span><a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">equal_range</span></code> returns a
@@ -83,16 +82,16 @@
the equality of elements is determined by <code class="computeroutput"><span class="keyword">operator</span><span class="special"><</span></code>. For the predicate versions of <code class="computeroutput"><span class="identifier">equal_range</span></code> the equality of elements
is determined by <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
-<a name="range.reference.algorithms.non_mutating.equal_range.definition"></a><h6>
-<a name="id716841"></a>
- <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.equal_range.h2"></a>
+ <span><a name="range.reference.algorithms.non_mutating.equal_range.definition"></a></span><a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">equal_range</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.non_mutating.equal_range.requirements"></a><h6>
-<a name="id716911"></a>
- <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.equal_range.h3"></a>
+ <span><a name="range.reference.algorithms.non_mutating.equal_range.requirements"></a></span><a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -141,9 +140,9 @@
argument types.
</li>
</ul></div>
-<a name="range.reference.algorithms.non_mutating.equal_range.precondition_"></a><h6>
-<a name="id717180"></a>
- <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.equal_range.h4"></a>
+ <span><a name="range.reference.algorithms.non_mutating.equal_range.precondition_"></a></span><a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.precondition_">Precondition:</a>
</h6>
<p>
For the non-predicate versions: <code class="computeroutput"><span class="identifier">rng</span></code>
@@ -153,9 +152,9 @@
For the predicate versions: <code class="computeroutput"><span class="identifier">rng</span></code>
is ordered in ascending order according to <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
-<a name="range.reference.algorithms.non_mutating.equal_range.complexity"></a><h6>
-<a name="id717254"></a>
- <a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.equal_range.h5"></a>
+ <span><a name="range.reference.algorithms.non_mutating.equal_range.complexity"></a></span><a class="link" href="equal_range.html#range.reference.algorithms.non_mutating.equal_range.complexity">Complexity</a>
</h6>
<p>
For random-access ranges, the complexity is <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">log</span> <span class="identifier">N</span><span class="special">)</span></code>,
@@ -164,7 +163,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="for_each.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="find_end.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_find">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.non_mutating.find"></a><a class="link" href="find.html" title="find">find</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.find.prototype"></a><h6>
-<a name="id717917"></a>
- <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find.h0"></a>
+ <span><a name="range.reference.algorithms.non_mutating.find.prototype"></a></span><a class="link" href="find.html#range.reference.algorithms.non_mutating.find.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">></span>
<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">SinglePassRange</span><span class="special">>::</span><span class="identifier">type</span>
@@ -47,9 +46,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.non_mutating.find.description"></a><h6>
-<a name="id718205"></a>
- <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find.h1"></a>
+ <span><a name="range.reference.algorithms.non_mutating.find.description"></a></span><a class="link" href="find.html#range.reference.algorithms.non_mutating.find.description">Description</a>
</h6>
<p>
The versions of <code class="computeroutput"><span class="identifier">find</span></code>
@@ -58,16 +57,16 @@
defines <code class="computeroutput"><span class="identifier">found</span></code> in the
same manner as the returned iterator described above.
</p>
-<a name="range.reference.algorithms.non_mutating.find.definition"></a><h6>
-<a name="id718322"></a>
- <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find.h2"></a>
+ <span><a name="range.reference.algorithms.non_mutating.find.definition"></a></span><a class="link" href="find.html#range.reference.algorithms.non_mutating.find.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">find</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.non_mutating.find.requirements"></a><h6>
-<a name="id718392"></a>
- <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find.h3"></a>
+ <span><a name="range.reference.algorithms.non_mutating.find.requirements"></a></span><a class="link" href="find.html#range.reference.algorithms.non_mutating.find.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -86,9 +85,9 @@
value type.
</li>
</ul></div>
-<a name="range.reference.algorithms.non_mutating.find.complexity"></a><h6>
-<a name="id718511"></a>
- <a class="link" href="find.html#range.reference.algorithms.non_mutating.find.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find.h4"></a>
+ <span><a name="range.reference.algorithms.non_mutating.find.complexity"></a></span><a class="link" href="find.html#range.reference.algorithms.non_mutating.find.complexity">Complexity</a>
</h6>
<p>
Linear. At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> comparisons for equality.
@@ -96,7 +95,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find_end.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find_end.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find_end.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="find.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="find_first_of.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_find_end">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.non_mutating.find_end"></a><a class="link" href="find_end.html" title="find_end">find_end</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.find_end.prototype"></a><h6>
-<a name="id718575"></a>
- <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_end.h0"></a>
+ <span><a name="range.reference.algorithms.non_mutating.find_end.prototype"></a></span><a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">></span>
<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">ForwardRange1</span><span class="special">>::</span><span class="identifier">type</span>
@@ -64,9 +63,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.non_mutating.find_end.description"></a><h6>
-<a name="id719235"></a>
- <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_end.h1"></a>
+ <span><a name="range.reference.algorithms.non_mutating.find_end.description"></a></span><a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.description">Description</a>
</h6>
<p>
The versions of <code class="computeroutput"><span class="identifier">find_end</span></code>
@@ -79,16 +78,16 @@
defines <code class="computeroutput"><span class="identifier">found</span></code> in the
same manner as the returned iterator described above.
</p>
-<a name="range.reference.algorithms.non_mutating.find_end.definition"></a><h6>
-<a name="id719359"></a>
- <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_end.h2"></a>
+ <span><a name="range.reference.algorithms.non_mutating.find_end.definition"></a></span><a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">find_end</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.non_mutating.find_end.requirements"></a><h6>
-<a name="id719430"></a>
- <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_end.h3"></a>
+ <span><a name="range.reference.algorithms.non_mutating.find_end.requirements"></a></span><a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -146,9 +145,9 @@
second argument type.
</li>
</ul></div>
-<a name="range.reference.algorithms.non_mutating.find_end.complexity"></a><h6>
-<a name="id719742"></a>
- <a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_end.h4"></a>
+ <span><a name="range.reference.algorithms.non_mutating.find_end.complexity"></a></span><a class="link" href="find_end.html#range.reference.algorithms.non_mutating.find_end.complexity">Complexity</a>
</h6>
<p>
The number of comparisons is proportional to <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">*</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code>. If both <code class="computeroutput"><span class="identifier">ForwardRange1</span></code>
@@ -159,7 +158,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find_first_of.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find_first_of.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find_first_of.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="find_end.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="find_if.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_find_first_of">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.non_mutating.find_first_of"></a><a class="link" href="find_first_of.html" title="find_first_of">find_first_of</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.find_first_of.prototype"></a><h6>
-<a name="id719912"></a>
- <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_first_of.h0"></a>
+ <span><a name="range.reference.algorithms.non_mutating.find_first_of.prototype"></a></span><a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">></span>
<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">SinglePassRange1</span><span class="special">>::</span><span class="identifier">type</span>
@@ -64,9 +63,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.non_mutating.find_first_of.description"></a><h6>
-<a name="id720570"></a>
- <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_first_of.h1"></a>
+ <span><a name="range.reference.algorithms.non_mutating.find_first_of.description"></a></span><a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.description">Description</a>
</h6>
<p>
The versions of <code class="computeroutput"><span class="identifier">find_first_of</span></code>
@@ -84,16 +83,16 @@
defines <code class="computeroutput"><span class="identifier">found</span></code> in the
same manner as the returned iterator described above.
</p>
-<a name="range.reference.algorithms.non_mutating.find_first_of.definition"></a><h6>
-<a name="id720699"></a>
- <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_first_of.h2"></a>
+ <span><a name="range.reference.algorithms.non_mutating.find_first_of.definition"></a></span><a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">find_first_of</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.non_mutating.find_first_of.requirements"></a><h6>
-<a name="id720771"></a>
- <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_first_of.h3"></a>
+ <span><a name="range.reference.algorithms.non_mutating.find_first_of.requirements"></a></span><a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -145,9 +144,9 @@
second argument type.
</li>
</ul></div>
-<a name="range.reference.algorithms.non_mutating.find_first_of.complexity"></a><h6>
-<a name="id721037"></a>
- <a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_first_of.h4"></a>
+ <span><a name="range.reference.algorithms.non_mutating.find_first_of.complexity"></a></span><a class="link" href="find_first_of.html#range.reference.algorithms.non_mutating.find_first_of.complexity">Complexity</a>
</h6>
<p>
At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span> <span class="special">*</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span></code> comparisons.
@@ -155,7 +154,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find_if.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find_if.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/find_if.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="find_first_of.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lexicographical_compare.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_find_if">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.non_mutating.find_if"></a><a class="link" href="find_if.html" title="find_if">find_if</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.find_if.prototype"></a><h6>
-<a name="id721127"></a>
- <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_if.h0"></a>
+ <span><a name="range.reference.algorithms.non_mutating.find_if.prototype"></a></span><a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">UnaryPredicate</span><span class="special">></span>
<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">SinglePassRange</span><span class="special">>::</span><span class="identifier">type</span>
@@ -47,9 +46,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.non_mutating.find_if.description"></a><h6>
-<a name="id721417"></a>
- <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_if.h1"></a>
+ <span><a name="range.reference.algorithms.non_mutating.find_if.description"></a></span><a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.description">Description</a>
</h6>
<p>
The versions of <code class="computeroutput"><span class="identifier">find_if</span></code>
@@ -62,16 +61,16 @@
that return a <code class="computeroutput"><span class="identifier">range_return</span></code>,
defines found in the same manner as the returned iterator described above.
</p>
-<a name="range.reference.algorithms.non_mutating.find_if.definition"></a><h6>
-<a name="id721545"></a>
- <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_if.h2"></a>
+ <span><a name="range.reference.algorithms.non_mutating.find_if.definition"></a></span><a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">find_if</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.non_mutating.find_if.requirements"></a><h6>
-<a name="id721616"></a>
- <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_if.h3"></a>
+ <span><a name="range.reference.algorithms.non_mutating.find_if.requirements"></a></span><a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -88,17 +87,17 @@
is convertible to the argument type of <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>.
</li>
</ul></div>
-<a name="range.reference.algorithms.non_mutating.find_if.precondition_"></a><h6>
-<a name="id721721"></a>
- <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_if.h4"></a>
+ <span><a name="range.reference.algorithms.non_mutating.find_if.precondition_"></a></span><a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.precondition_">Precondition:</a>
</h6>
<p>
For each iterator <code class="computeroutput"><span class="identifier">i</span></code> in
<code class="computeroutput"><span class="identifier">rng</span></code>, <code class="computeroutput"><span class="special">*</span><span class="identifier">i</span></code> is in the domain of <code class="computeroutput"><span class="identifier">UnaryPredicate</span></code>.
</p>
-<a name="range.reference.algorithms.non_mutating.find_if.complexity"></a><h6>
-<a name="id721791"></a>
- <a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.find_if.h5"></a>
+ <span><a name="range.reference.algorithms.non_mutating.find_if.complexity"></a></span><a class="link" href="find_if.html#range.reference.algorithms.non_mutating.find_if.complexity">Complexity</a>
</h6>
<p>
Linear. At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> invocations of <code class="computeroutput"><span class="identifier">pred</span></code>.
@@ -106,7 +105,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/for_each.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/for_each.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/for_each.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="equal_range.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="find.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_for_each">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.non_mutating.for_each"></a><a class="link" href="for_each.html" title="for_each">for_each</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.for_each.prototype"></a><h6>
-<a name="id717348"></a>
- <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.for_each.h0"></a>
+ <span><a name="range.reference.algorithms.non_mutating.for_each.prototype"></a></span><a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span>
<span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
@@ -43,13 +42,13 @@
<span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
<span class="keyword">class</span> <span class="identifier">UnaryFunction</span>
<span class="special">></span>
-<span class="identifier">UnaryFunction</span> <span class="identifier">for_each</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryFunction</span> <span class="identifier">fun</span><span class="special">);</span>
+<span class="identifier">UnaryFunction</span> <span class="identifier">for_each</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">,</span> <span class="identifier">UnaryFunction</span> <span class="identifier">fun</span><span class="special">);</span>
</pre>
<p>
</p>
-<a name="range.reference.algorithms.non_mutating.for_each.description"></a><h6>
-<a name="id717573"></a>
- <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.for_each.h1"></a>
+ <span><a name="range.reference.algorithms.non_mutating.for_each.description"></a></span><a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">for_each</span></code> traverses forward
@@ -57,16 +56,16 @@
element <code class="computeroutput"><span class="identifier">x</span></code> it invokes
<code class="computeroutput"><span class="identifier">fun</span><span class="special">(</span><span class="identifier">x</span><span class="special">)</span></code>.
</p>
-<a name="range.reference.algorithms.non_mutating.for_each.definition"></a><h6>
-<a name="id717651"></a>
- <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.for_each.h2"></a>
+ <span><a name="range.reference.algorithms.non_mutating.for_each.definition"></a></span><a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">for_each</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.non_mutating.for_each.requirements"></a><h6>
-<a name="id717722"></a>
- <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.for_each.h3"></a>
+ <span><a name="range.reference.algorithms.non_mutating.for_each.requirements"></a></span><a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.requirements">Requirements</a>
</h6>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
@@ -88,9 +87,9 @@
argument type.
</li>
</ul></div>
-<a name="range.reference.algorithms.non_mutating.for_each.complexity"></a><h6>
-<a name="id717844"></a>
- <a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.for_each.h4"></a>
+ <span><a name="range.reference.algorithms.non_mutating.for_each.complexity"></a></span><a class="link" href="for_each.html#range.reference.algorithms.non_mutating.for_each.complexity">Complexity</a>
</h6>
<p>
Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code> applications of <code class="computeroutput"><span class="identifier">UnaryFunction</span></code>.
@@ -98,7 +97,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="find_if.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="lower_bound.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_lexicographical_compare">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.non_mutating.lexicographical_compare"></a><a class="link" href="lexicographical_compare.html" title="lexicographical_compare">lexicographical_compare</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.lexicographical_compare.prototype"></a><h6>
-<a name="id721867"></a>
- <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.lexicographical_compare.h0"></a>
+ <span><a name="range.reference.algorithms.non_mutating.lexicographical_compare.prototype"></a></span><a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span>
<span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
@@ -47,13 +46,13 @@
<span class="special">></span>
<span class="keyword">bool</span> <span class="identifier">lexicographical_compare</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&</span> <span class="identifier">rng1</span><span class="special">,</span>
<span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&</span> <span class="identifier">rng2</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+ <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
</pre>
<p>
</p>
-<a name="range.reference.algorithms.non_mutating.lexicographical_compare.description"></a><h6>
-<a name="id722150"></a>
- <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.lexicographical_compare.h1"></a>
+ <span><a name="range.reference.algorithms.non_mutating.lexicographical_compare.description"></a></span><a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">lexicographical_compare</span></code>
@@ -71,16 +70,16 @@
and using <code class="computeroutput"><span class="identifier">pred</span></code> in the
predicate versions.
</p>
-<a name="range.reference.algorithms.non_mutating.lexicographical_compare.definition"></a><h6>
-<a name="id722318"></a>
- <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.lexicographical_compare.h2"></a>
+ <span><a name="range.reference.algorithms.non_mutating.lexicographical_compare.definition"></a></span><a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">lexicographical_compare</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.non_mutating.lexicographical_compare.requirements"></a><h6>
-<a name="id722389"></a>
- <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.lexicographical_compare.h3"></a>
+ <span><a name="range.reference.algorithms.non_mutating.lexicographical_compare.requirements"></a></span><a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions of lexicographical_compare:</strong></span>
@@ -108,7 +107,7 @@
Let <code class="computeroutput"><span class="identifier">x</span></code> be an object
of <code class="computeroutput"><span class="identifier">SinglePassRange1</span></code>'s
value type. Let <code class="computeroutput"><span class="identifier">y</span></code>
- be an obect of <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
+ be an object of <code class="computeroutput"><span class="identifier">SinglePassRange2</span></code>'s
value type. <code class="computeroutput"><span class="identifier">x</span> <span class="special"><</span>
<span class="identifier">y</span></code> must be valid. <code class="computeroutput"><span class="identifier">y</span> <span class="special"><</span>
<span class="identifier">x</span></code> must be valid.
@@ -143,9 +142,9 @@
second argument type.
</li>
</ul></div>
-<a name="range.reference.algorithms.non_mutating.lexicographical_compare.complexity"></a><h6>
-<a name="id722764"></a>
- <a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.lexicographical_compare.h4"></a>
+ <span><a name="range.reference.algorithms.non_mutating.lexicographical_compare.complexity"></a></span><a class="link" href="lexicographical_compare.html#range.reference.algorithms.non_mutating.lexicographical_compare.complexity">Complexity</a>
</h6>
<p>
Linear. At most <code class="computeroutput"><span class="number">2</span> <span class="special">*</span>
@@ -155,7 +154,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/lower_bound.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/lower_bound.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/lower_bound.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="lexicographical_compare.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="max_element.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_lower_bound">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.non_mutating.lower_bound"></a><a class="link" href="lower_bound.html" title="lower_bound">lower_bound</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.lower_bound.prototype"></a><h6>
-<a name="id722868"></a>
- <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.lower_bound.h0"></a>
+ <span><a name="range.reference.algorithms.non_mutating.lower_bound.prototype"></a></span><a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">></span>
<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span>
@@ -47,9 +46,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.non_mutating.lower_bound.description"></a><h6>
-<a name="id723158"></a>
- <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.lower_bound.h1"></a>
+ <span><a name="range.reference.algorithms.non_mutating.lower_bound.description"></a></span><a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.description">Description</a>
</h6>
<p>
The versions of <code class="computeroutput"><span class="identifier">lower_bound</span></code>
@@ -70,16 +69,16 @@
defines <code class="computeroutput"><span class="identifier">found</span></code> in the
same manner as the returned iterator described above.
</p>
-<a name="range.reference.algorithms.non_mutating.lower_bound.definition"></a><h6>
-<a name="id723347"></a>
- <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.lower_bound.h2"></a>
+ <span><a name="range.reference.algorithms.non_mutating.lower_bound.definition"></a></span><a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">lower_bound</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.non_mutating.lower_bound.requirements"></a><h6>
-<a name="id723418"></a>
- <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.lower_bound.h3"></a>
+ <span><a name="range.reference.algorithms.non_mutating.lower_bound.requirements"></a></span><a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -128,9 +127,9 @@
argument types.
</li>
</ul></div>
-<a name="range.reference.algorithms.non_mutating.lower_bound.precondition_"></a><h6>
-<a name="id723687"></a>
- <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.lower_bound.h4"></a>
+ <span><a name="range.reference.algorithms.non_mutating.lower_bound.precondition_"></a></span><a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.precondition_">Precondition:</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -146,9 +145,9 @@
<code class="computeroutput"><span class="identifier">rng</span></code> is sorted in ascending
order according to <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
-<a name="range.reference.algorithms.non_mutating.lower_bound.complexity"></a><h6>
-<a name="id723780"></a>
- <a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.lower_bound.h5"></a>
+ <span><a name="range.reference.algorithms.non_mutating.lower_bound.complexity"></a></span><a class="link" href="lower_bound.html#range.reference.algorithms.non_mutating.lower_bound.complexity">Complexity</a>
</h6>
<p>
For ranges that model the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
@@ -161,7 +160,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/max_element.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/max_element.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/max_element.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="lower_bound.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="min_element.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_max_element">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.non_mutating.max_element"></a><a class="link" href="max_element.html" title="max_element">max_element</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.max_element.prototype"></a><h6>
-<a name="id723919"></a>
- <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.max_element.h0"></a>
+ <span><a name="range.reference.algorithms.non_mutating.max_element.prototype"></a></span><a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">></span>
<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span>
@@ -82,9 +81,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.non_mutating.max_element.description"></a><h6>
-<a name="id724905"></a>
- <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.max_element.h1"></a>
+ <span><a name="range.reference.algorithms.non_mutating.max_element.description"></a></span><a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.description">Description</a>
</h6>
<p>
The versions of <code class="computeroutput"><span class="identifier">max_element</span></code>
@@ -96,16 +95,16 @@
defines <code class="computeroutput"><span class="identifier">found</span></code> in the
same manner as the returned iterator described above.
</p>
-<a name="range.reference.algorithms.non_mutating.max_element.definition"></a><h6>
-<a name="id725000"></a>
- <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.max_element.h2"></a>
+ <span><a name="range.reference.algorithms.non_mutating.max_element.definition"></a></span><a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">max_element</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.non_mutating.max_element.requirements"></a><h6>
-<a name="id725071"></a>
- <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.max_element.h3"></a>
+ <span><a name="range.reference.algorithms.non_mutating.max_element.requirements"></a></span><a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -140,9 +139,9 @@
argument types.
</li>
</ul></div>
-<a name="range.reference.algorithms.non_mutating.max_element.complexity"></a><h6>
-<a name="id725249"></a>
- <a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.max_element.h4"></a>
+ <span><a name="range.reference.algorithms.non_mutating.max_element.complexity"></a></span><a class="link" href="max_element.html#range.reference.algorithms.non_mutating.max_element.complexity">Complexity</a>
</h6>
<p>
Linear. Zero comparisons if <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>, otherwise <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">-</span> <span class="number">1</span></code>
@@ -151,7 +150,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/min_element.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/min_element.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/min_element.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="max_element.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="mismatch.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_min_element">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.non_mutating.min_element"></a><a class="link" href="min_element.html" title="min_element">min_element</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.min_element.prototype"></a><h6>
-<a name="id725348"></a>
- <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.min_element.h0"></a>
+ <span><a name="range.reference.algorithms.non_mutating.min_element.prototype"></a></span><a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">></span>
<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span>
@@ -82,9 +81,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.non_mutating.min_element.description"></a><h6>
-<a name="id726335"></a>
- <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.min_element.h1"></a>
+ <span><a name="range.reference.algorithms.non_mutating.min_element.description"></a></span><a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.description">Description</a>
</h6>
<p>
The versions of <code class="computeroutput"><span class="identifier">min_element</span></code>
@@ -96,16 +95,16 @@
defines <code class="computeroutput"><span class="identifier">found</span></code> in the
same manner as the returned iterator described above.
</p>
-<a name="range.reference.algorithms.non_mutating.min_element.definition"></a><h6>
-<a name="id726429"></a>
- <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.min_element.h2"></a>
+ <span><a name="range.reference.algorithms.non_mutating.min_element.definition"></a></span><a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">min_element</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.non_mutating.min_element.requirements"></a><h6>
-<a name="id726500"></a>
- <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.min_element.h3"></a>
+ <span><a name="range.reference.algorithms.non_mutating.min_element.requirements"></a></span><a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -140,9 +139,9 @@
argument types.
</li>
</ul></div>
-<a name="range.reference.algorithms.non_mutating.min_element.complexity"></a><h6>
-<a name="id726678"></a>
- <a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.min_element.h4"></a>
+ <span><a name="range.reference.algorithms.non_mutating.min_element.complexity"></a></span><a class="link" href="min_element.html#range.reference.algorithms.non_mutating.min_element.complexity">Complexity</a>
</h6>
<p>
Linear. Zero comparisons if <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>, otherwise <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">-</span> <span class="number">1</span></code>
@@ -151,7 +150,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/mismatch.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/mismatch.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/mismatch.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="min_element.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="search.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_mismatch">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.non_mutating.mismatch"></a><a class="link" href="mismatch.html" title="mismatch">mismatch</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.mismatch.prototype"></a><h6>
-<a name="id726777"></a>
- <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.mismatch.h0"></a>
+ <span><a name="range.reference.algorithms.non_mutating.mismatch.prototype"></a></span><a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">></span>
<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span>
@@ -104,28 +103,28 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.non_mutating.mismatch.description"></a><h6>
-<a name="id728481"></a>
- <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.mismatch.h1"></a>
+ <span><a name="range.reference.algorithms.non_mutating.mismatch.description"></a></span><a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">mismatch</span></code> finds the first
- position where the correseponding elements from the two ranges <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code>
+ position where the corresponding elements from the two ranges <code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code>
are not equal.
</p>
<p>
Equality is determined by <code class="computeroutput"><span class="keyword">operator</span><span class="special">==</span></code> for non-predicate versions of <code class="computeroutput"><span class="identifier">mismatch</span></code>, and by satisfying <code class="computeroutput"><span class="identifier">pred</span></code> in the predicate versions.
</p>
-<a name="range.reference.algorithms.non_mutating.mismatch.definition"></a><h6>
-<a name="id728578"></a>
- <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.mismatch.h2"></a>
+ <span><a name="range.reference.algorithms.non_mutating.mismatch.definition"></a></span><a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">mismatch</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.non_mutating.mismatch.requirements"></a><h6>
-<a name="id728648"></a>
- <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.mismatch.h3"></a>
+ <span><a name="range.reference.algorithms.non_mutating.mismatch.requirements"></a></span><a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -184,16 +183,16 @@
second argument type.
</li>
</ul></div>
-<a name="range.reference.algorithms.non_mutating.mismatch.precondition_"></a><h6>
-<a name="id728960"></a>
- <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.mismatch.h4"></a>
+ <span><a name="range.reference.algorithms.non_mutating.mismatch.precondition_"></a></span><a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.precondition_">Precondition:</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span> <span class="special">>=</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code>
</p>
-<a name="range.reference.algorithms.non_mutating.mismatch.complexity"></a><h6>
-<a name="id729032"></a>
- <a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.mismatch.h5"></a>
+ <span><a name="range.reference.algorithms.non_mutating.mismatch.complexity"></a></span><a class="link" href="mismatch.html#range.reference.algorithms.non_mutating.mismatch.complexity">Complexity</a>
</h6>
<p>
Linear. At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code> comparisons.
@@ -201,7 +200,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/search.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/search.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/search.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="mismatch.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="search_n.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_search">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.non_mutating.search"></a><a class="link" href="search.html" title="search">search</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.search.prototype"></a><h6>
-<a name="id729096"></a>
- <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.search.h0"></a>
+ <span><a name="range.reference.algorithms.non_mutating.search.prototype"></a></span><a class="link" href="search.html#range.reference.algorithms.non_mutating.search.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span><span class="special">></span>
<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">ForwardRange1</span><span class="special">>::</span><span class="identifier">type</span>
@@ -94,9 +93,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.non_mutating.search.description"></a><h6>
-<a name="id730434"></a>
- <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.search.h1"></a>
+ <span><a name="range.reference.algorithms.non_mutating.search.description"></a></span><a class="link" href="search.html#range.reference.algorithms.non_mutating.search.description">Description</a>
</h6>
<p>
The versions of <code class="computeroutput"><span class="identifier">search</span></code>
@@ -113,16 +112,16 @@
defines <code class="computeroutput"><span class="identifier">found</span></code> in the
same manner as the returned iterator described above.
</p>
-<a name="range.reference.algorithms.non_mutating.search.definition"></a><h6>
-<a name="id730597"></a>
- <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.search.h2"></a>
+ <span><a name="range.reference.algorithms.non_mutating.search.definition"></a></span><a class="link" href="search.html#range.reference.algorithms.non_mutating.search.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">search</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.non_mutating.search.requirements"></a><h6>
-<a name="id730668"></a>
- <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.search.h3"></a>
+ <span><a name="range.reference.algorithms.non_mutating.search.requirements"></a></span><a class="link" href="search.html#range.reference.algorithms.non_mutating.search.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -181,9 +180,9 @@
second argument type.
</li>
</ul></div>
-<a name="range.reference.algorithms.non_mutating.search.complexity"></a><h6>
-<a name="id730979"></a>
- <a class="link" href="search.html#range.reference.algorithms.non_mutating.search.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.search.h4"></a>
+ <span><a name="range.reference.algorithms.non_mutating.search.complexity"></a></span><a class="link" href="search.html#range.reference.algorithms.non_mutating.search.complexity">Complexity</a>
</h6>
<p>
Average complexity is Linear. Worst-case complexity is quadratic.
@@ -191,7 +190,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/search_n.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/search_n.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/search_n.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="search.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upper_bound.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_search_n">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.non_mutating.search_n"></a><a class="link" href="search_n.html" title="search_n">search_n</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.search_n.prototype"></a><h6>
-<a name="id731020"></a>
- <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.search_n.h0"></a>
+ <span><a name="range.reference.algorithms.non_mutating.search_n.prototype"></a></span><a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Integer</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">></span>
<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span>
@@ -53,25 +52,25 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.non_mutating.search_n.description"></a><h6>
-<a name="id731769"></a>
- <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.search_n.h1"></a>
+ <span><a name="range.reference.algorithms.non_mutating.search_n.description"></a></span><a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">search_n</span></code> searches <code class="computeroutput"><span class="identifier">rng</span></code> for a sequence of length <code class="computeroutput"><span class="identifier">n</span></code> equal to <code class="computeroutput"><span class="identifier">value</span></code>
where equality is determined by operator== in the non-predicate case,
and by a predicate when one is supplied.
</p>
-<a name="range.reference.algorithms.non_mutating.search_n.definition"></a><h6>
-<a name="id731836"></a>
- <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.search_n.h2"></a>
+ <span><a name="range.reference.algorithms.non_mutating.search_n.definition"></a></span><a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">search_n</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.non_mutating.search_n.requirements"></a><h6>
-<a name="id731906"></a>
- <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.search_n.h3"></a>
+ <span><a name="range.reference.algorithms.non_mutating.search_n.requirements"></a></span><a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -123,9 +122,9 @@
of the <code class="computeroutput"><span class="identifier">IntegerConcept</span></code>.
</li>
</ul></div>
-<a name="range.reference.algorithms.non_mutating.search_n.complexity"></a><h6>
-<a name="id732195"></a>
- <a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.search_n.h4"></a>
+ <span><a name="range.reference.algorithms.non_mutating.search_n.complexity"></a></span><a class="link" href="search_n.html#range.reference.algorithms.non_mutating.search_n.complexity">Complexity</a>
</h6>
<p>
Average complexity is Linear. Worst-case complexity is quadratic.
@@ -133,7 +132,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/upper_bound.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/upper_bound.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/non_mutating/upper_bound.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="search_n.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../non_mutating.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../set.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_non_mutating_upper_bound">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.non_mutating.upper_bound"></a><a class="link" href="upper_bound.html" title="upper_bound">upper_bound</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.non_mutating.upper_bound.prototype"></a><h6>
-<a name="id732236"></a>
- <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.upper_bound.h0"></a>
+ <span><a name="range.reference.algorithms.non_mutating.upper_bound.prototype"></a></span><a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">ForwardRange</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Value</span><span class="special">></span>
<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span>
@@ -47,9 +46,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.non_mutating.upper_bound.description"></a><h6>
-<a name="id732525"></a>
- <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.upper_bound.h1"></a>
+ <span><a name="range.reference.algorithms.non_mutating.upper_bound.description"></a></span><a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.description">Description</a>
</h6>
<p>
The versions of <code class="computeroutput"><span class="identifier">upper_bound</span></code>
@@ -69,16 +68,16 @@
defines <code class="computeroutput"><span class="identifier">found</span></code> in the
same manner as the returned iterator described above.
</p>
-<a name="range.reference.algorithms.non_mutating.upper_bound.definition"></a><h6>
-<a name="id732719"></a>
- <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.upper_bound.h2"></a>
+ <span><a name="range.reference.algorithms.non_mutating.upper_bound.definition"></a></span><a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">upper_bound</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.non_mutating.upper_bound.requirements"></a><h6>
-<a name="id732790"></a>
- <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.upper_bound.h3"></a>
+ <span><a name="range.reference.algorithms.non_mutating.upper_bound.requirements"></a></span><a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -127,9 +126,9 @@
argument types.
</li>
</ul></div>
-<a name="range.reference.algorithms.non_mutating.upper_bound.precondition_"></a><h6>
-<a name="id733059"></a>
- <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.upper_bound.h4"></a>
+ <span><a name="range.reference.algorithms.non_mutating.upper_bound.precondition_"></a></span><a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.precondition_">Precondition:</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -145,9 +144,9 @@
<code class="computeroutput"><span class="identifier">rng</span></code> is sorted in ascending
order according to <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
-<a name="range.reference.algorithms.non_mutating.upper_bound.complexity"></a><h6>
-<a name="id733150"></a>
- <a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.non_mutating.upper_bound.h5"></a>
+ <span><a name="range.reference.algorithms.non_mutating.upper_bound.complexity"></a></span><a class="link" href="upper_bound.html#range.reference.algorithms.non_mutating.upper_bound.complexity">Complexity</a>
</h6>
<p>
For ranges that model the <a class="link" href="../../../concepts/random_access_range.html" title="Random Access Range">Random
@@ -158,7 +157,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/numeric.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/numeric.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/numeric.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="new/remove_erase_if.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="numeric/accumulate.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_numeric">
<div class="titlepage"><div><div><h4 class="title">
<a name="range.reference.algorithms.numeric"></a><a class="link" href="numeric.html" title="Numeric algorithms">Numeric algorithms</a>
</h4></div></div></div>
@@ -35,7 +35,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/numeric/accumulate.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/numeric/accumulate.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/numeric/accumulate.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="../numeric.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="adjacent_difference.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_numeric_accumulate">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.numeric.accumulate"></a><a class="link" href="accumulate.html" title="accumulate">accumulate</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.numeric.accumulate.prototype"></a><h6>
-<a name="id750741"></a>
- <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.numeric.accumulate.h0"></a>
+ <span><a name="range.reference.algorithms.numeric.accumulate.prototype"></a></span><a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span>
<span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
@@ -51,9 +50,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.numeric.accumulate.description"></a><h6>
-<a name="id751002"></a>
- <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.numeric.accumulate.h1"></a>
+ <span><a name="range.reference.algorithms.numeric.accumulate.description"></a></span><a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">accumulate</span></code> is a generalisation
@@ -62,20 +61,20 @@
<p>
The return value is the resultant value of the above algorithm.
</p>
-<a name="range.reference.algorithms.numeric.accumulate.definition"></a><h6>
-<a name="id751077"></a>
- <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.numeric.accumulate.h2"></a>
+ <span><a name="range.reference.algorithms.numeric.accumulate.definition"></a></span><a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">numeric</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.numeric.accumulate.requirements"></a><h6>
-<a name="id751139"></a>
- <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.requirements">Requirements</a>
- </h6>
-<a name="range.reference.algorithms.numeric.accumulate.for_the_first_version"></a><h6>
-<a name="id751160"></a>
- <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.for_the_first_version">For
+<h6>
+<a name="range.reference.algorithms.numeric.accumulate.h3"></a>
+ <span><a name="range.reference.algorithms.numeric.accumulate.requirements"></a></span><a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.requirements">Requirements</a>
+ </h6>
+<h6>
+<a name="range.reference.algorithms.numeric.accumulate.h4"></a>
+ <span><a name="range.reference.algorithms.numeric.accumulate.for_the_first_version"></a></span><a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.for_the_first_version">For
the first version</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
@@ -91,16 +90,16 @@
<li class="listitem">
An <code class="computeroutput"><span class="keyword">operator</span><span class="special">+</span></code>
is defined for a left-hand operand of type <code class="computeroutput"><span class="identifier">Value</span></code>
- and a right-hand operance of the <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
+ and a right-hand operand of the <code class="computeroutput"><span class="identifier">SinglePassRange</span></code>
value type.
</li>
<li class="listitem">
The return type of the above operator is convertible to <code class="computeroutput"><span class="identifier">Value</span></code>.
</li>
</ol></div>
-<a name="range.reference.algorithms.numeric.accumulate.for_the_second_version"></a><h6>
-<a name="id751302"></a>
- <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.for_the_second_version">For
+<h6>
+<a name="range.reference.algorithms.numeric.accumulate.h5"></a>
+ <span><a name="range.reference.algorithms.numeric.accumulate.for_the_second_version"></a></span><a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.for_the_second_version">For
the second version</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
@@ -132,9 +131,9 @@
is convertible to <code class="computeroutput"><span class="identifier">Value</span></code>.
</li>
</ol></div>
-<a name="range.reference.algorithms.numeric.accumulate.complexity"></a><h6>
-<a name="id751495"></a>
- <a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.numeric.accumulate.h6"></a>
+ <span><a name="range.reference.algorithms.numeric.accumulate.complexity"></a></span><a class="link" href="accumulate.html#range.reference.algorithms.numeric.accumulate.complexity">Complexity</a>
</h6>
<p>
Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">source_rng</span><span class="special">)</span></code>.
@@ -142,7 +141,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/numeric/adjacent_difference.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/numeric/adjacent_difference.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/numeric/adjacent_difference.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="accumulate.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="inner_product.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_numeric_adjacent_difference">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.numeric.adjacent_difference"></a><a class="link" href="adjacent_difference.html" title="adjacent_difference">adjacent_difference</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.numeric.adjacent_difference.prototype"></a><h6>
-<a name="id751560"></a>
- <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.numeric.adjacent_difference.h0"></a>
+ <span><a name="range.reference.algorithms.numeric.adjacent_difference.prototype"></a></span><a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span>
<span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
@@ -53,9 +52,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.numeric.adjacent_difference.description"></a><h6>
-<a name="id751824"></a>
- <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.numeric.adjacent_difference.h1"></a>
+ <span><a name="range.reference.algorithms.numeric.adjacent_difference.description"></a></span><a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">adjacent_difference</span></code> calculates
@@ -67,20 +66,20 @@
to calculate the differences. The second version uses <code class="computeroutput"><span class="identifier">BinaryOperation</span></code>
instead of <code class="computeroutput"><span class="keyword">operator</span><span class="special">-()</span></code>.
</p>
-<a name="range.reference.algorithms.numeric.adjacent_difference.definition"></a><h6>
-<a name="id751925"></a>
- <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.numeric.adjacent_difference.h2"></a>
+ <span><a name="range.reference.algorithms.numeric.adjacent_difference.definition"></a></span><a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">numeric</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.numeric.adjacent_difference.requirements"></a><h6>
-<a name="id751986"></a>
- <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.requirements">Requirements</a>
- </h6>
-<a name="range.reference.algorithms.numeric.adjacent_difference.for_the_first_version"></a><h6>
-<a name="id752008"></a>
- <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.for_the_first_version">For
+<h6>
+<a name="range.reference.algorithms.numeric.adjacent_difference.h3"></a>
+ <span><a name="range.reference.algorithms.numeric.adjacent_difference.requirements"></a></span><a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.requirements">Requirements</a>
+ </h6>
+<h6>
+<a name="range.reference.algorithms.numeric.adjacent_difference.h4"></a>
+ <span><a name="range.reference.algorithms.numeric.adjacent_difference.for_the_first_version"></a></span><a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.for_the_first_version">For
the first version</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
@@ -109,9 +108,9 @@
set of value types.
</li>
</ol></div>
-<a name="range.reference.algorithms.numeric.adjacent_difference.for_the_second_version"></a><h6>
-<a name="id752216"></a>
- <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.for_the_second_version">For
+<h6>
+<a name="range.reference.algorithms.numeric.adjacent_difference.h5"></a>
+ <span><a name="range.reference.algorithms.numeric.adjacent_difference.for_the_second_version"></a></span><a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.for_the_second_version">For
the second version</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
@@ -144,17 +143,17 @@
set of value types.
</li>
</ol></div>
-<a name="range.reference.algorithms.numeric.adjacent_difference.precondition_"></a><h6>
-<a name="id752409"></a>
- <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.numeric.adjacent_difference.h6"></a>
+ <span><a name="range.reference.algorithms.numeric.adjacent_difference.precondition_"></a></span><a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.precondition_">Precondition:</a>
</h6>
<p>
<code class="computeroutput"><span class="special">[</span><span class="identifier">result</span><span class="special">,</span> <span class="identifier">result</span>
<span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is a valid range.
</p>
-<a name="range.reference.algorithms.numeric.adjacent_difference.complexity"></a><h6>
-<a name="id752483"></a>
- <a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.numeric.adjacent_difference.h7"></a>
+ <span><a name="range.reference.algorithms.numeric.adjacent_difference.complexity"></a></span><a class="link" href="adjacent_difference.html#range.reference.algorithms.numeric.adjacent_difference.complexity">Complexity</a>
</h6>
<p>
Linear. If <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
@@ -164,7 +163,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/numeric/inner_product.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/numeric/inner_product.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/numeric/inner_product.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="adjacent_difference.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="partial_sum.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_numeric_inner_product">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.numeric.inner_product"></a><a class="link" href="inner_product.html" title="inner_product">inner_product</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.numeric.inner_product.prototype"></a><h6>
-<a name="id752584"></a>
- <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.numeric.inner_product.h0"></a>
+ <span><a name="range.reference.algorithms.numeric.inner_product.prototype"></a></span><a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
<span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">,</span>
@@ -52,9 +51,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.numeric.inner_product.description"></a><h6>
-<a name="id752946"></a>
- <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.numeric.inner_product.h1"></a>
+ <span><a name="range.reference.algorithms.numeric.inner_product.description"></a></span><a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">inner_product</span></code> calculates
@@ -65,20 +64,20 @@
For further information on the <code class="computeroutput"><span class="identifier">inner_product</span></code>
algorithm please see inner_product.
</p>
-<a name="range.reference.algorithms.numeric.inner_product.definition"></a><h6>
-<a name="id753022"></a>
- <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.numeric.inner_product.h2"></a>
+ <span><a name="range.reference.algorithms.numeric.inner_product.definition"></a></span><a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">numeric</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.numeric.inner_product.requirements"></a><h6>
-<a name="id753084"></a>
- <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.requirements">Requirements</a>
- </h6>
-<a name="range.reference.algorithms.numeric.inner_product.for_the_first_version"></a><h6>
-<a name="id753104"></a>
- <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.for_the_first_version">For
+<h6>
+<a name="range.reference.algorithms.numeric.inner_product.h3"></a>
+ <span><a name="range.reference.algorithms.numeric.inner_product.requirements"></a></span><a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.requirements">Requirements</a>
+ </h6>
+<h6>
+<a name="range.reference.algorithms.numeric.inner_product.h4"></a>
+ <span><a name="range.reference.algorithms.numeric.inner_product.for_the_first_version"></a></span><a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.for_the_first_version">For
the first version</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
@@ -111,9 +110,9 @@
is convertible to <code class="computeroutput"><span class="identifier">Value</span></code>.
</li>
</ol></div>
-<a name="range.reference.algorithms.numeric.inner_product.for_the_second_version"></a><h6>
-<a name="id753362"></a>
- <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.for_the_second_version">For
+<h6>
+<a name="range.reference.algorithms.numeric.inner_product.h5"></a>
+ <span><a name="range.reference.algorithms.numeric.inner_product.for_the_second_version"></a></span><a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.for_the_second_version">For
the second version</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
@@ -160,16 +159,16 @@
is convertible to <code class="computeroutput"><span class="identifier">Value</span></code>.
</li>
</ol></div>
-<a name="range.reference.algorithms.numeric.inner_product.precondition_"></a><h6>
-<a name="id753663"></a>
- <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.numeric.inner_product.h6"></a>
+ <span><a name="range.reference.algorithms.numeric.inner_product.precondition_"></a></span><a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.precondition_">Precondition:</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng2</span><span class="special">)</span> <span class="special">>=</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng1</span><span class="special">)</span></code> is a valid range.
</p>
-<a name="range.reference.algorithms.numeric.inner_product.complexity"></a><h6>
-<a name="id753736"></a>
- <a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.numeric.inner_product.h7"></a>
+ <span><a name="range.reference.algorithms.numeric.inner_product.complexity"></a></span><a class="link" href="inner_product.html#range.reference.algorithms.numeric.inner_product.complexity">Complexity</a>
</h6>
<p>
Linear. Exactly <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>.
@@ -177,7 +176,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/numeric/partial_sum.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/numeric/partial_sum.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/numeric/partial_sum.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="inner_product.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../numeric.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../ranges.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_numeric_partial_sum">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.numeric.partial_sum"></a><a class="link" href="partial_sum.html" title="partial_sum">partial_sum</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.numeric.partial_sum.prototype"></a><h6>
-<a name="id753801"></a>
- <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.numeric.partial_sum.h0"></a>
+ <span><a name="range.reference.algorithms.numeric.partial_sum.prototype"></a></span><a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">SinglePassRange</span><span class="special">,</span>
<span class="keyword">class</span> <span class="identifier">OutputIterator</span><span class="special">></span>
@@ -47,29 +46,29 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.numeric.partial_sum.description"></a><h6>
-<a name="id754058"></a>
- <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.numeric.partial_sum.h1"></a>
+ <span><a name="range.reference.algorithms.numeric.partial_sum.description"></a></span><a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">partial_sum</span></code> calculates
a generalised partial sum of <code class="computeroutput"><span class="identifier">rng</span></code>
in the same manner as <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">partial_sum</span><span class="special">(</span><span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span><span class="identifier">rng</span><span class="special">),</span> <span class="identifier">out_it</span><span class="special">)</span></code>. See partial_sum.
</p>
-<a name="range.reference.algorithms.numeric.partial_sum.definition"></a><h6>
-<a name="id754198"></a>
- <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.numeric.partial_sum.h2"></a>
+ <span><a name="range.reference.algorithms.numeric.partial_sum.definition"></a></span><a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">numeric</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.numeric.partial_sum.requirements"></a><h6>
-<a name="id754259"></a>
- <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.requirements">Requirements</a>
- </h6>
-<a name="range.reference.algorithms.numeric.partial_sum.for_the_first_version"></a><h6>
-<a name="id754280"></a>
- <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.for_the_first_version">For
+<h6>
+<a name="range.reference.algorithms.numeric.partial_sum.h3"></a>
+ <span><a name="range.reference.algorithms.numeric.partial_sum.requirements"></a></span><a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.requirements">Requirements</a>
+ </h6>
+<h6>
+<a name="range.reference.algorithms.numeric.partial_sum.h4"></a>
+ <span><a name="range.reference.algorithms.numeric.partial_sum.for_the_first_version"></a></span><a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.for_the_first_version">For
the first version</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
@@ -97,9 +96,9 @@
set of value types.
</li>
</ol></div>
-<a name="range.reference.algorithms.numeric.partial_sum.for_the_second_version"></a><h6>
-<a name="id754487"></a>
- <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.for_the_second_version">For
+<h6>
+<a name="range.reference.algorithms.numeric.partial_sum.h5"></a>
+ <span><a name="range.reference.algorithms.numeric.partial_sum.for_the_second_version"></a></span><a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.for_the_second_version">For
the second version</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
@@ -126,17 +125,17 @@
set of value types.
</li>
</ol></div>
-<a name="range.reference.algorithms.numeric.partial_sum.precondition_"></a><h6>
-<a name="id754652"></a>
- <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.numeric.partial_sum.h6"></a>
+ <span><a name="range.reference.algorithms.numeric.partial_sum.precondition_"></a></span><a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.precondition_">Precondition:</a>
</h6>
<p>
<code class="computeroutput"><span class="special">[</span><span class="identifier">result</span><span class="special">,</span> <span class="identifier">result</span>
<span class="special">+</span> <span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">))</span></code> is a valid range.
</p>
-<a name="range.reference.algorithms.numeric.partial_sum.complexity"></a><h6>
-<a name="id754726"></a>
- <a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.numeric.partial_sum.h7"></a>
+ <span><a name="range.reference.algorithms.numeric.partial_sum.complexity"></a></span><a class="link" href="partial_sum.html#range.reference.algorithms.numeric.partial_sum.complexity">Complexity</a>
</h6>
<p>
Linear. If <code class="computeroutput"><span class="identifier">empty</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span></code>
@@ -146,7 +145,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/permutation.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/permutation.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/permutation.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="heap/sort_heap.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="permutation/next_permutation.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_permutation">
<div class="titlepage"><div><div><h4 class="title">
<a name="range.reference.algorithms.permutation"></a><a class="link" href="permutation.html" title="Permutation algorithms">Permutation
algorithms</a>
@@ -34,7 +34,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/permutation/next_permutation.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/permutation/next_permutation.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/permutation/next_permutation.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="../permutation.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../permutation.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="prev_permutation.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_permutation_next_permutation">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.permutation.next_permutation"></a><a class="link" href="next_permutation.html" title="next_permutation">next_permutation</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.permutation.next_permutation.prototype"></a><h6>
-<a name="id743032"></a>
- <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.permutation.next_permutation.h0"></a>
+ <span><a name="range.reference.algorithms.permutation.next_permutation.prototype"></a></span><a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">></span>
<span class="keyword">bool</span> <span class="identifier">next_permutation</span><span class="special">(</span><span class="identifier">BidirectionalRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
@@ -47,9 +46,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.permutation.next_permutation.description"></a><h6>
-<a name="id743378"></a>
- <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.permutation.next_permutation.h1"></a>
+ <span><a name="range.reference.algorithms.permutation.next_permutation.description"></a></span><a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">next_permutation</span></code> transforms
@@ -65,16 +64,16 @@
by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
the predicate versions.
</p>
-<a name="range.reference.algorithms.permutation.next_permutation.definition"></a><h6>
-<a name="id743477"></a>
- <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.permutation.next_permutation.h2"></a>
+ <span><a name="range.reference.algorithms.permutation.next_permutation.definition"></a></span><a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">permutation</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.permutation.next_permutation.requirements"></a><h6>
-<a name="id743548"></a>
- <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.permutation.next_permutation.h3"></a>
+ <span><a name="range.reference.algorithms.permutation.next_permutation.requirements"></a></span><a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -123,9 +122,9 @@
argument types.
</li>
</ul></div>
-<a name="range.reference.algorithms.permutation.next_permutation.complexity"></a><h6>
-<a name="id743796"></a>
- <a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.permutation.next_permutation.h4"></a>
+ <span><a name="range.reference.algorithms.permutation.next_permutation.complexity"></a></span><a class="link" href="next_permutation.html#range.reference.algorithms.permutation.next_permutation.complexity">Complexity</a>
</h6>
<p>
Linear. At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">/</span> <span class="number">2</span></code>
@@ -134,7 +133,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/permutation/prev_permutation.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/permutation/prev_permutation.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/permutation/prev_permutation.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="next_permutation.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../permutation.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../new.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_permutation_prev_permutation">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.permutation.prev_permutation"></a><a class="link" href="prev_permutation.html" title="prev_permutation">prev_permutation</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.permutation.prev_permutation.prototype"></a><h6>
-<a name="id743872"></a>
- <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.permutation.prev_permutation.h0"></a>
+ <span><a name="range.reference.algorithms.permutation.prev_permutation.prototype"></a></span><a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">BidirectionalRange</span><span class="special">></span>
<span class="keyword">bool</span> <span class="identifier">prev_permutation</span><span class="special">(</span><span class="identifier">BidirectionalRange</span><span class="special">&</span> <span class="identifier">rng</span><span class="special">);</span>
@@ -47,9 +46,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.permutation.prev_permutation.description"></a><h6>
-<a name="id744218"></a>
- <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.permutation.prev_permutation.h1"></a>
+ <span><a name="range.reference.algorithms.permutation.prev_permutation.description"></a></span><a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">prev_permutation</span></code> transforms
@@ -65,16 +64,16 @@
by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
the predicate versions.
</p>
-<a name="range.reference.algorithms.permutation.prev_permutation.definition"></a><h6>
-<a name="id744318"></a>
- <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.permutation.prev_permutation.h2"></a>
+ <span><a name="range.reference.algorithms.permutation.prev_permutation.definition"></a></span><a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">permutation</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.permutation.prev_permutation.requirements"></a><h6>
-<a name="id744389"></a>
- <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.permutation.prev_permutation.h3"></a>
+ <span><a name="range.reference.algorithms.permutation.prev_permutation.requirements"></a></span><a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -123,9 +122,9 @@
argument types.
</li>
</ul></div>
-<a name="range.reference.algorithms.permutation.prev_permutation.complexity"></a><h6>
-<a name="id744638"></a>
- <a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.permutation.prev_permutation.h4"></a>
+ <span><a name="range.reference.algorithms.permutation.prev_permutation.complexity"></a></span><a class="link" href="prev_permutation.html#range.reference.algorithms.permutation.prev_permutation.complexity">Complexity</a>
</h6>
<p>
Linear. At most <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">rng</span><span class="special">)</span> <span class="special">/</span> <span class="number">2</span></code>
@@ -134,7 +133,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/set.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/set.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/set.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="non_mutating/upper_bound.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../algorithms.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="set/includes.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_set">
<div class="titlepage"><div><div><h4 class="title">
<a name="range.reference.algorithms.set"></a><a class="link" href="set.html" title="Set algorithms">Set algorithms</a>
</h4></div></div></div>
@@ -36,7 +36,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/set/includes.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/set/includes.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/set/includes.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="../set.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="set_union.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_set_includes">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.set.includes"></a><a class="link" href="includes.html" title="includes">includes</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.set.includes.prototype"></a><h6>
-<a name="id733300"></a>
- <a class="link" href="includes.html#range.reference.algorithms.set.includes.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.set.includes.h0"></a>
+ <span><a name="range.reference.algorithms.set.includes.prototype"></a></span><a class="link" href="includes.html#range.reference.algorithms.set.includes.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">SinglePassRange2</span><span class="special">></span>
<span class="keyword">bool</span> <span class="identifier">includes</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&</span> <span class="identifier">rng2</span><span class="special">);</span>
@@ -42,13 +41,13 @@
<span class="keyword">class</span> <span class="identifier">BinaryPredicate</span>
<span class="special">></span>
<span class="keyword">bool</span> <span class="identifier">includes</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&</span> <span class="identifier">rng1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&</span> <span class="identifier">rng2</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+ <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
</pre>
<p>
</p>
-<a name="range.reference.algorithms.set.includes.description"></a><h6>
-<a name="id733580"></a>
- <a class="link" href="includes.html#range.reference.algorithms.set.includes.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.set.includes.h1"></a>
+ <span><a name="range.reference.algorithms.set.includes.description"></a></span><a class="link" href="includes.html#range.reference.algorithms.set.includes.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">includes</span></code> returns <code class="computeroutput"><span class="keyword">true</span></code> if and only if, for every element
@@ -58,16 +57,16 @@
by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
the predicate versions.
</p>
-<a name="range.reference.algorithms.set.includes.definition"></a><h6>
-<a name="id733674"></a>
- <a class="link" href="includes.html#range.reference.algorithms.set.includes.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.set.includes.h2"></a>
+ <span><a name="range.reference.algorithms.set.includes.definition"></a></span><a class="link" href="includes.html#range.reference.algorithms.set.includes.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">set_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.set.includes.requirements"></a><h6>
-<a name="id733743"></a>
- <a class="link" href="includes.html#range.reference.algorithms.set.includes.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.set.includes.h3"></a>
+ <span><a name="range.reference.algorithms.set.includes.requirements"></a></span><a class="link" href="includes.html#range.reference.algorithms.set.includes.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -143,9 +142,9 @@
second argument types.
</li>
</ul></div>
-<a name="range.reference.algorithms.set.includes.precondition_"></a><h6>
-<a name="id734152"></a>
- <a class="link" href="includes.html#range.reference.algorithms.set.includes.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.set.includes.h4"></a>
+ <span><a name="range.reference.algorithms.set.includes.precondition_"></a></span><a class="link" href="includes.html#range.reference.algorithms.set.includes.precondition_">Precondition:</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -161,9 +160,9 @@
<code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
according to <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
-<a name="range.reference.algorithms.set.includes.complexity"></a><h6>
-<a name="id734266"></a>
- <a class="link" href="includes.html#range.reference.algorithms.set.includes.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.set.includes.h5"></a>
+ <span><a name="range.reference.algorithms.set.includes.complexity"></a></span><a class="link" href="includes.html#range.reference.algorithms.set.includes.complexity">Complexity</a>
</h6>
<p>
Linear. <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>,
@@ -172,7 +171,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/set/set_difference.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/set/set_difference.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/set/set_difference.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="set_intersection.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="set_symmetric_difference.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_set_set_difference">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.set.set_difference"></a><a class="link" href="set_difference.html" title="set_difference">set_difference</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.set.set_difference.prototype"></a><h6>
-<a name="id736793"></a>
- <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.set.set_difference.h0"></a>
+ <span><a name="range.reference.algorithms.set.set_difference.prototype"></a></span><a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span>
<span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
@@ -55,9 +54,9 @@
</pre>
<p>
</p>
-<a name="range.reference.algorithms.set.set_difference.description"></a><h6>
-<a name="id737139"></a>
- <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.set.set_difference.h1"></a>
+ <span><a name="range.reference.algorithms.set.set_difference.description"></a></span><a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">set_difference</span></code> constructs
@@ -69,16 +68,16 @@
by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
the predicate versions.
</p>
-<a name="range.reference.algorithms.set.set_difference.definition"></a><h6>
-<a name="id737226"></a>
- <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.set.set_difference.h2"></a>
+ <span><a name="range.reference.algorithms.set.set_difference.definition"></a></span><a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">set_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.set.set_difference.requirements"></a><h6>
-<a name="id737297"></a>
- <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.set.set_difference.h3"></a>
+ <span><a name="range.reference.algorithms.set.set_difference.requirements"></a></span><a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -162,9 +161,9 @@
second argument types.
</li>
</ul></div>
-<a name="range.reference.algorithms.set.set_difference.precondition_"></a><h6>
-<a name="id737763"></a>
- <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.set.set_difference.h4"></a>
+ <span><a name="range.reference.algorithms.set.set_difference.precondition_"></a></span><a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.precondition_">Precondition:</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -180,9 +179,9 @@
<code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
according to <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
-<a name="range.reference.algorithms.set.set_difference.complexity"></a><h6>
-<a name="id737877"></a>
- <a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.set.set_difference.h5"></a>
+ <span><a name="range.reference.algorithms.set.set_difference.complexity"></a></span><a class="link" href="set_difference.html#range.reference.algorithms.set.set_difference.complexity">Complexity</a>
</h6>
<p>
Linear. <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>,
@@ -191,7 +190,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/set/set_intersection.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/set/set_intersection.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/set/set_intersection.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="set_union.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="set_difference.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_set_set_intersection">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.set.set_intersection"></a><a class="link" href="set_intersection.html" title="set_intersection">set_intersection</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.set.set_intersection.prototype"></a><h6>
-<a name="id735588"></a>
- <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.set.set_intersection.h0"></a>
+ <span><a name="range.reference.algorithms.set.set_intersection.prototype"></a></span><a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span>
<span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
@@ -51,13 +50,13 @@
<span class="identifier">OutputIterator</span> <span class="identifier">set_intersection</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&</span> <span class="identifier">rng1</span><span class="special">,</span>
<span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&</span> <span class="identifier">rng2</span><span class="special">,</span>
<span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+ <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
</pre>
<p>
</p>
-<a name="range.reference.algorithms.set.set_intersection.description"></a><h6>
-<a name="id735934"></a>
- <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.set.set_intersection.h1"></a>
+ <span><a name="range.reference.algorithms.set.set_intersection.description"></a></span><a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">set_intersection</span></code> constructs
@@ -69,16 +68,16 @@
by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
the predicate versions.
</p>
-<a name="range.reference.algorithms.set.set_intersection.definition"></a><h6>
-<a name="id736021"></a>
- <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.set.set_intersection.h2"></a>
+ <span><a name="range.reference.algorithms.set.set_intersection.definition"></a></span><a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">set_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.set.set_intersection.requirements"></a><h6>
-<a name="id736091"></a>
- <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.set.set_intersection.h3"></a>
+ <span><a name="range.reference.algorithms.set.set_intersection.requirements"></a></span><a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -162,9 +161,9 @@
second argument types.
</li>
</ul></div>
-<a name="range.reference.algorithms.set.set_intersection.precondition_"></a><h6>
-<a name="id736557"></a>
- <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.set.set_intersection.h4"></a>
+ <span><a name="range.reference.algorithms.set.set_intersection.precondition_"></a></span><a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.precondition_">Precondition:</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -180,9 +179,9 @@
<code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
according to <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
-<a name="range.reference.algorithms.set.set_intersection.complexity"></a><h6>
-<a name="id736671"></a>
- <a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.set.set_intersection.h5"></a>
+ <span><a name="range.reference.algorithms.set.set_intersection.complexity"></a></span><a class="link" href="set_intersection.html#range.reference.algorithms.set.set_intersection.complexity">Complexity</a>
</h6>
<p>
Linear. <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>,
@@ -191,7 +190,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/set/set_symmetric_difference.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/set/set_symmetric_difference.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/set/set_symmetric_difference.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="set_difference.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../heap.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_set_set_symmetric_difference">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.set.set_symmetric_difference"></a><a class="link" href="set_symmetric_difference.html" title="set_symmetric_difference">set_symmetric_difference</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.set.set_symmetric_difference.prototype"></a><h6>
-<a name="id738000"></a>
- <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.set.set_symmetric_difference.h0"></a>
+ <span><a name="range.reference.algorithms.set.set_symmetric_difference.prototype"></a></span><a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span>
<span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
@@ -53,13 +52,13 @@
<span class="identifier">set_symmetric_difference</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&</span> <span class="identifier">rng1</span><span class="special">,</span>
<span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&</span> <span class="identifier">rng2</span><span class="special">,</span>
<span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+ <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
</pre>
<p>
</p>
-<a name="range.reference.algorithms.set.set_symmetric_difference.description"></a><h6>
-<a name="id738347"></a>
- <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.set.set_symmetric_difference.h1"></a>
+ <span><a name="range.reference.algorithms.set.set_symmetric_difference.description"></a></span><a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">set_symmetric_difference</span></code>
@@ -73,16 +72,16 @@
by evaluating <code class="computeroutput"><span class="identifier">pred</span></code> in
the predicate versions.
</p>
-<a name="range.reference.algorithms.set.set_symmetric_difference.definition"></a><h6>
-<a name="id738434"></a>
- <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.set.set_symmetric_difference.h2"></a>
+ <span><a name="range.reference.algorithms.set.set_symmetric_difference.definition"></a></span><a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">set_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.set.set_symmetric_difference.requirements"></a><h6>
-<a name="id738504"></a>
- <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.set.set_symmetric_difference.h3"></a>
+ <span><a name="range.reference.algorithms.set.set_symmetric_difference.requirements"></a></span><a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -166,9 +165,9 @@
second argument types.
</li>
</ul></div>
-<a name="range.reference.algorithms.set.set_symmetric_difference.precondition_"></a><h6>
-<a name="id738968"></a>
- <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.set.set_symmetric_difference.h4"></a>
+ <span><a name="range.reference.algorithms.set.set_symmetric_difference.precondition_"></a></span><a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.precondition_">Precondition:</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -184,9 +183,9 @@
<code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
according to <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
-<a name="range.reference.algorithms.set.set_symmetric_difference.complexity"></a><h6>
-<a name="id739082"></a>
- <a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.set.set_symmetric_difference.h5"></a>
+ <span><a name="range.reference.algorithms.set.set_symmetric_difference.complexity"></a></span><a class="link" href="set_symmetric_difference.html#range.reference.algorithms.set.set_symmetric_difference.complexity">Complexity</a>
</h6>
<p>
Linear. <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>,
@@ -195,7 +194,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/algorithms/set/set_union.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/algorithms/set/set_union.html (original)
+++ branches/release/libs/range/doc/html/range/reference/algorithms/set/set_union.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="includes.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../set.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="set_intersection.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_algorithms_set_set_union">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.algorithms.set.set_union"></a><a class="link" href="set_union.html" title="set_union">set_union</a>
</h5></div></div></div>
-<a name="range.reference.algorithms.set.set_union.prototype"></a><h6>
-<a name="id734387"></a>
- <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.prototype">Prototype</a>
+<h6>
+<a name="range.reference.algorithms.set.set_union.h0"></a>
+ <span><a name="range.reference.algorithms.set.set_union.prototype"></a></span><a class="link" href="set_union.html#range.reference.algorithms.set.set_union.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span>
<span class="keyword">class</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span>
@@ -51,13 +50,13 @@
<span class="identifier">OutputIterator</span> <span class="identifier">set_union</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">&</span> <span class="identifier">rng1</span><span class="special">,</span>
<span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">&</span> <span class="identifier">rng2</span><span class="special">,</span>
<span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span>
- <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
- </pre>
+ <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span><span class="special">);</span>
+</pre>
<p>
</p>
-<a name="range.reference.algorithms.set.set_union.description"></a><h6>
-<a name="id734733"></a>
- <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.description">Description</a>
+<h6>
+<a name="range.reference.algorithms.set.set_union.h1"></a>
+ <span><a name="range.reference.algorithms.set.set_union.description"></a></span><a class="link" href="set_union.html#range.reference.algorithms.set.set_union.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">set_union</span></code> constructs
@@ -68,16 +67,16 @@
in the non-predicate versions, and by evaluating <code class="computeroutput"><span class="identifier">pred</span></code>
in the predicate versions.
</p>
-<a name="range.reference.algorithms.set.set_union.definition"></a><h6>
-<a name="id734816"></a>
- <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.definition">Definition</a>
+<h6>
+<a name="range.reference.algorithms.set.set_union.h2"></a>
+ <span><a name="range.reference.algorithms.set.set_union.definition"></a></span><a class="link" href="set_union.html#range.reference.algorithms.set.set_union.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">set_algorithm</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.algorithms.set.set_union.requirements"></a><h6>
-<a name="id734887"></a>
- <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.requirements">Requirements</a>
+<h6>
+<a name="range.reference.algorithms.set.set_union.h3"></a>
+ <span><a name="range.reference.algorithms.set.set_union.requirements"></a></span><a class="link" href="set_union.html#range.reference.algorithms.set.set_union.requirements">Requirements</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -161,9 +160,9 @@
second argument types.
</li>
</ul></div>
-<a name="range.reference.algorithms.set.set_union.precondition_"></a><h6>
-<a name="id735352"></a>
- <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.precondition_">Precondition:</a>
+<h6>
+<a name="range.reference.algorithms.set.set_union.h4"></a>
+ <span><a name="range.reference.algorithms.set.set_union.precondition_"></a></span><a class="link" href="set_union.html#range.reference.algorithms.set.set_union.precondition_">Precondition:</a>
</h6>
<p>
<span class="bold"><strong>For the non-predicate versions:</strong></span>
@@ -179,9 +178,9 @@
<code class="computeroutput"><span class="identifier">rng1</span></code> and <code class="computeroutput"><span class="identifier">rng2</span></code> are sorted in ascending order
according to <code class="computeroutput"><span class="identifier">pred</span></code>.
</p>
-<a name="range.reference.algorithms.set.set_union.complexity"></a><h6>
-<a name="id735465"></a>
- <a class="link" href="set_union.html#range.reference.algorithms.set.set_union.complexity">Complexity</a>
+<h6>
+<a name="range.reference.algorithms.set.set_union.h5"></a>
+ <span><a name="range.reference.algorithms.set.set_union.complexity"></a></span><a class="link" href="set_union.html#range.reference.algorithms.set.set_union.complexity">Complexity</a>
</h6>
<p>
Linear. <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code>,
@@ -190,7 +189,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/concept_implementation.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/concept_implementation.html (original)
+++ branches/release/libs/range/doc/html/range/reference/concept_implementation.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="overview.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="concept_implementation/synopsis.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_concept_implementation">
<div class="titlepage"><div><div><h3 class="title">
<a name="range.reference.concept_implementation"></a><a class="link" href="concept_implementation.html" title="Range concept implementation">Range concept
implementation</a>
@@ -34,7 +34,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/concept_implementation/semantics.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/concept_implementation/semantics.html (original)
+++ branches/release/libs/range/doc/html/range/reference/concept_implementation/semantics.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="synopsis.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concept_implementation.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="semantics/metafunctions.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_concept_implementation_semantics">
<div class="titlepage"><div><div><h4 class="title">
<a name="range.reference.concept_implementation.semantics"></a><a class="link" href="semantics.html" title="Semantics">Semantics</a>
</h4></div></div></div>
@@ -30,9 +30,9 @@
<dt><span class="section">Metafunctions</span></dt>
<dt><span class="section">Functions</span></dt>
</dl></div>
-<a name="range.reference.concept_implementation.semantics.notation"></a><h6>
-<a name="id654700"></a>
- <a class="link" href="semantics.html#range.reference.concept_implementation.semantics.notation">notation</a>
+<h6>
+<a name="range.reference.concept_implementation.semantics.h0"></a>
+ <span><a name="range.reference.concept_implementation.semantics.notation"></a></span><a class="link" href="semantics.html#range.reference.concept_implementation.semantics.notation">notation</a>
</h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -149,7 +149,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/concept_implementation/semantics/functions.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/concept_implementation/semantics/functions.html (original)
+++ branches/release/libs/range/doc/html/range/reference/concept_implementation/semantics/functions.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="metafunctions.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../semantics.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../adaptors.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_concept_implementation_semantics_functions">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.concept_implementation.semantics.functions"></a><a class="link" href="functions.html" title="Functions">Functions</a>
</h5></div></div></div>
@@ -163,7 +163,7 @@
</td>
<td>
<p>
- <code class="computeroutput"><span class="identifier">range_difference</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code>
+ <code class="computeroutput"><span class="identifier">range_size</span><span class="special"><</span><span class="identifier">X</span><span class="special">>::</span><span class="identifier">type</span></code>
</p>
</td>
<td>
@@ -396,7 +396,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/concept_implementation/semantics/metafunctions.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/concept_implementation/semantics/metafunctions.html (original)
+++ branches/release/libs/range/doc/html/range/reference/concept_implementation/semantics/metafunctions.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../semantics.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../semantics.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="functions.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_concept_implementation_semantics_metafunctions">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.concept_implementation.semantics.metafunctions"></a><a class="link" href="metafunctions.html" title="Metafunctions">Metafunctions</a>
</h5></div></div></div>
@@ -58,7 +58,6 @@
</td>
<td>
<p>
-
</p>
<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">T</span><span class="special">::</span><span class="identifier">iterator</span>
<span class="identifier">P</span><span class="special">::</span><span class="identifier">first_type</span>
@@ -82,7 +81,6 @@
</td>
<td>
<p>
-
</p>
<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting"><span class="identifier">T</span><span class="special">::</span><span class="identifier">const_iterator</span>
<span class="identifier">P</span><span class="special">::</span><span class="identifier">first_type</span>
@@ -260,7 +258,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/concept_implementation/synopsis.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/concept_implementation/synopsis.html (original)
+++ branches/release/libs/range/doc/html/range/reference/concept_implementation/synopsis.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,19 +22,18 @@
<div class="spirit-nav">
<a accesskey="p" href="../concept_implementation.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../concept_implementation.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="semantics.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_concept_implementation_synopsis">
<div class="titlepage"><div><div><h4 class="title">
<a name="range.reference.concept_implementation.synopsis"></a><a class="link" href="synopsis.html" title="Synopsis">Synopsis</a>
</h4></div></div></div>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span>
<span class="special">{</span>
- <span class="comment">//
-</span> <span class="comment">// Single Pass Range metafunctions
-</span> <span class="comment">//
-</span>
+ <span class="comment">//</span>
+ <span class="comment">// Single Pass Range metafunctions</span>
+ <span class="comment">//</span>
+
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
<span class="keyword">struct</span> <span class="identifier">range_iterator</span><span class="special">;</span>
@@ -43,31 +42,31 @@
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
<span class="keyword">struct</span> <span class="identifier">range_reference</span><span class="special">;</span>
-
+
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
<span class="keyword">struct</span> <span class="identifier">range_pointer</span><span class="special">;</span>
-
+
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
<span class="keyword">struct</span> <span class="identifier">range_category</span><span class="special">;</span>
- <span class="comment">//
-</span> <span class="comment">// Forward Range metafunctions
-</span> <span class="comment">//
-</span>
+ <span class="comment">//</span>
+ <span class="comment">// Forward Range metafunctions</span>
+ <span class="comment">//</span>
+
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
<span class="keyword">struct</span> <span class="identifier">range_difference</span><span class="special">;</span>
- <span class="comment">//
-</span> <span class="comment">// Bidirectional Range metafunctions
-</span> <span class="comment">//
-</span>
+ <span class="comment">//</span>
+ <span class="comment">// Bidirectional Range metafunctions</span>
+ <span class="comment">//</span>
+
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
<span class="keyword">struct</span> <span class="identifier">range_reverse_iterator</span><span class="special">;</span>
- <span class="comment">//
-</span> <span class="comment">// Single Pass Range functions
-</span> <span class="comment">//
-</span>
+ <span class="comment">//</span>
+ <span class="comment">// Single Pass Range functions</span>
+ <span class="comment">//</span>
+
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
<span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span>
<span class="identifier">begin</span><span class="special">(</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
@@ -88,18 +87,18 @@
<span class="keyword">bool</span>
<span class="identifier">empty</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
- <span class="comment">//
-</span> <span class="comment">// Forward Range functions
-</span> <span class="comment">//
-</span>
+ <span class="comment">//</span>
+ <span class="comment">// Forward Range functions</span>
+ <span class="comment">//</span>
+
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
<span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span>
<span class="identifier">distance</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
- <span class="comment">//
-</span> <span class="comment">// Bidirectional Range functions
-</span> <span class="comment">//
-</span>
+ <span class="comment">//</span>
+ <span class="comment">// Bidirectional Range functions</span>
+ <span class="comment">//</span>
+
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
<span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span>
<span class="identifier">rbegin</span><span class="special">(</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
@@ -115,63 +114,64 @@
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
<span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span>
<span class="identifier">rend</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="comment">//
-</span> <span class="comment">// Random Access Range functions
-</span> <span class="comment">//
-</span>
+
+ <span class="comment">//</span>
+ <span class="comment">// Random Access Range functions</span>
+ <span class="comment">//</span>
+
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
<span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span>
<span class="identifier">size</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
- <span class="comment">//
-</span> <span class="comment">// Special const Range functions
-</span> <span class="comment">//
-</span>
+ <span class="comment">//</span>
+ <span class="comment">// Special const Range functions</span>
+ <span class="comment">//</span>
+
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span>
+ <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span>
<span class="identifier">const_begin</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span>
+ <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span>
<span class="identifier">const_end</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span>
+ <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span>
<span class="identifier">const_rbegin</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
- <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span>
+ <span class="keyword">typename</span> <span class="identifier">range_reverse_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span>
<span class="identifier">const_rend</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="comment">//
-</span> <span class="comment">// String utilities
-</span> <span class="comment">//
-</span>
+
+ <span class="comment">//</span>
+ <span class="comment">// String utilities</span>
+ <span class="comment">//</span>
+
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
<span class="identifier">iterator_range</span><span class="special"><</span> <span class="special">...</span> <span class="identifier">see</span> <span class="identifier">below</span> <span class="special">...</span> <span class="special">></span>
<span class="identifier">as_literal</span><span class="special">(</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
+
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
<span class="identifier">iterator_range</span><span class="special"><</span> <span class="special">...</span> <span class="identifier">see</span> <span class="identifier">below</span> <span class="special">...</span> <span class="special">></span>
<span class="identifier">as_literal</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
+
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
<span class="identifier">iterator_range</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span> <span class="special">></span>
<span class="identifier">as_array</span><span class="special">(</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
+
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
<span class="identifier">iterator_range</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">T</span><span class="special">>::</span><span class="identifier">type</span> <span class="special">></span>
<span class="identifier">as_array</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-<span class="special">}</span> <span class="comment">// namespace 'boost'
-</span></pre>
+<span class="special">}</span> <span class="comment">// namespace 'boost'</span>
+</pre>
<p>
</p>
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/extending.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/extending.html (original)
+++ branches/release/libs/range/doc/html/range/reference/extending.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="utilities/join.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="extending/method_1.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_extending">
<div class="titlepage"><div><div><h3 class="title">
<a name="range.reference.extending"></a><a class="link" href="extending.html" title="Extending the library">Extending the library</a>
</h3></div></div></div>
@@ -37,7 +37,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/extending/method_1.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/extending/method_1.html (original)
+++ branches/release/libs/range/doc/html/range/reference/extending/method_1.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../extending.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../extending.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="method_2.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_extending_method_1">
<div class="titlepage"><div><div><h4 class="title">
<a name="range.reference.extending.method_1"></a><a class="link" href="method_1.html" title="Method 1: provide member functions and nested types">Method 1: provide
member functions and nested types</a>
@@ -147,7 +147,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/extending/method_2.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/extending/method_2.html (original)
+++ branches/release/libs/range/doc/html/range/reference/extending/method_2.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="method_1.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../extending.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="method_3.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_extending_method_2">
<div class="titlepage"><div><div><h4 class="title">
<a name="range.reference.extending.method_2"></a><a class="link" href="method_2.html" title="Method 2: provide free-standing functions and specialize metafunctions">Method 2: provide
free-standing functions and specialize metafunctions</a>
@@ -164,33 +164,32 @@
A complete example is given here:
</p>
<p>
-
</p>
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
-<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">iterator</span><span class="special">></span> <span class="comment">// for std::iterator_traits, std::distance()
-</span>
+<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">iterator</span><span class="special">></span> <span class="comment">// for std::iterator_traits, std::distance()</span>
+
<span class="keyword">namespace</span> <span class="identifier">Foo</span>
<span class="special">{</span>
- <span class="comment">//
-</span> <span class="comment">// Our sample UDT. A 'Pair'
-</span> <span class="comment">// will work as a range when the stored
-</span> <span class="comment">// elements are iterators.
-</span> <span class="comment">//
-</span> <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
+ <span class="comment">//</span>
+ <span class="comment">// Our sample UDT. A 'Pair'</span>
+ <span class="comment">// will work as a range when the stored</span>
+ <span class="comment">// elements are iterators.</span>
+ <span class="comment">//</span>
+ <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
<span class="keyword">struct</span> <span class="identifier">Pair</span>
<span class="special">{</span>
<span class="identifier">T</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">last</span><span class="special">;</span>
<span class="special">};</span>
-<span class="special">}</span> <span class="comment">// namespace 'Foo'
-</span>
+<span class="special">}</span> <span class="comment">// namespace 'Foo'</span>
+
<span class="keyword">namespace</span> <span class="identifier">boost</span>
<span class="special">{</span>
- <span class="comment">//
-</span> <span class="comment">// Specialize metafunctions. We must include the range.hpp header.
-</span> <span class="comment">// We must open the 'boost' namespace.
-</span> <span class="comment">//
-</span>
+ <span class="comment">//</span>
+ <span class="comment">// Specialize metafunctions. We must include the range.hpp header.</span>
+ <span class="comment">// We must open the 'boost' namespace.</span>
+ <span class="comment">//</span>
+
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
<span class="keyword">struct</span> <span class="identifier">range_mutable_iterator</span><span class="special"><</span> <span class="identifier">Foo</span><span class="special">::</span><span class="identifier">Pair</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="special">></span>
<span class="special">{</span>
@@ -200,24 +199,24 @@
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
<span class="keyword">struct</span> <span class="identifier">range_const_iterator</span><span class="special"><</span> <span class="identifier">Foo</span><span class="special">::</span><span class="identifier">Pair</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span> <span class="special">></span>
<span class="special">{</span>
- <span class="comment">//
-</span> <span class="comment">// Remark: this is defined similar to 'range_iterator'
-</span> <span class="comment">// because the 'Pair' type does not distinguish
-</span> <span class="comment">// between an iterator and a const_iterator.
-</span> <span class="comment">//
-</span> <span class="keyword">typedef</span> <span class="identifier">T</span> <span class="identifier">type</span><span class="special">;</span>
+ <span class="comment">//</span>
+ <span class="comment">// Remark: this is defined similar to 'range_iterator'</span>
+ <span class="comment">// because the 'Pair' type does not distinguish</span>
+ <span class="comment">// between an iterator and a const_iterator.</span>
+ <span class="comment">//</span>
+ <span class="keyword">typedef</span> <span class="identifier">T</span> <span class="identifier">type</span><span class="special">;</span>
<span class="special">};</span>
-<span class="special">}</span> <span class="comment">// namespace 'boost'
-</span>
+<span class="special">}</span> <span class="comment">// namespace 'boost'</span>
+
<span class="keyword">namespace</span> <span class="identifier">Foo</span>
<span class="special">{</span>
- <span class="comment">//
-</span> <span class="comment">// The required functions. These should be defined in
-</span> <span class="comment">// the same namespace as 'Pair', in this case
-</span> <span class="comment">// in namespace 'Foo'.
-</span> <span class="comment">//
-</span>
+ <span class="comment">//</span>
+ <span class="comment">// The required functions. These should be defined in</span>
+ <span class="comment">// the same namespace as 'Pair', in this case</span>
+ <span class="comment">// in namespace 'Foo'.</span>
+ <span class="comment">//</span>
+
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">T</span> <span class="special">></span>
<span class="keyword">inline</span> <span class="identifier">T</span> <span class="identifier">range_begin</span><span class="special">(</span> <span class="identifier">Pair</span><span class="special"><</span><span class="identifier">T</span><span class="special">>&</span> <span class="identifier">x</span> <span class="special">)</span>
<span class="special">{</span>
@@ -242,8 +241,8 @@
<span class="keyword">return</span> <span class="identifier">x</span><span class="special">.</span><span class="identifier">last</span><span class="special">;</span>
<span class="special">}</span>
-<span class="special">}</span> <span class="comment">// namespace 'Foo'
-</span>
+<span class="special">}</span> <span class="comment">// namespace 'Foo'</span>
+
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">vector</span><span class="special">></span>
<span class="keyword">int</span> <span class="identifier">main</span><span class="special">(</span><span class="keyword">int</span> <span class="identifier">argc</span><span class="special">,</span> <span class="keyword">const</span> <span class="keyword">char</span><span class="special">*</span> <span class="identifier">argv</span><span class="special">[])</span>
@@ -252,10 +251,10 @@
<span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special"><</span><span class="keyword">int</span><span class="special">></span> <span class="identifier">vec</span><span class="special">;</span>
<span class="identifier">Foo</span><span class="special">::</span><span class="identifier">Pair</span><span class="special"><</span><span class="identifier">iter</span><span class="special">></span> <span class="identifier">pair</span> <span class="special">=</span> <span class="special">{</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">vec</span><span class="special">.</span><span class="identifier">end</span><span class="special">()</span> <span class="special">};</span>
<span class="keyword">const</span> <span class="identifier">Foo</span><span class="special">::</span><span class="identifier">Pair</span><span class="special"><</span><span class="identifier">iter</span><span class="special">>&</span> <span class="identifier">cpair</span> <span class="special">=</span> <span class="identifier">pair</span><span class="special">;</span>
- <span class="comment">//
-</span> <span class="comment">// Notice that we call 'begin' etc with qualification.
-</span> <span class="comment">//
-</span> <span class="identifier">iter</span> <span class="identifier">i</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span> <span class="identifier">pair</span> <span class="special">);</span>
+ <span class="comment">//</span>
+ <span class="comment">// Notice that we call 'begin' etc with qualification.</span>
+ <span class="comment">//</span>
+ <span class="identifier">iter</span> <span class="identifier">i</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span> <span class="identifier">pair</span> <span class="special">);</span>
<span class="identifier">iter</span> <span class="identifier">e</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span> <span class="identifier">pair</span> <span class="special">);</span>
<span class="identifier">i</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">begin</span><span class="special">(</span> <span class="identifier">cpair</span> <span class="special">);</span>
<span class="identifier">e</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">end</span><span class="special">(</span> <span class="identifier">cpair</span> <span class="special">);</span>
@@ -273,7 +272,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/extending/method_3.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/extending/method_3.html (original)
+++ branches/release/libs/range/doc/html/range/reference/extending/method_3.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="method_2.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../extending.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="method_3/method_3_1.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_extending_method_3">
<div class="titlepage"><div><div><h4 class="title">
<a name="range.reference.extending.method_3"></a><a class="link" href="method_3.html" title="Method 3: provide range adaptor implementations">Method 3: provide
range adaptor implementations</a>
@@ -36,7 +36,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/extending/method_3/method_3_1.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/extending/method_3/method_3_1.html (original)
+++ branches/release/libs/range/doc/html/range/reference/extending/method_3/method_3_1.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../method_3.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../method_3.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="method_3_2.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_extending_method_3_method_3_1">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.extending.method_3.method_3_1"></a><a class="link" href="method_3_1.html" title="Method 3.1: Implement a Range Adaptor without arguments">Method
3.1: Implement a Range Adaptor without arguments</a>
@@ -33,7 +33,7 @@
</p>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
- Provide a range for your return type, for example:
+ Provide a range for your return type, for example:
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">iterator_range</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">iterator</span><span class="special">/</span><span class="identifier">reverse_iterator</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
@@ -60,7 +60,7 @@
</li>
<li class="listitem">
Provide a tag to uniquely identify your adaptor in the <code class="computeroutput"><span class="keyword">operator</span><span class="special">|</span></code>
- function overload set
+ function overload set
<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">detail</span> <span class="special">{</span>
<span class="keyword">struct</span> <span class="identifier">reverse_forwarder</span> <span class="special">{};</span>
<span class="special">}</span>
@@ -68,7 +68,6 @@
</li>
<li class="listitem">
Implement <code class="computeroutput"><span class="keyword">operator</span><span class="special">|</span></code>
-
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">BidirectionalRng</span> <span class="special">></span>
<span class="keyword">inline</span> <span class="identifier">reverse_range</span><span class="special"><</span><span class="identifier">BidirectionalRng</span><span class="special">></span>
<span class="keyword">operator</span><span class="special">|(</span> <span class="identifier">BidirectionalRng</span><span class="special">&</span> <span class="identifier">r</span><span class="special">,</span> <span class="identifier">detail</span><span class="special">::</span><span class="identifier">reverse_forwarder</span> <span class="special">)</span>
@@ -88,7 +87,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/extending/method_3/method_3_2.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/extending/method_3/method_3_2.html (original)
+++ branches/release/libs/range/doc/html/range/reference/extending/method_3/method_3_2.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,14 +22,14 @@
<div class="spirit-nav">
<a accesskey="p" href="method_3_1.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../method_3.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../../style_guide.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_extending_method_3_method_3_2">
<div class="titlepage"><div><div><h5 class="title">
<a name="range.reference.extending.method_3.method_3_2"></a><a class="link" href="method_3_2.html" title="Method 3.2: Implement a Range Adaptor with arguments">Method
3.2: Implement a Range Adaptor with arguments</a>
</h5></div></div></div>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
- Provide a range for your return type, for example:
+ Provide a range for your return type, for example:
<pre class="programlisting"><span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">adaptor</span><span class="special">/</span><span class="identifier">argument_fwd</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">iterator_range</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
<span class="preprocessor">#include</span> <span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">iterator</span><span class="special">/</span><span class="identifier">transform_iterator</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span>
@@ -88,7 +88,6 @@
the right operand of <code class="computeroutput"><span class="keyword">operator</span><span class="special">|()</span></code>.
</p>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">></span>
<span class="keyword">class</span> <span class="identifier">replace_holder</span> <span class="special">:</span> <span class="keyword">public</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">holder2</span><span class="special"><</span><span class="identifier">T</span><span class="special">></span>
@@ -107,7 +106,6 @@
Define an instance of the holder with the name of the adaptor
</li></ol></div>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">static</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">forwarder2</span><span class="special"><</span><span class="identifier">replace_holder</span><span class="special">></span>
<span class="identifier">replaced</span> <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">forwarder2</span><span class="special"><</span><span class="identifier">replace_holder</span><span class="special">>();</span>
@@ -118,7 +116,6 @@
Define <code class="computeroutput"><span class="keyword">operator</span><span class="special">|</span></code>
</li></ol></div>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">SinglePassRange</span><span class="special">></span>
<span class="keyword">inline</span> <span class="identifier">replace_range</span><span class="special"><</span><span class="identifier">SinglePassRange</span><span class="special">></span>
@@ -141,7 +138,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/overview.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/overview.html (original)
+++ branches/release/libs/range/doc/html/range/reference/overview.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="concept_implementation.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_overview">
<div class="titlepage"><div><div><h3 class="title">
<a name="range.reference.overview"></a><a class="link" href="overview.html" title="Overview">Overview</a>
</h3></div></div></div>
@@ -56,7 +56,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/ranges.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/ranges.html (original)
+++ branches/release/libs/range/doc/html/range/reference/ranges.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="algorithms/numeric/partial_sum.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="ranges/any_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_ranges">
<div class="titlepage"><div><div><h3 class="title">
<a name="range.reference.ranges"></a><a class="link" href="ranges.html" title="Provided Ranges">Provided Ranges</a>
</h3></div></div></div>
@@ -35,7 +35,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/ranges/any_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/ranges/any_range.html (original)
+++ branches/release/libs/range/doc/html/range/reference/ranges/any_range.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,13 +22,13 @@
<div class="spirit-nav">
<a accesskey="p" href="../ranges.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="counting_range.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_ranges_any_range">
<div class="titlepage"><div><div><h4 class="title">
<a name="range.reference.ranges.any_range"></a><a class="link" href="any_range.html" title="any_range">any_range</a>
</h4></div></div></div>
-<a name="range.reference.ranges.any_range.description"></a><h6>
-<a name="id754843"></a>
- <a class="link" href="any_range.html#range.reference.ranges.any_range.description">Description</a>
+<h6>
+<a name="range.reference.ranges.any_range.h0"></a>
+ <span><a name="range.reference.ranges.any_range.description"></a></span><a class="link" href="any_range.html#range.reference.ranges.any_range.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">any_range</span></code> is a range that
@@ -63,12 +63,11 @@
for a Range Adaptor that returns <code class="computeroutput"><span class="identifier">any_range</span></code>
instances.
</p>
-<a name="range.reference.ranges.any_range.synopsis"></a><h6>
-<a name="id755211"></a>
- <a class="link" href="any_range.html#range.reference.ranges.any_range.synopsis">Synopsis</a>
+<h6>
+<a name="range.reference.ranges.any_range.h1"></a>
+ <span><a name="range.reference.ranges.any_range.synopsis"></a></span><a class="link" href="any_range.html#range.reference.ranges.any_range.synopsis">Synopsis</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span>
<span class="keyword">class</span> <span class="identifier">Value</span>
@@ -153,9 +152,9 @@
</pre>
<p>
</p>
-<a name="range.reference.ranges.any_range.definition"></a><h6>
-<a name="id756420"></a>
- <a class="link" href="any_range.html#range.reference.ranges.any_range.definition">Definition</a>
+<h6>
+<a name="range.reference.ranges.any_range.h2"></a>
+ <span><a name="range.reference.ranges.any_range.definition"></a></span><a class="link" href="any_range.html#range.reference.ranges.any_range.definition">Definition</a>
</h6>
<p>
Defined in header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">any_range</span><span class="special">.</span><span class="identifier">hpp</span></code>
@@ -163,7 +162,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/ranges/counting_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/ranges/counting_range.html (original)
+++ branches/release/libs/range/doc/html/range/reference/ranges/counting_range.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="any_range.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="istream_range.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_ranges_counting_range">
<div class="titlepage"><div><div><h4 class="title">
<a name="range.reference.ranges.counting_range"></a><a class="link" href="counting_range.html" title="counting_range">counting_range</a>
</h4></div></div></div>
-<a name="range.reference.ranges.counting_range.prototype"></a><h6>
-<a name="id756497"></a>
- <a class="link" href="counting_range.html#range.reference.ranges.counting_range.prototype">Prototype</a>
+<h6>
+<a name="range.reference.ranges.counting_range.h0"></a>
+ <span><a name="range.reference.ranges.counting_range.prototype"></a></span><a class="link" href="counting_range.html#range.reference.ranges.counting_range.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">Incrementable</span> <span class="special">></span> <span class="keyword">inline</span>
<span class="identifier">iterator_range</span><span class="special"><</span> <span class="identifier">counting_iterator</span><span class="special"><</span><span class="identifier">Incrementable</span><span class="special">></span> <span class="special">></span>
@@ -47,9 +46,9 @@
</pre>
<p>
</p>
-<a name="range.reference.ranges.counting_range.description"></a><h6>
-<a name="id756879"></a>
- <a class="link" href="counting_range.html#range.reference.ranges.counting_range.description">Description</a>
+<h6>
+<a name="range.reference.ranges.counting_range.h1"></a>
+ <span><a name="range.reference.ranges.counting_range.description"></a></span><a class="link" href="counting_range.html#range.reference.ranges.counting_range.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">counting_range</span></code> is a function
@@ -57,16 +56,16 @@
wrapping a <code class="computeroutput"><span class="identifier">counting_iterator</span></code>
(from Boost.Iterator).
</p>
-<a name="range.reference.ranges.counting_range.definition"></a><h6>
-<a name="id756935"></a>
- <a class="link" href="counting_range.html#range.reference.ranges.counting_range.definition">Definition</a>
+<h6>
+<a name="range.reference.ranges.counting_range.h2"></a>
+ <span><a name="range.reference.ranges.counting_range.definition"></a></span><a class="link" href="counting_range.html#range.reference.ranges.counting_range.definition">Definition</a>
</h6>
<p>
Defined in header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">counting_range</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.ranges.counting_range.requirements"></a><h6>
-<a name="id756996"></a>
- <a class="link" href="counting_range.html#range.reference.ranges.counting_range.requirements">Requirements</a>
+<h6>
+<a name="range.reference.ranges.counting_range.h3"></a>
+ <span><a name="range.reference.ranges.counting_range.requirements"></a></span><a class="link" href="counting_range.html#range.reference.ranges.counting_range.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
<code class="computeroutput"><span class="identifier">Incrementable</span></code> is a
@@ -76,7 +75,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/ranges/irange.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/ranges/irange.html (original)
+++ branches/release/libs/range/doc/html/range/reference/ranges/irange.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="istream_range.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../utilities.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_ranges_irange">
<div class="titlepage"><div><div><h4 class="title">
<a name="range.reference.ranges.irange"></a><a class="link" href="irange.html" title="irange">irange</a>
</h4></div></div></div>
-<a name="range.reference.ranges.irange.prototype"></a><h6>
-<a name="id757425"></a>
- <a class="link" href="irange.html#range.reference.ranges.irange.prototype">Prototype</a>
+<h6>
+<a name="range.reference.ranges.irange.h0"></a>
+ <span><a name="range.reference.ranges.irange.prototype"></a></span><a class="link" href="irange.html#range.reference.ranges.irange.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">class</span> <span class="identifier">Integer</span><span class="special">></span>
<span class="identifier">iterator_range</span><span class="special"><</span> <span class="identifier">range_detail</span><span class="special">::</span><span class="identifier">integer_iterator</span><span class="special"><</span><span class="identifier">Integer</span><span class="special">></span> <span class="special">></span>
@@ -43,9 +42,9 @@
</pre>
<p>
</p>
-<a name="range.reference.ranges.irange.description"></a><h6>
-<a name="id757718"></a>
- <a class="link" href="irange.html#range.reference.ranges.irange.description">Description</a>
+<h6>
+<a name="range.reference.ranges.irange.h1"></a>
+ <span><a name="range.reference.ranges.irange.description"></a></span><a class="link" href="irange.html#range.reference.ranges.irange.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">irange</span></code> is a function to
@@ -57,16 +56,16 @@
Access Range</a> Concept. It should be noted that the <code class="computeroutput"><span class="identifier">first</span></code> and <code class="computeroutput"><span class="identifier">last</span></code>
parameters denoted a half-open range.
</p>
-<a name="range.reference.ranges.irange.definition"></a><h6>
-<a name="id757796"></a>
- <a class="link" href="irange.html#range.reference.ranges.irange.definition">Definition</a>
+<h6>
+<a name="range.reference.ranges.irange.h2"></a>
+ <span><a name="range.reference.ranges.irange.definition"></a></span><a class="link" href="irange.html#range.reference.ranges.irange.definition">Definition</a>
</h6>
<p>
Defined in the header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">irange</span><span class="special">.</span><span class="identifier">hpp</span></code>
</p>
-<a name="range.reference.ranges.irange.requirements"></a><h6>
-<a name="id757857"></a>
- <a class="link" href="irange.html#range.reference.ranges.irange.requirements">Requirements</a>
+<h6>
+<a name="range.reference.ranges.irange.h3"></a>
+ <span><a name="range.reference.ranges.irange.requirements"></a></span><a class="link" href="irange.html#range.reference.ranges.irange.requirements">Requirements</a>
</h6>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
@@ -79,9 +78,9 @@
Concept.
</li>
</ol></div>
-<a name="range.reference.ranges.irange.complexity"></a><h6>
-<a name="id757940"></a>
- <a class="link" href="irange.html#range.reference.ranges.irange.complexity">Complexity</a>
+<h6>
+<a name="range.reference.ranges.irange.h4"></a>
+ <span><a name="range.reference.ranges.irange.complexity"></a></span><a class="link" href="irange.html#range.reference.ranges.irange.complexity">Complexity</a>
</h6>
<p>
Constant. Since this function generates a new range the most significant
@@ -90,7 +89,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/ranges/istream_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/ranges/istream_range.html (original)
+++ branches/release/libs/range/doc/html/range/reference/ranges/istream_range.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,16 +22,15 @@
<div class="spirit-nav">
<a accesskey="p" href="counting_range.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../ranges.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="irange.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_ranges_istream_range">
<div class="titlepage"><div><div><h4 class="title">
<a name="range.reference.ranges.istream_range"></a><a class="link" href="istream_range.html" title="istream_range">istream_range</a>
</h4></div></div></div>
-<a name="range.reference.ranges.istream_range.prototype"></a><h6>
-<a name="id757067"></a>
- <a class="link" href="istream_range.html#range.reference.ranges.istream_range.prototype">Prototype</a>
+<h6>
+<a name="range.reference.ranges.istream_range.h0"></a>
+ <span><a name="range.reference.ranges.istream_range.prototype"></a></span><a class="link" href="istream_range.html#range.reference.ranges.istream_range.prototype">Prototype</a>
</h6>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">Type</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Elem</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Traits</span> <span class="special">></span> <span class="keyword">inline</span>
<span class="identifier">iterator_range</span><span class="special"><</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">istream_iterator</span><span class="special"><</span><span class="identifier">Type</span><span class="special">,</span> <span class="identifier">Elem</span><span class="special">,</span> <span class="identifier">Traits</span><span class="special">></span> <span class="special">></span>
@@ -39,18 +38,18 @@
</pre>
<p>
</p>
-<a name="range.reference.ranges.istream_range.description"></a><h6>
-<a name="id757284"></a>
- <a class="link" href="istream_range.html#range.reference.ranges.istream_range.description">Description</a>
+<h6>
+<a name="range.reference.ranges.istream_range.h1"></a>
+ <span><a name="range.reference.ranges.istream_range.description"></a></span><a class="link" href="istream_range.html#range.reference.ranges.istream_range.description">Description</a>
</h6>
<p>
<code class="computeroutput"><span class="identifier">istream_range</span></code> is a function
to generator that generates an <code class="computeroutput"><span class="identifier">iterator_range</span></code>
wrapping a <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">istream_iterator</span></code>.
</p>
-<a name="range.reference.ranges.istream_range.definition"></a><h6>
-<a name="id757348"></a>
- <a class="link" href="istream_range.html#range.reference.ranges.istream_range.definition">Definition</a>
+<h6>
+<a name="range.reference.ranges.istream_range.h2"></a>
+ <span><a name="range.reference.ranges.istream_range.definition"></a></span><a class="link" href="istream_range.html#range.reference.ranges.istream_range.definition">Definition</a>
</h6>
<p>
Defined in header file <code class="computeroutput"><span class="identifier">boost</span><span class="special">/</span><span class="identifier">range</span><span class="special">/</span><span class="identifier">istream_range</span><span class="special">.</span><span class="identifier">hpp</span></code>
@@ -58,7 +57,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/utilities.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/utilities.html (original)
+++ branches/release/libs/range/doc/html/range/reference/utilities.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="ranges/irange.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../reference.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="utilities/iterator_range.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_utilities">
<div class="titlepage"><div><div><h3 class="title">
<a name="range.reference.utilities"></a><a class="link" href="utilities.html" title="Utilities">Utilities</a>
</h3></div></div></div>
@@ -69,7 +69,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/utilities/iterator_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/utilities/iterator_range.html (original)
+++ branches/release/libs/range/doc/html/range/reference/utilities/iterator_range.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="../utilities.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="sub_range.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_utilities_iterator_range">
<div class="titlepage"><div><div><h4 class="title">
<a name="range.reference.utilities.iterator_range"></a><a class="link" href="iterator_range.html" title="Class iterator_range">Class <code class="computeroutput"><span class="identifier">iterator_range</span></code></a>
</h4></div></div></div>
@@ -44,73 +44,72 @@
then one can still call all its member functions. This design decision
avoids the <code class="computeroutput"><span class="identifier">iterator_range</span></code>
imposing limitations upon ranges of iterators that are not singular. Any
- singularity limitation is simply propogated from the underlying iterator
+ singularity limitation is simply propagated from the underlying iterator
type.
</p>
-<a name="range.reference.utilities.iterator_range.synopsis"></a><h5>
-<a name="id758301"></a>
- <a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.synopsis">Synopsis</a>
+<h5>
+<a name="range.reference.utilities.iterator_range.h0"></a>
+ <span><a name="range.reference.utilities.iterator_range.synopsis"></a></span><a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.synopsis">Synopsis</a>
</h5>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span>
<span class="special">{</span>
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span> <span class="special">></span>
<span class="keyword">class</span> <span class="identifier">iterator_range</span>
<span class="special">{</span>
- <span class="keyword">public</span><span class="special">:</span> <span class="comment">// Forward Range types
-</span> <span class="keyword">typedef</span> <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">iterator</span><span class="special">;</span>
+ <span class="keyword">public</span><span class="special">:</span> <span class="comment">// Forward Range types</span>
+ <span class="keyword">typedef</span> <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">iterator</span><span class="special">;</span>
<span class="keyword">typedef</span> <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">const_iterator</span><span class="special">;</span>
<span class="keyword">typedef</span> <span class="identifier">iterator_difference</span><span class="special"><</span><span class="identifier">iterator</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">difference_type</span><span class="special">;</span>
- <span class="keyword">public</span><span class="special">:</span> <span class="comment">// construction, assignment
-</span> <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="special">></span>
+ <span class="keyword">public</span><span class="special">:</span> <span class="comment">// construction, assignment</span>
+ <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="special">></span>
<span class="identifier">iterator_range</span><span class="special">(</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="identifier">Begin</span><span class="special">,</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="identifier">End</span> <span class="special">);</span>
-
+
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">></span>
<span class="identifier">iterator_range</span><span class="special">(</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
+
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">></span>
<span class="identifier">iterator_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
+
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">></span>
<span class="identifier">iterator_range</span><span class="special">&</span> <span class="keyword">operator</span><span class="special">=(</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">></span>
<span class="identifier">iterator_range</span><span class="special">&</span> <span class="keyword">operator</span><span class="special">=(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">public</span><span class="special">:</span> <span class="comment">// Forward Range functions
-</span> <span class="identifier">iterator</span> <span class="identifier">begin</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="keyword">public</span><span class="special">:</span> <span class="comment">// Forward Range functions</span>
+ <span class="identifier">iterator</span> <span class="identifier">begin</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
<span class="identifier">iterator</span> <span class="identifier">end</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
-
- <span class="keyword">public</span><span class="special">:</span> <span class="comment">// convenience
-</span> <span class="keyword">operator</span> <span class="identifier">unspecified_bool_type</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="keyword">public</span><span class="special">:</span> <span class="comment">// convenience</span>
+ <span class="keyword">operator</span> <span class="identifier">unspecified_bool_type</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
<span class="keyword">bool</span> <span class="identifier">equal</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special">&</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
<span class="identifier">value_type</span><span class="special">&</span> <span class="identifier">front</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
<span class="identifier">value_type</span><span class="special">&</span> <span class="identifier">back</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
<span class="identifier">iterator_range</span><span class="special">&</span> <span class="identifier">advance_begin</span><span class="special">(</span><span class="identifier">difference_type</span> <span class="identifier">n</span><span class="special">);</span>
<span class="identifier">iterator_range</span><span class="special">&</span> <span class="identifier">advance_end</span><span class="special">(</span><span class="identifier">difference_type</span> <span class="identifier">n</span><span class="special">);</span>
<span class="keyword">bool</span> <span class="identifier">empty</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="comment">// for Random Access Range only:
-</span> <span class="identifier">reference</span> <span class="keyword">operator</span><span class="special">[](</span> <span class="identifier">difference_type</span> <span class="identifier">at</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
+ <span class="comment">// for Random Access Range only:</span>
+ <span class="identifier">reference</span> <span class="keyword">operator</span><span class="special">[](</span> <span class="identifier">difference_type</span> <span class="identifier">at</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
<span class="identifier">value_type</span> <span class="keyword">operator</span><span class="special">()(</span> <span class="identifier">difference_type</span> <span class="identifier">at</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
<span class="identifier">size_type</span> <span class="identifier">size</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
<span class="special">};</span>
-
- <span class="comment">// stream output
-</span> <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Traits</span> <span class="special">></span>
- <span class="identifier">std</span><span class="special">::</span><span class="identifier">basic_ostream</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span><span class="identifier">Traits</span><span class="special">>&</span>
+
+ <span class="comment">// stream output</span>
+ <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">Traits</span> <span class="special">></span>
+ <span class="identifier">std</span><span class="special">::</span><span class="identifier">basic_ostream</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span><span class="identifier">Traits</span><span class="special">>&</span>
<span class="keyword">operator</span><span class="special"><<(</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">basic_ostream</span><span class="special"><</span><span class="identifier">T</span><span class="special">,</span><span class="identifier">Traits</span><span class="special">>&</span> <span class="identifier">Os</span><span class="special">,</span>
<span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator</span><span class="special">>&</span> <span class="identifier">r</span> <span class="special">);</span>
- <span class="comment">// comparison
-</span> <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="special">></span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">==(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator</span><span class="special">>&</span> <span class="identifier">l</span><span class="special">,</span>
+ <span class="comment">// comparison</span>
+ <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="special">></span>
+ <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">==(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator</span><span class="special">>&</span> <span class="identifier">l</span><span class="special">,</span>
<span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator2</span><span class="special">>&</span> <span class="identifier">r</span> <span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">></span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">==(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator</span><span class="special">>&</span> <span class="identifier">l</span><span class="special">,</span>
+ <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">==(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator</span><span class="special">>&</span> <span class="identifier">l</span><span class="special">,</span>
<span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">></span>
@@ -118,11 +117,11 @@
<span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator</span><span class="special">>&</span> <span class="identifier">r</span> <span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="special">></span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">!=(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator</span><span class="special">>&</span> <span class="identifier">l</span><span class="special">,</span>
+ <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">!=(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator</span><span class="special">>&</span> <span class="identifier">l</span><span class="special">,</span>
<span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator2</span><span class="special">>&</span> <span class="identifier">r</span> <span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">></span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">!=(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator</span><span class="special">>&</span> <span class="identifier">l</span><span class="special">,</span>
+ <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special">!=(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator</span><span class="special">>&</span> <span class="identifier">l</span><span class="special">,</span>
<span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">></span>
@@ -130,23 +129,23 @@
<span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator</span><span class="special">>&</span> <span class="identifier">r</span> <span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator2</span> <span class="special">></span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special"><(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator</span><span class="special">>&</span> <span class="identifier">l</span><span class="special">,</span>
+ <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special"><(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator</span><span class="special">>&</span> <span class="identifier">l</span><span class="special">,</span>
<span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator2</span><span class="special">>&</span> <span class="identifier">r</span> <span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">></span>
- <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special"><(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator</span><span class="special">>&</span> <span class="identifier">l</span><span class="special">,</span>
+ <span class="keyword">bool</span> <span class="keyword">operator</span><span class="special"><(</span> <span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator</span><span class="special">>&</span> <span class="identifier">l</span><span class="special">,</span>
<span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">></span>
<span class="keyword">bool</span> <span class="keyword">operator</span><span class="special"><(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">l</span><span class="special">,</span>
<span class="keyword">const</span> <span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">ForwardTraversalIterator</span><span class="special">>&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="comment">// external construction
-</span> <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span> <span class="special">></span>
+
+ <span class="comment">// external construction</span>
+ <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span> <span class="special">></span>
<span class="identifier">iterator_range</span><span class="special"><</span> <span class="identifier">ForwardTraversalIterator</span> <span class="special">></span>
- <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">Begin</span><span class="special">,</span>
+ <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">Begin</span><span class="special">,</span>
<span class="identifier">ForwardTraversalIterator</span> <span class="identifier">End</span> <span class="special">);</span>
-
+
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">></span>
<span class="identifier">iterator_range</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span> <span class="special">></span>
<span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
@@ -154,25 +153,25 @@
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">></span>
<span class="identifier">iterator_range</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span> <span class="special">></span>
<span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
+
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">Range</span> <span class="special">></span>
<span class="identifier">iterator_range</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">Range</span><span class="special">>::</span><span class="identifier">type</span> <span class="special">></span>
<span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">Range</span><span class="special">&</span> <span class="identifier">r</span><span class="special">,</span>
<span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special"><</span><span class="identifier">Range</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">advance_begin</span><span class="special">,</span>
<span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special"><</span><span class="identifier">Range</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">advance_end</span> <span class="special">);</span>
-
+
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">Range</span> <span class="special">></span>
<span class="identifier">iterator_range</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">>::</span><span class="identifier">type</span> <span class="special">></span>
- <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range</span><span class="special">&</span> <span class="identifier">r</span><span class="special">,</span>
+ <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range</span><span class="special">&</span> <span class="identifier">r</span><span class="special">,</span>
<span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">advance_begin</span><span class="special">,</span>
<span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">advance_end</span> <span class="special">);</span>
-
- <span class="comment">// convenience
-</span> <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">Sequence</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">></span>
+
+ <span class="comment">// convenience</span>
+ <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">Sequence</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">></span>
<span class="identifier">Sequence</span> <span class="identifier">copy_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
-<span class="special">}</span> <span class="comment">// namespace 'boost'
-</span></pre>
+
+<span class="special">}</span> <span class="comment">// namespace 'boost'</span>
+</pre>
<p>
</p>
<p>
@@ -187,9 +186,9 @@
are comparable; for example when we are dealing with const and non-const
iterators from the same container.
</p>
-<a name="range.reference.utilities.iterator_range.details_member_functions"></a><h5>
-<a name="id761507"></a>
- <a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.details_member_functions">Details
+<h5>
+<a name="range.reference.utilities.iterator_range.h1"></a>
+ <span><a name="range.reference.utilities.iterator_range.details_member_functions"></a></span><a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.details_member_functions">Details
member functions</a>
</h5>
<p>
@@ -206,9 +205,9 @@
<span class="identifier">end</span><span class="special">()</span>
<span class="special">==</span> <span class="identifier">r</span><span class="special">.</span><span class="identifier">end</span><span class="special">();</span></code>
</p></blockquote></div>
-<a name="range.reference.utilities.iterator_range.details_functions"></a><h5>
-<a name="id761741"></a>
- <a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.details_functions">Details
+<h5>
+<a name="range.reference.utilities.iterator_range.h2"></a>
+ <span><a name="range.reference.utilities.iterator_range.details_functions"></a></span><a class="link" href="iterator_range.html#range.reference.utilities.iterator_range.details_functions">Details
functions</a>
</h5>
<p>
@@ -238,10 +237,9 @@
<span class="identifier">begin</span><span class="special">(</span><span class="identifier">l</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">l</span><span class="special">),</span> <span class="identifier">begin</span><span class="special">(</span><span class="identifier">r</span><span class="special">),</span> <span class="identifier">end</span><span class="special">(</span><span class="identifier">r</span><span class="special">)</span> <span class="special">);</span></code>
</p></blockquote></div>
<p>
-
</p>
<pre class="programlisting"><span class="identifier">iterator_range</span> <span class="identifier">make_iterator_range</span><span class="special">(</span> <span class="identifier">Range</span><span class="special">&</span> <span class="identifier">r</span><span class="special">,</span>
- <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special"><</span><span class="identifier">Range</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">advance_begin</span><span class="special">,</span>
+ <span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special"><</span><span class="identifier">Range</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">advance_begin</span><span class="special">,</span>
<span class="keyword">typename</span> <span class="identifier">range_difference</span><span class="special"><</span><span class="identifier">Range</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">advance_end</span> <span class="special">);</span>
</pre>
<p>
@@ -250,7 +248,6 @@
<span class="emphasis"><em><span class="bold"><strong>Effects:</strong></span></em></span>
</p></blockquote></div>
<p>
-
</p>
<pre class="programlisting"><span class="identifier">iterator</span> <span class="identifier">new_begin</span> <span class="special">=</span> <span class="identifier">begin</span><span class="special">(</span> <span class="identifier">r</span> <span class="special">),</span>
<span class="identifier">iterator</span> <span class="identifier">new_end</span> <span class="special">=</span> <span class="identifier">end</span><span class="special">(</span> <span class="identifier">r</span> <span class="special">);</span>
@@ -271,7 +268,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/utilities/join.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/utilities/join.html (original)
+++ branches/release/libs/range/doc/html/range/reference/utilities/join.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="sub_range.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../extending.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_utilities_join">
<div class="titlepage"><div><div><h4 class="title">
<a name="range.reference.utilities.join"></a><a class="link" href="join.html" title="Function join">Function join</a>
</h4></div></div></div>
@@ -38,12 +38,11 @@
Note that the joined range incurs a performance cost due to the need to
check if the end of a range has been reached internally during traversal.
</p>
-<a name="range.reference.utilities.join.synposis"></a><h5>
-<a name="id764138"></a>
- <a class="link" href="join.html#range.reference.utilities.join.synposis">Synposis</a>
+<h5>
+<a name="range.reference.utilities.join.h0"></a>
+ <span><a name="range.reference.utilities.join.synposis"></a></span><a class="link" href="join.html#range.reference.utilities.join.synposis">Synposis</a>
</h5>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">SinglePassRange2</span><span class="special">></span>
<span class="identifier">joined_range</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">SinglePassRange1</span><span class="special">,</span> <span class="keyword">const</span> <span class="identifier">SinglePassRange2</span><span class="special">></span>
@@ -107,9 +106,9 @@
and <code class="computeroutput"><span class="identifier">rng2</span></code>.
</li>
</ul></div>
-<a name="range.reference.utilities.join.example"></a><h5>
-<a name="id764973"></a>
- <a class="link" href="join.html#range.reference.utilities.join.example">Example</a>
+<h5>
+<a name="range.reference.utilities.join.h1"></a>
+ <span><a name="range.reference.utilities.join.example"></a></span><a class="link" href="join.html#range.reference.utilities.join.example">Example</a>
</h5>
<p>
The expression <code class="computeroutput"><span class="identifier">join</span><span class="special">(</span><span class="identifier">irange</span><span class="special">(</span><span class="number">0</span><span class="special">,</span><span class="number">5</span><span class="special">),</span> <span class="identifier">irange</span><span class="special">(</span><span class="number">5</span><span class="special">,</span><span class="number">10</span><span class="special">))</span></code> would
@@ -118,7 +117,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/reference/utilities/sub_range.html
==============================================================================
--- branches/release/libs/range/doc/html/range/reference/utilities/sub_range.html (original)
+++ branches/release/libs/range/doc/html/range/reference/utilities/sub_range.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="iterator_range.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../utilities.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="join.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_reference_utilities_sub_range">
<div class="titlepage"><div><div><h4 class="title">
<a name="range.reference.utilities.sub_range"></a><a class="link" href="sub_range.html" title="Class sub_range">Class <code class="computeroutput"><span class="identifier">sub_range</span></code></a>
</h4></div></div></div>
@@ -34,60 +34,59 @@
since it knows what a corresponding <code class="computeroutput"><span class="identifier">const_iterator</span></code>
is.
</p>
-<a name="range.reference.utilities.sub_range.synopsis"></a><h5>
-<a name="id762873"></a>
- <a class="link" href="sub_range.html#range.reference.utilities.sub_range.synopsis">Synopsis</a>
+<h5>
+<a name="range.reference.utilities.sub_range.h0"></a>
+ <span><a name="range.reference.utilities.sub_range.synopsis"></a></span><a class="link" href="sub_range.html#range.reference.utilities.sub_range.synopsis">Synopsis</a>
</h5>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span>
<span class="special">{</span>
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardRange</span> <span class="special">></span>
<span class="keyword">class</span> <span class="identifier">sub_range</span> <span class="special">:</span> <span class="keyword">public</span> <span class="identifier">iterator_range</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span> <span class="special">></span>
<span class="special">{</span>
- <span class="keyword">public</span><span class="special">:</span>
+ <span class="keyword">public</span><span class="special">:</span>
<span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">iterator</span><span class="special">;</span>
<span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">ForwardRange</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">const_iterator</span><span class="special">;</span>
<span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">iterator_difference</span><span class="special"><</span><span class="identifier">iterator</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">difference_type</span><span class="special">;</span>
-
- <span class="keyword">public</span><span class="special">:</span> <span class="comment">// construction, assignment
-</span> <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span> <span class="special">></span>
+
+ <span class="keyword">public</span><span class="special">:</span> <span class="comment">// construction, assignment</span>
+ <span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardTraversalIterator</span> <span class="special">></span>
<span class="identifier">sub_range</span><span class="special">(</span> <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">Begin</span><span class="special">,</span> <span class="identifier">ForwardTraversalIterator</span> <span class="identifier">End</span> <span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span> <span class="special">></span>
<span class="identifier">sub_range</span><span class="special">(</span> <span class="identifier">ForwardRange2</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
+
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span> <span class="special">></span>
<span class="identifier">sub_range</span><span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range2</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
+
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span> <span class="special">></span>
<span class="identifier">sub_range</span><span class="special">&</span> <span class="keyword">operator</span><span class="special">=(</span> <span class="identifier">ForwardRange2</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardRange2</span> <span class="special">></span>
- <span class="identifier">sub_range</span><span class="special">&</span> <span class="keyword">operator</span><span class="special">=(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
-
- <span class="keyword">public</span><span class="special">:</span> <span class="comment">// Forward Range functions
-</span> <span class="identifier">iterator</span> <span class="identifier">begin</span><span class="special">();</span>
+ <span class="identifier">sub_range</span><span class="special">&</span> <span class="keyword">operator</span><span class="special">=(</span> <span class="keyword">const</span> <span class="identifier">ForwardRange2</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
+
+ <span class="keyword">public</span><span class="special">:</span> <span class="comment">// Forward Range functions</span>
+ <span class="identifier">iterator</span> <span class="identifier">begin</span><span class="special">();</span>
<span class="identifier">const_iterator</span> <span class="identifier">begin</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
<span class="identifier">iterator</span> <span class="identifier">end</span><span class="special">();</span>
- <span class="identifier">const_iterator</span> <span class="identifier">end</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
-
- <span class="keyword">public</span><span class="special">:</span> <span class="comment">// convenience
-</span> <span class="identifier">value_type</span><span class="special">&</span> <span class="identifier">front</span><span class="special">();</span>
+ <span class="identifier">const_iterator</span> <span class="identifier">end</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
+
+ <span class="keyword">public</span><span class="special">:</span> <span class="comment">// convenience</span>
+ <span class="identifier">value_type</span><span class="special">&</span> <span class="identifier">front</span><span class="special">();</span>
<span class="keyword">const</span> <span class="identifier">value_type</span><span class="special">&</span> <span class="identifier">front</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
<span class="identifier">value_type</span><span class="special">&</span> <span class="identifier">back</span><span class="special">();</span>
<span class="keyword">const</span> <span class="identifier">value_type</span><span class="special">&</span> <span class="identifier">back</span><span class="special">()</span> <span class="keyword">const</span><span class="special">;</span>
- <span class="comment">// for Random Access Range only:
-</span> <span class="identifier">value_type</span><span class="special">&</span> <span class="keyword">operator</span><span class="special">[](</span> <span class="identifier">size_type</span> <span class="identifier">at</span> <span class="special">);</span>
+ <span class="comment">// for Random Access Range only:</span>
+ <span class="identifier">value_type</span><span class="special">&</span> <span class="keyword">operator</span><span class="special">[](</span> <span class="identifier">size_type</span> <span class="identifier">at</span> <span class="special">);</span>
<span class="keyword">const</span> <span class="identifier">value_type</span><span class="special">&</span> <span class="keyword">operator</span><span class="special">[](</span> <span class="identifier">size_type</span> <span class="identifier">at</span> <span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
-
+
<span class="keyword">public</span><span class="special">:</span>
- <span class="comment">// rest of interface inherited from iterator_range
-</span> <span class="special">};</span>
-
-<span class="special">}</span> <span class="comment">// namespace 'boost'
-</span></pre>
+ <span class="comment">// rest of interface inherited from iterator_range</span>
+ <span class="special">};</span>
+
+<span class="special">}</span> <span class="comment">// namespace 'boost'</span>
+</pre>
<p>
</p>
<p>
@@ -98,7 +97,6 @@
<code class="computeroutput"><span class="identifier">sub_range</span></code>
</p>
<p>
-
</p>
<pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span> <span class="identifier">str</span><span class="special">(</span><span class="string">"hello"</span><span class="special">);</span>
<span class="identifier">iterator_range</span><span class="special"><</span><span class="identifier">std</span><span class="special">::</span><span class="identifier">string</span><span class="special">::</span><span class="identifier">iterator</span><span class="special">></span> <span class="identifier">ir</span> <span class="special">=</span> <span class="identifier">find_first</span><span class="special">(</span> <span class="identifier">str</span><span class="special">,</span> <span class="string">"ll"</span> <span class="special">);</span>
@@ -109,7 +107,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/style_guide.html
==============================================================================
--- branches/release/libs/range/doc/html/range/style_guide.html (original)
+++ branches/release/libs/range/doc/html/range/style_guide.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="reference/extending/method_3/method_3_2.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="headers.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_style_guide">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="range.style_guide"></a><a class="link" href="style_guide.html" title="Terminology and style guidelines">Terminology and style guidelines</a>
</h2></div></div></div>
@@ -39,43 +39,41 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" type="disc">
<li class="listitem">
-<p class="simpara">
<span class="bold"><strong><span class="emphasis"><em>Value access</em></span></strong></span> category:
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="circle">
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
<li class="listitem">
- Readable Range
- </li>
+ Readable Range
+ </li>
<li class="listitem">
- Writeable Range
- </li>
+ Writeable Range
+ </li>
<li class="listitem">
- Swappable Range
- </li>
+ Swappable Range
+ </li>
<li class="listitem">
- Lvalue Range
- </li>
+ Lvalue Range
+ </li>
</ul></div>
-</li>
+ </li>
<li class="listitem">
-<p class="simpara">
<span class="bold"><strong><span class="emphasis"><em>Traversal</em></span></strong></span> category:
- </p>
-<div class="itemizedlist"><ul class="itemizedlist" type="circle">
+ <div class="itemizedlist"><ul class="itemizedlist" type="circle">
<li class="listitem">
- <a class="link" href="concepts/single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
- </li>
+ <a class="link" href="concepts/single_pass_range.html" title="Single Pass Range">Single Pass Range</a>
+ </li>
<li class="listitem">
- <a class="link" href="concepts/forward_range.html" title="Forward Range">Forward Range</a>
- </li>
+ <a class="link" href="concepts/forward_range.html" title="Forward Range">Forward Range</a>
+ </li>
<li class="listitem">
- <a class="link" href="concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional Range</a>
- </li>
+ <a class="link" href="concepts/bidirectional_range.html" title="Bidirectional Range">Bidirectional
+ Range</a>
+ </li>
<li class="listitem">
- <a class="link" href="concepts/random_access_range.html" title="Random Access Range">Random Access Range</a>
- </li>
+ <a class="link" href="concepts/random_access_range.html" title="Random Access Range">Random Access
+ Range</a>
+ </li>
</ul></div>
-</li>
+ </li>
</ul></div>
<p>
Notice how we have used the categories from the <a href="../../../../../libs/iterator/doc/new-iter-concepts.html" target="_top">new
@@ -117,7 +115,6 @@
must be exactly defined. The iterator-based version looks like this:
</p>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">RandomAccessTraversalReadableWritableIterator</span> <span class="special">></span>
<span class="keyword">void</span> <span class="identifier">sort</span><span class="special">(</span> <span class="identifier">RandomAccessTraversalReadableWritableIterator</span> <span class="identifier">first</span><span class="special">,</span>
@@ -129,7 +126,6 @@
For ranges the interface becomes
</p>
<p>
-
</p>
<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">RandomAccessReadableWritableRange</span> <span class="special">></span>
<span class="keyword">void</span> <span class="identifier">sort</span><span class="special">(</span> <span class="identifier">RandomAccessReadableWritableRange</span><span class="special">&</span> <span class="identifier">r</span> <span class="special">);</span>
@@ -139,7 +135,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/upgrade.html
==============================================================================
--- branches/release/libs/range/doc/html/range/upgrade.html (original)
+++ branches/release/libs/range/doc/html/range/upgrade.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -7,7 +7,7 @@
<link rel="home" href="../index.html" title="Chapter 1. Range 2.0">
<link rel="up" href="../index.html" title="Chapter 1. Range 2.0">
<link rel="prev" href="mfc_atl/references.html" title="References">
-<link rel="next" href="upgrade/upgrade_from_1_45.html" title="Upgrade from version 1.45">
+<link rel="next" href="upgrade/upgrade_from_1_49.html" title="Upgrade from version 1.49">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -20,13 +20,15 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="mfc_atl/references.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade/upgrade_from_1_45.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="mfc_atl/references.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade/upgrade_from_1_49.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_upgrade">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="range.upgrade"></a><a class="link" href="upgrade.html" title="Upgrade version of Boost.Range">Upgrade version of Boost.Range</a>
</h2></div></div></div>
<div class="toc"><dl>
+<dt><span class="section"><a href="upgrade/upgrade_from_1_49.html">Upgrade from version
+ 1.49</a></span></dt>
<dt><span class="section"><a href="upgrade/upgrade_from_1_45.html">Upgrade from version
1.45</a></span></dt>
<dt><span class="section"><a href="upgrade/upgrade_from_1_42.html">Upgrade from version
@@ -37,7 +39,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
@@ -45,7 +48,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="mfc_atl/references.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade/upgrade_from_1_45.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="mfc_atl/references.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade/upgrade_from_1_49.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/libs/range/doc/html/range/upgrade/upgrade_from_1_34.html
==============================================================================
--- branches/release/libs/range/doc/html/range/upgrade/upgrade_from_1_34.html (original)
+++ branches/release/libs/range/doc/html/range/upgrade/upgrade_from_1_34.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="upgrade_from_1_42.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../portability.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_upgrade_upgrade_from_1_34">
<div class="titlepage"><div><div><h3 class="title">
<a name="range.upgrade.upgrade_from_1_34"></a><a class="link" href="upgrade_from_1_34.html" title="Upgrade from version 1.34">Upgrade from version
1.34</a>
@@ -64,7 +64,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/upgrade/upgrade_from_1_42.html
==============================================================================
--- branches/release/libs/range/doc/html/range/upgrade/upgrade_from_1_42.html (original)
+++ branches/release/libs/range/doc/html/range/upgrade/upgrade_from_1_42.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -22,7 +22,7 @@
<div class="spirit-nav">
<a accesskey="p" href="upgrade_from_1_45.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade_from_1_34.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_upgrade_upgrade_from_1_42">
<div class="titlepage"><div><div><h3 class="title">
<a name="range.upgrade.upgrade_from_1_42"></a><a class="link" href="upgrade_from_1_42.html" title="Upgrade from version 1.42">Upgrade from version
1.42</a>
@@ -54,7 +54,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
Modified: branches/release/libs/range/doc/html/range/upgrade/upgrade_from_1_45.html
==============================================================================
--- branches/release/libs/range/doc/html/range/upgrade/upgrade_from_1_45.html (original)
+++ branches/release/libs/range/doc/html/range/upgrade/upgrade_from_1_45.html 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -6,7 +6,7 @@
<meta name="generator" content="DocBook XSL Stylesheets V1.75.2">
<link rel="home" href="../../index.html" title="Chapter 1. Range 2.0">
<link rel="up" href="../upgrade.html" title="Upgrade version of Boost.Range">
-<link rel="prev" href="../upgrade.html" title="Upgrade version of Boost.Range">
+<link rel="prev" href="upgrade_from_1_49.html" title="Upgrade from version 1.49">
<link rel="next" href="upgrade_from_1_42.html" title="Upgrade from version 1.42">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -20,9 +20,9 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../upgrade.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade_from_1_42.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="upgrade_from_1_49.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade_from_1_42.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
-<div class="section">
+<div class="section range_upgrade_upgrade_from_1_45">
<div class="titlepage"><div><div><h3 class="title">
<a name="range.upgrade.upgrade_from_1_45"></a><a class="link" href="upgrade_from_1_45.html" title="Upgrade from version 1.45">Upgrade from version
1.45</a>
@@ -50,7 +50,8 @@
</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>
+<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 http://www.boost.org/LICENSE_1_0.txt)
</p>
@@ -58,7 +59,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="../upgrade.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade_from_1_42.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
+<a accesskey="p" href="upgrade_from_1_49.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../upgrade.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="upgrade_from_1_42.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
Modified: branches/release/libs/range/doc/reference/adaptors/type_erased.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/adaptors/type_erased.qbk (original)
+++ branches/release/libs/range/doc/reference/adaptors/type_erased.qbk 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -18,7 +18,7 @@
* [*Template parameters:]
* `Value` is the `value_type` for the `any_range`. If this is set to boost::use_default, `Value` will be calculated from the
range type when the adaptor is applied.
- * `Traversal` is the tag used to identify the traversal of the resultant range. Frequently it is desireable to set a traversal category lower than the source container or range to maximize the number of ranges that can convert to the `any_range`. If this is left as boost::use_default then `Traversal` will be `typename boost::iterator_traversal<boost::range_iterator<Rng>::type>::type`
+ * `Traversal` is the tag used to identify the traversal of the resultant range. Frequently it is desirable to set a traversal category lower than the source container or range to maximize the number of ranges that can convert to the `any_range`. If this is left as boost::use_default then `Traversal` will be `typename boost::iterator_traversal<boost::range_iterator<Rng>::type>::type`
* `Reference` is the `reference` for the `any_range`. `boost::use_default` will equate to `typename range_reference<Rng>::type`.
* `Difference` is the `difference_type` for the any_range. `boost::use_default` will equate to `typename boost::range_difference<Rng>::type`
* `Buffer` is the storage used to allocate the underlying iterator wrappers. This can typically be ignored, but is available as a template parameter for customization. Buffer must be a model of the `AnyIteratorBufferConcept`.
Modified: branches/release/libs/range/doc/reference/algorithm/fill_n.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/fill_n.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/fill_n.qbk 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -14,7 +14,7 @@
[heading Description]
-`fill_n` assigns the value `val` to `n` elements in the range `rng` begining with `boost::begin(rng)`.
+`fill_n` assigns the value `val` to `n` elements in the range `rng` beginning with `boost::begin(rng)`.
[heading Definition]
Modified: branches/release/libs/range/doc/reference/algorithm/lexicographical_compare.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/lexicographical_compare.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/lexicographical_compare.qbk 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -41,7 +41,7 @@
* `SinglePassRange2` is a model of the __single_pass_range__ Concept.
* `SinglePassRange1`'s value type is a model of the `LessThanComparableConcept`.
* `SinglePassRange2`'s value type is a model of the `LessThanComparableConcept`.
-* Let `x` be an object of `SinglePassRange1`'s value type. Let `y` be an obect of `SinglePassRange2`'s value type. `x < y` must be valid. `y < x` must be valid.
+* Let `x` be an object of `SinglePassRange1`'s value type. Let `y` be an object of `SinglePassRange2`'s value type. `x < y` must be valid. `y < x` must be valid.
[*For the predicate versions of lexicographical_compare:]
Modified: branches/release/libs/range/doc/reference/algorithm/mismatch.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/algorithm/mismatch.qbk (original)
+++ branches/release/libs/range/doc/reference/algorithm/mismatch.qbk 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -80,7 +80,7 @@
[heading Description]
-`mismatch` finds the first position where the correseponding elements from the two ranges `rng1` and `rng2` are not equal.
+`mismatch` finds the first position where the corresponding elements from the two ranges `rng1` and `rng2` are not equal.
Equality is determined by `operator==` for non-predicate versions of `mismatch`, and by satisfying `pred` in the predicate versions.
Modified: branches/release/libs/range/doc/reference/numeric/accumulate.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/numeric/accumulate.qbk (original)
+++ branches/release/libs/range/doc/reference/numeric/accumulate.qbk 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -42,7 +42,7 @@
# `SinglePassRange` is a model of the __single_pass_range__ Concept.
# `Value` is a model of the `AssignableConcept`.
-# An `operator+` is defined for a left-hand operand of type `Value` and a right-hand operance of the `SinglePassRange` value type.
+# An `operator+` is defined for a left-hand operand of type `Value` and a right-hand operand of the `SinglePassRange` value type.
# The return type of the above operator is convertible to `Value`.
[heading For the second version]
Modified: branches/release/libs/range/doc/reference/utilities.qbk
==============================================================================
--- branches/release/libs/range/doc/reference/utilities.qbk (original)
+++ branches/release/libs/range/doc/reference/utilities.qbk 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -21,7 +21,7 @@
If the template argument is not a model of __forward_traversal_iterator__, one can still use a subset of the interface. In particular, `size()` requires Random Access Traversal Iterators whereas `empty()` only requires Single Pass Iterators.
-Recall that many default constructed iterators are [*/singular/] and hence can only be assigned, but not compared or incremented or anything. However, if one creates a default constructed `iterator_range`, then one can still call all its member functions. This design decision avoids the `iterator_range` imposing limitations upon ranges of iterators that are not singular. Any singularity limitation is simply propogated from the underlying iterator type.
+Recall that many default constructed iterators are [*/singular/] and hence can only be assigned, but not compared or incremented or anything. However, if one creates a default constructed `iterator_range`, then one can still call all its member functions. This design decision avoids the `iterator_range` imposing limitations upon ranges of iterators that are not singular. Any singularity limitation is simply propagated from the underlying iterator type.
[h4 Synopsis]
Modified: branches/release/libs/range/doc/upgrade.qbk
==============================================================================
--- branches/release/libs/range/doc/upgrade.qbk (original)
+++ branches/release/libs/range/doc/upgrade.qbk 2012-12-21 03:44:32 EST (Fri, 21 Dec 2012)
@@ -11,6 +11,8 @@
otherwise range_size<Rng>::type is used. This is the distance type promoted to
an unsigned type.
+[endsect]
+
[section:upgrade_from_1_45 Upgrade from version 1.45]
# __size__ in addition to supporting __random_access_range__ now also supports extensibility via calls to the unqualified `range_calculate_size(rng)` function.
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk