diff --git a/doc/history_ack.qbk b/doc/history_ack.qbk index 545b3ab..73ce9e8 100644 --- a/doc/history_ack.qbk +++ b/doc/history_ack.qbk @@ -26,11 +26,18 @@ the result of a merge of all of the RangeEx features into Boost.Range. There were an enormous number of very significant contributors through all stages of this library. +Prior to Boost.RangeEx there had been a number of Range library implementations, +these include library implementations by Eric Niebler, Adobe, +Shunsuke Sogame etc. Eric Niebler contributed the Range Adaptor idea which is +arguably the single biggest innovation in this library. Inevitably a great deal +of commonality evolved in each of these libraries, but a considerable amount +of effort was expended to learn from all of the divergent techniques. + The people in the following list all made contributions in the form of reviews, user feedback, design suggestions, or defect detection: * Thorsten Ottosen: review management, design advice, documentation feedback -* Eric Niebler: feedback +* Eric Niebler: early implementation, and review feedback * Joel de Guzman: review * Mathias Gaunard: review * David Abrahams: implementation advice diff --git a/doc/html/index.html b/doc/html/index.html index c6eaa25..8426ec8 100644 --- a/doc/html/index.html +++ b/doc/html/index.html @@ -2,8 +2,8 @@ Chapter 1. Range 2.0 - - + + @@ -11,14 +11,14 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-
Next
-
+
Next
+

Chapter 1. Range 2.0

@@ -29,8 +29,8 @@ Neil Groves

Copyright © 2003 -2010 Thorsten Ottosen, Neil Groves

-
-

+

+

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)

@@ -142,10 +142,10 @@

- +

Last revised: April 28, 2010 at 19:23:17 GMT

Last revised: July 13, 2010 at 18:40:56 GMT
-
Next
+
Next
diff --git a/doc/html/range/concepts.html b/doc/html/range/concepts.html index c384122..b071de6 100644 --- a/doc/html/range/concepts.html +++ b/doc/html/range/concepts.html @@ -2,8 +2,8 @@ Range Concepts - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -45,7 +45,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/concepts/bidirectional_range.html b/doc/html/range/concepts/bidirectional_range.html index 5bf3493..fdd9787 100644 --- a/doc/html/range/concepts/bidirectional_range.html +++ b/doc/html/range/concepts/bidirectional_range.html @@ -2,8 +2,8 @@ Bidirectional Range - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Notation
@@ -65,7 +65,7 @@
- + Description

@@ -75,7 +75,7 @@ Traversal Iterator.

- + Refinement of
@@ -83,7 +83,7 @@ Forward Range

- + Associated types
@@ -136,7 +136,7 @@
- + Valid expressions
@@ -221,7 +221,7 @@
- + Complexity guarantees
@@ -232,7 +232,7 @@ Forward Range.

- + Invariants
@@ -272,7 +272,7 @@
- + See also

@@ -294,7 +294,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/concepts/concept_checking.html b/doc/html/range/concepts/concept_checking.html index 9155507..18cabf4 100644 --- a/doc/html/range/concepts/concept_checking.html +++ b/doc/html/range/concepts/concept_checking.html @@ -2,8 +2,8 @@ Concept Checking - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -62,24 +62,24 @@

- + See also

@@ -102,7 +102,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/concepts/forward_range.html b/doc/html/range/concepts/forward_range.html index e9777dc..6d59f7b 100644 --- a/doc/html/range/concepts/forward_range.html +++ b/doc/html/range/concepts/forward_range.html @@ -2,8 +2,8 @@ Forward Range - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Notation
@@ -65,7 +65,7 @@
- + Description

@@ -73,14 +73,14 @@ Traversal Iterator.

- + Refinement of

Single Pass Range

- + Associated types
@@ -132,7 +132,7 @@
- + See also

@@ -154,7 +154,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/concepts/overview.html b/doc/html/range/concepts/overview.html index 7cd19e8..0fa9643 100644 --- a/doc/html/range/concepts/overview.html +++ b/doc/html/range/concepts/overview.html @@ -2,8 +2,8 @@ Overview - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -41,11 +41,11 @@

  • - own the elements that can be accessed through it, -
    • + own the elements that can be accessed through it, +
  • - have copy semantics, -
    • + have copy semantics, +

Because of the second requirement, a Range object must be passed by (const @@ -73,7 +73,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/concepts/random_access_range.html b/doc/html/range/concepts/random_access_range.html index c54a961..ba2437f 100644 --- a/doc/html/range/concepts/random_access_range.html +++ b/doc/html/range/concepts/random_access_range.html @@ -2,8 +2,8 @@ Random Access Range - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Description

@@ -35,7 +35,7 @@ Access Traversal Iterator.

- + Refinement of
@@ -43,7 +43,7 @@ Bidirectional Range

- + Valid expressions
@@ -89,7 +89,7 @@
- + Expression semantics
@@ -139,7 +139,7 @@
- + Complexity guarantees
@@ -147,7 +147,7 @@ boost::size(a) completes in amortized constant time.

- + Invariants
@@ -181,7 +181,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/concepts/single_pass_range.html b/doc/html/range/concepts/single_pass_range.html index eeca3f7..f44ebd1 100644 --- a/doc/html/range/concepts/single_pass_range.html +++ b/doc/html/range/concepts/single_pass_range.html @@ -2,8 +2,8 @@ Single Pass Range - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Notation
@@ -65,7 +65,7 @@
- + Description

@@ -73,7 +73,7 @@ Pass Iterator.

- + Associated types
@@ -126,7 +126,7 @@
- + Valid expressions
@@ -198,7 +198,7 @@
- + Expression semantics
@@ -266,7 +266,7 @@
- + Complexity guarantees
@@ -276,7 +276,7 @@ constant time.

- + Invariants
@@ -316,7 +316,7 @@
- + See also

@@ -344,7 +344,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/examples.html b/doc/html/range/examples.html index 4be5b97..14aad79 100644 --- a/doc/html/range/examples.html +++ b/doc/html/range/examples.html @@ -2,8 +2,8 @@ Examples - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -31,19 +31,31 @@

@@ -56,7 +68,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/faq.html b/doc/html/range/faq.html index cb21529..6a689f1 100644 --- a/doc/html/range/faq.html +++ b/doc/html/range/faq.html @@ -2,8 +2,8 @@ FAQ - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+

FAQ

@@ -31,84 +31,47 @@ and range_const_iterator<C>::type for std::pair<iterator, iterator>?

-
-

-

-

- In general it is not possible nor desirable to find a corresponding const_iterator. When it is possible to - come up with one, the client might choose to construct a std::pair<const_iterator,const_iterator> - object. -

-

-

-
-
-

-

-

- Note that an iterator_range is somewhat more - convenient than a pair - and that a sub_range does propagate const-ness. -

-

-

-
+

+ In general it is not possible nor desirable to find a corresponding const_iterator. When it is possible to + come up with one, the client might choose to construct a std::pair<const_iterator,const_iterator> object. +

+

+ Note that an iterator_range is somewhat more + convenient than a pair and + that a sub_range does propagate const-ness. +

2. Why is there not supplied more types or more functions?

-
-

-

-

- The library has been kept small because its current interface will serve - most purposes. If and when a genuine need arises for more functionality, - it can be implemented. -

-

-

-
+

+ The library has been kept small because its current interface will serve + most purposes. If and when a genuine need arises for more functionality, + it can be implemented. +

3. How should I implement generic algorithms for ranges?

-
-

-

-

- One should always start with a generic algorithm that takes two iterators - (or more) as input. Then use Boost.Range to build handier versions on top - of the iterator based algorithm. Please notice that once the range version - of the algorithm is done, it makes sense not to expose the iterator version - in the public interface. -

-

-

-
+

+ One should always start with a generic algorithm that takes two iterators + (or more) as input. Then use Boost.Range to build handier versions on top + of the iterator based algorithm. Please notice that once the range version + of the algorithm is done, it makes sense not to expose the iterator version + in the public interface. +

4. Why is there no Incrementable Range concept?

-
-

-

-

- Even though we speak of incrementable iterators, it would not make much - sense for ranges; for example, we cannot determine the size and emptiness - of a range since we cannot even compare its iterators. -

-

-

-
-
-

-

-

- Note also that incrementable iterators are derived from output iterators - and so there exist no output range. -

-

-

-
+

+ Even though we speak of incrementable iterators, it would not make much sense + for ranges; for example, we cannot determine the size and emptiness of a + range since we cannot even compare its iterators. +

+

+ Note also that incrementable iterators are derived from output iterators + and so there exist no output range. +

@@ -120,7 +83,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/history_ack.html b/doc/html/range/history_ack.html index 7376fd8..e884812 100644 --- a/doc/html/range/history_ack.html +++ b/doc/html/range/history_ack.html @@ -2,8 +2,8 @@ History and Acknowledgement - - + + @@ -12,21 +12,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHome +PrevUpHome
-
+

- + Version 1 - before Boost 1.43

@@ -60,26 +60,26 @@

  • - Pavol Droba for help with documentation and implementation -
    • + Pavol Droba for help with documentation and implementation +
  • - Pavel Vozenilek for help with porting the library -
    • + Pavel Vozenilek for help with porting the library +
  • - Jonathan Turkanis and John Torjo for help with documentation -
    • + Jonathan Turkanis and John Torjo for help with documentation +
  • - Hartmut Kaiser for being review manager -
    • + 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 sa possible) to vc6 and vc7. +

The concept checks and their documentation was provided by Daniel Walker.

- + Version 2 - Boost 1.43 and beyond

@@ -91,41 +91,49 @@ There were an enormous number of very significant contributors through all stages of this library.

+

+ Prior to Boost.RangeEx there had been a number of Range library implementations, + these include library implementations by Eric Niebler, Adobe, Shunsuke Sogame + etc. Eric Niebler contributed the Range Adaptor idea which is arguably the + single biggest innovation in this library. Inevitably a great deal of commonality + evolved in each of these libraries, but a considerable amount of effort was + expended to learn from all of the divergent techniques. +

The people in the following list all made contributions in the form of reviews, user feedback, design suggestions, or defect detection:

  • - Thorsten Ottosen: review management, design advice, documentation feedback -
    • + Thorsten Ottosen: review management, design advice, documentation feedback +
  • - Eric Niebler: feedback -
    • + Eric Niebler: early implementation, and review feedback +
  • - Joel de Guzman: review -
    • + Joel de Guzman: review +
  • - Mathias Gaunard: review -
    • + Mathias Gaunard: review +
  • - David Abrahams: implementation advice -
    • + David Abrahams: implementation advice +
  • - Robert Jones: defect reports, usage feedback -
    • + Robert Jones: defect reports, usage feedback +
  • - Sean Parent: contributed experience from the Adobe range library -
    • + Sean Parent: contributed experience from the Adobe range library +
  • - Arno Schoedl: implementations, and review -
    • + Arno Schoedl: implementations, and review +
  • - Rogier van Dalen: review -
    • + Rogier van Dalen: review +
  • - Vincente Botet: review, documentation feedback -
    • + Vincente Botet: review, documentation feedback +

Regardless of how I write this section it will never truly fairly capture the @@ -142,7 +150,7 @@

-PrevUpHome +PrevUpHome
diff --git a/doc/html/range/introduction.html b/doc/html/range/introduction.html index 425f7c0..7d24ba6 100644 --- a/doc/html/range/introduction.html +++ b/doc/html/range/introduction.html @@ -2,8 +2,8 @@ Introduction - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -59,18 +59,18 @@

  • - simpler implementation and specification of generic range algorithms -
    • + simpler implementation and specification of generic range algorithms +
  • - more flexible, compact and maintainable client code -
    • + more flexible, compact and maintainable client code +
  • - safe use of built-in arrays (for legacy code; why else would you use built-in - arrays?) -
    • + safe use of built-in arrays (for legacy code; why else would you use built-in + arrays?) +

- + Example - Iterate over the values in a map

@@ -84,7 +84,7 @@

- + Example - Iterate over the keys in a map

@@ -98,7 +98,7 @@

- + Example - Push the even values from a map in reverse order into the container target

@@ -123,7 +123,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/library_headers.html b/doc/html/range/library_headers.html index 0e06413..93a048f 100644 --- a/doc/html/range/library_headers.html +++ b/doc/html/range/library_headers.html @@ -2,8 +2,8 @@ Library Headers - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -44,7 +44,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/library_headers/adaptors.html b/doc/html/range/library_headers/adaptors.html index f8810a4..d6948ea 100644 --- a/doc/html/range/library_headers/adaptors.html +++ b/doc/html/range/library_headers/adaptors.html @@ -2,8 +2,8 @@ Adaptors - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -226,7 +226,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/library_headers/algorithm.html b/doc/html/range/library_headers/algorithm.html index 6beb47e..cab83e7 100644 --- a/doc/html/range/library_headers/algorithm.html +++ b/doc/html/range/library_headers/algorithm.html @@ -2,8 +2,8 @@ Algorithm - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -677,7 +677,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/library_headers/algorithm_extensions.html b/doc/html/range/library_headers/algorithm_extensions.html index f3dd061..7a4db8f 100644 --- a/doc/html/range/library_headers/algorithm_extensions.html +++ b/doc/html/range/library_headers/algorithm_extensions.html @@ -2,8 +2,8 @@ Algorithm Extensions - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+

Algorithm Extensions @@ -166,7 +166,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/library_headers/general.html b/doc/html/range/library_headers/general.html index 558fe74..5996f99 100644 --- a/doc/html/range/library_headers/general.html +++ b/doc/html/range/library_headers/general.html @@ -2,8 +2,8 @@ General - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -545,7 +545,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/mfc_atl.html b/doc/html/range/mfc_atl.html index 7f2827c..31acfd5 100644 --- a/doc/html/range/mfc_atl.html +++ b/doc/html/range/mfc_atl.html @@ -2,8 +2,8 @@ MFC/ATL (courtesy of Shunsuke Sogame) - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -34,7 +34,7 @@
References
- + Introduction

@@ -100,7 +100,7 @@

- + Overview

@@ -135,7 +135,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/mfc_atl/atl_ranges.html b/doc/html/range/mfc_atl/atl_ranges.html index 65ee355..6c96f33 100644 --- a/doc/html/range/mfc_atl/atl_ranges.html +++ b/doc/html/range/mfc_atl/atl_ranges.html @@ -2,8 +2,8 @@ ATL Ranges - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -368,7 +368,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/mfc_atl/const_ranges.html b/doc/html/range/mfc_atl/const_ranges.html index 2e047f6..cf41223 100644 --- a/doc/html/range/mfc_atl/const_ranges.html +++ b/doc/html/range/mfc_atl/const_ranges.html @@ -2,8 +2,8 @@ const Ranges - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -119,7 +119,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/mfc_atl/mfc_ranges.html b/doc/html/range/mfc_atl/mfc_ranges.html index af0c6e9..57655a2 100644 --- a/doc/html/range/mfc_atl/mfc_ranges.html +++ b/doc/html/range/mfc_atl/mfc_ranges.html @@ -2,8 +2,8 @@ MFC Ranges - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -474,7 +474,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/mfc_atl/references.html b/doc/html/range/mfc_atl/references.html index 124a538..1d0a7a4 100644 --- a/doc/html/range/mfc_atl/references.html +++ b/doc/html/range/mfc_atl/references.html @@ -2,8 +2,8 @@ References - - + + @@ -13,25 +13,31 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
    -
  1. Boost.Range
    2. -
  2. MFC - Collection Classes
    3. -
  3. ATL - Collection Classes
    4. +
  4. + Boost.Range +
    5. +
  5. + MFC + Collection Classes +
    6. +
  6. + ATL + Collection Classes +
@@ -44,7 +50,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/mfc_atl/requirements.html b/doc/html/range/mfc_atl/requirements.html index 131433f..8c0a80a 100644 --- a/doc/html/range/mfc_atl/requirements.html +++ b/doc/html/range/mfc_atl/requirements.html @@ -2,8 +2,8 @@ Requirements - - + + @@ -13,26 +13,26 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
  • - Boost C++ Libraries Version 1.34.0 or later (no compilation required) -
    • + Boost C++ Libraries Version 1.34.0 or later (no compilation required) +
  • - Visual C++ 7.1 or later (for MFC and ATL) -
    • + Visual C++ 7.1 or later (for MFC and ATL) +
@@ -45,7 +45,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/portability.html b/doc/html/range/portability.html index 45d3a07..e2afd81 100644 --- a/doc/html/range/portability.html +++ b/doc/html/range/portability.html @@ -2,8 +2,8 @@ Portability - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -47,32 +47,32 @@

  1. - do not use built-in arrays, -
    2. + do not use built-in arrays, +
  2. - do not pass rvalues to begin(), - end() - and iterator_range Range constructors - and assignment operators, -
    3. + do not pass rvalues to begin(), + end() + and iterator_range Range constructors + and assignment operators, +
  3. - use const_begin() - and const_end() - whenever your code by intention is read-only; this will also solve most rvalue - problems, -
    4. + use const_begin() + and const_end() + whenever your code by intention is read-only; this will also solve most + rvalue problems, +
  4. - do not rely on ADL: -
      + do not rely on ADL: +
      • - if you overload functions, include that header before the headers in - this library, -
        • + if you overload functions, include that header before the headers + in this library, +
      • - put all overloads in namespace boost. -
        • + put all overloads in namespace boost. +
      - +
@@ -85,7 +85,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference.html b/doc/html/range/reference.html index cbff24d..9b31bb4 100644 --- a/doc/html/range/reference.html +++ b/doc/html/range/reference.html @@ -2,8 +2,8 @@ Reference - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -89,7 +89,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/adaptors.html b/doc/html/range/reference/adaptors.html index b649558..59564f9 100644 --- a/doc/html/range/reference/adaptors.html +++ b/doc/html/range/reference/adaptors.html @@ -2,8 +2,8 @@ Range Adaptors - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -44,7 +44,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/adaptors/general_requirements.html b/doc/html/range/reference/adaptors/general_requirements.html index 63abc37..83d19c0 100644 --- a/doc/html/range/reference/adaptors/general_requirements.html +++ b/doc/html/range/reference/adaptors/general_requirements.html @@ -2,8 +2,8 @@ General Requirements - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+

General Requirements @@ -33,40 +33,40 @@

  • -fwdRng is an expression - of a type R that models - ForwardRange -
    • + fwdRng is an expression + of a type R that models + ForwardRange +
  • -biRng is an expression - of a type R that models - BidirectionalRange -
    • + biRng is an expression + of a type R that models + BidirectionalRange +
  • -rndRng is an expression - of a type R that models - RandomAccessRange -
    • + rndRng is an expression + of a type R that models + RandomAccessRange +
  • -pred is an expression - of a type that models UnaryPredicate -
    • + pred is an expression + of a type that models UnaryPredicate +
  • -bi_pred is an expression - of a type that models BinaryPredicate -
    • + bi_pred is an expression + of a type that models BinaryPredicate +
  • -fun is an expression - of a type that models UnaryFunction -
    • + fun is an expression + of a type that models UnaryFunction +
  • -value, new_value and old_value - are objects convertible to boost::range_value<R>::type -
    • + value, new_value and old_value + are objects convertible to boost::range_value<R>::type +
  • -n,m are integer expressions convertible - to range_difference<R>::type -
    • + n,m are integer expressions convertible + to range_difference<R>::type +

Also note that boost::range_value<R>::type must be implicitly convertible to @@ -135,7 +135,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/adaptors/introduction.html b/doc/html/range/reference/adaptors/introduction.html index 3272a3c..73bccb8 100644 --- a/doc/html/range/reference/adaptors/introduction.html +++ b/doc/html/range/reference/adaptors/introduction.html @@ -2,8 +2,8 @@ Introduction and motivation - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+

Introduction and motivation @@ -122,7 +122,7 @@ situations, you will really appreciate the succinctness of operator|().

- + Composition of Adaptors
@@ -132,8 +132,14 @@ to algorithms. For example, consider these Range algorithms:

    -
  • boost::copy( rng, out )
    • -
  • boost::count( rng, pred )
    • +
  • + boost::copy( rng, out ) +
    • +
  • + boost::count( + rng, + pred ) +

What should we do if we only want to copy an element a @@ -142,13 +148,17 @@ The naive answer would be to use these algorithms:

    -
  • boost::copy_if( - rng, - pred, - out )
    • -
  • boost::count_if( - rng, - pred )
    • +
  • + boost::copy_if( + rng, + pred, + out ) +
    • +
  • + boost::count_if( + rng, + pred ) +

These algorithms are only defined to maintain a one to one relationship @@ -159,7 +169,7 @@ is the design solution to this problem.

- + Range Adaptor alternative to copy_if algorithm
@@ -176,7 +186,7 @@

- + Range Adaptor alternative to count_if algorithm
@@ -268,7 +278,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/adaptors/reference.html b/doc/html/range/reference/adaptors/reference.html index a76fbcb..b026090 100644 --- a/doc/html/range/reference/adaptors/reference.html +++ b/doc/html/range/reference/adaptors/reference.html @@ -2,8 +2,8 @@ Reference - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -57,7 +57,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/adaptors/reference/adjacent_filtered.html b/doc/html/range/reference/adaptors/reference/adjacent_filtered.html index c6d4404..31128ea 100644 --- a/doc/html/range/reference/adaptors/reference/adjacent_filtered.html +++ b/doc/html/range/reference/adaptors/reference/adjacent_filtered.html @@ -2,8 +2,8 @@ adjacent_filtered - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
adjacent_filtered @@ -77,29 +77,30 @@
  • -Precondition: The value_type - of the range is convertible to both argument types of bi_pred. -
    • + Precondition: The value_type of the range is convertible + to both argument types of bi_pred. +
  • -Postcondition: For all adjacent elements - [x,y] in the returned range, bi_pred(x,y) - is true. -
    • + Postcondition: For all adjacent + elements [x,y] in the returned range, bi_pred(x,y) + is true. +
  • -Throws: Whatever the copy constructor - of bi_pred might throw. -
    • + Throws: Whatever the copy constructor + of bi_pred might + throw. +
  • -Range Category:Single - Pass Range -
    • + Range Category: Single + Pass Range +
  • -Returned Range Category: The minimum - of the range category of rng - and Forward Range -
    • + Returned Range Category: The minimum + of the range category of rng + and Forward Range +
-
+
adjacent_filtered example @@ -151,7 +152,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/adaptors/reference/copied.html b/doc/html/range/reference/adaptors/reference/copied.html index 24b72f1..b690eba 100644 --- a/doc/html/range/reference/adaptors/reference/copied.html +++ b/doc/html/range/reference/adaptors/reference/copied.html @@ -2,8 +2,8 @@ copied - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -78,28 +78,28 @@
  • -Precondition:0 - <= n - && n - <= m - && m - < distance(rng) -
    • + Precondition: 0 + <= n + && n + <= m + && m + < distance(rng) +
  • -Returns: A new iterator_range - that holds the sliced range [n,m) - of the original range. -
    • + Returns: A new iterator_range + that holds the sliced range [n,m) + of the original range. +
  • -Range Category:Random - Access Range -
    • + Range Category: Random + Access Range +
  • -Returned Range Category:Random - Access Range -
    • + Returned Range Category: Random + Access Range +
-
+
copied example @@ -150,7 +150,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/adaptors/reference/filtered.html b/doc/html/range/reference/adaptors/reference/filtered.html index 6ce9f3c..1d21ce0 100644 --- a/doc/html/range/reference/adaptors/reference/filtered.html +++ b/doc/html/range/reference/adaptors/reference/filtered.html @@ -2,8 +2,8 @@ filtered - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -76,30 +76,30 @@
  • -Precondition: The value_type - of the range is convertible to the argument type of pred. -
    • + Precondition: The value_type of the range is convertible + to the argument type of pred. +
  • -Postcondition: For all adjacent elements - [x] in the returned range, pred(x) - is true. -
    • + Postcondition: For all adjacent + elements [x] in the returned range, pred(x) + is true. +
  • -Throws: Whatever the copy constructor - of pred might throw. -
    • + Throws: Whatever the copy constructor + of pred might throw. +
  • -Range Category:Forward - Range -
    • + Range Category: Forward + Range +
  • -Returned Range Category: The minimum - of the range category of rng - and Bidirectional - Range -
    • + Returned Range Category: The minimum + of the range category of rng + and Bidirectional + Range +
