diff --git a/doc/boost_range.qbk b/doc/boost_range.qbk index 6f6af4f..80bbf06 100644 --- a/doc/boost_range.qbk +++ b/doc/boost_range.qbk @@ -36,30 +36,30 @@ [def __iterator_range__ [link range.reference.utilities.iterator_range `iterator_range`]] [def __sub_range__ [link range.reference.utilities.sub_range `sub_range`]] [def __minimal_interface__ [link range.reference.extending minimal interface]] -[def __range_result_iterator__ [link range.reference.semantics.metafunctions `range_result_iterator`]] +[def __range_result_iterator__ [link range.reference.concept_implementation.semantics.metafunctions `range_result_iterator`]] [def __extending_for_udts__ [link range.reference.extending Extending the library for UDTs]] -[def __implementation_of_metafunctions__ [link range.reference.semantics.metafunctions Implementation of metafunctions]] -[def __implementation_of_functions__ [link range.reference.semantics.functions Implementation of functions]] +[def __implementation_of_metafunctions__ [link range.reference.concept_implementation.semantics.metafunctions Implementation of metafunctions]] +[def __implementation_of_functions__ [link range.reference.concept_implementation.semantics.functions Implementation of functions]] -[def __range_value__ [link range.reference.semantics.metafunctions `range_value`]] -[def __range_iterator__ [link range.reference.semantics.metafunctions `range_iterator`]] -[def __range_difference__ [link range.reference.semantics.metafunctions `range_difference`]] -[def __range_pointer__ [link range.reference.semantics.metafunctions `range_pointer`]] -[def __range_category__ [link range.reference.semantics.metafunctions `range_category`]] -[def __range_reverse_iterator__ [link range.reference.semantics.metafunctions `range_reverse_iterator`]] -[def __begin__ [link range.reference.semantics.functions `begin`]] -[def __const_begin__ [link range.reference.semantics.functions `const_begin`]] -[def __end__ [link range.reference.semantics.functions `end`]] -[def __const_end__ [link range.reference.semantics.functions `const_end`]] -[def __empty__ [link range.reference.semantics.functions `empty`]] -[def __distance__ [link range.reference.semantics.functions `distance`]] -[def __size__ [link range.reference.semantics.functions `size`]] -[def __rbegin__ [link range.reference.semantics.functions `rbegin`]] -[def __const_rbegin__ [link range.reference.semantics.functions `const_rbegin`]] -[def __rend__ [link range.reference.semantics.functions `rend`]] -[def __const_rend__ [link range.reference.semantics.functions `const_rend`]] -[def __as_array__ [link range.reference.semantics.functions `as_array`]] -[def __as_literal__ [link range.reference.semantics.functions `as_literal`]] +[def __range_value__ [link range.reference.concept_implementation.semantics.metafunctions `range_value`]] +[def __range_iterator__ [link range.reference.concept_implementation.semantics.metafunctions `range_iterator`]] +[def __range_difference__ [link range.reference.concept_implementation.semantics.metafunctions `range_difference`]] +[def __range_pointer__ [link range.reference.concept_implementation.semantics.metafunctions `range_pointer`]] +[def __range_category__ [link range.reference.concept_implementation.semantics.metafunctions `range_category`]] +[def __range_reverse_iterator__ [link range.reference.concept_implementation.semantics.metafunctions `range_reverse_iterator`]] +[def __begin__ [link range.reference.concept_implementation.semantics.functions `begin`]] +[def __const_begin__ [link range.reference.concept_implementation.semantics.functions `const_begin`]] +[def __end__ [link range.reference.concept_implementation.semantics.functions `end`]] +[def __const_end__ [link range.reference.concept_implementation.semantics.functions `const_end`]] +[def __empty__ [link range.reference.concept_implementation.semantics.functions `empty`]] +[def __distance__ [link range.reference.concept_implementation.semantics.functions `distance`]] +[def __size__ [link range.reference.concept_implementation.semantics.functions `size`]] +[def __rbegin__ [link range.reference.concept_implementation.semantics.functions `rbegin`]] +[def __const_rbegin__ [link range.reference.concept_implementation.semantics.functions `const_rbegin`]] +[def __rend__ [link range.reference.concept_implementation.semantics.functions `rend`]] +[def __const_rend__ [link range.reference.concept_implementation.semantics.functions `const_rend`]] +[def __as_array__ [link range.reference.concept_implementation.semantics.functions `as_array`]] +[def __as_literal__ [link range.reference.concept_implementation.semantics.functions `as_literal`]] [def __counting_range__ [link range.reference.ranges.counting_range `counting_range`]] [def __irange__ [link range.reference.ranges.irange `irange`]] [def __istream_range__ [link range.reference.ranges.istream_range `istream_range`]] diff --git a/doc/html/index.html b/doc/html/index.html index b2f6b77..f6095bd 100644 --- a/doc/html/index.html +++ b/doc/html/index.html @@ -30,7 +30,7 @@

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)

@@ -52,17 +52,16 @@
Reference
Overview
-
Synopsis
-
Semantics
+
Range concept + implementation
-
Metafunctions
-
Functions
+
Synopsis
+
Semantics
Range Adaptors
Introduction and motivation
-
Synopsis
General Requirements
Reference
@@ -143,7 +142,7 @@

- +

Last revised: April 28, 2010 at 15:53:14 GMT

Last revised: April 28, 2010 at 17:51:33 GMT
diff --git a/doc/html/quickbook_HTML.manifest b/doc/html/quickbook_HTML.manifest index 8a0d31a..7c5d13a 100644 --- a/doc/html/quickbook_HTML.manifest +++ b/doc/html/quickbook_HTML.manifest @@ -9,13 +9,13 @@ range/concepts/random_access_range.html range/concepts/concept_checking.html range/reference.html range/reference/overview.html -range/reference/synopsis.html -range/reference/semantics.html -range/reference/semantics/metafunctions.html -range/reference/semantics/functions.html +range/reference/concept_implementation.html +range/reference/concept_implementation/synopsis.html +range/reference/concept_implementation/semantics.html +range/reference/concept_implementation/semantics/metafunctions.html +range/reference/concept_implementation/semantics/functions.html range/reference/adaptors.html range/reference/adaptors/introduction.html -range/reference/adaptors/adaptors_synopsis.html range/reference/adaptors/general_requirements.html range/reference/adaptors/reference.html range/reference/adaptors/reference/adjacent_filtered.html diff --git a/doc/html/range/concepts/bidirectional_range.html b/doc/html/range/concepts/bidirectional_range.html index 1edda7b..72c8c28 100644 --- a/doc/html/range/concepts/bidirectional_range.html +++ b/doc/html/range/concepts/bidirectional_range.html @@ -27,7 +27,7 @@ Bidirectional Range
- + 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,15 +272,16 @@
- + See also

- Implementation of - metafunctions + Implementation + of metafunctions

- Implementation of functions + Implementation + of functions

diff --git a/doc/html/range/concepts/concept_checking.html b/doc/html/range/concepts/concept_checking.html index 311794e..30d3850 100644 --- a/doc/html/range/concepts/concept_checking.html +++ b/doc/html/range/concepts/concept_checking.html @@ -79,7 +79,7 @@
- + See also

diff --git a/doc/html/range/concepts/forward_range.html b/doc/html/range/concepts/forward_range.html index 72df009..61ec9e8 100644 --- a/doc/html/range/concepts/forward_range.html +++ b/doc/html/range/concepts/forward_range.html @@ -27,7 +27,7 @@ Forward Range

- + Notation
@@ -65,7 +65,7 @@
- + Description

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

- + Refinement of

Single Pass Range

- + Associated types
@@ -132,15 +132,16 @@
- + See also

- Implementation of - metafunctions + Implementation + of metafunctions

- Implementation of functions + Implementation + of functions

diff --git a/doc/html/range/concepts/random_access_range.html b/doc/html/range/concepts/random_access_range.html index 66edd3c..379410e 100644 --- a/doc/html/range/concepts/random_access_range.html +++ b/doc/html/range/concepts/random_access_range.html @@ -27,7 +27,7 @@ Random Access Range
- + 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
diff --git a/doc/html/range/concepts/single_pass_range.html b/doc/html/range/concepts/single_pass_range.html index 5728a92..32bcef4 100644 --- a/doc/html/range/concepts/single_pass_range.html +++ b/doc/html/range/concepts/single_pass_range.html @@ -27,7 +27,7 @@ Single Pass Range
- + 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,18 +316,19 @@
- + See also

Extending the library for UDTs

- Implementation of - metafunctions + Implementation + of metafunctions

- Implementation of functions + Implementation + of functions

Container diff --git a/doc/html/range/history_ack.html b/doc/html/range/history_ack.html index a67833d..37d497d 100644 --- a/doc/html/range/history_ack.html +++ b/doc/html/range/history_ack.html @@ -26,7 +26,7 @@ History and Acknowledgement

- + Version 1 - before Boost 1.43

@@ -79,7 +79,7 @@ The concept checks and their documentation was provided by Daniel Walker.

- + Version 2 - Boost 1.43 and beyond

diff --git a/doc/html/range/library_headers/general.html b/doc/html/range/library_headers/general.html index 382215d..558fe74 100644 --- a/doc/html/range/library_headers/general.html +++ b/doc/html/range/library_headers/general.html @@ -111,7 +111,7 @@

- range_value + range_value

@@ -128,7 +128,7 @@

- range_iterator + range_iterator

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

- range_difference + range_difference

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

- range_pointer + range_pointer

@@ -179,7 +179,7 @@

- range_category + range_category

@@ -196,7 +196,7 @@

- range_reverse_iterator + range_reverse_iterator

@@ -214,7 +214,7 @@

- begin and const_begin + begin and const_begin

@@ -231,7 +231,7 @@

- end and const_end + end and const_end

@@ -248,7 +248,7 @@

- empty + empty

@@ -265,7 +265,7 @@

- distance + distance

@@ -282,7 +282,7 @@

- size + size

@@ -300,7 +300,7 @@

- rbegin and const_rbegin + rbegin and const_rbegin

@@ -318,7 +318,7 @@

- rend and const_rend + rend and const_rend

@@ -336,7 +336,7 @@

- as_array + as_array

@@ -353,7 +353,7 @@

- as_literal + as_literal

diff --git a/doc/html/range/mfc_atl.html b/doc/html/range/mfc_atl.html index 1b4092d..c0f1c6d 100644 --- a/doc/html/range/mfc_atl.html +++ b/doc/html/range/mfc_atl.html @@ -34,7 +34,7 @@
References
- + Introduction

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

- + Overview

diff --git a/doc/html/range/portability.html b/doc/html/range/portability.html index 334df5a..45d3a07 100644 --- a/doc/html/range/portability.html +++ b/doc/html/range/portability.html @@ -38,7 +38,7 @@

Notice also that some compilers cannot do function template ordering properly. - In that case one must rely of range_iterator and a single function + In that case one must rely of range_iterator and a single function definition instead of overloaded versions for const and non-const arguments. So if one cares about old compilers, one should not pass rvalues to the functions.

@@ -50,12 +50,14 @@ do not use built-in arrays,
  • - do not pass rvalues to begin(), - end() and iterator_range Range constructors + do not pass rvalues to begin(), + end() + and iterator_range Range constructors and assignment operators,
  • - use const_begin() and const_end() + use const_begin() + and const_end() whenever your code by intention is read-only; this will also solve most rvalue problems,
    • diff --git a/doc/html/range/reference.html b/doc/html/range/reference.html index 2e597ea..cbff24d 100644 --- a/doc/html/range/reference.html +++ b/doc/html/range/reference.html @@ -28,17 +28,16 @@
    Overview
    -
    Synopsis
    -
    Semantics
    +
    Range concept + implementation
    -
    Metafunctions
    -
    Functions
    +
    Synopsis
    +
    Semantics
    Range Adaptors
    Introduction and motivation
    -
    Synopsis
    General Requirements
    Reference
    diff --git a/doc/html/range/reference/adaptors.html b/doc/html/range/reference/adaptors.html index 86877d9..b649558 100644 --- a/doc/html/range/reference/adaptors.html +++ b/doc/html/range/reference/adaptors.html @@ -6,7 +6,7 @@ - + @@ -20,7 +20,7 @@
    -PrevUpHomeNext +PrevUpHomeNext

    @@ -29,7 +29,6 @@
    Introduction and motivation
    -
    Synopsis
    General Requirements
    Reference
    @@ -45,7 +44,7 @@
    -PrevUpHomeNext +PrevUpHomeNext
    diff --git a/doc/html/range/reference/adaptors/adaptors_reference/adjacent_filtered.html b/doc/html/range/reference/adaptors/adaptors_reference/adjacent_filtered.html deleted file mode 100644 index fa763c8..0000000 --- a/doc/html/range/reference/adaptors/adaptors_reference/adjacent_filtered.html +++ /dev/null @@ -1,151 +0,0 @@ - - - -adjacent_filtered - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    - adjacent_filtered example
    -
    ---- - - - - - - - - - - - - - - -
    -

    - Syntax -

    -     		-

    - Code -

    -
    -

    - Pipe -

    -     		-

    - rng | - boost::adaptors::adjacent_filtered(bi_pred) -

    -
    -

    - Function -

    -     		-

    - boost::adaptors::adjacent_filter(rng, - 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. -
      • -
    • -Throws: Whatever the copy constructor - of bi_pred might throw. -
      • -
    • -Range Category:SinglePassRange -
      • -
    -
    -
    -

    - -

    -
    #include <boost/range/adaptor/adjacent_filtered.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <functional>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::assign;
-    using namespace boost::adaptors;
-
-    std::vector<int> input;
-    input += 1,1,2,2,2,3,4,5,6;
-
-    boost::copy(
-        input | adjacent_filtered(std::not_equal_to<int>()),
-        std::ostream_iterator<int>(std::cout, ","));
-
-    return 0;
-}
-
    -

    -

    -
    -

    - This would produce the output: -

    -
    1,2,3,4,5,6
