boost/math
2
0
Fork 0
mirror of https://github.com/boostorg/math.git synced 2026-01-19 04:22:09 +00:00
Code Issues Projects Releases Wiki Activity

edit and broken links in docs qbk only, locally builds and passed inspect program, even update pull to get JM changes. [CI SKIP]

Browse Source
This commit is contained in:
pabristow
2018-10-04 14:39:33 +01:00
parent 9e4821dada
commit 7779430500
13 changed files with 32 additions and 31 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
doc/html/index.html
View File

@@ -122,7 +122,7 @@ This manual is also available in <a href="http://sourceforge.net/projects/boost/
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"><p><small>Last revised: October 04, 2018 at 13:21:42 GMT</small></p></td>
<td align="left"><p><small>Last revised: October 04, 2018 at 13:34:21 GMT</small></p></td>
<td align="right"><div class="copyright-footer"></div></td>
</tr></table>
<hr>

2
doc/html/indexes/s01.html
View File

@@ -24,7 +24,7 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="id1852633"></a>Function Index</h2></div></div></div>
<a name="id1871624"></a>Function Index</h2></div></div></div>
<p><a class="link" href="s01.html#idx_id_0">1</a> <a class="link" href="s01.html#idx_id_1">2</a> <a class="link" href="s01.html#idx_id_2">4</a> <a class="link" href="s01.html#idx_id_3">A</a> <a class="link" href="s01.html#idx_id_4">B</a> <a class="link" href="s01.html#idx_id_5">C</a> <a class="link" href="s01.html#idx_id_6">D</a> <a class="link" href="s01.html#idx_id_7">E</a> <a class="link" href="s01.html#idx_id_8">F</a> <a class="link" href="s01.html#idx_id_9">G</a> <a class="link" href="s01.html#idx_id_10">H</a> <a class="link" href="s01.html#idx_id_11">I</a> <a class="link" href="s01.html#idx_id_12">J</a> <a class="link" href="s01.html#idx_id_13">K</a> <a class="link" href="s01.html#idx_id_14">L</a> <a class="link" href="s01.html#idx_id_15">M</a> <a class="link" href="s01.html#idx_id_16">N</a> <a class="link" href="s01.html#idx_id_17">O</a> <a class="link" href="s01.html#idx_id_18">P</a> <a class="link" href="s01.html#idx_id_19">Q</a> <a class="link" href="s01.html#idx_id_20">R</a> <a class="link" href="s01.html#idx_id_21">S</a> <a class="link" href="s01.html#idx_id_22">T</a> <a class="link" href="s01.html#idx_id_23">U</a> <a class="link" href="s01.html#idx_id_24">V</a> <a class="link" href="s01.html#idx_id_25">W</a> <a class="link" href="s01.html#idx_id_26">X</a> <a class="link" href="s01.html#idx_id_27">Y</a> <a class="link" href="s01.html#idx_id_28">Z</a></p>
<div class="variablelist"><dl class="variablelist">
<dt>

2
doc/html/indexes/s02.html
View File

@@ -24,7 +24,7 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="id1879491"></a>Class Index</h2></div></div></div>
<a name="id1898470"></a>Class Index</h2></div></div></div>
<p><a class="link" href="s02.html#idx_id_32">A</a> <a class="link" href="s02.html#idx_id_33">B</a> <a class="link" href="s02.html#idx_id_34">C</a> <a class="link" href="s02.html#idx_id_35">D</a> <a class="link" href="s02.html#idx_id_36">E</a> <a class="link" href="s02.html#idx_id_37">F</a> <a class="link" href="s02.html#idx_id_38">G</a> <a class="link" href="s02.html#idx_id_39">H</a> <a class="link" href="s02.html#idx_id_40">I</a> <a class="link" href="s02.html#idx_id_43">L</a> <a class="link" href="s02.html#idx_id_44">M</a> <a class="link" href="s02.html#idx_id_45">N</a> <a class="link" href="s02.html#idx_id_46">O</a> <a class="link" href="s02.html#idx_id_47">P</a> <a class="link" href="s02.html#idx_id_48">Q</a> <a class="link" href="s02.html#idx_id_49">R</a> <a class="link" href="s02.html#idx_id_50">S</a> <a class="link" href="s02.html#idx_id_51">T</a> <a class="link" href="s02.html#idx_id_52">U</a> <a class="link" href="s02.html#idx_id_54">W</a></p>
<div class="variablelist"><dl class="variablelist">
<dt>

2
doc/html/indexes/s03.html
View File