-
+
filtered example @@ -153,7 +153,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/adaptors/reference/indexed.html b/doc/html/range/reference/adaptors/reference/indexed.html index 3ef95df..45bcbef 100644 --- a/doc/html/range/reference/adaptors/reference/indexed.html +++ b/doc/html/range/reference/adaptors/reference/indexed.html @@ -2,8 +2,8 @@ indexed - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -75,23 +75,23 @@
  • -Returns: A range adapted to return - both the element and the associated index. The returned range consists - of iterators that have in addition to the usual iterator member functions - an index() - member function that returns the appropriate index for the element - in the sequence corresponding with the iterator. -
    • + Returns: A range adapted to return + both the element and the associated index. The returned range consists + of iterators that have in addition to the usual iterator member functions + an index() + member function that returns the appropriate index for the element + in the sequence corresponding with the iterator. +
  • -Range Category:Single - Pass Range -
    • + Range Category: Single + Pass Range +
  • -Returned Range Category: The range - category of rng -
    • + Returned Range Category: The range + category of rng +
-
+
indexed example @@ -184,7 +184,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/adaptors/reference/indirected.html b/doc/html/range/reference/adaptors/reference/indirected.html index 7dc0558..7360891 100644 --- a/doc/html/range/reference/adaptors/reference/indirected.html +++ b/doc/html/range/reference/adaptors/reference/indirected.html @@ -2,8 +2,8 @@ indirected - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -75,24 +75,27 @@
  • -Precondition: The value_type - of the range defines unary operator*() -
    • + Precondition: The value_type of the range defines + unary operator*() +
  • -Postcondition: For all elements x in the returned range, x is the result of *y - where y is the corresponding - element in the original range. -
    • + Postcondition: For all elements + x in the returned + range, x is the result + of *y + where y is the corresponding + element in the original range. +
  • -Range Category:Single - Pass Range -
    • + Range Category: Single + Pass Range +
  • -Returned Range Category: The range - category of rng -
    • + Returned Range Category: The range + category of rng +
-
+
indirected example @@ -144,7 +147,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/adaptors/reference/map_keys.html b/doc/html/range/reference/adaptors/reference/map_keys.html index 6c69774..3b8e621 100644 --- a/doc/html/range/reference/adaptors/reference/map_keys.html +++ b/doc/html/range/reference/adaptors/reference/map_keys.html @@ -2,8 +2,8 @@ map_keys - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -75,23 +75,26 @@
  • -Precondition: The value_type - of the range is an instantiation of std::pair. -
    • + Precondition: The value_type of the range is an instantiation + of std::pair. +
  • -Postcondition: For all elements x in the returned range, x is the result of y.first where y - is the corresponding element in the original range. -
    • + Postcondition: For all elements + x in the returned + range, x is the result + of y.first where y + is the corresponding element in the original range. +
  • -Range Category:Single - Pass Range -
    • + Range Category: Single + Pass Range +
  • -Returned Range Category: The range - category of rng. -
    • + Returned Range Category: The range + category of rng. +
-
+
map_keys example @@ -144,7 +147,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/adaptors/reference/map_values.html b/doc/html/range/reference/adaptors/reference/map_values.html index 6a906b2..c55f9ae 100644 --- a/doc/html/range/reference/adaptors/reference/map_values.html +++ b/doc/html/range/reference/adaptors/reference/map_values.html @@ -2,8 +2,8 @@ map_values - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -75,23 +75,26 @@
  • -Precondition: The value_type - of the range is an instantiation of std::pair. -
    • + Precondition: The value_type of the range is an instantiation + of std::pair. +
  • -Postcondition: For all elements x in the returned range, x is the result of y.second where y - is the corresponding element in the original range. -
    • + Postcondition: For all elements + x in the returned + range, x is the result + of y.second where y + is the corresponding element in the original range. +
  • -Range Category:Single - Pass Range -
    • + Range Category: Single + Pass Range +
  • -Returned Range Category: The range - category of rng. -
    • + Returned Range Category: The range + category of rng. +
