From f39107f2289a61ee151387c424d5dd577f5aface Mon Sep 17 00:00:00 2001 From: Tinko Bartels Date: Tue, 23 Apr 2019 13:48:19 +0200 Subject: [PATCH] Replace broken links. --- include/boost/algorithm/find_backward.hpp | 2 +- include/boost/algorithm/find_not.hpp | 2 +- minmax/doc/minmax_synopsis.html | 38 +++++++++++------------ minmax/index.html | 32 +++++++++---------- string/doc/external_concepts.html | 2 +- 5 files changed, 38 insertions(+), 38 deletions(-) diff --git a/include/boost/algorithm/find_backward.hpp b/include/boost/algorithm/find_backward.hpp index 66901a1..6102c9a 100644 --- a/include/boost/algorithm/find_backward.hpp +++ b/include/boost/algorithm/find_backward.hpp @@ -2,7 +2,7 @@ Copyright (c) T. Zachary Laine 2018. Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE10.txt or copy at http://www.boost.org/LICENSE10.txt) + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) */ #ifndef BOOST_ALGORITHM_FIND_BACKWARD_HPP #define BOOST_ALGORITHM_FIND_BACKWARD_HPP diff --git a/include/boost/algorithm/find_not.hpp b/include/boost/algorithm/find_not.hpp index ef4df00..4d8a28a 100644 --- a/include/boost/algorithm/find_not.hpp +++ b/include/boost/algorithm/find_not.hpp @@ -2,7 +2,7 @@ Copyright (c) T. Zachary Laine 2018. Distributed under the Boost Software License, Version 1.0. (See accompanying - file LICENSE10.txt or copy at http://www.boost.org/LICENSE10.txt) + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) */ #ifndef BOOST_ALGORITHM_FIND_NOT_HPP #define BOOST_ALGORITHM_FIND_NOT_HPP diff --git a/minmax/doc/minmax_synopsis.html b/minmax/doc/minmax_synopsis.html index 1651a13..09b64f8 100644 --- a/minmax/doc/minmax_synopsis.html +++ b/minmax/doc/minmax_synopsis.html @@ -24,7 +24,7 @@ namespace boost { tuple<T const&, T const&> > minmax(const T& a, const T& b); - template <class T, class BinaryPredicate> + template <class T, class BinaryPredicate> tuple<T const&, T const&> > minmax(const T& a, const T& b, BinaryPredicate comp); @@ -38,77 +38,77 @@ Synopsis of <boost/algorithm/minmax_element.hpp> namespace boost { - template <class ForwardIterator> + template <class ForwardIterator> std::pair<ForwardIterator,ForwardIterator> minmax_element(ForwardIterator first, ForwardIterator last); - template <class ForwardIterator, class BinaryPredicate> + template <class ForwardIterator, class BinaryPredicate> std::pair<ForwardIterator,ForwardIterator> minmax_element(ForwardIterator first, ForwardIterator last, BinaryPredicate comp); // Variants - template <class ForwardIterator> + template <class ForwardIterator> ForwardIterator first_min_element(ForwardIterator first, ForwardIterator last); - template <class ForwardIterator, class BinaryPredicate> + template <class ForwardIterator, class BinaryPredicate> ForwardIterator first_min_element(ForwardIterator first, ForwardIterator last, BinaryPredicate comp); - template <class ForwardIterator> + template <class ForwardIterator> ForwardIterator last_min_element(ForwardIterator first, ForwardIterator last); - template <class ForwardIterator, class BinaryPredicate> + template <class ForwardIterator, class BinaryPredicate> ForwardIterator last_min_element(ForwardIterator first, ForwardIterator last, BinaryPredicate comp); - template <class ForwardIterator> + template <class ForwardIterator> ForwardIterator first_max_element(ForwardIterator first, ForwardIterator last); - template <class ForwardIterator, class BinaryPredicate> + template <class ForwardIterator, class BinaryPredicate> ForwardIterator first_max_element(ForwardIterator first, ForwardIterator last, BinaryPredicate comp); - template <class ForwardIterator> + template <class ForwardIterator> ForwardIterator last_max_element(ForwardIterator first, ForwardIterator last); - template <class ForwardIterator, class BinaryPredicate> + template <class ForwardIterator, class BinaryPredicate> ForwardIterator last_max_element(ForwardIterator first, ForwardIterator last, BinaryPredicate comp); - template <class ForwardIterator> + template <class ForwardIterator> std::pair<ForwardIterator,ForwardIterator> first_min_first_max_element(ForwardIterator first, ForwardIterator last); - template <class ForwardIterator, class BinaryPredicate> + template <class ForwardIterator, class BinaryPredicate> std::pair<ForwardIterator,ForwardIterator> first_min_first_max_element(ForwardIterator first, ForwardIterator last, BinaryPredicate comp); - template <class ForwardIterator> + template <class ForwardIterator> std::pair<ForwardIterator,ForwardIterator> first_min_last_max_element(ForwardIterator first, ForwardIterator last); - template <class ForwardIterator, class BinaryPredicate> + template <class ForwardIterator, class BinaryPredicate> std::pair<ForwardIterator,ForwardIterator> first_min_last_max_element(ForwardIterator first, ForwardIterator last, BinaryPredicate comp); - template <class ForwardIterator> + template <class ForwardIterator> std::pair<ForwardIterator,ForwardIterator> last_min_first_max_element(ForwardIterator first, ForwardIterator last); - template <class ForwardIterator, class BinaryPredicate> + template <class ForwardIterator, class BinaryPredicate> std::pair<ForwardIterator,ForwardIterator> last_min_first_max_element(ForwardIterator first, ForwardIterator last, BinaryPredicate comp); - template <class ForwardIterator> + template <class ForwardIterator> std::pair<ForwardIterator,ForwardIterator> last_min_last_max_element(ForwardIterator first, ForwardIterator last); - template <class ForwardIterator, class BinaryPredicate> + template <class ForwardIterator, class BinaryPredicate> std::pair<ForwardIterator,ForwardIterator> last_min_last_max_element(ForwardIterator first, ForwardIterator last, BinaryPredicate comp); diff --git a/minmax/index.html b/minmax/index.html index 72a5116..f58bfe6 100644 --- a/minmax/index.html +++ b/minmax/index.html @@ -95,7 +95,7 @@ namespace boost { tuple<T const&, T const&> minmax(const T& a, const T& b); - template <class T, class BinaryPredicate> + template <class T, class BinaryPredicate> tuple<T const&, T const&> minmax(const T& a, const T& b, BinaryPredicate comp); @@ -109,11 +109,11 @@ Synopsis of <boost/algorithm/minmax_element.hpp> namespace boost { - template <class ForwardIterator> + template <class ForwardIterator> std::pair<ForwardIterator,ForwardIterator> minmax_element(ForwardIterator first, ForwardIterator last); - template <class ForwardIterator, class BinaryPredicate> + template <class ForwardIterator, class BinaryPredicate> std::pair<ForwardIterator,ForwardIterator> minmax_element(ForwardIterator first, ForwardIterator last, BinaryPredicate comp); @@ -190,26 +190,26 @@ in minmax_element.hpp.

Requirements on types

-For minmax, T must be a model of LessThan +For minmax, T must be a model of LessThan Comparable.

For all the other function templates, versions with two template parameters:

For the versions with three template parameters: