Skip to content

Commit 9477cd8

Browse files
mclowmclow
authored
Merge pull request boostorg#59 from tinko92/develop
Replace broken links (mostly in minmax) documentation
2 parents 1cbe285 + f39107f commit 9477cd8

File tree

5 files changed

+38
-38
lines changed

5 files changed

+38
-38
lines changed

‎include/boost/algorithm/find_backward.hpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22
Copyright (c) T. Zachary Laine 2018.
33
44
Distributed under the Boost Software License, Version 1.0. (See accompanying
5-
file LICENSE10.txt or copy at http://www.boost.org/LICENSE10.txt)
5+
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
66
*/
77
#ifndef BOOST_ALGORITHM_FIND_BACKWARD_HPP
88
#define BOOST_ALGORITHM_FIND_BACKWARD_HPP

‎include/boost/algorithm/find_not.hpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22
Copyright (c) T. Zachary Laine 2018.
33
44
Distributed under the Boost Software License, Version 1.0. (See accompanying
5-
file LICENSE10.txt or copy at http://www.boost.org/LICENSE10.txt)
5+
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
66
*/
77
#ifndef BOOST_ALGORITHM_FIND_NOT_HPP
88
#define BOOST_ALGORITHM_FIND_NOT_HPP

‎minmax/doc/minmax_synopsis.html

Lines changed: 19 additions & 19 deletions
Original file line numberDiff line numberDiff line change
@@ -24,7 +24,7 @@ <h3>
2424
tuple&lt;T const&amp;, T const&amp;> >
2525
minmax(const T&amp; a, const T&amp; b);
2626

27-
template &lt;class T, class <a href="http://www.sgi.com/tech/stl/ BinaryPredicate.html">BinaryPredicate</a>>
27+
template &lt;class T, class <a href="https://www.boost.org/sgi/stl/BinaryPredicate.html">BinaryPredicate</a>>
2828
tuple&lt;T const&amp;, T const&amp;> >
2929
minmax(const T&amp; a, const T&amp; b, BinaryPredicate comp);
3030

@@ -38,77 +38,77 @@ <h3>
3838

3939
namespace boost {
4040

41-
template &lt;class <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">ForwardIterator</a>>
41+
template &lt;class <a href="https://www.boost.org/sgi/stl/ForwardIterator.html">ForwardIterator</a>>
4242
std::pair&lt;ForwardIterator,ForwardIterator>
4343
minmax_element(ForwardIterator first, ForwardIterator last);
4444

45-
template &lt;class <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">ForwardIterator</a>, class <a href="http://www.sgi.com/tech/stl/BinaryPredicate.html">BinaryPredicate</a>>
45+
template &lt;class <a href="https://www.boost.org/sgi/stl/ForwardIterator.html">ForwardIterator</a>, class <a href="https://www.boost.org/sgi/stl/BinaryPredicate.html">BinaryPredicate</a>>
4646
std::pair&lt;ForwardIterator,ForwardIterator>
4747
minmax_element(ForwardIterator first, ForwardIterator last,
4848
BinaryPredicate comp);
4949

5050
// Variants
5151

52-
template &lt;class <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">ForwardIterator</a>>
52+
template &lt;class <a href="https://www.boost.org/sgi/stl/ForwardIterator.html">ForwardIterator</a>>
5353
ForwardIterator first_min_element(ForwardIterator first, ForwardIterator last);
5454

55-
template &lt;class <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">ForwardIterator</a>, class <a href="http://www.sgi.com/tech/stl/BinaryPredicate.html">BinaryPredicate</a>>
55+
template &lt;class <a href="https://www.boost.org/sgi/stl/ForwardIterator.html">ForwardIterator</a>, class <a href="https://www.boost.org/sgi/stl/BinaryPredicate.html">BinaryPredicate</a>>
5656
ForwardIterator first_min_element(ForwardIterator first, ForwardIterator last,
5757
BinaryPredicate comp);
5858

59-
template &lt;class <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">ForwardIterator</a>>
59+
template &lt;class <a href="https://www.boost.org/sgi/stl/ForwardIterator.html">ForwardIterator</a>>
6060
ForwardIterator last_min_element(ForwardIterator first, ForwardIterator last);
6161

62-
template &lt;class <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">ForwardIterator</a>, class <a href="http://www.sgi.com/tech/stl/BinaryPredicate.html">BinaryPredicate</a>>
62+
template &lt;class <a href="https://www.boost.org/sgi/stl/ForwardIterator.html">ForwardIterator</a>, class <a href="https://www.boost.org/sgi/stl/BinaryPredicate.html">BinaryPredicate</a>>
6363
ForwardIterator last_min_element(ForwardIterator first, ForwardIterator last,
6464
BinaryPredicate comp);
6565

66-
template &lt;class <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">ForwardIterator</a>>
66+
template &lt;class <a href="https://www.boost.org/sgi/stl/ForwardIterator.html">ForwardIterator</a>>
6767
ForwardIterator first_max_element(ForwardIterator first, ForwardIterator last);
6868

69-
template &lt;class <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">ForwardIterator</a>, class <a href="http://www.sgi.com/tech/stl/BinaryPredicate.html">BinaryPredicate</a>>
69+
template &lt;class <a href="https://www.boost.org/sgi/stl/ForwardIterator.html">ForwardIterator</a>, class <a href="https://www.boost.org/sgi/stl/BinaryPredicate.html">BinaryPredicate</a>>
7070
ForwardIterator first_max_element(ForwardIterator first, ForwardIterator last,
7171
BinaryPredicate comp);
7272

73-
template &lt;class <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">ForwardIterator</a>>
73+
template &lt;class <a href="https://www.boost.org/sgi/stl/ForwardIterator.html">ForwardIterator</a>>
7474
ForwardIterator last_max_element(ForwardIterator first, ForwardIterator last);
7575

76-
template &lt;class <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">ForwardIterator</a>, class <a href="http://www.sgi.com/tech/stl/BinaryPredicate.html">BinaryPredicate</a>>
76+
template &lt;class <a href="https://www.boost.org/sgi/stl/ForwardIterator.html">ForwardIterator</a>, class <a href="https://www.boost.org/sgi/stl/BinaryPredicate.html">BinaryPredicate</a>>
7777
ForwardIterator last_max_element(ForwardIterator first, ForwardIterator last,
7878
BinaryPredicate comp);
7979

80-
template &lt;class <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">ForwardIterator</a>>
80+
template &lt;class <a href="https://www.boost.org/sgi/stl/ForwardIterator.html">ForwardIterator</a>>
8181
std::pair&lt;ForwardIterator,ForwardIterator>
8282
first_min_first_max_element(ForwardIterator first, ForwardIterator last);
8383

84-
template &lt;class <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">ForwardIterator</a>, class <a href="http://www.sgi.com/tech/stl/BinaryPredicate.html">BinaryPredicate</a>>
84+
template &lt;class <a href="https://www.boost.org/sgi/stl/ForwardIterator.html">ForwardIterator</a>, class <a href="https://www.boost.org/sgi/stl/BinaryPredicate.html">BinaryPredicate</a>>
8585
std::pair&lt;ForwardIterator,ForwardIterator>
8686
first_min_first_max_element(ForwardIterator first, ForwardIterator last,
8787
BinaryPredicate comp);
8888

89-
template &lt;class <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">ForwardIterator</a>>
89+
template &lt;class <a href="https://www.boost.org/sgi/stl/ForwardIterator.html">ForwardIterator</a>>
9090
std::pair&lt;ForwardIterator,ForwardIterator>
9191
first_min_last_max_element(ForwardIterator first, ForwardIterator last);
9292

93-
template &lt;class <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">ForwardIterator</a>, class <a href="http://www.sgi.com/tech/stl/BinaryPredicate.html">BinaryPredicate</a>>
93+
template &lt;class <a href="https://www.boost.org/sgi/stl/ForwardIterator.html">ForwardIterator</a>, class <a href="https://www.boost.org/sgi/stl/BinaryPredicate.html">BinaryPredicate</a>>
9494
std::pair&lt;ForwardIterator,ForwardIterator>
9595
first_min_last_max_element(ForwardIterator first, ForwardIterator last,
9696
BinaryPredicate comp);
9797

98-
template &lt;class <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">ForwardIterator</a>>
98+
template &lt;class <a href="https://www.boost.org/sgi/stl/ForwardIterator.html">ForwardIterator</a>>
9999
std::pair&lt;ForwardIterator,ForwardIterator>
100100
last_min_first_max_element(ForwardIterator first, ForwardIterator last);
101101

102-
template &lt;class <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">ForwardIterator</a>, class <a href="http://www.sgi.com/tech/stl/BinaryPredicate.html">BinaryPredicate</a>>
102+
template &lt;class <a href="https://www.boost.org/sgi/stl/ForwardIterator.html">ForwardIterator</a>, class <a href="https://www.boost.org/sgi/stl/BinaryPredicate.html">BinaryPredicate</a>>
103103
std::pair&lt;ForwardIterator,ForwardIterator>
104104
last_min_first_max_element(ForwardIterator first, ForwardIterator last,
105105
BinaryPredicate comp);
106106

107-
template &lt;class <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">ForwardIterator</a>>
107+
template &lt;class <a href="https://www.boost.org/sgi/stl/ForwardIterator.html">ForwardIterator</a>>
108108
std::pair&lt;ForwardIterator,ForwardIterator>
109109
last_min_last_max_element(ForwardIterator first, ForwardIterator last);
110110

111-
template &lt;class <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">ForwardIterator</a>, class <a href="http://www.sgi.com/tech/stl/BinaryPredicate.html">BinaryPredicate</a>>
111+
template &lt;class <a href="https://www.boost.org/sgi/stl/ForwardIterator.html">ForwardIterator</a>, class <a href="https://www.boost.org/sgi/stl/BinaryPredicate.html">BinaryPredicate</a>>
112112
std::pair&lt;ForwardIterator,ForwardIterator>
113113
last_min_last_max_element(ForwardIterator first, ForwardIterator last,
114114
BinaryPredicate comp);

‎minmax/index.html

Lines changed: 16 additions & 16 deletions
Original file line numberDiff line numberDiff line change
@@ -95,7 +95,7 @@ <h3>
9595
tuple&lt;T const&amp;, T const&amp;>
9696
minmax(const T&amp; a, const T&amp; b);
9797

98-
template &lt;class T, class <a href="http://www.sgi.com/tech/stl/BinaryPredicate.html">BinaryPredicate</a>>
98+
template &lt;class T, class <a href="https://www.boost.org/sgi/stl/BinaryPredicate.html">BinaryPredicate</a>>
9999
tuple&lt;T const&amp;, T const&amp;>
100100
minmax(const T&amp; a, const T&amp; b, BinaryPredicate comp);
101101

@@ -109,11 +109,11 @@ <h3>
109109

110110
namespace boost {
111111

112-
template &lt;class <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">ForwardIterator</a>>
112+
template &lt;class <a href="https://www.boost.org/sgi/stl/ForwardIterator.html">ForwardIterator</a>>
113113
std::pair&lt;ForwardIterator,ForwardIterator>
114114
minmax_element(ForwardIterator first, ForwardIterator last);
115115

116-
template &lt;class <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">ForwardIterator</a>, class <a href="http://www.sgi.com/tech/stl/BinaryPredicate.html">BinaryPredicate</a>>
116+
template &lt;class <a href="https://www.boost.org/sgi/stl/ForwardIterator.html">ForwardIterator</a>, class <a href="https://www.boost.org/sgi/stl/BinaryPredicate.html">BinaryPredicate</a>>
117117
std::pair&lt;ForwardIterator,ForwardIterator>
118118
minmax_element(ForwardIterator first, ForwardIterator last,
119119
BinaryPredicate comp);
@@ -190,26 +190,26 @@ <h3>
190190
<a name="reqs">
191191
<h3>
192192
Requirements on types</h3>
193-
For minmax, <tt>T</tt> must be a model of <a href="http://www.sgi.com/tech/stl/LessThanComparable.html">LessThan
193+
For minmax, <tt>T</tt> must be a model of <a href="https://www.boost.org/sgi/stl/LessThanComparable.html">LessThan
194194
Comparable</a>.
195195
<p>For all the other function templates, versions with two template parameters:
196196
<ul>
197197
<li>
198-
<tt>ForwardIterator</tt> is a model of <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">Forward
198+
<tt>ForwardIterator</tt> is a model of <a href="https://www.boost.org/sgi/stl/ForwardIterator.html">Forward
199199
Iterator</a>.</li>
200200

201201
<li>
202-
<tt>ForwardIterator</tt>'s value type is <a href="http://www.sgi.com/tech/stl/LessThanComparable.html">LessThan
202+
<tt>ForwardIterator</tt>'s value type is <a href="https://www.boost.org/sgi/stl/LessThanComparable.html">LessThan
203203
Comparable</a>.</li>
204204
</ul>
205205
For the versions with three template parameters:
206206
<ul>
207207
<li>
208-
<tt>ForwardIterator</tt> is a model of <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">Forward
208+
<tt>ForwardIterator</tt> is a model of <a href="https://www.boost.org/sgi/stl/ForwardIterator.html">Forward
209209
Iterator</a>.</li>
210210

211211
<li>
212-
<tt>BinaryPredicate</tt> is a model of <a href="http://www.sgi.com/tech/stl/BinaryPredicate.html">Binary
212+
<tt>BinaryPredicate</tt> is a model of <a href="https://www.boost.org/sgi/stl/BinaryPredicate.html">Binary
213213
Predicate</a>.</li>
214214

215215
<li>
@@ -285,8 +285,8 @@ <h3>
285285
assert( result1.get<0>() == 0 );
286286
assert( result1.get<1>() == 1 );
287287

288-
<a href="http://www.sgi.com/tech/stl/List.html">list</a>&lt;int> L;
289-
<a href="http://www.sgi.com/tech/stl/generate_n.html">generate_n</a>(<a href="http://www.sgi.com/tech/stl/front_insert_iterator.html">front_inserter</a>(L), 1000, rand);
288+
<a href="https://www.boost.org/sgi/stl/List.html">list</a>&lt;int> L;
289+
<a href="https://www.boost.org/sgi/stl/generate_n.html">generate_n</a>(<a href="https://www.boost.org/sgi/stl/front_insert_iterator.html">front_inserter</a>(L), 1000, rand);
290290

291291
typedef list&lt;int>::const_iterator iterator;
292292
pair&lt; iterator, iterator > result2 = boost::minmax_element(L.begin(), L.end());
@@ -512,13 +512,13 @@ <h3>
512512
All my thanks for the excellent advice and reviews from all.
513513
<h3>
514514
See also</h3>
515-
<tt><a href="http://www.sgi.com/tech/stl/min.html">min</a></tt>, <tt><a href="http://www.sgi.com/tech/stl/max.html">max</a></tt>,
516-
<tt><a href="http://www.sgi.com/tech/stl/min_element.html">min_element</a></tt>,
517-
<tt><a href="http://www.sgi.com/tech/stl/max_element.html">max_element</a></tt>,
518-
<tt><a href="http://www.sgi.com/tech/stl/LessThanComparable.html">LessThan
515+
<tt><a href="https://www.boost.org/sgi/stl/min.html">min</a></tt>, <tt><a href="https://www.boost.org/sgi/stl/max.html">max</a></tt>,
516+
<tt><a href="https://www.boost.org/sgi/stl/min_element.html">min_element</a></tt>,
517+
<tt><a href="https://www.boost.org/sgi/stl/max_element.html">max_element</a></tt>,
518+
<tt><a href="https://www.boost.org/sgi/stl/LessThanComparable.html">LessThan
519519
Comparable</a></tt>,
520-
<tt><a href="http://www.sgi.com/tech/stl/sort.html">sort</a></tt>,
521-
<tt><a href="http://www.sgi.com/tech/stl/nth_element.html">nth_element</a></tt>
520+
<tt><a href="https://www.boost.org/sgi/stl/sort.html">sort</a></tt>,
521+
<tt><a href="https://www.boost.org/sgi/stl/nth_element.html">nth_element</a></tt>
522522
.
523523
<hr SIZE="6">
524524
<br>Last modified 2012-12-10

‎string/doc/external_concepts.html

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -31,7 +31,7 @@
3131
typedef <i>implementation defined </i> foo_type;</code><p >The corresponding external concept is the ExternalFooConcept.</p><p >A type <code>T</code> fullfills the ExternalFooConcept if these
3232
free-standing functions and type-generators exists:</p><code>void foo( const T&, int ); <br>
3333
int bar( T& ); <br>
34-
foo_type_of< T >::type;</code> <br> <br><hr size="1" ><h3 >Literature</h3><ul ><li > <a href="http://www.boost.org/more/generic_programming.html#type_generator" target="_self" >Type Generators</a> </li><li > <a href="http://www.boost.org/more/generic_programming.html#concept" target="_self" >Concepts</a> </li><li > <a href="http://www.sgi.com/tech/stl/stl_introduction.html" target="_self" >Concepts and SGI STL</a> </li></ul><hr size="1" ><p >&copy; Thorsten Ottosen 2003-2004 (nesotto_AT_cs.auc.dk).
34+
foo_type_of< T >::type;</code> <br> <br><hr size="1" ><h3 >Literature</h3><ul ><li > <a href="http://www.boost.org/more/generic_programming.html#type_generator" target="_self" >Type Generators</a> </li><li > <a href="http://www.boost.org/more/generic_programming.html#concept" target="_self" >Concepts</a> </li><li > <a href="https://www.boost.org/sgi/stl/stl_introduction.html" target="_self" >Concepts and SGI STL</a> </li></ul><hr size="1" ><p >&copy; Thorsten Ottosen 2003-2004 (nesotto_AT_cs.auc.dk).
3535
<br>Use, modification and distribution is subject to the Boost
3636
Software License, Version 1.0. (See accompanying file
3737
<code class="filename">LICENSE_1_0.txt</code> or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)

0 commit comments

Comments
 (0)