-
+
map_values example @@ -144,7 +147,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/adaptors/reference/replaced.html b/doc/html/range/reference/adaptors/reference/replaced.html index 3bcfff4..da45959 100644 --- a/doc/html/range/reference/adaptors/reference/replaced.html +++ b/doc/html/range/reference/adaptors/reference/replaced.html @@ -2,8 +2,8 @@ replaced - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -78,37 +78,41 @@
  • -Precondition:
      + Precondition: +
      • -new_value is convertible - to the value_type - of the range. -
        • + new_value is + convertible to the value_type + of the range. +
      • -old_value is convertible - to the value_type - of the range. -
        • + old_value is + convertible to the value_type + of the range. +
      - +
    • -Postcondition: For all elements x in the returned range, the value - x is equal to the value - of (y - == old_value) ? new_value : - y where y - is the corresponding element in the original range. -
      • + Postcondition: For all elements + x in the returned + range, the value x + is equal to the value of (y == + old_value) + ? new_value + : y + where y is the corresponding + element in the original range. +
    • -Range Category:Forward - Range -
      • + Range Category: Forward + Range +
    • -Returned Range Category: The range - category of rng. -
      • + Returned Range Category: The range + category of rng. +
    -
    +
    replaced example @@ -159,7 +163,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/range/reference/adaptors/reference/replaced_if.html b/doc/html/range/reference/adaptors/reference/replaced_if.html index dbd181e..b3b77e3 100644 --- a/doc/html/range/reference/adaptors/reference/replaced_if.html +++ b/doc/html/range/reference/adaptors/reference/replaced_if.html @@ -2,8 +2,8 @@ replaced_if - - + + @@ -13,16 +13,16 @@ - +
    Boost C++ Libraries HomeLibrariesLibraries People FAQ More
    -PrevUpHomeNext +PrevUpHomeNext
    -
    +
    replaced_if @@ -79,36 +79,37 @@
    • -Precondition:
        + Precondition: +
        • - The range value_type - is convertible to the argument type of pred. -
          • + The range value_type + is convertible to the argument type of pred. +
        • -new_value is convertible - to the value_type - of the range. -
          • + new_value is + convertible to the value_type + of the range. +
        - +
      • -Postconditions: For all elements - x in the returned range, - the value x is equal - to the value of pred(y) ? new_value : - y where y - is the corresponding element in the original range. -
        • + Postconditions: For all elements + x in the returned + range, the value x + is equal to the value of pred(y) ? new_value : + y where y + is the corresponding element in the original range. +
      • -Range Category:Forward - Range -
        • + Range Category: Forward + Range +
      • -Returned Range Category: The range - category of rng. -
        • + Returned Range Category: The range + category of rng. +
      -
      +
      replaced_if example @@ -164,7 +165,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/range/reference/adaptors/reference/reversed.html b/doc/html/range/reference/adaptors/reference/reversed.html index f8d2f26..2b192f9 100644 --- a/doc/html/range/reference/adaptors/reference/reversed.html +++ b/doc/html/range/reference/adaptors/reference/reversed.html @@ -2,8 +2,8 @@ reversed - - + + @@ -13,16 +13,16 @@ - +
      Boost C++ Libraries HomeLibrariesLibraries People FAQ More
      -PrevUpHomeNext +PrevUpHomeNext
      -
      +
      @@ -75,19 +75,19 @@
      • -Returns: A range whose iterators behave - as if they were the original iterators wrapped in reverse_iterator. -
        • + Returns: A range whose iterators + behave as if they were the original iterators wrapped in reverse_iterator. +
      • -Range Category:Bidirectional - Range -
        • + Range Category: Bidirectional + Range +
      • -Returned Range Category: The range - category of rng. -
        • + Returned Range Category: The range + category of rng. +
      -
      +
      reversed example @@ -138,7 +138,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/range/reference/adaptors/reference/sliced.html b/doc/html/range/reference/adaptors/reference/sliced.html index 757aaaf..c0dfed0 100644 --- a/doc/html/range/reference/adaptors/reference/sliced.html +++ b/doc/html/range/reference/adaptors/reference/sliced.html @@ -2,8 +2,8 @@ sliced - - + + @@ -13,16 +13,16 @@ - +
      Boost C++ Libraries HomeLibrariesLibraries People FAQ More
      -PrevUpHomeNext +PrevUpHomeNext
      -
      +
      @@ -78,26 +78,26 @@
      -
      +
      sliced example @@ -148,7 +148,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/range/reference/adaptors/reference/strided.html b/doc/html/range/reference/adaptors/reference/strided.html index b641325..2cbb302 100644 --- a/doc/html/range/reference/adaptors/reference/strided.html +++ b/doc/html/range/reference/adaptors/reference/strided.html @@ -2,8 +2,8 @@ strided - - + + @@ -13,16 +13,16 @@ - +
      Boost C++ Libraries HomeLibrariesLibraries People FAQ More
      -PrevUpHomeNext +PrevUpHomeNext
      -
      +
      @@ -76,25 +76,25 @@
      • -Precondition:0 - <= n - && n - < distance(rng) -
        • + Precondition: 0 + <= n + && n + < distance(rng) +
      • -Returns: A new range based on rng where traversal is performed - in steps of n. -
        • + Returns: A new range based on rng where traversal is performed + in steps of n. +
      • -Range Category:Random - Access Range -
        • + Range Category: Random + Access Range +
      • -Returned Range Category:Random - Access Range -
        • + Returned Range Category: Random + Access Range +
      -
      +
      strided example @@ -145,7 +145,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/range/reference/adaptors/reference/tokenized.html b/doc/html/range/reference/adaptors/reference/tokenized.html index 32f57e6..66e5cd7 100644 --- a/doc/html/range/reference/adaptors/reference/tokenized.html +++ b/doc/html/range/reference/adaptors/reference/tokenized.html @@ -2,8 +2,8 @@ tokenized - - + + @@ -13,16 +13,16 @@ - +
      Boost C++ Libraries HomeLibrariesLibraries People FAQ More
      -PrevUpHomeNext +PrevUpHomeNext
      -
      +
      @@ -88,47 +88,50 @@
      • -Precondition:
          + Precondition: +
          • - Let T denote typename range_value<decltype(rng)>::type, - then regex has - the type basic_regex<T> or is implicitly convertible - to one of these types. -
            • + Let T denote + typename range_value<decltype(rng)>::type, + then regex + has the type basic_regex<T> or is implicitly convertible + to one of these types. +
          • -i has the type - int. -
            • + i has the type + int. +
          • - the value_type - of rndRng is int. -
            • + the value_type + of rndRng is + int. +
          • -flags has the type - regex_constants::syntax_option_type. -
            • + flags has the + type regex_constants::syntax_option_type. +
          - +
        • -Returns: A range whose iterators behave - as if they were the original iterators wrapped in regex_token_iterator. - The first iterator in the range would be constructed by forwarding - all the arguments of tokenized() to the regex_token_iterator - constructor. -
          • + Returns: A range whose iterators + behave as if they were the original iterators wrapped in regex_token_iterator. The first + iterator in the range would be constructed by forwarding all the + arguments of tokenized() to the regex_token_iterator + constructor. +
        • -Throws: Whatever constructing and - copying equivalent regex_token_iterators - might throw. -
          • + Throws: Whatever constructing and + copying equivalent regex_token_iterators + might throw. +
        • -Range Category:Random - Access Range -
          • + Range Category: Random + Access Range +
        • -Returned Range Category:Random - Access Range -
          • + Returned Range Category: Random + Access Range +
      @@ -141,7 +144,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/range/reference/adaptors/reference/transformed.html b/doc/html/range/reference/adaptors/reference/transformed.html index 43b8758..9631986 100644 --- a/doc/html/range/reference/adaptors/reference/transformed.html +++ b/doc/html/range/reference/adaptors/reference/transformed.html @@ -2,8 +2,8 @@ transformed - - + + @@ -13,16 +13,16 @@ - +
      Boost C++ Libraries HomeLibrariesLibraries People FAQ More
      -PrevUpHomeNext +PrevUpHomeNext
      -
      +
      transformed @@ -77,28 +77,31 @@
      • -Precondition: The value_type - of the range is convertible to the argument type of fun. -
        • + Precondition: The value_type of the range is convertible + to the argument type of fun. +
      • -Postcondition: For all elements x in the returned range, x is the result of fun(y) - where y is the corresponding - element in the original range. -
        • + Postcondition: For all elements + x in the returned + range, x is the result + of fun(y) + where y is the corresponding + element in the original range. +
      • -Throws: Whatever the copy-constructor - of fun might throw. -
        • + Throws: Whatever the copy-constructor + of fun might throw. +
      • -Range Category:Single - Pass Range -
        • + Range Category: Single + Pass Range +
      • -Returned Range Category: The range - category of rng. -
        • + Returned Range Category: The range + category of rng. +
      -
      +
      transformed example @@ -155,7 +158,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/range/reference/adaptors/reference/uniqued.html b/doc/html/range/reference/adaptors/reference/uniqued.html index 65fdc6e..6ab4c59 100644 --- a/doc/html/range/reference/adaptors/reference/uniqued.html +++ b/doc/html/range/reference/adaptors/reference/uniqued.html @@ -2,8 +2,8 @@ uniqued - - + + @@ -13,16 +13,16 @@ - +
      Boost C++ Libraries HomeLibrariesLibraries People FAQ More
      -PrevUpHomeNext +PrevUpHomeNext
      -
      +
      @@ -75,24 +75,24 @@
      • -Precondition: The value_type - of the range is comparable with operator==(). -
        • + Precondition: The value_type of the range is comparable + with operator==(). +
      • -Postcondition: For all adjacent elements - [x,y] in the returned range, x==y is false. -
        • + Postcondition: For all adjacent + elements [x,y] in the returned range, x==y is false. +
      • -Range Category:Forward - Range -
        • + Range Category: Forward + Range +
      • -Returned Range Category: The minimum - of the range concept of rng - and Forward Range. -
        • + Returned Range Category: The minimum + of the range concept of rng + and Forward Range. +
      -
      +
      uniqued example @@ -141,7 +141,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/range/reference/algorithms.html b/doc/html/range/reference/algorithms.html index a8b27ff..0bc9f39 100644 --- a/doc/html/range/reference/algorithms.html +++ b/doc/html/range/reference/algorithms.html @@ -2,8 +2,8 @@ Range Algorithm - - + + @@ -13,16 +13,16 @@ - +
      Boost C++ Libraries HomeLibrariesLibraries People FAQ More
      -PrevUpHomeNext +PrevUpHomeNext
      -
      +
      @@ -50,7 +50,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/range/reference/algorithms/heap.html b/doc/html/range/reference/algorithms/heap.html index c06c707..045ea7b 100644 --- a/doc/html/range/reference/algorithms/heap.html +++ b/doc/html/range/reference/algorithms/heap.html @@ -2,8 +2,8 @@ Heap algorithms - - + + @@ -13,16 +13,16 @@ - +
      Boost C++ Libraries HomeLibrariesLibraries People FAQ More
      -PrevUpHomeNext +PrevUpHomeNext
      -
      +
      @@ -43,7 +43,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/range/reference/algorithms/heap/make_heap.html b/doc/html/range/reference/algorithms/heap/make_heap.html index 2cffa4f..ec8c914 100644 --- a/doc/html/range/reference/algorithms/heap/make_heap.html +++ b/doc/html/range/reference/algorithms/heap/make_heap.html @@ -2,8 +2,8 @@ make_heap - - + + @@ -13,21 +13,21 @@ - +
      Boost C++ Libraries HomeLibrariesLibraries People FAQ More
      -PrevUpHomeNext +PrevUpHomeNext
      -
      +
      - + Prototype

      @@ -48,7 +48,7 @@

      - + Description

      @@ -60,14 +60,14 @@ the predicate versions.

      - + Definition

      Defined in the header file boost/range/algorithm/heap_algorithm.hpp

      - + Requirements

      @@ -75,50 +75,50 @@

      • -RandomAccessRange is - a model of the Random - Access Range Concept. -
        • + RandomAccessRange + is a model of the Random + Access Range Concept. +
      • -RandomAccessRange is - mutable. -
        • + RandomAccessRange + is mutable. +
      • -RandomAccessRange's - value type is a model of the LessThanComparableConcept. -
        • + RandomAccessRange's + value type is a model of the LessThanComparableConcept. +
      • - The ordering of objects of type RandomAccessRange's - value type is a strict weak ordering, - as defined in the LessThanComparableConcept - requirements. -
        • + The ordering of objects of type RandomAccessRange's + value type is a strict weak ordering, + as defined in the LessThanComparableConcept + requirements. +

      For the predicate versions:

      • -RandomAccessRange is - a model of the Random - Access Range Concept. -
        • + RandomAccessRange + is a model of the Random + Access Range Concept. +
      • -RandomAccessRange is - mutable. -
        • + RandomAccessRange + is mutable. +
      • -Compare is a model - of the StrictWeakOrderingConcept. -
        • + Compare is a model + of the StrictWeakOrderingConcept. +
      • -RandomAccessRange's - value type is convertible to both of Compare's - argument types. -
        • + RandomAccessRange's + value type is convertible to both of Compare's + argument types. +
      - + Complexity

      @@ -137,7 +137,7 @@

      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/range/reference/algorithms/heap/pop_heap.html b/doc/html/range/reference/algorithms/heap/pop_heap.html index ec7f440..f54fa6d 100644 --- a/doc/html/range/reference/algorithms/heap/pop_heap.html +++ b/doc/html/range/reference/algorithms/heap/pop_heap.html @@ -2,8 +2,8 @@ pop_heap - - + + @@ -13,21 +13,21 @@ - +
      Boost C++ Libraries HomeLibrariesLibraries People FAQ More
      -PrevUpHomeNext +PrevUpHomeNext
      -
      +
      - + Prototype

      @@ -48,7 +48,7 @@

      - + Description

      @@ -62,14 +62,14 @@ the predicate versions.

      - + Definition

      Defined in the header file boost/range/algorithm/heap_algorithm.hpp

      - + Requirements

      @@ -77,60 +77,62 @@

      • -RandomAccessRange is - a model of the Random - Access Range Concept. -
        • + RandomAccessRange + is a model of the Random + Access Range Concept. +
      • -RandomAccessRange is - mutable. -
        • + RandomAccessRange + is mutable. +
      • -RandomAccessRange's - value type is a model of the LessThanComparableConcept. -
        • + RandomAccessRange's + value type is a model of the LessThanComparableConcept. +
      • - The ordering of objects of type RandomAccessRange's - value type is a strict weak ordering, - as defined in the LessThanComparableConcept - requirements. -
        • + The ordering of objects of type RandomAccessRange's + value type is a strict weak ordering, + as defined in the LessThanComparableConcept + requirements. +

      For the predicate versions:

      • -RandomAccessRange is - a model of the Random - Access Range Concept. -
        • + RandomAccessRange + is a model of the Random + Access Range Concept. +
      • -RandomAccessRange is - mutable. -
        • + RandomAccessRange + is mutable. +
      • -Compare is a model - of the StrictWeakOrderingConcept. -
        • + Compare is a model + of the StrictWeakOrderingConcept. +
      • -RandomAccessRange's - value type is convertible to both of Compare's - argument types. -
        • + RandomAccessRange's + value type is convertible to both of Compare's + argument types. +
      - + Precondition:
        -
      • !empty(rng)
      • -rng is a heap. -
        • + !empty(rng) + +
      • + rng is a heap. +
      - + Complexity

      @@ -149,7 +151,7 @@

      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/range/reference/algorithms/heap/push_heap.html b/doc/html/range/reference/algorithms/heap/push_heap.html index 2c59f90..04bd5de 100644 --- a/doc/html/range/reference/algorithms/heap/push_heap.html +++ b/doc/html/range/reference/algorithms/heap/push_heap.html @@ -2,8 +2,8 @@ push_heap - - + + @@ -13,21 +13,21 @@ - +
      Boost C++ Libraries HomeLibrariesLibraries People FAQ More
      -PrevUpHomeNext +PrevUpHomeNext
      -
      +
      - + Prototype

      @@ -48,7 +48,7 @@

      - + Description

      @@ -62,14 +62,14 @@ the predicate versions.

      - + Definition

      Defined in the header file boost/range/algorithm/heap_algorithm.hpp

      - + Requirements

      @@ -77,60 +77,62 @@

      • -RandomAccessRange is - a model of the Random - Access Range Concept. -
        • + RandomAccessRange + is a model of the Random + Access Range Concept. +
      • -RandomAccessRange is - mutable. -
        • + RandomAccessRange + is mutable. +
      • -RandomAccessRange's - value type is a model of the LessThanComparableConcept. -
        • + RandomAccessRange's + value type is a model of the LessThanComparableConcept. +
      • - The ordering of objects of type RandomAccessRange's - value type is a strict weak ordering, - as defined in the LessThanComparableConcept - requirements. -
        • + The ordering of objects of type RandomAccessRange's + value type is a strict weak ordering, + as defined in the LessThanComparableConcept + requirements. +

      For the predicate versions:

      • -RandomAccessRange is - a model of the Random - Access Range Concept. -
        • + RandomAccessRange + is a model of the Random + Access Range Concept. +
      • -RandomAccessRange is - mutable. -
        • + RandomAccessRange + is mutable. +
      • -Compare is a model - of the StrictWeakOrderingConcept. -
        • + Compare is a model + of the StrictWeakOrderingConcept. +
      • -RandomAccessRange's - value type is convertible to both of Compare's - argument types. -
        • + RandomAccessRange's + value type is convertible to both of Compare's + argument types. +
      - + Precondition:
        -
      • !empty(rng)
      • -[begin(rng), prior(end(rng))) is a heap. -
        • + !empty(rng) + +
      • + [begin(rng), prior(end(rng))) is a heap. +
      - + Complexity

      @@ -147,7 +149,7 @@

      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/range/reference/algorithms/heap/sort_heap.html b/doc/html/range/reference/algorithms/heap/sort_heap.html index 32eaee6..ee226c1 100644 --- a/doc/html/range/reference/algorithms/heap/sort_heap.html +++ b/doc/html/range/reference/algorithms/heap/sort_heap.html @@ -2,8 +2,8 @@ sort_heap - - + + @@ -13,21 +13,21 @@ - +
      Boost C++ Libraries HomeLibrariesLibraries People FAQ More
      -PrevUpHomeNext +PrevUpHomeNext
      -
      +
      - + Prototype

      @@ -48,7 +48,7 @@

      - + Description

      @@ -61,14 +61,14 @@ the predicate versions.

      - + Definition

      Defined in the header file boost/range/algorithm/heap_algorithm.hpp

      - + Requirements

      @@ -76,57 +76,57 @@

      • -RandomAccessRange is - a model of the Random - Access Range Concept. -
        • + RandomAccessRange + is a model of the Random + Access Range Concept. +
      • -RandomAccessRange is - mutable. -
        • + RandomAccessRange + is mutable. +
      • -RandomAccessRange's - value type is a model of the LessThanComparableConcept. -
        • + RandomAccessRange's + value type is a model of the LessThanComparableConcept. +
      • - The ordering of objects of type RandomAccessRange's - value type is a strict weak ordering, - as defined in the LessThanComparableConcept - requirements. -
        • + The ordering of objects of type RandomAccessRange's + value type is a strict weak ordering, + as defined in the LessThanComparableConcept + requirements. +

      For the predicate versions:

      • -RandomAccessRange is - a model of the Random - Access Range Concept. -
        • + RandomAccessRange + is a model of the Random + Access Range Concept. +
      • -RandomAccessRange is - mutable. -
        • + RandomAccessRange + is mutable. +
      • -Compare is a model - of the StrictWeakOrderingConcept. -
        • + Compare is a model + of the StrictWeakOrderingConcept. +
      • -RandomAccessRange's - value type is convertible to both of Compare's - argument types. -
        • + RandomAccessRange's + value type is convertible to both of Compare's + argument types. +
      - + Precondition:

      rng is a heap.

      - + Complexity

      @@ -146,7 +146,7 @@

      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/range/reference/algorithms/mutating.html b/doc/html/range/reference/algorithms/mutating.html index 1990363..7a7d945 100644 --- a/doc/html/range/reference/algorithms/mutating.html +++ b/doc/html/range/reference/algorithms/mutating.html @@ -2,8 +2,8 @@ Mutating algorithms - - + + @@ -13,16 +13,16 @@ - +
      Boost C++ Libraries HomeLibrariesLibraries People FAQ More
      -PrevUpHomeNext +PrevUpHomeNext
      -
      +
      @@ -85,7 +85,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/range/reference/algorithms/mutating/copy.html b/doc/html/range/reference/algorithms/mutating/copy.html index 8968afa..73bfab7 100644 --- a/doc/html/range/reference/algorithms/mutating/copy.html +++ b/doc/html/range/reference/algorithms/mutating/copy.html @@ -2,8 +2,8 @@ copy - - + + @@ -13,21 +13,21 @@ - +
      Boost C++ Libraries HomeLibrariesLibraries People FAQ More
      -PrevUpHomeNext +PrevUpHomeNext
      -
      +
      - + Prototype

      @@ -39,7 +39,7 @@

      - + Description

      @@ -50,49 +50,49 @@ distance(source_rng)

      - + Definition

      Defined in the header file boost/range/algorithm/copy.hpp

      - + Requirements
      • -SinglePassRange is - a model of the Single - Pass Range Concept. -
        • + SinglePassRange is + a model of the Single + Pass Range Concept. +
      • -OutputIterator is a - model of the OutputIteratorConcept. -
        • + OutputIterator is + a model of the OutputIteratorConcept. +
      • - The value_type of - Single Pass Range - Concept is convertible to a type in OutputIterator's - set of value types. -
        • + The value_type of + Single Pass Range + Concept is convertible to a type in OutputIterator's + set of value types. +
      - + Precondition:
      • -out_it is not an iterator - within the source_rng. -
        • + out_it is not an + iterator within the source_rng. +
      • -[out_it, out_it - + distance(source_rng)) is a valid range. -
        • + [out_it, out_it + + distance(source_rng)) is a valid range. +
      - + Complexity

      @@ -109,7 +109,7 @@

      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/range/reference/algorithms/mutating/copy_backward.html b/doc/html/range/reference/algorithms/mutating/copy_backward.html index 3cc1743..e48d5d0 100644 --- a/doc/html/range/reference/algorithms/mutating/copy_backward.html +++ b/doc/html/range/reference/algorithms/mutating/copy_backward.html @@ -2,8 +2,8 @@ copy_backward - - + + @@ -13,22 +13,22 @@ - +
      Boost C++ Libraries HomeLibrariesLibraries People FAQ More
      -PrevUpHomeNext +PrevUpHomeNext
      -
      +
      - + Prototype

      @@ -42,7 +42,7 @@

      - + Description

      @@ -60,49 +60,49 @@ denotes the end of the output sequence.

      - + Definition

      Defined in the header file boost/range/algorithm/copy_backward.hpp

      - + Requirements
      • -BidirectionalRange - is a model of Bidirectional - Range Concept. -
        • + BidirectionalRange + is a model of Bidirectional + Range Concept. +
      • -OutputIterator is a - model of the OutputIteratorConcept. -
        • + OutputIterator is + a model of the OutputIteratorConcept. +
      • - The value_type of - Bidirectional Range - Concept is convertible to a type in OutputIterator's - set of value types. -
        • + The value_type of + Bidirectional + Range Concept is convertible to a type in OutputIterator's + set of value types. +
      - + Precondition:
      • -out_it is not an iterator - within the source_rng. -
        • + out_it is not an + iterator within the source_rng. +
      • -[out_it, out_it - + distance(source_rng)) is a valid range. -
        • + [out_it, out_it + + distance(source_rng)) is a valid range. +
      - + Complexity

      @@ -119,7 +119,7 @@

      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/range/reference/algorithms/mutating/fill.html b/doc/html/range/reference/algorithms/mutating/fill.html index b2dfe94..157647f 100644 --- a/doc/html/range/reference/algorithms/mutating/fill.html +++ b/doc/html/range/reference/algorithms/mutating/fill.html @@ -2,8 +2,8 @@ fill - - + + @@ -13,21 +13,21 @@ - +
      Boost C++ Libraries HomeLibrariesLibraries People FAQ More
      -PrevUpHomeNext +PrevUpHomeNext
      -
      +
      - + Prototype

      @@ -39,7 +39,7 @@

      - + Description

      @@ -48,37 +48,37 @@ in the range rng.

      - + Definition

      Defined in the header file boost/range/algorithm/fill.hpp

      - + Requirements
      • -ForwardRange is a model - of the Forward Range - Concept. -
        • + ForwardRange is a + model of the Forward + Range Concept. +
      • -ForwardRange is mutable. -
        • + ForwardRange is mutable. +
      • -Value is a model of - the AssignableConcept. -
        • + Value is a model + of the AssignableConcept. +
      • -Value is convertible - to ForwardRange's value - type. -
        • + Value is convertible + to ForwardRange's + value type. +
      - + Complexity

      @@ -95,7 +95,7 @@

      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/range/reference/algorithms/mutating/fill_n.html b/doc/html/range/reference/algorithms/mutating/fill_n.html index 560f14f..ab0e3ae 100644 --- a/doc/html/range/reference/algorithms/mutating/fill_n.html +++ b/doc/html/range/reference/algorithms/mutating/fill_n.html @@ -2,8 +2,8 @@ fill_n - - + + @@ -13,21 +13,21 @@ - +
      Boost C++ Libraries HomeLibrariesLibraries People FAQ More
      -PrevUpHomeNext +PrevUpHomeNext
      -
      +
      - + Prototype

      @@ -39,7 +39,7 @@

      - + Description

      @@ -47,37 +47,37 @@ val to n elements in the range rng begining with boost::begin(rng).

      - + Definition

      Defined in the header file boost/range/algorithm/fill_n.hpp

      - + Requirements
      • -ForwardRange is a model - of the Forward Range - Concept. -
        • + ForwardRange is a + model of the Forward + Range Concept. +
      • -ForwardRange is mutable. -
        • + ForwardRange is mutable. +
      • -Value is a model of - the AssignableConcept. -
        • + Value is a model + of the AssignableConcept. +
      • -Value is convertible - to ForwardRange's value - type. -
        • + Value is convertible + to ForwardRange's + value type. +
      - + Complexity

      @@ -95,7 +95,7 @@

      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/range/reference/algorithms/mutating/generate.html b/doc/html/range/reference/algorithms/mutating/generate.html index 7868f31..dbebc72 100644 --- a/doc/html/range/reference/algorithms/mutating/generate.html +++ b/doc/html/range/reference/algorithms/mutating/generate.html @@ -2,8 +2,8 @@ generate - - + + @@ -13,21 +13,21 @@ - +
      Boost C++ Libraries HomeLibrariesLibraries People FAQ More
      -PrevUpHomeNext +PrevUpHomeNext
      -
      +
      - + Prototype

      @@ -42,7 +42,7 @@

      - + Description

      @@ -52,52 +52,52 @@ Returns the resultant range.

      - + Definition

      Defined in the header file boost/range/algorithm/generate.hpp

      - + Requirements
      • -ForwardRange is a model - of the Forward Range - Concept. -
        • + ForwardRange is a + model of the Forward + Range Concept. +
      • -ForwardRange is mutable. -
        • + ForwardRange is mutable. +
      • -Generator is a model - of the GeneratorConcept. -
        • + Generator is a model + of the GeneratorConcept. +
      • - The value_type of - SinglePassRange is - convertible to a type in OutputIterator's - set of value types. -
        • + The value_type of + SinglePassRange is + convertible to a type in OutputIterator's + set of value types. +
      - + Precondition:
      • -out_it is not an iterator - within rng. -
        • + out_it is not an + iterator within rng. +
      • -[out_it, out_it - + distance(rng)) is a valid range. -
        • + [out_it, out_it + + distance(rng)) is a valid range. +
      - + Complexity

      @@ -114,7 +114,7 @@

      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/range/reference/algorithms/mutating/inplace_merge.html b/doc/html/range/reference/algorithms/mutating/inplace_merge.html index bd52738..61ca01e 100644 --- a/doc/html/range/reference/algorithms/mutating/inplace_merge.html +++ b/doc/html/range/reference/algorithms/mutating/inplace_merge.html @@ -2,8 +2,8 @@ inplace_merge - - + + @@ -13,22 +13,22 @@ - +
      Boost C++ Libraries HomeLibrariesLibraries People FAQ More
      -PrevUpHomeNext +PrevUpHomeNext
      -
      +
      - + Prototype

      @@ -59,7 +59,7 @@

      - + Description

      @@ -72,14 +72,14 @@ input range is preserved.

      - + Definition

      Defined in the header file boost/range/algorithm/inplace_merge.hpp

      - + Requirements

      @@ -87,23 +87,23 @@

      • -BidirectionalRange - is a model of the Bidirectional - Range Concept. -
        • + BidirectionalRange + is a model of the Bidirectional + Range Concept. +
      • -BidirectionalRange - is mutable. -
        • + BidirectionalRange + is mutable. +
      • -range_value<BidirectionalRange>::type is a model of LessThanComparableConcept -
        • + range_value<BidirectionalRange>::type is a model of LessThanComparableConcept +
      • - The ordering on objects of range_type<BidirectionalRange>::type - is a strict weak ordering, - as defined in the LessThanComparableConcept - requirements. -
        • + The ordering on objects of range_type<BidirectionalRange>::type + is a strict weak ordering, + as defined in the LessThanComparableConcept + requirements. +

      For the predicate version: * BidirectionalRange is a model of the @@ -116,55 +116,55 @@ argument types.

      - + Precondition:
      - + For the non-predicate version:
      • -middle is in the range - rng. -
        • + middle is in the + range rng. +
      • -[begin(rng), middle) is in ascending order. That is for - each pair of adjacent elements [x,y], - y < - x is false. -
        • + [begin(rng), middle) is in ascending order. That is for + each pair of adjacent elements [x,y], + y < + x is false. +
      • -[middle, end(rng)) is in ascending order. That is for - each pair of adjacent elements [x,y], - y < - x is false. -
        • + [middle, end(rng)) is in ascending order. That is + for each pair of adjacent elements [x,y], + y < + x is false. +
      - + For the predicate version:
      • -middle is in the range - rng. -
        • + middle is in the + range rng. +
      • -[begin(rng), middle) is in ascending order. That is for - each pair of adjacent elements [x,y], - pred(y,x) == false. -
        • + [begin(rng), middle) is in ascending order. That is for + each pair of adjacent elements [x,y], + pred(y,x) == false. +
      • -[middle, end(rng)) is in ascending order. That is for - each pair of adjacent elements [x,y], - pred(y,x) == false. -
        • + [middle, end(rng)) is in ascending order. That is + for each pair of adjacent elements [x,y], + pred(y,x) == false. +
      - + Complexity

      @@ -181,7 +181,7 @@

      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/range/reference/algorithms/mutating/merge.html b/doc/html/range/reference/algorithms/mutating/merge.html index 6649d4e..833a616 100644 --- a/doc/html/range/reference/algorithms/mutating/merge.html +++ b/doc/html/range/reference/algorithms/mutating/merge.html @@ -2,8 +2,8 @@ merge - - + + @@ -13,21 +13,21 @@ - +
      Boost C++ Libraries HomeLibrariesLibraries People FAQ More
      -PrevUpHomeNext +PrevUpHomeNext
      -
      +
      - + Prototype

      @@ -56,7 +56,7 @@

      - + Description

      @@ -75,14 +75,14 @@ version uses the predicate instead of operator<().

      - + Definition

      Defined in the header file boost/range/algorithm/merge.hpp

      - + Requirements

      @@ -90,137 +90,147 @@

      • -SinglePassRange1 is - a model of the Single - Pass Range Concept. -
        • + SinglePassRange1 + is a model of the Single + Pass Range Concept. +
      • -SinglePassRange2 is - a model of the Single - Pass Range Concept. -
        • + SinglePassRange2 + is a model of the Single + Pass Range Concept. +
      • -range_value<SinglePassRange1>::type is the same as range_value<SinglePassRange2>::type. -
        • + range_value<SinglePassRange1>::type is the same as range_value<SinglePassRange2>::type. +
      • -range_value<SinglePassRange1>::type is a model of the LessThanComparableConcept. -
        • + range_value<SinglePassRange1>::type is a model of the LessThanComparableConcept. +
      • - The ordering on objects of range_value<SinglePassRange1>::type - is a strict weak ordering, - as defined in the LessThanComparableConcept - requirements. -
        • + The ordering on objects of range_value<SinglePassRange1>::type + is a strict weak ordering, + as defined in the LessThanComparableConcept + requirements. +
      • -range_value<SinglePassRange1>::type is convertible to a type in - OutputIterator's set - of value types. -
        • + range_value<SinglePassRange1>::type is convertible to a type in + OutputIterator's + set of value types. +

      For the predicate version:

      • -SinglePassRange1 is - a model of the Single - Pass Range Concept. -
        • + SinglePassRange1 + is a model of the Single + Pass Range Concept. +
      • -SinglePassRange2 is - a model of the Single - Pass Range Concept. -
        • + SinglePassRange2 + is a model of the Single + Pass Range Concept. +
      • -range_value<SinglePassRange1>::type is the same as range_value<SinglePassRange2>::type. -
        • + range_value<SinglePassRange1>::type is the same as range_value<SinglePassRange2>::type. +
      • -BinaryPredicate is - a model of the StrictWeakOrderingConcept. -
        • + BinaryPredicate is + a model of the StrictWeakOrderingConcept. +
      • -SinglePassRange1's - value type is convertible to both BinaryPredicate's - argument types. -
        • + SinglePassRange1's + value type is convertible to both BinaryPredicate's + argument types. +
      • -range_value<SinglePassRange1>::type is convertible to a type in - OutputIterator's set - of value types. -
        • + range_value<SinglePassRange1>::type is convertible to a type in + OutputIterator's + set of value types. +
      - + Precondition:
      - + For the non-predicate version:
      • - The elements of rng1 - are in ascending order. That is, for each adjacent element pair [x,y] of rng1, - y < - x == - false. -
        • + The elements of rng1 + are in ascending order. That is, for each adjacent element pair + [x,y] of rng1, + y < + x == + false. +
      • - The elements of rng2 - are in ascending order. That is, for each adjacent element pair [x,y] of rng2, - y < - x == - false. -
        • + The elements of rng2 + are in ascending order. That is, for each adjacent element pair + [x,y] of rng2, + y < + x == + false. +
      • - The ranges rng1 and - [out, out + distance(rng1) + distance(rng2)) - do not overlap. -
        • + The ranges rng1 and + [out, out + + distance(rng1) + distance(rng2)) + do not overlap. +
      • - The ranges rng2 and - [out, out + distance(rng1) + distance(rng2)) - do not overlap. -
        • + The ranges rng2 and + [out, out + + distance(rng1) + distance(rng2)) + do not overlap. +
      • -[out, out + distance(rng1) + distance(rng2)) - is a valid range. -
        • + [out, out + + distance(rng1) + distance(rng2)) + is a valid range. +
      - + For the predicate version:
      • - The elements of rng1 - are in ascending order. That is, for each adjacent element pair [x,y], of rng1, - pred(y, x) == false. -
        • + The elements of rng1 + are in ascending order. That is, for each adjacent element pair + [x,y], of rng1, + pred(y, x) == false. +
      • - The elements of rng2 - are in ascending order. That is, for each adjacent element pair [x,y], of rng2, - pred(y, x) == false. -
        • + The elements of rng2 + are in ascending order. That is, for each adjacent element pair + [x,y], of rng2, + pred(y, x) == false. +
      • - The ranges rng1 and - [out, out + distance(rng1) + distance(rng2)) - do not overlap. -
        • + The ranges rng1 and + [out, out + + distance(rng1) + distance(rng2)) + do not overlap. +
      • - The ranges rng2 and - [out, out + distance(rng1) + distance(rng2)) - do not overlap. -
        • + The ranges rng2 and + [out, out + + distance(rng1) + distance(rng2)) + do not overlap. +
      • -[out, out + distance(rng1) + distance(rng2)) - is a valid range. -
        • + [out, out + + distance(rng1) + distance(rng2)) + is a valid range. +
      - + Complexity

      @@ -240,7 +250,7 @@

      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/range/reference/algorithms/mutating/nth_element.html b/doc/html/range/reference/algorithms/mutating/nth_element.html index a844b1c..97949e5 100644 --- a/doc/html/range/reference/algorithms/mutating/nth_element.html +++ b/doc/html/range/reference/algorithms/mutating/nth_element.html @@ -2,8 +2,8 @@ nth_element - - + + @@ -13,22 +13,22 @@ - +
      Boost C++ Libraries HomeLibrariesLibraries People FAQ More
      -PrevUpHomeNext +PrevUpHomeNext
      -
      +
      - + Prototype

      @@ -59,7 +59,7 @@

      - + Description

      @@ -70,14 +70,14 @@ is the same as the element that would be in that position if rng has been sorted.

      - + Definition

      Defined in the header file boost/range/algorithm/nth_element.hpp

      - + Requirements

      @@ -85,50 +85,50 @@

      • -RandomAccessRange is - a model of the Random - Access Range Concept. -
        • + RandomAccessRange + is a model of the Random + Access Range Concept. +
      • -RandomAccessRange is - mutable. -
        • + RandomAccessRange + is mutable. +
      • -RandomAccessRange's - value type is a model of the LessThanComparableConcept. -
        • + RandomAccessRange's + value type is a model of the LessThanComparableConcept. +
      • - The ordering relation on RandomAccessRange's - value type is a strict weak ordering, - as defined in the LessThanComparableConcept - requirements. -
        • + The ordering relation on RandomAccessRange's + value type is a strict weak ordering, + as defined in the LessThanComparableConcept + requirements. +

      For the predicate version:

      • -RandomAccessRange is - a model of the Random - Access Range Concept. -
        • + RandomAccessRange + is a model of the Random + Access Range Concept. +
      • -RandomAccessRange is - mutable. -
        • + RandomAccessRange + is mutable. +
      • -BinaryPredicate is - a model of the StrictWeakOrderingConcept. -
        • + BinaryPredicate is + a model of the StrictWeakOrderingConcept. +
      • -RandomAccessRange's - value type is convertible to both of BinaryPredicate's - argument types. -
        • + RandomAccessRange's + value type is convertible to both of BinaryPredicate's + argument types. +
      - + Complexity

      @@ -145,7 +145,7 @@

      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/range/reference/algorithms/mutating/partial_sort.html b/doc/html/range/reference/algorithms/mutating/partial_sort.html index 62c2ec0..1e4c3f2 100644 --- a/doc/html/range/reference/algorithms/mutating/partial_sort.html +++ b/doc/html/range/reference/algorithms/mutating/partial_sort.html @@ -2,8 +2,8 @@ partial_sort - - + + @@ -13,22 +13,22 @@ - +
      Boost C++ Libraries HomeLibrariesLibraries People FAQ More
      -PrevUpHomeNext +PrevUpHomeNext
      -
      +
      - + Prototype

      @@ -59,7 +59,7 @@

      - + Description

      @@ -75,14 +75,14 @@ predicate instead.

      - + Definition

      Defined in the header file boost/range/algorithm/partial_sort.hpp

      - + Requirements

      @@ -90,50 +90,50 @@

      • -RandomAccessRange is - a model of the Random - Access Range Concept. -
        • + RandomAccessRange + is a model of the Random + Access Range Concept. +
      • -RandomAccessRange is - mutable. -
        • + RandomAccessRange + is mutable. +
      • -RandomAccessRange's - value type is a model of the LessThanComparableConcept. -
        • + RandomAccessRange's + value type is a model of the LessThanComparableConcept. +
      • - The ordering relation on RandomAccessRange's - value type is a strict weak ordering, - as defined in the LessThanComparableConcept - requirements. -
        • + The ordering relation on RandomAccessRange's + value type is a strict weak ordering, + as defined in the LessThanComparableConcept + requirements. +

      For the predicate version:

      • -RandomAccessRange is - a model of the Random - Access Range Concept. -
        • + RandomAccessRange + is a model of the Random + Access Range Concept. +
      • -RandomAccessRange is - mutable. -
        • + RandomAccessRange + is mutable. +
      • -BinaryPredicate is - a model of the StrictWeakOrderingConcept. -
        • + BinaryPredicate is + a model of the StrictWeakOrderingConcept. +
      • -RandomAccessRange's - value type is convertible to both of BinaryPredicate's - argument types. -
        • + RandomAccessRange's + value type is convertible to both of BinaryPredicate's + argument types. +
      - + Complexity

      @@ -150,7 +150,7 @@

      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/range/reference/algorithms/mutating/partition.html b/doc/html/range/reference/algorithms/mutating/partition.html index 4798ea1..03c8887 100644 --- a/doc/html/range/reference/algorithms/mutating/partition.html +++ b/doc/html/range/reference/algorithms/mutating/partition.html @@ -2,8 +2,8 @@ partition - - + + @@ -13,21 +13,21 @@ - +
      Boost C++ Libraries HomeLibrariesLibraries People FAQ More
      -PrevUpHomeNext +PrevUpHomeNext
      -
      +
      - + Prototype

      @@ -66,7 +66,7 @@

      - + Description

      @@ -80,34 +80,34 @@ corresponds to the middle iterator.

      - + Definition

      Defined in the header file boost/range/algorithm/partition.hpp

      - + Requirements
      • -ForwardRange is a model - of the Forward Range - Concept. -
        • + ForwardRange is a + model of the Forward + Range Concept. +
      • -UnaryPredicate is a - model of the PredicateConcept. -
        • + UnaryPredicate is + a model of the PredicateConcept. +
      • -ForwardRange's value - type is convertible to UnaryPredicate's - argument type. -
        • + ForwardRange's value + type is convertible to UnaryPredicate's + argument type. +
      - + Complexity

      @@ -126,7 +126,7 @@

      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/range/reference/algorithms/mutating/random_shuffle.html b/doc/html/range/reference/algorithms/mutating/random_shuffle.html index 45aa69e..7337562 100644 --- a/doc/html/range/reference/algorithms/mutating/random_shuffle.html +++ b/doc/html/range/reference/algorithms/mutating/random_shuffle.html @@ -2,8 +2,8 @@ random_shuffle - - + + @@ -13,22 +13,22 @@ - +
      Boost C++ Libraries HomeLibrariesLibraries People FAQ More
      -PrevUpHomeNext +PrevUpHomeNext
      -
      +
      - + Prototype

      @@ -49,7 +49,7 @@

      - + Description

      @@ -61,54 +61,54 @@ the shuffles range.

      - + Definition

      Defined in the header file boost/range/algorithm/random_shuffle.hpp

      - + Requirements

      For the version without a Generator:

      + RandomAccessRange + is a model of the Random + Access Range Concept. +

    For the version with a Generator:

    • -RandomAccessRange is - a model of the Random - Access Range Concept. -
      • + RandomAccessRange + is a model of the Random + Access Range Concept. +
    • -Generator is a model - of the RandomNumberGeneratorConcept. -
      • + Generator is a model + of the RandomNumberGeneratorConcept. +
    • -RandomAccessRange's - distance type is convertible to Generator's - argument type. -
      • + RandomAccessRange's + distance type is convertible to Generator's + argument type. +
    - + Precondition:
    • -distance(rng) - is less than gen's - maximum value. -
    + distance(rng) + is less than gen's + maximum value. +
- + Complexity

@@ -126,7 +126,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/mutating/remove.html b/doc/html/range/reference/algorithms/mutating/remove.html index df9ee6c..b89373e 100644 --- a/doc/html/range/reference/algorithms/mutating/remove.html +++ b/doc/html/range/reference/algorithms/mutating/remove.html @@ -2,8 +2,8 @@ remove - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -66,7 +66,7 @@

- + Description

@@ -83,37 +83,37 @@ are dereferenceable, but the elements are unspecified.

- + Definition

Defined in the header file boost/range/algorithm/remove.hpp

- + Requirements
  • -ForwardRange is a model - of the Forward Range - Concept. -
    • + ForwardRange is a + model of the Forward + Range Concept. +
  • -ForwardRange is mutable. -
    • + ForwardRange is mutable. +
  • -Value is a model of - the EqualityComparableConcept. -
    • + Value is a model + of the EqualityComparableConcept. +
  • - Objects of type Value - can be compared for equality with objects of ForwardRange's - value type. -
    • + Objects of type Value + can be compared for equality with objects of ForwardRange's + value type. +
- + Complexity

@@ -132,7 +132,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/mutating/remove_copy.html b/doc/html/range/reference/algorithms/mutating/remove_copy.html index 4948098..5cfbb05 100644 --- a/doc/html/range/reference/algorithms/mutating/remove_copy.html +++ b/doc/html/range/reference/algorithms/mutating/remove_copy.html @@ -2,8 +2,8 @@ remove_copy - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -45,7 +45,7 @@

- + Description

@@ -54,37 +54,37 @@ rng for which x == val is false.

- + Definition

Defined in the header file boost/range/algorithm/remove_copy.hpp

- + Requirements
  • -ForwardRange is a model - of the Forward Range - Concept. -
    • + ForwardRange is a + model of the Forward + Range Concept. +
  • -ForwardRange is mutable. -
    • + ForwardRange is mutable. +
  • -Value is a model of - the EqualityComparableConcept. -
    • + Value is a model + of the EqualityComparableConcept. +
  • - Objects of type Value - can be compared for equality with objects of ForwardRange's - value type. -
    • + Objects of type Value + can be compared for equality with objects of ForwardRange's + value type. +
- + Complexity