@@ -24,7 +24,7 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="id1882937"></a>Typedef Index</h2></div></div></div>
<a name="id1902892"></a>Typedef Index</h2></div></div></div>
<p><a class="link" href="s03.html#idx_id_61">A</a> <a class="link" href="s03.html#idx_id_62">B</a> <a class="link" href="s03.html#idx_id_63">C</a> <a class="link" href="s03.html#idx_id_64">D</a> <a class="link" href="s03.html#idx_id_65">E</a> <a class="link" href="s03.html#idx_id_66">F</a> <a class="link" href="s03.html#idx_id_67">G</a> <a class="link" href="s03.html#idx_id_68">H</a> <a class="link" href="s03.html#idx_id_69">I</a> <a class="link" href="s03.html#idx_id_72">L</a> <a class="link" href="s03.html#idx_id_74">N</a> <a class="link" href="s03.html#idx_id_75">O</a> <a class="link" href="s03.html#idx_id_76">P</a> <a class="link" href="s03.html#idx_id_78">R</a> <a class="link" href="s03.html#idx_id_79">S</a> <a class="link" href="s03.html#idx_id_80">T</a> <a class="link" href="s03.html#idx_id_81">U</a> <a class="link" href="s03.html#idx_id_82">V</a> <a class="link" href="s03.html#idx_id_83">W</a></p>
<div class="variablelist"><dl class="variablelist">
<dt>

2
doc/html/indexes/s04.html
View File

@@ -24,7 +24,7 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="id1882732"></a>Macro Index</h2></div></div></div>
<a name="id1906173"></a>Macro Index</h2></div></div></div>
<p><a class="link" href="s04.html#idx_id_91">B</a> <a class="link" href="s04.html#idx_id_95">F</a></p>
<div class="variablelist"><dl class="variablelist">
<dt>

2
doc/html/indexes/s05.html
View File

@@ -23,7 +23,7 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="id1884555"></a>Index</h2></div></div></div>
<a name="id1905378"></a>Index</h2></div></div></div>
<p><a class="link" href="s05.html#idx_id_116">1</a> <a class="link" href="s05.html#idx_id_117">2</a> <a class="link" href="s05.html#idx_id_118">4</a> <a class="link" href="s05.html#idx_id_119">A</a> <a class="link" href="s05.html#idx_id_120">B</a> <a class="link" href="s05.html#idx_id_121">C</a> <a class="link" href="s05.html#idx_id_122">D</a> <a class="link" href="s05.html#idx_id_123">E</a> <a class="link" href="s05.html#idx_id_124">F</a> <a class="link" href="s05.html#idx_id_125">G</a> <a class="link" href="s05.html#idx_id_126">H</a> <a class="link" href="s05.html#idx_id_127">I</a> <a class="link" href="s05.html#idx_id_128">J</a> <a class="link" href="s05.html#idx_id_129">K</a> <a class="link" href="s05.html#idx_id_130">L</a> <a class="link" href="s05.html#idx_id_131">M</a> <a class="link" href="s05.html#idx_id_132">N</a> <a class="link" href="s05.html#idx_id_133">O</a> <a class="link" href="s05.html#idx_id_134">P</a> <a class="link" href="s05.html#idx_id_135">Q</a> <a class="link" href="s05.html#idx_id_136">R</a> <a class="link" href="s05.html#idx_id_137">S</a> <a class="link" href="s05.html#idx_id_138">T</a> <a class="link" href="s05.html#idx_id_139">U</a> <a class="link" href="s05.html#idx_id_140">V</a> <a class="link" href="s05.html#idx_id_141">W</a> <a class="link" href="s05.html#idx_id_142">X</a> <a class="link" href="s05.html#idx_id_143">Y</a> <a class="link" href="s05.html#idx_id_144">Z</a></p>
<div class="variablelist"><dl class="variablelist">
<dt>

4
doc/html/math_toolkit/brent_minima.html
View File

@@ -58,8 +58,8 @@
<dl class="variablelist">
<dt><span class="term">f</span></dt>
<dd><p>
The function to minimise: a function object (functor) that should be
smooth over the range <span class="emphasis"><em>[min, max]</em></span>, with no maxima
The function to minimise: a function object (or C++ lambda) that should
be smooth over the range <span class="emphasis"><em>[min, max]</em></span>, with no maxima
occurring in that interval.
</p></dd>
<dt><span class="term">min</span></dt>

2
doc/html/math_toolkit/conventions.html
View File

@@ -27,7 +27,7 @@
<a name="math_toolkit.conventions"></a><a class="link" href="conventions.html" title="Document Conventions">Document Conventions</a>
</h2></div></div></div>
<p>
<a class="indexterm" name="id969823"></a>
<a class="indexterm" name="id990401"></a>
</p>
<p>
This documentation aims to use of the following naming and formatting conventions.

2
doc/html/math_toolkit/navigation.html
View File

@@ -27,7 +27,7 @@
<a name="math_toolkit.navigation"></a><a class="link" href="navigation.html" title="Navigation">Navigation</a>
</h2></div></div></div>
<p>
<a class="indexterm" name="id969652"></a>
<a class="indexterm" name="id990305"></a>
</p>
<p>
Boost.Math documentation is provided in both HTML and PDF formats.