-
    -

    -

    -
    - - - -
    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) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/range/reference/adaptors/adaptors_reference/copied.html b/doc/html/range/reference/adaptors/adaptors_reference/copied.html deleted file mode 100644 index 650e29a..0000000 --- a/doc/html/range/reference/adaptors/adaptors_reference/copied.html +++ /dev/null @@ -1,152 +0,0 @@ - - - -copied - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    - copied example
    -
    ---- - - - - - - - - - - - - - - -
    -

    - Syntax -

    -     		-

    - Code -

    -
    -

    - Pipe -

    -     		-

    - rng | - boost::adaptors::copied(n, - m) -

    -
    -

    - Function -

    -     		-

    - boost::adaptors::copy(rng, - n, - m) -

    -
    -
      -
    • -Precondition:0 - <= n - && n - <= m - && m - < distance(rng) -
      • -
    • -Returns: A new iterator_range - that holds the sliced range [n,m) - of the original range. -
      • -
    • -Range Category:RandomAccessRange -
      • -
    -
    -
    -

    - -

    -
    #include <boost/range/adaptor/copied.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::assign;
-    using namespace boost::adaptors;
-
-    std::vector<int> input;
-    input += 1,2,3,4,5,6,7,8,9,10;
-
-    boost::copy(
-        input | copied(1, 5),
-        std::ostream_iterator<int>(std::cout, ","));
-
-    return 0;
-}
-
    -

    -

    -
    -

    - This would produce the output: -

    -
    2,3,4,5
-
    -

    -

    -
    - - - -
    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) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/range/reference/adaptors/adaptors_reference/filtered.html b/doc/html/range/reference/adaptors/adaptors_reference/filtered.html deleted file mode 100644 index 1551a9f..0000000 --- a/doc/html/range/reference/adaptors/adaptors_reference/filtered.html +++ /dev/null @@ -1,156 +0,0 @@ - - - -filtered - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    - filtered example
    -
    ---- - - - - - - - - - - - - - - -
    -

    - Syntax -

    -     		-

    - Code -

    -
    -

    - Pipe -

    -     		-

    - rng | - boost::adaptors::filtered(pred) -

    -
    -

    - Function -

    -     		-

    - boost::adaptors::filter(rng, - 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. -
      • -
    • -Throws: Whatever the copy constructor - of pred might throw. -
      • -
    • -Range Category:ForwardRange -
      • -
    • -Returned Range Category:ForwardRange -
      • -
    -
    -
    -

    - -

    -
    #include <boost/range/adaptor/filtered.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-struct is_even
-{
-    bool operator()( int x ) const { return x % 2 == 0; }
-};
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::assign;
-    using namespace boost::adaptors;
-
-    std::vector<int> input;
-    input += 1,2,3,4,5,6,7,8,9;
-
-    boost::copy(
-        input | filtered(is_even()),
-        std::ostream_iterator<int>(std::cout, ","));
-}
-
    -

    -

    -
    -

    - This would produce the output: -

    -
    2,4,6,8
-
    -

    -

    -
    - - - -
    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) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/range/reference/adaptors/adaptors_reference/indexed.html b/doc/html/range/reference/adaptors/adaptors_reference/indexed.html deleted file mode 100644 index d8c8674..0000000 --- a/doc/html/range/reference/adaptors/adaptors_reference/indexed.html +++ /dev/null @@ -1,186 +0,0 @@ - - - -indexed - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    - indexed example
    -
    ---- - - - - - - - - - - - - - - -
    -

    - Syntax -

    -     		-

    - Code -

    -
    -

    - Pipe -

    -     		-

    - rng | - boost::adaptors::indexed -

    -
    -

    - Function -

    -     		-

    - boost::adaptors::index(rng) -

    -
    -
      -
    • -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:SinglePassRange -
      • -
    -
    -
    -

    - -

    -
    #include <boost/range/adaptor/indexed.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-template<class Iterator>
-void display_element_and_index(Iterator first, Iterator last)
-{
-    for (Iterator it = first; it != last; ++it)
-    {
-        std::cout << "Element = " << *it << " Index = " << it.index() << std::endl;
-    }
-}
-
-template<class SinglePassRange>
-void display_element_and_index(const SinglePassRange& rng)
-{
-    display_element_and_index(boost::begin(rng), boost::end(rng));
-}
-
-template<class Iterator1, class Iterator2>
-void check_element_and_index(
-        Iterator1 test_first,
-        Iterator1 test_last,
-        Iterator2 reference_first,
-        Iterator2 reference_last)
-{
-    BOOST_CHECK_EQUAL( std::distance(test_first, test_last),
-                       std::distance(reference_first, reference_last) );
-
-    int reference_index = 0;
-
-    Iterator1 test_it = test_first;
-    Iterator2 reference_it = reference_first;
-    for (; test_it != test_last; ++test_it, ++reference_it, ++reference_index)
-    {
-        BOOST_CHECK_EQUAL( *test_it, *reference_it );
-        BOOST_CHECK_EQUAL( test_it.index(), reference_index );
-    }
-}
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::assign;
-    using namespace boost::adaptors;
-
-    std::vector<int> input;
-    input += 10,20,30,40,50,60,70,80,90;
-
-    display_element_and_index( input | indexed(0) );
-
-    return 0;
-}
-
    -

    -

    -
    -

    - This would produce the output: -

    -
    Element = 10 Index = 0
-Element = 20 Index = 1
-Element = 30 Index = 2
-Element = 40 Index = 3
-Element = 50 Index = 4
-Element = 60 Index = 5
-Element = 70 Index = 6
-Element = 80 Index = 7
-Element = 90 Index = 8
-
    -

    -

    -
    - - - -
    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) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/range/reference/adaptors/adaptors_reference/indirected.html b/doc/html/range/reference/adaptors/adaptors_reference/indirected.html deleted file mode 100644 index adcd57a..0000000 --- a/doc/html/range/reference/adaptors/adaptors_reference/indirected.html +++ /dev/null @@ -1,146 +0,0 @@ - - - -indirected - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    - indirected example
    -
    ---- - - - - - - - - - - - - - - -
    -

    - Syntax -

    -     		-

    - Code -

    -
    -

    - Pipe -

    -     		-

    - rng | - boost::adaptors::indirected -

    -
    -

    - Function -

    -     		-

    - boost::adaptors::indirect(rng) -

    -
    -
      -
    • -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. -
      • -
    • -Range Category:SinglePassRange -
      • -
    -
    -
    -

    - -

    -
    #include <boost/range/adaptor/indirected.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/shared_ptr.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::adaptors;
-
-    std::vector<boost::shared_ptr<int> > input;
-
-    for (int i = 0; i < 10; ++i)
-        input.push_back(boost::shared_ptr<int>(new int(i)));
-
-    boost::copy(
-        input | indirected,
-        std::ostream_iterator<int>(std::cout, ","));
-
-    return 0;
-}
-
    -

    -

    -
    -

    - This would produce the output: -

    -
    0,1,2,3,4,5,6,7,8,9
-
    -

    -

    -
    - - - -
    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) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/range/reference/adaptors/adaptors_reference/map_keys.html b/doc/html/range/reference/adaptors/adaptors_reference/map_keys.html deleted file mode 100644 index 95c1746..0000000 --- a/doc/html/range/reference/adaptors/adaptors_reference/map_keys.html +++ /dev/null @@ -1,146 +0,0 @@ - - - -map_keys - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    - map_keys example
    -
    ---- - - - - - - - - - - - - - - -
    -

    - Syntax -

    -     		-

    - Code -

    -
    -

    - Pipe -

    -     		-

    - rng | - boost::adaptors::map_keys -

    -
    -

    - Function -

    -     		-

    - boost::adaptors::keys(rng) -

    -
    -
      -
    • -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. -
      • -
    • -Range Category:SinglePassRange -
      • -
    -
    -
    -

    - -

    -
    #include <boost/range/adaptor/map.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <map>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::assign;
-    using namespace boost::adaptors;
-
-    std::map<int,int> input;
-    for (int i = 0; i < 10; ++i)
-        input.insert(std::make_pair(i, i * 10));
-
-    boost::copy(
-        input | map_keys,
-        std::ostream_iterator<int>(std::cout, ","));
-
-    return 0;
-}
-
    -

    -

    -
    -

    - This would produce the output: -

    -
    0,1,2,3,4,5,6,7,8,9
-
    -

    -

    -
    - - - -
    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) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/range/reference/adaptors/adaptors_reference/map_values.html b/doc/html/range/reference/adaptors/adaptors_reference/map_values.html deleted file mode 100644 index 553a8f3..0000000 --- a/doc/html/range/reference/adaptors/adaptors_reference/map_values.html +++ /dev/null @@ -1,146 +0,0 @@ - - - -map_values - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    - map_values example
    -
    ---- - - - - - - - - - - - - - - -
    -

    - Syntax -

    -     		-

    - Code -

    -
    -

    - Pipe -

    -     		-

    - rng | - boost::adaptors::map_values -

    -
    -

    - Function -

    -     		-

    - boost::adaptors::values(rng) -

    -
    -
      -
    • -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. -
      • -
    • -Range Category:SinglePassRange -
      • -
    -
    -
    -

    - -

    -
    #include <boost/range/adaptor/map.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <map>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::assign;
-    using namespace boost::adaptors;
-
-    std::map<int,int> input;
-    for (int i = 0; i < 10; ++i)
-        input.insert(std::make_pair(i, i * 10));
-
-    boost::copy(
-        input | map_values,
-        std::ostream_iterator<int>(std::cout, ","));
-
-    return 0;
-}
-
    -

    -

    -
    -

    - This would produce the output: -

    -
    0,10,20,30,40,50,60,70,80,90
-
    -

    -

    -
    - - - -
    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) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/range/reference/adaptors/adaptors_reference/replaced.html b/doc/html/range/reference/adaptors/adaptors_reference/replaced.html deleted file mode 100644 index 0990ede..0000000 --- a/doc/html/range/reference/adaptors/adaptors_reference/replaced.html +++ /dev/null @@ -1,161 +0,0 @@ - - - -replaced - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    - replaced example
    -
    ---- - - - - - - - - - - - - - - -
    -

    - Syntax -

    -     		-

    - Code -

    -
    -

    - Pipe -

    -     		-

    - rng | - boost::adaptors::replaced(new_value, - old_value) -

    -
    -

    - Function -

    -     		-

    - boost::adaptors::replace(rng, - new_value, - old_value) -

    -
    -
      -
    • -Precondition:
        -
      • -new_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. -
      • -
    • -Range Category:ForwardRange -
      • -
    -
    -
    -

    - -

    -
    #include <boost/range/adaptor/replaced.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::adaptors;
-    using namespace boost::assign;
-
-    std::vector<int> input;
-    input += 1,2,3,2,5,2,7,2,9;
-
-    boost::copy(
-        input | replaced(2, 10),
-        std::ostream_iterator<int>(std::cout, ","));
-
-    return 0;
-}
-
    -

    -

    -
    -

    - This would produce the output: -

    -
    1,10,3,10,5,10,7,10,9