@@ -103,7 +103,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/mutating/remove_copy_if.html b/doc/html/range/reference/algorithms/mutating/remove_copy_if.html index 98fd5d3..2bba221 100644 --- a/doc/html/range/reference/algorithms/mutating/remove_copy_if.html +++ b/doc/html/range/reference/algorithms/mutating/remove_copy_if.html @@ -2,8 +2,8 @@ remove_copy_if - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -45,7 +45,7 @@

- + Description

@@ -55,32 +55,32 @@ is false.

- + Definition

Defined in the header file boost/range/algorithm/remove_copy_if.hpp

- + Requirements
  • -ForwardRange is a model - of the Forward Range - Concept. -
    • + ForwardRange is a + model of the Forward + Range Concept. +
  • -ForwardRange is mutable. -
    • + ForwardRange is mutable. +
  • -UnaryPred is a model - of the UnaryPredicateConcept. -
    • + UnaryPred is a model + of the UnaryPredicateConcept. +
- + Complexity

@@ -98,7 +98,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/mutating/remove_if.html b/doc/html/range/reference/algorithms/mutating/remove_if.html index 2973846..2bfcf89 100644 --- a/doc/html/range/reference/algorithms/mutating/remove_if.html +++ b/doc/html/range/reference/algorithms/mutating/remove_if.html @@ -2,8 +2,8 @@ remove_if - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -66,7 +66,7 @@

- + Description

@@ -82,37 +82,37 @@ are unspecified.

- + Definition

Defined in the header file boost/range/algorithm/remove_if.hpp

- + Requirements
  • -ForwardRange is a model - of the Forward Range - Concept. -
    • + ForwardRange is a + model of the Forward + Range Concept. +
  • -ForwardRange is mutable. -
    • + ForwardRange is mutable. +
  • -UnaryPredicate is a - model of the PredicateConcept. -
    • + UnaryPredicate is + a model of the PredicateConcept. +
  • -ForwardRange's value - type is convertible to UnaryPredicate's - argument type. -
    • + ForwardRange's value + type is convertible to UnaryPredicate's + argument type. +
- + Complexity

@@ -131,7 +131,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/mutating/replace.html b/doc/html/range/reference/algorithms/mutating/replace.html index 695424f..8905444 100644 --- a/doc/html/range/reference/algorithms/mutating/replace.html +++ b/doc/html/range/reference/algorithms/mutating/replace.html @@ -2,8 +2,8 @@ replace - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -48,7 +48,7 @@

- + Description

@@ -57,43 +57,43 @@ Return a reference to rng.

- + Definition

Defined in the header file boost/range/algorithm/replace.hpp

- + Requirements
  • -ForwardRange is a model - of the Forward Range - Concept. -
    • + ForwardRange is a + model of the Forward + Range Concept. +
  • -ForwardRange is mutable. -
    • + ForwardRange is mutable. +
  • -Value is convertible - to ForwardRange's value - type. -
    • + Value is convertible + to ForwardRange's + value type. +
  • -Value is a model of - the AssignableConcept. -
    • + Value is a model + of the AssignableConcept. +
  • -Value is a model of - the EqualityComparableConcept, - and may be compared for equality with objects of ForwardRange's - value type. -
    • + Value is a model + of the EqualityComparableConcept, + and may be compared for equality with objects of ForwardRange's + value type. +
- + Complexity

@@ -112,7 +112,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/mutating/replace_copy.html b/doc/html/range/reference/algorithms/mutating/replace_copy.html index 80dfc2d..cb6170e 100644 --- a/doc/html/range/reference/algorithms/mutating/replace_copy.html +++ b/doc/html/range/reference/algorithms/mutating/replace_copy.html @@ -2,8 +2,8 @@ replace_copy - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -41,7 +41,7 @@

- + Description

@@ -54,41 +54,41 @@ x.

- + Definition

Defined in the header file boost/range/algorithm/replace_copy.hpp

- + Requirements
  • -ForwardRange is a model - of the Forward Range - Concept. -
    • + ForwardRange is a + model of the Forward + Range Concept. +
  • -ForwardRange is mutable. -
    • + ForwardRange is mutable. +
  • -Value is convertible - to ForwardRange's value - type. -
    • + Value is convertible + to ForwardRange's + value type. +
  • -Value is a model of - the AssignableConcept. -
    • + Value is a model + of the AssignableConcept. +
  • -OutputIterator is a - model of the OutputIteratorConcept. -
    • + OutputIterator is + a model of the OutputIteratorConcept. +
- + Complexity

@@ -106,7 +106,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/mutating/replace_copy_if.html b/doc/html/range/reference/algorithms/mutating/replace_copy_if.html index 5d8c9b7..3576862 100644 --- a/doc/html/range/reference/algorithms/mutating/replace_copy_if.html +++ b/doc/html/range/reference/algorithms/mutating/replace_copy_if.html @@ -2,8 +2,8 @@ replace_copy_if - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -41,7 +41,7 @@

- + Description

@@ -52,45 +52,45 @@ : x.

- + Definition

Defined in the header file boost/range/algorithm/replace_copy_if.hpp

- + Requirements
  • -ForwardRange is a model - of the Forward Range - Concept. -
    • + ForwardRange is a + model of the Forward + Range Concept. +
  • -ForwardRange is mutable. -
    • + ForwardRange is mutable. +
  • -Value is convertible - to ForwardRange's value - type. -
    • + Value is convertible + to ForwardRange's + value type. +
  • -Value is a model of - the AssignableConcept. -
    • + Value is a model + of the AssignableConcept. +
  • -OutputIterator is a - model of the OutputIteratorConcept. -
    • + OutputIterator is + a model of the OutputIteratorConcept. +
  • -UnaryPredicate is a - model of the UnaryPredicateConcept. -
    • + UnaryPredicate is + a model of the UnaryPredicateConcept. +
- + Complexity

@@ -108,7 +108,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/mutating/replace_if.html b/doc/html/range/reference/algorithms/mutating/replace_if.html index d3d32f1..34500c7 100644 --- a/doc/html/range/reference/algorithms/mutating/replace_if.html +++ b/doc/html/range/reference/algorithms/mutating/replace_if.html @@ -2,8 +2,8 @@ replace_if - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -43,7 +43,7 @@

- + Description

@@ -52,46 +52,46 @@ Returns a reference to rng.

- + Definition

Defined in the header file boost/range/algorithm/replace_if.hpp

- + Requirements
  • -ForwardRange is a model - of the Forward Range - Concept. -
    • + ForwardRange is a + model of the Forward + Range Concept. +
  • -ForwardRange is mutable. -
    • + ForwardRange is mutable. +
  • -UnaryPredicate is a - model of the PredicateConcept -
    • + UnaryPredicate is + a model of the PredicateConcept +
  • -ForwardRange's value - type is convertible to UnaryPredicate's - argument type. -
    • + ForwardRange's value + type is convertible to UnaryPredicate's + argument type. +
  • -Value is convertible - to ForwardRange's value - type. -
    • + Value is convertible + to ForwardRange's + value type. +
  • -Value is a model of - the AssignableConcept. -
    • + Value is a model + of the AssignableConcept. +
- + Complexity

@@ -111,7 +111,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/mutating/reverse.html b/doc/html/range/reference/algorithms/mutating/reverse.html index 3c77a43..b61b6ad 100644 --- a/doc/html/range/reference/algorithms/mutating/reverse.html +++ b/doc/html/range/reference/algorithms/mutating/reverse.html @@ -2,8 +2,8 @@ reverse - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -42,7 +42,7 @@

- + Description

@@ -50,29 +50,29 @@ Returns a reference to the reversed range.

- + Definition

Defined in the header file boost/range/algorithm/reverse.hpp

- + Requirements
  • -BidirectionalRange - is a model of the Bidirectional - Range Concept. -
    • + BidirectionalRange + is a model of the Bidirectional + Range Concept. +
  • -BidirectionalRange - is mutable. -
    • + BidirectionalRange + is mutable. +
- + Complexity

@@ -90,7 +90,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/mutating/reverse_copy.html b/doc/html/range/reference/algorithms/mutating/reverse_copy.html index f039c9a..0f17aa3 100644 --- a/doc/html/range/reference/algorithms/mutating/reverse_copy.html +++ b/doc/html/range/reference/algorithms/mutating/reverse_copy.html @@ -2,8 +2,8 @@ reverse_copy - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -40,7 +40,7 @@

- + Description

@@ -50,33 +50,33 @@ Returns the output iterator one passed the last copied element.

- + Definition

Defined in the header file boost/range/algorithm/reverse_copy.hpp

- + Requirements
  • -BidirectionalRange - is a model of the Bidirectional - Range Concept. -
    • + BidirectionalRange + is a model of the Bidirectional + Range Concept. +
  • -BidirectionalRange - is mutable. -
    • + BidirectionalRange + is mutable. +
  • -OutputIterator is a - model of the OutputIteratorConcept. -
    • + OutputIterator is + a model of the OutputIteratorConcept. +
- + Complexity

@@ -95,7 +95,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/mutating/rotate.html b/doc/html/range/reference/algorithms/mutating/rotate.html index c5bcb16..cc02c6d 100644 --- a/doc/html/range/reference/algorithms/mutating/rotate.html +++ b/doc/html/range/reference/algorithms/mutating/rotate.html @@ -2,8 +2,8 @@ rotate - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -44,7 +44,7 @@

- + Description

@@ -53,40 +53,40 @@ and [middle, end(rng)). Returns a reference to rng.

- + Definition

Defined in the header file boost/range/algorithm/rotate.hpp

- + Requirements
  • -ForwardRange is a model - of the Forward Range - Concept. -
    • + ForwardRange is a + model of the Forward + Range Concept. +
  • -ForwardRange is mutable. -
    • + ForwardRange is mutable. +
- + Precondition:
  • -[begin(rng), middle) is a valid range. -
    • + [begin(rng), middle) is a valid range. +
  • -[middle, end(rng)) is a valid range. -
    • + [middle, end(rng)) is a valid range. +
- + Complexity

@@ -103,7 +103,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/mutating/rotate_copy.html b/doc/html/range/reference/algorithms/mutating/rotate_copy.html index dc159d7..0513dff 100644 --- a/doc/html/range/reference/algorithms/mutating/rotate_copy.html +++ b/doc/html/range/reference/algorithms/mutating/rotate_copy.html @@ -2,8 +2,8 @@ rotate_copy - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -43,7 +43,7 @@

- + Description

@@ -52,44 +52,44 @@ and [middle, end(rng)) to out.

- + Definition

Defined in the header file boost/range/algorithm/rotate_copy.hpp

- + Requirements
  • -ForwardRange is a model - of the Forward Range - Concept. -
    • + ForwardRange is a + model of the Forward + Range Concept. +
  • -ForwardRange is mutable. -
    • + ForwardRange is mutable. +
  • -OutputIterator is a - model of the OutputIteratorConcept. -
    • + OutputIterator is + a model of the OutputIteratorConcept. +
- + Precondition:
  • -[begin(rng), middle) is a valid range. -
    • + [begin(rng), middle) is a valid range. +
  • -[middle, end(rng)) is a valid range. -
    • + [middle, end(rng)) is a valid range. +
- + Complexity

@@ -106,7 +106,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/mutating/sort.html b/doc/html/range/reference/algorithms/mutating/sort.html index 543f388..b13f968 100644 --- a/doc/html/range/reference/algorithms/mutating/sort.html +++ b/doc/html/range/reference/algorithms/mutating/sort.html @@ -2,8 +2,8 @@ sort - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -48,7 +48,7 @@

- + Description

@@ -71,14 +71,14 @@ [x,y], pred(y, x) == false.

- + Definition

Defined in the header file boost/range/algorithm/sort.hpp

- + Requirements

@@ -86,50 +86,50 @@

  • -RandomAccessRange is - a model of the Random - Access Range Concept. -
    • + RandomAccessRange + is a model of the Random + Access Range Concept. +
  • -RandomAccessRange is - mutable. -
    • + RandomAccessRange + is mutable. +
  • -RandomAccessRange's - value type is a model of the LessThanComparableConcept. -
    • + RandomAccessRange's + value type is a model of the LessThanComparableConcept. +
  • - The ordering relation on RandomAccessRange's - value type is a strict weak ordering, - as defined in the LessThanComparableConcept - requirements. -
    • + The ordering relation on RandomAccessRange's + value type is a strict weak ordering, + as defined in the LessThanComparableConcept + requirements. +

For versions of sort with a predicate

  • -RandomAccessRange is - a model of the Random - Access Range Concept. -
    • + RandomAccessRange + is a model of the Random + Access Range Concept. +
  • -RandomAccessRange is - mutable. -
    • + RandomAccessRange + is mutable. +
  • -BinaryPredicate is - a model of the StrictWeakOrderingConcept. -
    • + BinaryPredicate is + a model of the StrictWeakOrderingConcept. +
  • -RandomAccessRange's - value type is convertible to both of BinaryPredicate's - argument types. -
    • + RandomAccessRange's + value type is convertible to both of BinaryPredicate's + argument types. +
- + Complexity

@@ -147,7 +147,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/mutating/stable_partition.html b/doc/html/range/reference/algorithms/mutating/stable_partition.html index 1bd0ef4..7926ec7 100644 --- a/doc/html/range/reference/algorithms/mutating/stable_partition.html +++ b/doc/html/range/reference/algorithms/mutating/stable_partition.html @@ -2,8 +2,8 @@ stable_partition - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -61,7 +61,7 @@

- + Description

@@ -83,32 +83,32 @@ the iterator to the first element that fails to satisfy pred.

- + Definition

Defined in the header file boost/range/algorithm/stable_partition.hpp

- + Requirements
  • -ForwardRange is a model - of the Forward Range - Concept. -
    • + ForwardRange is a + model of the Forward + Range Concept. +
  • -ForwardRange is mutable. -
    • + ForwardRange is mutable. +
  • -UnaryPredicate is a - model of the PredicateConcept. -
    • + UnaryPredicate is + a model of the PredicateConcept. +
- + Complexity

@@ -129,7 +129,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/mutating/stable_sort.html b/doc/html/range/reference/algorithms/mutating/stable_sort.html index afce5c9..651476d 100644 --- a/doc/html/range/reference/algorithms/mutating/stable_sort.html +++ b/doc/html/range/reference/algorithms/mutating/stable_sort.html @@ -2,8 +2,8 @@ stable_sort - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -49,7 +49,7 @@

- + Description

@@ -72,14 +72,14 @@ [x,y], pred(y,x) == false.

- + Definition

Defined in the header file boost/range/algorithm/stable_sort.hpp

- + Requirements

@@ -87,50 +87,50 @@

  • -RandomAccessRange is - a model of the Random - Access Range Concept. -
    • + RandomAccessRange + is a model of the Random + Access Range Concept. +
  • -RandomAccessRange is - mutable. -
    • + RandomAccessRange + is mutable. +
  • -RandomAccessRange's - value type is a model of the LessThanComparableConcept. -
    • + RandomAccessRange's + value type is a model of the LessThanComparableConcept. +
  • - The ordering relation on RandomAccessRange's - value type is a strict weak ordering, - as defined in the LessThanComparableConcept - requirements. -
    • + The ordering relation on RandomAccessRange's + value type is a strict weak ordering, + as defined in the LessThanComparableConcept + requirements. +

For versions of stable_sort with a predicate:

  • -RandomAccessRange is - a model of the Random - Access Range Concept. -
    • + RandomAccessRange + is a model of the Random + Access Range Concept. +
  • -RandomAccessRange is - mutable. -
    • + RandomAccessRange + is mutable. +
  • -BinaryPredicate is - a model of the StrictWeakOrderingConcept. -
    • + BinaryPredicate is + a model of the StrictWeakOrderingConcept. +
  • -RandomAccessRange's - value type is convertible to both of BinaryPredicate's - argument types. -
    • + RandomAccessRange's + value type is convertible to both of BinaryPredicate's + argument types. +
- + Complexity

@@ -151,7 +151,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/mutating/swap_ranges.html b/doc/html/range/reference/algorithms/mutating/swap_ranges.html index 43e30b5..70466d5 100644 --- a/doc/html/range/reference/algorithms/mutating/swap_ranges.html +++ b/doc/html/range/reference/algorithms/mutating/swap_ranges.html @@ -2,8 +2,8 @@ swap_ranges - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -40,7 +40,7 @@

- + Description

@@ -50,38 +50,38 @@ Returns a reference to rng2.

- + Definition

Defined in the header file boost/range/algorithm/swap_ranges.hpp

- + Requirements
  • -SinglePassRange1 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange1 + is a model of the Single + Pass Range Concept. +
  • -SinglePassRange1 is - mutable. -
    • + SinglePassRange1 + is mutable. +
  • -SinglePassRange2 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange2 + is a model of the Single + Pass Range Concept. +
  • -SinglePassRange2 is - mutable. -
    • + SinglePassRange2 + is mutable. +
- + Complexity

@@ -98,7 +98,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/mutating/transform.html b/doc/html/range/reference/algorithms/mutating/transform.html index 7325f42..9f6c8ff 100644 --- a/doc/html/range/reference/algorithms/mutating/transform.html +++ b/doc/html/range/reference/algorithms/mutating/transform.html @@ -2,8 +2,8 @@ transform - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -56,7 +56,7 @@

- + Description

@@ -92,14 +92,14 @@ The return value is out + min(distance(rng1), distance(rng2)).

- + Definition

Defined in the header file boost/range/algorithm/transform.hpp

- + Requirements

@@ -107,69 +107,69 @@

  • -SinglePassRange1 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange1 + is a model of the Single + Pass Range Concept. +
  • -OutputIterator is a - model of the OutputIteratorConcept. -
    • + OutputIterator is + a model of the OutputIteratorConcept. +
  • -UnaryOperation is a - model of the UnaryFunctionConcept. -
    • + UnaryOperation is + a model of the UnaryFunctionConcept. +
  • -SinglePassRange1's - value type must be convertible to UnaryFunction's - argument type. -
    • + SinglePassRange1's + value type must be convertible to UnaryFunction's + argument type. +
  • -UnaryFunction's result - type must be convertible to a type in OutputIterator's - set of value types. -
    • + UnaryFunction's result + type must be convertible to a type in OutputIterator's + set of value types. +

For the binary versions of transform:

  • -SinglePassRange1 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange1 + is a model of the Single + Pass Range Concept. +
  • -SinglePassRange2 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange2 + is a model of the Single + Pass Range Concept. +
  • -OutputIterator is a - model of the OutputIteratorConcept. -
    • + OutputIterator is + a model of the OutputIteratorConcept. +
  • -BinaryOperation is - a model of the BinaryFunctionConcept. -
    • + BinaryOperation is + a model of the BinaryFunctionConcept. +
  • -SinglePassRange1's - value type must be convertible to BinaryFunction's - first argument type. -
    • + SinglePassRange1's + value type must be convertible to BinaryFunction's + first argument type. +
  • -SinglePassRange2's - value type must be convertible to BinaryFunction's - second argument type. -
    • + SinglePassRange2's + value type must be convertible to BinaryFunction's + second argument type. +
  • -BinaryOperation's result - type must be convertible to a type in OutputIterator's - set of value types. -
    • + BinaryOperation's + result type must be convertible to a type in OutputIterator's + set of value types. +
- + Precondition:

@@ -177,31 +177,33 @@

  • -out is not an iterator - within the range [begin(rng1) + 1, end(rng1)). -
    • + out is not an iterator + within the range [begin(rng1) + 1, end(rng1)). +
  • -[out, out + distance(rng1)) is a valid range. -
    • + [out, out + + distance(rng1)) is a valid range. +

For the binary version of transform:

  • -out is not an iterator - within the range [begin(rng1) + 1, end(rng1)). -
    • + out is not an iterator + within the range [begin(rng1) + 1, end(rng1)). +
  • -out is not an iterator - within the range [begin(rng2) + 1, end(rng2)). -
    • + out is not an iterator + within the range [begin(rng2) + 1, end(rng2)). +
  • -[out, out + min(distance(rng1), distance(rng2))) is a valid range. -
    • + [out, out + + min(distance(rng1), distance(rng2))) is a valid range. +
- + Complexity

@@ -219,7 +221,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/mutating/unique.html b/doc/html/range/reference/algorithms/mutating/unique.html index 8f77088..1f31285 100644 --- a/doc/html/range/reference/algorithms/mutating/unique.html +++ b/doc/html/range/reference/algorithms/mutating/unique.html @@ -2,8 +2,8 @@ unique - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -68,7 +68,7 @@

- + Description

@@ -86,14 +86,14 @@ type.

- + Definition

Defined in the header file boost/range/algorithm/unique.hpp

- + Requirements

@@ -101,43 +101,43 @@

  • -ForwardRange is a model - of the Forward Range - Concept. -
    • + ForwardRange is a + model of the Forward + Range Concept. +
  • -ForwardRange is mutable. -
    • + ForwardRange is mutable. +
  • -ForwardRange's value - type is a model of the EqualityComparableConcept. -
    • + ForwardRange's value + type is a model of the EqualityComparableConcept. +

For the predicate versions of unique:

  • -ForwardRange is a model - of the Forward Range - Concept. -
    • + ForwardRange is a + model of the Forward + Range Concept. +
  • -ForwardRange is mutable. -
    • + ForwardRange is mutable. +
  • -BinaryPredicate is - a model of the BinaryPredicateConcept. -
    • + BinaryPredicate is + a model of the BinaryPredicateConcept. +
  • -ForwardRange's value - type is convertible to BinaryPredicate's - first argument type and to BinaryPredicate's - second argument type. -
    • + ForwardRange's value + type is convertible to BinaryPredicate's + first argument type and to BinaryPredicate's + second argument type. +
- + Complexity

@@ -157,7 +157,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/mutating/unique_copy.html b/doc/html/range/reference/algorithms/mutating/unique_copy.html index 85ad5a1..7d6c564 100644 --- a/doc/html/range/reference/algorithms/mutating/unique_copy.html +++ b/doc/html/range/reference/algorithms/mutating/unique_copy.html @@ -2,8 +2,8 @@ unique_copy - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -43,7 +43,7 @@

- + Description

@@ -56,14 +56,14 @@ value type.

- + Definition

Defined in the header file boost/range/algorithm/unique_copy.hpp

- + Requirements

@@ -71,53 +71,53 @@

  • -SinglePassRange is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange is + a model of the Single + Pass Range Concept. +
  • -SinglePassRange is - mutable. -
    • + SinglePassRange is + mutable. +
  • -SinglePassRange's value - type is a model of the EqualityComparableConcept. -
    • + SinglePassRange's + value type is a model of the EqualityComparableConcept. +
  • -OutputIterator is a - model of the OutputIteratorConcept. -
    • + OutputIterator is + a model of the OutputIteratorConcept. +

For the predicate versions of unique:

  • -SinglePassRange is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange is + a model of the Single + Pass Range Concept. +
  • -SinglePassRange is - mutable. -
    • + SinglePassRange is + mutable. +
  • -BinaryPredicate is - a model of the BinaryPredicateConcept. -
    • + BinaryPredicate is + a model of the BinaryPredicateConcept. +
  • -SinglePassRange's value - type is convertible to BinaryPredicate's - first argument type and to BinaryPredicate's - second argument type. -
    • + SinglePassRange's + value type is convertible to BinaryPredicate's + first argument type and to BinaryPredicate's + second argument type. +
  • -OutputIterator is a - model of the OutputIteratorConcept. -
    • + OutputIterator is + a model of the OutputIteratorConcept. +
- + Complexity

@@ -137,7 +137,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/new.html b/doc/html/range/reference/algorithms/new.html index d07ac11..2fc36d9 100644 --- a/doc/html/range/reference/algorithms/new.html +++ b/doc/html/range/reference/algorithms/new.html @@ -2,8 +2,8 @@ New algorithms - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -51,7 +51,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/new/copy_n.html b/doc/html/range/reference/algorithms/new/copy_n.html index 6a32d1c..7aa2e72 100644 --- a/doc/html/range/reference/algorithms/new/copy_n.html +++ b/doc/html/range/reference/algorithms/new/copy_n.html @@ -2,8 +2,8 @@ copy_n - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -39,7 +39,7 @@

- + Description

@@ -53,33 +53,33 @@ from [boost::begin(rng), boost::begin(rng) + n) to the range [out, out + n)

- + Definition

Defined in the header file boost/range/algorithm_ext/copy_n.hpp

- + Requirements
  1. -SinglePassRange is - a model of the Single - Pass Range Concept. -
    2. + SinglePassRange is + a model of the Single + Pass Range Concept. +
  2. -Size is a model of - the Integer Concept. -
    3. + Size is a model of + the Integer Concept. +
  3. -OutputIterator is a - model of the OutputIteratorConcept. -
    4. + OutputIterator is + a model of the OutputIteratorConcept. +