4
doc/html/math_toolkit/roots_deriv.html
View File

@@ -86,8 +86,8 @@
<dt><span class="term">F f</span></dt>
<dd>
<p>
Type F must be a callable function object that accepts one parameter
and returns a <a class="link" href="internals/tuples.html" title="Tuples">std::pair,
Type F must be a callable function object (or C++ lambda) that accepts
one parameter and returns a <a class="link" href="internals/tuples.html" title="Tuples">std::pair,
std::tuple, boost::tuple or boost::fusion::tuple</a>:
</p>
<p>

16
doc/html/math_toolkit/roots_noderiv/TOMS748.html
View File

@@ -101,10 +101,10 @@
<dl class="variablelist">
<dt><span class="term">f</span></dt>
<dd><p>
A unary functor that is the function whose root is to be solved. f(x)
need not be uniformly increasing or decreasing on <span class="emphasis"><em>x</em></span>
and may have multiple roots. However, the bounds given must bracket
a single root.
A unary functor (or C++ lambda) that is the function whose root is
to be solved. f(x) need not be uniformly increasing or decreasing on
<span class="emphasis"><em>x</em></span> and may have multiple roots. However, the bounds
given must bracket a single root.
</p></dd>
<dt><span class="term">a</span></dt>
<dd><p>
@@ -127,10 +127,10 @@
</p></dd>
<dt><span class="term">tol</span></dt>
<dd><p>
A binary functor that determines the termination condition for the
search for the root. <span class="emphasis"><em>tol</em></span> is passed the current
brackets at each step, when it returns true, then the current brackets
are returned as the result. See also <a class="link" href="root_termination.html" title="Termination Condition Functors">predefined
A binary functor (or C++ lambda) that determines the termination condition
for the search for the root. <span class="emphasis"><em>tol</em></span> is passed the
current brackets at each step, when it returns true, then the current
brackets are returned as the result. See also <a class="link" href="root_termination.html" title="Termination Condition Functors">predefined
termination functors</a>.
</p></dd>
<dt><span class="term">max_iter</span></dt>

10
doc/html/math_toolkit/roots_noderiv/bisect.html
View File

@@ -65,8 +65,8 @@
<dl class="variablelist">
<dt><span class="term">f</span></dt>
<dd><p>
A unary functor which is the function <span class="emphasis"><em>f(x)</em></span> whose
root is to be found.
A unary functor (or C++ lambda) which is the function <span class="emphasis"><em>f(x)</em></span>
whose root is to be found.
</p></dd>
<dt><span class="term">min</span></dt>
<dd><p>
@@ -85,9 +85,9 @@
</p></dd>
<dt><span class="term">tol</span></dt>
<dd><p>
A binary functor that specifies the termination condition: the function
will return the current brackets enclosing the root when <span class="emphasis"><em>tol(min,
max)</em></span> becomes true. See also <a class="link" href="root_termination.html" title="Termination Condition Functors">predefined
A binary functor (or C++ lambda) that specifies the termination condition:
the function will return the current brackets enclosing the root when
<span class="emphasis"><em>tol(min, max)</em></span> becomes true. See also <a class="link" href="root_termination.html" title="Termination Condition Functors">predefined
termination functors</a>.
</p></dd>
<dt><span class="term">max_iter</span></dt>

13
doc/html/math_toolkit/roots_noderiv/bracket_solve.html
View File

@@ -89,8 +89,9 @@
<dl class="variablelist">
<dt><span class="term">f</span></dt>
<dd><p>
A unary functor that is the function whose root is to be solved. <span class="emphasis"><em>f(x)</em></span>
must be uniformly increasing or decreasing on <span class="emphasis"><em>x</em></span>.
A unary functor (or C++ lambda) that is the function whose root is
to be solved. <span class="emphasis"><em>f(x)</em></span> must be uniformly increasing
or decreasing on <span class="emphasis"><em>x</em></span>.
</p></dd>
<dt><span class="term">guess</span></dt>
<dd><p>
@@ -116,10 +117,10 @@
</p></dd>
<dt><span class="term">tol</span></dt>
<dd><p>
A binary functor that determines the termination condition for the
search for the root. <span class="emphasis"><em>tol</em></span> is passed the current
brackets at each step, when it returns true then the current brackets
are returned as the pair result. See also <a class="link" href="root_termination.html" title="Termination Condition Functors">predefined
A binary functor (or C++ lambda) that determines the termination condition
for the search for the root. <span class="emphasis"><em>tol</em></span> is passed the
current brackets at each step, when it returns true then the current
brackets are returned as the pair result. See also <a class="link" href="root_termination.html" title="Termination Condition Functors">predefined
termination functors</a>.
</p></dd>
<dt><span class="term">max_iter</span></dt>