-
    -

    -

    -
    - - - -
    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) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/range/reference/adaptors/adaptors_reference/replaced_if.html b/doc/html/range/reference/adaptors/adaptors_reference/replaced_if.html deleted file mode 100644 index abcf00f..0000000 --- a/doc/html/range/reference/adaptors/adaptors_reference/replaced_if.html +++ /dev/null @@ -1,165 +0,0 @@ - - - -replaced_if - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    - replaced_if example
    -
    ---- - - - - - - - - - - - - - - -
    -

    - Syntax -

    -     		-

    - Code -

    -
    -

    - Pipe -

    -     		-

    - rng | - boost::adaptors::replaced_if(pred, - new_value) -

    -
    -

    - Function -

    -     		-

    - boost::adaptors::replace_if(rng, - pred, - new_value) -

    -
    -
      -
    • -Precondition:
        -
      • - The range value_type - is convertible to the argument type of pred. -
        • -
      • -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. -
      • -
    • -Range Category:ForwardRange -
      • -
    -
    -
    -

    - -

    -
    #include <boost/range/adaptor/replaced_if.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-struct is_even
-{
-    bool operator()(int x) const { return x % 2 == 0; }
-};
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::adaptors;
-    using namespace boost::assign;
-
-    std::vector<int> input;
-    input += 1,2,3,4,5,6,7,8,9;
-
-    boost::copy(
-        input | replaced_if(is_even(), 10),
-        std::ostream_iterator<int>(std::cout, ","));
-
-    return 0;
-}
-
    -

    -

    -
    -

    - This would produce the output: -

    -
    1,10,3,10,5,10,7,10,9
-
    -

    -

    -
    - - - -
    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) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/range/reference/adaptors/adaptors_reference/reversed.html b/doc/html/range/reference/adaptors/adaptors_reference/reversed.html deleted file mode 100644 index 52f4cda..0000000 --- a/doc/html/range/reference/adaptors/adaptors_reference/reversed.html +++ /dev/null @@ -1,140 +0,0 @@ - - - -reversed - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    - reversed example
    -
    ---- - - - - - - - - - - - - - - -
    -

    - Syntax -

    -     		-

    - Code -

    -
    -

    - Pipe -

    -     		-

    - rng | - boost::adaptors::reversed -

    -
    -

    - Function -

    -     		-

    - boost::adaptors::reverse(rng) -

    -
    -
      -
    • -Returns: A range whose iterators behave - as if they were the original iterators wrapped in reverse_iterator. -
      • -
    • -Range Category:BidirectionalRange -
      • -
    -
    -
    -

    - -

    -
    #include <boost/range/adaptor/reversed.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-void reversed_example_test()
-{
-    using namespace boost::adaptors;
-    using namespace boost::assign;
-
-    std::vector<int> input;
-    input += 1,2,3,4,5,6,7,8,9;
-
-    boost::copy(
-        input | reversed,
-        std::ostream_iterator<int>(std::cout, ","));
-
-    return 0;
-}
-
    -

    -

    -
    -

    - This would produce the output: -

    -
    9,8,7,6,5,4,3,2,1
-
    -

    -

    -
    - - - -
    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) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/range/reference/adaptors/adaptors_reference/sliced.html b/doc/html/range/reference/adaptors/adaptors_reference/sliced.html deleted file mode 100644 index 9793092..0000000 --- a/doc/html/range/reference/adaptors/adaptors_reference/sliced.html +++ /dev/null @@ -1,150 +0,0 @@ - - - -sliced - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    - sliced example
    -
    ---- - - - - - - - - - - - - - - -
    -

    - Syntax -

    -     		-

    - Code -

    -
    -

    - Pipe -

    -     		-

    - rng | - boost::adaptors::sliced(n, - m) -

    -
    -

    - Function -

    -     		-

    - boost::adaptors::slice(rng, - n, - m) -

    -
    -
      -
    • -Precondition:0 - <= n - && n - <= m - && m - < distance(rng) -
      • -
    • -Returns:make_range(rng, n, m) -
      • -
    • -Range Category:RandomAccessRange -
      • -
    -
    -
    -

    - -

    -
    #include <boost/range/adaptor/sliced.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::adaptors;
-    using namespace boost::assign;
-
-    std::vector<int> input;
-    input += 1,2,3,4,5,6,7,8,9;
-
-    boost::copy(
-        input | sliced(2, 5),
-        std::ostream_iterator<int>(std::cout, ","));
-
-    return 0;
-}
-
    -

    -

    -
    -

    - This would produce the output: -

    -
    3,4,5
-
    -

    -

    -
    - - - -
    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) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/range/reference/adaptors/adaptors_reference/strided.html b/doc/html/range/reference/adaptors/adaptors_reference/strided.html deleted file mode 100644 index 6fcc281..0000000 --- a/doc/html/range/reference/adaptors/adaptors_reference/strided.html +++ /dev/null @@ -1,147 +0,0 @@ - - - -strided - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    - strided example
    -
    ---- - - - - - - - - - - - - - - -
    -

    - Syntax -

    -     		-

    - Code -

    -
    -

    - Pipe -

    -     		-

    - rng | - boost::adaptors::strided(n) -

    -
    -

    - Function -

    -     		-

    - boost::adaptors::stride(rng, - n) -

    -
    -
      -
    • -Precondition:0 - <= n - && n - < distance(rng) -
      • -
    • -Returns: A new range based on rng where traversal is performed - in steps of n. -
      • -
    • -Range Category:RandomAccessRange -
      • -
    -
    -
    -

    - -

    -
    #include <boost/range/adaptor/strided.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::adaptors;
-    using namespace boost::assign;
-
-    std::vector<int> input;
-    input += 1,2,3,4,5,6,7,8,9,10;
-
-    boost::copy(
-        input | strided(2),
-        std::ostream_iterator<int>(std::cout, ","));
-
-    return 0;
-}
-
    -

    -

    -
    -

    - This would produce the output: -

    -
    1,3,5,7,9
-
    -

    -

    -
    - - - -
    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) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/range/reference/adaptors/adaptors_reference/tokenized.html b/doc/html/range/reference/adaptors/adaptors_reference/tokenized.html deleted file mode 100644 index fc4bc42..0000000 --- a/doc/html/range/reference/adaptors/adaptors_reference/tokenized.html +++ /dev/null @@ -1,143 +0,0 @@ - - - -tokenized - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    ---- - - - - - - - - - - - - - - -
    -

    - Syntax -

    -     		-

    - Code -

    -
    -

    - Pipe -

    -     		-

    - -

    -
    rng | boost::adaptors::tokenized(regex)
-rng | boost::adaptors::tokenized(regex, i)
-rng | boost::adaptors::tokenized(regex, rndRng)
-rng | boost::adaptors::tokenized(regex, i, flags)
-rng | boost::adaptors::tokenized(regex, rndRng, flags)
-
    -

    -

    -
    -

    - Function -

    -     		-

    - -

    -
    boost::adaptors::tokenize(rng, regex)
-boost::adaptors::tokenize(rng, regex, i)
-boost::adaptors::tokenize(rng, regex, rndRng)
-boost::adaptors::tokenize(rng, regex, i, flags)
-boost::adaptors::tokenize(rng, regex, rndRng, flags)
-
    -

    -

    -
    -
      -
    • -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. -
        • -
      • -i has the type - int. -
        • -
      • - the value_type - of rndRng is int. -
        • -
      • -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. -
      • -
    • -Throws: Whatever constructing and - copying equivalent regex_token_iterators - might throw. -
      • -
    • -Range Category:RandomAccessRange -
      • -
    -
    - - - -
    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) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/range/reference/adaptors/adaptors_reference/transformed.html b/doc/html/range/reference/adaptors/adaptors_reference/transformed.html deleted file mode 100644 index 56a6170..0000000 --- a/doc/html/range/reference/adaptors/adaptors_reference/transformed.html +++ /dev/null @@ -1,156 +0,0 @@ - - - -transformed - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    - transformed example
    -
    ---- - - - - - - - - - - - - - - -
    -

    - Syntax -

    -     		-

    - Code -

    -
    -

    - Pipe -

    -     		-

    - rng | - boost::adaptors::transformed(fun) -

    -
    -

    - Function -

    -     		-

    - boost::adaptors::transform(rng, - 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. -
      • -
    • -Throws: Whatever the copy-constructor - of fun might throw. -
      • -
    • -Range Category:SinglePassRange -
      • -
    -
    -
    -

    - -

    -
    #include <boost/range/adaptor/transformed.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-struct double_int
-{
-    typedef int result_type;
-    int operator()(int x) const { return x * 2; }
-};
-
-int main(int argc, const char* argv[])
-{
-    using namespace boost::adaptors;
-    using namespace boost::assign;
-
-    std::vector<int> input;
-    input += 1,2,3,4,5,6,7,8,9,10;
-
-    boost::copy(
-        input | transformed(double_int()),
-        std::ostream_iterator<int>(std::cout, ","));
-
-    return 0;
-}
-
    -

    -

    -
    -

    - This would produce the output: -

    -
    2,4,6,8,10,12,14,16,18,20
-
    -

    -

    -
    - - - -
    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) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/range/reference/adaptors/adaptors_reference/uniqued.html b/doc/html/range/reference/adaptors/adaptors_reference/uniqued.html deleted file mode 100644 index 3b314ab..0000000 --- a/doc/html/range/reference/adaptors/adaptors_reference/uniqued.html +++ /dev/null @@ -1,142 +0,0 @@ - - - -uniqued - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -
    -
    - uniqued example
    -
    ---- - - - - - - - - - - - - - - -
    -

    - Syntax -

    -     		-

    - Code -

    -
    -

    - Pipe -

    -     		-

    - rng | - boost::adaptors::uniqued -

    -
    -

    - Function -

    -     		-

    - boost::adaptors::unique(rng) -

    -
    -
      -
    • -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. -
      • -
    • -Range Category:ForwardRange -
      • -
    -
    -
    -

    - -

    -
    #include <boost/range/adaptor/uniqued.hpp>
-#include <boost/range/algorithm/copy.hpp>
-#include <boost/assign.hpp>
-#include <algorithm>
-#include <iostream>
-#include <vector>
-
-void uniqued_example_test()
-{
-    using namespace boost::assign;
-    using namespace boost::adaptors;
-
-    std::vector<int> input;
-    input += 1,1,2,2,2,3,4,5,6;
-
-    boost::copy(
-        input | uniqued,
-        std::ostream_iterator<int>(std::cout, ","));
-}
-
    -

    -

    -
    -

    - This would produce the output: -

    -
    1,2,3,4,5,6
