Replace three links that seem broken (keep timing out)

Fix broken sgi/stl links. Fix broken gmane link.
[CMake] Update formatting and add copy right note
2026-08-10 15:41:38 +02:00 · 2019-04-24 05:47:07 +10:00 · 2019-02-13 19:06:08 -05:00 · 2019-02-13 19:06:08 -05:00
11 changed files with 39 additions and 13 deletions
@@ -0,0 +1,26 @@
+# Copyright 2018 Mike Dev
+# Distributed under the Boost Software License, Version 1.0.
+# See accompanying file LICENSE_1_0.txt or copy at https://www.boost.org/LICENSE_1_0.txt
+#
+# NOTE: CMake support for Boost.Mpl is currently experimental at best
+#       and the interface is likely to change in the future
+
+cmake_minimum_required( VERSION 3.5 )
+project( BoostMpl LANGUAGES CXX )
+
+add_library( boost_mpl INTERFACE )
+add_library( Boost::mpl ALIAS boost_mpl )
+
+target_include_directories( boost_mpl INTERFACE include )
+
+target_link_libraries( boost_mpl
+    INTERFACE
+        Boost::config
+        Boost::core
+        Boost::predef
+        Boost::preprocessor
+        Boost::static_assert
+        Boost::type_traits
+        Boost::utility
+)
+
@@ -14,7 +14,7 @@
 <div class="section" id="acknowledgements">
 <h1><a class="toc-backref" href="../refmanual.html#id1614">Acknowledgements</a></h1>
 <p id="label-acknowledgements">The format and language of this reference documentation has been greatly influenced by
-the SGI's <a class="reference external" href="http://www.sgi.com/tech/stl/" target="_top">Standard Template Library Programmer's Guide</a>.</p>
+the SGI's <a class="reference external" href="https://boost.org/sgi/stl/" target="_top">Standard Template Library Programmer's Guide</a>.</p>
 </div>

 <div class="footer-separator"></div>
@@ -38,7 +38,7 @@ implementations by operating on <a class="reference internal" href="./iterators.
 major categories: iteration algorithms, querying algorithms, and
 transformation algorithms. The transformation algorithms introduce
 an associated <a class="reference internal" href="./inserter.html">Inserter</a> concept, a rough equivalent for the notion of
-<a class="reference external" href="http://www.sgi.com/tech/stl/OutputIterator.html" target="_top">Output Iterator</a> in the Standard Library. Moreover, every
+<a class="reference external" href="https://boost.org/sgi/stl/OutputIterator.html" target="_top">Output Iterator</a> in the Standard Library. Moreover, every
 transformation algorithm provides a <tt class="literal"><span class="pre">reverse_</span></tt> counterpart,
 allowing for a wider range of efficient transformations — a
 common functionality documented by the <a class="reference internal" href="./reversible-algorithm.html">Reversible Algorithm</a>
@@ -71,7 +71,7 @@ every element in the [<tt class="literal"><span class="pre"><a href="./begin.htm
 <td>A transformation.</td>
 </tr>
 <tr><td><tt class="literal"><span class="pre">f</span></tt></td>
-<td>An <a class="reference external" href="http://www.sgi.com/tech/stl/UnaryFunction.html" target="_top">unary function object</a></td>
+<td>An <a class="reference external" href="https://boost.org/sgi/stl/UnaryFunction.html" target="_top">unary function object</a></td>
 <td>A runtime operation to apply.</td>
 </tr>
 </tbody>
@@ -80,7 +80,7 @@ every element in the [<tt class="literal"><span class="pre"><a href="./begin.htm
 <div class="section" id="id816">
 <h3><a class="subsection-title" href="#expression-semantics" name="expression-semantics">Expression semantics</a></h3>
 <p>For any <a class="reference internal" href="./forward-sequence.html">Forward Sequence</a> <tt class="literal"><span class="pre">s</span></tt>, <a class="reference internal" href="./lambda-expression.html">Lambda Expression</a> <tt class="literal"><span class="pre">op</span></tt> , and an
-<a class="reference external" href="http://www.sgi.com/tech/stl/UnaryFunction.html" target="_top">unary function object</a> <tt class="literal"><span class="pre">f</span></tt>:</p>
+<a class="reference external" href="https://boost.org/sgi/stl/UnaryFunction.html" target="_top">unary function object</a> <tt class="literal"><span class="pre">f</span></tt>:</p>
 <pre class="literal-block">
 <a href="./for-each.html" class="identifier">for_each</a>&lt;s&gt;( f );
 </pre>
@@ -15,7 +15,7 @@
 <h1><a class="toc-backref" href="./algorithms-concepts.html#id1462">Inserter</a></h1>
 <div class="section" id="id454">
 <h3><a class="subsection-title" href="#description" name="description">Description</a></h3>
-<p>An <a class="reference internal" href="./inserter.html">Inserter</a> is a compile-time substitute for STL <a class="reference external" href="http://www.sgi.com/tech/stl/OutputIterator.html" target="_top">Output Iterator</a>.
+<p>An <a class="reference internal" href="./inserter.html">Inserter</a> is a compile-time substitute for STL <a class="reference external" href="https://boost.org/sgi/stl/OutputIterator.html" target="_top">Output Iterator</a>.
 Under the hood, it's simply a type holding
 two entities: a <em>state</em> and an <em>operation</em>. When passed to a
 <a class="reference internal" href="./transformation-algorithms.html">transformation algorithm</a>, the inserter's binary operation is
@@ -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 <a class="reference internal" href="./inserter.html">Inserter</a> argument, which
-plays a role similar to the role of run-time <a class="reference external" href="http://www.sgi.com/tech/stl/OutputIterator.html" target="_top">Output Iterator</a>.</p>
+plays a role similar to the role of run-time <a class="reference external" href="https://boost.org/sgi/stl/OutputIterator.html" target="_top">Output Iterator</a>.</p>
 <!-- Say something about optionality of Inserters/their default behavior -->
 <p>Every transformation algorithm is a <a class="reference internal" href="./reversible-algorithm.html">Reversible Algorithm</a>, providing
 an accordingly named <tt class="literal"><span class="pre">reverse_</span></tt> counterpart carrying the transformation
@@ -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
@@ -35,7 +35,7 @@ common functionality documented by the |Reversible Algorithm|
 concept.


-.. |Output Iterator| replace:: `Output Iterator <http://www.sgi.com/tech/stl/OutputIterator.html>`__
+.. |Output Iterator| replace:: `Output Iterator <https://boost.org/sgi/stl/OutputIterator.html>`__
 .. |sequence algorithms| replace:: `sequence algorithms`_
 .. _`sequence algorithms`: `Algorithms`_

@@ -136,7 +136,7 @@ See also

 |Runtime Algorithms|, |Views|, |transform_view|

-.. |unary function object| replace:: `unary function object <http://www.sgi.com/tech/stl/UnaryFunction.html>`__
+.. |unary function object| replace:: `unary function object <https://boost.org/sgi/stl/UnaryFunction.html>`__
 .. |value_initialized| replace:: `value_initialized <http://www.boost.org/libs/utility/value_init.htm>`__


@@ -33,12 +33,12 @@ Complete Guide</a>&quot;, by David Vandevoorde and Nicolai M. Josuttis — <em>t
 on the details and workings of the C++ template system.</p>
 <p>We can also recommend a number online resources:</p>
 <ul class="simple">
-<li>Todd L. Veldhuizen, &quot;<a class="reference" href="http://osl.iu.edu/~tveldhui/papers/Template-Metaprograms/meta-art.html" target="_top">Using C++ template metaprograms</a>&quot;, C++ Report 
+<li>Todd L. Veldhuizen, &quot;<a class="reference" href="https://dl.acm.org/citation.cfm?id=260748" target="_top">Using C++ template metaprograms</a>&quot;, C++ Report 
 Vol. 7 No. 4 (May 1995), pp. 36-43.</li>
-<li>Todd L. Veldhuizen and Dennis Gannon, &quot;<a class="reference" href="http://osl.iu.edu/~tveldhui/papers/oo98.html" target="_top">Active Libraries: Rethinking the roles of 
+<li>Todd L. Veldhuizen and Dennis Gannon, &quot;<a class="reference" href="https://arxiv.org/abs/math/9810022" target="_top">Active Libraries: Rethinking the roles of 
 compilers and libraries</a>&quot;, SIAM Workshop on Object Oriented Methods for Inter-operable 
 Scientific and Engineering Computing, October 21-23, 1998</li>
-<li>Todd L. Veldhuizen, &quot;<a class="reference" href="http://osl.iu.edu/~tveldhui/papers/pepm99/" target="_top">C++ Templates as Partial Evaluation</a>&quot;, 1999 ACM SIGPLAN 
+<li>Todd L. Veldhuizen, &quot;<a class="reference" href="https://arxiv.org/abs/cs/9810010" target="_top">C++ Templates as Partial Evaluation</a>&quot;, 1999 ACM SIGPLAN 
 Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM'99).</li>
 </ul>
 <!-- What about Todd's PhD dissertation?  Too far off the beaten track? -->
@@ -46,7 +46,7 @@ struct if_c<false,T1,T2>
 };

 // 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)
Author	SHA1	Message	Date
tinko92andGlen Fernandes	e01a10925d	Replace three links that seem broken (keep timing out) Fix broken sgi/stl links. Fix broken gmane link.	2019-04-24 05:47:07 +10:00
Mike DevandJames E. King III	273db79266	[CMake] Update formatting and add copy right note	2019-02-13 19:06:08 -05:00
Mike DevandJames E. King III	c7df450a81	[CMake] Generate cmake target that other libraries can use ... to express their dependency on this library and retrieve any configuration information such as the include directory, binary to link to (if any), transitive dependencies, necessary compiler options or the required c++ standards level.	2019-02-13 19:06:08 -05:00