diff options
Diffstat (limited to 'libs/algorithm/doc/html')
46 files changed, 4840 insertions, 0 deletions
diff --git a/libs/algorithm/doc/html/algorithm/CXX11.html b/libs/algorithm/doc/html/algorithm/CXX11.html new file mode 100644 index 0000000000..a5e17ead85 --- /dev/null +++ b/libs/algorithm/doc/html/algorithm/CXX11.html @@ -0,0 +1,203 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>C++11 Algorithms</title> +<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../index.html" title="The Boost Algorithm Library"> +<link rel="prev" href="../the_boost_algorithm_library/Searching/KnuthMorrisPratt.html" title="Knuth-Morris-Pratt Search"> +<link rel="next" href="../the_boost_algorithm_library/CXX11/any_of.html" title="any_of"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td> +<td align="center"><a href="../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../the_boost_algorithm_library/Searching/KnuthMorrisPratt.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../the_boost_algorithm_library/CXX11/any_of.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h2 class="title" style="clear: both"> +<a name="algorithm.CXX11"></a><a class="link" href="CXX11.html" title="C++11 Algorithms">C++11 Algorithms</a> +</h2></div></div></div> +<div class="toc"><dl> +<dt><span class="section"><a href="CXX11.html#the_boost_algorithm_library.CXX11.all_of">all_of</a></span></dt> +<dt><span class="section"><a href="../the_boost_algorithm_library/CXX11/any_of.html">any_of</a></span></dt> +<dt><span class="section"><a href="../the_boost_algorithm_library/CXX11/none_of.html">none_of</a></span></dt> +<dt><span class="section"><a href="../the_boost_algorithm_library/CXX11/one_of.html">one_of</a></span></dt> +<dt><span class="section"><a href="../the_boost_algorithm_library/CXX11/is_sorted.html">is_sorted + </a></span></dt> +<dt><span class="section"><a href="../the_boost_algorithm_library/CXX11/is_partitioned.html">is_partitioned + </a></span></dt> +<dt><span class="section"><a href="../the_boost_algorithm_library/CXX11/partition_point.html">partition_point + </a></span></dt> +</dl></div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="the_boost_algorithm_library.CXX11.all_of"></a><a class="link" href="CXX11.html#the_boost_algorithm_library.CXX11.all_of" title="all_of">all_of</a> +</h3></div></div></div> +<p> + The header file 'boost/algorithm/cxx11/all_of.hpp' contains four variants + of a single algorithm, <code class="computeroutput"><span class="identifier">all_of</span></code>. + The algorithm tests all the elements of a sequence and returns true if they + all share a property. + </p> +<p> + The routine <code class="computeroutput"><span class="identifier">all_of</span></code> takes + a sequence and a predicate. It will return true if the predicate returns + true when applied to every element in the sequence. + </p> +<p> + The routine <code class="computeroutput"><span class="identifier">all_of_equal</span></code> + takes a sequence and a value. It will return true if every element in the + sequence compares equal to the passed in value. + </p> +<p> + Both routines come in two forms; the first one takes two iterators to define + the range. The second form takes a single range parameter, and uses Boost.Range + to traverse it. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.all_of.h0"></a> + <span><a name="the_boost_algorithm_library.CXX11.all_of.interface"></a></span><a class="link" href="CXX11.html#the_boost_algorithm_library.CXX11.all_of.interface">interface</a> + </h5> +<p> + The function <code class="computeroutput"><span class="identifier">all_of</span></code> returns + true if the predicate returns true for every item in the sequence. There + are two versions; one takes two iterators, and the other takes a range. + </p> +<p> +</p> +<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">algorithm</span> <span class="special">{</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Predicate</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">all_of</span> <span class="special">(</span> <span class="identifier">InputIterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">InputIterator</span> <span class="identifier">last</span><span class="special">,</span> <span class="identifier">Predicate</span> <span class="identifier">p</span> <span class="special">);</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Range</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Predicate</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">all_of</span> <span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">Predicate</span> <span class="identifier">p</span> <span class="special">);</span> +<span class="special">}}</span> +</pre> +<p> + </p> +<p> + The function <code class="computeroutput"><span class="identifier">all_of_equal</span></code> + is similar to <code class="computeroutput"><span class="identifier">all_of</span></code>, but + instead of taking a predicate to test the elements of the sequence, it takes + a value to compare against. + </p> +<p> +</p> +<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">algorithm</span> <span class="special">{</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">V</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">all_of_equal</span> <span class="special">(</span> <span class="identifier">InputIterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">InputIterator</span> <span class="identifier">last</span><span class="special">,</span> <span class="identifier">V</span> <span class="keyword">const</span> <span class="special">&</span><span class="identifier">val</span> <span class="special">);</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Range</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">V</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">all_of_equal</span> <span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">V</span> <span class="keyword">const</span> <span class="special">&</span><span class="identifier">val</span> <span class="special">);</span> +<span class="special">}}</span> +</pre> +<p> + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.all_of.h1"></a> + <span><a name="the_boost_algorithm_library.CXX11.all_of.examples"></a></span><a class="link" href="CXX11.html#the_boost_algorithm_library.CXX11.all_of.examples">Examples</a> + </h5> +<p> + Given the container <code class="computeroutput"><span class="identifier">c</span></code> containing + <code class="computeroutput"><span class="special">{</span> <span class="number">0</span><span class="special">,</span> <span class="number">1</span><span class="special">,</span> + <span class="number">2</span><span class="special">,</span> <span class="number">3</span><span class="special">,</span> <span class="number">14</span><span class="special">,</span> <span class="number">15</span> <span class="special">}</span></code>, + then +</p> +<pre class="programlisting"><span class="keyword">bool</span> <span class="identifier">isOdd</span> <span class="special">(</span> <span class="keyword">int</span> <span class="identifier">i</span> <span class="special">)</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">i</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">;</span> <span class="special">}</span> +<span class="keyword">bool</span> <span class="identifier">lessThan10</span> <span class="special">(</span> <span class="keyword">int</span> <span class="identifier">i</span> <span class="special">)</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">i</span> <span class="special"><</span> <span class="number">10</span><span class="special">;</span> <span class="special">}</span> + +<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">algorithm</span><span class="special">;</span> +<span class="identifier">all_of</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">,</span> <span class="identifier">isOdd</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">false</span> +<span class="identifier">all_of</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">lessThan10</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">false</span> +<span class="identifier">all_of</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">()</span> <span class="special">+</span> <span class="number">3</span><span class="special">,</span> <span class="identifier">lessThan10</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">true</span> +<span class="identifier">all_of</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">isOdd</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">true</span> <span class="comment">// empty range</span> +<span class="identifier">all_of_equal</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">,</span> <span class="number">3</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">false</span> +<span class="identifier">all_of_equal</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">()</span> <span class="special">+</span> <span class="number">3</span><span class="special">,</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">()</span> <span class="special">+</span> <span class="number">4</span><span class="special">,</span> <span class="number">3</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">true</span> +<span class="identifier">all_of_equal</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="number">99</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">true</span> <span class="comment">// empty range</span> +</pre> +<p> + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.all_of.h2"></a> + <span><a name="the_boost_algorithm_library.CXX11.all_of.iterator_requirements"></a></span><a class="link" href="CXX11.html#the_boost_algorithm_library.CXX11.all_of.iterator_requirements">Iterator + Requirements</a> + </h5> +<p> + <code class="computeroutput"><span class="identifier">all_of</span></code> and <code class="computeroutput"><span class="identifier">all_of_equal</span></code> work on all iterators except + output iterators. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.all_of.h3"></a> + <span><a name="the_boost_algorithm_library.CXX11.all_of.complexity"></a></span><a class="link" href="CXX11.html#the_boost_algorithm_library.CXX11.all_of.complexity">Complexity</a> + </h5> +<p> + All of the variants of <code class="computeroutput"><span class="identifier">all_of</span></code> + and <code class="computeroutput"><span class="identifier">all_of_equal</span></code> run in + <span class="emphasis"><em>O(N)</em></span> (linear) time; that is, they compare against each + element in the list once. If any of the comparisons fail, the algorithm will + terminate immediately, without examining the remaining members of the sequence. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.all_of.h4"></a> + <span><a name="the_boost_algorithm_library.CXX11.all_of.exception_safety"></a></span><a class="link" href="CXX11.html#the_boost_algorithm_library.CXX11.all_of.exception_safety">Exception + Safety</a> + </h5> +<p> + All of the variants of <code class="computeroutput"><span class="identifier">all_of</span></code> + and <code class="computeroutput"><span class="identifier">all_of_equal</span></code> take their + parameters by value or const reference, and do not depend upon any global + state. Therefore, all the routines in this file provide the strong exception + guarantee. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.all_of.h5"></a> + <span><a name="the_boost_algorithm_library.CXX11.all_of.notes"></a></span><a class="link" href="CXX11.html#the_boost_algorithm_library.CXX11.all_of.notes">Notes</a> + </h5> +<div class="itemizedlist"><ul class="itemizedlist" type="disc"> +<li class="listitem"> + The routine <code class="computeroutput"><span class="identifier">all_of</span></code> is + part of the C++11 standard. When compiled using a C++11 implementation, + the implementation from the standard library will be used. + </li> +<li class="listitem"> + <code class="computeroutput"><span class="identifier">all_of</span></code> and <code class="computeroutput"><span class="identifier">all_of_equal</span></code> both return true for empty + ranges, no matter what is passed to test against. When there are no items + in the sequence to test, they all satisfy the condition to be tested + against. + </li> +<li class="listitem"> + The second parameter to <code class="computeroutput"><span class="identifier">all_of_value</span></code> + is a template parameter, rather than deduced from the first parameter + (<code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span><span class="identifier">InputIterator</span><span class="special">>::</span><span class="identifier">value_type</span></code>) because that allows more + flexibility for callers, and takes advantage of built-in comparisons + for the type that is pointed to by the iterator. The function is defined + to return true if, for all elements in the sequence, the expression + <code class="computeroutput"><span class="special">*</span><span class="identifier">iter</span> + <span class="special">==</span> <span class="identifier">val</span></code> + evaluates to true (where <code class="computeroutput"><span class="identifier">iter</span></code> + is an iterator to each element in the sequence) + </li> +</ul></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../the_boost_algorithm_library/Searching/KnuthMorrisPratt.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../the_boost_algorithm_library/CXX11/any_of.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/algorithm/Misc.html b/libs/algorithm/doc/html/algorithm/Misc.html new file mode 100644 index 0000000000..edd190a0f9 --- /dev/null +++ b/libs/algorithm/doc/html/algorithm/Misc.html @@ -0,0 +1,146 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Other Algorithms</title> +<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../index.html" title="The Boost Algorithm Library"> +<link rel="prev" href="../the_boost_algorithm_library/CXX11/partition_point.html" title="partition_point"> +<link rel="next" href="../the_boost_algorithm_library/Misc/hex.html" title="hex"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td> +<td align="center"><a href="../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../the_boost_algorithm_library/CXX11/partition_point.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../the_boost_algorithm_library/Misc/hex.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h2 class="title" style="clear: both"> +<a name="algorithm.Misc"></a><a class="link" href="Misc.html" title="Other Algorithms">Other Algorithms</a> +</h2></div></div></div> +<div class="toc"><dl> +<dt><span class="section"><a href="Misc.html#the_boost_algorithm_library.Misc.clamp">clamp</a></span></dt> +<dt><span class="section"><a href="../the_boost_algorithm_library/Misc/hex.html">hex</a></span></dt> +</dl></div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="the_boost_algorithm_library.Misc.clamp"></a><a class="link" href="Misc.html#the_boost_algorithm_library.Misc.clamp" title="clamp">clamp</a> +</h3></div></div></div> +<p> + The header file clamp.hpp contains two functions for "clamping" + a value between a pair of boundary values. + </p> +<h5> +<a name="the_boost_algorithm_library.Misc.clamp.h0"></a> + <span><a name="the_boost_algorithm_library.Misc.clamp.clamp"></a></span><a class="link" href="Misc.html#the_boost_algorithm_library.Misc.clamp.clamp">clamp</a> + </h5> +<p> + The function <code class="computeroutput"><span class="identifier">clamp</span> <span class="special">(</span><span class="identifier">v</span><span class="special">,</span> <span class="identifier">lo</span><span class="special">,</span> <span class="identifier">hi</span><span class="special">)</span></code> + returns: + </p> +<div class="itemizedlist"><ul class="itemizedlist" type="disc"> +<li class="listitem"> + lo if v < lo + </li> +<li class="listitem"> + hi if hi < v + </li> +<li class="listitem"> + otherwise, v + </li> +</ul></div> +<p> + Note: using <code class="computeroutput"><span class="identifier">clamp</span></code> with floating + point numbers may give unexpected results if one of the values is <code class="computeroutput"><span class="identifier">NaN</span></code>. + </p> +<p> + There is also a version that allows the caller to specify a comparison predicate + to use instead of <code class="computeroutput"><span class="keyword">operator</span> <span class="special"><</span></code>. + </p> +<p> +</p> +<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">V</span><span class="special">></span> +<span class="identifier">V</span> <span class="identifier">clamp</span> <span class="special">(</span> <span class="identifier">V</span> <span class="identifier">val</span><span class="special">,</span> <span class="identifier">V</span> <span class="identifier">lo</span><span class="special">,</span> <span class="identifier">V</span> <span class="identifier">hi</span> <span class="special">);</span> + +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">V</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Pred</span><span class="special">></span> +<span class="identifier">V</span> <span class="identifier">clamp</span> <span class="special">(</span> <span class="identifier">V</span> <span class="identifier">val</span><span class="special">,</span> <span class="identifier">V</span> <span class="identifier">lo</span><span class="special">,</span> <span class="identifier">V</span> <span class="identifier">hi</span><span class="special">,</span> <span class="identifier">Pred</span> <span class="identifier">p</span> <span class="special">);</span> +</pre> +<p> + </p> +<p> + The following code: +</p> +<pre class="programlisting"><span class="keyword">int</span> <span class="identifier">foo</span> <span class="special">=</span> <span class="number">23</span><span class="special">;</span> +<span class="identifier">foo</span> <span class="special">=</span> <span class="identifier">clamp</span> <span class="special">(</span> <span class="identifier">foo</span><span class="special">,</span> <span class="number">1</span><span class="special">,</span> <span class="number">10</span> <span class="special">);</span> +</pre> +<p> + will leave <code class="computeroutput"><span class="identifier">foo</span></code> with a value + of 10 + </p> +<p> + Complexity: <code class="computeroutput"><span class="identifier">clamp</span></code> will make + either one or two calls to the comparison predicate before returning one + of the three parameters. + </p> +<h5> +<a name="the_boost_algorithm_library.Misc.clamp.h1"></a> + <span><a name="the_boost_algorithm_library.Misc.clamp.clamp_range"></a></span><a class="link" href="Misc.html#the_boost_algorithm_library.Misc.clamp.clamp_range">clamp_range</a> + </h5> +<p> + There are also four range-based versions of clamp, that apply clamping to + a series of values. You could write them yourself with std::transform and + bind, like this: <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">transform</span> <span class="special">(</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">last</span><span class="special">,</span> <span class="identifier">out</span><span class="special">,</span> <span class="identifier">bind</span> + <span class="special">(</span> <span class="identifier">clamp</span> + <span class="special">(</span> <span class="identifier">_1</span><span class="special">,</span> <span class="identifier">lo</span><span class="special">,</span> + <span class="identifier">hi</span> <span class="special">)))</span></code>, + but they are provided here for your convenience. + </p> +<p> +</p> +<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">OutputIterator</span><span class="special">></span> +<span class="identifier">OutputIterator</span> <span class="identifier">clamp_range</span> <span class="special">(</span> <span class="identifier">InputIterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">InputIterator</span> <span class="identifier">last</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span><span class="identifier">InputIterator</span><span class="special">>::</span><span class="identifier">value_type</span> <span class="identifier">lo</span><span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span><span class="identifier">InputIterator</span><span class="special">>::</span><span class="identifier">value_type</span> <span class="identifier">hi</span> <span class="special">);</span> + +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Range</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">OutputIterator</span><span class="special">></span> +<span class="identifier">OutputIterator</span> <span class="identifier">clamp_range</span> <span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">>::</span><span class="identifier">type</span><span class="special">>::</span><span class="identifier">value_type</span> <span class="identifier">lo</span><span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">>::</span><span class="identifier">type</span><span class="special">>::</span><span class="identifier">value_type</span> <span class="identifier">hi</span> <span class="special">);</span> + +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">OutputIterator</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Pred</span><span class="special">></span> +<span class="identifier">OutputIterator</span> <span class="identifier">clamp_range</span> <span class="special">(</span> <span class="identifier">InputIterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">InputIterator</span> <span class="identifier">last</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span><span class="identifier">InputIterator</span><span class="special">>::</span><span class="identifier">value_type</span> <span class="identifier">lo</span><span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span><span class="identifier">InputIterator</span><span class="special">>::</span><span class="identifier">value_type</span> <span class="identifier">hi</span><span class="special">,</span> <span class="identifier">Pred</span> <span class="identifier">p</span> <span class="special">);</span> + +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Range</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">OutputIterator</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Pred</span><span class="special">></span> +<span class="identifier">OutputIterator</span> <span class="identifier">clamp_range</span> <span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span><span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">>::</span><span class="identifier">type</span><span class="special">>::</span><span class="identifier">value_type</span> <span class="identifier">lo</span><span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">Range</span><span class="special">>::</span><span class="identifier">type</span><span class="special">>::</span><span class="identifier">value_type</span> <span class="identifier">hi</span><span class="special">,</span> + <span class="identifier">Pred</span> <span class="identifier">p</span> <span class="special">);</span> +</pre> +<p> + </p> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../the_boost_algorithm_library/CXX11/partition_point.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../the_boost_algorithm_library/Misc/hex.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/algorithm/Searching.html b/libs/algorithm/doc/html/algorithm/Searching.html new file mode 100644 index 0000000000..9183fdfc09 --- /dev/null +++ b/libs/algorithm/doc/html/algorithm/Searching.html @@ -0,0 +1,227 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Searching Algorithms</title> +<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../index.html" title="The Boost Algorithm Library"> +<link rel="prev" href="../index.html" title="The Boost Algorithm Library"> +<link rel="next" href="../the_boost_algorithm_library/Searching/BoyerMooreHorspool.html" title="Boyer-Moore-Horspool Search"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td> +<td align="center"><a href="../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../index.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../the_boost_algorithm_library/Searching/BoyerMooreHorspool.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h2 class="title" style="clear: both"> +<a name="algorithm.Searching"></a><a class="link" href="Searching.html" title="Searching Algorithms">Searching Algorithms</a> +</h2></div></div></div> +<div class="toc"><dl> +<dt><span class="section"><a href="Searching.html#the_boost_algorithm_library.Searching.BoyerMoore">Boyer-Moore + Search</a></span></dt> +<dt><span class="section"><a href="../the_boost_algorithm_library/Searching/BoyerMooreHorspool.html">Boyer-Moore-Horspool + Search</a></span></dt> +<dt><span class="section"><a href="../the_boost_algorithm_library/Searching/KnuthMorrisPratt.html">Knuth-Morris-Pratt + Search</a></span></dt> +</dl></div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="the_boost_algorithm_library.Searching.BoyerMoore"></a><a class="link" href="Searching.html#the_boost_algorithm_library.Searching.BoyerMoore" title="Boyer-Moore Search">Boyer-Moore + Search</a> +</h3></div></div></div> +<h5> +<a name="the_boost_algorithm_library.Searching.BoyerMoore.h0"></a> + <span><a name="the_boost_algorithm_library.Searching.BoyerMoore.overview"></a></span><a class="link" href="Searching.html#the_boost_algorithm_library.Searching.BoyerMoore.overview">Overview</a> + </h5> +<p> + The header file 'boyer_moore.hpp' contains an an implementation of the Boyer-Moore + algorithm for searching sequences of values. + </p> +<p> + The Boyer–Moore string search algorithm is a particularly efficient string + searching algorithm, and it has been the standard benchmark for the practical + string search literature. The Boyer-Moore algorithm was invented by Bob Boyer + and J. Strother Moore, and published in the October 1977 issue of the Communications + of the ACM , and a copy of that article is available at <a href="http://www.cs.utexas.edu/~moore/publications/fstrpos.pdf" target="_top">http://www.cs.utexas.edu/~moore/publications/fstrpos.pdf</a>. + </p> +<p> + The Boyer-Moore algorithm uses two precomputed tables to give better performance + than a naive search. These tables depend on the pattern being searched for, + and give the Boyer-Moore algorithm larger a memory footprint and startup + costs than a simpler algorithm, but these costs are recovered quickly during + the searching process, especially if the pattern is longer than a few elements. + </p> +<p> + However, the Boyer-Moore algorithm cannot be used with comparison predicates + like <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">search</span></code>. + </p> +<p> + Nomenclature: I refer to the sequence being searched for as the "pattern", + and the sequence being searched in as the "corpus". + </p> +<h5> +<a name="the_boost_algorithm_library.Searching.BoyerMoore.h1"></a> + <span><a name="the_boost_algorithm_library.Searching.BoyerMoore.interface"></a></span><a class="link" href="Searching.html#the_boost_algorithm_library.Searching.BoyerMoore.interface">Interface</a> + </h5> +<p> + For flexibility, the Boyer-Moore algorithm has has two interfaces; an object-based + interface and a procedural one. The object-based interface builds the tables + in the constructor, and uses operator () to perform the search. The procedural + interface builds the table and does the search all in one step. If you are + going to be searching for the same pattern in multiple corpora, then you + should use the object interface, and only build the tables once. + </p> +<p> + Here is the object interface: +</p> +<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">patIter</span><span class="special">></span> +<span class="keyword">class</span> <span class="identifier">boyer_moore</span> <span class="special">{</span> +<span class="keyword">public</span><span class="special">:</span> + <span class="identifier">boyer_moore</span> <span class="special">(</span> <span class="identifier">patIter</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">patIter</span> <span class="identifier">last</span> <span class="special">);</span> + <span class="special">~</span><span class="identifier">boyer_moore</span> <span class="special">();</span> + + <span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">corpusIter</span><span class="special">></span> + <span class="identifier">corpusIter</span> <span class="keyword">operator</span> <span class="special">()</span> <span class="special">(</span> <span class="identifier">corpusIter</span> <span class="identifier">corpus_first</span><span class="special">,</span> <span class="identifier">corpusIter</span> <span class="identifier">corpus_last</span> <span class="special">);</span> + <span class="special">};</span> +</pre> +<p> + </p> +<p> + and here is the corresponding procedural interface: + </p> +<p> +</p> +<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">patIter</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">corpusIter</span><span class="special">></span> +<span class="identifier">corpusIter</span> <span class="identifier">boyer_moore_search</span> <span class="special">(</span> + <span class="identifier">corpusIter</span> <span class="identifier">corpus_first</span><span class="special">,</span> <span class="identifier">corpusIter</span> <span class="identifier">corpus_last</span><span class="special">,</span> + <span class="identifier">patIter</span> <span class="identifier">pat_first</span><span class="special">,</span> <span class="identifier">patIter</span> <span class="identifier">pat_last</span> <span class="special">);</span> +</pre> +<p> + </p> +<p> + Each of the functions is passed two pairs of iterators. The first two define + the corpus and the second two define the pattern. Note that the two pairs + need not be of the same type, but they do need to "point" at the + same type. In other words, <code class="computeroutput"><span class="identifier">patIter</span><span class="special">::</span><span class="identifier">value_type</span></code> + and <code class="computeroutput"><span class="identifier">curpusIter</span><span class="special">::</span><span class="identifier">value_type</span></code> need to be the same type. + </p> +<p> + The return value of the function is an iterator pointing to the start of + the pattern in the corpus. If the pattern is not found, it returns the end + of the corpus (<code class="computeroutput"><span class="identifier">corpus_last</span></code>). + </p> +<h5> +<a name="the_boost_algorithm_library.Searching.BoyerMoore.h2"></a> + <span><a name="the_boost_algorithm_library.Searching.BoyerMoore.performance"></a></span><a class="link" href="Searching.html#the_boost_algorithm_library.Searching.BoyerMoore.performance">Performance</a> + </h5> +<p> + The execution time of the Boyer-Moore algorithm, while still linear in the + size of the string being searched, can have a significantly lower constant + factor than many other search algorithms: it doesn't need to check every + character of the string to be searched, but rather skips over some of them. + Generally the algorithm gets faster as the pattern being searched for becomes + longer. Its efficiency derives from the fact that with each unsuccessful + attempt to find a match between the search string and the text it is searching, + it uses the information gained from that attempt to rule out as many positions + of the text as possible where the string cannot match. + </p> +<h5> +<a name="the_boost_algorithm_library.Searching.BoyerMoore.h3"></a> + <span><a name="the_boost_algorithm_library.Searching.BoyerMoore.memory_use"></a></span><a class="link" href="Searching.html#the_boost_algorithm_library.Searching.BoyerMoore.memory_use">Memory + Use</a> + </h5> +<p> + The algorithm allocates two internal tables. The first one is proportional + to the length of the pattern; the second one has one entry for each member + of the "alphabet" in the pattern. For (8-bit) character types, + this table contains 256 entries. + </p> +<h5> +<a name="the_boost_algorithm_library.Searching.BoyerMoore.h4"></a> + <span><a name="the_boost_algorithm_library.Searching.BoyerMoore.complexity"></a></span><a class="link" href="Searching.html#the_boost_algorithm_library.Searching.BoyerMoore.complexity">Complexity</a> + </h5> +<p> + The worst-case performance to find a pattern in the corpus is <span class="emphasis"><em>O(N)</em></span> + (linear) time; that is, proportional to the length of the corpus being searched. + In general, the search is sub-linear; not every entry in the corpus need + be checked. + </p> +<h5> +<a name="the_boost_algorithm_library.Searching.BoyerMoore.h5"></a> + <span><a name="the_boost_algorithm_library.Searching.BoyerMoore.exception_safety"></a></span><a class="link" href="Searching.html#the_boost_algorithm_library.Searching.BoyerMoore.exception_safety">Exception + Safety</a> + </h5> +<p> + Both the object-oriented and procedural versions of the Boyer-Moore algorithm + take their parameters by value and do not use any information other than + what is passed in. Therefore, both interfaces provide the strong exception + guarantee. + </p> +<h5> +<a name="the_boost_algorithm_library.Searching.BoyerMoore.h6"></a> + <span><a name="the_boost_algorithm_library.Searching.BoyerMoore.notes"></a></span><a class="link" href="Searching.html#the_boost_algorithm_library.Searching.BoyerMoore.notes">Notes</a> + </h5> +<div class="itemizedlist"><ul class="itemizedlist" type="disc"> +<li class="listitem"> + When using the object-based interface, the pattern must remain unchanged + for during the searches; i.e, from the time the object is constructed + until the final call to operator () returns. + </li> +<li class="listitem"> + The Boyer-Moore algorithm requires random-access iterators for both the + pattern and the corpus. + </li> +</ul></div> +<h5> +<a name="the_boost_algorithm_library.Searching.BoyerMoore.h7"></a> + <span><a name="the_boost_algorithm_library.Searching.BoyerMoore.customization_points"></a></span><a class="link" href="Searching.html#the_boost_algorithm_library.Searching.BoyerMoore.customization_points">Customization + points</a> + </h5> +<p> + The Boyer-Moore object takes a traits template parameter which enables the + caller to customize how one of the precomputed tables is stored. This table, + called the skip table, contains (logically) one entry for every possible + value that the pattern can contain. When searching 8-bit character data, + this table contains 256 elements. The traits class defines the table to be + used. + </p> +<p> + The default traits class uses a <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">array</span></code> + for small 'alphabets' and a <code class="computeroutput"><span class="identifier">tr1</span><span class="special">::</span><span class="identifier">unordered_map</span></code> + for larger ones. The array-based skip table gives excellent performance, + but could be prohibitively large when the 'alphabet' of elements to be searched + grows. The unordered_map based version only grows as the number of unique + elements in the pattern, but makes many more heap allocations, and gives + slower lookup performance. + </p> +<p> + To use a different skip table, you should define your own skip table object + and your own traits class, and use them to instantiate the Boyer-Moore object. + The interface to these objects is described TBD. + </p> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../index.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../the_boost_algorithm_library/Searching/BoyerMooreHorspool.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/algorithm/reference.html b/libs/algorithm/doc/html/algorithm/reference.html new file mode 100644 index 0000000000..f94a8b2496 --- /dev/null +++ b/libs/algorithm/doc/html/algorithm/reference.html @@ -0,0 +1,95 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Reference</title> +<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../index.html" title="The Boost Algorithm Library"> +<link rel="prev" href="../the_boost_algorithm_library/Misc/hex.html" title="hex"> +<link rel="next" href="../boost/algorithm/clamp_id337250.html" title="Function template clamp"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../boost.png"></td> +<td align="center"><a href="../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../the_boost_algorithm_library/Misc/hex.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../boost/algorithm/clamp_id337250.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h2 class="title" style="clear: both"> +<a name="algorithm.reference"></a>Reference</h2></div></div></div> +<div class="toc"><dl> +<dt><span class="section"><a href="reference.html#header.boost.algorithm.clamp_hpp">Header <boost/algorithm/clamp.hpp></a></span></dt> +<dt><span class="section"><a href="../header/boost/algorithm/hex_hpp.html">Header <boost/algorithm/hex.hpp></a></span></dt> +<dt><span class="section"><a href="../header/boost/algorithm/minmax_hpp.html">Header <boost/algorithm/minmax.hpp></a></span></dt> +<dt><span class="section"><a href="../header/boost/algorithm/minmax_element_hpp.html">Header <boost/algorithm/minmax_element.hpp></a></span></dt> +<dt><span class="section"><a href="../header/boost/algorithm/searching/boyer_moore_hpp.html">Header <boost/algorithm/searching/boyer_moore.hpp></a></span></dt> +<dt><span class="section"><a href="../header/boost/algorithm/searching/boyer_moore_horspool_hpp.html">Header <boost/algorithm/searching/boyer_moore_horspool.hpp></a></span></dt> +<dt><span class="section"><a href="../header/boost/algorithm/searching/knuth_morris_pratt_hpp.html">Header <boost/algorithm/searching/knuth_morris_pratt.hpp></a></span></dt> +<dt><span class="section"><a href="../header/boost/algorithm/string_hpp.html">Header <boost/algorithm/string.hpp></a></span></dt> +<dt><span class="section"><a href="../header/boost/algorithm/string_regex_hpp.html">Header <boost/algorithm/string_regex.hpp></a></span></dt> +</dl></div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="header.boost.algorithm.clamp_hpp"></a>Header <<a href="../../../../../boost/algorithm/clamp.hpp" target="_top">boost/algorithm/clamp.hpp</a>></h3></div></div></div> +<p>Clamp algorithm. </p> +<p>Marshall Clow</p> +<p> +Suggested by olafvdspek in <a href="https://svn.boost.org/trac/boost/ticket/3215" target="_top">https://svn.boost.org/trac/boost/ticket/3215</a> </p> +<pre class="synopsis"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> + <span class="keyword">namespace</span> <span class="identifier">algorithm</span> <span class="special">{</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="keyword">typename</span> Pred<span class="special">></span> + <span class="identifier">T</span> <span class="keyword">const</span> <span class="special">&</span> <a class="link" href="../boost/algorithm/clamp_id337250.html" title="Function template clamp"><span class="identifier">clamp</span></a><span class="special">(</span><span class="identifier">T</span> <span class="keyword">const</span> <span class="special">&</span><span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">identity</span><span class="special"><</span> <span class="identifier">T</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="special">&</span><span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">identity</span><span class="special"><</span> <span class="identifier">T</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">Pred</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">></span> + <span class="identifier">T</span> <span class="keyword">const</span> <span class="special">&</span> <a class="link" href="../boost/algorithm/clamp_id337315.html" title="Function template clamp"><span class="identifier">clamp</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">T</span> <span class="special">&</span><span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">identity</span><span class="special"><</span> <span class="identifier">T</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="special">&</span><span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">identity</span><span class="special"><</span> <span class="identifier">T</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">,</span> <span class="keyword">typename</span> OutputIterator<span class="special">></span> + <span class="identifier">OutputIterator</span> + <a class="link" href="../boost/algorithm/clamp_range_id337367.html" title="Function template clamp_range"><span class="identifier">clamp_range</span></a><span class="special">(</span><span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">OutputIterator</span><span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span> <span class="identifier">InputIterator</span> <span class="special">></span><span class="special">::</span><span class="identifier">value_type</span><span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span> <span class="identifier">InputIterator</span> <span class="special">></span><span class="special">::</span><span class="identifier">value_type</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Range<span class="special">,</span> <span class="keyword">typename</span> OutputIterator<span class="special">></span> + <span class="identifier">boost</span><span class="special">::</span><span class="identifier">disable_if_c</span><span class="special"><</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">is_same</span><span class="special"><</span> <span class="identifier">Range</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="special">></span><span class="special">::</span><span class="identifier">value</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> + <a class="link" href="../boost/algorithm/clamp_range_id337442.html" title="Function template clamp_range"><span class="identifier">clamp_range</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">OutputIterator</span><span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span> <span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <span class="special">></span><span class="special">::</span><span class="identifier">value_type</span><span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span> <span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <span class="special">></span><span class="special">::</span><span class="identifier">value_type</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">,</span> <span class="keyword">typename</span> OutputIterator<span class="special">,</span> <span class="keyword">typename</span> Pred<span class="special">></span> + <span class="identifier">OutputIterator</span> + <a class="link" href="../boost/algorithm/clamp_range_id337510.html" title="Function template clamp_range"><span class="identifier">clamp_range</span></a><span class="special">(</span><span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">OutputIterator</span><span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span> <span class="identifier">InputIterator</span> <span class="special">></span><span class="special">::</span><span class="identifier">value_type</span><span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span> <span class="identifier">InputIterator</span> <span class="special">></span><span class="special">::</span><span class="identifier">value_type</span><span class="special">,</span> + <span class="identifier">Pred</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Range<span class="special">,</span> <span class="keyword">typename</span> OutputIterator<span class="special">,</span> <span class="keyword">typename</span> Pred<span class="special">></span> + <span class="identifier">boost</span><span class="special">::</span><span class="identifier">disable_if_c</span><span class="special"><</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">is_same</span><span class="special"><</span> <span class="identifier">Range</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="special">></span><span class="special">::</span><span class="identifier">value</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> + <a class="link" href="../boost/algorithm/clamp_range_id337600.html" title="Function template clamp_range"><span class="identifier">clamp_range</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">OutputIterator</span><span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span> <span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <span class="special">></span><span class="special">::</span><span class="identifier">value_type</span><span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span> <span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <span class="special">></span><span class="special">::</span><span class="identifier">value_type</span><span class="special">,</span> + <span class="identifier">Pred</span><span class="special">)</span><span class="special">;</span> + <span class="special">}</span> +<span class="special">}</span></pre> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../the_boost_algorithm_library/Misc/hex.html"><img src="../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../boost/algorithm/clamp_id337250.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/boyer_moore.html b/libs/algorithm/doc/html/boost/algorithm/boyer_moore.html new file mode 100644 index 0000000000..30b94946c9 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/boyer_moore.html @@ -0,0 +1,84 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Class template boyer_moore</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/searching/boyer_moore_hpp.html" title="Header <boost/algorithm/searching/boyer_moore.hpp>"> +<link rel="prev" href="../../header/boost/algorithm/searching/boyer_moore_hpp.html" title="Header <boost/algorithm/searching/boyer_moore.hpp>"> +<link rel="next" href="boyer_moore_searc_id338832.html" title="Function template boyer_moore_search"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../header/boost/algorithm/searching/boyer_moore_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/searching/boyer_moore_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="boyer_moore_searc_id338832.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.boyer_moore"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Class template boyer_moore</span></h2> +<p>boost::algorithm::boyer_moore</p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../header/boost/algorithm/searching/boyer_moore_hpp.html" title="Header <boost/algorithm/searching/boyer_moore.hpp>">boost/algorithm/searching/boyer_moore.hpp</a>> + +</span><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> patIter<span class="special">,</span> <span class="keyword">typename</span> traits <span class="special">=</span> <span class="identifier">detail</span><span class="special">::</span><span class="identifier">BM_traits</span><span class="special"><</span><span class="identifier">patIter</span><span class="special">></span> <span class="special">></span> +<span class="keyword">class</span> <a class="link" href="boyer_moore.html" title="Class template boyer_moore">boyer_moore</a> <span class="special">{</span> +<span class="keyword">public</span><span class="special">:</span> + <span class="comment">// <a class="link" href="boyer_moore.html#boost.algorithm.boyer_mooreconstruct-copy-destruct">construct/copy/destruct</a></span> + <a class="link" href="boyer_moore.html#id338818-bb"><span class="identifier">boyer_moore</span></a><span class="special">(</span><span class="identifier">patIter</span><span class="special">,</span> <span class="identifier">patIter</span><span class="special">)</span><span class="special">;</span> + <a class="link" href="boyer_moore.html#id338831-bb"><span class="special">~</span><span class="identifier">boyer_moore</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span> + + <span class="comment">// <a class="link" href="boyer_moore.html#id338768-bb">public member functions</a></span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> corpusIter<span class="special">></span> + <span class="identifier">corpusIter</span> <a class="link" href="boyer_moore.html#id338772-bb"><span class="keyword">operator</span><span class="special">(</span><span class="special">)</span></a><span class="special">(</span><span class="identifier">corpusIter</span><span class="special">,</span> <span class="identifier">corpusIter</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Range<span class="special">></span> + <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span> <span class="identifier">Range</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <a class="link" href="boyer_moore.html#id338798-bb"><span class="keyword">operator</span><span class="special">(</span><span class="special">)</span></a><span class="special">(</span><span class="identifier">Range</span> <span class="special">&</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> +<span class="special">}</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="id795785"></a><h2>Description</h2> +<div class="refsect2"> +<a name="id795789"></a><h3> +<a name="boost.algorithm.boyer_mooreconstruct-copy-destruct"></a><code class="computeroutput">boyer_moore</code> + public + construct/copy/destruct</h3> +<div class="orderedlist"><ol class="orderedlist" type="1"> +<li class="listitem"><pre class="literallayout"><a name="id338818-bb"></a><span class="identifier">boyer_moore</span><span class="special">(</span><span class="identifier">patIter</span> first<span class="special">,</span> <span class="identifier">patIter</span> last<span class="special">)</span><span class="special">;</span></pre></li> +<li class="listitem"><pre class="literallayout"><a name="id338831-bb"></a><span class="special">~</span><span class="identifier">boyer_moore</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre></li> +</ol></div> +</div> +<div class="refsect2"> +<a name="id795888"></a><h3> +<a name="id338768-bb"></a><code class="computeroutput">boyer_moore</code> public member functions</h3> +<div class="orderedlist"><ol class="orderedlist" type="1"> +<li class="listitem"><pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> corpusIter<span class="special">></span> + <span class="identifier">corpusIter</span> <a name="id338772-bb"></a><span class="keyword">operator</span><span class="special">(</span><span class="special">)</span><span class="special">(</span><span class="identifier">corpusIter</span> corpus_first<span class="special">,</span> <span class="identifier">corpusIter</span> corpus_last<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre></li> +<li class="listitem"><pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Range<span class="special">></span> + <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span> <span class="identifier">Range</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <a name="id338798-bb"></a><span class="keyword">operator</span><span class="special">(</span><span class="special">)</span><span class="special">(</span><span class="identifier">Range</span> <span class="special">&</span> r<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre></li> +</ol></div> +</div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../header/boost/algorithm/searching/boyer_moore_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/searching/boyer_moore_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="boyer_moore_searc_id338832.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/boyer_moore_horsp_id339130.html b/libs/algorithm/doc/html/boost/algorithm/boyer_moore_horsp_id339130.html new file mode 100644 index 0000000000..a77ae3b701 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/boyer_moore_horsp_id339130.html @@ -0,0 +1,85 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template boyer_moore_horspool_search</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/searching/boyer_moore_horspool_hpp.html" title="Header <boost/algorithm/searching/boyer_moore_horspool.hpp>"> +<link rel="prev" href="boyer_moore_horspool.html" title="Class template boyer_moore_horspool"> +<link rel="next" href="../../header/boost/algorithm/searching/knuth_morris_pratt_hpp.html" title="Header <boost/algorithm/searching/knuth_morris_pratt.hpp>"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="boyer_moore_horspool.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/searching/boyer_moore_horspool_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../header/boost/algorithm/searching/knuth_morris_pratt_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.boyer_moore_horsp_id339130"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template boyer_moore_horspool_search</span></h2> +<p>boost::algorithm::boyer_moore_horspool_search — Searches the corpus for the pattern. </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../header/boost/algorithm/searching/boyer_moore_horspool_hpp.html" title="Header <boost/algorithm/searching/boyer_moore_horspool.hpp>">boost/algorithm/searching/boyer_moore_horspool.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> patIter<span class="special">,</span> <span class="keyword">typename</span> corpusIter<span class="special">></span> + <span class="identifier">corpusIter</span> <span class="identifier">boyer_moore_horspool_search</span><span class="special">(</span><span class="identifier">corpusIter</span> corpus_first<span class="special">,</span> + <span class="identifier">corpusIter</span> corpus_last<span class="special">,</span> + <span class="identifier">patIter</span> pat_first<span class="special">,</span> <span class="identifier">patIter</span> pat_last<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="id798111"></a><h2>Description</h2> +<p> +</p> +<div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody><tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">corpus_first</code></span></p></td> +<td><p>The start of the data to search (Random Access Iterator) </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">corpus_last</code></span></p></td> +<td><p>One past the end of the data to search </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">pat_first</code></span></p></td> +<td><p>The start of the pattern to search for (Random Access Iterator) </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">pat_last</code></span></p></td> +<td><p>One past the end of the data to search for </p></td> +</tr> +</tbody> +</table></div></td> +</tr></tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="boyer_moore_horspool.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/searching/boyer_moore_horspool_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../header/boost/algorithm/searching/knuth_morris_pratt_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/boyer_moore_horspool.html b/libs/algorithm/doc/html/boost/algorithm/boyer_moore_horspool.html new file mode 100644 index 0000000000..3132462f35 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/boyer_moore_horspool.html @@ -0,0 +1,84 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Class template boyer_moore_horspool</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/searching/boyer_moore_horspool_hpp.html" title="Header <boost/algorithm/searching/boyer_moore_horspool.hpp>"> +<link rel="prev" href="../../header/boost/algorithm/searching/boyer_moore_horspool_hpp.html" title="Header <boost/algorithm/searching/boyer_moore_horspool.hpp>"> +<link rel="next" href="boyer_moore_horsp_id339130.html" title="Function template boyer_moore_horspool_search"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../header/boost/algorithm/searching/boyer_moore_horspool_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/searching/boyer_moore_horspool_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="boyer_moore_horsp_id339130.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.boyer_moore_horspool"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Class template boyer_moore_horspool</span></h2> +<p>boost::algorithm::boyer_moore_horspool</p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../header/boost/algorithm/searching/boyer_moore_horspool_hpp.html" title="Header <boost/algorithm/searching/boyer_moore_horspool.hpp>">boost/algorithm/searching/boyer_moore_horspool.hpp</a>> + +</span><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> patIter<span class="special">,</span> <span class="keyword">typename</span> traits <span class="special">=</span> <span class="identifier">detail</span><span class="special">::</span><span class="identifier">BM_traits</span><span class="special"><</span><span class="identifier">patIter</span><span class="special">></span> <span class="special">></span> +<span class="keyword">class</span> <a class="link" href="boyer_moore_horspool.html" title="Class template boyer_moore_horspool">boyer_moore_horspool</a> <span class="special">{</span> +<span class="keyword">public</span><span class="special">:</span> + <span class="comment">// <a class="link" href="boyer_moore_horspool.html#boost.algorithm.boyer_moore_horspoolconstruct-copy-destruct">construct/copy/destruct</a></span> + <a class="link" href="boyer_moore_horspool.html#id339116-bb"><span class="identifier">boyer_moore_horspool</span></a><span class="special">(</span><span class="identifier">patIter</span><span class="special">,</span> <span class="identifier">patIter</span><span class="special">)</span><span class="special">;</span> + <a class="link" href="boyer_moore_horspool.html#id339129-bb"><span class="special">~</span><span class="identifier">boyer_moore_horspool</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span> + + <span class="comment">// <a class="link" href="boyer_moore_horspool.html#id339066-bb">public member functions</a></span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> corpusIter<span class="special">></span> + <span class="identifier">corpusIter</span> <a class="link" href="boyer_moore_horspool.html#id339070-bb"><span class="keyword">operator</span><span class="special">(</span><span class="special">)</span></a><span class="special">(</span><span class="identifier">corpusIter</span><span class="special">,</span> <span class="identifier">corpusIter</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Range<span class="special">></span> + <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span> <span class="identifier">Range</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <a class="link" href="boyer_moore_horspool.html#id339096-bb"><span class="keyword">operator</span><span class="special">(</span><span class="special">)</span></a><span class="special">(</span><span class="identifier">Range</span> <span class="special">&</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> +<span class="special">}</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="id797656"></a><h2>Description</h2> +<div class="refsect2"> +<a name="id797660"></a><h3> +<a name="boost.algorithm.boyer_moore_horspoolconstruct-copy-destruct"></a><code class="computeroutput">boyer_moore_horspool</code> + public + construct/copy/destruct</h3> +<div class="orderedlist"><ol class="orderedlist" type="1"> +<li class="listitem"><pre class="literallayout"><a name="id339116-bb"></a><span class="identifier">boyer_moore_horspool</span><span class="special">(</span><span class="identifier">patIter</span> first<span class="special">,</span> <span class="identifier">patIter</span> last<span class="special">)</span><span class="special">;</span></pre></li> +<li class="listitem"><pre class="literallayout"><a name="id339129-bb"></a><span class="special">~</span><span class="identifier">boyer_moore_horspool</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre></li> +</ol></div> +</div> +<div class="refsect2"> +<a name="id797759"></a><h3> +<a name="id339066-bb"></a><code class="computeroutput">boyer_moore_horspool</code> public member functions</h3> +<div class="orderedlist"><ol class="orderedlist" type="1"> +<li class="listitem"><pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> corpusIter<span class="special">></span> + <span class="identifier">corpusIter</span> <a name="id339070-bb"></a><span class="keyword">operator</span><span class="special">(</span><span class="special">)</span><span class="special">(</span><span class="identifier">corpusIter</span> corpus_first<span class="special">,</span> <span class="identifier">corpusIter</span> corpus_last<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre></li> +<li class="listitem"><pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Range<span class="special">></span> + <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span> <span class="identifier">Range</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <a name="id339096-bb"></a><span class="keyword">operator</span><span class="special">(</span><span class="special">)</span><span class="special">(</span><span class="identifier">Range</span> <span class="special">&</span> r<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre></li> +</ol></div> +</div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../header/boost/algorithm/searching/boyer_moore_horspool_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/searching/boyer_moore_horspool_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="boyer_moore_horsp_id339130.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/boyer_moore_searc_id338832.html b/libs/algorithm/doc/html/boost/algorithm/boyer_moore_searc_id338832.html new file mode 100644 index 0000000000..260034555c --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/boyer_moore_searc_id338832.html @@ -0,0 +1,85 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template boyer_moore_search</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/searching/boyer_moore_hpp.html" title="Header <boost/algorithm/searching/boyer_moore.hpp>"> +<link rel="prev" href="boyer_moore.html" title="Class template boyer_moore"> +<link rel="next" href="../../header/boost/algorithm/searching/boyer_moore_horspool_hpp.html" title="Header <boost/algorithm/searching/boyer_moore_horspool.hpp>"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="boyer_moore.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/searching/boyer_moore_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../header/boost/algorithm/searching/boyer_moore_horspool_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.boyer_moore_searc_id338832"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template boyer_moore_search</span></h2> +<p>boost::algorithm::boyer_moore_search — Searches the corpus for the pattern. </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../header/boost/algorithm/searching/boyer_moore_hpp.html" title="Header <boost/algorithm/searching/boyer_moore.hpp>">boost/algorithm/searching/boyer_moore.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> patIter<span class="special">,</span> <span class="keyword">typename</span> corpusIter<span class="special">></span> + <span class="identifier">corpusIter</span> <span class="identifier">boyer_moore_search</span><span class="special">(</span><span class="identifier">corpusIter</span> corpus_first<span class="special">,</span> + <span class="identifier">corpusIter</span> corpus_last<span class="special">,</span> <span class="identifier">patIter</span> pat_first<span class="special">,</span> + <span class="identifier">patIter</span> pat_last<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="id796240"></a><h2>Description</h2> +<p> +</p> +<div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody><tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">corpus_first</code></span></p></td> +<td><p>The start of the data to search (Random Access Iterator) </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">corpus_last</code></span></p></td> +<td><p>One past the end of the data to search </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">pat_first</code></span></p></td> +<td><p>The start of the pattern to search for (Random Access Iterator) </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">pat_last</code></span></p></td> +<td><p>One past the end of the data to search for </p></td> +</tr> +</tbody> +</table></div></td> +</tr></tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="boyer_moore.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/searching/boyer_moore_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../header/boost/algorithm/searching/boyer_moore_horspool_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/clamp_id337250.html b/libs/algorithm/doc/html/boost/algorithm/clamp_id337250.html new file mode 100644 index 0000000000..c10cb97d41 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/clamp_id337250.html @@ -0,0 +1,93 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template clamp</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../algorithm/reference.html#header.boost.algorithm.clamp_hpp" title="Header <boost/algorithm/clamp.hpp>"> +<link rel="prev" href="../../algorithm/reference.html" title="Reference"> +<link rel="next" href="clamp_id337315.html" title="Function template clamp"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../algorithm/reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/reference.html#header.boost.algorithm.clamp_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="clamp_id337315.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.clamp_id337250"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template clamp</span></h2> +<p>boost::algorithm::clamp</p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../algorithm/reference.html#header.boost.algorithm.clamp_hpp" title="Header <boost/algorithm/clamp.hpp>">boost/algorithm/clamp.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="keyword">typename</span> Pred<span class="special">></span> + <span class="identifier">T</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">clamp</span><span class="special">(</span><span class="identifier">T</span> <span class="keyword">const</span> <span class="special">&</span> val<span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">identity</span><span class="special"><</span> <span class="identifier">T</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="special">&</span> lo<span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">identity</span><span class="special"><</span> <span class="identifier">T</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="special">&</span> hi<span class="special">,</span> + <span class="identifier">Pred</span> p<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="id787750"></a><h2>Description</h2> +<p> + +</p> +<div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">hi</code></span></p></td> +<td><p>The upper bound of the range to be clamped to </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">lo</code></span></p></td> +<td><p>The lower bound of the range to be clamped to </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">p</code></span></p></td> +<td><p>A predicate to use to compare the values. p ( a, b ) returns a boolean. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">val</code></span></p></td> +<td><p>The value to be clamped </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>the value "val" brought into the range [ lo, hi ] using the comparison predicate p. If p ( val, lo ) return lo. If p ( hi, val ) return hi. Otherwise, return the original value.</p></td> +</tr> +</tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../algorithm/reference.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/reference.html#header.boost.algorithm.clamp_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="clamp_id337315.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/clamp_id337315.html b/libs/algorithm/doc/html/boost/algorithm/clamp_id337315.html new file mode 100644 index 0000000000..99f34c953c --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/clamp_id337315.html @@ -0,0 +1,88 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template clamp</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../algorithm/reference.html#header.boost.algorithm.clamp_hpp" title="Header <boost/algorithm/clamp.hpp>"> +<link rel="prev" href="clamp_id337250.html" title="Function template clamp"> +<link rel="next" href="clamp_range_id337367.html" title="Function template clamp_range"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="clamp_id337250.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/reference.html#header.boost.algorithm.clamp_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="clamp_range_id337367.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.clamp_id337315"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template clamp</span></h2> +<p>boost::algorithm::clamp</p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../algorithm/reference.html#header.boost.algorithm.clamp_hpp" title="Header <boost/algorithm/clamp.hpp>">boost/algorithm/clamp.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">></span> + <span class="identifier">T</span> <span class="keyword">const</span> <span class="special">&</span> <span class="identifier">clamp</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">T</span> <span class="special">&</span> val<span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">identity</span><span class="special"><</span> <span class="identifier">T</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="special">&</span> lo<span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">mpl</span><span class="special">::</span><span class="identifier">identity</span><span class="special"><</span> <span class="identifier">T</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <span class="keyword">const</span> <span class="special">&</span> hi<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="id788069"></a><h2>Description</h2> +<p> + +</p> +<div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">hi</code></span></p></td> +<td><p>The upper bound of the range to be clamped to </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">lo</code></span></p></td> +<td><p>The lower bound of the range to be clamped to </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">val</code></span></p></td> +<td><p>The value to be clamped </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>the value "val" brought into the range [ lo, hi ]. If the value is less than lo, return lo. If the value is greater than "hi", return hi. Otherwise, return the original value.</p></td> +</tr> +</tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="clamp_id337250.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/reference.html#header.boost.algorithm.clamp_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="clamp_range_id337367.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/clamp_range_id337367.html b/libs/algorithm/doc/html/boost/algorithm/clamp_range_id337367.html new file mode 100644 index 0000000000..391ae1edd3 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/clamp_range_id337367.html @@ -0,0 +1,97 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template clamp_range</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../algorithm/reference.html#header.boost.algorithm.clamp_hpp" title="Header <boost/algorithm/clamp.hpp>"> +<link rel="prev" href="clamp_id337315.html" title="Function template clamp"> +<link rel="next" href="clamp_range_id337442.html" title="Function template clamp_range"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="clamp_id337315.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/reference.html#header.boost.algorithm.clamp_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="clamp_range_id337442.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.clamp_range_id337367"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template clamp_range</span></h2> +<p>boost::algorithm::clamp_range</p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../algorithm/reference.html#header.boost.algorithm.clamp_hpp" title="Header <boost/algorithm/clamp.hpp>">boost/algorithm/clamp.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">,</span> <span class="keyword">typename</span> OutputIterator<span class="special">></span> + <span class="identifier">OutputIterator</span> + <span class="identifier">clamp_range</span><span class="special">(</span><span class="identifier">InputIterator</span> first<span class="special">,</span> <span class="identifier">InputIterator</span> last<span class="special">,</span> <span class="identifier">OutputIterator</span> out<span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span> <span class="identifier">InputIterator</span> <span class="special">></span><span class="special">::</span><span class="identifier">value_type</span> lo<span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span> <span class="identifier">InputIterator</span> <span class="special">></span><span class="special">::</span><span class="identifier">value_type</span> hi<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="id788348"></a><h2>Description</h2> +<p> + +</p> +<div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first</code></span></p></td> +<td><p>The start of the range of values </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">hi</code></span></p></td> +<td><p>The upper bound of the range to be clamped to </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last</code></span></p></td> +<td><p>One past the end of the range of input values </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">lo</code></span></p></td> +<td><p>The lower bound of the range to be clamped to </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">out</code></span></p></td> +<td><p>An output iterator to write the clamped values into </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>clamp the sequence of values [first, last) into [ lo, hi ]</p></td> +</tr> +</tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="clamp_id337315.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/reference.html#header.boost.algorithm.clamp_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="clamp_range_id337442.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/clamp_range_id337442.html b/libs/algorithm/doc/html/boost/algorithm/clamp_range_id337442.html new file mode 100644 index 0000000000..239fc3e699 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/clamp_range_id337442.html @@ -0,0 +1,93 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template clamp_range</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../algorithm/reference.html#header.boost.algorithm.clamp_hpp" title="Header <boost/algorithm/clamp.hpp>"> +<link rel="prev" href="clamp_range_id337367.html" title="Function template clamp_range"> +<link rel="next" href="clamp_range_id337510.html" title="Function template clamp_range"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="clamp_range_id337367.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/reference.html#header.boost.algorithm.clamp_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="clamp_range_id337510.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.clamp_range_id337442"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template clamp_range</span></h2> +<p>boost::algorithm::clamp_range</p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../algorithm/reference.html#header.boost.algorithm.clamp_hpp" title="Header <boost/algorithm/clamp.hpp>">boost/algorithm/clamp.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Range<span class="special">,</span> <span class="keyword">typename</span> OutputIterator<span class="special">></span> + <span class="identifier">boost</span><span class="special">::</span><span class="identifier">disable_if_c</span><span class="special"><</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">is_same</span><span class="special"><</span> <span class="identifier">Range</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="special">></span><span class="special">::</span><span class="identifier">value</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> + <span class="identifier">clamp_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span> r<span class="special">,</span> <span class="identifier">OutputIterator</span> out<span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span> <span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <span class="special">></span><span class="special">::</span><span class="identifier">value_type</span> lo<span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span> <span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <span class="special">></span><span class="special">::</span><span class="identifier">value_type</span> hi<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="id788822"></a><h2>Description</h2> +<p> + +</p> +<div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">hi</code></span></p></td> +<td><p>The upper bound of the range to be clamped to </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">lo</code></span></p></td> +<td><p>The lower bound of the range to be clamped to </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">out</code></span></p></td> +<td><p>An output iterator to write the clamped values into </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">r</code></span></p></td> +<td><p>The range of values to be clamped </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>clamp the sequence of values [first, last) into [ lo, hi ]</p></td> +</tr> +</tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="clamp_range_id337367.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/reference.html#header.boost.algorithm.clamp_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="clamp_range_id337510.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/clamp_range_id337510.html b/libs/algorithm/doc/html/boost/algorithm/clamp_range_id337510.html new file mode 100644 index 0000000000..cf7e36b360 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/clamp_range_id337510.html @@ -0,0 +1,102 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template clamp_range</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../algorithm/reference.html#header.boost.algorithm.clamp_hpp" title="Header <boost/algorithm/clamp.hpp>"> +<link rel="prev" href="clamp_range_id337442.html" title="Function template clamp_range"> +<link rel="next" href="clamp_range_id337600.html" title="Function template clamp_range"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="clamp_range_id337442.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/reference.html#header.boost.algorithm.clamp_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="clamp_range_id337600.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.clamp_range_id337510"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template clamp_range</span></h2> +<p>boost::algorithm::clamp_range</p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../algorithm/reference.html#header.boost.algorithm.clamp_hpp" title="Header <boost/algorithm/clamp.hpp>">boost/algorithm/clamp.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">,</span> <span class="keyword">typename</span> OutputIterator<span class="special">,</span> <span class="keyword">typename</span> Pred<span class="special">></span> + <span class="identifier">OutputIterator</span> + <span class="identifier">clamp_range</span><span class="special">(</span><span class="identifier">InputIterator</span> first<span class="special">,</span> <span class="identifier">InputIterator</span> last<span class="special">,</span> <span class="identifier">OutputIterator</span> out<span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span> <span class="identifier">InputIterator</span> <span class="special">></span><span class="special">::</span><span class="identifier">value_type</span> lo<span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span> <span class="identifier">InputIterator</span> <span class="special">></span><span class="special">::</span><span class="identifier">value_type</span> hi<span class="special">,</span> + <span class="identifier">Pred</span> p<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="id789132"></a><h2>Description</h2> +<p> + +</p> +<div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first</code></span></p></td> +<td><p>The start of the range of values </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">hi</code></span></p></td> +<td><p>The upper bound of the range to be clamped to </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last</code></span></p></td> +<td><p>One past the end of the range of input values </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">lo</code></span></p></td> +<td><p>The lower bound of the range to be clamped to </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">out</code></span></p></td> +<td><p>An output iterator to write the clamped values into </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">p</code></span></p></td> +<td><p>A predicate to use to compare the values. p ( a, b ) returns a boolean. </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>clamp the sequence of values [first, last) into [ lo, hi ] using the comparison predicate p.</p></td> +</tr> +</tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="clamp_range_id337442.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/reference.html#header.boost.algorithm.clamp_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="clamp_range_id337600.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/clamp_range_id337600.html b/libs/algorithm/doc/html/boost/algorithm/clamp_range_id337600.html new file mode 100644 index 0000000000..5f804802f9 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/clamp_range_id337600.html @@ -0,0 +1,98 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template clamp_range</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../algorithm/reference.html#header.boost.algorithm.clamp_hpp" title="Header <boost/algorithm/clamp.hpp>"> +<link rel="prev" href="clamp_range_id337510.html" title="Function template clamp_range"> +<link rel="next" href="../../header/boost/algorithm/hex_hpp.html" title="Header <boost/algorithm/hex.hpp>"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="clamp_range_id337510.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/reference.html#header.boost.algorithm.clamp_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../header/boost/algorithm/hex_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.clamp_range_id337600"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template clamp_range</span></h2> +<p>boost::algorithm::clamp_range</p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../algorithm/reference.html#header.boost.algorithm.clamp_hpp" title="Header <boost/algorithm/clamp.hpp>">boost/algorithm/clamp.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Range<span class="special">,</span> <span class="keyword">typename</span> OutputIterator<span class="special">,</span> <span class="keyword">typename</span> Pred<span class="special">></span> + <span class="identifier">boost</span><span class="special">::</span><span class="identifier">disable_if_c</span><span class="special"><</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">is_same</span><span class="special"><</span> <span class="identifier">Range</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="special">></span><span class="special">::</span><span class="identifier">value</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> + <span class="identifier">clamp_range</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span> r<span class="special">,</span> <span class="identifier">OutputIterator</span> out<span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span> <span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <span class="special">></span><span class="special">::</span><span class="identifier">value_type</span> lo<span class="special">,</span> + <span class="keyword">typename</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span> <span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <span class="special">></span><span class="special">::</span><span class="identifier">value_type</span> hi<span class="special">,</span> + <span class="identifier">Pred</span> p<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="id789639"></a><h2>Description</h2> +<p> + +</p> +<div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">hi</code></span></p></td> +<td><p>The upper bound of the range to be clamped to </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">lo</code></span></p></td> +<td><p>The lower bound of the range to be clamped to </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">out</code></span></p></td> +<td><p>An output iterator to write the clamped values into </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">p</code></span></p></td> +<td><p>A predicate to use to compare the values. p ( a, b ) returns a boolean. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">r</code></span></p></td> +<td><p>The range of values to be clamped </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>clamp the sequence of values [first, last) into [ lo, hi ] using the comparison predicate p.</p></td> +</tr> +</tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="clamp_range_id337510.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/reference.html#header.boost.algorithm.clamp_hpp"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../header/boost/algorithm/hex_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/hex_decode_error.html b/libs/algorithm/doc/html/boost/algorithm/hex_decode_error.html new file mode 100644 index 0000000000..7b62aeab21 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/hex_decode_error.html @@ -0,0 +1,51 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Struct hex_decode_error</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/hex_hpp.html" title="Header <boost/algorithm/hex.hpp>"> +<link rel="prev" href="../../header/boost/algorithm/hex_hpp.html" title="Header <boost/algorithm/hex.hpp>"> +<link rel="next" href="not_enough_input.html" title="Struct not_enough_input"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../header/boost/algorithm/hex_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/hex_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="not_enough_input.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.hex_decode_error"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Struct hex_decode_error</span></h2> +<p>boost::algorithm::hex_decode_error — Base exception class for all hex decoding errors. </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../header/boost/algorithm/hex_hpp.html" title="Header <boost/algorithm/hex.hpp>">boost/algorithm/hex.hpp</a>> + +</span> +<span class="keyword">struct</span> <a class="link" href="hex_decode_error.html" title="Struct hex_decode_error">hex_decode_error</a> <span class="special">{</span> +<span class="special">}</span><span class="special">;</span></pre></div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../header/boost/algorithm/hex_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/hex_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="not_enough_input.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/hex_id337739.html b/libs/algorithm/doc/html/boost/algorithm/hex_id337739.html new file mode 100644 index 0000000000..adebd33adc --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/hex_id337739.html @@ -0,0 +1,95 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template hex</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/hex_hpp.html" title="Header <boost/algorithm/hex.hpp>"> +<link rel="prev" href="non_hex_input.html" title="Struct non_hex_input"> +<link rel="next" href="hex_id337802.html" title="Function template hex"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="non_hex_input.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/hex_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="hex_id337802.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.hex_id337739"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template hex</span></h2> +<p>boost::algorithm::hex — Converts a sequence of integral types into a hexadecimal sequence of characters. </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../header/boost/algorithm/hex_hpp.html" title="Header <boost/algorithm/hex.hpp>">boost/algorithm/hex.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">,</span> <span class="keyword">typename</span> OutputIterator<span class="special">></span> + <span class="emphasis"><em><span class="identifier">unspecified</span></em></span> <span class="identifier">hex</span><span class="special">(</span><span class="identifier">InputIterator</span> first<span class="special">,</span> <span class="identifier">InputIterator</span> last<span class="special">,</span> <span class="identifier">OutputIterator</span> out<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="id791019"></a><h2>Description</h2> +<p> + +</p> +<div class="note"><table border="0" summary="Note"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td> +<th align="left">Note</th> +</tr> +<tr><td align="left" valign="top"><p>Based on the MySQL function of the same name </p></td></tr> +</table></div> +<p> +</p> +<div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first</code></span></p></td> +<td><p>The start of the input sequence </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last</code></span></p></td> +<td><p>One past the end of the input sequence </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">out</code></span></p></td> +<td><p>An output iterator to the results into </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>The updated output iterator </p></td> +</tr> +</tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="non_hex_input.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/hex_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="hex_id337802.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/hex_id337802.html b/libs/algorithm/doc/html/boost/algorithm/hex_id337802.html new file mode 100644 index 0000000000..0ffb34b619 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/hex_id337802.html @@ -0,0 +1,92 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template hex</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/hex_hpp.html" title="Header <boost/algorithm/hex.hpp>"> +<link rel="prev" href="hex_id337739.html" title="Function template hex"> +<link rel="next" href="hex_id337856.html" title="Function template hex"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="hex_id337739.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/hex_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="hex_id337856.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.hex_id337802"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template hex</span></h2> +<p>boost::algorithm::hex — Converts a sequence of integral types into a hexadecimal sequence of characters. </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../header/boost/algorithm/hex_hpp.html" title="Header <boost/algorithm/hex.hpp>">boost/algorithm/hex.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="keyword">typename</span> OutputIterator<span class="special">></span> + <span class="identifier">boost</span><span class="special">::</span><span class="identifier">enable_if</span><span class="special"><</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">is_integral</span><span class="special"><</span> <span class="identifier">T</span> <span class="special">></span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> + <span class="identifier">hex</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">T</span> <span class="special">*</span> ptr<span class="special">,</span> <span class="identifier">OutputIterator</span> out<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="id791270"></a><h2>Description</h2> +<p> + +</p> +<div class="note"><table border="0" summary="Note"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td> +<th align="left">Note</th> +</tr> +<tr><td align="left" valign="top"><p>Based on the MySQL function of the same name </p></td></tr> +</table></div> +<p> +</p> +<div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">out</code></span></p></td> +<td><p>An output iterator to the results into </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">ptr</code></span></p></td> +<td><p>A pointer to a 0-terminated sequence of data. </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>The updated output iterator </p></td> +</tr> +</tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="hex_id337739.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/hex_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="hex_id337856.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/hex_id337856.html b/libs/algorithm/doc/html/boost/algorithm/hex_id337856.html new file mode 100644 index 0000000000..b78f72f809 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/hex_id337856.html @@ -0,0 +1,91 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template hex</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/hex_hpp.html" title="Header <boost/algorithm/hex.hpp>"> +<link rel="prev" href="hex_id337802.html" title="Function template hex"> +<link rel="next" href="unhex_id337909.html" title="Function template unhex"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="hex_id337802.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/hex_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unhex_id337909.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.hex_id337856"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template hex</span></h2> +<p>boost::algorithm::hex — Converts a sequence of integral types into a hexadecimal sequence of characters. </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../header/boost/algorithm/hex_hpp.html" title="Header <boost/algorithm/hex.hpp>">boost/algorithm/hex.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Range<span class="special">,</span> <span class="keyword">typename</span> OutputIterator<span class="special">></span> + <span class="emphasis"><em><span class="identifier">unspecified</span></em></span> <span class="identifier">hex</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span> r<span class="special">,</span> <span class="identifier">OutputIterator</span> out<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="id791444"></a><h2>Description</h2> +<p> + +</p> +<div class="note"><table border="0" summary="Note"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td> +<th align="left">Note</th> +</tr> +<tr><td align="left" valign="top"><p>Based on the MySQL function of the same name </p></td></tr> +</table></div> +<p> +</p> +<div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">out</code></span></p></td> +<td><p>An output iterator to the results into </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">r</code></span></p></td> +<td><p>The input range </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>The updated output iterator </p></td> +</tr> +</tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="hex_id337802.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/hex_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unhex_id337909.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/hex_id338075.html b/libs/algorithm/doc/html/boost/algorithm/hex_id338075.html new file mode 100644 index 0000000000..6be71ee6be --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/hex_id338075.html @@ -0,0 +1,75 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template hex</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/hex_hpp.html" title="Header <boost/algorithm/hex.hpp>"> +<link rel="prev" href="unhex_id338023.html" title="Function template unhex"> +<link rel="next" href="unhex_id338108.html" title="Function template unhex"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="unhex_id338023.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/hex_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unhex_id338108.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.hex_id338075"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template hex</span></h2> +<p>boost::algorithm::hex — Converts a sequence of integral types into a hexadecimal sequence of characters. </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../header/boost/algorithm/hex_hpp.html" title="Header <boost/algorithm/hex.hpp>">boost/algorithm/hex.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> String<span class="special">></span> <span class="identifier">String</span> <span class="identifier">hex</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">String</span> <span class="special">&</span> input<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="id792125"></a><h2>Description</h2> +<p> + +</p> +<div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody><tr> +<td><p><span class="term"><code class="computeroutput">input</code></span></p></td> +<td><p>A container to be converted </p></td> +</tr></tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>A container with the encoded text </p></td> +</tr> +</tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="unhex_id338023.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/hex_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unhex_id338108.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/knuth_morris_prat_id339421.html b/libs/algorithm/doc/html/boost/algorithm/knuth_morris_prat_id339421.html new file mode 100644 index 0000000000..cb2f3f5a98 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/knuth_morris_prat_id339421.html @@ -0,0 +1,85 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template knuth_morris_pratt_search</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/searching/knuth_morris_pratt_hpp.html" title="Header <boost/algorithm/searching/knuth_morris_pratt.hpp>"> +<link rel="prev" href="knuth_morris_pratt.html" title="Class template knuth_morris_pratt"> +<link rel="next" href="../../header/boost/algorithm/string_hpp.html" title="Header <boost/algorithm/string.hpp>"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="knuth_morris_pratt.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/searching/knuth_morris_pratt_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../header/boost/algorithm/string_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.knuth_morris_prat_id339421"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template knuth_morris_pratt_search</span></h2> +<p>boost::algorithm::knuth_morris_pratt_search — Searches the corpus for the pattern. </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../header/boost/algorithm/searching/knuth_morris_pratt_hpp.html" title="Header <boost/algorithm/searching/knuth_morris_pratt.hpp>">boost/algorithm/searching/knuth_morris_pratt.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> patIter<span class="special">,</span> <span class="keyword">typename</span> corpusIter<span class="special">></span> + <span class="identifier">corpusIter</span> <span class="identifier">knuth_morris_pratt_search</span><span class="special">(</span><span class="identifier">corpusIter</span> corpus_first<span class="special">,</span> + <span class="identifier">corpusIter</span> corpus_last<span class="special">,</span> + <span class="identifier">patIter</span> pat_first<span class="special">,</span> <span class="identifier">patIter</span> pat_last<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="id799894"></a><h2>Description</h2> +<p> +</p> +<div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody><tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">corpus_first</code></span></p></td> +<td><p>The start of the data to search (Random Access Iterator) </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">corpus_last</code></span></p></td> +<td><p>One past the end of the data to search </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">pat_first</code></span></p></td> +<td><p>The start of the pattern to search for (Random Access Iterator) </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">pat_last</code></span></p></td> +<td><p>One past the end of the data to search for </p></td> +</tr> +</tbody> +</table></div></td> +</tr></tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="knuth_morris_pratt.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/searching/knuth_morris_pratt_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../header/boost/algorithm/string_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/knuth_morris_pratt.html b/libs/algorithm/doc/html/boost/algorithm/knuth_morris_pratt.html new file mode 100644 index 0000000000..52f4ea65d6 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/knuth_morris_pratt.html @@ -0,0 +1,84 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Class template knuth_morris_pratt</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/searching/knuth_morris_pratt_hpp.html" title="Header <boost/algorithm/searching/knuth_morris_pratt.hpp>"> +<link rel="prev" href="../../header/boost/algorithm/searching/knuth_morris_pratt_hpp.html" title="Header <boost/algorithm/searching/knuth_morris_pratt.hpp>"> +<link rel="next" href="knuth_morris_prat_id339421.html" title="Function template knuth_morris_pratt_search"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../header/boost/algorithm/searching/knuth_morris_pratt_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/searching/knuth_morris_pratt_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="knuth_morris_prat_id339421.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.knuth_morris_pratt"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Class template knuth_morris_pratt</span></h2> +<p>boost::algorithm::knuth_morris_pratt</p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../header/boost/algorithm/searching/knuth_morris_pratt_hpp.html" title="Header <boost/algorithm/searching/knuth_morris_pratt.hpp>">boost/algorithm/searching/knuth_morris_pratt.hpp</a>> + +</span><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> patIter<span class="special">></span> +<span class="keyword">class</span> <a class="link" href="knuth_morris_pratt.html" title="Class template knuth_morris_pratt">knuth_morris_pratt</a> <span class="special">{</span> +<span class="keyword">public</span><span class="special">:</span> + <span class="comment">// <a class="link" href="knuth_morris_pratt.html#boost.algorithm.knuth_morris_prattconstruct-copy-destruct">construct/copy/destruct</a></span> + <a class="link" href="knuth_morris_pratt.html#id339408-bb"><span class="identifier">knuth_morris_pratt</span></a><span class="special">(</span><span class="identifier">patIter</span><span class="special">,</span> <span class="identifier">patIter</span><span class="special">)</span><span class="special">;</span> + <a class="link" href="knuth_morris_pratt.html#id339420-bb"><span class="special">~</span><span class="identifier">knuth_morris_pratt</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span> + + <span class="comment">// <a class="link" href="knuth_morris_pratt.html#id339357-bb">public member functions</a></span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> corpusIter<span class="special">></span> + <span class="identifier">corpusIter</span> <a class="link" href="knuth_morris_pratt.html#id339361-bb"><span class="keyword">operator</span><span class="special">(</span><span class="special">)</span></a><span class="special">(</span><span class="identifier">corpusIter</span><span class="special">,</span> <span class="identifier">corpusIter</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Range<span class="special">></span> + <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span> <span class="identifier">Range</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <a class="link" href="knuth_morris_pratt.html#id339387-bb"><span class="keyword">operator</span><span class="special">(</span><span class="special">)</span></a><span class="special">(</span><span class="identifier">Range</span> <span class="special">&</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span> +<span class="special">}</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="id799438"></a><h2>Description</h2> +<div class="refsect2"> +<a name="id799442"></a><h3> +<a name="boost.algorithm.knuth_morris_prattconstruct-copy-destruct"></a><code class="computeroutput">knuth_morris_pratt</code> + public + construct/copy/destruct</h3> +<div class="orderedlist"><ol class="orderedlist" type="1"> +<li class="listitem"><pre class="literallayout"><a name="id339408-bb"></a><span class="identifier">knuth_morris_pratt</span><span class="special">(</span><span class="identifier">patIter</span> first<span class="special">,</span> <span class="identifier">patIter</span> last<span class="special">)</span><span class="special">;</span></pre></li> +<li class="listitem"><pre class="literallayout"><a name="id339420-bb"></a><span class="special">~</span><span class="identifier">knuth_morris_pratt</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre></li> +</ol></div> +</div> +<div class="refsect2"> +<a name="id799541"></a><h3> +<a name="id339357-bb"></a><code class="computeroutput">knuth_morris_pratt</code> public member functions</h3> +<div class="orderedlist"><ol class="orderedlist" type="1"> +<li class="listitem"><pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> corpusIter<span class="special">></span> + <span class="identifier">corpusIter</span> <a name="id339361-bb"></a><span class="keyword">operator</span><span class="special">(</span><span class="special">)</span><span class="special">(</span><span class="identifier">corpusIter</span> corpus_first<span class="special">,</span> <span class="identifier">corpusIter</span> corpus_last<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre></li> +<li class="listitem"><pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Range<span class="special">></span> + <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span> <span class="identifier">Range</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <a name="id339387-bb"></a><span class="keyword">operator</span><span class="special">(</span><span class="special">)</span><span class="special">(</span><span class="identifier">Range</span> <span class="special">&</span> r<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre></li> +</ol></div> +</div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../header/boost/algorithm/searching/knuth_morris_pratt_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/searching/knuth_morris_pratt_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="knuth_morris_prat_id339421.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/non_hex_input.html b/libs/algorithm/doc/html/boost/algorithm/non_hex_input.html new file mode 100644 index 0000000000..199a29b56f --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/non_hex_input.html @@ -0,0 +1,51 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Struct non_hex_input</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/hex_hpp.html" title="Header <boost/algorithm/hex.hpp>"> +<link rel="prev" href="not_enough_input.html" title="Struct not_enough_input"> +<link rel="next" href="hex_id337739.html" title="Function template hex"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="not_enough_input.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/hex_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="hex_id337739.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.non_hex_input"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Struct non_hex_input</span></h2> +<p>boost::algorithm::non_hex_input — Thrown when a non-hex value (0-9, A-F) encountered when decoding. Contains the offending character. </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../header/boost/algorithm/hex_hpp.html" title="Header <boost/algorithm/hex.hpp>">boost/algorithm/hex.hpp</a>> + +</span> +<span class="keyword">struct</span> <a class="link" href="non_hex_input.html" title="Struct non_hex_input">non_hex_input</a> <span class="special">:</span> <span class="keyword">public</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">algorithm</span><span class="special">::</span><span class="identifier">hex_decode_error</span> <span class="special">{</span> +<span class="special">}</span><span class="special">;</span></pre></div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="not_enough_input.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/hex_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="hex_id337739.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/not_enough_input.html b/libs/algorithm/doc/html/boost/algorithm/not_enough_input.html new file mode 100644 index 0000000000..7a3fc56df0 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/not_enough_input.html @@ -0,0 +1,51 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Struct not_enough_input</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/hex_hpp.html" title="Header <boost/algorithm/hex.hpp>"> +<link rel="prev" href="hex_decode_error.html" title="Struct hex_decode_error"> +<link rel="next" href="non_hex_input.html" title="Struct non_hex_input"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="hex_decode_error.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/hex_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="non_hex_input.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.not_enough_input"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Struct not_enough_input</span></h2> +<p>boost::algorithm::not_enough_input — Thrown when the input sequence unexpectedly ends. </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../header/boost/algorithm/hex_hpp.html" title="Header <boost/algorithm/hex.hpp>">boost/algorithm/hex.hpp</a>> + +</span> +<span class="keyword">struct</span> <a class="link" href="not_enough_input.html" title="Struct not_enough_input">not_enough_input</a> <span class="special">:</span> <span class="keyword">public</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">algorithm</span><span class="special">::</span><span class="identifier">hex_decode_error</span> <span class="special">{</span> +<span class="special">}</span><span class="special">;</span></pre></div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="hex_decode_error.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/hex_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="non_hex_input.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/unhex_id337909.html b/libs/algorithm/doc/html/boost/algorithm/unhex_id337909.html new file mode 100644 index 0000000000..0e63ffe92d --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/unhex_id337909.html @@ -0,0 +1,96 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template unhex</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/hex_hpp.html" title="Header <boost/algorithm/hex.hpp>"> +<link rel="prev" href="hex_id337856.html" title="Function template hex"> +<link rel="next" href="unhex_id337971.html" title="Function template unhex"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="hex_id337856.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/hex_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unhex_id337971.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.unhex_id337909"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template unhex</span></h2> +<p>boost::algorithm::unhex — Converts a sequence of hexadecimal characters into a sequence of integers. </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../header/boost/algorithm/hex_hpp.html" title="Header <boost/algorithm/hex.hpp>">boost/algorithm/hex.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">,</span> <span class="keyword">typename</span> OutputIterator<span class="special">></span> + <span class="identifier">OutputIterator</span> + <span class="identifier">unhex</span><span class="special">(</span><span class="identifier">InputIterator</span> first<span class="special">,</span> <span class="identifier">InputIterator</span> last<span class="special">,</span> <span class="identifier">OutputIterator</span> out<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="id791618"></a><h2>Description</h2> +<p> + +</p> +<div class="note"><table border="0" summary="Note"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td> +<th align="left">Note</th> +</tr> +<tr><td align="left" valign="top"><p>Based on the MySQL function of the same name </p></td></tr> +</table></div> +<p> +</p> +<div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first</code></span></p></td> +<td><p>The start of the input sequence </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last</code></span></p></td> +<td><p>One past the end of the input sequence </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">out</code></span></p></td> +<td><p>An output iterator to the results into </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>The updated output iterator </p></td> +</tr> +</tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="hex_id337856.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/hex_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unhex_id337971.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/unhex_id337971.html b/libs/algorithm/doc/html/boost/algorithm/unhex_id337971.html new file mode 100644 index 0000000000..42729eda3d --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/unhex_id337971.html @@ -0,0 +1,91 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template unhex</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/hex_hpp.html" title="Header <boost/algorithm/hex.hpp>"> +<link rel="prev" href="unhex_id337909.html" title="Function template unhex"> +<link rel="next" href="unhex_id338023.html" title="Function template unhex"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="unhex_id337909.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/hex_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unhex_id338023.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.unhex_id337971"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template unhex</span></h2> +<p>boost::algorithm::unhex — Converts a sequence of hexadecimal characters into a sequence of integers. </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../header/boost/algorithm/hex_hpp.html" title="Header <boost/algorithm/hex.hpp>">boost/algorithm/hex.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="keyword">typename</span> OutputIterator<span class="special">></span> + <span class="identifier">OutputIterator</span> <span class="identifier">unhex</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">T</span> <span class="special">*</span> ptr<span class="special">,</span> <span class="identifier">OutputIterator</span> out<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="id791801"></a><h2>Description</h2> +<p> + +</p> +<div class="note"><table border="0" summary="Note"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td> +<th align="left">Note</th> +</tr> +<tr><td align="left" valign="top"><p>Based on the MySQL function of the same name </p></td></tr> +</table></div> +<p> +</p> +<div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">out</code></span></p></td> +<td><p>An output iterator to the results into </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">ptr</code></span></p></td> +<td><p>A pointer to a null-terminated input sequence. </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>The updated output iterator </p></td> +</tr> +</tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="unhex_id337909.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/hex_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unhex_id338023.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/unhex_id338023.html b/libs/algorithm/doc/html/boost/algorithm/unhex_id338023.html new file mode 100644 index 0000000000..d93ebba23e --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/unhex_id338023.html @@ -0,0 +1,91 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template unhex</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/hex_hpp.html" title="Header <boost/algorithm/hex.hpp>"> +<link rel="prev" href="unhex_id337971.html" title="Function template unhex"> +<link rel="next" href="hex_id338075.html" title="Function template hex"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="unhex_id337971.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/hex_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="hex_id338075.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.unhex_id338023"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template unhex</span></h2> +<p>boost::algorithm::unhex — Converts a sequence of hexadecimal characters into a sequence of integers. </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../header/boost/algorithm/hex_hpp.html" title="Header <boost/algorithm/hex.hpp>">boost/algorithm/hex.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Range<span class="special">,</span> <span class="keyword">typename</span> OutputIterator<span class="special">></span> + <span class="identifier">OutputIterator</span> <span class="identifier">unhex</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span> r<span class="special">,</span> <span class="identifier">OutputIterator</span> out<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="id791974"></a><h2>Description</h2> +<p> + +</p> +<div class="note"><table border="0" summary="Note"> +<tr> +<td rowspan="2" align="center" valign="top" width="25"><img alt="[Note]" src="../../../../../../doc/src/images/note.png"></td> +<th align="left">Note</th> +</tr> +<tr><td align="left" valign="top"><p>Based on the MySQL function of the same name </p></td></tr> +</table></div> +<p> +</p> +<div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">out</code></span></p></td> +<td><p>An output iterator to the results into </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">r</code></span></p></td> +<td><p>The input range </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>The updated output iterator </p></td> +</tr> +</tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="unhex_id337971.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/hex_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="hex_id338075.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/unhex_id338108.html b/libs/algorithm/doc/html/boost/algorithm/unhex_id338108.html new file mode 100644 index 0000000000..741c537ce8 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/unhex_id338108.html @@ -0,0 +1,75 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template unhex</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/hex_hpp.html" title="Header <boost/algorithm/hex.hpp>"> +<link rel="prev" href="hex_id338075.html" title="Function template hex"> +<link rel="next" href="../../header/boost/algorithm/minmax_hpp.html" title="Header <boost/algorithm/minmax.hpp>"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="hex_id338075.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/hex_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../header/boost/algorithm/minmax_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.unhex_id338108"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template unhex</span></h2> +<p>boost::algorithm::unhex — Converts a sequence of hexadecimal characters into a sequence of characters. </p> +</div> +<h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2> +<div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../header/boost/algorithm/hex_hpp.html" title="Header <boost/algorithm/hex.hpp>">boost/algorithm/hex.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> String<span class="special">></span> <span class="identifier">String</span> <span class="identifier">unhex</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">String</span> <span class="special">&</span> input<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="id792261"></a><h2>Description</h2> +<p> + +</p> +<div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0"> +<col align="left" valign="top"> +<tbody><tr> +<td><p><span class="term"><code class="computeroutput">input</code></span></p></td> +<td><p>A container to be converted </p></td> +</tr></tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>A container with the decoded text </p></td> +</tr> +</tbody> +</table></div> +</div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="hex_id338075.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/hex_hpp.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../header/boost/algorithm/minmax_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/header/boost/algorithm/hex_hpp.html b/libs/algorithm/doc/html/header/boost/algorithm/hex_hpp.html new file mode 100644 index 0000000000..e87c715c21 --- /dev/null +++ b/libs/algorithm/doc/html/header/boost/algorithm/hex_hpp.html @@ -0,0 +1,70 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Header <boost/algorithm/hex.hpp></title> +<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../../algorithm/reference.html" title="Reference"> +<link rel="prev" href="../../../boost/algorithm/clamp_range_id337600.html" title="Function template clamp_range"> +<link rel="next" href="../../../boost/algorithm/hex_decode_error.html" title="Struct hex_decode_error"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../../boost/algorithm/clamp_range_id337600.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../algorithm/reference.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../../boost/algorithm/hex_decode_error.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="header.boost.algorithm.hex_hpp"></a>Header <<a href="../../../../../../../boost/algorithm/hex.hpp" target="_top">boost/algorithm/hex.hpp</a>></h3></div></div></div> +<p>Convert sequence of integral types into a sequence of hexadecimal characters and back. Based on the MySQL functions HEX and UNHEX. </p> +<p>Marshall Clow </p> +<p> +</p> +<pre class="synopsis"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> + <span class="keyword">namespace</span> <span class="identifier">algorithm</span> <span class="special">{</span> + <span class="keyword">struct</span> <a class="link" href="../../../boost/algorithm/hex_decode_error.html" title="Struct hex_decode_error">hex_decode_error</a><span class="special">;</span> + <span class="keyword">struct</span> <a class="link" href="../../../boost/algorithm/not_enough_input.html" title="Struct not_enough_input">not_enough_input</a><span class="special">;</span> + <span class="keyword">struct</span> <a class="link" href="../../../boost/algorithm/non_hex_input.html" title="Struct non_hex_input">non_hex_input</a><span class="special">;</span> + + <span class="keyword">typedef</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">error_info</span><span class="special"><</span> <span class="keyword">struct</span> <span class="identifier">bad_char_</span><span class="special">,</span> <span class="keyword">char</span> <span class="special">></span> <a name="boost.algorithm.bad_char"></a><span class="identifier">bad_char</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">,</span> <span class="keyword">typename</span> OutputIterator<span class="special">></span> + <span class="emphasis"><em><span class="identifier">unspecified</span></em></span> <a class="link" href="../../../boost/algorithm/hex_id337739.html" title="Function template hex"><span class="identifier">hex</span></a><span class="special">(</span><span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">OutputIterator</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="keyword">typename</span> OutputIterator<span class="special">></span> + <span class="identifier">boost</span><span class="special">::</span><span class="identifier">enable_if</span><span class="special"><</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">is_integral</span><span class="special"><</span> <span class="identifier">T</span> <span class="special">></span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> + <a class="link" href="../../../boost/algorithm/hex_id337802.html" title="Function template hex"><span class="identifier">hex</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">T</span> <span class="special">*</span><span class="special">,</span> <span class="identifier">OutputIterator</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Range<span class="special">,</span> <span class="keyword">typename</span> OutputIterator<span class="special">></span> + <span class="emphasis"><em><span class="identifier">unspecified</span></em></span> <a class="link" href="../../../boost/algorithm/hex_id337856.html" title="Function template hex"><span class="identifier">hex</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">OutputIterator</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">,</span> <span class="keyword">typename</span> OutputIterator<span class="special">></span> + <span class="identifier">OutputIterator</span> <a class="link" href="../../../boost/algorithm/unhex_id337909.html" title="Function template unhex"><span class="identifier">unhex</span></a><span class="special">(</span><span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">OutputIterator</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="keyword">typename</span> OutputIterator<span class="special">></span> + <span class="identifier">OutputIterator</span> <a class="link" href="../../../boost/algorithm/unhex_id337971.html" title="Function template unhex"><span class="identifier">unhex</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">T</span> <span class="special">*</span><span class="special">,</span> <span class="identifier">OutputIterator</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Range<span class="special">,</span> <span class="keyword">typename</span> OutputIterator<span class="special">></span> + <span class="identifier">OutputIterator</span> <a class="link" href="../../../boost/algorithm/unhex_id338023.html" title="Function template unhex"><span class="identifier">unhex</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">OutputIterator</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> String<span class="special">></span> <span class="identifier">String</span> <a class="link" href="../../../boost/algorithm/hex_id338075.html" title="Function template hex"><span class="identifier">hex</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">String</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> String<span class="special">></span> <span class="identifier">String</span> <a class="link" href="../../../boost/algorithm/unhex_id338108.html" title="Function template unhex"><span class="identifier">unhex</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">String</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span> + <span class="special">}</span> +<span class="special">}</span></pre> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../../boost/algorithm/clamp_range_id337600.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../algorithm/reference.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../../boost/algorithm/hex_decode_error.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/header/boost/algorithm/minmax_element_hpp.html b/libs/algorithm/doc/html/header/boost/algorithm/minmax_element_hpp.html new file mode 100644 index 0000000000..4aff67e323 --- /dev/null +++ b/libs/algorithm/doc/html/header/boost/algorithm/minmax_element_hpp.html @@ -0,0 +1,98 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Header <boost/algorithm/minmax_element.hpp></title> +<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../../algorithm/reference.html" title="Reference"> +<link rel="prev" href="minmax_hpp.html" title="Header <boost/algorithm/minmax.hpp>"> +<link rel="next" href="searching/boyer_moore_hpp.html" title="Header <boost/algorithm/searching/boyer_moore.hpp>"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="minmax_hpp.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../algorithm/reference.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="searching/boyer_moore_hpp.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="header.boost.algorithm.minmax_element_hpp"></a>Header <<a href="../../../../../../../boost/algorithm/minmax_element.hpp" target="_top">boost/algorithm/minmax_element.hpp</a>></h3></div></div></div> +<pre class="synopsis"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIter<span class="special">></span> + <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">ForwardIter</span><span class="special">,</span> <span class="identifier">ForwardIter</span> <span class="special">></span> + <a name="boost.minmax_element_id338213"></a><span class="identifier">minmax_element</span><span class="special">(</span><span class="identifier">ForwardIter</span> first<span class="special">,</span> <span class="identifier">ForwardIter</span> last<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIter<span class="special">,</span> <span class="keyword">typename</span> BinaryPredicate<span class="special">></span> + <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">ForwardIter</span><span class="special">,</span> <span class="identifier">ForwardIter</span> <span class="special">></span> + <a name="boost.minmax_element_id338237"></a><span class="identifier">minmax_element</span><span class="special">(</span><span class="identifier">ForwardIter</span> first<span class="special">,</span> <span class="identifier">ForwardIter</span> last<span class="special">,</span> <span class="identifier">BinaryPredicate</span> comp<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIter<span class="special">></span> + <span class="identifier">ForwardIter</span> <a name="boost.first_min_element_id338272"></a><span class="identifier">first_min_element</span><span class="special">(</span><span class="identifier">ForwardIter</span> first<span class="special">,</span> <span class="identifier">ForwardIter</span> last<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIter<span class="special">,</span> <span class="keyword">typename</span> BinaryPredicate<span class="special">></span> + <span class="identifier">ForwardIter</span> <a name="boost.first_min_element_id338296"></a><span class="identifier">first_min_element</span><span class="special">(</span><span class="identifier">ForwardIter</span> first<span class="special">,</span> <span class="identifier">ForwardIter</span> last<span class="special">,</span> + <span class="identifier">BinaryPredicate</span> comp<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIter<span class="special">></span> + <span class="identifier">ForwardIter</span> <a name="boost.last_min_element_id338330"></a><span class="identifier">last_min_element</span><span class="special">(</span><span class="identifier">ForwardIter</span> first<span class="special">,</span> <span class="identifier">ForwardIter</span> last<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIter<span class="special">,</span> <span class="keyword">typename</span> BinaryPredicate<span class="special">></span> + <span class="identifier">ForwardIter</span> <a name="boost.last_min_element_id338354"></a><span class="identifier">last_min_element</span><span class="special">(</span><span class="identifier">ForwardIter</span> first<span class="special">,</span> <span class="identifier">ForwardIter</span> last<span class="special">,</span> + <span class="identifier">BinaryPredicate</span> comp<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIter<span class="special">></span> + <span class="identifier">ForwardIter</span> <a name="boost.first_max_element_id338388"></a><span class="identifier">first_max_element</span><span class="special">(</span><span class="identifier">ForwardIter</span> first<span class="special">,</span> <span class="identifier">ForwardIter</span> last<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIter<span class="special">,</span> <span class="keyword">typename</span> BinaryPredicate<span class="special">></span> + <span class="identifier">ForwardIter</span> <a name="boost.first_max_element_id338412"></a><span class="identifier">first_max_element</span><span class="special">(</span><span class="identifier">ForwardIter</span> first<span class="special">,</span> <span class="identifier">ForwardIter</span> last<span class="special">,</span> + <span class="identifier">BinaryPredicate</span> comp<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIter<span class="special">></span> + <span class="identifier">ForwardIter</span> <a name="boost.last_max_element_id338446"></a><span class="identifier">last_max_element</span><span class="special">(</span><span class="identifier">ForwardIter</span> first<span class="special">,</span> <span class="identifier">ForwardIter</span> last<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIter<span class="special">,</span> <span class="keyword">typename</span> BinaryPredicate<span class="special">></span> + <span class="identifier">ForwardIter</span> <a name="boost.last_max_element_id338470"></a><span class="identifier">last_max_element</span><span class="special">(</span><span class="identifier">ForwardIter</span> first<span class="special">,</span> <span class="identifier">ForwardIter</span> last<span class="special">,</span> + <span class="identifier">BinaryPredicate</span> comp<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIter<span class="special">></span> + <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">ForwardIter</span><span class="special">,</span> <span class="identifier">ForwardIter</span> <span class="special">></span> + <a name="boost.first_min_first_m_id338504"></a><span class="identifier">first_min_first_max_element</span><span class="special">(</span><span class="identifier">ForwardIter</span> first<span class="special">,</span> <span class="identifier">ForwardIter</span> last<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIter<span class="special">,</span> <span class="keyword">typename</span> BinaryPredicate<span class="special">></span> + <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">ForwardIter</span><span class="special">,</span> <span class="identifier">ForwardIter</span> <span class="special">></span> + <a name="boost.first_min_first_m_id338529"></a><span class="identifier">first_min_first_max_element</span><span class="special">(</span><span class="identifier">ForwardIter</span> first<span class="special">,</span> <span class="identifier">ForwardIter</span> last<span class="special">,</span> + <span class="identifier">BinaryPredicate</span> comp<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIter<span class="special">></span> + <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">ForwardIter</span><span class="special">,</span> <span class="identifier">ForwardIter</span> <span class="special">></span> + <a name="boost.first_min_last_ma_id338563"></a><span class="identifier">first_min_last_max_element</span><span class="special">(</span><span class="identifier">ForwardIter</span> first<span class="special">,</span> <span class="identifier">ForwardIter</span> last<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIter<span class="special">,</span> <span class="keyword">typename</span> BinaryPredicate<span class="special">></span> + <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">ForwardIter</span><span class="special">,</span> <span class="identifier">ForwardIter</span> <span class="special">></span> + <a name="boost.first_min_last_ma_id338588"></a><span class="identifier">first_min_last_max_element</span><span class="special">(</span><span class="identifier">ForwardIter</span> first<span class="special">,</span> <span class="identifier">ForwardIter</span> last<span class="special">,</span> + <span class="identifier">BinaryPredicate</span> comp<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIter<span class="special">></span> + <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">ForwardIter</span><span class="special">,</span> <span class="identifier">ForwardIter</span> <span class="special">></span> + <a name="boost.last_min_first_ma_id338622"></a><span class="identifier">last_min_first_max_element</span><span class="special">(</span><span class="identifier">ForwardIter</span> first<span class="special">,</span> <span class="identifier">ForwardIter</span> last<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIter<span class="special">,</span> <span class="keyword">typename</span> BinaryPredicate<span class="special">></span> + <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">ForwardIter</span><span class="special">,</span> <span class="identifier">ForwardIter</span> <span class="special">></span> + <a name="boost.last_min_first_ma_id338647"></a><span class="identifier">last_min_first_max_element</span><span class="special">(</span><span class="identifier">ForwardIter</span> first<span class="special">,</span> <span class="identifier">ForwardIter</span> last<span class="special">,</span> + <span class="identifier">BinaryPredicate</span> comp<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIter<span class="special">></span> + <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">ForwardIter</span><span class="special">,</span> <span class="identifier">ForwardIter</span> <span class="special">></span> + <a name="boost.last_min_last_max_id338682"></a><span class="identifier">last_min_last_max_element</span><span class="special">(</span><span class="identifier">ForwardIter</span> first<span class="special">,</span> <span class="identifier">ForwardIter</span> last<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIter<span class="special">,</span> <span class="keyword">typename</span> BinaryPredicate<span class="special">></span> + <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special"><</span> <span class="identifier">ForwardIter</span><span class="special">,</span> <span class="identifier">ForwardIter</span> <span class="special">></span> + <a name="boost.last_min_last_max_id338706"></a><span class="identifier">last_min_last_max_element</span><span class="special">(</span><span class="identifier">ForwardIter</span> first<span class="special">,</span> <span class="identifier">ForwardIter</span> last<span class="special">,</span> + <span class="identifier">BinaryPredicate</span> comp<span class="special">)</span><span class="special">;</span> +<span class="special">}</span></pre> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="minmax_hpp.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../algorithm/reference.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="searching/boyer_moore_hpp.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/header/boost/algorithm/minmax_hpp.html b/libs/algorithm/doc/html/header/boost/algorithm/minmax_hpp.html new file mode 100644 index 0000000000..094d1b4162 --- /dev/null +++ b/libs/algorithm/doc/html/header/boost/algorithm/minmax_hpp.html @@ -0,0 +1,49 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Header <boost/algorithm/minmax.hpp></title> +<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../../algorithm/reference.html" title="Reference"> +<link rel="prev" href="../../../boost/algorithm/unhex_id338108.html" title="Function template unhex"> +<link rel="next" href="minmax_element_hpp.html" title="Header <boost/algorithm/minmax_element.hpp>"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../../boost/algorithm/unhex_id338108.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../algorithm/reference.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="minmax_element_hpp.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="header.boost.algorithm.minmax_hpp"></a>Header <<a href="../../../../../../../boost/algorithm/minmax.hpp" target="_top">boost/algorithm/minmax.hpp</a>></h3></div></div></div> +<pre class="synopsis"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">></span> + <span class="identifier">tuple</span><span class="special"><</span> <span class="identifier">T</span> <span class="keyword">const</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">T</span> <span class="keyword">const</span> <span class="special">&</span> <span class="special">></span> <a name="boost.minmax_id338148"></a><span class="identifier">minmax</span><span class="special">(</span><span class="identifier">T</span> <span class="keyword">const</span> <span class="special">&</span> a<span class="special">,</span> <span class="identifier">T</span> <span class="keyword">const</span> <span class="special">&</span> b<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> T<span class="special">,</span> <span class="keyword">typename</span> BinaryPredicate<span class="special">></span> + <span class="identifier">tuple</span><span class="special"><</span> <span class="identifier">T</span> <span class="keyword">const</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">T</span> <span class="keyword">const</span> <span class="special">&</span> <span class="special">></span> + <a name="boost.minmax_id338172"></a><span class="identifier">minmax</span><span class="special">(</span><span class="identifier">T</span> <span class="keyword">const</span> <span class="special">&</span> a<span class="special">,</span> <span class="identifier">T</span> <span class="keyword">const</span> <span class="special">&</span> b<span class="special">,</span> <span class="identifier">BinaryPredicate</span> comp<span class="special">)</span><span class="special">;</span> +<span class="special">}</span></pre> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../../boost/algorithm/unhex_id338108.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../algorithm/reference.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="minmax_element_hpp.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/header/boost/algorithm/searching/boyer_moore_horspool_hpp.html b/libs/algorithm/doc/html/header/boost/algorithm/searching/boyer_moore_horspool_hpp.html new file mode 100644 index 0000000000..22bf6c63ce --- /dev/null +++ b/libs/algorithm/doc/html/header/boost/algorithm/searching/boyer_moore_horspool_hpp.html @@ -0,0 +1,69 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Header <boost/algorithm/searching/boyer_moore_horspool.hpp></title> +<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../../../algorithm/reference.html" title="Reference"> +<link rel="prev" href="../../../../boost/algorithm/boyer_moore_searc_id338832.html" title="Function template boyer_moore_search"> +<link rel="next" href="../../../../boost/algorithm/boyer_moore_horspool.html" title="Class template boyer_moore_horspool"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../../../boost/algorithm/boyer_moore_searc_id338832.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../../algorithm/reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../../../boost/algorithm/boyer_moore_horspool.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="header.boost.algorithm.searching.boyer_moore_horspool_hpp"></a>Header <<a href="../../../../../../../../boost/algorithm/searching/boyer_moore_horspool.hpp" target="_top">boost/algorithm/searching/boyer_moore_horspool.hpp</a>></h3></div></div></div> +<pre class="synopsis"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> + <span class="keyword">namespace</span> <span class="identifier">algorithm</span> <span class="special">{</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> patIter<span class="special">,</span> <span class="keyword">typename</span> traits <span class="special">=</span> <span class="identifier">detail</span><span class="special">::</span><span class="identifier">BM_traits</span><span class="special"><</span><span class="identifier">patIter</span><span class="special">></span> <span class="special">></span> + <span class="keyword">class</span> <a class="link" href="../../../../boost/algorithm/boyer_moore_horspool.html" title="Class template boyer_moore_horspool">boyer_moore_horspool</a><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> patIter<span class="special">,</span> <span class="keyword">typename</span> corpusIter<span class="special">></span> + <span class="identifier">corpusIter</span> <a class="link" href="../../../../boost/algorithm/boyer_moore_horsp_id339130.html" title="Function template boyer_moore_horspool_search"><span class="identifier">boyer_moore_horspool_search</span></a><span class="special">(</span><span class="identifier">corpusIter</span><span class="special">,</span> <span class="identifier">corpusIter</span><span class="special">,</span> <span class="identifier">patIter</span><span class="special">,</span> + <span class="identifier">patIter</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> PatternRange<span class="special">,</span> <span class="keyword">typename</span> corpusIter<span class="special">></span> + <span class="identifier">corpusIter</span> <a name="boost.algorithm.boyer_moore_horsp_id339193"></a><span class="identifier">boyer_moore_horspool_search</span><span class="special">(</span><span class="identifier">corpusIter</span> corpus_first<span class="special">,</span> + <span class="identifier">corpusIter</span> corpus_last<span class="special">,</span> + <span class="keyword">const</span> <span class="identifier">PatternRange</span> <span class="special">&</span> pattern<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> patIter<span class="special">,</span> <span class="keyword">typename</span> CorpusRange<span class="special">></span> + <span class="identifier">boost</span><span class="special">::</span><span class="identifier">lazy_disable_if_c</span><span class="special"><</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">is_same</span><span class="special"><</span> <span class="identifier">CorpusRange</span><span class="special">,</span> <span class="identifier">patIter</span> <span class="special">></span><span class="special">::</span><span class="identifier">value</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span> <span class="identifier">CorpusRange</span> <span class="special">></span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> + <a name="boost.algorithm.boyer_moore_horsp_id339227"></a><span class="identifier">boyer_moore_horspool_search</span><span class="special">(</span><span class="identifier">CorpusRange</span> <span class="special">&</span> corpus<span class="special">,</span> <span class="identifier">patIter</span> pat_first<span class="special">,</span> + <span class="identifier">patIter</span> pat_last<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> PatternRange<span class="special">,</span> <span class="keyword">typename</span> CorpusRange<span class="special">></span> + <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span> <span class="identifier">CorpusRange</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> + <a name="boost.algorithm.boyer_moore_horsp_id339263"></a><span class="identifier">boyer_moore_horspool_search</span><span class="special">(</span><span class="identifier">CorpusRange</span> <span class="special">&</span> corpus<span class="special">,</span> + <span class="keyword">const</span> <span class="identifier">PatternRange</span> <span class="special">&</span> pattern<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Range<span class="special">></span> + <a class="link" href="../../../../boost/algorithm/boyer_moore_horspool.html" title="Class template boyer_moore_horspool">boost::algorithm::boyer_moore_horspool</a><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span> <span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <span class="special">></span> + <a name="boost.algorithm.make_boyer_moore__id339292"></a><span class="identifier">make_boyer_moore_horspool</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span> r<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Range<span class="special">></span> + <a class="link" href="../../../../boost/algorithm/boyer_moore_horspool.html" title="Class template boyer_moore_horspool">boost::algorithm::boyer_moore_horspool</a><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span> <span class="identifier">Range</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <span class="special">></span> + <a name="boost.algorithm.make_boyer_moore__id339314"></a><span class="identifier">make_boyer_moore_horspool</span><span class="special">(</span><span class="identifier">Range</span> <span class="special">&</span> r<span class="special">)</span><span class="special">;</span> + <span class="special">}</span> +<span class="special">}</span></pre> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../../../boost/algorithm/boyer_moore_searc_id338832.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../../algorithm/reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../../../boost/algorithm/boyer_moore_horspool.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/header/boost/algorithm/searching/boyer_moore_hpp.html b/libs/algorithm/doc/html/header/boost/algorithm/searching/boyer_moore_hpp.html new file mode 100644 index 0000000000..935c2c04e3 --- /dev/null +++ b/libs/algorithm/doc/html/header/boost/algorithm/searching/boyer_moore_hpp.html @@ -0,0 +1,67 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Header <boost/algorithm/searching/boyer_moore.hpp></title> +<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../../../algorithm/reference.html" title="Reference"> +<link rel="prev" href="../minmax_element_hpp.html" title="Header <boost/algorithm/minmax_element.hpp>"> +<link rel="next" href="../../../../boost/algorithm/boyer_moore.html" title="Class template boyer_moore"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../minmax_element_hpp.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../../algorithm/reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../../../boost/algorithm/boyer_moore.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="header.boost.algorithm.searching.boyer_moore_hpp"></a>Header <<a href="../../../../../../../../boost/algorithm/searching/boyer_moore.hpp" target="_top">boost/algorithm/searching/boyer_moore.hpp</a>></h3></div></div></div> +<pre class="synopsis"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> + <span class="keyword">namespace</span> <span class="identifier">algorithm</span> <span class="special">{</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> patIter<span class="special">,</span> <span class="keyword">typename</span> traits <span class="special">=</span> <span class="identifier">detail</span><span class="special">::</span><span class="identifier">BM_traits</span><span class="special"><</span><span class="identifier">patIter</span><span class="special">></span> <span class="special">></span> + <span class="keyword">class</span> <a class="link" href="../../../../boost/algorithm/boyer_moore.html" title="Class template boyer_moore">boyer_moore</a><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> patIter<span class="special">,</span> <span class="keyword">typename</span> corpusIter<span class="special">></span> + <span class="identifier">corpusIter</span> <a class="link" href="../../../../boost/algorithm/boyer_moore_searc_id338832.html" title="Function template boyer_moore_search"><span class="identifier">boyer_moore_search</span></a><span class="special">(</span><span class="identifier">corpusIter</span><span class="special">,</span> <span class="identifier">corpusIter</span><span class="special">,</span> <span class="identifier">patIter</span><span class="special">,</span> <span class="identifier">patIter</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> PatternRange<span class="special">,</span> <span class="keyword">typename</span> corpusIter<span class="special">></span> + <span class="identifier">corpusIter</span> <a name="boost.algorithm.boyer_moore_searc_id338895"></a><span class="identifier">boyer_moore_search</span><span class="special">(</span><span class="identifier">corpusIter</span> corpus_first<span class="special">,</span> + <span class="identifier">corpusIter</span> corpus_last<span class="special">,</span> + <span class="keyword">const</span> <span class="identifier">PatternRange</span> <span class="special">&</span> pattern<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> patIter<span class="special">,</span> <span class="keyword">typename</span> CorpusRange<span class="special">></span> + <span class="identifier">boost</span><span class="special">::</span><span class="identifier">lazy_disable_if_c</span><span class="special"><</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">is_same</span><span class="special"><</span> <span class="identifier">CorpusRange</span><span class="special">,</span> <span class="identifier">patIter</span> <span class="special">></span><span class="special">::</span><span class="identifier">value</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span> <span class="identifier">CorpusRange</span> <span class="special">></span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> + <a name="boost.algorithm.boyer_moore_searc_id338929"></a><span class="identifier">boyer_moore_search</span><span class="special">(</span><span class="identifier">CorpusRange</span> <span class="special">&</span> corpus<span class="special">,</span> <span class="identifier">patIter</span> pat_first<span class="special">,</span> + <span class="identifier">patIter</span> pat_last<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> PatternRange<span class="special">,</span> <span class="keyword">typename</span> CorpusRange<span class="special">></span> + <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span> <span class="identifier">CorpusRange</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> + <a name="boost.algorithm.boyer_moore_searc_id338965"></a><span class="identifier">boyer_moore_search</span><span class="special">(</span><span class="identifier">CorpusRange</span> <span class="special">&</span> corpus<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">PatternRange</span> <span class="special">&</span> pattern<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Range<span class="special">></span> + <a class="link" href="../../../../boost/algorithm/boyer_moore.html" title="Class template boyer_moore">boost::algorithm::boyer_moore</a><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span> <span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <span class="special">></span> + <a name="boost.algorithm.make_boyer_moore_id338994"></a><span class="identifier">make_boyer_moore</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span> r<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Range<span class="special">></span> + <a class="link" href="../../../../boost/algorithm/boyer_moore.html" title="Class template boyer_moore">boost::algorithm::boyer_moore</a><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span> <span class="identifier">Range</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <span class="special">></span> + <a name="boost.algorithm.make_boyer_moore_id339016"></a><span class="identifier">make_boyer_moore</span><span class="special">(</span><span class="identifier">Range</span> <span class="special">&</span> r<span class="special">)</span><span class="special">;</span> + <span class="special">}</span> +<span class="special">}</span></pre> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../minmax_element_hpp.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../../algorithm/reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../../../boost/algorithm/boyer_moore.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/header/boost/algorithm/searching/knuth_morris_pratt_hpp.html b/libs/algorithm/doc/html/header/boost/algorithm/searching/knuth_morris_pratt_hpp.html new file mode 100644 index 0000000000..068484409b --- /dev/null +++ b/libs/algorithm/doc/html/header/boost/algorithm/searching/knuth_morris_pratt_hpp.html @@ -0,0 +1,68 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Header <boost/algorithm/searching/knuth_morris_pratt.hpp></title> +<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../../../algorithm/reference.html" title="Reference"> +<link rel="prev" href="../../../../boost/algorithm/boyer_moore_horsp_id339130.html" title="Function template boyer_moore_horspool_search"> +<link rel="next" href="../../../../boost/algorithm/knuth_morris_pratt.html" title="Class template knuth_morris_pratt"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../../../boost/algorithm/boyer_moore_horsp_id339130.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../../algorithm/reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../../../boost/algorithm/knuth_morris_pratt.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="header.boost.algorithm.searching.knuth_morris_pratt_hpp"></a>Header <<a href="../../../../../../../../boost/algorithm/searching/knuth_morris_pratt.hpp" target="_top">boost/algorithm/searching/knuth_morris_pratt.hpp</a>></h3></div></div></div> +<pre class="synopsis"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> + <span class="keyword">namespace</span> <span class="identifier">algorithm</span> <span class="special">{</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> patIter<span class="special">></span> <span class="keyword">class</span> <a class="link" href="../../../../boost/algorithm/knuth_morris_pratt.html" title="Class template knuth_morris_pratt">knuth_morris_pratt</a><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> patIter<span class="special">,</span> <span class="keyword">typename</span> corpusIter<span class="special">></span> + <span class="identifier">corpusIter</span> <a class="link" href="../../../../boost/algorithm/knuth_morris_prat_id339421.html" title="Function template knuth_morris_pratt_search"><span class="identifier">knuth_morris_pratt_search</span></a><span class="special">(</span><span class="identifier">corpusIter</span><span class="special">,</span> <span class="identifier">corpusIter</span><span class="special">,</span> <span class="identifier">patIter</span><span class="special">,</span> + <span class="identifier">patIter</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> PatternRange<span class="special">,</span> <span class="keyword">typename</span> corpusIter<span class="special">></span> + <span class="identifier">corpusIter</span> <a name="boost.algorithm.knuth_morris_prat_id339484"></a><span class="identifier">knuth_morris_pratt_search</span><span class="special">(</span><span class="identifier">corpusIter</span> corpus_first<span class="special">,</span> + <span class="identifier">corpusIter</span> corpus_last<span class="special">,</span> + <span class="keyword">const</span> <span class="identifier">PatternRange</span> <span class="special">&</span> pattern<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> patIter<span class="special">,</span> <span class="keyword">typename</span> CorpusRange<span class="special">></span> + <span class="identifier">boost</span><span class="special">::</span><span class="identifier">lazy_disable_if_c</span><span class="special"><</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">is_same</span><span class="special"><</span> <span class="identifier">CorpusRange</span><span class="special">,</span> <span class="identifier">patIter</span> <span class="special">></span><span class="special">::</span><span class="identifier">value</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span> <span class="identifier">CorpusRange</span> <span class="special">></span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> + <a name="boost.algorithm.knuth_morris_prat_id339518"></a><span class="identifier">knuth_morris_pratt_search</span><span class="special">(</span><span class="identifier">CorpusRange</span> <span class="special">&</span> corpus<span class="special">,</span> <span class="identifier">patIter</span> pat_first<span class="special">,</span> + <span class="identifier">patIter</span> pat_last<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> PatternRange<span class="special">,</span> <span class="keyword">typename</span> CorpusRange<span class="special">></span> + <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span> <span class="identifier">CorpusRange</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> + <a name="boost.algorithm.knuth_morris_prat_id339554"></a><span class="identifier">knuth_morris_pratt_search</span><span class="special">(</span><span class="identifier">CorpusRange</span> <span class="special">&</span> corpus<span class="special">,</span> + <span class="keyword">const</span> <span class="identifier">PatternRange</span> <span class="special">&</span> pattern<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Range<span class="special">></span> + <a class="link" href="../../../../boost/algorithm/knuth_morris_pratt.html" title="Class template knuth_morris_pratt">boost::algorithm::knuth_morris_pratt</a><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span> <span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <span class="special">></span> + <a name="boost.algorithm.make_knuth_morris_id339584"></a><span class="identifier">make_knuth_morris_pratt</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span> r<span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Range<span class="special">></span> + <a class="link" href="../../../../boost/algorithm/knuth_morris_pratt.html" title="Class template knuth_morris_pratt">boost::algorithm::knuth_morris_pratt</a><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span> <span class="identifier">Range</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <span class="special">></span> + <a name="boost.algorithm.make_knuth_morris_id339606"></a><span class="identifier">make_knuth_morris_pratt</span><span class="special">(</span><span class="identifier">Range</span> <span class="special">&</span> r<span class="special">)</span><span class="special">;</span> + <span class="special">}</span> +<span class="special">}</span></pre> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../../../boost/algorithm/boyer_moore_horsp_id339130.html"><img src="../../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../../algorithm/reference.html"><img src="../../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../../index.html"><img src="../../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../../../boost/algorithm/knuth_morris_pratt.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/header/boost/algorithm/string_hpp.html b/libs/algorithm/doc/html/header/boost/algorithm/string_hpp.html new file mode 100644 index 0000000000..dc4d0a114e --- /dev/null +++ b/libs/algorithm/doc/html/header/boost/algorithm/string_hpp.html @@ -0,0 +1,43 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Header <boost/algorithm/string.hpp></title> +<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../../algorithm/reference.html" title="Reference"> +<link rel="prev" href="../../../boost/algorithm/knuth_morris_prat_id339421.html" title="Function template knuth_morris_pratt_search"> +<link rel="next" href="string_regex_hpp.html" title="Header <boost/algorithm/string_regex.hpp>"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../../boost/algorithm/knuth_morris_prat_id339421.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../algorithm/reference.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="string_regex_hpp.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="header.boost.algorithm.string_hpp"></a>Header <<a href="../../../../../../../boost/algorithm/string.hpp" target="_top">boost/algorithm/string.hpp</a>></h3></div></div></div> +<p>Cumulative include for string_algo library </p> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../../boost/algorithm/knuth_morris_prat_id339421.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../algorithm/reference.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="string_regex_hpp.html"><img src="../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/header/boost/algorithm/string_regex_hpp.html b/libs/algorithm/doc/html/header/boost/algorithm/string_regex_hpp.html new file mode 100644 index 0000000000..189e7380f4 --- /dev/null +++ b/libs/algorithm/doc/html/header/boost/algorithm/string_regex_hpp.html @@ -0,0 +1,42 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Header <boost/algorithm/string_regex.hpp></title> +<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../../algorithm/reference.html" title="Reference"> +<link rel="prev" href="string_hpp.html" title="Header <boost/algorithm/string.hpp>"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="string_hpp.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../algorithm/reference.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="header.boost.algorithm.string_regex_hpp"></a>Header <<a href="../../../../../../../boost/algorithm/string_regex.hpp" target="_top">boost/algorithm/string_regex.hpp</a>></h3></div></div></div> +<p>Cumulative include for string_algo library. In addtion to string.hpp contains also regex-related stuff. </p> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="string_hpp.html"><img src="../../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../../algorithm/reference.html"><img src="../../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../../index.html"><img src="../../../../../../../doc/src/images/home.png" alt="Home"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/index.html b/libs/algorithm/doc/html/index.html new file mode 100644 index 0000000000..a7123946fc --- /dev/null +++ b/libs/algorithm/doc/html/index.html @@ -0,0 +1,141 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>The Boost Algorithm Library</title> +<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="index.html" title="The Boost Algorithm Library"> +<link rel="next" href="algorithm/Searching.html" title="Searching Algorithms"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td> +<td align="center"><a href="../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"><a accesskey="n" href="algorithm/Searching.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a></div> +<div class="chapter"> +<div class="titlepage"><div> +<div><h2 class="title"> +<a name="algorithm"></a>The Boost Algorithm Library</h2></div> +<div><div class="author"><h3 class="author"> +<span class="firstname">Marshall</span> <span class="surname">Clow</span> +</h3></div></div> +<div><p class="copyright">Copyright © 2010-2012 Marshall Clow</p></div> +<div><div class="legalnotice"> +<a name="algorithm.legal"></a><p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></div> +</div></div> +<div class="toc"> +<p><b>Table of Contents</b></p> +<dl> +<dt><span class="section"><a href="index.html#algorithm.description_and_rationale">Description and Rationale</a></span></dt> +<dt><span class="section"><a href="algorithm/Searching.html">Searching Algorithms</a></span></dt> +<dd><dl> +<dt><span class="section"><a href="algorithm/Searching.html#the_boost_algorithm_library.Searching.BoyerMoore">Boyer-Moore + Search</a></span></dt> +<dt><span class="section"><a href="the_boost_algorithm_library/Searching/BoyerMooreHorspool.html">Boyer-Moore-Horspool + Search</a></span></dt> +<dt><span class="section"><a href="the_boost_algorithm_library/Searching/KnuthMorrisPratt.html">Knuth-Morris-Pratt + Search</a></span></dt> +</dl></dd> +<dt><span class="section"><a href="algorithm/CXX11.html">C++11 Algorithms</a></span></dt> +<dd><dl> +<dt><span class="section"><a href="algorithm/CXX11.html#the_boost_algorithm_library.CXX11.all_of">all_of</a></span></dt> +<dt><span class="section"><a href="the_boost_algorithm_library/CXX11/any_of.html">any_of</a></span></dt> +<dt><span class="section"><a href="the_boost_algorithm_library/CXX11/none_of.html">none_of</a></span></dt> +<dt><span class="section"><a href="the_boost_algorithm_library/CXX11/one_of.html">one_of</a></span></dt> +<dt><span class="section"><a href="the_boost_algorithm_library/CXX11/is_sorted.html">is_sorted + </a></span></dt> +<dt><span class="section"><a href="the_boost_algorithm_library/CXX11/is_partitioned.html">is_partitioned + </a></span></dt> +<dt><span class="section"><a href="the_boost_algorithm_library/CXX11/partition_point.html">partition_point + </a></span></dt> +</dl></dd> +<dt><span class="section"><a href="algorithm/Misc.html">Other Algorithms</a></span></dt> +<dd><dl> +<dt><span class="section"><a href="algorithm/Misc.html#the_boost_algorithm_library.Misc.clamp">clamp</a></span></dt> +<dt><span class="section"><a href="the_boost_algorithm_library/Misc/hex.html">hex</a></span></dt> +</dl></dd> +<dt><span class="section"><a href="algorithm/reference.html">Reference</a></span></dt> +<dd><dl> +<dt><span class="section"><a href="algorithm/reference.html#header.boost.algorithm.clamp_hpp">Header <boost/algorithm/clamp.hpp></a></span></dt> +<dt><span class="section"><a href="header/boost/algorithm/hex_hpp.html">Header <boost/algorithm/hex.hpp></a></span></dt> +<dt><span class="section"><a href="header/boost/algorithm/minmax_hpp.html">Header <boost/algorithm/minmax.hpp></a></span></dt> +<dt><span class="section"><a href="header/boost/algorithm/minmax_element_hpp.html">Header <boost/algorithm/minmax_element.hpp></a></span></dt> +<dt><span class="section"><a href="header/boost/algorithm/searching/boyer_moore_hpp.html">Header <boost/algorithm/searching/boyer_moore.hpp></a></span></dt> +<dt><span class="section"><a href="header/boost/algorithm/searching/boyer_moore_horspool_hpp.html">Header <boost/algorithm/searching/boyer_moore_horspool.hpp></a></span></dt> +<dt><span class="section"><a href="header/boost/algorithm/searching/knuth_morris_pratt_hpp.html">Header <boost/algorithm/searching/knuth_morris_pratt.hpp></a></span></dt> +<dt><span class="section"><a href="header/boost/algorithm/string_hpp.html">Header <boost/algorithm/string.hpp></a></span></dt> +<dt><span class="section"><a href="header/boost/algorithm/string_regex_hpp.html">Header <boost/algorithm/string_regex.hpp></a></span></dt> +</dl></dd> +</dl> +</div> +<div class="section"> +<div class="titlepage"><div><div><h2 class="title" style="clear: both"> +<a name="algorithm.description_and_rationale"></a><a class="link" href="index.html#algorithm.description_and_rationale" title="Description and Rationale">Description and Rationale</a> +</h2></div></div></div> +<p> + Boost.Algorithm is a collection of general purpose algorithms. While Boost + contains many libraries of data structures, there is no single library for + general purpose algorithms. Even though the algorithms are generally useful, + many tend to be thought of as "too small" for Boost. + </p> +<p> + An implementation of Boyer-Moore searching, for example, might take a developer + a week or so to implement, including test cases and documentation. However, + scheduling a review to include that code into Boost might take several months, + and run into resistance because "it is too small". Nevertheless, + a library of tested, reviewed, documented algorithms can make the developer's + life much easier, and that is the purpose of this library. + </p> +<h4> +<a name="algorithm.description_and_rationale.h0"></a> + <span><a name="algorithm.description_and_rationale.future_plans"></a></span><a class="link" href="index.html#algorithm.description_and_rationale.future_plans">Future + plans</a> + </h4> +<p> + I will be soliciting submissions from other developers, as well as looking + through the literature for existing algorithms to include. The Adobe Source + Library, for example, contains many useful algorithms that already have documentation + and test cases. Knuth's <span class="underline">The Art of Computer Programming</span> + is chock-full of algorithm descriptions, too. + </p> +<p> + My goal is to run regular algorithm reviews, similar to the Boost library review + process, but with smaller chunks of code. + </p> +<h4> +<a name="algorithm.description_and_rationale.h1"></a> + <span><a name="algorithm.description_and_rationale.dependencies"></a></span><a class="link" href="index.html#algorithm.description_and_rationale.dependencies">Dependencies</a> + </h4> +<p> + Boost.Algorithm uses Boost.Range, Boost.Assert, Boost.Array, Boost.TypeTraits, + and Boost.StaticAssert. + </p> +<h4> +<a name="algorithm.description_and_rationale.h2"></a> + <span><a name="algorithm.description_and_rationale.acknowledgements"></a></span><a class="link" href="index.html#algorithm.description_and_rationale.acknowledgements">Acknowledgements</a> + </h4> +<p> + Thanks to all the people who have reviewed this library and made suggestions + for improvements. Steven Watanabe and Sean Parent, in particular, have provided + a great deal of help. + </p> +</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: August 15, 2012 at 23:36:35 GMT</small></p></td> +<td align="right"><div class="copyright-footer"></div></td> +</tr></table> +<hr> +<div class="spirit-nav"><a accesskey="n" href="algorithm/Searching.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a></div> +</body> +</html> diff --git a/libs/algorithm/doc/html/standalone_HTML.manifest b/libs/algorithm/doc/html/standalone_HTML.manifest new file mode 100644 index 0000000000..efe1a9c2dc --- /dev/null +++ b/libs/algorithm/doc/html/standalone_HTML.manifest @@ -0,0 +1,45 @@ +index.html +algorithm/Searching.html +the_boost_algorithm_library/Searching/BoyerMooreHorspool.html +the_boost_algorithm_library/Searching/KnuthMorrisPratt.html +algorithm/CXX11.html +the_boost_algorithm_library/CXX11/any_of.html +the_boost_algorithm_library/CXX11/none_of.html +the_boost_algorithm_library/CXX11/one_of.html +the_boost_algorithm_library/CXX11/is_sorted.html +the_boost_algorithm_library/CXX11/is_partitioned.html +the_boost_algorithm_library/CXX11/partition_point.html +algorithm/Misc.html +the_boost_algorithm_library/Misc/hex.html +algorithm/reference.html +boost/algorithm/clamp_id337250.html +boost/algorithm/clamp_id337315.html +boost/algorithm/clamp_range_id337367.html +boost/algorithm/clamp_range_id337442.html +boost/algorithm/clamp_range_id337510.html +boost/algorithm/clamp_range_id337600.html +header/boost/algorithm/hex_hpp.html +boost/algorithm/hex_decode_error.html +boost/algorithm/not_enough_input.html +boost/algorithm/non_hex_input.html +boost/algorithm/hex_id337739.html +boost/algorithm/hex_id337802.html +boost/algorithm/hex_id337856.html +boost/algorithm/unhex_id337909.html +boost/algorithm/unhex_id337971.html +boost/algorithm/unhex_id338023.html +boost/algorithm/hex_id338075.html +boost/algorithm/unhex_id338108.html +header/boost/algorithm/minmax_hpp.html +header/boost/algorithm/minmax_element_hpp.html +header/boost/algorithm/searching/boyer_moore_hpp.html +boost/algorithm/boyer_moore.html +boost/algorithm/boyer_moore_searc_id338832.html +header/boost/algorithm/searching/boyer_moore_horspool_hpp.html +boost/algorithm/boyer_moore_horspool.html +boost/algorithm/boyer_moore_horsp_id339130.html +header/boost/algorithm/searching/knuth_morris_pratt_hpp.html +boost/algorithm/knuth_morris_pratt.html +boost/algorithm/knuth_morris_prat_id339421.html +header/boost/algorithm/string_hpp.html +header/boost/algorithm/string_regex_hpp.html diff --git a/libs/algorithm/doc/html/the_boost_algorithm_library/CXX11/any_of.html b/libs/algorithm/doc/html/the_boost_algorithm_library/CXX11/any_of.html new file mode 100644 index 0000000000..03d6b640d2 --- /dev/null +++ b/libs/algorithm/doc/html/the_boost_algorithm_library/CXX11/any_of.html @@ -0,0 +1,183 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>any_of</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../algorithm/CXX11.html" title="C++11 Algorithms"> +<link rel="prev" href="../../algorithm/CXX11.html" title="C++11 Algorithms"> +<link rel="next" href="none_of.html" title="none_of"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../algorithm/CXX11.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/CXX11.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="none_of.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="the_boost_algorithm_library.CXX11.any_of"></a><a class="link" href="any_of.html" title="any_of">any_of</a> +</h3></div></div></div> +<p> + The header file 'boost/algorithm/cxx11/any_of.hpp' contains four variants + of a single algorithm, <code class="computeroutput"><span class="identifier">any_of</span></code>. + The algorithm tests the elements of a sequence and returns true if any of + the elements has a particular property. + </p> +<p> + The routine <code class="computeroutput"><span class="identifier">any_of</span></code> takes + a sequence and a predicate. It will return true if the predicate returns + true for any element in the sequence. + </p> +<p> + The routine <code class="computeroutput"><span class="identifier">any_of_equal</span></code> + takes a sequence and a value. It will return true if any element in the sequence + compares equal to the passed in value. + </p> +<p> + Both routines come in two forms; the first one takes two iterators to define + the range. The second form takes a single range parameter, and uses Boost.Range + to traverse it. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.any_of.h0"></a> + <span><a name="the_boost_algorithm_library.CXX11.any_of.interface"></a></span><a class="link" href="any_of.html#the_boost_algorithm_library.CXX11.any_of.interface">interface</a> + </h5> +<p> + The function <code class="computeroutput"><span class="identifier">any_of</span></code> returns + true if the predicate returns true any item in the sequence. There are two + versions; one takes two iterators, and the other takes a range. + </p> +<p> +</p> +<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">algorithm</span> <span class="special">{</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Predicate</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">any_of</span> <span class="special">(</span> <span class="identifier">InputIterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">InputIterator</span> <span class="identifier">last</span><span class="special">,</span> <span class="identifier">Predicate</span> <span class="identifier">p</span> <span class="special">);</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Range</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Predicate</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">any_of</span> <span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">Predicate</span> <span class="identifier">p</span> <span class="special">);</span> +<span class="special">}}</span> +</pre> +<p> + </p> +<p> + The function <code class="computeroutput"><span class="identifier">any_of_equal</span></code> + is similar to <code class="computeroutput"><span class="identifier">any_of</span></code>, but + instead of taking a predicate to test the elements of the sequence, it takes + a value to compare against. + </p> +<p> +</p> +<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">algorithm</span> <span class="special">{</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">V</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">any_of_equal</span> <span class="special">(</span> <span class="identifier">InputIterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">InputIterator</span> <span class="identifier">last</span><span class="special">,</span> <span class="identifier">V</span> <span class="keyword">const</span> <span class="special">&</span><span class="identifier">val</span> <span class="special">);</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Range</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">V</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">any_of_equal</span> <span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">V</span> <span class="keyword">const</span> <span class="special">&</span><span class="identifier">val</span> <span class="special">);</span> +<span class="special">}}</span> +</pre> +<p> + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.any_of.h1"></a> + <span><a name="the_boost_algorithm_library.CXX11.any_of.examples"></a></span><a class="link" href="any_of.html#the_boost_algorithm_library.CXX11.any_of.examples">Examples</a> + </h5> +<p> + Given the container <code class="computeroutput"><span class="identifier">c</span></code> containing + <code class="computeroutput"><span class="special">{</span> <span class="number">0</span><span class="special">,</span> <span class="number">1</span><span class="special">,</span> + <span class="number">2</span><span class="special">,</span> <span class="number">3</span><span class="special">,</span> <span class="number">14</span><span class="special">,</span> <span class="number">15</span> <span class="special">}</span></code>, + then +</p> +<pre class="programlisting"><span class="keyword">bool</span> <span class="identifier">isOdd</span> <span class="special">(</span> <span class="keyword">int</span> <span class="identifier">i</span> <span class="special">)</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">i</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">;</span> <span class="special">}</span> +<span class="keyword">bool</span> <span class="identifier">lessThan10</span> <span class="special">(</span> <span class="keyword">int</span> <span class="identifier">i</span> <span class="special">)</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">i</span> <span class="special"><</span> <span class="number">10</span><span class="special">;</span> <span class="special">}</span> + +<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">algorithm</span><span class="special">;</span> +<span class="identifier">any_of</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">,</span> <span class="identifier">isOdd</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">true</span> +<span class="identifier">any_of</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">lessThan10</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">true</span> +<span class="identifier">any_of</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">()</span> <span class="special">+</span> <span class="number">4</span><span class="special">,</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">lessThan10</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">false</span> +<span class="identifier">any_of</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">isOdd</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">false</span> <span class="comment">// empty range</span> +<span class="identifier">any_of_equal</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">,</span> <span class="number">3</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">true</span> +<span class="identifier">any_of_equal</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">()</span> <span class="special">+</span> <span class="number">3</span><span class="special">,</span> <span class="number">3</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">false</span> +<span class="identifier">any_of_equal</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="number">99</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">false</span> <span class="comment">// empty range</span> +</pre> +<p> + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.any_of.h2"></a> + <span><a name="the_boost_algorithm_library.CXX11.any_of.iterator_requirements"></a></span><a class="link" href="any_of.html#the_boost_algorithm_library.CXX11.any_of.iterator_requirements">Iterator + Requirements</a> + </h5> +<p> + <code class="computeroutput"><span class="identifier">any_of</span></code> and <code class="computeroutput"><span class="identifier">any_of_equal</span></code> work on all iterators except + output iterators. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.any_of.h3"></a> + <span><a name="the_boost_algorithm_library.CXX11.any_of.complexity"></a></span><a class="link" href="any_of.html#the_boost_algorithm_library.CXX11.any_of.complexity">Complexity</a> + </h5> +<p> + All of the variants of <code class="computeroutput"><span class="identifier">any_of</span></code> + and <code class="computeroutput"><span class="identifier">any_of_equal</span></code> run in + <span class="emphasis"><em>O(N)</em></span> (linear) time; that is, they compare against each + element in the list once. If any of the comparisons succeed, the algorithm + will terminate immediately, without examining the remaining members of the + sequence. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.any_of.h4"></a> + <span><a name="the_boost_algorithm_library.CXX11.any_of.exception_safety"></a></span><a class="link" href="any_of.html#the_boost_algorithm_library.CXX11.any_of.exception_safety">Exception + Safety</a> + </h5> +<p> + All of the variants of <code class="computeroutput"><span class="identifier">any_of</span></code> + and <code class="computeroutput"><span class="identifier">any_of_equal</span></code> take their + parameters by value or const reference, and do not depend upon any global + state. Therefore, all the routines in this file provide the strong exception + guarantee. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.any_of.h5"></a> + <span><a name="the_boost_algorithm_library.CXX11.any_of.notes"></a></span><a class="link" href="any_of.html#the_boost_algorithm_library.CXX11.any_of.notes">Notes</a> + </h5> +<div class="itemizedlist"><ul class="itemizedlist" type="disc"> +<li class="listitem"> + The routine <code class="computeroutput"><span class="identifier">any_of</span></code> is + part of the C++11 standard. When compiled using a C++11 implementation, + the implementation from the standard library will be used. + </li> +<li class="listitem"> + <code class="computeroutput"><span class="identifier">any_of</span></code> and <code class="computeroutput"><span class="identifier">any_of_equal</span></code> both return false for + empty ranges, no matter what is passed to test against. + </li> +<li class="listitem"> + The second parameter to <code class="computeroutput"><span class="identifier">any_of_value</span></code> + is a template parameter, rather than deduced from the first parameter + (<code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span><span class="identifier">InputIterator</span><span class="special">>::</span><span class="identifier">value_type</span></code>) because that allows more + flexibility for callers, and takes advantage of built-in comparisons + for the type that is pointed to by the iterator. The function is defined + to return true if, for any element in the sequence, the expression <code class="computeroutput"><span class="special">*</span><span class="identifier">iter</span> <span class="special">==</span> <span class="identifier">val</span></code> + evaluates to true (where <code class="computeroutput"><span class="identifier">iter</span></code> + is an iterator to each element in the sequence) + </li> +</ul></div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../algorithm/CXX11.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/CXX11.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="none_of.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/the_boost_algorithm_library/CXX11/is_partitioned.html b/libs/algorithm/doc/html/the_boost_algorithm_library/CXX11/is_partitioned.html new file mode 100644 index 0000000000..4b236a294c --- /dev/null +++ b/libs/algorithm/doc/html/the_boost_algorithm_library/CXX11/is_partitioned.html @@ -0,0 +1,147 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>is_partitioned</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../algorithm/CXX11.html" title="C++11 Algorithms"> +<link rel="prev" href="is_sorted.html" title="is_sorted"> +<link rel="next" href="partition_point.html" title="partition_point"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="is_sorted.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/CXX11.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="partition_point.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="the_boost_algorithm_library.CXX11.is_partitioned"></a><a class="link" href="is_partitioned.html" title="is_partitioned">is_partitioned + </a> +</h3></div></div></div> +<p> + The header file 'is_partitioned.hpp' contains two variants of a single algorithm, + <code class="computeroutput"><span class="identifier">is_partitioned</span></code>. The algorithm + tests to see if a sequence is partitioned according to a predicate; in other + words, all the items in the sequence that satisfy the predicate are at the + beginning of the sequence. + </p> +<p> + The routine <code class="computeroutput"><span class="identifier">is_partitioned</span></code> + takes a sequence and a predicate. It returns true if the sequence is partitioned + according to the predicate. + </p> +<p> + <code class="computeroutput"><span class="identifier">is_partitioned</span></code> come in two + forms; the first one takes two iterators to define the range. The second + form takes a single range parameter, and uses Boost.Range to traverse it. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.is_partitioned.h0"></a> + <span><a name="the_boost_algorithm_library.CXX11.is_partitioned.interface"></a></span><a class="link" href="is_partitioned.html#the_boost_algorithm_library.CXX11.is_partitioned.interface">interface</a> + </h5> +<p> + The function <code class="computeroutput"><span class="identifier">is_partitioned</span></code> + returns true the items in the sequence are separated according to their ability + to satisfy the predicate. There are two versions; one takes two iterators, + and the other takes a range. + </p> +<p> +</p> +<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Predicate</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_partitioned</span> <span class="special">(</span> <span class="identifier">InputIterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">InputIterator</span> <span class="identifier">last</span><span class="special">,</span> <span class="identifier">Predicate</span> <span class="identifier">p</span> <span class="special">);</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Range</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Predicate</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_partitioned</span> <span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">Predicate</span> <span class="identifier">p</span> <span class="special">);</span> +</pre> +<p> + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.is_partitioned.h1"></a> + <span><a name="the_boost_algorithm_library.CXX11.is_partitioned.examples"></a></span><a class="link" href="is_partitioned.html#the_boost_algorithm_library.CXX11.is_partitioned.examples">Examples</a> + </h5> +<p> + Given the container <code class="computeroutput"><span class="identifier">c</span></code> containing + <code class="computeroutput"><span class="special">{</span> <span class="number">0</span><span class="special">,</span> <span class="number">1</span><span class="special">,</span> + <span class="number">2</span><span class="special">,</span> <span class="number">3</span><span class="special">,</span> <span class="number">14</span><span class="special">,</span> <span class="number">15</span> <span class="special">}</span></code>, + then +</p> +<pre class="programlisting"><span class="keyword">bool</span> <span class="identifier">isOdd</span> <span class="special">(</span> <span class="keyword">int</span> <span class="identifier">i</span> <span class="special">)</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">i</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">;</span> <span class="special">}</span> +<span class="keyword">bool</span> <span class="identifier">lessThan10</span> <span class="special">(</span> <span class="keyword">int</span> <span class="identifier">i</span> <span class="special">)</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">i</span> <span class="special"><</span> <span class="number">10</span><span class="special">;</span> <span class="special">}</span> + +<span class="identifier">is_partitioned</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">,</span> <span class="identifier">isOdd</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">false</span> +<span class="identifier">is_partitioned</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">,</span> <span class="identifier">lessThan10</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">true</span> +<span class="identifier">is_partitioned</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">lessThan10</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">true</span> +<span class="identifier">is_partitioned</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">()</span> <span class="special">+</span> <span class="number">3</span><span class="special">,</span> <span class="identifier">lessThan10</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">true</span> +<span class="identifier">is_partitioned</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">isOdd</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">true</span> <span class="comment">// empty range</span> +</pre> +<p> + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.is_partitioned.h2"></a> + <span><a name="the_boost_algorithm_library.CXX11.is_partitioned.iterator_requirements"></a></span><a class="link" href="is_partitioned.html#the_boost_algorithm_library.CXX11.is_partitioned.iterator_requirements">Iterator + Requirements</a> + </h5> +<p> + <code class="computeroutput"><span class="identifier">is_partitioned</span></code> works on all + iterators except output iterators. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.is_partitioned.h3"></a> + <span><a name="the_boost_algorithm_library.CXX11.is_partitioned.complexity"></a></span><a class="link" href="is_partitioned.html#the_boost_algorithm_library.CXX11.is_partitioned.complexity">Complexity</a> + </h5> +<p> + Both of the variants of <code class="computeroutput"><span class="identifier">is_partitioned</span></code> + run in <span class="emphasis"><em>O(N)</em></span> (linear) time; that is, they compare against + each element in the list once. If the sequence is found to be not partitioned + at any point, the routine will terminate immediately, without examining the + rest of the elements. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.is_partitioned.h4"></a> + <span><a name="the_boost_algorithm_library.CXX11.is_partitioned.exception_safety"></a></span><a class="link" href="is_partitioned.html#the_boost_algorithm_library.CXX11.is_partitioned.exception_safety">Exception + Safety</a> + </h5> +<p> + Both of the variants of <code class="computeroutput"><span class="identifier">is_partitioned</span></code> + take their parameters by value or const reference, and do not depend upon + any global state. Therefore, all the routines in this file provide the strong + exception guarantee. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.is_partitioned.h5"></a> + <span><a name="the_boost_algorithm_library.CXX11.is_partitioned.notes"></a></span><a class="link" href="is_partitioned.html#the_boost_algorithm_library.CXX11.is_partitioned.notes">Notes</a> + </h5> +<div class="itemizedlist"><ul class="itemizedlist" type="disc"> +<li class="listitem"> + The iterator-based version of the routine <code class="computeroutput"><span class="identifier">is_partitioned</span></code> + is part of the C++11 standard. When compiled using a C++11 implementation, + the implementation from the standard library will be used. + </li> +<li class="listitem"> + <code class="computeroutput"><span class="identifier">is_partitioned</span></code> returns + true for empty ranges, no matter what predicate is passed to test against. + </li> +</ul></div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="is_sorted.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/CXX11.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="partition_point.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/the_boost_algorithm_library/CXX11/is_sorted.html b/libs/algorithm/doc/html/the_boost_algorithm_library/CXX11/is_sorted.html new file mode 100644 index 0000000000..7a0327c3ef --- /dev/null +++ b/libs/algorithm/doc/html/the_boost_algorithm_library/CXX11/is_sorted.html @@ -0,0 +1,233 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>is_sorted</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../algorithm/CXX11.html" title="C++11 Algorithms"> +<link rel="prev" href="one_of.html" title="one_of"> +<link rel="next" href="is_partitioned.html" title="is_partitioned"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="one_of.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/CXX11.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="is_partitioned.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="the_boost_algorithm_library.CXX11.is_sorted"></a><a class="link" href="is_sorted.html" title="is_sorted">is_sorted + </a> +</h3></div></div></div> +<p> + The header file <code class="computeroutput"><span class="special"><</span><span class="identifier">boost</span><span class="special">/</span><span class="identifier">algorithm</span><span class="special">/</span><span class="identifier">cxx11</span><span class="special">/</span><span class="identifier">is_sorted</span><span class="special">.</span><span class="identifier">hpp</span><span class="special">></span></code> + contains functions for determining if a sequence is ordered. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.is_sorted.h0"></a> + <span><a name="the_boost_algorithm_library.CXX11.is_sorted.is_sorted"></a></span><a class="link" href="is_sorted.html#the_boost_algorithm_library.CXX11.is_sorted.is_sorted">is_sorted</a> + </h5> +<p> + The function <code class="computeroutput"><span class="identifier">is_sorted</span><span class="special">(</span><span class="identifier">sequence</span><span class="special">)</span></code> + determines whether or not a sequence is completely sorted according so some + criteria. If no comparison predicate is specified, then std::less_equal is + used (i.e, the test is to see if the sequence is non-decreasing) + </p> +<p> +</p> +<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">algorithm</span> <span class="special">{</span> + <span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Iterator</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Pred</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_sorted</span> <span class="special">(</span> <span class="identifier">Iterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">Iterator</span> <span class="identifier">last</span><span class="special">,</span> <span class="identifier">Pred</span> <span class="identifier">p</span> <span class="special">);</span> + + <span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Iterator</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_sorted</span> <span class="special">(</span> <span class="identifier">Iterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">Iterator</span> <span class="identifier">last</span> <span class="special">);</span> + + + <span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Range</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Pred</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_sorted</span> <span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">Pred</span> <span class="identifier">p</span> <span class="special">);</span> + + <span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Range</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_sorted</span> <span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span><span class="identifier">r</span> <span class="special">);</span> +<span class="special">}}</span> +</pre> +<p> + </p> +<p> + Iterator requirements: The <code class="computeroutput"><span class="identifier">is_sorted</span></code> + functions will work on all kinds of iterators (except output iterators). + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.is_sorted.h1"></a> + <span><a name="the_boost_algorithm_library.CXX11.is_sorted.is_sorted_until"></a></span><a class="link" href="is_sorted.html#the_boost_algorithm_library.CXX11.is_sorted.is_sorted_until">is_sorted_until</a> + </h5> +<p> + If <code class="computeroutput"><span class="identifier">distance</span><span class="special">(</span><span class="identifier">first</span><span class="special">,</span> <span class="identifier">last</span><span class="special">)</span> <span class="special"><</span> <span class="number">2</span></code>, then + <code class="computeroutput"><span class="identifier">is_sorted</span> <span class="special">(</span> + <span class="identifier">first</span><span class="special">,</span> + <span class="identifier">last</span> <span class="special">)</span></code> + returns <code class="computeroutput"><span class="identifier">last</span></code>. Otherwise, + it returns the last iterator i in [first,last] for which the range [first,i) + is sorted. + </p> +<p> + In short, it returns the element in the sequence that is "out of order". + If the entire sequence is sorted (according to the predicate), then it will + return <code class="computeroutput"><span class="identifier">last</span></code>. + </p> +<p> +</p> +<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">algorithm</span> <span class="special">{</span> + <span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">ForwardIterator</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Pred</span><span class="special">></span> + <span class="identifier">FI</span> <span class="identifier">is_sorted_until</span> <span class="special">(</span> <span class="identifier">ForwardIterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">ForwardIterator</span> <span class="identifier">last</span><span class="special">,</span> <span class="identifier">Pred</span> <span class="identifier">p</span> <span class="special">);</span> + + <span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">ForwardIterator</span><span class="special">></span> + <span class="identifier">ForwardIterator</span> <span class="identifier">is_sorted_until</span> <span class="special">(</span> <span class="identifier">ForwardIterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">ForwardIterator</span> <span class="identifier">last</span> <span class="special">);</span> + + + <span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Range</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Pred</span><span class="special">></span> + <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">R</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">is_sorted_until</span> <span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">Pred</span> <span class="identifier">p</span> <span class="special">);</span> + + <span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Range</span><span class="special">></span> + <span class="keyword">typename</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span><span class="keyword">const</span> <span class="identifier">R</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">is_sorted_until</span> <span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span><span class="identifier">r</span> <span class="special">);</span> +<span class="special">}}</span> +</pre> +<p> + </p> +<p> + Iterator requirements: The <code class="computeroutput"><span class="identifier">is_sorted_until</span></code> + functions will work on forward iterators or better. Since they have to return + a place in the input sequence, input iterators will not suffice. + </p> +<p> + Complexity: <code class="computeroutput"><span class="identifier">is_sorted_until</span></code> + will make at most <span class="emphasis"><em>N-1</em></span> calls to the predicate (given + a sequence of length <span class="emphasis"><em>N</em></span>). + </p> +<p> + Examples: + </p> +<p> + Given the sequence <code class="computeroutput"><span class="special">{</span> <span class="number">1</span><span class="special">,</span> <span class="number">2</span><span class="special">,</span> + <span class="number">3</span><span class="special">,</span> <span class="number">4</span><span class="special">,</span> <span class="number">5</span><span class="special">,</span> <span class="number">3</span> <span class="special">}</span></code>, + <code class="computeroutput"><span class="identifier">is_sorted_until</span> <span class="special">(</span> + <span class="identifier">beg</span><span class="special">,</span> + <span class="identifier">end</span><span class="special">,</span> + <span class="identifier">std</span><span class="special">::</span><span class="identifier">less</span><span class="special"><</span><span class="keyword">int</span><span class="special">>())</span></code> + would return an iterator pointing at the second <code class="computeroutput"><span class="number">3</span></code>. + </p> +<p> + Given the sequence <code class="computeroutput"><span class="special">{</span> <span class="number">1</span><span class="special">,</span> <span class="number">2</span><span class="special">,</span> + <span class="number">3</span><span class="special">,</span> <span class="number">4</span><span class="special">,</span> <span class="number">5</span><span class="special">,</span> <span class="number">9</span> <span class="special">}</span></code>, + <code class="computeroutput"><span class="identifier">is_sorted_until</span> <span class="special">(</span> + <span class="identifier">beg</span><span class="special">,</span> + <span class="identifier">end</span><span class="special">,</span> + <span class="identifier">std</span><span class="special">::</span><span class="identifier">less</span><span class="special"><</span><span class="keyword">int</span><span class="special">>())</span></code> + would return <code class="computeroutput"><span class="identifier">end</span></code>. + </p> +<p> + There are also a set of "wrapper functions" for is_ordered which + make it easy to see if an entire sequence is ordered. These functions return + a boolean indicating success or failure rather than an iterator to where + the out of order items were found. + </p> +<p> + To test if a sequence is increasing (each element at least as large as the + preceeding one): +</p> +<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">algorithm</span> <span class="special">{</span> + <span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Iterator</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_increasing</span> <span class="special">(</span> <span class="identifier">Iterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">Iterator</span> <span class="identifier">last</span> <span class="special">);</span> + + <span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">R</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_increasing</span> <span class="special">(</span> <span class="keyword">const</span> <span class="identifier">R</span> <span class="special">&</span><span class="identifier">range</span> <span class="special">);</span> +<span class="special">}}</span> +</pre> +<p> + </p> +<p> + To test if a sequence is decreasing (each element no larger than the preceeding + one): + </p> +<p> +</p> +<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">algorithm</span> <span class="special">{</span> + <span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Iterator</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_decreasing</span> <span class="special">(</span> <span class="identifier">Iterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">Iterator</span> <span class="identifier">last</span> <span class="special">);</span> + + <span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">R</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_decreasing</span> <span class="special">(</span> <span class="keyword">const</span> <span class="identifier">R</span> <span class="special">&</span><span class="identifier">range</span> <span class="special">);</span> +<span class="special">}}</span> +</pre> +<p> + </p> +<p> + To test if a sequence is strictly increasing (each element larger than the + preceeding one): +</p> +<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">algorithm</span> <span class="special">{</span> + <span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Iterator</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_strictly_increasing</span> <span class="special">(</span> <span class="identifier">Iterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">Iterator</span> <span class="identifier">last</span> <span class="special">);</span> + + <span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">R</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_strictly_increasing</span> <span class="special">(</span> <span class="keyword">const</span> <span class="identifier">R</span> <span class="special">&</span><span class="identifier">range</span> <span class="special">);</span> +<span class="special">}}</span> +</pre> +<p> + </p> +<p> + To test if a sequence is strictly decreasing (each element smaller than the + preceeding one): +</p> +<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">algorithm</span> <span class="special">{</span> + <span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Iterator</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_strictly_decreasing</span> <span class="special">(</span> <span class="identifier">Iterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">Iterator</span> <span class="identifier">last</span> <span class="special">);</span> + + <span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">R</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_strictly_decreasing</span> <span class="special">(</span> <span class="keyword">const</span> <span class="identifier">R</span> <span class="special">&</span><span class="identifier">range</span> <span class="special">);</span> +<span class="special">}}</span> +</pre> +<p> + </p> +<p> + Complexity: Each of these calls is just a thin wrapper over <code class="computeroutput"><span class="identifier">is_sorted</span></code>, so they have the same complexity + as <code class="computeroutput"><span class="identifier">is_sorted</span></code>. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.is_sorted.h2"></a> + <span><a name="the_boost_algorithm_library.CXX11.is_sorted.notes"></a></span><a class="link" href="is_sorted.html#the_boost_algorithm_library.CXX11.is_sorted.notes">Notes</a> + </h5> +<div class="itemizedlist"><ul class="itemizedlist" type="disc"> +<li class="listitem"> + The routines <code class="computeroutput"><span class="identifier">is_sorted</span></code> + and <code class="computeroutput"><span class="identifier">is_sorted_until</span></code> are + part of the C++11 standard. When compiled using a C++11 implementation, + the implementation from the standard library will be used. + </li> +<li class="listitem"> + <code class="computeroutput"><span class="identifier">is_sorted</span></code> and <code class="computeroutput"><span class="identifier">is_sorted_until</span></code> both return true for + empty ranges and ranges of length one. + </li> +</ul></div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="one_of.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/CXX11.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="is_partitioned.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/the_boost_algorithm_library/CXX11/none_of.html b/libs/algorithm/doc/html/the_boost_algorithm_library/CXX11/none_of.html new file mode 100644 index 0000000000..6cd0057629 --- /dev/null +++ b/libs/algorithm/doc/html/the_boost_algorithm_library/CXX11/none_of.html @@ -0,0 +1,186 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>none_of</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../algorithm/CXX11.html" title="C++11 Algorithms"> +<link rel="prev" href="any_of.html" title="any_of"> +<link rel="next" href="one_of.html" title="one_of"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="any_of.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/CXX11.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="one_of.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="the_boost_algorithm_library.CXX11.none_of"></a><a class="link" href="none_of.html" title="none_of">none_of</a> +</h3></div></div></div> +<p> + The header file 'boost/algorithm/cxx11/none_of.hpp' contains four variants + of a single algorithm, <code class="computeroutput"><span class="identifier">none_of</span></code>. + The algorithm tests all the elements of a sequence and returns true if they + none of them share a property. + </p> +<p> + The routine <code class="computeroutput"><span class="identifier">none_of</span></code> takes + a sequence and a predicate. It will return true if the predicate returns + false when applied to every element in the sequence. + </p> +<p> + The routine <code class="computeroutput"><span class="identifier">none_of_equal</span></code> + takes a sequence and a value. It will return true if none of the elements + in the sequence compare equal to the passed in value. + </p> +<p> + Both routines come in two forms; the first one takes two iterators to define + the range. The second form takes a single range parameter, and uses Boost.Range + to traverse it. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.none_of.h0"></a> + <span><a name="the_boost_algorithm_library.CXX11.none_of.interface"></a></span><a class="link" href="none_of.html#the_boost_algorithm_library.CXX11.none_of.interface">interface</a> + </h5> +<p> + The function <code class="computeroutput"><span class="identifier">none_of</span></code> returns + true if the predicate returns false for every item in the sequence. There + are two versions; one takes two iterators, and the other takes a range. + </p> +<p> +</p> +<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">algorithm</span> <span class="special">{</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Predicate</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">none_of</span> <span class="special">(</span> <span class="identifier">InputIterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">InputIterator</span> <span class="identifier">last</span><span class="special">,</span> <span class="identifier">Predicate</span> <span class="identifier">p</span> <span class="special">);</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Range</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Predicate</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">none_of</span> <span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">Predicate</span> <span class="identifier">p</span> <span class="special">);</span> +<span class="special">}}</span> +</pre> +<p> + </p> +<p> + The function <code class="computeroutput"><span class="identifier">none_of_equal</span></code> + is similar to <code class="computeroutput"><span class="identifier">none_of</span></code>, but + instead of taking a predicate to test the elements of the sequence, it takes + a value to compare against. + </p> +<p> +</p> +<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">algorithm</span> <span class="special">{</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">V</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">none_of_equal</span> <span class="special">(</span> <span class="identifier">InputIterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">InputIterator</span> <span class="identifier">last</span><span class="special">,</span> <span class="identifier">V</span> <span class="keyword">const</span> <span class="special">&</span><span class="identifier">val</span> <span class="special">);</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Range</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">V</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">none_of_equal</span> <span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">V</span> <span class="keyword">const</span> <span class="special">&</span><span class="identifier">val</span> <span class="special">);</span> +<span class="special">}}</span> +</pre> +<p> + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.none_of.h1"></a> + <span><a name="the_boost_algorithm_library.CXX11.none_of.examples"></a></span><a class="link" href="none_of.html#the_boost_algorithm_library.CXX11.none_of.examples">Examples</a> + </h5> +<p> + Given the container <code class="computeroutput"><span class="identifier">c</span></code> containing + <code class="computeroutput"><span class="special">{</span> <span class="number">0</span><span class="special">,</span> <span class="number">1</span><span class="special">,</span> + <span class="number">2</span><span class="special">,</span> <span class="number">3</span><span class="special">,</span> <span class="number">14</span><span class="special">,</span> <span class="number">15</span> <span class="special">}</span></code>, + then +</p> +<pre class="programlisting"><span class="keyword">bool</span> <span class="identifier">isOdd</span> <span class="special">(</span> <span class="keyword">int</span> <span class="identifier">i</span> <span class="special">)</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">i</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">;</span> <span class="special">}</span> +<span class="keyword">bool</span> <span class="identifier">lessThan10</span> <span class="special">(</span> <span class="keyword">int</span> <span class="identifier">i</span> <span class="special">)</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">i</span> <span class="special"><</span> <span class="number">10</span><span class="special">;</span> <span class="special">}</span> + +<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">algorithm</span><span class="special">;</span> + +<span class="identifier">none_of</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">,</span> <span class="identifier">isOdd</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">false</span> +<span class="identifier">none_of</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">lessThan10</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">false</span> +<span class="identifier">none_of</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">()</span> <span class="special">+</span> <span class="number">4</span><span class="special">,</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">lessThan10</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">true</span> +<span class="identifier">none_of</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">isOdd</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">true</span> <span class="comment">// empty range</span> +<span class="identifier">none_of_equal</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">,</span> <span class="number">3</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">false</span> +<span class="identifier">none_of_equal</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">()</span> <span class="special">+</span> <span class="number">3</span><span class="special">,</span> <span class="number">3</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">true</span> +<span class="identifier">none_of_equal</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="number">99</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">true</span> <span class="comment">// empty range</span> +</pre> +<p> + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.none_of.h2"></a> + <span><a name="the_boost_algorithm_library.CXX11.none_of.iterator_requirements"></a></span><a class="link" href="none_of.html#the_boost_algorithm_library.CXX11.none_of.iterator_requirements">Iterator + Requirements</a> + </h5> +<p> + <code class="computeroutput"><span class="identifier">none_of</span></code> and <code class="computeroutput"><span class="identifier">none_of_equal</span></code> work on all iterators except + output iterators. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.none_of.h3"></a> + <span><a name="the_boost_algorithm_library.CXX11.none_of.complexity"></a></span><a class="link" href="none_of.html#the_boost_algorithm_library.CXX11.none_of.complexity">Complexity</a> + </h5> +<p> + All of the variants of <code class="computeroutput"><span class="identifier">none_of</span></code> + and <code class="computeroutput"><span class="identifier">none_of_equal</span></code> run in + <span class="emphasis"><em>O(N)</em></span> (linear) time; that is, they compare against each + element in the list once. If any of the comparisons succeed, the algorithm + will terminate immediately, without examining the remaining members of the + sequence. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.none_of.h4"></a> + <span><a name="the_boost_algorithm_library.CXX11.none_of.exception_safety"></a></span><a class="link" href="none_of.html#the_boost_algorithm_library.CXX11.none_of.exception_safety">Exception + Safety</a> + </h5> +<p> + All of the variants of <code class="computeroutput"><span class="identifier">none_of</span></code> + and <code class="computeroutput"><span class="identifier">none_of_equal</span></code> take their + parameters by value or const reference, and do not depend upon any global + state. Therefore, all the routines in this file provide the strong exception + guarantee. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.none_of.h5"></a> + <span><a name="the_boost_algorithm_library.CXX11.none_of.notes"></a></span><a class="link" href="none_of.html#the_boost_algorithm_library.CXX11.none_of.notes">Notes</a> + </h5> +<div class="itemizedlist"><ul class="itemizedlist" type="disc"> +<li class="listitem"> + The routine <code class="computeroutput"><span class="identifier">none_of</span></code> is + part of the C++11 standard. When compiled using a C++11 implementation, + the implementation from the standard library will be used. + </li> +<li class="listitem"> + <code class="computeroutput"><span class="identifier">none_of</span></code> and <code class="computeroutput"><span class="identifier">none_of_equal</span></code> both return true for + empty ranges, no matter what is passed to test against. + </li> +<li class="listitem"> + The second parameter to <code class="computeroutput"><span class="identifier">none_of_value</span></code> + is a template parameter, rather than deduced from the first parameter + (<code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span><span class="identifier">InputIterator</span><span class="special">>::</span><span class="identifier">value_type</span></code>) because that allows more + flexibility for callers, and takes advantage of built-in comparisons + for the type that is pointed to by the iterator. The function is defined + to return true if, for all elements in the sequence, the expression + <code class="computeroutput"><span class="special">*</span><span class="identifier">iter</span> + <span class="special">==</span> <span class="identifier">val</span></code> + evaluates to false (where <code class="computeroutput"><span class="identifier">iter</span></code> + is an iterator to each element in the sequence) + </li> +</ul></div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="any_of.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/CXX11.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="one_of.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/the_boost_algorithm_library/CXX11/one_of.html b/libs/algorithm/doc/html/the_boost_algorithm_library/CXX11/one_of.html new file mode 100644 index 0000000000..a36220996c --- /dev/null +++ b/libs/algorithm/doc/html/the_boost_algorithm_library/CXX11/one_of.html @@ -0,0 +1,178 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>one_of</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../algorithm/CXX11.html" title="C++11 Algorithms"> +<link rel="prev" href="none_of.html" title="none_of"> +<link rel="next" href="is_sorted.html" title="is_sorted"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="none_of.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/CXX11.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="is_sorted.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="the_boost_algorithm_library.CXX11.one_of"></a><a class="link" href="one_of.html" title="one_of">one_of</a> +</h3></div></div></div> +<p> + The header file 'boost/algorithm/cxx11/one_of.hpp' contains four variants + of a single algorithm, <code class="computeroutput"><span class="identifier">one_of</span></code>. + The algorithm tests the elements of a sequence and returns true if exactly + one of the elements in the sequence has a particular property. + </p> +<p> + The routine <code class="computeroutput"><span class="identifier">one_of</span></code> takes + a sequence and a predicate. It will return true if the predicate returns + true for one element in the sequence. + </p> +<p> + The routine <code class="computeroutput"><span class="identifier">one_of_equal</span></code> + takes a sequence and a value. It will return true if one element in the sequence + compares equal to the passed in value. + </p> +<p> + Both routines come in two forms; the first one takes two iterators to define + the range. The second form takes a single range parameter, and uses Boost.Range + to traverse it. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.one_of.h0"></a> + <span><a name="the_boost_algorithm_library.CXX11.one_of.interface"></a></span><a class="link" href="one_of.html#the_boost_algorithm_library.CXX11.one_of.interface">interface</a> + </h5> +<p> + The function <code class="computeroutput"><span class="identifier">one_of</span></code> returns + true if the predicate returns true for one item in the sequence. There are + two versions; one takes two iterators, and the other takes a range. + </p> +<p> +</p> +<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">algorithm</span> <span class="special">{</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Predicate</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">one_of</span> <span class="special">(</span> <span class="identifier">InputIterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">InputIterator</span> <span class="identifier">last</span><span class="special">,</span> <span class="identifier">Predicate</span> <span class="identifier">p</span> <span class="special">);</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Range</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Predicate</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">one_of</span> <span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">Predicate</span> <span class="identifier">p</span> <span class="special">);</span> +<span class="special">}}</span> +</pre> +<p> + </p> +<p> + The function <code class="computeroutput"><span class="identifier">one_of_equal</span></code> + is similar to <code class="computeroutput"><span class="identifier">one_of</span></code>, but + instead of taking a predicate to test the elements of the sequence, it takes + a value to compare against. + </p> +<p> +</p> +<pre class="programlisting"><span class="keyword">namespace</span> <span class="identifier">boost</span> <span class="special">{</span> <span class="keyword">namespace</span> <span class="identifier">algorithm</span> <span class="special">{</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">V</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">one_of_equal</span> <span class="special">(</span> <span class="identifier">InputIterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">InputIterator</span> <span class="identifier">last</span><span class="special">,</span> <span class="identifier">V</span> <span class="keyword">const</span> <span class="special">&</span><span class="identifier">val</span> <span class="special">);</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Range</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">V</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">one_of_equal</span> <span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">V</span> <span class="keyword">const</span> <span class="special">&</span><span class="identifier">val</span> <span class="special">);</span> +<span class="special">}}</span> +</pre> +<p> + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.one_of.h1"></a> + <span><a name="the_boost_algorithm_library.CXX11.one_of.examples"></a></span><a class="link" href="one_of.html#the_boost_algorithm_library.CXX11.one_of.examples">Examples</a> + </h5> +<p> + Given the container <code class="computeroutput"><span class="identifier">c</span></code> containing + <code class="computeroutput"><span class="special">{</span> <span class="number">0</span><span class="special">,</span> <span class="number">1</span><span class="special">,</span> + <span class="number">2</span><span class="special">,</span> <span class="number">3</span><span class="special">,</span> <span class="number">14</span><span class="special">,</span> <span class="number">15</span> <span class="special">}</span></code>, + then +</p> +<pre class="programlisting"><span class="keyword">bool</span> <span class="identifier">isOdd</span> <span class="special">(</span> <span class="keyword">int</span> <span class="identifier">i</span> <span class="special">)</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">i</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">;</span> <span class="special">}</span> +<span class="keyword">bool</span> <span class="identifier">lessThan10</span> <span class="special">(</span> <span class="keyword">int</span> <span class="identifier">i</span> <span class="special">)</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">i</span> <span class="special"><</span> <span class="number">10</span><span class="special">;</span> <span class="special">}</span> + +<span class="keyword">using</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">algorithm</span><span class="special">;</span> +<span class="identifier">one_of</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">,</span> <span class="identifier">isOdd</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">false</span> +<span class="identifier">one_of</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">lessThan10</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">false</span> +<span class="identifier">one_of</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">()</span> <span class="special">+</span> <span class="number">3</span><span class="special">,</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">lessThan10</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">true</span> +<span class="identifier">one_of</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">isOdd</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">false</span> <span class="comment">// empty range</span> +<span class="identifier">one_of_equal</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">,</span> <span class="number">3</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">true</span> +<span class="identifier">one_of_equal</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">()</span> <span class="special">+</span> <span class="number">3</span><span class="special">,</span> <span class="number">3</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">false</span> +<span class="identifier">one_of_equal</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="number">99</span> <span class="special">)</span> <span class="special">--></span> <span class="keyword">false</span> <span class="comment">// empty range</span> +</pre> +<p> + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.one_of.h2"></a> + <span><a name="the_boost_algorithm_library.CXX11.one_of.iterator_requirements"></a></span><a class="link" href="one_of.html#the_boost_algorithm_library.CXX11.one_of.iterator_requirements">Iterator + Requirements</a> + </h5> +<p> + <code class="computeroutput"><span class="identifier">one_of</span></code> and <code class="computeroutput"><span class="identifier">one_of_equal</span></code> work on all iterators except + output iterators. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.one_of.h3"></a> + <span><a name="the_boost_algorithm_library.CXX11.one_of.complexity"></a></span><a class="link" href="one_of.html#the_boost_algorithm_library.CXX11.one_of.complexity">Complexity</a> + </h5> +<p> + All of the variants of <code class="computeroutput"><span class="identifier">one_of</span></code> + and <code class="computeroutput"><span class="identifier">one_of_equal</span></code> run in + <span class="emphasis"><em>O(N)</em></span> (linear) time; that is, they compare against each + element in the list once. If more than one of the elements in the sequence + satisfy the condition, then algorithm will return false immediately, without + examining the remaining members of the sequence. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.one_of.h4"></a> + <span><a name="the_boost_algorithm_library.CXX11.one_of.exception_safety"></a></span><a class="link" href="one_of.html#the_boost_algorithm_library.CXX11.one_of.exception_safety">Exception + Safety</a> + </h5> +<p> + All of the variants of <code class="computeroutput"><span class="identifier">one_of</span></code> + and <code class="computeroutput"><span class="identifier">one_of_equal</span></code> take their + parameters by value or const reference, and do not depend upon any global + state. Therefore, all the routines in this file provide the strong exception + guarantee. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.one_of.h5"></a> + <span><a name="the_boost_algorithm_library.CXX11.one_of.notes"></a></span><a class="link" href="one_of.html#the_boost_algorithm_library.CXX11.one_of.notes">Notes</a> + </h5> +<div class="itemizedlist"><ul class="itemizedlist" type="disc"> +<li class="listitem"> + <code class="computeroutput"><span class="identifier">one_of</span></code> and <code class="computeroutput"><span class="identifier">one_of_equal</span></code> both return false for + empty ranges, no matter what is passed to test against. + </li> +<li class="listitem"> + The second parameter to <code class="computeroutput"><span class="identifier">one_of_value</span></code> + is a template parameter, rather than deduced from the first parameter + (<code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">iterator_traits</span><span class="special"><</span><span class="identifier">InputIterator</span><span class="special">>::</span><span class="identifier">value_type</span></code>) because that allows more + flexibility for callers, and takes advantage of built-in comparisons + for the type that is pointed to by the iterator. The function is defined + to return true if, for one element in the sequence, the expression <code class="computeroutput"><span class="special">*</span><span class="identifier">iter</span> <span class="special">==</span> <span class="identifier">val</span></code> + evaluates to true (where <code class="computeroutput"><span class="identifier">iter</span></code> + is an iterator to each element in the sequence) + </li> +</ul></div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="none_of.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/CXX11.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="is_sorted.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/the_boost_algorithm_library/CXX11/partition_point.html b/libs/algorithm/doc/html/the_boost_algorithm_library/CXX11/partition_point.html new file mode 100644 index 0000000000..68242bb249 --- /dev/null +++ b/libs/algorithm/doc/html/the_boost_algorithm_library/CXX11/partition_point.html @@ -0,0 +1,145 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>partition_point</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../algorithm/CXX11.html" title="C++11 Algorithms"> +<link rel="prev" href="is_partitioned.html" title="is_partitioned"> +<link rel="next" href="../../algorithm/Misc.html" title="Other Algorithms"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="is_partitioned.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/CXX11.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../algorithm/Misc.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="the_boost_algorithm_library.CXX11.partition_point"></a><a class="link" href="partition_point.html" title="partition_point">partition_point + </a> +</h3></div></div></div> +<p> + The header file 'partition_point.hpp' contains two variants of a single algorithm, + <code class="computeroutput"><span class="identifier">partition_point</span></code>. Given a + partitioned sequence and a predicate, the algorithm finds the partition point; + i.e, the first element in the sequence that does not satisfy the predicate. + </p> +<p> + The routine <code class="computeroutput"><span class="identifier">partition_point</span></code> + takes a partitioned sequence and a predicate. It returns an iterator which + 'points to' the first element in the sequence that does not satisfy the predicate. + If all the items in the sequence satisfy the predicate, then it returns one + past the final element in the sequence. + </p> +<p> + <code class="computeroutput"><span class="identifier">partition_point</span></code> come in two + forms; the first one takes two iterators to define the range. The second + form takes a single range parameter, and uses Boost.Range to traverse it. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.partition_point.h0"></a> + <span><a name="the_boost_algorithm_library.CXX11.partition_point.interface"></a></span><a class="link" href="partition_point.html#the_boost_algorithm_library.CXX11.partition_point.interface">interface</a> + </h5> +<p> + There are two versions; one takes two iterators, and the other takes a range. + </p> +<p> +</p> +<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">ForwardIterator</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Predicate</span><span class="special">></span> + <span class="identifier">ForwardIterator</span> <span class="identifier">partition_point</span> <span class="special">(</span> <span class="identifier">ForwardIterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">ForwardIterator</span> <span class="identifier">last</span><span class="special">,</span> <span class="identifier">Predicate</span> <span class="identifier">p</span> <span class="special">);</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Range</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Predicate</span><span class="special">></span> + <span class="identifier">boost</span><span class="special">::</span><span class="identifier">range_iterator</span><span class="special"><</span><span class="identifier">Range</span><span class="special">></span> <span class="identifier">partition_point</span> <span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">Predicate</span> <span class="identifier">p</span> <span class="special">);</span> +</pre> +<p> + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.partition_point.h1"></a> + <span><a name="the_boost_algorithm_library.CXX11.partition_point.examples"></a></span><a class="link" href="partition_point.html#the_boost_algorithm_library.CXX11.partition_point.examples">Examples</a> + </h5> +<p> + Given the container <code class="computeroutput"><span class="identifier">c</span></code> containing + <code class="computeroutput"><span class="special">{</span> <span class="number">0</span><span class="special">,</span> <span class="number">1</span><span class="special">,</span> + <span class="number">2</span><span class="special">,</span> <span class="number">3</span><span class="special">,</span> <span class="number">14</span><span class="special">,</span> <span class="number">15</span> <span class="special">}</span></code>, + then +</p> +<pre class="programlisting"><span class="keyword">bool</span> <span class="identifier">lessThan10</span> <span class="special">(</span> <span class="keyword">int</span> <span class="identifier">i</span> <span class="special">)</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">i</span> <span class="special"><</span> <span class="number">10</span><span class="special">;</span> <span class="special">}</span> +<span class="keyword">bool</span> <span class="identifier">isOdd</span> <span class="special">(</span> <span class="keyword">int</span> <span class="identifier">i</span> <span class="special">)</span> <span class="special">{</span> <span class="keyword">return</span> <span class="identifier">i</span> <span class="special">%</span> <span class="number">2</span> <span class="special">==</span> <span class="number">1</span><span class="special">;</span> <span class="special">}</span> + +<span class="identifier">partition_point</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">,</span> <span class="identifier">lessThan10</span> <span class="special">)</span> <span class="special">--></span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">()</span> <span class="special">+</span> <span class="number">4</span> <span class="special">(</span><span class="identifier">pointing</span> <span class="identifier">at</span> <span class="number">14</span><span class="special">)</span> +<span class="identifier">partition_point</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">lessThan10</span> <span class="special">)</span> <span class="special">--></span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">()</span> <span class="special">+</span> <span class="number">4</span> <span class="special">(</span><span class="identifier">pointing</span> <span class="identifier">at</span> <span class="number">14</span><span class="special">)</span> +<span class="identifier">partition_point</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">()</span> <span class="special">+</span> <span class="number">3</span><span class="special">,</span> <span class="identifier">lessThan10</span> <span class="special">)</span> <span class="special">-></span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">()</span> <span class="special">+</span> <span class="number">3</span> <span class="special">(</span><span class="identifier">end</span><span class="special">)</span> +<span class="identifier">partition_point</span> <span class="special">(</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">isOdd</span> <span class="special">)</span> <span class="special">--></span> <span class="identifier">c</span><span class="special">.</span><span class="identifier">end</span> <span class="special">()</span> <span class="comment">// empty range</span> +</pre> +<p> + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.partition_point.h2"></a> + <span><a name="the_boost_algorithm_library.CXX11.partition_point.iterator_requirements"></a></span><a class="link" href="partition_point.html#the_boost_algorithm_library.CXX11.partition_point.iterator_requirements">Iterator + Requirements</a> + </h5> +<p> + <code class="computeroutput"><span class="identifier">partition_point</span></code> requires + forward iterators or better; it will not work on input iterators or output + iterators. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.partition_point.h3"></a> + <span><a name="the_boost_algorithm_library.CXX11.partition_point.complexity"></a></span><a class="link" href="partition_point.html#the_boost_algorithm_library.CXX11.partition_point.complexity">Complexity</a> + </h5> +<p> + Both of the variants of <code class="computeroutput"><span class="identifier">partition_point</span></code> + run in <span class="emphasis"><em>O( log (N))</em></span> (logarithmic) time; that is, the + predicate will be will be applied approximately <span class="emphasis"><em>log(N)</em></span> + times. To do this, however, the algorithm needs to know the size of the sequence. + For forward and bidirectional iterators, calculating the size of the sequence + is an <span class="emphasis"><em>O(N)</em></span> operation. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.partition_point.h4"></a> + <span><a name="the_boost_algorithm_library.CXX11.partition_point.exception_safety"></a></span><a class="link" href="partition_point.html#the_boost_algorithm_library.CXX11.partition_point.exception_safety">Exception + Safety</a> + </h5> +<p> + Both of the variants of <code class="computeroutput"><span class="identifier">partition_point</span></code> + take their parameters by value or const reference, and do not depend upon + any global state. Therefore, all the routines in this file provide the strong + exception guarantee. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.partition_point.h5"></a> + <span><a name="the_boost_algorithm_library.CXX11.partition_point.notes"></a></span><a class="link" href="partition_point.html#the_boost_algorithm_library.CXX11.partition_point.notes">Notes</a> + </h5> +<div class="itemizedlist"><ul class="itemizedlist" type="disc"> +<li class="listitem"> + The iterator-based version of the routine <code class="computeroutput"><span class="identifier">partition_point</span></code> + is part of the C++11 standard. When compiled using a C++11 implementation, + the implementation from the standard library will be used. + </li> +<li class="listitem"> + For empty ranges, the partition point is the end of the range. + </li> +</ul></div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="is_partitioned.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/CXX11.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../algorithm/Misc.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/the_boost_algorithm_library/Misc/hex.html b/libs/algorithm/doc/html/the_boost_algorithm_library/Misc/hex.html new file mode 100644 index 0000000000..61e4e43027 --- /dev/null +++ b/libs/algorithm/doc/html/the_boost_algorithm_library/Misc/hex.html @@ -0,0 +1,209 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>hex</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../algorithm/Misc.html" title="Other Algorithms"> +<link rel="prev" href="../../algorithm/Misc.html" title="Other Algorithms"> +<link rel="next" href="../../algorithm/reference.html" title="Reference"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../algorithm/Misc.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/Misc.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../algorithm/reference.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="the_boost_algorithm_library.Misc.hex"></a><a class="link" href="hex.html" title="hex">hex</a> +</h3></div></div></div> +<p> + The header file <code class="computeroutput"><span class="char">'boost/algorithm/hex.hpp'</span></code> + contains three variants each of two algorithms, <code class="computeroutput"><span class="identifier">hex</span></code> + and <code class="computeroutput"><span class="identifier">unhex</span></code>. They are inverse + algorithms; that is, one undoes the effort of the other. <code class="computeroutput"><span class="identifier">hex</span></code> + takes a sequence of values, and turns them into hexadecimal characters. + <code class="computeroutput"><span class="identifier">unhex</span></code> takes a sequence of + hexadecimal characters, and outputs a sequence of values. + </p> +<p> + <code class="computeroutput"><span class="identifier">hex</span></code> and <code class="computeroutput"><span class="identifier">unhex</span></code> + come from MySQL, where they are used in database queries and stored procedures. + </p> +<h5> +<a name="the_boost_algorithm_library.Misc.hex.h0"></a> + <span><a name="the_boost_algorithm_library.Misc.hex.interface"></a></span><a class="link" href="hex.html#the_boost_algorithm_library.Misc.hex.interface">interface</a> + </h5> +<p> + The function <code class="computeroutput"><span class="identifier">hex</span></code> takes a + sequence of values and writes hexadecimal characters. There are three different + interfaces, differing only in how the input sequence is specified. + </p> +<p> + The first one takes an iterator pair. The second one takes a pointer to the + start of a zero-terminated sequence, such as a c string, and the third takes + a range as defined by the Boost.Range library. + </p> +<p> +</p> +<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">OutputIterator</span><span class="special">></span> +<span class="identifier">OutputIterator</span> <span class="identifier">hex</span> <span class="special">(</span> <span class="identifier">InputIterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">InputIterator</span> <span class="identifier">last</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span> <span class="special">);</span> + +<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">OutputIterator</span><span class="special">></span> +<span class="identifier">OutputIterator</span> <span class="identifier">hex</span> <span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span> <span class="special">*</span><span class="identifier">ptr</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span> <span class="special">);</span> + +<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Range</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">OutputIterator</span><span class="special">></span> +<span class="identifier">OutputIterator</span> <span class="identifier">hex</span> <span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span> <span class="special">);</span> +</pre> +<p> + </p> +<p> + <code class="computeroutput"><span class="identifier">hex</span></code> writes only values in + the range '0'..'9' and 'A'..'F', but is not limited to character output. + The output iterator could refer to a wstring, or a vector of integers, or + any other integral type. + </p> +<p> + The function <code class="computeroutput"><span class="identifier">unhex</span></code> takes + the output of <code class="computeroutput"><span class="identifier">hex</span></code> and turns + it back into a sequence of values. + </p> +<p> + The input parameters for the different variations of <code class="computeroutput"><span class="identifier">unhex</span></code> + are the same as <code class="computeroutput"><span class="identifier">hex</span></code>. + </p> +<p> +</p> +<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">InputIterator</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">OutputIterator</span><span class="special">></span> +<span class="identifier">OutputIterator</span> <span class="identifier">unhex</span> <span class="special">(</span> <span class="identifier">InputIterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">InputIterator</span> <span class="identifier">last</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span> <span class="special">);</span> + +<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">T</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">OutputIterator</span><span class="special">></span> +<span class="identifier">OutputIterator</span> <span class="identifier">unhex</span> <span class="special">(</span> <span class="keyword">const</span> <span class="identifier">T</span> <span class="special">*</span><span class="identifier">ptr</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span> <span class="special">);</span> + +<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">Range</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">OutputIterator</span><span class="special">></span> +<span class="identifier">OutputIterator</span> <span class="identifier">unhex</span> <span class="special">(</span> <span class="keyword">const</span> <span class="identifier">Range</span> <span class="special">&</span><span class="identifier">r</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="identifier">out</span> <span class="special">);</span> +</pre> +<p> + </p> +<h5> +<a name="the_boost_algorithm_library.Misc.hex.h1"></a> + <span><a name="the_boost_algorithm_library.Misc.hex.error_handling"></a></span><a class="link" href="hex.html#the_boost_algorithm_library.Misc.hex.error_handling">Error + Handling</a> + </h5> +<p> + The header 'hex.hpp' defines three exception classes: +</p> +<pre class="programlisting"><span class="keyword">struct</span> <span class="identifier">hex_decode_error</span><span class="special">:</span> <span class="keyword">virtual</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">exception</span><span class="special">,</span> <span class="keyword">virtual</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">exception</span> <span class="special">{};</span> +<span class="keyword">struct</span> <span class="identifier">not_enough_input</span> <span class="special">:</span> <span class="keyword">public</span> <span class="identifier">hex_decode_error</span><span class="special">;</span> +<span class="keyword">struct</span> <span class="identifier">non_hex_input</span> <span class="special">:</span> <span class="keyword">public</span> <span class="identifier">hex_decode_error</span><span class="special">;</span> +</pre> +<p> + </p> +<p> + If the input to <code class="computeroutput"><span class="identifier">unhex</span></code> does + not contain an "even number" of hex digits, then an exception of + type <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">algorithm</span><span class="special">::</span><span class="identifier">not_enough_input</span></code> is thrown. + </p> +<p> + If the input to <code class="computeroutput"><span class="identifier">unhex</span></code> contains + any non-hexadecimal characters, then an exception of type <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">algorithm</span><span class="special">::</span><span class="identifier">non_hex_input</span></code> + is thrown. + </p> +<p> + If you want to catch all the decoding errors, you can catch exceptions of + type <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">algorithm</span><span class="special">::</span><span class="identifier">hex_decode_error</span></code>. + </p> +<h5> +<a name="the_boost_algorithm_library.Misc.hex.h2"></a> + <span><a name="the_boost_algorithm_library.Misc.hex.examples"></a></span><a class="link" href="hex.html#the_boost_algorithm_library.Misc.hex.examples">Examples</a> + </h5> +<p> + Assuming that <code class="computeroutput"><span class="identifier">out</span></code> is an iterator + that accepts <code class="computeroutput"><span class="keyword">char</span></code> values, and + <code class="computeroutput"><span class="identifier">wout</span></code> accepts <code class="computeroutput"><span class="keyword">wchar_t</span></code> values (and that sizeof ( wchar_t + ) == 2) + </p> +<p> +</p> +<pre class="programlisting"><span class="identifier">hex</span> <span class="special">(</span> <span class="string">"abcdef"</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">)</span> <span class="special">--></span> <span class="string">"616263646566"</span> +<span class="identifier">hex</span> <span class="special">(</span> <span class="string">"32"</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">)</span> <span class="special">--></span> <span class="string">"3332"</span> +<span class="identifier">hex</span> <span class="special">(</span> <span class="string">"abcdef"</span><span class="special">,</span> <span class="identifier">wout</span> <span class="special">)</span> <span class="special">--></span> <span class="string">"006100620063006400650066"</span> +<span class="identifier">hex</span> <span class="special">(</span> <span class="string">"32"</span><span class="special">,</span> <span class="identifier">wout</span> <span class="special">)</span> <span class="special">--></span> <span class="string">"00330032"</span> + +<span class="identifier">unhex</span> <span class="special">(</span> <span class="string">"616263646566"</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">)</span> <span class="special">--></span> <span class="string">"abcdef"</span> +<span class="identifier">unhex</span> <span class="special">(</span> <span class="string">"3332"</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">)</span> <span class="special">--></span> <span class="string">"32"</span> +<span class="identifier">unhex</span> <span class="special">(</span> <span class="string">"616263646566"</span><span class="special">,</span> <span class="identifier">wout</span> <span class="special">)</span> <span class="special">--></span> <span class="string">"\6162\6364\6566"</span> <span class="special">(</span> <span class="identifier">i</span><span class="special">.</span><span class="identifier">e</span><span class="special">,</span> <span class="identifier">a</span> <span class="number">3</span> <span class="identifier">character</span> <span class="identifier">string</span> <span class="special">)</span> +<span class="identifier">unhex</span> <span class="special">(</span> <span class="string">"3332"</span><span class="special">,</span> <span class="identifier">wout</span> <span class="special">)</span> <span class="special">--></span> <span class="string">"\3233"</span> <span class="special">(</span> <span class="identifier">U</span><span class="special">+</span><span class="number">3332</span><span class="special">,</span> <span class="identifier">SQUARE</span> <span class="identifier">HUARADDO</span> <span class="special">)</span> + +<span class="identifier">unhex</span> <span class="special">(</span> <span class="string">"3"</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">)</span> <span class="special">--></span> <span class="identifier">Error</span> <span class="special">-</span> <span class="keyword">not</span> <span class="identifier">enough</span> <span class="identifier">input</span> +<span class="identifier">unhex</span> <span class="special">(</span> <span class="string">"32"</span><span class="special">,</span> <span class="identifier">wout</span> <span class="special">)</span> <span class="special">--></span> <span class="identifier">Error</span> <span class="special">-</span> <span class="keyword">not</span> <span class="identifier">enough</span> <span class="identifier">input</span> + +<span class="identifier">unhex</span> <span class="special">(</span> <span class="string">"ACEG"</span><span class="special">,</span> <span class="identifier">out</span> <span class="special">)</span> <span class="special">--></span> <span class="identifier">Error</span> <span class="special">-</span> <span class="identifier">non</span><span class="special">-</span><span class="identifier">hex</span> <span class="identifier">input</span> +</pre> +<p> + </p> +<h5> +<a name="the_boost_algorithm_library.Misc.hex.h3"></a> + <span><a name="the_boost_algorithm_library.Misc.hex.iterator_requirements"></a></span><a class="link" href="hex.html#the_boost_algorithm_library.Misc.hex.iterator_requirements">Iterator + Requirements</a> + </h5> +<p> + <code class="computeroutput"><span class="identifier">hex</span></code> and <code class="computeroutput"><span class="identifier">unhex</span></code> + work on all iterator types. + </p> +<h5> +<a name="the_boost_algorithm_library.Misc.hex.h4"></a> + <span><a name="the_boost_algorithm_library.Misc.hex.complexity"></a></span><a class="link" href="hex.html#the_boost_algorithm_library.Misc.hex.complexity">Complexity</a> + </h5> +<p> + All of the variants of <code class="computeroutput"><span class="identifier">hex</span></code> + and <code class="computeroutput"><span class="identifier">unhex</span></code> run in <span class="emphasis"><em>O(N)</em></span> + (linear) time; that is, that is, they process each element in the input sequence + once. + </p> +<h5> +<a name="the_boost_algorithm_library.Misc.hex.h5"></a> + <span><a name="the_boost_algorithm_library.Misc.hex.exception_safety"></a></span><a class="link" href="hex.html#the_boost_algorithm_library.Misc.hex.exception_safety">Exception + Safety</a> + </h5> +<p> + All of the variants of <code class="computeroutput"><span class="identifier">hex</span></code> + and <code class="computeroutput"><span class="identifier">unhex</span></code> take their parameters + by value or const reference, and do not depend upon any global state. Therefore, + all the routines in this file provide the strong exception guarantee. However, + when working on input iterators, if an exception is thrown, the input iterators + will not be reset to their original values (i.e, the characters read from + the iterator cannot be un-read) + </p> +<h5> +<a name="the_boost_algorithm_library.Misc.hex.h6"></a> + <span><a name="the_boost_algorithm_library.Misc.hex.notes"></a></span><a class="link" href="hex.html#the_boost_algorithm_library.Misc.hex.notes">Notes</a> + </h5> +<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem"> + <code class="computeroutput"><span class="identifier">hex</span></code> and <code class="computeroutput"><span class="identifier">unhex</span></code> both do nothing when passed empty + ranges. + </li></ul></div> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../algorithm/Misc.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/Misc.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../algorithm/reference.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/the_boost_algorithm_library/Searching/BoyerMooreHorspool.html b/libs/algorithm/doc/html/the_boost_algorithm_library/Searching/BoyerMooreHorspool.html new file mode 100644 index 0000000000..3bbabd6d40 --- /dev/null +++ b/libs/algorithm/doc/html/the_boost_algorithm_library/Searching/BoyerMooreHorspool.html @@ -0,0 +1,207 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Boyer-Moore-Horspool Search</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../algorithm/Searching.html" title="Searching Algorithms"> +<link rel="prev" href="../../algorithm/Searching.html" title="Searching Algorithms"> +<link rel="next" href="KnuthMorrisPratt.html" title="Knuth-Morris-Pratt Search"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../algorithm/Searching.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/Searching.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="KnuthMorrisPratt.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="the_boost_algorithm_library.Searching.BoyerMooreHorspool"></a><a class="link" href="BoyerMooreHorspool.html" title="Boyer-Moore-Horspool Search">Boyer-Moore-Horspool + Search</a> +</h3></div></div></div> +<h5> +<a name="the_boost_algorithm_library.Searching.BoyerMooreHorspool.h0"></a> + <span><a name="the_boost_algorithm_library.Searching.BoyerMooreHorspool.overview"></a></span><a class="link" href="BoyerMooreHorspool.html#the_boost_algorithm_library.Searching.BoyerMooreHorspool.overview">Overview</a> + </h5> +<p> + The header file 'boyer_moore_horspool.hpp' contains an an implementation + of the Boyer-Moore-Horspool algorithm for searching sequences of values. + </p> +<p> + The Boyer-Moore-Horspool search algorithm was published by Nigel Horspool + in 1980. It is a refinement of the Boyer-Moore algorithm that trades space + for time. It uses less space for internal tables than Boyer-Moore, and has + poorer worst-case performance. + </p> +<p> + The Boyer-Moore-Horspool algorithm cannot be used with comparison predicates + like <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">search</span></code>. + </p> +<h5> +<a name="the_boost_algorithm_library.Searching.BoyerMooreHorspool.h1"></a> + <span><a name="the_boost_algorithm_library.Searching.BoyerMooreHorspool.interface"></a></span><a class="link" href="BoyerMooreHorspool.html#the_boost_algorithm_library.Searching.BoyerMooreHorspool.interface">Interface</a> + </h5> +<p> + Nomenclature: I refer to the sequence being searched for as the "pattern", + and the sequence being searched in as the "corpus". + </p> +<p> + For flexibility, the Boyer-Moore-Horspool algorithm has has two interfaces; + an object-based interface and a procedural one. The object-based interface + builds the tables in the constructor, and uses operator () to perform the + search. The procedural interface builds the table and does the search all + in one step. If you are going to be searching for the same pattern in multiple + corpora, then you should use the object interface, and only build the tables + once. + </p> +<p> + Here is the object interface: +</p> +<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">patIter</span><span class="special">></span> +<span class="keyword">class</span> <span class="identifier">boyer_moore_horspool</span> <span class="special">{</span> +<span class="keyword">public</span><span class="special">:</span> + <span class="identifier">boyer_moore_horspool</span> <span class="special">(</span> <span class="identifier">patIter</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">patIter</span> <span class="identifier">last</span> <span class="special">);</span> + <span class="special">~</span><span class="identifier">boyer_moore_horspool</span> <span class="special">();</span> + + <span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">corpusIter</span><span class="special">></span> + <span class="identifier">corpusIter</span> <span class="keyword">operator</span> <span class="special">()</span> <span class="special">(</span> <span class="identifier">corpusIter</span> <span class="identifier">corpus_first</span><span class="special">,</span> <span class="identifier">corpusIter</span> <span class="identifier">corpus_last</span> <span class="special">);</span> + <span class="special">};</span> +</pre> +<p> + </p> +<p> + and here is the corresponding procedural interface: + </p> +<p> +</p> +<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">patIter</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">corpusIter</span><span class="special">></span> +<span class="identifier">corpusIter</span> <span class="identifier">boyer_moore_horspool_search</span> <span class="special">(</span> + <span class="identifier">corpusIter</span> <span class="identifier">corpus_first</span><span class="special">,</span> <span class="identifier">corpusIter</span> <span class="identifier">corpus_last</span><span class="special">,</span> + <span class="identifier">patIter</span> <span class="identifier">pat_first</span><span class="special">,</span> <span class="identifier">patIter</span> <span class="identifier">pat_last</span> <span class="special">);</span> +</pre> +<p> + </p> +<p> + Each of the functions is passed two pairs of iterators. The first two define + the corpus and the second two define the pattern. Note that the two pairs + need not be of the same type, but they do need to "point" at the + same type. In other words, <code class="computeroutput"><span class="identifier">patIter</span><span class="special">::</span><span class="identifier">value_type</span></code> + and <code class="computeroutput"><span class="identifier">curpusIter</span><span class="special">::</span><span class="identifier">value_type</span></code> need to be the same type. + </p> +<p> + The return value of the function is an iterator pointing to the start of + the pattern in the corpus. If the pattern is not found, it returns the end + of the corpus (<code class="computeroutput"><span class="identifier">corpus_last</span></code>). + </p> +<h5> +<a name="the_boost_algorithm_library.Searching.BoyerMooreHorspool.h2"></a> + <span><a name="the_boost_algorithm_library.Searching.BoyerMooreHorspool.performance"></a></span><a class="link" href="BoyerMooreHorspool.html#the_boost_algorithm_library.Searching.BoyerMooreHorspool.performance">Performance</a> + </h5> +<p> + The execution time of the Boyer-Moore-Horspool algorithm is linear in the + size of the string being searched; it can have a significantly lower constant + factor than many other search algorithms: it doesn't need to check every + character of the string to be searched, but rather skips over some of them. + Generally the algorithm gets faster as the pattern being searched for becomes + longer. Its efficiency derives from the fact that with each unsuccessful + attempt to find a match between the search string and the text it is searching, + it uses the information gained from that attempt to rule out as many positions + of the text as possible where the string cannot match. + </p> +<h5> +<a name="the_boost_algorithm_library.Searching.BoyerMooreHorspool.h3"></a> + <span><a name="the_boost_algorithm_library.Searching.BoyerMooreHorspool.memory_use"></a></span><a class="link" href="BoyerMooreHorspool.html#the_boost_algorithm_library.Searching.BoyerMooreHorspool.memory_use">Memory + Use</a> + </h5> +<p> + The algorithm an internal table that has one entry for each member of the + "alphabet" in the pattern. For (8-bit) character types, this table + contains 256 entries. + </p> +<h5> +<a name="the_boost_algorithm_library.Searching.BoyerMooreHorspool.h4"></a> + <span><a name="the_boost_algorithm_library.Searching.BoyerMooreHorspool.complexity"></a></span><a class="link" href="BoyerMooreHorspool.html#the_boost_algorithm_library.Searching.BoyerMooreHorspool.complexity">Complexity</a> + </h5> +<p> + The worst-case performance is <span class="emphasis"><em>O(m x n)</em></span>, where <span class="emphasis"><em>m</em></span> + is the length of the pattern and <span class="emphasis"><em>n</em></span> is the length of + the corpus. The average time is <span class="emphasis"><em>O(n)</em></span>. The best case + performance is sub-linear, and is, in fact, identical to Boyer-Moore, but + the initialization is quicker and the internal loop is simpler than Boyer-Moore. + </p> +<h5> +<a name="the_boost_algorithm_library.Searching.BoyerMooreHorspool.h5"></a> + <span><a name="the_boost_algorithm_library.Searching.BoyerMooreHorspool.exception_safety"></a></span><a class="link" href="BoyerMooreHorspool.html#the_boost_algorithm_library.Searching.BoyerMooreHorspool.exception_safety">Exception + Safety</a> + </h5> +<p> + Both the object-oriented and procedural versions of the Boyer-Moore-Horspool + algorithm take their parameters by value and do not use any information other + than what is passed in. Therefore, both interfaces provide the strong exception + guarantee. + </p> +<h5> +<a name="the_boost_algorithm_library.Searching.BoyerMooreHorspool.h6"></a> + <span><a name="the_boost_algorithm_library.Searching.BoyerMooreHorspool.notes"></a></span><a class="link" href="BoyerMooreHorspool.html#the_boost_algorithm_library.Searching.BoyerMooreHorspool.notes">Notes</a> + </h5> +<div class="itemizedlist"><ul class="itemizedlist" type="disc"> +<li class="listitem"> + When using the object-based interface, the pattern must remain unchanged + for during the searches; i.e, from the time the object is constructed + until the final call to operator () returns. + </li> +<li class="listitem"> + The Boyer-Moore-Horspool algorithm requires random-access iterators for + both the pattern and the corpus. + </li> +</ul></div> +<h5> +<a name="the_boost_algorithm_library.Searching.BoyerMooreHorspool.h7"></a> + <span><a name="the_boost_algorithm_library.Searching.BoyerMooreHorspool.customization_points"></a></span><a class="link" href="BoyerMooreHorspool.html#the_boost_algorithm_library.Searching.BoyerMooreHorspool.customization_points">Customization + points</a> + </h5> +<p> + The Boyer-Moore-Horspool object takes a traits template parameter which enables + the caller to customize how the precomputed table is stored. This table, + called the skip table, contains (logically) one entry for every possible + value that the pattern can contain. When searching 8-bit character data, + this table contains 256 elements. The traits class defines the table to be + used. + </p> +<p> + The default traits class uses a <code class="computeroutput"><span class="identifier">boost</span><span class="special">::</span><span class="identifier">array</span></code> + for small 'alphabets' and a <code class="computeroutput"><span class="identifier">tr1</span><span class="special">::</span><span class="identifier">unordered_map</span></code> + for larger ones. The array-based skip table gives excellent performance, + but could be prohibitively large when the 'alphabet' of elements to be searched + grows. The unordered_map based version only grows as the number of unique + elements in the pattern, but makes many more heap allocations, and gives + slower lookup performance. + </p> +<p> + To use a different skip table, you should define your own skip table object + and your own traits class, and use them to instantiate the Boyer-Moore-Horspool + object. The interface to these objects is described TBD. + </p> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="../../algorithm/Searching.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/Searching.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="KnuthMorrisPratt.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/the_boost_algorithm_library/Searching/KnuthMorrisPratt.html b/libs/algorithm/doc/html/the_boost_algorithm_library/Searching/KnuthMorrisPratt.html new file mode 100644 index 0000000000..8ce2c8fbc9 --- /dev/null +++ b/libs/algorithm/doc/html/the_boost_algorithm_library/Searching/KnuthMorrisPratt.html @@ -0,0 +1,52 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Knuth-Morris-Pratt Search</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.76.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../algorithm/Searching.html" title="Searching Algorithms"> +<link rel="prev" href="BoyerMooreHorspool.html" title="Boyer-Moore-Horspool Search"> +<link rel="next" href="../../algorithm/CXX11.html" title="C++11 Algorithms"> +</head> +<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> +<table cellpadding="2" width="100%"><tr> +<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../../../boost.png"></td> +<td align="center"><a href="../../../../../../index.html">Home</a></td> +<td align="center"><a href="../../../../../../libs/libraries.htm">Libraries</a></td> +<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td> +<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td> +<td align="center"><a href="../../../../../../more/index.htm">More</a></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="BoyerMooreHorspool.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/Searching.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../algorithm/CXX11.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="the_boost_algorithm_library.Searching.KnuthMorrisPratt"></a><a class="link" href="KnuthMorrisPratt.html" title="Knuth-Morris-Pratt Search">Knuth-Morris-Pratt + Search</a> +</h3></div></div></div> +<h5> +<a name="the_boost_algorithm_library.Searching.KnuthMorrisPratt.h0"></a> + <span><a name="the_boost_algorithm_library.Searching.KnuthMorrisPratt.overview"></a></span><a class="link" href="KnuthMorrisPratt.html#the_boost_algorithm_library.Searching.KnuthMorrisPratt.overview">Overview</a> + </h5> +<p> + The header file 'knuth_morris_pratt.hpp' contains an an implementation of + the Knuth-Morris-Pratt algorithm for searching sequences of values. + </p> +</div> +<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> +<td align="left"></td> +<td align="right"><div class="copyright-footer">Copyright © 2010-2012 Marshall Clow<p> + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>) + </p> +</div></td> +</tr></table> +<hr> +<div class="spirit-nav"> +<a accesskey="p" href="BoyerMooreHorspool.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/Searching.html"><img src="../../../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="../../algorithm/CXX11.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> |