- + Complexity

@@ -97,7 +97,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/new/erase.html b/doc/html/range/reference/algorithms/new/erase.html index ac672ce..cf269ac 100644 --- a/doc/html/range/reference/algorithms/new/erase.html +++ b/doc/html/range/reference/algorithms/new/erase.html @@ -2,8 +2,8 @@ erase - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -41,7 +41,7 @@

- + Description

@@ -58,22 +58,22 @@ the frequently used combination equivalent to target.erase(std::remove_if(target.begin(), target.end(), pred), target.end());

- + Definition

Defined in the header file boost/range/algorithm_ext/erase.hpp

- + Requirements
  1. -Container supports - erase of an iterator range. -
+ Container supports + erase of an iterator range. +
- + Complexity

@@ -90,7 +90,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/new/for_each.html b/doc/html/range/reference/algorithms/new/for_each.html index f21aab0..3895da8 100644 --- a/doc/html/range/reference/algorithms/new/for_each.html +++ b/doc/html/range/reference/algorithms/new/for_each.html @@ -2,8 +2,8 @@ for_each - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -72,7 +72,7 @@

- + Description

@@ -88,44 +88,44 @@ It is safe to call this function with unequal length ranges.

- + Definition

Defined in the header file boost/range/algorithm_ext/for_each.hpp

- + Requirements
  1. -SinglePassRange1 is - a model of the Single - Pass Range Concept. -
    2. + SinglePassRange1 + is a model of the Single + Pass Range Concept. +
  2. -SinglePassRange2 is - a model of the Single - Pass Range Concept. -
    3. + SinglePassRange2 + is a model of the Single + Pass Range Concept. +
  3. -BinaryFunction is a - model of the BinaryFunctionConcept. -
    4. + BinaryFunction is + a model of the BinaryFunctionConcept. +
  4. -SinglePassRange1's - value type is convertible to BinaryFunction's - first argument type. -
    5. + SinglePassRange1's + value type is convertible to BinaryFunction's + first argument type. +
  5. -SinglepassRange2's - value type is convertible to BinaryFunction's - second argument type. -
    6. + SinglepassRange2's + value type is convertible to BinaryFunction's + second argument type. +
- + Complexity

@@ -143,7 +143,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/new/insert.html b/doc/html/range/reference/algorithms/new/insert.html index f781319..11f7881 100644 --- a/doc/html/range/reference/algorithms/new/insert.html +++ b/doc/html/range/reference/algorithms/new/insert.html @@ -2,8 +2,8 @@ insert - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -44,7 +44,7 @@

- + Description

@@ -54,34 +54,34 @@ target.

- + Definition

Defined in the header file boost/range/algorithm_ext/insert.hpp

- + Requirements
  1. -SinglePassRange is - a model of the Single - Pass Range Concept. -
    2. + SinglePassRange is + a model of the Single + Pass Range Concept. +
  2. -Container supports - insert at a specified position. -
    3. + Container supports + insert at a specified position. +
  3. -SinglePassRange's value - type is convertible to Container's - value type. -
    4. + SinglePassRange's + value type is convertible to Container's + value type. +
- + Complexity

@@ -99,7 +99,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/new/iota.html b/doc/html/range/reference/algorithms/new/iota.html index e068eb1..0409a44 100644 --- a/doc/html/range/reference/algorithms/new/iota.html +++ b/doc/html/range/reference/algorithms/new/iota.html @@ -2,8 +2,8 @@ iota - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -39,7 +39,7 @@

- + Description

@@ -50,29 +50,30 @@ + boost::distance(boost::begin(rng), it)

- + Definition

Defined in the header file boost/range/algorithm_ext/iota.hpp

- + Requirements
  1. -ForwardRange is a model - of the Forward Range - Concept. -
    2. + ForwardRange is a + model of the Forward + Range Concept. +
  2. -Value is a model of - the Incrementable Concept. -
    3. + Value is a model + of the Incrementable + Concept. +
- + Complexity

@@ -89,7 +90,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/new/is_sorted.html b/doc/html/range/reference/algorithms/new/is_sorted.html index 522248e..02ac6d5 100644 --- a/doc/html/range/reference/algorithms/new/is_sorted.html +++ b/doc/html/range/reference/algorithms/new/is_sorted.html @@ -2,8 +2,8 @@ is_sorted - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -42,7 +42,7 @@

- + Description

@@ -58,34 +58,34 @@ is true.

- + Definition

Defined in the header file boost/range/algorithm_ext/is_sorted.hpp

- + Requirements
  1. -SinglePassRange is - a model of the Single - Pass Range Concept. -
    2. + SinglePassRange is + a model of the Single + Pass Range Concept. +
  2. -BinaryPredicate is - a model of the BinaryPredicate - Concept. -
    3. + BinaryPredicate is + a model of the BinaryPredicate + Concept. +
  3. - The value type of SinglePassRange - is convertible to both argument types of BinaryPredicate. -
    4. + The value type of SinglePassRange + is convertible to both argument types of BinaryPredicate. +
- + Complexity

@@ -102,7 +102,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/new/overwrite.html b/doc/html/range/reference/algorithms/new/overwrite.html index 81d3bf6..8cc81a3 100644 --- a/doc/html/range/reference/algorithms/new/overwrite.html +++ b/doc/html/range/reference/algorithms/new/overwrite.html @@ -2,8 +2,8 @@ overwrite - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -43,7 +43,7 @@

- + Description

@@ -52,41 +52,43 @@ into the range to.

- + Definition

Defined in the header file boost/range/algorithm_ext/overwrite.hpp

- + Requirements
  1. -SinglePassRange1 is - a model of the Single - Pass Range Concept. -
    2. + SinglePassRange1 + is a model of the Single + Pass Range Concept. +
  2. -SinglePassRange2 is - a model of the Single - Pass Range Concept. -
    3. + SinglePassRange2 + is a model of the Single + Pass Range Concept. +
  3. -SinglePassRange2 is - mutable. -
    4. -
  4. distance(SinglePassRange1) - <= distance(SinglePassRange2)
    5. + SinglePassRange2 + is mutable. +
  5. -SinglePassRange1's - value type is convertible to SinglePassRange2's - value type. -
    6. + distance(SinglePassRange1) + <= distance(SinglePassRange2) + +
  6. + SinglePassRange1's + value type is convertible to SinglePassRange2's + value type. +
- + Complexity

@@ -104,7 +106,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/new/push_back.html b/doc/html/range/reference/algorithms/new/push_back.html index f9287a5..c369cec 100644 --- a/doc/html/range/reference/algorithms/new/push_back.html +++ b/doc/html/range/reference/algorithms/new/push_back.html @@ -2,8 +2,8 @@ push_back - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -43,7 +43,7 @@

- + Description

@@ -52,34 +52,34 @@ to the back of the container target.

- + Definition

Defined in the header file boost/range/algorithm_ext/push_back.hpp

- + Requirements
  1. -SinglePassRange is - a model of the Single - Pass Range Concept. -
    2. + SinglePassRange is + a model of the Single + Pass Range Concept. +
  2. -Container supports - insert at end(). -
    3. + Container supports + insert at end(). +
  3. -SinglePassRange's value - type is convertible to Container's - value type. -
    4. + SinglePassRange's + value type is convertible to Container's + value type. +
- + Complexity

@@ -97,7 +97,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/new/push_front.html b/doc/html/range/reference/algorithms/new/push_front.html index c0f4312..c4461cb 100644 --- a/doc/html/range/reference/algorithms/new/push_front.html +++ b/doc/html/range/reference/algorithms/new/push_front.html @@ -2,8 +2,8 @@ push_front - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -43,7 +43,7 @@

- + Description

@@ -52,34 +52,34 @@ to the front of the container target.

- + Definition

Defined in the header file boost/range/algorithm_ext/push_front.hpp

- + Requirements
  1. -SinglePassRange is - a model of the Single - Pass Range Concept. -
    2. + SinglePassRange is + a model of the Single + Pass Range Concept. +
  2. -Container supports - insert at begin(). -
    3. + Container supports + insert at begin(). +
  3. -SinglePassRange's value - type is convertible to Container's - value type. -
    4. + SinglePassRange's + value type is convertible to Container's + value type. +
- + Complexity

@@ -97,7 +97,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/new/remove_erase.html b/doc/html/range/reference/algorithms/new/remove_erase.html index 94886a6..c1357c9 100644 --- a/doc/html/range/reference/algorithms/new/remove_erase.html +++ b/doc/html/range/reference/algorithms/new/remove_erase.html @@ -2,8 +2,8 @@ remove_erase - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -40,7 +40,7 @@

- + Description

@@ -50,22 +50,22 @@ algorithm which merely rearranges elements.

- + Definition

Defined in the header file boost/range/algorithm_ext/erase.hpp

- + Requirements
  1. -Container supports - erase of an iterator range. -
+ Container supports + erase of an iterator range. +
- + Complexity

@@ -82,7 +82,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/new/remove_erase_if.html b/doc/html/range/reference/algorithms/new/remove_erase_if.html index 024c4b3..616cb3a 100644 --- a/doc/html/range/reference/algorithms/new/remove_erase_if.html +++ b/doc/html/range/reference/algorithms/new/remove_erase_if.html @@ -2,8 +2,8 @@ remove_erase_if - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -41,7 +41,7 @@

- + Description

@@ -52,28 +52,28 @@ algorithm which merely rearranges elements.

- + Definition

Defined in the header file boost/range/algorithm_ext/erase.hpp

- + Requirements
  1. -Container supports - erase of an iterator range. -
    2. + Container supports + erase of an iterator range. +
  2. -Pred is a model of - the Predicate Concept. -
    3. + Pred is a model of + the Predicate Concept. +
- + Complexity

@@ -90,7 +90,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/non_mutating.html b/doc/html/range/reference/algorithms/non_mutating.html index f25a857..ef22f2d 100644 --- a/doc/html/range/reference/algorithms/non_mutating.html +++ b/doc/html/range/reference/algorithms/non_mutating.html @@ -2,8 +2,8 @@ Non-mutating algorithms - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+

Non-mutating algorithms @@ -75,7 +75,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html b/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html index 41a16a1..3fe8854 100644 --- a/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html +++ b/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html @@ -2,8 +2,8 @@ adjacent_find - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -77,7 +77,7 @@

- + Description

@@ -98,14 +98,14 @@ is true.

- + Definition

Defined in the header file boost/range/algorithm/adjacent_find.hpp

- + Requirements

@@ -113,37 +113,37 @@

  • -ForwardRange is a model - of the Forward Range - Concept. -
    • + ForwardRange is a + model of the Forward + Range Concept. +
  • -ForwardRange's value - type is a model of the EqualityComparableConcept. -
    • + ForwardRange's value + type is a model of the EqualityComparableConcept. +

For the predicate versions of adjacent_find:

  • -ForwardRange is a model - of the Forward Range - Concept. -
    • + ForwardRange is a + model of the Forward + Range Concept. +
  • -BinaryPredicate is - a model of the BinaryPredicateConcept. -
    • + BinaryPredicate is + a model of the BinaryPredicateConcept. +
  • -ForwardRange's value - type is convertible to BinaryPredicate's - first argument type and to BinaryPredicate's - second argument type. -
    • + ForwardRange's value + type is convertible to BinaryPredicate's + first argument type and to BinaryPredicate's + second argument type. +
- + Complexity

@@ -162,7 +162,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/non_mutating/binary_search.html b/doc/html/range/reference/algorithms/non_mutating/binary_search.html index b44a77f..ec72416 100644 --- a/doc/html/range/reference/algorithms/non_mutating/binary_search.html +++ b/doc/html/range/reference/algorithms/non_mutating/binary_search.html @@ -2,8 +2,8 @@ binary_search - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -43,7 +43,7 @@

- + Description

@@ -53,14 +53,14 @@ range rng.

- + Definition

Defined in the header file boost/range/algorithm/binary_search.hpp

- + Requirements

@@ -68,50 +68,50 @@

  • -ForwardRange is a model - of the Forward Range - Concept. -
    • + ForwardRange is a + model of the Forward + Range Concept. +
  • -Value is a model of - the LessThanComparableConcept. -
    • + Value is a model + of the LessThanComparableConcept. +
  • - The ordering of objects of type Value - is a strict weak ordering, - as defined in the LessThanComparableConcept - requirements. -
    • + The ordering of objects of type Value + is a strict weak ordering, + as defined in the LessThanComparableConcept + requirements. +
  • -ForwardRange's value - type is the same type as Value. -
    • + ForwardRange's value + type is the same type as Value. +

For the predicate versions of binary_search:

  • -ForwardRange is a model - of the Forward Range - Concept. -
    • + ForwardRange is a + model of the Forward + Range Concept. +
  • -BinaryPredicate is - a model of the StrictWeakOrderingConcept. -
    • + BinaryPredicate is + a model of the StrictWeakOrderingConcept. +
  • -ForwardRange's value - type is the same type as Value. -
    • + ForwardRange's value + type is the same type as Value. +
  • -ForwardRange's value - type is convertible to BinaryPredicate's - argument type. -
    • + ForwardRange's value + type is convertible to BinaryPredicate's + argument type. +
- + Precondition:

@@ -129,7 +129,7 @@ order according to the function object pred.

- + Complexity

@@ -151,7 +151,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/non_mutating/count.html b/doc/html/range/reference/algorithms/non_mutating/count.html index 8c23e6a..d4bc82f 100644 --- a/doc/html/range/reference/algorithms/non_mutating/count.html +++ b/doc/html/range/reference/algorithms/non_mutating/count.html @@ -2,8 +2,8 @@ count - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -44,7 +44,7 @@

- + Description

@@ -54,37 +54,37 @@ is true.

- + Definition

Defined in the header file boost/range/algorithm/count.hpp

- + Requirements
  • -SinglePassRange is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange is + a model of the Single + Pass Range Concept. +
  • -Value is a model of - the EqualityComparableConcept. -
    • + Value is a model + of the EqualityComparableConcept. +
  • -SinglePassRange's value - type is a model of the EqualityComparableConcept. -
    • + SinglePassRange's + value type is a model of the EqualityComparableConcept. +
  • - An object of SinglePassRange's - value type can be compared for equality with an object of type Value. -
    • + An object of SinglePassRange's + value type can be compared for equality with an object of type Value. +
- + Complexity

@@ -101,7 +101,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/non_mutating/count_if.html b/doc/html/range/reference/algorithms/non_mutating/count_if.html index 3708ff7..dd40eb3 100644 --- a/doc/html/range/reference/algorithms/non_mutating/count_if.html +++ b/doc/html/range/reference/algorithms/non_mutating/count_if.html @@ -2,8 +2,8 @@ count_if - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -41,7 +41,7 @@

- + Description

@@ -51,37 +51,37 @@ is true.

- + Definition

Defined in the header file boost/range/algorithm/count_if.hpp

- + Requirements
  • -SinglePassRange is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange is + a model of the Single + Pass Range Concept. +
  • -UnaryPredicate is a - model of the UnaryPredicateConcept. -
    • + UnaryPredicate is + a model of the UnaryPredicateConcept. +
  • -SinglePassRange's value - type is a model of the EqualityComparableConcept. -
    • + SinglePassRange's + value type is a model of the EqualityComparableConcept. +
  • - The value type of SinglePassRange - is convertible to the argument type of UnaryPredicate. -
    • + The value type of SinglePassRange + is convertible to the argument type of UnaryPredicate. +
- + Complexity

@@ -98,7 +98,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/non_mutating/equal.html b/doc/html/range/reference/algorithms/non_mutating/equal.html index 8909fbd..9eada88 100644 --- a/doc/html/range/reference/algorithms/non_mutating/equal.html +++ b/doc/html/range/reference/algorithms/non_mutating/equal.html @@ -2,8 +2,8 @@ equal - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -52,7 +52,7 @@

- + Description

@@ -70,14 +70,14 @@ considered equal in the predicate version if pred(x,y) is true.

- + Definition

Defined in the header file boost/range/algorithm/equal.hpp

- + Requirements

@@ -85,60 +85,60 @@

  • -SinglePassRange1 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange1 + is a model of the Single + Pass Range Concept. +
  • -SinglePassRange2 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange2 + is a model of the Single + Pass Range Concept. +
  • -SinglePassRange1's - value type is a model of the EqualityComparableConcept. -
    • + SinglePassRange1's + value type is a model of the EqualityComparableConcept. +
  • -SinglePassRange2's - value type is a model of the EqualityComparableConcept. -
    • + SinglePassRange2's + value type is a model of the EqualityComparableConcept. +
  • -SinglePassRange1's - value type can be compared for equality with SinglePassRange2's - value type. -
    • + SinglePassRange1's + value type can be compared for equality with SinglePassRange2's + value type. +

For the predicate versions:

  • -SinglePassRange1 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange1 + is a model of the Single + Pass Range Concept. +
  • -SinglePassRange2 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange2 + is a model of the Single + Pass Range Concept. +
  • -BinaryPredicate is - a model of the BinaryPredicateConcept. -
    • + BinaryPredicate is + a model of the BinaryPredicateConcept. +
  • -SinglePassRange1's - value type is convertible to BinaryPredicate's - first argument type. -
    • + SinglePassRange1's + value type is convertible to BinaryPredicate's + first argument type. +
  • -SinglePassRange2's - value type is convertible to BinaryPredicate's - second argument type. -
    • + SinglePassRange2's + value type is convertible to BinaryPredicate's + second argument type. +
- + Complexity

@@ -156,7 +156,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/non_mutating/equal_range.html b/doc/html/range/reference/algorithms/non_mutating/equal_range.html index 247e97a..a4ecd23 100644 --- a/doc/html/range/reference/algorithms/non_mutating/equal_range.html +++ b/doc/html/range/reference/algorithms/non_mutating/equal_range.html @@ -2,8 +2,8 @@ equal_range - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -71,7 +71,7 @@

- + Description

@@ -85,14 +85,14 @@ is determined by pred.

- + Definition

Defined in the header file boost/range/algorithm/equal_range.hpp

- + Requirements

@@ -100,50 +100,50 @@

  • -ForwardRange is a model - of the Forward Range - Concept. -
    • + ForwardRange is a + model of the Forward + Range Concept. +
  • -Value is a model of - the LessThanComparableConcept. -
    • + Value is a model + of the LessThanComparableConcept. +
  • - The ordering of objects of type Value - is a strict weak ordering, - as defined in the LessThanComparableConcept - requirements. -
    • + The ordering of objects of type Value + is a strict weak ordering, + as defined in the LessThanComparableConcept + requirements. +
  • -ForwardRange's value - type is the same type as Value. -
    • + ForwardRange's value + type is the same type as Value. +

For the predicate versions:

  • -ForwardRange is a model - of the Forward Range - Concept. -
    • + ForwardRange is a + model of the Forward + Range Concept. +
  • -SortPredicate is a - model of the StrictWeakOrderingConcept. -
    • + SortPredicate is + a model of the StrictWeakOrderingConcept. +
  • -ForwardRange's value - type is the same as Value. -
    • + ForwardRange's value + type is the same as Value. +
  • -ForwardRange's value - type is convertible to both of SortPredicate's - argument types. -
    • + ForwardRange's value + type is convertible to both of SortPredicate's + argument types. +
- + Precondition:

@@ -155,7 +155,7 @@ is ordered in ascending order according to pred.

- + Complexity

@@ -173,7 +173,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/non_mutating/find.html b/doc/html/range/reference/algorithms/non_mutating/find.html index f67262b..b30680d 100644 --- a/doc/html/range/reference/algorithms/non_mutating/find.html +++ b/doc/html/range/reference/algorithms/non_mutating/find.html @@ -2,8 +2,8 @@ find - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -48,7 +48,7 @@

- + Description

@@ -59,35 +59,35 @@ same manner as the returned iterator described above.

- + Definition

Defined in the header file boost/range/algorithm/find.hpp

- + Requirements
  • -SinglePassRange is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange is + a model of the Single + Pass Range Concept. +
  • -Value is a model of - the EqualityComparableConcept. -
    • + Value is a model + of the EqualityComparableConcept. +
  • - The operator== - is defined for type Value - to be compared with the SinglePassRange's - value type. -
    • + The operator== + is defined for type Value + to be compared with the SinglePassRange's + value type. +
- + Complexity

@@ -104,7 +104,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/non_mutating/find_end.html b/doc/html/range/reference/algorithms/non_mutating/find_end.html index 07b117b..15261d1 100644 --- a/doc/html/range/reference/algorithms/non_mutating/find_end.html +++ b/doc/html/range/reference/algorithms/non_mutating/find_end.html @@ -2,8 +2,8 @@ find_end - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -66,7 +66,7 @@

- + Description

@@ -81,14 +81,14 @@ same manner as the returned iterator described above.

- + Definition

Defined in the header file boost/range/algorithm/find_end.hpp

- + Requirements

@@ -96,59 +96,59 @@

  • -ForwardRange1 is a - model of the Forward Range - Concept. -
    • + ForwardRange1 is + a model of the Forward + Range Concept. +
  • -ForwardRange2 is a - model of the Forward Range - Concept. -
    • + ForwardRange2 is + a model of the Forward + Range Concept. +
  • -ForwardRange1's value - type is a model of the EqualityComparableConcept. -
    • + ForwardRange1's value + type is a model of the EqualityComparableConcept. +
  • -ForwardRange2's value - type is a model of the EqualityComparableConcept. -
    • + ForwardRange2's value + type is a model of the EqualityComparableConcept. +
  • - Objects of ForwardRange1's - value type can be compared for equality with objects of ForwardRange2's value type. -
    • + Objects of ForwardRange1's + value type can be compared for equality with objects of ForwardRange2's value type. +

For the predicate versions:

  • -ForwardRange1 is a - model of the Forward Range - Concept. -
    • + ForwardRange1 is + a model of the Forward + Range Concept. +
  • -ForwardRange2 is a - model of the Forward Range - Concept. -
    • + ForwardRange2 is + a model of the Forward + Range Concept. +
  • -BinaryPredicate is - a model of the BinaryPredicateConcept. -
    • + BinaryPredicate is + a model of the BinaryPredicateConcept. +
  • -ForwardRange1's value - type is convertible to BinaryPredicate's - first argument type. -
    • + ForwardRange1's value + type is convertible to BinaryPredicate's + first argument type. +
  • -ForwardRange2's value - type is convertible to BinaryPredicate's - second argument type. -
    • + ForwardRange2's value + type is convertible to BinaryPredicate's + second argument type. +
- + Complexity

@@ -168,7 +168,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/non_mutating/find_first_of.html b/doc/html/range/reference/algorithms/non_mutating/find_first_of.html index aed4750..7257ae7 100644 --- a/doc/html/range/reference/algorithms/non_mutating/find_first_of.html +++ b/doc/html/range/reference/algorithms/non_mutating/find_first_of.html @@ -2,8 +2,8 @@ find_first_of - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -66,7 +66,7 @@

- + Description

@@ -86,14 +86,14 @@ same manner as the returned iterator described above.

- + Definition

Defined in the header file boost/range/algorithm/find_first_of.hpp

- + Requirements

@@ -101,53 +101,53 @@

  • -SinglePassRange1 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange1 + is a model of the Single + Pass Range Concept. +
  • -ForwardRange2 is a - model of the Forward Range - Concept. -
    • + ForwardRange2 is + a model of the Forward + Range Concept. +
  • -SinglePassRange1's - value type is a model of the EqualityComparableConcept, - and can be compared for equality with ForwardRange2's - value type. -
    • + SinglePassRange1's + value type is a model of the EqualityComparableConcept, + and can be compared for equality with ForwardRange2's + value type. +

For the predicate versions:

  • -SinglePassRange1 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange1 + is a model of the Single + Pass Range Concept. +
  • -ForwardRange2 is a - model of the Forward Range - Concept. -
    • + ForwardRange2 is + a model of the Forward + Range Concept. +
  • -BinaryPredicate is - a model of the BinaryPredicateConcept. -
    • + BinaryPredicate is + a model of the BinaryPredicateConcept. +
  • -SinglePassRange1's - value type is convertible to BinaryPredicate's - first argument type. -
    • + SinglePassRange1's + value type is convertible to BinaryPredicate's + first argument type. +
  • -ForwardRange2's value - type is convertible to BinaryPredicate's - second argument type. -
    • + ForwardRange2's value + type is convertible to BinaryPredicate's + second argument type. +
- + Complexity

