diff --git a/doc/refmanual/acknowledgements.html b/doc/refmanual/acknowledgements.html index e4eff30..5bdcff3 100644 --- a/doc/refmanual/acknowledgements.html +++ b/doc/refmanual/acknowledgements.html @@ -14,7 +14,7 @@

Acknowledgements

The format and language of this reference documentation has been greatly influenced by -the SGI's Standard Template Library Programmer's Guide.

+the SGI's Standard Template Library Programmer's Guide.

diff --git a/doc/refmanual/algorithms.html b/doc/refmanual/algorithms.html index acc3fe5..31b92e4 100644 --- a/doc/refmanual/algorithms.html +++ b/doc/refmanual/algorithms.html @@ -38,7 +38,7 @@ implementations by operating on Inserter concept, a rough equivalent for the notion of -Output Iterator in the Standard Library. Moreover, every +Output Iterator in the Standard Library. Moreover, every transformation algorithm provides a reverse_ counterpart, allowing for a wider range of efficient transformations — a common functionality documented by the Reversible Algorithm diff --git a/doc/refmanual/for-each.html b/doc/refmanual/for-each.html index fa0759c..6241891 100644 --- a/doc/refmanual/for-each.html +++ b/doc/refmanual/for-each.html @@ -71,7 +71,7 @@ every element in the [f -An unary function object +An unary function object A runtime operation to apply. @@ -80,7 +80,7 @@ every element in the [

Expression semantics

For any Forward Sequence s, Lambda Expression op , and an -unary function object f:

+unary function object f:

 for_each<s>( f );
diff --git a/doc/refmanual/inserter.html b/doc/refmanual/inserter.html index ad1a3da..3e5f742 100644 --- a/doc/refmanual/inserter.html +++ b/doc/refmanual/inserter.html @@ -15,7 +15,7 @@

Inserter

Description

-

An Inserter is a compile-time substitute for STL Output Iterator. +

An Inserter is a compile-time substitute for STL Output Iterator. Under the hood, it's simply a type holding two entities: a state and an operation. When passed to a transformation algorithm, the inserter's binary operation is diff --git a/doc/refmanual/transformation-algorithms.html b/doc/refmanual/transformation-algorithms.html index f7dea01..201b1e6 100644 --- a/doc/refmanual/transformation-algorithms.html +++ b/doc/refmanual/transformation-algorithms.html @@ -19,7 +19,7 @@ ones by performing some kind of transformation. A typical transformation alogrithm takes one or more input sequences and a transformation metafunction/predicate, and returns a new sequence built according to the algorithm's semantics through the means of its Inserter argument, which -plays a role similar to the role of run-time Output Iterator.

+plays a role similar to the role of run-time Output Iterator.

Every transformation algorithm is a Reversible Algorithm, providing an accordingly named reverse_ counterpart carrying the transformation diff --git a/doc/src/refmanual/Acknowledgements.rst b/doc/src/refmanual/Acknowledgements.rst index 14257a3..28ec957 100644 --- a/doc/src/refmanual/Acknowledgements.rst +++ b/doc/src/refmanual/Acknowledgements.rst @@ -2,7 +2,7 @@ The format and language of this reference documentation has been greatly influenced by the SGI's `Standard Template Library Programmer's Guide`__. -__ http://www.sgi.com/tech/stl/ +__ https://boost.org/sgi/stl/ .. copyright:: Copyright © 2001-2009 Aleksey Gurtovoy and David Abrahams diff --git a/doc/src/refmanual/Algorithms.rst b/doc/src/refmanual/Algorithms.rst index 7889926..fd72c76 100644 --- a/doc/src/refmanual/Algorithms.rst +++ b/doc/src/refmanual/Algorithms.rst @@ -35,7 +35,7 @@ common functionality documented by the |Reversible Algorithm| concept. -.. |Output Iterator| replace:: `Output Iterator `__ +.. |Output Iterator| replace:: `Output Iterator `__ .. |sequence algorithms| replace:: `sequence algorithms`_ .. _`sequence algorithms`: `Algorithms`_ diff --git a/doc/src/refmanual/for_each.rst b/doc/src/refmanual/for_each.rst index 6385605..fde17f4 100644 --- a/doc/src/refmanual/for_each.rst +++ b/doc/src/refmanual/for_each.rst @@ -136,7 +136,7 @@ See also |Runtime Algorithms|, |Views|, |transform_view| -.. |unary function object| replace:: `unary function object `__ +.. |unary function object| replace:: `unary function object `__ .. |value_initialized| replace:: `value_initialized `__ diff --git a/doc/tutorial/resources.html b/doc/tutorial/resources.html index c654448..f9bab51 100644 --- a/doc/tutorial/resources.html +++ b/doc/tutorial/resources.html @@ -33,12 +33,12 @@ Complete Guide", by David Vandevoorde and Nicolai M. Josuttis — t on the details and workings of the C++ template system.

We can also recommend a number online resources:

diff --git a/include/boost/mpl/if.hpp b/include/boost/mpl/if.hpp index b6bdf6c..3b0ae19 100644 --- a/include/boost/mpl/if.hpp +++ b/include/boost/mpl/if.hpp @@ -46,7 +46,7 @@ struct if_c }; // agurt, 05/sep/04: nondescriptive parameter names for the sake of DigitalMars -// (and possibly MWCW < 8.0); see http://article.gmane.org/gmane.comp.lib.boost.devel/108959 +// (and possibly MWCW < 8.0); see https://lists.boost.org/Archives/boost/2004/09/71383.php template< typename BOOST_MPL_AUX_NA_PARAM(T1) , typename BOOST_MPL_AUX_NA_PARAM(T2)