-
    -

    -

    -
    - - - -
    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) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/range/reference/adaptors/general_requirements.html b/doc/html/range/reference/adaptors/general_requirements.html index 9cff81a..63abc37 100644 --- a/doc/html/range/reference/adaptors/general_requirements.html +++ b/doc/html/range/reference/adaptors/general_requirements.html @@ -6,7 +6,7 @@ - + @@ -20,7 +20,7 @@
    -PrevUpHomeNext +PrevUpHomeNext

    @@ -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 4375a04..1982491 100644 --- a/doc/html/range/reference/adaptors/introduction.html +++ b/doc/html/range/reference/adaptors/introduction.html @@ -7,7 +7,7 @@ - + @@ -20,7 +20,7 @@
    -PrevUpHomeNext +PrevUpHomeNext

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

    - + Composition of Adaptors
    @@ -159,7 +159,7 @@ is the design solution to this problem.

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

    - + Range Adaptor alternative to count_if algorithm
    @@ -268,7 +268,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 e229ed4..c6d4404 100644 --- a/doc/html/range/reference/adaptors/reference/adjacent_filtered.html +++ b/doc/html/range/reference/adaptors/reference/adjacent_filtered.html @@ -90,7 +90,13 @@ of bi_pred might throw.
  • -Range Category:SinglePassRange +Range Category:Single + Pass Range +
    • +
  • +Returned Range Category: The minimum + of the range category of rng + and Forward Range
    • diff --git a/doc/html/range/reference/adaptors/reference/copied.html b/doc/html/range/reference/adaptors/reference/copied.html index 52ba608..24b72f1 100644 --- a/doc/html/range/reference/adaptors/reference/copied.html +++ b/doc/html/range/reference/adaptors/reference/copied.html @@ -91,7 +91,12 @@ of the original range.
  • -Range Category:RandomAccessRange +Range Category:Random + Access Range +
    • +
  • +Returned Range Category:Random + Access Range
    • diff --git a/doc/html/range/reference/adaptors/reference/filtered.html b/doc/html/range/reference/adaptors/reference/filtered.html index b130702..6ce9f3c 100644 --- a/doc/html/range/reference/adaptors/reference/filtered.html +++ b/doc/html/range/reference/adaptors/reference/filtered.html @@ -89,10 +89,14 @@ of pred might throw.
  • -Range Category:ForwardRange +Range Category:Forward + Range
  • -Returned Range Category:ForwardRange +Returned Range Category: The minimum + of the range category of rng + and Bidirectional + Range
    • diff --git a/doc/html/range/reference/adaptors/reference/indexed.html b/doc/html/range/reference/adaptors/reference/indexed.html index 90ae2a0..3ef95df 100644 --- a/doc/html/range/reference/adaptors/reference/indexed.html +++ b/doc/html/range/reference/adaptors/reference/indexed.html @@ -83,7 +83,12 @@ in the sequence corresponding with the iterator.
  • -Range Category:SinglePassRange +Range Category:Single + Pass Range +
    • +
  • +Returned Range Category: The range + category of rng
    • diff --git a/doc/html/range/reference/adaptors/reference/indirected.html b/doc/html/range/reference/adaptors/reference/indirected.html index 5313ed1..7dc0558 100644 --- a/doc/html/range/reference/adaptors/reference/indirected.html +++ b/doc/html/range/reference/adaptors/reference/indirected.html @@ -84,7 +84,12 @@ element in the original range.
  • -Range Category:SinglePassRange +Range Category:Single + Pass Range +
    • +
  • +Returned Range Category: The range + category of rng
    • diff --git a/doc/html/range/reference/adaptors/reference/map_keys.html b/doc/html/range/reference/adaptors/reference/map_keys.html index 2b46c98..6c69774 100644 --- a/doc/html/range/reference/adaptors/reference/map_keys.html +++ b/doc/html/range/reference/adaptors/reference/map_keys.html @@ -83,8 +83,13 @@ is the corresponding element in the original range.
  • -Range Category:SinglePassRange +Range Category:Single + Pass Range
    • +
  • +Returned Range Category: The range + category of rng. +
    • diff --git a/doc/html/range/reference/adaptors/reference/map_values.html b/doc/html/range/reference/adaptors/reference/map_values.html index 8b3761f..6a906b2 100644 --- a/doc/html/range/reference/adaptors/reference/map_values.html +++ b/doc/html/range/reference/adaptors/reference/map_values.html @@ -83,8 +83,13 @@ is the corresponding element in the original range.
  • -Range Category:SinglePassRange +Range Category:Single + Pass Range
    • +
  • +Returned Range Category: The range + category of rng. +
    • diff --git a/doc/html/range/reference/adaptors/reference/replaced.html b/doc/html/range/reference/adaptors/reference/replaced.html index 61de327..3bcfff4 100644 --- a/doc/html/range/reference/adaptors/reference/replaced.html +++ b/doc/html/range/reference/adaptors/reference/replaced.html @@ -100,8 +100,13 @@ is the corresponding element in the original range.
  • -Range Category:ForwardRange +Range Category:Forward + Range
    • +
  • +Returned Range Category: The range + category of rng. +
    • diff --git a/doc/html/range/reference/adaptors/reference/replaced_if.html b/doc/html/range/reference/adaptors/reference/replaced_if.html index b64a538..dbd181e 100644 --- a/doc/html/range/reference/adaptors/reference/replaced_if.html +++ b/doc/html/range/reference/adaptors/reference/replaced_if.html @@ -100,8 +100,13 @@ is the corresponding element in the original range.
  • -Range Category:ForwardRange +Range Category:Forward + Range
    • +
  • +Returned Range Category: The range + category of rng. +
    • diff --git a/doc/html/range/reference/adaptors/reference/reversed.html b/doc/html/range/reference/adaptors/reference/reversed.html index 3a9c619..f8d2f26 100644 --- a/doc/html/range/reference/adaptors/reference/reversed.html +++ b/doc/html/range/reference/adaptors/reference/reversed.html @@ -79,8 +79,13 @@ as if they were the original iterators wrapped in reverse_iterator.
  • -Range Category:BidirectionalRange +Range Category:Bidirectional + Range
    • +
  • +Returned Range Category: The range + category of rng. +
    • diff --git a/doc/html/range/reference/adaptors/reference/sliced.html b/doc/html/range/reference/adaptors/reference/sliced.html index e4a1298..757aaaf 100644 --- a/doc/html/range/reference/adaptors/reference/sliced.html +++ b/doc/html/range/reference/adaptors/reference/sliced.html @@ -89,7 +89,12 @@ Returns:make_range(rng, n, m)
  • -Range Category:RandomAccessRange +Range Category:Random + Access Range +
    • +
  • +Returned Range Category:Random + Access Range
    • diff --git a/doc/html/range/reference/adaptors/reference/strided.html b/doc/html/range/reference/adaptors/reference/strided.html index 793123c..b641325 100644 --- a/doc/html/range/reference/adaptors/reference/strided.html +++ b/doc/html/range/reference/adaptors/reference/strided.html @@ -86,7 +86,12 @@ in steps of n.
  • -Range Category:RandomAccessRange +Range Category:Random + Access Range +
    • +
  • +Returned Range Category:Random + Access Range
    • diff --git a/doc/html/range/reference/adaptors/reference/tokenized.html b/doc/html/range/reference/adaptors/reference/tokenized.html index a83f316..32f57e6 100644 --- a/doc/html/range/reference/adaptors/reference/tokenized.html +++ b/doc/html/range/reference/adaptors/reference/tokenized.html @@ -122,7 +122,12 @@ might throw.
  • -Range Category:RandomAccessRange +Range Category:Random + Access Range +
    • +
  • +Returned Range Category:Random + Access Range
    • diff --git a/doc/html/range/reference/adaptors/reference/transformed.html b/doc/html/range/reference/adaptors/reference/transformed.html index 7cad586..43b8758 100644 --- a/doc/html/range/reference/adaptors/reference/transformed.html +++ b/doc/html/range/reference/adaptors/reference/transformed.html @@ -90,8 +90,13 @@ of fun might throw.
  • -Range Category:SinglePassRange +Range Category:Single + Pass Range
    • +
  • +Returned Range Category: The range + category of rng. +
    • diff --git a/doc/html/range/reference/adaptors/reference/uniqued.html b/doc/html/range/reference/adaptors/reference/uniqued.html index 6cd67eb..65fdc6e 100644 --- a/doc/html/range/reference/adaptors/reference/uniqued.html +++ b/doc/html/range/reference/adaptors/reference/uniqued.html @@ -83,8 +83,14 @@ [x,y] in the returned range, x==y is false.
  • -Range Category:ForwardRange +Range Category:Forward + Range
    • +
  • +Returned Range Category: The minimum + of the range concept of rng + and Forward Range. +
    • diff --git a/doc/html/range/reference/algorithms/heap/make_heap.html b/doc/html/range/reference/algorithms/heap/make_heap.html index b3981c1..a847fc7 100644 --- a/doc/html/range/reference/algorithms/heap/make_heap.html +++ b/doc/html/range/reference/algorithms/heap/make_heap.html @@ -27,7 +27,7 @@ make_heap
    - + 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

    @@ -118,7 +118,7 @@

    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/heap/pop_heap.html b/doc/html/range/reference/algorithms/heap/pop_heap.html index 66cd771..6cf064d 100644 --- a/doc/html/range/reference/algorithms/heap/pop_heap.html +++ b/doc/html/range/reference/algorithms/heap/pop_heap.html @@ -27,7 +27,7 @@ pop_heap

    - + 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

    @@ -120,7 +120,7 @@

    - + Precondition:
      @@ -130,7 +130,7 @@
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/heap/push_heap.html b/doc/html/range/reference/algorithms/heap/push_heap.html index 83f9113..f4497b6 100644 --- a/doc/html/range/reference/algorithms/heap/push_heap.html +++ b/doc/html/range/reference/algorithms/heap/push_heap.html @@ -27,7 +27,7 @@ push_heap

    - + 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

    @@ -120,7 +120,7 @@

    - + Precondition:
      @@ -130,7 +130,7 @@
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/heap/sort_heap.html b/doc/html/range/reference/algorithms/heap/sort_heap.html index 15f018c..c5bb9b3 100644 --- a/doc/html/range/reference/algorithms/heap/sort_heap.html +++ b/doc/html/range/reference/algorithms/heap/sort_heap.html @@ -27,7 +27,7 @@ sort_heap

    - + 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

    @@ -119,14 +119,14 @@

    - + Precondition:

    rng is a heap.

    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/mutating/copy.html b/doc/html/range/reference/algorithms/mutating/copy.html index fd94fc3..854c4ac 100644 --- a/doc/html/range/reference/algorithms/mutating/copy.html +++ b/doc/html/range/reference/algorithms/mutating/copy.html @@ -27,7 +27,7 @@ copy

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
    - + Precondition:
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/mutating/copy_backward.html b/doc/html/range/reference/algorithms/mutating/copy_backward.html index 1c38629..c1d1266 100644 --- a/doc/html/range/reference/algorithms/mutating/copy_backward.html +++ b/doc/html/range/reference/algorithms/mutating/copy_backward.html @@ -28,7 +28,7 @@ copy_backward

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
    - + Precondition:
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/mutating/fill.html b/doc/html/range/reference/algorithms/mutating/fill.html index d9b98a8..5f5da38 100644 --- a/doc/html/range/reference/algorithms/mutating/fill.html +++ b/doc/html/range/reference/algorithms/mutating/fill.html @@ -27,7 +27,7 @@ fill

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/mutating/fill_n.html b/doc/html/range/reference/algorithms/mutating/fill_n.html index 95240f7..5d09a06 100644 --- a/doc/html/range/reference/algorithms/mutating/fill_n.html +++ b/doc/html/range/reference/algorithms/mutating/fill_n.html @@ -27,7 +27,7 @@ fill_n

    - + Prototype

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

    - + Description

    @@ -47,14 +47,14 @@ 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
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/mutating/generate.html b/doc/html/range/reference/algorithms/mutating/generate.html index 9d099d8..7bdf2ff 100644 --- a/doc/html/range/reference/algorithms/mutating/generate.html +++ b/doc/html/range/reference/algorithms/mutating/generate.html @@ -27,7 +27,7 @@ generate

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
    - + Precondition:
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/mutating/inplace_merge.html b/doc/html/range/reference/algorithms/mutating/inplace_merge.html index cebedbf..8d4d6c5 100644 --- a/doc/html/range/reference/algorithms/mutating/inplace_merge.html +++ b/doc/html/range/reference/algorithms/mutating/inplace_merge.html @@ -28,7 +28,7 @@ inplace_merge

    - + 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

    @@ -116,11 +116,11 @@ argument types.

    - + Precondition:
    - + For the non-predicate version:
    @@ -143,7 +143,7 @@
    - + For the predicate version:
    @@ -164,7 +164,7 @@
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/mutating/merge.html b/doc/html/range/reference/algorithms/mutating/merge.html index 6637a05..d66fc41 100644 --- a/doc/html/range/reference/algorithms/mutating/merge.html +++ b/doc/html/range/reference/algorithms/mutating/merge.html @@ -27,7 +27,7 @@ merge

    - + 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

    @@ -150,11 +150,11 @@

    - + Precondition:
    - + For the non-predicate version:
    @@ -189,7 +189,7 @@
    - + For the predicate version:
    @@ -220,7 +220,7 @@
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/mutating/nth_element.html b/doc/html/range/reference/algorithms/mutating/nth_element.html index 52596c7..cd13253 100644 --- a/doc/html/range/reference/algorithms/mutating/nth_element.html +++ b/doc/html/range/reference/algorithms/mutating/nth_element.html @@ -28,7 +28,7 @@ nth_element

    - + 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

    @@ -128,7 +128,7 @@

    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/mutating/partial_sort.html b/doc/html/range/reference/algorithms/mutating/partial_sort.html index f7fabfd..7938cd3 100644 --- a/doc/html/range/reference/algorithms/mutating/partial_sort.html +++ b/doc/html/range/reference/algorithms/mutating/partial_sort.html @@ -28,7 +28,7 @@ partial_sort

    - + 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

    @@ -133,7 +133,7 @@

    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/mutating/partition.html b/doc/html/range/reference/algorithms/mutating/partition.html index d74da64..79bd88c 100644 --- a/doc/html/range/reference/algorithms/mutating/partition.html +++ b/doc/html/range/reference/algorithms/mutating/partition.html @@ -27,7 +27,7 @@ partition

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/mutating/random_shuffle.html b/doc/html/range/reference/algorithms/mutating/random_shuffle.html index 1c64f84..d94fc5a 100644 --- a/doc/html/range/reference/algorithms/mutating/random_shuffle.html +++ b/doc/html/range/reference/algorithms/mutating/random_shuffle.html @@ -28,7 +28,7 @@ random_shuffle

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements

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

    - + Precondition:
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/mutating/remove.html b/doc/html/range/reference/algorithms/mutating/remove.html index 310e46b..de178ea 100644 --- a/doc/html/range/reference/algorithms/mutating/remove.html +++ b/doc/html/range/reference/algorithms/mutating/remove.html @@ -27,7 +27,7 @@ remove

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/mutating/remove_copy.html b/doc/html/range/reference/algorithms/mutating/remove_copy.html index 5855105..b775716 100644 --- a/doc/html/range/reference/algorithms/mutating/remove_copy.html +++ b/doc/html/range/reference/algorithms/mutating/remove_copy.html @@ -28,7 +28,7 @@ remove_copy

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
    - + Complexity

    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 7d827dd..3f25b68 100644 --- a/doc/html/range/reference/algorithms/mutating/remove_copy_if.html +++ b/doc/html/range/reference/algorithms/mutating/remove_copy_if.html @@ -28,7 +28,7 @@ remove_copy_if

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/mutating/remove_if.html b/doc/html/range/reference/algorithms/mutating/remove_if.html index 54c3146..95a933c 100644 --- a/doc/html/range/reference/algorithms/mutating/remove_if.html +++ b/doc/html/range/reference/algorithms/mutating/remove_if.html @@ -27,7 +27,7 @@ remove_if

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/mutating/replace.html b/doc/html/range/reference/algorithms/mutating/replace.html index 5a3a2eb..abbffc3 100644 --- a/doc/html/range/reference/algorithms/mutating/replace.html +++ b/doc/html/range/reference/algorithms/mutating/replace.html @@ -27,7 +27,7 @@ replace

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/mutating/replace_copy.html b/doc/html/range/reference/algorithms/mutating/replace_copy.html index 113c82e..a5678bd 100644 --- a/doc/html/range/reference/algorithms/mutating/replace_copy.html +++ b/doc/html/range/reference/algorithms/mutating/replace_copy.html @@ -28,7 +28,7 @@ replace_copy

    - + Prototype

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

    - + Description

    @@ -54,14 +54,14 @@ x.

    - + Definition

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

    - + Requirements
    - + Complexity

    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 34505fd..17607de 100644 --- a/doc/html/range/reference/algorithms/mutating/replace_copy_if.html +++ b/doc/html/range/reference/algorithms/mutating/replace_copy_if.html @@ -28,7 +28,7 @@ replace_copy_if

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/mutating/replace_if.html b/doc/html/range/reference/algorithms/mutating/replace_if.html index d5c0a79..110c753 100644 --- a/doc/html/range/reference/algorithms/mutating/replace_if.html +++ b/doc/html/range/reference/algorithms/mutating/replace_if.html @@ -28,7 +28,7 @@ replace_if

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/mutating/reverse.html b/doc/html/range/reference/algorithms/mutating/reverse.html index c0a5649..0ae4ef5 100644 --- a/doc/html/range/reference/algorithms/mutating/reverse.html +++ b/doc/html/range/reference/algorithms/mutating/reverse.html @@ -27,7 +27,7 @@ reverse

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/mutating/reverse_copy.html b/doc/html/range/reference/algorithms/mutating/reverse_copy.html index 34475c0..34a4b9a 100644 --- a/doc/html/range/reference/algorithms/mutating/reverse_copy.html +++ b/doc/html/range/reference/algorithms/mutating/reverse_copy.html @@ -28,7 +28,7 @@ reverse_copy

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/mutating/rotate.html b/doc/html/range/reference/algorithms/mutating/rotate.html index b40be4a..b0dc3e4 100644 --- a/doc/html/range/reference/algorithms/mutating/rotate.html +++ b/doc/html/range/reference/algorithms/mutating/rotate.html @@ -27,7 +27,7 @@ rotate

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
    - + Precondition:
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/mutating/rotate_copy.html b/doc/html/range/reference/algorithms/mutating/rotate_copy.html index 1f1a782..293f540 100644 --- a/doc/html/range/reference/algorithms/mutating/rotate_copy.html +++ b/doc/html/range/reference/algorithms/mutating/rotate_copy.html @@ -28,7 +28,7 @@ rotate_copy

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
    - + Precondition:
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/mutating/sort.html b/doc/html/range/reference/algorithms/mutating/sort.html index 08f6f50..ffa09ad 100644 --- a/doc/html/range/reference/algorithms/mutating/sort.html +++ b/doc/html/range/reference/algorithms/mutating/sort.html @@ -27,7 +27,7 @@ sort

    - + 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

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

    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/mutating/stable_partition.html b/doc/html/range/reference/algorithms/mutating/stable_partition.html index b88e26c..c12efc0 100644 --- a/doc/html/range/reference/algorithms/mutating/stable_partition.html +++ b/doc/html/range/reference/algorithms/mutating/stable_partition.html @@ -28,7 +28,7 @@ stable_partition

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/mutating/stable_sort.html b/doc/html/range/reference/algorithms/mutating/stable_sort.html index 137605b..7f4e1a5 100644 --- a/doc/html/range/reference/algorithms/mutating/stable_sort.html +++ b/doc/html/range/reference/algorithms/mutating/stable_sort.html @@ -28,7 +28,7 @@ stable_sort

    - + 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

    @@ -130,7 +130,7 @@

    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/mutating/swap_ranges.html b/doc/html/range/reference/algorithms/mutating/swap_ranges.html index 78bf64d..a9fc9fa 100644 --- a/doc/html/range/reference/algorithms/mutating/swap_ranges.html +++ b/doc/html/range/reference/algorithms/mutating/swap_ranges.html @@ -28,7 +28,7 @@ swap_ranges

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/mutating/transform.html b/doc/html/range/reference/algorithms/mutating/transform.html index be08af4..9247576 100644 --- a/doc/html/range/reference/algorithms/mutating/transform.html +++ b/doc/html/range/reference/algorithms/mutating/transform.html @@ -27,7 +27,7 @@ transform

    - + 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

    @@ -169,7 +169,7 @@

    - + Precondition:

    @@ -201,7 +201,7 @@

    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/mutating/unique.html b/doc/html/range/reference/algorithms/mutating/unique.html index 2ea15fd..961a44f 100644 --- a/doc/html/range/reference/algorithms/mutating/unique.html +++ b/doc/html/range/reference/algorithms/mutating/unique.html @@ -27,7 +27,7 @@ unique

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements

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

    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/mutating/unique_copy.html b/doc/html/range/reference/algorithms/mutating/unique_copy.html index 209ac02..e0de9fc 100644 --- a/doc/html/range/reference/algorithms/mutating/unique_copy.html +++ b/doc/html/range/reference/algorithms/mutating/unique_copy.html @@ -28,7 +28,7 @@ unique_copy

    - + 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

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

    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/new/copy_n.html b/doc/html/range/reference/algorithms/new/copy_n.html index ffe4dfe..b84b29e 100644 --- a/doc/html/range/reference/algorithms/new/copy_n.html +++ b/doc/html/range/reference/algorithms/new/copy_n.html @@ -27,7 +27,7 @@ copy_n

    - + Prototype

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

    - + Description

    @@ -53,14 +53,14 @@ 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
      @@ -79,7 +79,7 @@
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/new/erase.html b/doc/html/range/reference/algorithms/new/erase.html index c6aa933..47a5197 100644 --- a/doc/html/range/reference/algorithms/new/erase.html +++ b/doc/html/range/reference/algorithms/new/erase.html @@ -27,7 +27,7 @@ erase

    - + Prototype

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

    - + Description

    @@ -58,14 +58,14 @@ 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. @@ -73,7 +73,7 @@ erase of an iterator range.
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/new/for_each.html b/doc/html/range/reference/algorithms/new/for_each.html index 41fe5ab..c9c5db1 100644 --- a/doc/html/range/reference/algorithms/new/for_each.html +++ b/doc/html/range/reference/algorithms/new/for_each.html @@ -27,7 +27,7 @@ for_each

    - + Prototype

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

    - + Description

    @@ -88,14 +88,14 @@ 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
      @@ -125,7 +125,7 @@
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/new/insert.html b/doc/html/range/reference/algorithms/new/insert.html index 0ed5479..013ca65 100644 --- a/doc/html/range/reference/algorithms/new/insert.html +++ b/doc/html/range/reference/algorithms/new/insert.html @@ -27,7 +27,7 @@ insert

    - + Prototype

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

    - + Description

    @@ -54,14 +54,14 @@ target.

    - + Definition

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

    - + Requirements
      @@ -81,7 +81,7 @@
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/new/iota.html b/doc/html/range/reference/algorithms/new/iota.html index e346957..00613b2 100644 --- a/doc/html/range/reference/algorithms/new/iota.html +++ b/doc/html/range/reference/algorithms/new/iota.html @@ -27,7 +27,7 @@ iota

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
      @@ -72,7 +72,7 @@
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/new/is_sorted.html b/doc/html/range/reference/algorithms/new/is_sorted.html index 18f5846..167665d 100644 --- a/doc/html/range/reference/algorithms/new/is_sorted.html +++ b/doc/html/range/reference/algorithms/new/is_sorted.html @@ -27,7 +27,7 @@ is_sorted

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
      @@ -85,7 +85,7 @@
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/new/overwrite.html b/doc/html/range/reference/algorithms/new/overwrite.html index 6d90fcf..3ef0cfb 100644 --- a/doc/html/range/reference/algorithms/new/overwrite.html +++ b/doc/html/range/reference/algorithms/new/overwrite.html @@ -27,7 +27,7 @@ overwrite

    - + Prototype

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

    - + Description

    @@ -52,14 +52,14 @@ into the range to.

    - + Definition

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

    - + Requirements
      @@ -86,7 +86,7 @@
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/new/push_back.html b/doc/html/range/reference/algorithms/new/push_back.html index 6b67c08..b5a0ff1 100644 --- a/doc/html/range/reference/algorithms/new/push_back.html +++ b/doc/html/range/reference/algorithms/new/push_back.html @@ -27,7 +27,7 @@ push_back

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
      @@ -79,7 +79,7 @@
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/new/push_front.html b/doc/html/range/reference/algorithms/new/push_front.html index 7413640..a8b3381 100644 --- a/doc/html/range/reference/algorithms/new/push_front.html +++ b/doc/html/range/reference/algorithms/new/push_front.html @@ -27,7 +27,7 @@ push_front

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
      @@ -79,7 +79,7 @@
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/new/remove_erase.html b/doc/html/range/reference/algorithms/new/remove_erase.html index 0dc0e23..6dd59be 100644 --- a/doc/html/range/reference/algorithms/new/remove_erase.html +++ b/doc/html/range/reference/algorithms/new/remove_erase.html @@ -27,7 +27,7 @@ remove_erase

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
    1. @@ -65,7 +65,7 @@ erase of an iterator range.
    - + Complexity

    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 4c42049..ab20e8f 100644 --- a/doc/html/range/reference/algorithms/new/remove_erase_if.html +++ b/doc/html/range/reference/algorithms/new/remove_erase_if.html @@ -28,7 +28,7 @@ remove_erase_if

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
      @@ -73,7 +73,7 @@
    - + Complexity

    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 9bc5d43..4bece6d 100644 --- a/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html +++ b/doc/html/range/reference/algorithms/non_mutating/adjacent_find.html @@ -28,7 +28,7 @@ adjacent_find

    - + 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

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

    - + Complexity

    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 01bdb29..fcbbbbb 100644 --- a/doc/html/range/reference/algorithms/non_mutating/binary_search.html +++ b/doc/html/range/reference/algorithms/non_mutating/binary_search.html @@ -28,7 +28,7 @@ binary_search

    - + 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

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

    - + Precondition:

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

    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/non_mutating/count.html b/doc/html/range/reference/algorithms/non_mutating/count.html index c84ad1c..e1b7195 100644 --- a/doc/html/range/reference/algorithms/non_mutating/count.html +++ b/doc/html/range/reference/algorithms/non_mutating/count.html @@ -27,7 +27,7 @@ count

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
    - + Complexity

    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 825af0a..53b05ad 100644 --- a/doc/html/range/reference/algorithms/non_mutating/count_if.html +++ b/doc/html/range/reference/algorithms/non_mutating/count_if.html @@ -28,7 +28,7 @@ count_if

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/non_mutating/equal.html b/doc/html/range/reference/algorithms/non_mutating/equal.html index 371bf4b..6f0e022 100644 --- a/doc/html/range/reference/algorithms/non_mutating/equal.html +++ b/doc/html/range/reference/algorithms/non_mutating/equal.html @@ -27,7 +27,7 @@ equal

    - + 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

    @@ -138,7 +138,7 @@

    - + Complexity

    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 5b5d7b8..7aa0fc1 100644 --- a/doc/html/range/reference/algorithms/non_mutating/equal_range.html +++ b/doc/html/range/reference/algorithms/non_mutating/equal_range.html @@ -28,7 +28,7 @@ equal_range

    - + 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

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

    - + Precondition:

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

    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/non_mutating/find.html b/doc/html/range/reference/algorithms/non_mutating/find.html index 23ae0cc..485e44a 100644 --- a/doc/html/range/reference/algorithms/non_mutating/find.html +++ b/doc/html/range/reference/algorithms/non_mutating/find.html @@ -27,7 +27,7 @@ find

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
    - + Complexity

    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 a3c2e03..f11bb47 100644 --- a/doc/html/range/reference/algorithms/non_mutating/find_end.html +++ b/doc/html/range/reference/algorithms/non_mutating/find_end.html @@ -28,7 +28,7 @@ find_end

    - + 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

    @@ -148,7 +148,7 @@

    - + Complexity

    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 8879c90..972690f 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 @@ -28,7 +28,7 @@ find_first_of

    - + 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

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

    - + Complexity

    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 cac2242..59ab8d3 100644 --- a/doc/html/range/reference/algorithms/non_mutating/find_if.html +++ b/doc/html/range/reference/algorithms/non_mutating/find_if.html @@ -28,7 +28,7 @@ find_if

    - + Prototype

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

    - + Description

    @@ -64,14 +64,14 @@ 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
    - + Precondition:

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

    - + Complexity

    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 8e10027..7d8792f 100644 --- a/doc/html/range/reference/algorithms/non_mutating/for_each.html +++ b/doc/html/range/reference/algorithms/non_mutating/for_each.html @@ -28,7 +28,7 @@ for_each

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
    - + Complexity

    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 e1b9898..e3e37ef 100644 --- a/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html +++ b/doc/html/range/reference/algorithms/non_mutating/lexicographical_compare.html @@ -28,7 +28,7 @@ lexicographical_compare

    - + 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

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

    - + Complexity

    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 aec7685..f18a5bc 100644 --- a/doc/html/range/reference/algorithms/non_mutating/lower_bound.html +++ b/doc/html/range/reference/algorithms/non_mutating/lower_bound.html @@ -28,7 +28,7 @@ lower_bound

    - + 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

    @@ -130,7 +130,7 @@

    - + Precondition:

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

    - + Complexity

    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 83a3f13..9216f88 100644 --- a/doc/html/range/reference/algorithms/non_mutating/max_element.html +++ b/doc/html/range/reference/algorithms/non_mutating/max_element.html @@ -28,7 +28,7 @@ max_element

    - + 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

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

    - + Complexity

    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 f9df12d..4abd6a8 100644 --- a/doc/html/range/reference/algorithms/non_mutating/min_element.html +++ b/doc/html/range/reference/algorithms/non_mutating/min_element.html @@ -28,7 +28,7 @@ min_element

    - + 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

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

    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/non_mutating/mismatch.html b/doc/html/range/reference/algorithms/non_mutating/mismatch.html index ed7efa3..d740dce 100644 --- a/doc/html/range/reference/algorithms/non_mutating/mismatch.html +++ b/doc/html/range/reference/algorithms/non_mutating/mismatch.html @@ -28,7 +28,7 @@ mismatch

    - + 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

    @@ -186,14 +186,14 @@

    - + Precondition:

    distance(rng2) >= distance(rng1)

    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/non_mutating/search.html b/doc/html/range/reference/algorithms/non_mutating/search.html index 43f010f..9746802 100644 --- a/doc/html/range/reference/algorithms/non_mutating/search.html +++ b/doc/html/range/reference/algorithms/non_mutating/search.html @@ -28,7 +28,7 @@ search

    - + 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

    @@ -183,7 +183,7 @@

    - + Complexity

    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 0c84f36..2b94b7f 100644 --- a/doc/html/range/reference/algorithms/non_mutating/search_n.html +++ b/doc/html/range/reference/algorithms/non_mutating/search_n.html @@ -28,7 +28,7 @@ search_n

    - + 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

    @@ -125,7 +125,7 @@

    - + Complexity

    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 0405255..1bf73d6 100644 --- a/doc/html/range/reference/algorithms/non_mutating/upper_bound.html +++ b/doc/html/range/reference/algorithms/non_mutating/upper_bound.html @@ -28,7 +28,7 @@ upper_bound

    - + 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

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

    - + Precondition:

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

    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/numeric/accumulate.html b/doc/html/range/reference/algorithms/numeric/accumulate.html index b588227..4ba0962 100644 --- a/doc/html/range/reference/algorithms/numeric/accumulate.html +++ b/doc/html/range/reference/algorithms/numeric/accumulate.html @@ -27,7 +27,7 @@ accumulate

    - + Prototype

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

    - + Description

    @@ -63,18 +63,18 @@ 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
    @@ -99,7 +99,7 @@
    - + For the second version
    @@ -133,7 +133,7 @@
    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/numeric/adjacent_difference.html b/doc/html/range/reference/algorithms/numeric/adjacent_difference.html index 3f7c169..5dff5f8 100644 --- a/doc/html/range/reference/algorithms/numeric/adjacent_difference.html +++ b/doc/html/range/reference/algorithms/numeric/adjacent_difference.html @@ -28,7 +28,7 @@ adjacent_difference

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
    - + For the first version
    @@ -111,7 +111,7 @@
    - + For the second version
    @@ -146,7 +146,7 @@
    - + Precondition:

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

    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/numeric/inner_product.html b/doc/html/range/reference/algorithms/numeric/inner_product.html index 30046e1..7872880 100644 --- a/doc/html/range/reference/algorithms/numeric/inner_product.html +++ b/doc/html/range/reference/algorithms/numeric/inner_product.html @@ -28,7 +28,7 @@ inner_product

    - + Prototype

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

    - + Description

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

    - + Definition

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

    - + Requirements
    - + For the first version
    @@ -113,7 +113,7 @@
    - + For the second version
    @@ -162,14 +162,14 @@
    - + Precondition:

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

    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/numeric/partial_sum.html b/doc/html/range/reference/algorithms/numeric/partial_sum.html index e4f548c..cddd838 100644 --- a/doc/html/range/reference/algorithms/numeric/partial_sum.html +++ b/doc/html/range/reference/algorithms/numeric/partial_sum.html @@ -28,7 +28,7 @@ partial_sum

    - + Prototype

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

    - + Description

    @@ -58,18 +58,18 @@ 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
    @@ -99,7 +99,7 @@
    - + For the second version
    @@ -128,7 +128,7 @@
    - + Precondition:

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

    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/permutation/next_permutation.html b/doc/html/range/reference/algorithms/permutation/next_permutation.html index b9c73d4..3f23383 100644 --- a/doc/html/range/reference/algorithms/permutation/next_permutation.html +++ b/doc/html/range/reference/algorithms/permutation/next_permutation.html @@ -28,7 +28,7 @@ next_permutation

    - + 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

    @@ -125,7 +125,7 @@

    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/permutation/prev_permutation.html b/doc/html/range/reference/algorithms/permutation/prev_permutation.html index 3e74632..3cb4d46 100644 --- a/doc/html/range/reference/algorithms/permutation/prev_permutation.html +++ b/doc/html/range/reference/algorithms/permutation/prev_permutation.html @@ -28,7 +28,7 @@ prev_permutation

    - + 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

    @@ -125,7 +125,7 @@

    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/set/includes.html b/doc/html/range/reference/algorithms/set/includes.html index c268cc7..d03a126 100644 --- a/doc/html/range/reference/algorithms/set/includes.html +++ b/doc/html/range/reference/algorithms/set/includes.html @@ -27,7 +27,7 @@ includes

    - + 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

    @@ -144,7 +144,7 @@

    - + Precondition:

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

    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/set/set_difference.html b/doc/html/range/reference/algorithms/set/set_difference.html index d4e8698..3084d87 100644 --- a/doc/html/range/reference/algorithms/set/set_difference.html +++ b/doc/html/range/reference/algorithms/set/set_difference.html @@ -27,7 +27,7 @@ set_difference

    - + 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

    @@ -163,7 +163,7 @@

    - + Precondition:

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

    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/set/set_intersection.html b/doc/html/range/reference/algorithms/set/set_intersection.html index 1314edd..a817f35 100644 --- a/doc/html/range/reference/algorithms/set/set_intersection.html +++ b/doc/html/range/reference/algorithms/set/set_intersection.html @@ -28,7 +28,7 @@ set_intersection

    - + 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

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

    - + Precondition:

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

    - + Complexity

    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 ae951ce..659877c 100644 --- a/doc/html/range/reference/algorithms/set/set_symmetric_difference.html +++ b/doc/html/range/reference/algorithms/set/set_symmetric_difference.html @@ -28,7 +28,7 @@ set_symmetric_difference

    - + 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

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

    - + Precondition:

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

    - + Complexity

    diff --git a/doc/html/range/reference/algorithms/set/set_union.html b/doc/html/range/reference/algorithms/set/set_union.html index 1384bcd..ccc1783 100644 --- a/doc/html/range/reference/algorithms/set/set_union.html +++ b/doc/html/range/reference/algorithms/set/set_union.html @@ -27,7 +27,7 @@ set_union

    - + 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

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

    - + Precondition:

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

    - + Complexity

    diff --git a/doc/html/range/reference/concept_implementation.html b/doc/html/range/reference/concept_implementation.html new file mode 100644 index 0000000..0d150f3 --- /dev/null +++ b/doc/html/range/reference/concept_implementation.html @@ -0,0 +1,48 @@ + + + +Range concept implementation + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +

    +
    +PrevUpHomeNext +
    +
    +

    + Range concept + implementation +

    +
    +
    Synopsis
    +
    Semantics
    +
    +
    + + + +
    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) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/range/reference/concept_implementation/overview.html b/doc/html/range/reference/concept_implementation/overview.html new file mode 100644 index 0000000..d0c35e1 --- /dev/null +++ b/doc/html/range/reference/concept_implementation/overview.html @@ -0,0 +1,68 @@ + + + +Overview + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +

    +Overview +

    +

    + Three types of objects are currently supported by the library: +

    +
    +

    + Even though the behavior of the primary templates are exactly such that + standard containers will be supported by default, the requirements are + much lower than the standard container requirements. For example, the utility + class iterator_range implements the + minimal interface required + to make the class a Forward + Range. +

    +

    + Please also see Range concepts for + more details. +

    +
    + + + +
    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) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/range/reference/concept_implementation/semantics.html b/doc/html/range/reference/concept_implementation/semantics.html new file mode 100644 index 0000000..1493f51 --- /dev/null +++ b/doc/html/range/reference/concept_implementation/semantics.html @@ -0,0 +1,163 @@ + + + +Semantics + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +

    +Semantics +

    +
    +
    Metafunctions
    +
    Functions
    +
    +
    + + notation +
    +
    +++++ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    +

    + Type +

    +     		+

    + Object +

    +     		+

    + Describes +

    +
    +

    + X +

    +     		+

    + x +

    +     		+

    + any type +

    +
    +

    + T +

    +     		+

    + t +

    +     		+

    + denotes behavior of the primary templates +

    +
    +

    + P +

    +     		+

    + p +

    +     		+

    + denotes std::pair<iterator,iterator> +

    +
    +

    + A[sz] +

    +     		+

    + a +

    +     		+

    + denotes an array of type A + of size sz +

    +
    +

    + Char* +

    +     		+

    + s +

    +     		+

    + denotes either char* or wchar_t* +

    +
    +
    + + + +
    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) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/range/reference/concept_implementation/semantics/functions.html b/doc/html/range/reference/concept_implementation/semantics/functions.html new file mode 100644 index 0000000..0c0ef81 --- /dev/null +++ b/doc/html/range/reference/concept_implementation/semantics/functions.html @@ -0,0 +1,408 @@ + + + +Functions + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +Functions +
    +
    +++++ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    +

    + Expression +

    +     		+

    + Return type +

    +     		+

    + Returns +

    +     		+

    + Complexity +

    +
    +

    + begin(x) +

    +     		+

    + range_iterator<X>::type +

    +     		+

    + p.first if p + is of type std::pair<T> a + if a is an + array range_begin(x) if that expression would invoke + a function found by ADL t.begin() otherwise +

    +     		+

    + constant time +

    +
    +

    + end(x) +

    +     		+

    + range_iterator<X>::type +

    +     		+

    + p.second if p + is of type std::pair<T> a + + sz + if a is an + array of size sz + range_end(x) + if that expression would invoke a function found by ADL t.end() + otherwise +

    +     		+

    + constant time +

    +
    +

    + empty(x) +

    +     		+

    + bool +

    +     		+

    + boost::begin(x) + == boost::end(x) +

    +     		+

    + constant time +

    +
    +

    + distance(x) +

    +     		+

    + range_difference<X>::type +

    +     		+

    + std::distance(boost::begin(x),boost::end(x)) +

    +     		+

    + - +

    +
    +

    + size(x) +

    +     		+

    + range_difference<X>::type +

    +     		+

    + boost::end(x) + - boost::begin(x) +

    +     		+

    + constant time +

    +
    +

    + rbegin(x) +

    +     		+

    + range_reverse_iterator<X>::type +

    +     		+

    + range_reverse_iterator<X>::type(boost::end(x)) +

    +     		+

    + constant time +

    +
    +

    + rend(x) +

    +     		+

    + range_reverse_iterator<X>::type +

    +     		+

    + range_reverse_iterator<X>::type(boost::begin(x)) +

    +     		+

    + constant time +

    +
    +

    + const_begin(x) +

    +     		+

    + range_iterator<const + X>::type +

    +     		+

    + range_iterator<const + X>::type(boost::begin(x)) +

    +     		+

    + constant time +

    +
    +

    + const_end(x) +

    +     		+

    + range_iterator<const + X>::type +

    +     		+

    + range_iterator<const + X>::type(boost::end(x)) +

    +     		+

    + constant time +

    +
    +

    + const_rbegin(x) +

    +     		+

    + range_reverse_iterator<const + X>::type +

    +     		+

    + range_reverse_iterator<const + X>::type(boost::rbegin(x)) +

    +     		+

    + constant time +

    +
    +

    + const_rend(x) +

    +     		+

    + range_reverse_iterator<const + X>::type +

    +     		+

    + range_reverse_iterator<const + X>::type(boost::rend(x)) +

    +     		+

    + constant time +

    +
    +

    + as_literal(x) +

    +     		+

    + iterator_range<U> where U + is Char* + if x is a pointer + to a string and U + is range_iterator<X>::type + otherwise +

    +     		+

    + [s,s + + std::char_traits<X>::length(s)) if s + is a Char* + or an array of Char + [boost::begin(x),boost::end(x)) otherwise +

    +     		+

    + linear time for pointers to a string or arrays of Char, constant time otherwise +

    +
    +

    + as_array(x) +

    +     		+

    + iterator_range<X> +

    +     		+

    + [boost::begin(x),boost::end(x)) +

    +     		 
    +

    + The special const_-named + functions are useful when you want to document clearly that your code + is read-only. +

    +

    + as_literal() + can be used internally + in string algorithm libraries such that arrays of characters are handled + correctly. +

    +

    + as_array() + can be used with string algorithm libraries to make it clear that arrays + of characters are handled like an array and not like a string. +

    +

    + Notice that the above functions should always be called with qualification + (boost::) + to prevent unintended + Argument Dependent Lookup (ADL). +

    +
    + + + +
    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) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/range/reference/concept_implementation/semantics/metafunctions.html b/doc/html/range/reference/concept_implementation/semantics/metafunctions.html new file mode 100644 index 0000000..779a3b7 --- /dev/null +++ b/doc/html/range/reference/concept_implementation/semantics/metafunctions.html @@ -0,0 +1,236 @@ + + + +Metafunctions + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +
    +Metafunctions +
    +
    +++++ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    +

    + Expression +

    +     		+

    + Return type +

    +     		+

    + Complexity +

    +
    +

    + range_iterator<X>::type +

    +     		+

    + +

    +
    T::iterator