@@ -164,7 +164,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/non_mutating/find_if.html b/doc/html/range/reference/algorithms/non_mutating/find_if.html index 72637c9..373244e 100644 --- a/doc/html/range/reference/algorithms/non_mutating/find_if.html +++ b/doc/html/range/reference/algorithms/non_mutating/find_if.html @@ -2,8 +2,8 @@ find_if - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -49,7 +49,7 @@

- + Description

@@ -64,33 +64,33 @@ defines found in the same manner as the returned iterator described above.

- + Definition

Defined in the header file boost/range/algorithm/find_if.hpp

- + Requirements
  • -SinglePassRange is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange is + a model of the Single + Pass Range Concept. +
  • -UnaryPredicate is a - model of the PredicateConcept. -
    • + UnaryPredicate is + a model of the PredicateConcept. +
  • - The value type of SinglePassRange - is convertible to the argument type of UnaryPredicate. -
    • + The value type of SinglePassRange + is convertible to the argument type of UnaryPredicate. +
- + Precondition:

@@ -98,7 +98,7 @@ rng, *i is in the domain of UnaryPredicate.

- + Complexity

@@ -115,7 +115,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/non_mutating/for_each.html b/doc/html/range/reference/algorithms/non_mutating/for_each.html index 55d70df..26eb2ad 100644 --- a/doc/html/range/reference/algorithms/non_mutating/for_each.html +++ b/doc/html/range/reference/algorithms/non_mutating/for_each.html @@ -2,8 +2,8 @@ for_each - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -49,7 +49,7 @@

- + Description

@@ -59,38 +59,38 @@ fun(x).

- + Definition

Defined in the header file boost/range/algorithm/for_each.hpp

- + Requirements
  • -SinglePassRange is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange is + a model of the Single + Pass Range Concept. +
  • -UnaryFunction is a - model of the UnaryFunctionConcept. -
    • + UnaryFunction is + a model of the UnaryFunctionConcept. +
  • -UnaryFunction does - not apply any non-constant operation through its argument. -
    • + UnaryFunction does + not apply any non-constant operation through its argument. +
  • -SinglePassRange's value - type is convertible to UnaryFunction's - argument type. -
    • + SinglePassRange's + value type is convertible to UnaryFunction's + argument type. +
- + Complexity

@@ -107,7 +107,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html b/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html index f88b6ad..39cf94c 100644 --- a/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html +++ b/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html @@ -2,8 +2,8 @@ lexicographical_compare - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -53,7 +53,7 @@

- + Description

@@ -73,14 +73,14 @@ predicate versions.

- + Definition

Defined in the header file boost/range/algorithm/lexicographical_compare.hpp

- + Requirements

@@ -88,64 +88,64 @@

  • -SinglePassRange1 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange1 + is a model of the Single + Pass Range Concept. +
  • -SinglePassRange2 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange2 + is a model of the Single + Pass Range Concept. +
  • -SinglePassRange1's - value type is a model of the LessThanComparableConcept. -
    • + SinglePassRange1's + value type is a model of the LessThanComparableConcept. +
  • -SinglePassRange2'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 obect of SinglePassRange2's + value type. x < + y must be valid. y < + x must be valid. +

For the predicate versions of lexicographical_compare:

  • -SinglePassRange1 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange1 + is a model of the Single + Pass Range Concept. +
  • -SinglePassRange2 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange2 + is a model of the Single + Pass Range Concept. +
  • -BinaryPredicate is - a model of the BinaryPredicateConcept. -
    • + BinaryPredicate is + a model of the BinaryPredicateConcept. +
  • -SinglePassRange1's - value type is convertible to BinaryPredicate's - first argument type. -
    • + SinglePassRange1's + value type is convertible to BinaryPredicate's + first argument type. +
  • -SinglePassRange2's - value type is convertible to BinaryPredicate's - second argument type. -
    • + SinglePassRange2's + value type is convertible to BinaryPredicate's + second argument type. +
- + Complexity

@@ -164,7 +164,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/non_mutating/lower_bound.html b/doc/html/range/reference/algorithms/non_mutating/lower_bound.html index 6c66a8e..722a850 100644 --- a/doc/html/range/reference/algorithms/non_mutating/lower_bound.html +++ b/doc/html/range/reference/algorithms/non_mutating/lower_bound.html @@ -2,8 +2,8 @@ lower_bound - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -49,7 +49,7 @@

- + Description

@@ -72,14 +72,14 @@ same manner as the returned iterator described above.

- + Definition

Defined in the header file boost/range/algorithm/lower_bound.hpp

- + Requirements

@@ -87,50 +87,50 @@

  • -ForwardRange is a model - of the Forward Range - Concept. -
    • + ForwardRange is a + model of the Forward + Range Concept. +
  • -Value is a model of - the LessThanComparableConcept. -
    • + Value is a model + of the LessThanComparableConcept. +
  • - The ordering of objects of type Value - is a strict weak ordering, - as defined in the LessThanComparableConcept - requirements. -
    • + The ordering of objects of type Value + is a strict weak ordering, + as defined in the LessThanComparableConcept + requirements. +
  • -ForwardRange's value - type is the same type as Value. -
    • + ForwardRange's value + type is the same type as Value. +

For the predicate versions:

  • -ForwardRange is a model - of the Forward Range - Concept. -
    • + ForwardRange is a + model of the Forward + Range Concept. +
  • -BinaryPredicate is - a model of the StrictWeakOrderingConcept. -
    • + BinaryPredicate is + a model of the StrictWeakOrderingConcept. +
  • -ForwardRange's value - type is the same type as Value. -
    • + ForwardRange's value + type is the same type as Value. +
  • -ForwardRange's value - type is convertible to both of BinaryPredicate's - argument types. -
    • + ForwardRange's value + type is convertible to both of BinaryPredicate's + argument types. +
- + Precondition:

@@ -148,7 +148,7 @@ order according to pred.

- + Complexity

@@ -170,7 +170,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/non_mutating/max_element.html b/doc/html/range/reference/algorithms/non_mutating/max_element.html index c547ba1..2f93781 100644 --- a/doc/html/range/reference/algorithms/non_mutating/max_element.html +++ b/doc/html/range/reference/algorithms/non_mutating/max_element.html @@ -2,8 +2,8 @@ max_element - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -84,7 +84,7 @@

- + Description

@@ -98,14 +98,14 @@ same manner as the returned iterator described above.

- + Definition

Defined in the header file boost/range/algorithm/max_element.hpp

- + Requirements

@@ -113,36 +113,36 @@

  • -ForwardRange is a model - of the Forward Range - Concept. -
    • + ForwardRange is a + model of the Forward + Range Concept. +
  • -ForwardRange's value - type is a model of the LessThanComparableConcept. -
    • + ForwardRange's value + type is a model of the LessThanComparableConcept. +

For the predicate versions:

  • -ForwardRange is a model - of the Forward Range - Concept. -
    • + ForwardRange is a + model of the Forward + Range Concept. +
  • -BinaryPredicate is - a model of the BinaryPredicateConcept. -
    • + BinaryPredicate is + a model of the BinaryPredicateConcept. +
  • -ForwardRange's value - type is convertible to both of BinaryPredicate's - argument types. -
    • + ForwardRange's value + type is convertible to both of BinaryPredicate's + argument types. +
- + Complexity

@@ -160,7 +160,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/non_mutating/min_element.html b/doc/html/range/reference/algorithms/non_mutating/min_element.html index d5c1a14..60790d8 100644 --- a/doc/html/range/reference/algorithms/non_mutating/min_element.html +++ b/doc/html/range/reference/algorithms/non_mutating/min_element.html @@ -2,8 +2,8 @@ min_element - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -84,7 +84,7 @@

- + Description

@@ -98,14 +98,14 @@ same manner as the returned iterator described above.

- + Definition

Defined in the header file boost/range/algorithm/min_element.hpp

- + Requirements

@@ -113,36 +113,36 @@

  • -ForwardRange is a model - of the Forward Range - Concept. -
    • + ForwardRange is a + model of the Forward + Range Concept. +
  • -ForwardRange's value - type is a model of the LessThanComparableConcept. -
    • + ForwardRange's value + type is a model of the LessThanComparableConcept. +

For the predicate versions:

  • -ForwardRange is a model - of the Forward Range - Concept. -
    • + ForwardRange is a + model of the Forward + Range Concept. +
  • -BinaryPredicate is - a model of the BinaryPredicateConcept. -
    • + BinaryPredicate is + a model of the BinaryPredicateConcept. +
  • -ForwardRange's value - type is convertible to both of BinaryPredicate's - argument types. -
    • + ForwardRange's value + type is convertible to both of BinaryPredicate's + argument types. +
- + Complexity

@@ -160,7 +160,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/non_mutating/mismatch.html b/doc/html/range/reference/algorithms/non_mutating/mismatch.html index bf1411d..a8fea19 100644 --- a/doc/html/range/reference/algorithms/non_mutating/mismatch.html +++ b/doc/html/range/reference/algorithms/non_mutating/mismatch.html @@ -2,8 +2,8 @@ mismatch - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -106,7 +106,7 @@

- + Description

@@ -118,14 +118,14 @@ Equality is determined by operator== for non-predicate versions of mismatch, and by satisfying pred in the predicate versions.

- + Definition

Defined in the header file boost/range/algorithm/mismatch.hpp

- + Requirements

@@ -133,67 +133,67 @@

  • -SinglePassRange1 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange1 + is a model of the Single + Pass Range Concept. +
  • -SinglePassRange2 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange2 + is a model of the Single + Pass Range Concept. +
  • -SinglePassRange1's - value type is a model of the EqualityComparableConcept. -
    • + SinglePassRange1's + value type is a model of the EqualityComparableConcept. +
  • -SinglePassRange2's - value type is a model of the EqualityComparableConcept. -
    • + SinglePassRange2's + value type is a model of the EqualityComparableConcept. +
  • -SinglePassRange1s value - type can be compared for equality with SinglePassRange2's - value type. -
    • + SinglePassRange1s + value type can be compared for equality with SinglePassRange2's + value type. +

For the predicate versions:

  • -SinglePassRange1 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange1 + is a model of the Single + Pass Range Concept. +
  • -SinglePassRange2 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange2 + is a model of the Single + Pass Range Concept. +
  • -BinaryPredicate is - a model of the BinaryPredicateConcept. -
    • + BinaryPredicate is + a model of the BinaryPredicateConcept. +
  • -SinglePassRange1's - value type is convertible to BinaryPredicate's - first argument type. -
    • + SinglePassRange1's + value type is convertible to BinaryPredicate's + first argument type. +
  • -SinglePassRange2's - value type is convertible to BinaryPredicate's - second argument type. -
    • + SinglePassRange2's + value type is convertible to BinaryPredicate's + second argument type. +
- + Precondition:

distance(rng2) >= distance(rng1)

- + Complexity

@@ -210,7 +210,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/non_mutating/search.html b/doc/html/range/reference/algorithms/non_mutating/search.html index dc9f4cc..e7b9394 100644 --- a/doc/html/range/reference/algorithms/non_mutating/search.html +++ b/doc/html/range/reference/algorithms/non_mutating/search.html @@ -2,8 +2,8 @@ search - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -96,7 +96,7 @@

- + Description

@@ -115,14 +115,14 @@ same manner as the returned iterator described above.

- + Definition

Defined in the header file boost/range/algorithm/search.hpp

- + Requirements

@@ -130,60 +130,60 @@

  • -ForwardRange1 is a - model of the Forward Range - Concept. -
    • + ForwardRange1 is + a model of the Forward + Range Concept. +
  • -ForwardRange2 is a - model of the Forward Range - Concept. -
    • + ForwardRange2 is + a model of the Forward + Range Concept. +
  • -ForwardRange1's value - type is a model of the EqualityComparableConcept. -
    • + ForwardRange1's value + type is a model of the EqualityComparableConcept. +
  • -ForwardRange2's value - type is a model of the EqualityComparableConcept. -
    • + ForwardRange2's value + type is a model of the EqualityComparableConcept. +
  • -ForwardRange1s value - type can be compared for equality with ForwardRange2's - value type. -
    • + ForwardRange1s value + type can be compared for equality with ForwardRange2's + value type. +

For the predicate versions:

  • -ForwardRange1 is a - model of the Forward Range - Concept. -
    • + ForwardRange1 is + a model of the Forward + Range Concept. +
  • -ForwardRange2 is a - model of the Forward Range - Concept. -
    • + ForwardRange2 is + a model of the Forward + Range Concept. +
  • -BinaryPredicate is - a model of the BinaryPredicateConcept. -
    • + BinaryPredicate is + a model of the BinaryPredicateConcept. +
  • -ForwardRange1's value - type is convertible to BinaryPredicate's - first argument type. -
    • + ForwardRange1's value + type is convertible to BinaryPredicate's + first argument type. +
  • -ForwardRange2's value - type is convertible to BinaryPredicate's - second argument type. -
    • + ForwardRange2's value + type is convertible to BinaryPredicate's + second argument type. +
- + Complexity

@@ -200,7 +200,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/non_mutating/search_n.html b/doc/html/range/reference/algorithms/non_mutating/search_n.html index e02cae1..78d4679 100644 --- a/doc/html/range/reference/algorithms/non_mutating/search_n.html +++ b/doc/html/range/reference/algorithms/non_mutating/search_n.html @@ -2,8 +2,8 @@ search_n - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -55,7 +55,7 @@

- + Description

@@ -64,14 +64,14 @@ and by a predicate when one is supplied.

- + Definition

Defined in the header file boost/range/algorithm/search_n.hpp

- + Requirements

@@ -79,53 +79,53 @@

  • -ForwardRange is a model - of the Forward Range - Concept. -
    • + ForwardRange is a + model of the Forward + Range Concept. +
  • -ForwardRange's value - type is a model of the EqualityComparableConcept. -
    • + ForwardRange's value + type is a model of the EqualityComparableConcept. +
  • -ForwardRanges value - type can be compared for equality with Value. -
    • + ForwardRanges value + type can be compared for equality with Value. +
  • -Integer is a model - of the IntegerConcept. -
    • + Integer is a model + of the IntegerConcept. +

For the predicate versions:

  • -ForwardRange is a model - of the Forward Range - Concept. -
    • + ForwardRange is a + model of the Forward + Range Concept. +
  • -BinaryPredicate is - a model of the BinaryPredicateConcept. -
    • + BinaryPredicate is + a model of the BinaryPredicateConcept. +
  • -ForwardRange's value - type is convertible to BinaryPredicate's - first argument type. -
    • + ForwardRange's value + type is convertible to BinaryPredicate's + first argument type. +
  • -Value is convertible - to BinaryPredicate's - second argument type. -
    • + Value is convertible + to BinaryPredicate's + second argument type. +
  • -Integer is a model - of the IntegerConcept. -
    • + Integer is a model + of the IntegerConcept. +
- + Complexity

@@ -142,7 +142,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/non_mutating/upper_bound.html b/doc/html/range/reference/algorithms/non_mutating/upper_bound.html index 7560152..2692fb0 100644 --- a/doc/html/range/reference/algorithms/non_mutating/upper_bound.html +++ b/doc/html/range/reference/algorithms/non_mutating/upper_bound.html @@ -2,8 +2,8 @@ upper_bound - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -49,7 +49,7 @@

- + Description

@@ -71,14 +71,14 @@ same manner as the returned iterator described above.

- + Definition

Defined in the header file boost/range/algorithm/upper_bound.hpp

- + Requirements

@@ -86,50 +86,50 @@

  • -ForwardRange is a model - of the Forward Range - Concept. -
    • + ForwardRange is a + model of the Forward + Range Concept. +
  • -Value is a model of - the LessThanComparableConcept. -
    • + Value is a model + of the LessThanComparableConcept. +
  • - The ordering of objects of type Value - is a strict weak ordering, - as defined in the LessThanComparableConcept - requirements. -
    • + The ordering of objects of type Value + is a strict weak ordering, + as defined in the LessThanComparableConcept + requirements. +
  • -ForwardRange's value - type is the same type as Value. -
    • + ForwardRange's value + type is the same type as Value. +

For the predicate versions:

  • -ForwardRange is a model - of the Forward Range - Concept. -
    • + ForwardRange is a + model of the Forward + Range Concept. +
  • -BinaryPredicate is - a model of the StrictWeakOrderingConcept. -
    • + BinaryPredicate is + a model of the StrictWeakOrderingConcept. +
  • -ForwardRange's value - type is the same type as Value. -
    • + ForwardRange's value + type is the same type as Value. +
  • -ForwardRange's value - type is convertible to both of BinaryPredicate's - argument types. -
    • + ForwardRange's value + type is convertible to both of BinaryPredicate's + argument types. +
- + Precondition:

@@ -147,7 +147,7 @@ order according to pred.

- + Complexity

@@ -167,7 +167,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/numeric.html b/doc/html/range/reference/algorithms/numeric.html index 90818fa..99b3631 100644 --- a/doc/html/range/reference/algorithms/numeric.html +++ b/doc/html/range/reference/algorithms/numeric.html @@ -2,8 +2,8 @@ Numeric algorithms - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -46,7 +46,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/numeric/accumulate.html b/doc/html/range/reference/algorithms/numeric/accumulate.html index 4081a11..1c15714 100644 --- a/doc/html/range/reference/algorithms/numeric/accumulate.html +++ b/doc/html/range/reference/algorithms/numeric/accumulate.html @@ -2,8 +2,8 @@ accumulate - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -52,7 +52,7 @@

- + Description

@@ -63,77 +63,77 @@ The return value is the resultant value of the above algorithm.

- + Definition

Defined in the header file boost/range/numeric.hpp

- + Requirements
- + For the first version
  1. -SinglePassRange is - a model of the Single - Pass Range Concept. -
    2. + SinglePassRange is + a model of the Single + Pass Range Concept. +
  2. -Value is a model of - the AssignableConcept. -
    3. + Value is a model + of the AssignableConcept. +
  3. - An operator+ - is defined for a left-hand operand of type Value - and a right-hand operance of the SinglePassRange - value type. -
    4. + An operator+ + is defined for a left-hand operand of type Value + and a right-hand operance of the SinglePassRange + value type. +
  4. - The return type of the above operator is convertible to Value. -
    5. + The return type of the above operator is convertible to Value. +
- + For the second version
  1. -SinglePassRange is - a model of the Single - Pass Range Concept. -
    2. + SinglePassRange is + a model of the Single + Pass Range Concept. +
  2. -Value is a model of - the AssignableConcept. -
    3. + Value is a model + of the AssignableConcept. +
  3. -BinaryOperation is - a model of the BinaryFunctionConcept. -
    4. + BinaryOperation is + a model of the BinaryFunctionConcept. +
  4. -Value is convertible - to BinaryOperation's - first argument type. -
    5. + Value is convertible + to BinaryOperation's + first argument type. +
  5. -SinglePassRange's value - type is convertible to BinaryOperation's - second argument type. -
    6. + SinglePassRange's + value type is convertible to BinaryOperation's + second argument type. +
  6. - The return type of BinaryOperation - is convertible to Value. -
    7. + The return type of BinaryOperation + is convertible to Value. +
- + Complexity

@@ -150,7 +150,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/numeric/adjacent_difference.html b/doc/html/range/reference/algorithms/numeric/adjacent_difference.html index d6f0d27..e39fd10 100644 --- a/doc/html/range/reference/algorithms/numeric/adjacent_difference.html +++ b/doc/html/range/reference/algorithms/numeric/adjacent_difference.html @@ -2,8 +2,8 @@ adjacent_difference - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -55,7 +55,7 @@

- + Description

@@ -69,84 +69,84 @@ instead of operator-().

- + Definition

Defined in the header file boost/range/numeric.hpp

- + Requirements
- + For the first version
  1. -SinglePassRange is - a model of the Single - Pass Range Concept. -
    2. + SinglePassRange is + a model of the Single + Pass Range Concept. +
  2. -OutputIterator is a - model of the OutputIteratorConcept. -
    3. + OutputIterator is + a model of the OutputIteratorConcept. +
  3. - If x and y are objects of SinglePassRange's - value type, then x - y - is defined. -
    4. + If x and y are objects of SinglePassRange's value type, then + x - + y is defined. +
  4. - The value type of SinglePassRange - is convertible to a type in OutputIterator's - set of value types. -
    5. + The value type of SinglePassRange + is convertible to a type in OutputIterator's + set of value types. +
  5. - The return type of x - y - is convertible to a type in OutputIterator's - set of value types. -
    6. + The return type of x - y + is convertible to a type in OutputIterator's + set of value types. +
- + For the second version
  1. -SinglePassRange is - a model of the Single - Pass Range Concept. -
    2. + SinglePassRange is + a model of the Single + Pass Range Concept. +
  2. -OutputIterator is a - model of the OutputIteratorConcept. -
    3. + OutputIterator is + a model of the OutputIteratorConcept. +
  3. -BinaryOperation is - a model of the BinaryFunctionConcept. -
    4. + BinaryOperation is + a model of the BinaryFunctionConcept. +
  4. - The value type of SinglePassRange - is convertible to BinaryOperation's - first and second argument types. -
    5. + The value type of SinglePassRange + is convertible to BinaryOperation's + first and second argument types. +
  5. - The value type of SinglePassRange - is convertible to a type in OutputIterator's - set of value types. -
    6. + The value type of SinglePassRange + is convertible to a type in OutputIterator's + set of value types. +
  6. - The result type of BinaryOperation - is convertible to a type in OutputIterator's - set of value types. -
    7. + The result type of BinaryOperation + is convertible to a type in OutputIterator's + set of value types. +
- + Precondition:

@@ -154,7 +154,7 @@ + distance(rng)) is a valid range.

- + Complexity

@@ -173,7 +173,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/numeric/inner_product.html b/doc/html/range/reference/algorithms/numeric/inner_product.html index 0146bf4..40cbb6c 100644 --- a/doc/html/range/reference/algorithms/numeric/inner_product.html +++ b/doc/html/range/reference/algorithms/numeric/inner_product.html @@ -2,8 +2,8 @@ inner_product - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -54,7 +54,7 @@

- + Description

@@ -67,109 +67,109 @@ algorithm please see inner_product.

- + Definition

Defined in the header file boost/range/numeric.hpp

- + Requirements
- + For the first version
  1. -SinglePassRange1 is - a model of the Single - Pass Range Concept. -
    2. + SinglePassRange1 + is a model of the Single + Pass Range Concept. +
  2. -SinglePassRange2 is - a model of the Single - Pass Range Concept. -
    3. + SinglePassRange2 + is a model of the Single + Pass Range Concept. +
  3. -Value is a model of - the AssignableConcept. -
    4. + Value is a model + of the AssignableConcept. +
  4. - If x is an object of - type Value, y is an object of SinglePassRange1's - value type, and z is - an object of SinglePassRange2's - value type, then x + y * z - is defined. -
    5. + If x is an object + of type Value, y is an object of SinglePassRange1's value type, + and z is an object + of SinglePassRange2's + value type, then x + y * z + is defined. +
  5. - The result type of the expression x - + y - * z - is convertible to Value. -
    6. + The result type of the expression x + + y + * z + is convertible to Value. +
- + For the second version
  1. -SinglePassRange1 is - a model of the Single - Pass Range Concept. -
    2. + SinglePassRange1 + is a model of the Single + Pass Range Concept. +
  2. -SinglePassRange2 is - a model of the Single - Pass Range Concept. -
    3. + SinglePassRange2 + is a model of the Single + Pass Range Concept. +
  3. -Value is a model of - the AssignableConcept. -
    4. + Value is a model + of the AssignableConcept. +
  4. -BinaryOperation1 is - a model of the BinaryFunctionConcept. -
    5. + BinaryOperation1 + is a model of the BinaryFunctionConcept. +
  5. -BinaryOperation2 is - a model of the BinaryFunctionConcept. -
    6. + BinaryOperation2 + is a model of the BinaryFunctionConcept. +
  6. - The value type of SinglePassRange1 - is convertible to the first argument type of BinaryOperation2. -
    7. + The value type of SinglePassRange1 + is convertible to the first argument type of BinaryOperation2. +
  7. - The value type of SinglePassRange2 - is convertible to the second argument type of BinaryOperation2. -
    8. + The value type of SinglePassRange2 + is convertible to the second argument type of BinaryOperation2. +
  8. -Value is convertible - to the value type of BinaryOperation1. -
    9. + Value is convertible + to the value type of BinaryOperation1. +
  9. - The return type of BinaryOperation2 - is convertible to the second argument type of BinaryOperation1. -
    10. + The return type of BinaryOperation2 + is convertible to the second argument type of BinaryOperation1. +
  10. - The return type of BinaryOperation1 - is convertible to Value. -
    11. + The return type of BinaryOperation1 + is convertible to Value. +
- + Precondition:

distance(rng2) >= distance(rng1) is a valid range.

- + Complexity

@@ -186,7 +186,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/numeric/partial_sum.html b/doc/html/range/reference/algorithms/numeric/partial_sum.html index 3a96abc..0eb6cf3 100644 --- a/doc/html/range/reference/algorithms/numeric/partial_sum.html +++ b/doc/html/range/reference/algorithms/numeric/partial_sum.html @@ -2,8 +2,8 @@ partial_sum - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -49,7 +49,7 @@

- + Description

@@ -58,77 +58,77 @@ in the same manner as std::partial_sum(boost::begin(rng), boost::end(rng), out_it). See partial_sum.

- + Definition

Defined in the header file boost/range/numeric.hpp

- + Requirements
- + For the first version
  1. -SinglePassRange is - a model of the Single - Pass Range Concept. -
    2. + SinglePassRange is + a model of the Single + Pass Range Concept. +
  2. -OutputIterator is a - model of the OutputIteratorConcept. -
    3. + OutputIterator is + a model of the OutputIteratorConcept. +
  3. - If x and y are objects of SinglePassRange's - value type, then x + y - is defined. -
    4. + If x and y are objects of SinglePassRange's value type, then + x + + y is defined. +
  4. - The return type of x + y - is convertible to the value type of SinglePassRange. -
    5. + The return type of x + y + is convertible to the value type of SinglePassRange. +
  5. - The value type of SinglePassRange - is convertible to a type in OutputIterator's - set of value types. -
    6. + The value type of SinglePassRange + is convertible to a type in OutputIterator's + set of value types. +
- + For the second version
  1. -SinglePassRange is - a model of the Single - Pass Range Concept. -
    2. + SinglePassRange is + a model of the Single + Pass Range Concept. +
  2. -OutputIterator is a - model of the OutputIteratorConcept. -
    3. + OutputIterator is + a model of the OutputIteratorConcept. +
  3. -BinaryOperation is - a model of the BinaryFunctionConcept. -
    4. + BinaryOperation is + a model of the BinaryFunctionConcept. +
  4. - The result type of BinaryOperation - is convertible to the value type of SinglePassRange. -
    5. + The result type of BinaryOperation + is convertible to the value type of SinglePassRange. +
  5. - The value type of SinglePassRange - is convertible to a type in OutputIterator's - set of value types. -
    6. + The value type of SinglePassRange + is convertible to a type in OutputIterator's + set of value types. +
- + Precondition:

@@ -136,7 +136,7 @@ + distance(rng)) is a valid range.

- + Complexity

@@ -155,7 +155,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/permutation.html b/doc/html/range/reference/algorithms/permutation.html index c859468..cf2da0e 100644 --- a/doc/html/range/reference/algorithms/permutation.html +++ b/doc/html/range/reference/algorithms/permutation.html @@ -2,8 +2,8 @@ Permutation algorithms - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+

Permutation algorithms @@ -44,7 +44,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/permutation/next_permutation.html b/doc/html/range/reference/algorithms/permutation/next_permutation.html index 5a429e5..f3dd33f 100644 --- a/doc/html/range/reference/algorithms/permutation/next_permutation.html +++ b/doc/html/range/reference/algorithms/permutation/next_permutation.html @@ -2,8 +2,8 @@ next_permutation - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -49,7 +49,7 @@

- + Description

@@ -67,14 +67,14 @@ the predicate versions.

- + Definition

Defined in the header file boost/range/algorithm/permutation.hpp

- + Requirements

@@ -82,50 +82,50 @@

  • -BidirectionalRange - is a model of the Bidirectional - Range Concept. -
    • + BidirectionalRange + is a model of the Bidirectional + Range Concept. +
  • -BidirectionalRange - is mutable. -
    • + BidirectionalRange + is mutable. +
  • -BidirectionalRange's - value type is a model of the LessThanComparableConcept. -
    • + BidirectionalRange's + value type is a model of the LessThanComparableConcept. +
  • - The ordering of objects of type BidirectionalRange's - value type is a strict weak ordering, - as defined in the LessThanComparableConcept - requirements. -
    • + The ordering of objects of type BidirectionalRange's + value type is a strict weak ordering, + as defined in the LessThanComparableConcept + requirements. +

For the predicate versions:

  • -BidirectionalRange - is a model of the Bidirectional - Range Concept. -
    • + BidirectionalRange + is a model of the Bidirectional + Range Concept. +
  • -BidirectionalRange - is mutable. -
    • + BidirectionalRange + is mutable. +
  • -Compare is a model - of the StrictWeakOrderingConcept. -
    • + Compare is a model + of the StrictWeakOrderingConcept. +
  • -BidirectionalRange's - value type is convertible to both of Compare's - argument types. -
    • + BidirectionalRange's + value type is convertible to both of Compare's + argument types. +
- + Complexity

@@ -143,7 +143,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/permutation/prev_permutation.html b/doc/html/range/reference/algorithms/permutation/prev_permutation.html index a841cb7..81ae7d6 100644 --- a/doc/html/range/reference/algorithms/permutation/prev_permutation.html +++ b/doc/html/range/reference/algorithms/permutation/prev_permutation.html @@ -2,8 +2,8 @@ prev_permutation - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -49,7 +49,7 @@

- + Description

@@ -67,14 +67,14 @@ the predicate versions.

- + Definition

Defined in the header file boost/range/algorithm/permutation.hpp

- + Requirements

@@ -82,50 +82,50 @@

  • -BidirectionalRange - is a model of the Bidirectional - Range Concept. -
    • + BidirectionalRange + is a model of the Bidirectional + Range Concept. +
  • -BidirectionalRange - is mutable. -
    • + BidirectionalRange + is mutable. +
  • -BidirectionalRange's - value type is a model of the LessThanComparableConcept. -
    • + BidirectionalRange's + value type is a model of the LessThanComparableConcept. +
  • - The ordering of objects of type BidirectionalRange's - value type is a strict weak ordering, - as defined in the LessThanComparableConcept - requirements. -
    • + The ordering of objects of type BidirectionalRange's + value type is a strict weak ordering, + as defined in the LessThanComparableConcept + requirements. +

For the predicate versions:

  • -BidirectionalRange - is a model of the Bidirectional - Range Concept. -
    • + BidirectionalRange + is a model of the Bidirectional + Range Concept. +
  • -BidirectionalRange - is mutable. -
    • + BidirectionalRange + is mutable. +
  • -Compare is a model - of the StrictWeakOrderingConcept. -
    • + Compare is a model + of the StrictWeakOrderingConcept. +
  • -BidirectionalRange's - value type is convertible to both of Compare's - argument types. -
    • + BidirectionalRange's + value type is convertible to both of Compare's + argument types. +
- + Complexity

@@ -143,7 +143,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/range_algorithm_introduction.html b/doc/html/range/reference/algorithms/range_algorithm_introduction.html index 20e6bad..36667b3 100644 --- a/doc/html/range/reference/algorithms/range_algorithm_introduction.html +++ b/doc/html/range/reference/algorithms/range_algorithm_introduction.html @@ -2,8 +2,8 @@ Introduction and motivation - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+

Introduction and motivation @@ -189,15 +189,15 @@

  1. - it allows for seamless functional-style - programming where you do not need to use named - local variables to store intermediate results -
    2. + it allows for seamless functional-style + programming where you do not need to use named + local variables to store intermediate results +
  2. - it is very safe - because the algorithm can verify out-of-bounds conditions and handle - tricky conditions that lead to empty ranges -
    3. + it is very safe + because the algorithm can verify out-of-bounds conditions and handle + tricky conditions that lead to empty ranges +

For example, consider how easy we may erase the duplicates in a sorted @@ -251,7 +251,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/set.html b/doc/html/range/reference/algorithms/set.html index 7de08c4..2e0ae8b 100644 --- a/doc/html/range/reference/algorithms/set.html +++ b/doc/html/range/reference/algorithms/set.html @@ -2,8 +2,8 @@ Set algorithms - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -46,7 +46,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/set/includes.html b/doc/html/range/reference/algorithms/set/includes.html index 15f655f..56c698d 100644 --- a/doc/html/range/reference/algorithms/set/includes.html +++ b/doc/html/range/reference/algorithms/set/includes.html @@ -2,8 +2,8 @@ includes - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -47,7 +47,7 @@

- + Description

@@ -59,14 +59,14 @@ the predicate versions.

- + Definition

Defined in the header file boost/range/algorithm/set_algorithm.hpp

- + Requirements

@@ -74,77 +74,77 @@

  • -SinglePassRange1 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange1 + is a model of the Single + Pass Range Concept. +
  • -SinglePassRange2 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange2 + is a model of the Single + Pass Range Concept. +
  • -SinglePassRange1 and - SinglePassRange2 have - the same value type. -
    • + SinglePassRange1 + and SinglePassRange2 + have the same value type. +
  • -SinglePassRange1's - value type is a model of the LessThanComparableConcept. -
    • + SinglePassRange1's + value type is a model of the LessThanComparableConcept. +
  • -SinglePassRange2's - value type is a model of the LessThanComparableConcept. -
    • + SinglePassRange2's + value type is a model of the LessThanComparableConcept. +
  • - The ordering of objects of type SinglePassRange1's - value type is a strict weak ordering, - as defined in the LessThanComparableConcept - requirements. -
    • + The ordering of objects of type SinglePassRange1's + value type is a strict weak ordering, + as defined in the LessThanComparableConcept + requirements. +
  • - The ordering of objects of type SinglePassRange2's - value type is a strict weak ordering, - as defined in the LessThanComparableConcept - requirements. -
    • + The ordering of objects of type SinglePassRange2's + value type is a strict weak ordering, + as defined in the LessThanComparableConcept + requirements. +

For the predicate versions:

  • -SinglePassRange1 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange1 + is a model of the Single + Pass Range Concept. +
  • -SinglePassRange2 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange2 + is a model of the Single + Pass Range Concept. +
  • -SinglePassRange1 and - SinglePassRange2 have - the same value type. -
    • + SinglePassRange1 + and SinglePassRange2 + have the same value type. +
  • -BinaryPredicate is - a model of the StrictWeakOrderingConcept. -
    • + BinaryPredicate is + a model of the StrictWeakOrderingConcept. +
  • -SinglePassRange1's - value type is convertible to BinaryPredicate's - first argument type. -
    • + SinglePassRange1's + value type is convertible to BinaryPredicate's + first argument type. +
  • -SinglePassRange2's - value type is convertible to BinaryPredicate's - second argument types. -
    • + SinglePassRange2's + value type is convertible to BinaryPredicate's + second argument types. +
- + Precondition:

@@ -162,7 +162,7 @@ according to pred.

- + Complexity

@@ -180,7 +180,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/set/set_difference.html b/doc/html/range/reference/algorithms/set/set_difference.html index ecfcc65..84166b8 100644 --- a/doc/html/range/reference/algorithms/set/set_difference.html +++ b/doc/html/range/reference/algorithms/set/set_difference.html @@ -2,8 +2,8 @@ set_difference - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -56,7 +56,7 @@

- + Description

@@ -70,14 +70,14 @@ the predicate versions.

- + Definition

Defined in the header file boost/range/algorithm/set_algorithm.hpp

- + Requirements

@@ -85,85 +85,85 @@

  • -SinglePassRange1 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange1 + is a model of the Single + Pass Range Concept. +
  • -SinglePassRange2 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange2 + is a model of the Single + Pass Range Concept. +
  • -OutputIterator is a - model of the OutputIteratorConcept. -
    • + OutputIterator is + a model of the OutputIteratorConcept. +
  • -SinglePassRange1 and - SinglePassRange2 have - the same value type. -
    • + SinglePassRange1 + and SinglePassRange2 + have the same value type. +
  • -SinglePassRange1's - value type is a model of the LessThanComparableConcept. -
    • + SinglePassRange1's + value type is a model of the LessThanComparableConcept. +
  • -SinglePassRange2's - value type is a model of the LessThanComparableConcept. -
    • + SinglePassRange2's + value type is a model of the LessThanComparableConcept. +
  • - The ordering of objects of type SinglePassRange1's - value type is a strict weak ordering, - as defined in the LessThanComparableConcept - requirements. -
    • + The ordering of objects of type SinglePassRange1's + value type is a strict weak ordering, + as defined in the LessThanComparableConcept + requirements. +
  • - The ordering of objects of type SinglePassRange2's - value type is a strict weak ordering, - as defined in the LessThanComparableConcept - requirements. -
    • + The ordering of objects of type SinglePassRange2's + value type is a strict weak ordering, + as defined in the LessThanComparableConcept + requirements. +

For the predicate versions:

  • -SinglePassRange1 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange1 + is a model of the Single + Pass Range Concept. +
  • -SinglePassRange2 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange2 + is a model of the Single + Pass Range Concept. +
  • -OutputIterator is a - model of the OutputIteratorConcept. -
    • + OutputIterator is + a model of the OutputIteratorConcept. +
  • -SinglePassRange1 and - SinglePassRange2 have - the same value type. -
    • + SinglePassRange1 + and SinglePassRange2 + have the same value type. +
  • -BinaryPredicate is - a model of the StrictWeakOrderingConcept. -
    • + BinaryPredicate is + a model of the StrictWeakOrderingConcept. +
  • -SinglePassRange1's - value type is convertible to BinaryPredicate's - first argument type. -
    • + SinglePassRange1's + value type is convertible to BinaryPredicate's + first argument type. +
  • -SinglePassRange2's - value type is convertible to BinaryPredicate's - second argument types. -
    • + SinglePassRange2's + value type is convertible to BinaryPredicate's + second argument types. +
- + Precondition:

@@ -181,7 +181,7 @@ according to pred.

- + Complexity

@@ -199,7 +199,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/set/set_intersection.html b/doc/html/range/reference/algorithms/set/set_intersection.html index fba3e22..6beecae 100644 --- a/doc/html/range/reference/algorithms/set/set_intersection.html +++ b/doc/html/range/reference/algorithms/set/set_intersection.html @@ -2,8 +2,8 @@ set_intersection - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -57,7 +57,7 @@

- + Description

@@ -71,14 +71,14 @@ the predicate versions.

- + Definition

Defined in the header file boost/range/algorithm/set_algorithm.hpp

- + Requirements

@@ -86,85 +86,85 @@

  • -SinglePassRange1 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange1 + is a model of the Single + Pass Range Concept. +
  • -SinglePassRange2 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange2 + is a model of the Single + Pass Range Concept. +
  • -OutputIterator is a - model of the OutputIteratorConcept. -
    • + OutputIterator is + a model of the OutputIteratorConcept. +
  • -SinglePassRange1 and - SinglePassRange2 have - the same value type. -
    • + SinglePassRange1 + and SinglePassRange2 + have the same value type. +
  • -SinglePassRange1's - value type is a model of the LessThanComparableConcept. -
    • + SinglePassRange1's + value type is a model of the LessThanComparableConcept. +
  • -SinglePassRange2's - value type is a model of the LessThanComparableConcept. -
    • + SinglePassRange2's + value type is a model of the LessThanComparableConcept. +
  • - The ordering of objects of type SinglePassRange1's - value type is a strict weak ordering, - as defined in the LessThanComparableConcept - requirements. -
    • + The ordering of objects of type SinglePassRange1's + value type is a strict weak ordering, + as defined in the LessThanComparableConcept + requirements. +
  • - The ordering of objects of type SinglePassRange2's - value type is a strict weak ordering, - as defined in the LessThanComparableConcept - requirements. -
    • + The ordering of objects of type SinglePassRange2's + value type is a strict weak ordering, + as defined in the LessThanComparableConcept + requirements. +

For the predicate versions:

  • -SinglePassRange1 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange1 + is a model of the Single + Pass Range Concept. +
  • -SinglePassRange2 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange2 + is a model of the Single + Pass Range Concept. +
  • -OutputIterator is a - model of the OutputIteratorConcept. -
    • + OutputIterator is + a model of the OutputIteratorConcept. +
  • -SinglePassRange1 and - SinglePassRange2 have - the same value type. -
    • + SinglePassRange1 + and SinglePassRange2 + have the same value type. +
  • -BinaryPredicate is - a model of the StrictWeakOrderingConcept. -
    • + BinaryPredicate is + a model of the StrictWeakOrderingConcept. +
  • -SinglePassRange1's - value type is convertible to BinaryPredicate's - first argument type. -
    • + SinglePassRange1's + value type is convertible to BinaryPredicate's + first argument type. +
  • -SinglePassRange2's - value type is convertible to BinaryPredicate's - second argument types. -
    • + SinglePassRange2's + value type is convertible to BinaryPredicate's + second argument types. +
- + Precondition:

@@ -182,7 +182,7 @@ according to pred.

- + Complexity

@@ -200,7 +200,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/set/set_symmetric_difference.html b/doc/html/range/reference/algorithms/set/set_symmetric_difference.html index 5490888..d7b1c14 100644 --- a/doc/html/range/reference/algorithms/set/set_symmetric_difference.html +++ b/doc/html/range/reference/algorithms/set/set_symmetric_difference.html @@ -2,8 +2,8 @@ set_symmetric_difference - - + + @@ -13,22 +13,22 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -59,7 +59,7 @@

- + Description

@@ -75,14 +75,14 @@ the predicate versions.

- + Definition

Defined in the header file boost/range/algorithm/set_algorithm.hpp

- + Requirements

@@ -90,85 +90,85 @@

  • -SinglePassRange1 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange1 + is a model of the Single + Pass Range Concept. +
  • -SinglePassRange2 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange2 + is a model of the Single + Pass Range Concept. +
  • -OutputIterator is a - model of the OutputIteratorConcept. -
    • + OutputIterator is + a model of the OutputIteratorConcept. +
  • -SinglePassRange1 and - SinglePassRange2 have - the same value type. -
    • + SinglePassRange1 + and SinglePassRange2 + have the same value type. +
  • -SinglePassRange1's - value type is a model of the LessThanComparableConcept. -
    • + SinglePassRange1's + value type is a model of the LessThanComparableConcept. +
  • -SinglePassRange2's - value type is a model of the LessThanComparableConcept. -
    • + SinglePassRange2's + value type is a model of the LessThanComparableConcept. +
  • - The ordering of objects of type SinglePassRange1's - value type is a strict weak ordering, - as defined in the LessThanComparableConcept - requirements. -
    • + The ordering of objects of type SinglePassRange1's + value type is a strict weak ordering, + as defined in the LessThanComparableConcept + requirements. +
  • - The ordering of objects of type SinglePassRange2's - value type is a strict weak ordering, - as defined in the LessThanComparableConcept - requirements. -
    • + The ordering of objects of type SinglePassRange2's + value type is a strict weak ordering, + as defined in the LessThanComparableConcept + requirements. +

For the predicate versions:

  • -SinglePassRange1 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange1 + is a model of the Single + Pass Range Concept. +
  • -SinglePassRange2 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange2 + is a model of the Single + Pass Range Concept. +
  • -OutputIterator is a - model of the OutputIteratorConcept. -
    • + OutputIterator is + a model of the OutputIteratorConcept. +
  • -SinglePassRange1 and - SinglePassRange2 have - the same value type. -
    • + SinglePassRange1 + and SinglePassRange2 + have the same value type. +
  • -BinaryPredicate is - a model of the StrictWeakOrderingConcept. -
    • + BinaryPredicate is + a model of the StrictWeakOrderingConcept. +
  • -SinglePassRange1's - value type is convertible to BinaryPredicate's - first argument type. -
    • + SinglePassRange1's + value type is convertible to BinaryPredicate's + first argument type. +
  • -SinglePassRange2's - value type is convertible to BinaryPredicate's - second argument types. -
    • + SinglePassRange2's + value type is convertible to BinaryPredicate's + second argument types. +
- + Precondition:

@@ -186,7 +186,7 @@ according to pred.

- + Complexity

@@ -204,7 +204,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/algorithms/set/set_union.html b/doc/html/range/reference/algorithms/set/set_union.html index 94f3cd0..bbd0e98 100644 --- a/doc/html/range/reference/algorithms/set/set_union.html +++ b/doc/html/range/reference/algorithms/set/set_union.html @@ -2,8 +2,8 @@ set_union - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -56,7 +56,7 @@

- + Description

@@ -69,14 +69,14 @@ in the predicate versions.

- + Definition

Defined in the header file boost/range/algorithm/set_algorithm.hpp

- + Requirements

@@ -84,85 +84,85 @@

  • -SinglePassRange1 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange1 + is a model of the Single + Pass Range Concept. +
  • -SinglePassRange2 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange2 + is a model of the Single + Pass Range Concept. +
  • -OutputIterator is a - model of the OutputIteratorConcept. -
    • + OutputIterator is + a model of the OutputIteratorConcept. +
  • -SinglePassRange1 and - SinglePassRange2 have - the same value type. -
    • + SinglePassRange1 + and SinglePassRange2 + have the same value type. +
  • -SinglePassRange1's - value type is a model of the LessThanComparableConcept. -
    • + SinglePassRange1's + value type is a model of the LessThanComparableConcept. +
  • -SinglePassRange2's - value type is a model of the LessThanComparableConcept. -
    • + SinglePassRange2's + value type is a model of the LessThanComparableConcept. +
  • - The ordering of objects of type SinglePassRange1's - value type is a strict weak ordering, - as defined in the LessThanComparableConcept - requirements. -
    • + The ordering of objects of type SinglePassRange1's + value type is a strict weak ordering, + as defined in the LessThanComparableConcept + requirements. +
  • - The ordering of objects of type SinglePassRange2's - value type is a strict weak ordering, - as defined in the LessThanComparableConcept - requirements. -
    • + The ordering of objects of type SinglePassRange2's + value type is a strict weak ordering, + as defined in the LessThanComparableConcept + requirements. +

For the predicate versions:

  • -SinglePassRange1 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange1 + is a model of the Single + Pass Range Concept. +
  • -SinglePassRange2 is - a model of the Single - Pass Range Concept. -
    • + SinglePassRange2 + is a model of the Single + Pass Range Concept. +
  • -OutputIterator is a - model of the OutputIteratorConcept. -
    • + OutputIterator is + a model of the OutputIteratorConcept. +
  • -SinglePassRange1 and - SinglePassRange2 have - the same value type. -
    • + SinglePassRange1 + and SinglePassRange2 + have the same value type. +
  • -BinaryPredicate is - a model of the StrictWeakOrderingConcept. -
    • + BinaryPredicate is + a model of the StrictWeakOrderingConcept. +
  • -SinglePassRange1's - value type is convertible to BinaryPredicate's - first argument type. -
    • + SinglePassRange1's + value type is convertible to BinaryPredicate's + first argument type. +
  • -SinglePassRange2's - value type is convertible to BinaryPredicate's - second argument types. -
    • + SinglePassRange2's + value type is convertible to BinaryPredicate's + second argument types. +
- + Precondition:

@@ -180,7 +180,7 @@ according to pred.

- + Complexity

@@ -198,7 +198,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/concept_implementation.html b/doc/html/range/reference/concept_implementation.html index 0d150f3..f2c4792 100644 --- a/doc/html/range/reference/concept_implementation.html +++ b/doc/html/range/reference/concept_implementation.html @@ -2,8 +2,8 @@ Range concept implementation - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+

Range concept implementation @@ -42,7 +42,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/concept_implementation/semantics.html b/doc/html/range/reference/concept_implementation/semantics.html index 15c6e46..9593b74 100644 --- a/doc/html/range/reference/concept_implementation/semantics.html +++ b/doc/html/range/reference/concept_implementation/semantics.html @@ -2,8 +2,8 @@ Semantics - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -31,7 +31,7 @@
Functions
- + notation
@@ -157,7 +157,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/concept_implementation/semantics/functions.html b/doc/html/range/reference/concept_implementation/semantics/functions.html index 0c0ef81..895d32d 100644 --- a/doc/html/range/reference/concept_implementation/semantics/functions.html +++ b/doc/html/range/reference/concept_implementation/semantics/functions.html @@ -2,8 +2,8 @@ Functions - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -402,7 +402,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/concept_implementation/semantics/metafunctions.html b/doc/html/range/reference/concept_implementation/semantics/metafunctions.html index 779a3b7..1a03534 100644 --- a/doc/html/range/reference/concept_implementation/semantics/metafunctions.html +++ b/doc/html/range/reference/concept_implementation/semantics/metafunctions.html @@ -2,8 +2,8 @@ Metafunctions - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -230,7 +230,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/concept_implementation/synopsis.html b/doc/html/range/reference/concept_implementation/synopsis.html index 9dffad1..9fdbc91 100644 --- a/doc/html/range/reference/concept_implementation/synopsis.html +++ b/doc/html/range/reference/concept_implementation/synopsis.html @@ -2,8 +2,8 @@ Synopsis - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -179,7 +179,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/extending.html b/doc/html/range/reference/extending.html index a9d7524..8ca7be8 100644 --- a/doc/html/range/reference/extending.html +++ b/doc/html/range/reference/extending.html @@ -2,8 +2,8 @@ Extending the library - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -45,7 +45,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/extending/method_1.html b/doc/html/range/reference/extending/method_1.html index 632687b..910d2de 100644 --- a/doc/html/range/reference/extending/method_1.html +++ b/doc/html/range/reference/extending/method_1.html @@ -2,8 +2,8 @@ Method 1: provide member functions and nested types - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+