+P::first_type
+A*
+
    +

    +

    +     		+

    + compile time +

    +
    +

    + range_iterator<const + X>::type +

    +     		+

    + +

    +
    T::const_iterator
+P::first_type
+const A*
+
    +

    +

    +     		+

    + compile time +

    +
    +

    + range_value<X>::type +

    +     		+

    + boost::iterator_value<range_iterator<X>::type>::type +

    +     		+

    + compile time +

    +
    +

    + range_reference<X>::type +

    +     		+

    + boost::iterator_reference<range_iterator<X>::type>::type +

    +     		+

    + compile time +

    +
    +

    + range_pointer<X>::type +

    +     		+

    + boost::iterator_pointer<range_iterator<X>::type>::type +

    +     		+

    + compile time +

    +
    +

    + range_category<X>::type +

    +     		+

    + boost::iterator_category<range_iterator<X>::type>::type +

    +     		+

    + compile time +

    +
    +

    + range_difference<X>::type +

    +     		+

    + boost::iterator_category<range_iterator<X>::type>::type +

    +     		+

    + compile time +

    +
    +

    + range_reverse_iterator<X>::type +

    +     		+

    + boost::reverse_iterator<range_iterator<X>::type> +

    +     		+

    + compile time +

    +
    +

    + range_reverse_iterator<const + X>::type +

    +     		+

    + boost::reverse_iterator<range_iterator<const X>::type +

    +     		+

    + compile time +

    +
    +
    + + + +
    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) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/range/reference/concept_implementation/synopsis.html b/doc/html/range/reference/concept_implementation/synopsis.html new file mode 100644 index 0000000..9dffad1 --- /dev/null +++ b/doc/html/range/reference/concept_implementation/synopsis.html @@ -0,0 +1,185 @@ + + + +Synopsis + + + + + + + + + + + + + + + +
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    +
    +
    +PrevUpHomeNext +
    +
    +

    +Synopsis +

    +

    + +

    +
    namespace boost
+{
+    //
+    // Single Pass Range metafunctions
+    //
+
+    template< class T >
+    struct range_iterator;
+
+    template< class T >
+    struct range_value;
+
+    template< class T >
+    struct range_reference;
+    
+    template< class T >
+    struct range_pointer;
+    
+    template< class T >
+    struct range_category;
+
+    //
+    // Forward Range metafunctions
+    //
+
+    template< class T >
+    struct range_difference;
+
+    //
+    // Bidirectional Range metafunctions
+    //
+
+    template< class T >
+    struct range_reverse_iterator;
+
+    //
+    // Single Pass Range functions
+    //
+
+    template< class T >
+    typename range_iterator<T>::type
+    begin( T& r );
+
+    template< class T >
+    typename range_iterator<const T>::type
+    begin( const T& r );
+
+    template< class T >
+    typename range_iterator<T>::type
+    end( T& r );
+
+    template< class T >
+    typename range_iterator<const T>::type
+    end( const T& r );
+
+    template< class T >
+    bool
+    empty( const T& r );
+
+    //
+    // Forward Range functions
+    //
+
+    template< class T >
+    typename range_difference<T>::type
+    distance( const T& r );
+
+    //
+    // Bidirectional Range functions
+    //
+
+    template< class T >
+    typename range_reverse_iterator<T>::type
+    rbegin( T& r );
+
+    template< class T >
+    typename range_reverse_iterator<const T>::type
+    rbegin( const T& r );
+
+    template< class T >
+    typename range_reverse_iterator<T>::type
+    rend( T& r );
+
+    template< class T >
+    typename range_reverse_iterator<const T>::type
+    rend( const T& r );
+    
+    //
+    // Random Access Range functions
+    //
+    
+    template< class T >
+    typename range_difference<T>::type
+    size( const T& r );
+
+    //
+    // Special const Range functions
+    //
+
+    template< class T >
+    typename range_iterator<const T>::type 
+    const_begin( const T& r );
+
+    template< class T >
+    typename range_iterator<const T>::type 
+    const_end( const T& r );
+
+    template< class T >
+    typename range_reverse_iterator<const T>::type 
+    const_rbegin( const T& r );
+
+    template< class T >
+    typename range_reverse_iterator<const T>::type 
+    const_rend( const T& r );
+    
+    //
+    // String utilities
+    //
+    
+    template< class T >
+    iterator_range< ... see below ... >
+    as_literal( T& r );
+    
+    template< class T >
+    iterator_range< ... see below ... >
+    as_literal( const T& r );
+    
+    template< class T >
+    iterator_range< typename range_iterator<T>::type >
+    as_array( T& r );
+    
+    template< class T >
+    iterator_range< typename range_iterator<const T>::type >
+    as_array( const T& r );
+
+} // namespace 'boost' 
+
    +

    +

    +
    + + + +
    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) +

    +
    +
    +
    +PrevUpHomeNext +
    + + diff --git a/doc/html/range/reference/overview.html b/doc/html/range/reference/overview.html deleted file mode 100644 index fb1226b..0000000 --- a/doc/html/range/reference/overview.html +++ /dev/null @@ -1,68 +0,0 @@ - - - -Overview - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -
    -
    -PrevUpHomeNext -
    -
    -

    -Overview -

    -

    - Three types of objects are currently supported by the library: -

    -
    -

    - Even though the behavior of the primary templates are exactly such that standard - containers will be supported by default, the requirements are much lower - than the standard container requirements. For example, the utility class - iterator_range - implements the minimal interface - required to make the class a Forward - Range. -

    -

    - Please also see Range concepts for - more details. -

    -
    - - - -
    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) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/range/reference/ranges/counting_range.html b/doc/html/range/reference/ranges/counting_range.html index c7e564a..566a7f2 100644 --- a/doc/html/range/reference/ranges/counting_range.html +++ b/doc/html/range/reference/ranges/counting_range.html @@ -27,7 +27,7 @@ counting_range
    - + Prototype

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

    - + Description

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

    - + Definition

    Defined in header file boost/range/counting_range.hpp

    - + Requirements
    1. diff --git a/doc/html/range/reference/ranges/irange.html b/doc/html/range/reference/ranges/irange.html index 93df52c..358791b 100644 --- a/doc/html/range/reference/ranges/irange.html +++ b/doc/html/range/reference/ranges/irange.html @@ -27,24 +27,24 @@ irange
    - + Prototype 

    template<class Integer>
-integer_range< range_detail::integer_iterator<Integer> >
+iterator_range< range_detail::integer_iterator<Integer> >
 irange(Integer first, Integer  last);
 
 template<class Integer, class StepSize>
-integer_range< range_detail::integer_iterator_with_step<Integer, StepSize> >
+iterator_range< range_detail::integer_iterator_with_step<Integer, StepSize> >
 irange(Integer first, Integer last, StepSize step_size);

    - + Description

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

    - + Definition

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

    - + Requirements
      @@ -79,7 +79,7 @@
    - + Complexity

    diff --git a/doc/html/range/reference/ranges/istream_range.html b/doc/html/range/reference/ranges/istream_range.html index 5e8c62b..eda91a4 100644 --- a/doc/html/range/reference/ranges/istream_range.html +++ b/doc/html/range/reference/ranges/istream_range.html @@ -27,7 +27,7 @@ istream_range

    - + Prototype

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

    - + Description

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

    - + Definition

    diff --git a/doc/html/range/reference/semantics.html b/doc/html/range/reference/semantics.html deleted file mode 100644 index a547b72..0000000 --- a/doc/html/range/reference/semantics.html +++ /dev/null @@ -1,163 +0,0 @@ - - - -Semantics - - - - - - - - - - - - - - - -
    Boost C++ LibrariesHomeLibrariesPeopleFAQMore
    -

    -
    -PrevUpHomeNext -
    -
    -

    -Semantics -

    -
    -
    Metafunctions
    -
    Functions
    -
    -
    - - notation -
    -
    ----- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -

    - Type -

    -     		-

    - Object -

    -     		-

    - Describes -

    -
    -

    - X -

    -     		-

    - x -

    -     		-

    - any type -

    -
    -

    - T -

    -     		-

    - t -

    -     		-

    - denotes behavior of the primary templates -

    -
    -

    - P -

    -     		-

    - p -

    -     		-

    - denotes std::pair<iterator,iterator> -

    -
    -

    - A[sz] -

    -     		-

    - a -

    -     		-

    - denotes an array of type A - of size sz -

    -
    -

    - Char* -

    -     		-

    - s -

    -     		-

    - denotes either char* or wchar_t* -

    -
    -
    - - - -
    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) -

    -
    -
    -
    -PrevUpHomeNext -
    - - diff --git a/doc/html/range/reference/utilities/iterator_range.html b/doc/html/range/reference/utilities/iterator_range.html index 525d1c2..a0fc0c0 100644 --- a/doc/html/range/reference/utilities/iterator_range.html +++ b/doc/html/range/reference/utilities/iterator_range.html @@ -48,7 +48,7 @@ type.

    - + Synopsis

    @@ -188,7 +188,7 @@ iterators from the same container.

    - + Details member functions
    @@ -220,7 +220,7 @@

    - + Details functions
    diff --git a/doc/html/range/reference/utilities/join.html b/doc/html/range/reference/utilities/join.html index 88e4ab9..349f282 100644 --- a/doc/html/range/reference/utilities/join.html +++ b/doc/html/range/reference/utilities/join.html @@ -39,7 +39,7 @@ check if the end of a range has been reached internally during traversal.

    - + Synposis

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

    - + Example

    diff --git a/doc/html/range/reference/utilities/sub_range.html b/doc/html/range/reference/utilities/sub_range.html index 2fbf85a..8c75a91 100644 --- a/doc/html/range/reference/utilities/sub_range.html +++ b/doc/html/range/reference/utilities/sub_range.html @@ -35,7 +35,7 @@ is.

    - + Synopsis

    diff --git a/doc/html/range/upgrade/upgrade_from_1_34.html b/doc/html/range/upgrade/upgrade_from_1_34.html index dfc4c52..1275e9c 100644 --- a/doc/html/range/upgrade/upgrade_from_1_34.html +++ b/doc/html/range/upgrade/upgrade_from_1_34.html @@ -33,12 +33,11 @@

    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(). + 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(). +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 diff --git a/doc/reference.qbk b/doc/reference.qbk index 25500d0..76e210e 100644 --- a/doc/reference.qbk +++ b/doc/reference.qbk @@ -1,8 +1,12 @@ [section:reference Reference] [include reference/overview.qbk] + +[section:concept_implementation Range concept implementation] [include reference/synopsis.qbk] [include reference/semantics.qbk] +[endsect] + [include reference/adaptors.qbk] [include reference/algorithms.qbk] [include reference/ranges.qbk] diff --git a/doc/reference/adaptors.qbk b/doc/reference/adaptors.qbk index 22df03c..1b3fd9f 100644 --- a/doc/reference/adaptors.qbk +++ b/doc/reference/adaptors.qbk @@ -121,30 +121,6 @@ In other words: [endsect] -[section:adaptors_synopsis Synopsis] - -The library provides the following Adapter Generator expressions: - -`` -rng | boost::adaptors::adjacent_filtered(bi_pred) -rng | boost::adaptors::copied(n,m) -rng | boost::adaptors::filtered(pred) -rng | boost::adaptors::indexed -rng | boost::adaptors::indirected -rng | boost::adaptors::map_keys -rng | boost::adaptors::map_values -rng | boost::adaptors::replaced(new_value, old_value) -rng | boost::adaptors::replaced_if(pred, new_value) -rng | boost::adaptors::reversed -rng | boost::adaptors::sliced(n, m) -rng | boost::adaptors::strided(n) -rng | boost::adaptors::tokenized( ) -rng | boost::adaptors::transformed(fun) -rng | boost::adaptors::uniqued -`` - -[endsect] - [section:general_requirements General Requirements] In the description of generator expressions, the following notation is used: diff --git a/doc/reference/adaptors/adjacent_filtered.qbk b/doc/reference/adaptors/adjacent_filtered.qbk index 933536d..1502d3b 100644 --- a/doc/reference/adaptors/adjacent_filtered.qbk +++ b/doc/reference/adaptors/adjacent_filtered.qbk @@ -9,7 +9,8 @@ * [*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`. * [*Throws:] Whatever the copy constructor of `bi_pred` might throw. -* [*Range Category:] `SinglePassRange` +* [*Range Category:] __single_pass_range__ +* [*Returned Range Category:] The minimum of the range category of `rng` and __forward_range__ [section:adjacent_filtered_example adjacent_filtered example] `` diff --git a/doc/reference/adaptors/copied.qbk b/doc/reference/adaptors/copied.qbk index 263286c..dbdeb4b 100644 --- a/doc/reference/adaptors/copied.qbk +++ b/doc/reference/adaptors/copied.qbk @@ -8,7 +8,8 @@ * [*Precondition:] `0 <= n && n <= m && m < distance(rng)` * [*Returns:] A new `iterator_range` that holds the sliced range `[n,m)` of the original range. -* [*Range Category:] `RandomAccessRange` +* [*Range Category:] __random_access_range__ +* [*Returned Range Category:] __random_access_range__ [section:copied_example copied example] `` diff --git a/doc/reference/adaptors/filtered.qbk b/doc/reference/adaptors/filtered.qbk index 2a6dc33..02c826f 100644 --- a/doc/reference/adaptors/filtered.qbk +++ b/doc/reference/adaptors/filtered.qbk @@ -9,8 +9,8 @@ * [*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`. * [*Throws:] Whatever the copy constructor of `pred` might throw. -* [*Range Category:] `ForwardRange` -* [*Returned Range Category:] `ForwardRange` +* [*Range Category:] __forward_range__ +* [*Returned Range Category:] The minimum of the range category of `rng` and __bidirectional_range__ [section:filtered_example filtered example] `` diff --git a/doc/reference/adaptors/indexed.qbk b/doc/reference/adaptors/indexed.qbk index 36dfd88..f6eb23e 100644 --- a/doc/reference/adaptors/indexed.qbk +++ b/doc/reference/adaptors/indexed.qbk @@ -7,7 +7,8 @@ ] * [*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:] `SinglePassRange` +* [*Range Category:] __single_pass_range__ +* [*Returned Range Category:] The range category of `rng` [section:indexed_example indexed example] `` diff --git a/doc/reference/adaptors/indirected.qbk b/doc/reference/adaptors/indirected.qbk index f0cbd7a..44182fb 100644 --- a/doc/reference/adaptors/indirected.qbk +++ b/doc/reference/adaptors/indirected.qbk @@ -8,7 +8,8 @@ * [*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. -* [*Range Category:] `SinglePassRange` +* [*Range Category:] __single_pass_range__ +* [*Returned Range Category:] The range category of `rng` [section:indirected_example indirected example] `` diff --git a/doc/reference/adaptors/map_keys.qbk b/doc/reference/adaptors/map_keys.qbk index 7b29013..831d88f 100644 --- a/doc/reference/adaptors/map_keys.qbk +++ b/doc/reference/adaptors/map_keys.qbk @@ -8,7 +8,8 @@ * [*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. -* [*Range Category:] `SinglePassRange` +* [*Range Category:] __single_pass_range__ +* [*Returned Range Category:] The range category of `rng`. [section:map_keys_example map_keys example] `` diff --git a/doc/reference/adaptors/map_values.qbk b/doc/reference/adaptors/map_values.qbk index 28f75c8..a89b0e3 100644 --- a/doc/reference/adaptors/map_values.qbk +++ b/doc/reference/adaptors/map_values.qbk @@ -8,7 +8,8 @@ * [*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. -* [*Range Category:] `SinglePassRange` +* [*Range Category:] __single_pass_range__ +* [*Returned Range Category:] The range category of `rng`. [section:map_values_example map_values example] `` diff --git a/doc/reference/adaptors/replaced.qbk b/doc/reference/adaptors/replaced.qbk index 92a673b..3fe1cb8 100644 --- a/doc/reference/adaptors/replaced.qbk +++ b/doc/reference/adaptors/replaced.qbk @@ -10,7 +10,8 @@ * `new_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. -* [*Range Category:] `ForwardRange` +* [*Range Category:] __forward_range__ +* [*Returned Range Category:] The range category of `rng`. [section:replaced_example replaced example] `` diff --git a/doc/reference/adaptors/replaced_if.qbk b/doc/reference/adaptors/replaced_if.qbk index b7b7e57..0a67aae 100644 --- a/doc/reference/adaptors/replaced_if.qbk +++ b/doc/reference/adaptors/replaced_if.qbk @@ -10,7 +10,8 @@ * The range `value_type` is convertible to the argument type of `pred`. * `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. -* [*Range Category:] `ForwardRange` +* [*Range Category:] __forward_range__ +* [*Returned Range Category:] The range category of `rng`. [section:replaced_if_example replaced_if example] `` diff --git a/doc/reference/adaptors/reversed.qbk b/doc/reference/adaptors/reversed.qbk index 4ad623b..56cf141 100644 --- a/doc/reference/adaptors/reversed.qbk +++ b/doc/reference/adaptors/reversed.qbk @@ -7,7 +7,8 @@ ] * [*Returns:] A range whose iterators behave as if they were the original iterators wrapped in `reverse_iterator`. -* [*Range Category:] `BidirectionalRange` +* [*Range Category:] __bidirectional_range__ +* [*Returned Range Category:] The range category of `rng`. [section:reversed_example reversed example] `` diff --git a/doc/reference/adaptors/sliced.qbk b/doc/reference/adaptors/sliced.qbk index e424ddc..275e4a8 100644 --- a/doc/reference/adaptors/sliced.qbk +++ b/doc/reference/adaptors/sliced.qbk @@ -8,7 +8,8 @@ * [*Precondition:] `0 <= n && n <= m && m < distance(rng)` * [*Returns:] `make_range(rng, n, m)` -* [*Range Category:] `RandomAccessRange` +* [*Range Category:] __random_access_range__ +* [*Returned Range Category:] __random_access_range__ [section:sliced_example sliced example] `` diff --git a/doc/reference/adaptors/strided.qbk b/doc/reference/adaptors/strided.qbk index cf2f09f..5b7ddf2 100644 --- a/doc/reference/adaptors/strided.qbk +++ b/doc/reference/adaptors/strided.qbk @@ -8,7 +8,8 @@ * [*Precondition:] `0 <= n && n < distance(rng)` * [*Returns:] A new range based on `rng` where traversal is performed in steps of `n`. -* [*Range Category:] `RandomAccessRange` +* [*Range Category:] __random_access_range__ +* [*Returned Range Category:] __random_access_range__ [section:strided_example strided example] `` diff --git a/doc/reference/adaptors/tokenized.qbk b/doc/reference/adaptors/tokenized.qbk index 7b7504c..2b3a656 100644 --- a/doc/reference/adaptors/tokenized.qbk +++ b/doc/reference/adaptors/tokenized.qbk @@ -35,7 +35,8 @@ * `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. * [*Throws:] Whatever constructing and copying equivalent `regex_token_iterator`s might throw. -* [*Range Category:] `RandomAccessRange` +* [*Range Category:] __random_access_range__ +* [*Returned Range Category:] __random_access_range__ [endsect] diff --git a/doc/reference/adaptors/transformed.qbk b/doc/reference/adaptors/transformed.qbk index 3b64768..f5bacf9 100644 --- a/doc/reference/adaptors/transformed.qbk +++ b/doc/reference/adaptors/transformed.qbk @@ -9,7 +9,8 @@ * [*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. * [*Throws:] Whatever the copy-constructor of `fun` might throw. -* [*Range Category:] `SinglePassRange` +* [*Range Category:] __single_pass_range__ +* [*Returned Range Category:] The range category of `rng`. [section:transformed_example transformed example] `` diff --git a/doc/reference/adaptors/uniqued.qbk b/doc/reference/adaptors/uniqued.qbk index a90cdde..b7565a0 100644 --- a/doc/reference/adaptors/uniqued.qbk +++ b/doc/reference/adaptors/uniqued.qbk @@ -8,7 +8,8 @@ * [*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. -* [*Range Category:] `ForwardRange` +* [*Range Category:] __forward_range__ +* [*Returned Range Category:] The minimum of the range concept of `rng` and __forward_range__. [section:uniqued_example uniqued example] `` diff --git a/doc/reference/algorithms.qbk b/doc/reference/algorithms.qbk index 5683f1b..e5c16f7 100644 --- a/doc/reference/algorithms.qbk +++ b/doc/reference/algorithms.qbk @@ -74,7 +74,7 @@ The same task may be accomplished simply with `` boost::erase(vec, boost::unique(vec)); `` -and there is no need to worry about generating an invalid range. Furthermore, if the container is complex, calling `vec.begin()` several times will be more expensive than using a range algorithm. +and there is no need to worry about generating an invalid range. Furthermore, if the container is complex, calling `vec.end()` several times will be more expensive than using a range algorithm. [endsect] diff --git a/doc/reference/ranges/irange.qbk b/doc/reference/ranges/irange.qbk index bd9efc4..a689ec0 100644 --- a/doc/reference/ranges/irange.qbk +++ b/doc/reference/ranges/irange.qbk @@ -4,17 +4,17 @@ `` template -integer_range< range_detail::integer_iterator > +iterator_range< range_detail::integer_iterator > irange(Integer first, Integer last); template -integer_range< range_detail::integer_iterator_with_step > +iterator_range< range_detail::integer_iterator_with_step > irange(Integer first, Integer last, StepSize step_size); `` [heading Description] -`irange` is a function to generate an Integer Range. +`irange` is a function to generate an Integer Range. `irange` allows treating integers as a model of the __random_access_range__ Concept. It should be noted that the `first` and `last` parameters denoted a half-open range.