Method 1: provide member functions and nested types @@ -155,7 +155,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/extending/method_2.html b/doc/html/range/reference/extending/method_2.html index f4f3524..3828c8b 100644 --- a/doc/html/range/reference/extending/method_2.html +++ b/doc/html/range/reference/extending/method_2.html @@ -2,8 +2,8 @@ Method 2: provide free-standing functions and specialize metafunctions - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+

Method 2: provide free-standing functions and specialize metafunctions @@ -261,7 +261,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/extending/method_3.html b/doc/html/range/reference/extending/method_3.html index f841237..2ec9d4d 100644 --- a/doc/html/range/reference/extending/method_3.html +++ b/doc/html/range/reference/extending/method_3.html @@ -2,8 +2,8 @@ Method 3: provide range adaptor implementations - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+

Method 3: provide range adaptor implementations @@ -44,7 +44,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/extending/method_3/method_3_1.html b/doc/html/range/reference/extending/method_3/method_3_1.html index e995bee..3c038e6 100644 --- a/doc/html/range/reference/extending/method_3/method_3_1.html +++ b/doc/html/range/reference/extending/method_3/method_3_1.html @@ -2,8 +2,8 @@ Method 3.1: Implement a Range Adaptor without arguments - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
Method 3.1: Implement a Range Adaptor without arguments @@ -33,7 +33,7 @@

  1. - Provide a range for your return type, for example: + Provide a range for your return type, for example: 
    #include <boost/range/iterator_range.hpp>
 #include <boost/iterator/reverse_iterator.hpp>
 
@@ -57,17 +57,19 @@
     { }
 };
    -
    2. +
  2. - Provide a tag to uniquely identify your adaptor in the operator| - function overload set + Provide a tag to uniquely identify your adaptor in the operator| + function overload set 
    namespace detail {
     struct reverse_forwarder {};
 }
    -
    3. +
  3. - Implement operator|
    template< class BidirectionalRng >
+                Implement operator|
+                
+
    template< class BidirectionalRng >
 inline reverse_range<BidirectionalRng>
 operator|( BidirectionalRng& r, detail::reverse_forwarder )
 {
@@ -81,7 +83,7 @@
 	return reverse_range<const BidirectionalRng>( r );
 }
 
    
-
    4. +
@@ -94,7 +96,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/extending/method_3/method_3_2.html b/doc/html/range/reference/extending/method_3/method_3_2.html index 2a0be9d..1f2102d 100644 --- a/doc/html/range/reference/extending/method_3/method_3_2.html +++ b/doc/html/range/reference/extending/method_3/method_3_2.html @@ -2,8 +2,8 @@ Method 3.2: Implement a Range Adaptor with arguments - - + + @@ -13,23 +13,23 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
  1. - Provide a range for your return type, for example: + Provide a range for your return type, for example: 
    #include <boost/range/adaptor/argument_fwd.hpp>
 #include <boost/range/iterator_range.hpp>
 #include <boost/iterator/transform_iterator.hpp>
@@ -77,11 +77,11 @@
      }
  };
    -
    2. +
  2. - Implement a holder class to hold the arguments required to construct - the RangeAdaptor. -
    3. + Implement a holder class to hold the arguments required to construct + the RangeAdaptor. +

The holder combines multiple parameters into one that can be passed as @@ -104,8 +104,8 @@

  1. - Define an instance of the holder with the name of the adaptor -
+ Define an instance of the holder with the name of the adaptor +

@@ -115,8 +115,8 @@

  1. - Define operator| -
+ Define operator| +

@@ -149,7 +149,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/overview.html b/doc/html/range/reference/overview.html index 9738793..0005ece 100644 --- a/doc/html/range/reference/overview.html +++ b/doc/html/range/reference/overview.html @@ -2,8 +2,8 @@ Overview - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -31,12 +31,14 @@

  • - standard-like containers -
    • -
  • std::pair<iterator,iterator>
    • + standard-like containers +
  • - built-in arrays -
    • + std::pair<iterator,iterator> + +
  • + built-in arrays +

Even though the behavior of the primary templates are exactly such that standard @@ -62,7 +64,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/ranges.html b/doc/html/range/reference/ranges.html index d1d6017..6f8c5af 100644 --- a/doc/html/range/reference/ranges.html +++ b/doc/html/range/reference/ranges.html @@ -2,8 +2,8 @@ Provided Ranges - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -42,7 +42,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/ranges/counting_range.html b/doc/html/range/reference/ranges/counting_range.html index 53da5b8..76be953 100644 --- a/doc/html/range/reference/ranges/counting_range.html +++ b/doc/html/range/reference/ranges/counting_range.html @@ -2,8 +2,8 @@ counting_range - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -48,7 +48,7 @@

- + Description

@@ -58,21 +58,21 @@ (from Boost.Iterator).

- + Definition

Defined in header file boost/range/counting_range.hpp

- + Requirements
  1. -Incrementable is a model - of the Incrementable - Concept. -
+ Incrementable is a + model of the Incrementable + Concept. +
@@ -84,7 +84,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/ranges/irange.html b/doc/html/range/reference/ranges/irange.html index 1a7c730..1ada3ba 100644 --- a/doc/html/range/reference/ranges/irange.html +++ b/doc/html/range/reference/ranges/irange.html @@ -2,8 +2,8 @@ irange - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -44,7 +44,7 @@

- + Description

@@ -58,28 +58,29 @@ parameters denoted a half-open range.

- + Definition

Defined in the header file boost/range/irange.hpp

- + Requirements
  1. -Integer is a model of - the Integer Concept. -
    2. + Integer is a model + of the Integer Concept. +
  2. -StepSize is a model of - the SignedInteger Concept. -
    3. + StepSize is a model + of the SignedInteger + Concept. +
- + Complexity

@@ -97,7 +98,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/ranges/istream_range.html b/doc/html/range/reference/ranges/istream_range.html index f017f57..449fa5d 100644 --- a/doc/html/range/reference/ranges/istream_range.html +++ b/doc/html/range/reference/ranges/istream_range.html @@ -2,8 +2,8 @@ istream_range - - + + @@ -13,21 +13,21 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
- + Prototype

@@ -40,7 +40,7 @@

- + Description

@@ -49,7 +49,7 @@ wrapping a std::istream_iterator.

- + Definition

@@ -66,7 +66,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/utilities.html b/doc/html/range/reference/utilities.html index f2f39b2..45e60d3 100644 --- a/doc/html/range/reference/utilities.html +++ b/doc/html/range/reference/utilities.html @@ -2,8 +2,8 @@ Utilities - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -41,14 +41,14 @@

  • - Class iterator_range -
    • + Class iterator_range +
  • - Class sub_range -
    • + Class sub_range +
  • - Function join -
    • + Function join +

The iterator_range class @@ -77,7 +77,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/utilities/iterator_range.html b/doc/html/range/reference/utilities/iterator_range.html index ade0bc0..512fbd6 100644 --- a/doc/html/range/reference/utilities/iterator_range.html +++ b/doc/html/range/reference/utilities/iterator_range.html @@ -2,8 +2,8 @@ Class iterator_range - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -48,7 +48,7 @@ type.

- + Synopsis

@@ -188,39 +188,26 @@ iterators from the same container.

- + Details member functions

operator unspecified_bool_type() const;

-
-

-

-

- Returns !empty(); -

-

-

-
+

+ Returns !empty(); +

bool equal( iterator_range& r ) const;

-
-

-

-

- Returns begin() - == r.begin() && - end() - == r.end(); -

-

-

-
+

+ Returns begin() == r.begin() && + end() + == r.end(); +

- + Details functions
@@ -229,45 +216,27 @@ l, const ForwardRange2& r );

-
-

-

-

- Returns size(l) != size(r) ? false : std::equal( - begin(l), end(l), begin(r) ); -

-

-

-
+

+ Returns size(l) != size(r) ? false + : std::equal( begin(l), end(l), begin(r) ); +

bool operator!=( const ForwardRange1& l, const ForwardRange2& r );

-
-

-

-

- Returns !( l == r ); -

-

-

-
+

+ Returns !( l == r ); +

bool operator<( const ForwardRange1& l, const ForwardRange2& r );

-
-

-

-

- Returns std::lexicographical_compare( - begin(l), end(l), begin(r), end(r) ); -

-

-

-
+

+ Returns std::lexicographical_compare( + begin(l), end(l), begin(r), end(r) ); +

@@ -277,15 +246,9 @@

-
-

-

-

- Effects: -

-

-

-
+

+ Effects: +

@@ -301,16 +264,10 @@ Sequence copy_range( const ForwardRange& r );

-
-

-

-

- Returns Sequence( - begin(r), end(r) ); -

-

-

-
+

+ Returns Sequence( + begin(r), end(r) ); +

@@ -322,7 +279,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/utilities/join.html b/doc/html/range/reference/utilities/join.html index d3c70ab..a0706c9 100644 --- a/doc/html/range/reference/utilities/join.html +++ b/doc/html/range/reference/utilities/join.html @@ -2,8 +2,8 @@ Function join - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -39,7 +39,7 @@ check if the end of a range has been reached internally during traversal.

- + Synposis

@@ -65,7 +65,7 @@

- + Example

@@ -83,7 +83,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/reference/utilities/sub_range.html b/doc/html/range/reference/utilities/sub_range.html index 5fab009..0eb2588 100644 --- a/doc/html/range/reference/utilities/sub_range.html +++ b/doc/html/range/reference/utilities/sub_range.html @@ -2,8 +2,8 @@ Class sub_range - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -35,7 +35,7 @@ is.

- + Synopsis

@@ -117,7 +117,7 @@

-PrevUpHomeNext +PrevUpHomeNext
diff --git a/doc/html/range/style_guide.html b/doc/html/range/style_guide.html index c9f3e34..c5e6877 100644 --- a/doc/html/range/style_guide.html +++ b/doc/html/range/style_guide.html @@ -2,8 +2,8 @@ Terminology and style guidelines - - + + @@ -13,16 +13,16 @@ - +
Boost C++ Libraries HomeLibrariesLibraries People FAQ More
-PrevUpHomeNext +PrevUpHomeNext
-
+
@@ -39,31 +39,41 @@

  • -Value access category: -
      + Value access category: +
      • - Readable Range -
        • + Readable Range +
      • - Writeable Range -
        • + Writeable Range +
      • - Swappable Range -
        • + Swappable Range +
      • - Lvalue Range -
        • + Lvalue Range +
      - +
    • -Traversal category: -

      Notice how we have used the categories from the new @@ -77,11 +87,11 @@

      • - Random Access Readable Writeable Range -
        • + Random Access Readable Writeable Range +
      • - Forward Lvalue Range -
        • + Forward Lvalue Range +

      By convention, we should always specify the traversal @@ -135,7 +145,7 @@

      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/range/upgrade.html b/doc/html/range/upgrade.html index ad53c37..2e6a068 100644 --- a/doc/html/range/upgrade.html +++ b/doc/html/range/upgrade.html @@ -2,8 +2,8 @@ Upgrade version of Boost.Range - - + + @@ -13,16 +13,16 @@ - +
      Boost C++ Libraries HomeLibrariesLibraries People FAQ More
      -PrevUpHomeNext +PrevUpHomeNext
      -
      +
      @@ -43,7 +43,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/range/upgrade/upgrade_from_1_34.html b/doc/html/range/upgrade/upgrade_from_1_34.html index 1275e9c..bc22cb6 100644 --- a/doc/html/range/upgrade/upgrade_from_1_34.html +++ b/doc/html/range/upgrade/upgrade_from_1_34.html @@ -2,8 +2,8 @@ Upgrade from version 1.34 - - + + @@ -13,16 +13,16 @@ - +
      Boost C++ Libraries HomeLibrariesLibraries People FAQ More
      -PrevUpHomeNext +PrevUpHomeNext
      -
      +

      Upgrade from version 1.34 @@ -32,32 +32,34 @@

      1. - Direct support for character arrays was abandoned in favor of uniform treatment - of all arrays. Instead string algorithms can use the new function as_literal(). -
        2. + Direct support for character arrays was abandoned in favor of uniform + treatment of all arrays. Instead string algorithms can use the new function + as_literal(). +
      2. -size now requires a Random - Access Range. The old behavior is provided as distance(). -
        3. + size now requires a Random + Access Range. The old behavior is provided as distance(). +
      3. -range_size<T>::type has been completely removed in favor - of range_difference<T>::type -
        4. + range_size<T>::type has been completely removed in + favor of range_difference<T>::type +
      4. -boost_range_begin() - and boost_range_end() - have been renamed range_begin() and range_end() respectively. -
        5. + boost_range_begin() + and boost_range_end() + have been renamed range_begin() and range_end() respectively. +
      5. -range_result_iterator<T>::type and range_reverse_result_iterator<T>::type - have been renamed range_iterator<T>::type - and range_reverse_iterator<T>::type. -
        6. + range_result_iterator<T>::type + and range_reverse_result_iterator<T>::type + have been renamed range_iterator<T>::type + and range_reverse_iterator<T>::type. +
      6. - The procedure that makes a custom type work with the library has been greatly - simplified. See Extending the - library for UDTs for details. -
        7. + The procedure that makes a custom type work with the library has been + greatly simplified. See Extending + the library for UDTs for details. +

      @@ -70,7 +72,7 @@
      -PrevUpHomeNext +PrevUpHomeNext
      diff --git a/doc/html/range/upgrade/upgrade_from_1_42.html b/doc/html/range/upgrade/upgrade_from_1_42.html index 3fbc2d2..3174dc1 100644 --- a/doc/html/range/upgrade/upgrade_from_1_42.html +++ b/doc/html/range/upgrade/upgrade_from_1_42.html @@ -2,8 +2,8 @@ Upgrade from version 1.42 - - + + @@ -13,16 +13,16 @@ - +
      Boost C++ Libraries HomeLibrariesLibraries People FAQ More
      -PrevUpHomeNext +PrevUpHomeNext
      -
      +

      Upgrade from version 1.42 @@ -31,22 +31,26 @@ New features:

        -
      1. Range adaptors
        2. -
      2. Range algorithms
        3. +
      3. + Range adaptors +
        4. +
      4. + Range algorithms +

      Removed:

      1. -iterator_range no longer - has a is_singular member - function. The singularity restrictions have been removed from the iterator_range class since this added - restrictions to ranges of iterators whose default constructors were not - singular. Previously the is_singular - member function always returned false - in release build configurations, hence it is not anticipated that this - interface change will produce difficulty in upgrading. -
      + iterator_range no longer + has a is_singular member + function. The singularity restrictions have been removed from the iterator_range class since this added + restrictions to ranges of iterators whose default constructors were not + singular. Previously the is_singular + member function always returned false + in release build configurations, hence it is not anticipated that this + interface change will produce difficulty in upgrading. +

@@ -58,7 +62,7 @@
-PrevUpHomeNext +PrevUpHomeNext
diff --git a/include/boost/range/algorithm/find.hpp b/include/boost/range/algorithm/find.hpp index cb40919..72c5cf1 100755 --- a/include/boost/range/algorithm/find.hpp +++ b/include/boost/range/algorithm/find.hpp @@ -27,7 +27,10 @@ namespace boost /// /// \pre SinglePassRange is a model of the SinglePassRangeConcept template< class SinglePassRange, class Value > -inline BOOST_DEDUCED_TYPENAME range_iterator::type +inline BOOST_DEDUCED_TYPENAME disable_if< + is_const, + BOOST_DEDUCED_TYPENAME range_iterator::type +>::type find( SinglePassRange& rng, const Value& val ) { BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); @@ -47,7 +50,10 @@ find( const SinglePassRange& rng, const Value& val ) /// \overload template< range_return_value re, class SinglePassRange, class Value > -inline BOOST_DEDUCED_TYPENAME range_return::type +inline BOOST_DEDUCED_TYPENAME disable_if< + is_const, + BOOST_DEDUCED_TYPENAME range_return::type +>::type find( SinglePassRange& rng, const Value& val ) { BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); diff --git a/include/boost/range/algorithm/find_end.hpp b/include/boost/range/algorithm/find_end.hpp index cd09525..757e999 100755 --- a/include/boost/range/algorithm/find_end.hpp +++ b/include/boost/range/algorithm/find_end.hpp @@ -29,7 +29,10 @@ namespace boost /// \pre ForwardRange2 is a model of the ForwardRangeConcept /// \pre BinaryPredicate is a model of the BinaryPredicateConcept template< class ForwardRange1, class ForwardRange2 > -inline BOOST_DEDUCED_TYPENAME range_iterator< ForwardRange1 >::type +inline BOOST_DEDUCED_TYPENAME disable_if< + is_const, + BOOST_DEDUCED_TYPENAME range_iterator< ForwardRange1 >::type +>::type find_end(ForwardRange1 & rng1, const ForwardRange2& rng2) { BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); @@ -53,7 +56,10 @@ find_end(const ForwardRange1 & rng1, const ForwardRange2& rng2) /// \overload template< class ForwardRange1, class ForwardRange2, class BinaryPredicate > -inline BOOST_DEDUCED_TYPENAME range_iterator::type +inline BOOST_DEDUCED_TYPENAME disable_if< + is_const, + BOOST_DEDUCED_TYPENAME range_iterator::type +>::type find_end(ForwardRange1 & rng1, const ForwardRange2& rng2, BinaryPredicate pred) { BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); @@ -77,7 +83,10 @@ find_end(const ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate p /// \overload template< range_return_value re, class ForwardRange1, class ForwardRange2 > -inline BOOST_DEDUCED_TYPENAME range_return::type +inline BOOST_DEDUCED_TYPENAME disable_if< + is_const, + BOOST_DEDUCED_TYPENAME range_return::type +>::type find_end(ForwardRange1& rng1, const ForwardRange2& rng2) { BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); @@ -106,7 +115,10 @@ find_end(const ForwardRange1& rng1, const ForwardRange2& rng2) /// \overload template< range_return_value re, class ForwardRange1, class ForwardRange2, class BinaryPredicate > -inline BOOST_DEDUCED_TYPENAME range_return::type +inline BOOST_DEDUCED_TYPENAME disable_if< + is_const, + BOOST_DEDUCED_TYPENAME range_return::type +>::type find_end(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred) { BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); diff --git a/include/boost/range/algorithm/find_first_of.hpp b/include/boost/range/algorithm/find_first_of.hpp index 37e58eb..4cb5989 100755 --- a/include/boost/range/algorithm/find_first_of.hpp +++ b/include/boost/range/algorithm/find_first_of.hpp @@ -29,7 +29,10 @@ namespace boost /// \pre ForwardRange2 is a model of the ForwardRangeConcept /// \pre BinaryPredicate is a model of the BinaryPredicateConcept template< class SinglePassRange1, class ForwardRange2 > -inline BOOST_DEDUCED_TYPENAME range_iterator::type +inline BOOST_DEDUCED_TYPENAME disable_if< + is_const, + BOOST_DEDUCED_TYPENAME range_iterator::type +>::type find_first_of(SinglePassRange1 & rng1, ForwardRange2 const & rng2) { BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); @@ -53,7 +56,10 @@ find_first_of(const SinglePassRange1& rng1, const ForwardRange2& rng2) /// \overload template< class SinglePassRange1, class ForwardRange2, class BinaryPredicate > -inline BOOST_DEDUCED_TYPENAME range_iterator::type +inline BOOST_DEDUCED_TYPENAME disable_if< + is_const, + BOOST_DEDUCED_TYPENAME range_iterator::type +>::type find_first_of(SinglePassRange1 & rng1, ForwardRange2 const & rng2, BinaryPredicate pred) { BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); @@ -78,7 +84,10 @@ find_first_of(const SinglePassRange1& rng1, const ForwardRange2& rng2, BinaryPre // range return overloads /// \overload template< range_return_value re, class SinglePassRange1, class ForwardRange2 > -inline BOOST_DEDUCED_TYPENAME range_return::type +inline BOOST_DEDUCED_TYPENAME disable_if< + is_const, + BOOST_DEDUCED_TYPENAME range_return::type +>::type find_first_of(SinglePassRange1& rng1, const ForwardRange2& rng2) { BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); @@ -107,7 +116,10 @@ find_first_of(const SinglePassRange1& rng1, const ForwardRange2& rng2) /// \overload template< range_return_value re, class SinglePassRange1, class ForwardRange2, class BinaryPredicate > -inline BOOST_DEDUCED_TYPENAME range_return::type +inline BOOST_DEDUCED_TYPENAME disable_if< + is_const, + BOOST_DEDUCED_TYPENAME range_return::type +>::type find_first_of(SinglePassRange1 & rng1, const ForwardRange2& rng2, BinaryPredicate pred) { diff --git a/include/boost/range/algorithm/find_if.hpp b/include/boost/range/algorithm/find_if.hpp index ba86c62..2d1926d 100755 --- a/include/boost/range/algorithm/find_if.hpp +++ b/include/boost/range/algorithm/find_if.hpp @@ -28,7 +28,10 @@ namespace boost /// \pre SinglePassRange is a model of the SinglePassRangeConcept /// \pre UnaryPredicate is a model of the UnaryPredicateConcept template< class SinglePassRange, class UnaryPredicate > -inline BOOST_DEDUCED_TYPENAME range_iterator::type +inline BOOST_DEDUCED_TYPENAME disable_if< + is_const, + BOOST_DEDUCED_TYPENAME range_iterator::type +>::type find_if( SinglePassRange& rng, UnaryPredicate pred ) { BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); @@ -48,7 +51,10 @@ find_if( const SinglePassRange& rng, UnaryPredicate pred ) /// \overload template< range_return_value re, class SinglePassRange, class UnaryPredicate > -inline BOOST_DEDUCED_TYPENAME range_return::type +inline BOOST_DEDUCED_TYPENAME disable_if< + is_const, + BOOST_DEDUCED_TYPENAME range_return::type +>::type find_if( SinglePassRange& rng, UnaryPredicate pred ) { BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); diff --git a/include/boost/range/algorithm/lower_bound.hpp b/include/boost/range/algorithm/lower_bound.hpp index 402e3c7..cb5e639 100755 --- a/include/boost/range/algorithm/lower_bound.hpp +++ b/include/boost/range/algorithm/lower_bound.hpp @@ -27,7 +27,10 @@ namespace boost /// /// \pre ForwardRange is a model of the ForwardRangeConcept template< class ForwardRange, class Value > -inline BOOST_DEDUCED_TYPENAME range_iterator::type +inline BOOST_DEDUCED_TYPENAME disable_if< + is_const, + BOOST_DEDUCED_TYPENAME range_iterator::type +>::type lower_bound( ForwardRange& rng, Value val ) { BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); @@ -45,7 +48,10 @@ lower_bound( const ForwardRange& rng, Value val ) /// \overload template< class ForwardRange, class Value, class SortPredicate > -inline BOOST_DEDUCED_TYPENAME range_iterator::type +inline BOOST_DEDUCED_TYPENAME disable_if< + is_const, + BOOST_DEDUCED_TYPENAME range_iterator::type +>::type lower_bound( ForwardRange& rng, Value val, SortPredicate pred ) { BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); @@ -63,7 +69,10 @@ lower_bound( const ForwardRange& rng, Value val, SortPredicate pred ) /// \overload template< range_return_value re, class ForwardRange, class Value > -inline BOOST_DEDUCED_TYPENAME range_return::type +inline BOOST_DEDUCED_TYPENAME disable_if< + is_const, + BOOST_DEDUCED_TYPENAME range_return::type +>::type lower_bound( ForwardRange& rng, Value val ) { BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept )); @@ -85,7 +94,10 @@ lower_bound( const ForwardRange& rng, Value val ) /// \overload template< range_return_value re, class ForwardRange, class Value, class SortPredicate > -inline BOOST_DEDUCED_TYPENAME range_return::type +inline BOOST_DEDUCED_TYPENAME disable_if< + is_const, + BOOST_DEDUCED_TYPENAME range_return::type +>::type lower_bound( ForwardRange& rng, Value val, SortPredicate pred ) { BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept ));