diff options
| author | Chanho Park <chanho61.park@samsung.com> | 2014-12-11 18:55:56 +0900 |
|---|---|---|
| committer | Chanho Park <chanho61.park@samsung.com> | 2014-12-11 18:55:56 +0900 |
| commit | 08c1e93fa36a49f49325a07fe91ff92c964c2b6c (patch) | |
| tree | 7a7053ceb8874b28ec4b868d4c49b500008a102e /libs/algorithm | |
| parent | bb4dd8289b351fae6b55e303f189127a394a1edd (diff) | |
| download | boost-08c1e93fa36a49f49325a07fe91ff92c964c2b6c.tar.gz boost-08c1e93fa36a49f49325a07fe91ff92c964c2b6c.tar.bz2 boost-08c1e93fa36a49f49325a07fe91ff92c964c2b6c.zip | |
Imported Upstream version 1.57.0upstream/1.57.0
Diffstat (limited to 'libs/algorithm')
197 files changed, 9863 insertions, 866 deletions
diff --git a/libs/algorithm/doc/Jamfile.v2 b/libs/algorithm/doc/Jamfile.v2 index 515b9a567f..6af1129795 100644 --- a/libs/algorithm/doc/Jamfile.v2 +++ b/libs/algorithm/doc/Jamfile.v2 @@ -18,7 +18,11 @@ using boostbook ; doxygen autodoc : - [ glob ../../../boost/algorithm/*.hpp ../../../boost/algorithm/searching/*.hpp ] + [ glob ../../../boost/algorithm/*.hpp + ../../../boost/algorithm/searching/*.hpp + ../../../boost/algorithm/cxx11/*.hpp + ../../../boost/algorithm/cxx14/*.hpp + ] : <doxygen:param>"PREDEFINED=\"BOOST_ALGORITHM_DOXYGEN=1\"" <doxygen:param>WARNINGS=YES # Default NO, but useful to see warnings, especially in a logfile. diff --git a/libs/algorithm/doc/algorithm.qbk b/libs/algorithm/doc/algorithm.qbk index f5e4d0dfd0..66971d17ca 100644 --- a/libs/algorithm/doc/algorithm.qbk +++ b/libs/algorithm/doc/algorithm.qbk @@ -53,11 +53,18 @@ Thanks to all the people who have reviewed this library and made suggestions for [include one_of.qbk] [include ordered-hpp.qbk] [include is_partitioned.qbk] +[include is_permutation.qbk] [include partition_point.qbk] [endsect] +[section:CXX14 C++14 Algorithms] +[include equal.qbk] +[include mismatch.qbk] +[endsect] + [section:Misc Other Algorithms] [include clamp-hpp.qbk] +[include gather.qbk] [include hex.qbk] [endsect] diff --git a/libs/algorithm/doc/boyer_moore.qbk b/libs/algorithm/doc/boyer_moore.qbk index 41301434d1..13c9666772 100644 --- a/libs/algorithm/doc/boyer_moore.qbk +++ b/libs/algorithm/doc/boyer_moore.qbk @@ -14,7 +14,7 @@ http://www.boost.org/LICENSE_1_0.txt) [heading Overview] -The header file 'boyer_moore.hpp' contains an an implementation of the Boyer-Moore algorithm for searching sequences of values. +The header file 'boyer_moore.hpp' contains an implementation of the Boyer-Moore algorithm for searching sequences of values. 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 [@http://www.cs.utexas.edu/~moore/publications/fstrpos.pdf]. @@ -26,7 +26,7 @@ Nomenclature: I refer to the sequence being searched for as the "pattern", and t [heading Interface] -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. +For flexibility, the Boyer-Moore algorithm 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. Here is the object interface: `` diff --git a/libs/algorithm/doc/boyer_moore_horspool.qbk b/libs/algorithm/doc/boyer_moore_horspool.qbk index 1c37a8bb11..3a10c32538 100644 --- a/libs/algorithm/doc/boyer_moore_horspool.qbk +++ b/libs/algorithm/doc/boyer_moore_horspool.qbk @@ -14,7 +14,7 @@ http://www.boost.org/LICENSE_1_0.txt) [heading Overview] -The header file 'boyer_moore_horspool.hpp' contains an an implementation of the Boyer-Moore-Horspool algorithm for searching sequences of values. +The header file 'boyer_moore_horspool.hpp' contains an implementation of the Boyer-Moore-Horspool algorithm for searching sequences of values. 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. @@ -24,7 +24,7 @@ The Boyer-Moore-Horspool algorithm cannot be used with comparison predicates lik Nomenclature: I refer to the sequence being searched for as the "pattern", and the sequence being searched in as the "corpus". -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. +For flexibility, the Boyer-Moore-Horspool algorithm 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. Here is the object interface: `` diff --git a/libs/algorithm/doc/equal.qbk b/libs/algorithm/doc/equal.qbk new file mode 100644 index 0000000000..0ba221c62e --- /dev/null +++ b/libs/algorithm/doc/equal.qbk @@ -0,0 +1,80 @@ +[/ File equal.qbk] + +[section:equal equal ] + +[/license +Copyright (c) 2013 Marshall Clow + +Distributed under the Boost Software License, Version 1.0. +(See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +] + +The header file 'equal.hpp' contains two variants of a the stl algorithm `equal`. The algorithm tests to see if two sequences contain equal values; + +Before (the proposed) C++14 the algorithm `std::equal` took three iterators and an optional comparison predicate. The first two iterators `[first1, last1)` defined a sequence, and the second one `first2` defined the start of the second sequence. The second sequence was assumed to be the same length as the first. + +In C++14, two new variants were introduced, taking four iterators and an optional comparison predicate. The four iterators define two sequences `[first1, last1)` and `[first2, last2)` explicitly, rather than defining the second one implicitly. This leads to correct answers in more cases (and avoid undefined behavior in others). + +Consider the two sequences: +``` + auto seq1 = { 0, 1, 2 }; + auto seq2 = { 0, 1, 2, 3, 4 }; + + std::equal ( seq1.begin (), seq1.end (), seq2.begin ()); // true + std::equal ( seq2.begin (), seq2.end (), seq1.begin ()); // Undefined behavior + std::equal ( seq1.begin (), seq1.end (), seq2.begin (), seq2.end ()); // false +``` + +You can argue that `true` is the correct answer in the first case, even though the sequences are not the same. The first N entries in `seq2` are the same as the entries in `seq1` - but that's not all that's in `seq2`. But in the second case, the algorithm will read past the end of `seq1`, resulting in undefined behavior (large earthquake, incorrect results, pregnant cat, etc). + +However, if the two sequences are specified completely, it's clear that they are not equal. + +[heading interface] + +The function `equal` returns true if the two sequences compare equal; i.e, if each element in the sequence compares equal to the corresponding element in the other sequence. One version uses `std::equal_to` to do the comparison; the other lets the caller pass predicate to do the comparisons. + +`` +template <class InputIterator1, class InputIterator2> +bool equal ( InputIterator1 first1, InputIterator1 last1, + InputIterator2 first2, InputIterator2 last2 ); + +template <class InputIterator1, class InputIterator2, class BinaryPredicate> +bool equal ( InputIterator1 first1, InputIterator1 last1, + InputIterator2 first2, InputIterator2 last2, BinaryPredicate pred ); +`` + +[heading Examples] + +Given the container `c1` containing `{ 0, 1, 2, 3, 14, 15 }`, and `c2` containing `{ 1, 2, 3 }`, then +`` +equal ( c1.begin (), c1.end (), c2.begin (), c2.end ()) --> false +equal ( c1.begin () + 1, c1.begin () + 3, c2.begin (), c2.end ()) --> true +equal ( c1.end (), c1.end (), c2.end (), c2.end ()) --> true // empty sequences are alway equal to each other +`` + +[heading Iterator Requirements] + +`equal` works on all iterators except output iterators. + +[heading Complexity] + +Both of the variants of `equal` run in ['O(N)] (linear) time; that is, they compare against each element in the list once. If the sequence is found to be not equal at any point, the routine will terminate immediately, without examining the rest of the elements. + +[heading Exception Safety] + +Both of the variants of `equal` take their parameters by value and do not depend upon any global state. Therefore, all the routines in this file provide the strong exception guarantee. + +[heading Notes] + +* The four iterator version of the routine `equal` is part of the C++14 standard. When C++14 standard library implementations become available, the implementation from the standard library should be used. + +* `equal` returns true for two empty ranges, no matter what predicate is passed to test against. + +[endsect] + +[/ File equal.qbk +Copyright 2011 Marshall Clow +Distributed under the Boost Software License, Version 1.0. +(See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt). +] + diff --git a/libs/algorithm/doc/gather.qbk b/libs/algorithm/doc/gather.qbk new file mode 100644 index 0000000000..b50e85ab76 --- /dev/null +++ b/libs/algorithm/doc/gather.qbk @@ -0,0 +1,79 @@ +[/ File gather.qbk] + +[section:gather gather] + +[/license +Copyright (c) 2013 Marshall Clow + +Distributed under the Boost Software License, Version 1.0. +(See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +] + +The header file 'boost/algorithm/gather.hpp' contains two variants of a single algorithm, `gather`. + +`gather()` takes a collection of elements defined by a pair of iterators and moves the ones satisfying a predicate to them to a position (called the pivot) within the sequence. The algorithm is stable. The result is a pair of iterators that contains the items that satisfy the predicate. + +[heading Interface] + +The function `gather` returns a `std::pair` of iterators that denote the elements that satisfy the predicate. + +There are two versions; one takes two iterators, and the other takes a range. + +`` +namespace boost { namespace algorithm { + +template <typename BidirectionalIterator, typename Pred> +std::pair<BidirectionalIterator,BidirectionalIterator> +gather ( BidirectionalIterator first, BidirectionalIterator last, BidirectionalIterator pivot, Pred pred ); + +template <typename BidirectionalRange, typename Pred> +std::pair<typename boost::range_iterator<const BidirectionalRange>::type, typename boost::range_iterator<const BidirectionalRange>::type> +gather ( const BidirectionalRange &range, typename boost::range_iterator<const BidirectionalRange>::type pivot, Pred pred ); + +}} +`` + +[heading Examples] + +Given an sequence containing: +`` +0 1 2 3 4 5 6 7 8 9 +`` + +a call to gather ( arr, arr + 10, arr + 4, IsEven ) will result in: + +`` +1 3 0 2 4 6 8 5 7 9 + |---|-----| + first | second + pivot +`` +where `first` and `second` are the fields of the pair that is returned by the call. + + +[heading Iterator Requirements] + +`gather` work on bidirectional iterators or better. This requirement comes from the usage of `stable_partition`, which requires bidirectional iterators. Some standard libraries (libstdc++ and libc++, for example) have implementations of `stable_partition` that work with forward iterators. If that is the case, then `gather` will work with forward iterators as well. + +[heading Storage Requirements] + +`gather` uses `stable_partition`, which will attempt to allocate temporary memory, but will work in-situ if there is none available. + +[heading Complexity] + +If there is sufficient memory available, the run time is linear: `O(N)` + +If there is not any memory available, then the run time is `O(N log N)`. + +[heading Exception Safety] + +[heading Notes] + +[endsect] + +[/ File gather.qbk +Copyright 2013 Marshall Clow +Distributed under the Boost Software License, Version 1.0. +(See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt). +] + diff --git a/libs/algorithm/doc/html/algorithm/CXX11.html b/libs/algorithm/doc/html/algorithm/CXX11.html index a5e17ead85..a43c96ce10 100644 --- a/libs/algorithm/doc/html/algorithm/CXX11.html +++ b/libs/algorithm/doc/html/algorithm/CXX11.html @@ -3,7 +3,7 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> @@ -26,7 +26,7 @@ <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> +<div class="toc"><dl class="toc"> <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> @@ -35,6 +35,8 @@ </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/is_permutation.html">is_permutation + </a></span></dt> <dt><span class="section"><a href="../the_boost_algorithm_library/CXX11/partition_point.html">partition_point </a></span></dt> </dl></div> @@ -65,7 +67,7 @@ </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> + <span class="phrase"><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 @@ -102,7 +104,7 @@ </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> + <span class="phrase"><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 @@ -126,7 +128,7 @@ </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 + <span class="phrase"><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> @@ -135,7 +137,7 @@ </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> + <span class="phrase"><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> @@ -146,7 +148,7 @@ </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 + <span class="phrase"><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> @@ -158,9 +160,9 @@ </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> + <span class="phrase"><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"> +<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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, diff --git a/libs/algorithm/doc/html/algorithm/CXX14.html b/libs/algorithm/doc/html/algorithm/CXX14.html new file mode 100644 index 0000000000..c7114ae7e5 --- /dev/null +++ b/libs/algorithm/doc/html/algorithm/CXX14.html @@ -0,0 +1,183 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>C++14 Algorithms</title> +<link rel="stylesheet" href="../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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/CXX14/mismatch.html" title="mismatch"> +</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/CXX14/mismatch.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.CXX14"></a><a class="link" href="CXX14.html" title="C++14 Algorithms">C++14 Algorithms</a> +</h2></div></div></div> +<div class="toc"><dl class="toc"> +<dt><span class="section"><a href="CXX14.html#the_boost_algorithm_library.CXX14.equal">equal </a></span></dt> +<dt><span class="section"><a href="../the_boost_algorithm_library/CXX14/mismatch.html">mismatch + </a></span></dt> +</dl></div> +<div class="section"> +<div class="titlepage"><div><div><h3 class="title"> +<a name="the_boost_algorithm_library.CXX14.equal"></a><a class="link" href="CXX14.html#the_boost_algorithm_library.CXX14.equal" title="equal">equal </a> +</h3></div></div></div> +<p> + The header file 'equal.hpp' contains two variants of a the stl algorithm + <code class="computeroutput"><span class="identifier">equal</span></code>. The algorithm tests + to see if two sequences contain equal values; + </p> +<p> + Before (the proposed) C++14 the algorithm <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">equal</span></code> + took three iterators and an optional comparison predicate. The first two + iterators <code class="computeroutput"><span class="special">[</span><span class="identifier">first1</span><span class="special">,</span> <span class="identifier">last1</span><span class="special">)</span></code> defined a sequence, and the second one + <code class="computeroutput"><span class="identifier">first2</span></code> defined the start + of the second sequence. The second sequence was assumed to be the same length + as the first. + </p> +<p> + In C++14, two new variants were introduced, taking four iterators and an + optional comparison predicate. The four iterators define two sequences <code class="computeroutput"><span class="special">[</span><span class="identifier">first1</span><span class="special">,</span> <span class="identifier">last1</span><span class="special">)</span></code> and <code class="computeroutput"><span class="special">[</span><span class="identifier">first2</span><span class="special">,</span> <span class="identifier">last2</span><span class="special">)</span></code> + explicitly, rather than defining the second one implicitly. This leads to + correct answers in more cases (and avoid undefined behavior in others). + </p> +<p> + Consider the two sequences: +</p> +<pre class="programlisting"><span class="keyword">auto</span> <span class="identifier">seq1</span> <span class="special">=</span> <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="keyword">auto</span> <span class="identifier">seq2</span> <span class="special">=</span> <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">4</span> <span class="special">};</span> + +<span class="identifier">std</span><span class="special">::</span><span class="identifier">equal</span> <span class="special">(</span> <span class="identifier">seq1</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="identifier">seq1</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">seq2</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">());</span> <span class="comment">// true</span> +<span class="identifier">std</span><span class="special">::</span><span class="identifier">equal</span> <span class="special">(</span> <span class="identifier">seq2</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="identifier">seq2</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">seq1</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">());</span> <span class="comment">// Undefined behavior</span> +<span class="identifier">std</span><span class="special">::</span><span class="identifier">equal</span> <span class="special">(</span> <span class="identifier">seq1</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="identifier">seq1</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">seq2</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="identifier">seq2</span><span class="special">.</span><span class="identifier">end</span> <span class="special">());</span> <span class="comment">// false</span> +</pre> +<p> + </p> +<p> + You can argue that <code class="computeroutput"><span class="keyword">true</span></code> is the + correct answer in the first case, even though the sequences are not the same. + The first N entries in <code class="computeroutput"><span class="identifier">seq2</span></code> + are the same as the entries in <code class="computeroutput"><span class="identifier">seq1</span></code> + - but that's not all that's in <code class="computeroutput"><span class="identifier">seq2</span></code>. + But in the second case, the algorithm will read past the end of <code class="computeroutput"><span class="identifier">seq1</span></code>, resulting in undefined behavior (large + earthquake, incorrect results, pregnant cat, etc). + </p> +<p> + However, if the two sequences are specified completely, it's clear that they + are not equal. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX14.equal.h0"></a> + <span class="phrase"><a name="the_boost_algorithm_library.CXX14.equal.interface"></a></span><a class="link" href="CXX14.html#the_boost_algorithm_library.CXX14.equal.interface">interface</a> + </h5> +<p> + The function <code class="computeroutput"><span class="identifier">equal</span></code> returns + true if the two sequences compare equal; i.e, if each element in the sequence + compares equal to the corresponding element in the other sequence. One version + uses <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">equal_to</span></code> to do the comparison; the other + lets the caller pass predicate to do the comparisons. + </p> +<p> +</p> +<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">InputIterator1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">InputIterator2</span><span class="special">></span> +<span class="keyword">bool</span> <span class="identifier">equal</span> <span class="special">(</span> <span class="identifier">InputIterator1</span> <span class="identifier">first1</span><span class="special">,</span> <span class="identifier">InputIterator1</span> <span class="identifier">last1</span><span class="special">,</span> + <span class="identifier">InputIterator2</span> <span class="identifier">first2</span><span class="special">,</span> <span class="identifier">InputIterator2</span> <span class="identifier">last2</span> <span class="special">);</span> + +<span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">InputIterator1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">InputIterator2</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><span class="special">></span> +<span class="keyword">bool</span> <span class="identifier">equal</span> <span class="special">(</span> <span class="identifier">InputIterator1</span> <span class="identifier">first1</span><span class="special">,</span> <span class="identifier">InputIterator1</span> <span class="identifier">last1</span><span class="special">,</span> + <span class="identifier">InputIterator2</span> <span class="identifier">first2</span><span class="special">,</span> <span class="identifier">InputIterator2</span> <span class="identifier">last2</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span> <span class="special">);</span> +</pre> +<p> + </p> +<h5> +<a name="the_boost_algorithm_library.CXX14.equal.h1"></a> + <span class="phrase"><a name="the_boost_algorithm_library.CXX14.equal.examples"></a></span><a class="link" href="CXX14.html#the_boost_algorithm_library.CXX14.equal.examples">Examples</a> + </h5> +<p> + Given the container <code class="computeroutput"><span class="identifier">c1</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>, + and <code class="computeroutput"><span class="identifier">c2</span></code> containing <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></code>, then +</p> +<pre class="programlisting"><span class="identifier">equal</span> <span class="special">(</span> <span class="identifier">c1</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="identifier">c1</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">c2</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="identifier">c2</span><span class="special">.</span><span class="identifier">end</span> <span class="special">())</span> <span class="special">--></span> <span class="keyword">false</span> +<span class="identifier">equal</span> <span class="special">(</span> <span class="identifier">c1</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">()</span> <span class="special">+</span> <span class="number">1</span><span class="special">,</span> <span class="identifier">c1</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">c2</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="identifier">c2</span><span class="special">.</span><span class="identifier">end</span> <span class="special">())</span> <span class="special">--></span> <span class="keyword">true</span> +<span class="identifier">equal</span> <span class="special">(</span> <span class="identifier">c1</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">c1</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">c2</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">c2</span><span class="special">.</span><span class="identifier">end</span> <span class="special">())</span> <span class="special">--></span> <span class="keyword">true</span> <span class="comment">// empty sequences are alway equal to each other</span> +</pre> +<p> + </p> +<h5> +<a name="the_boost_algorithm_library.CXX14.equal.h2"></a> + <span class="phrase"><a name="the_boost_algorithm_library.CXX14.equal.iterator_requirements"></a></span><a class="link" href="CXX14.html#the_boost_algorithm_library.CXX14.equal.iterator_requirements">Iterator + Requirements</a> + </h5> +<p> + <code class="computeroutput"><span class="identifier">equal</span></code> works on all iterators + except output iterators. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX14.equal.h3"></a> + <span class="phrase"><a name="the_boost_algorithm_library.CXX14.equal.complexity"></a></span><a class="link" href="CXX14.html#the_boost_algorithm_library.CXX14.equal.complexity">Complexity</a> + </h5> +<p> + Both of the variants of <code class="computeroutput"><span class="identifier">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 the sequence is found to be not equal at + any point, the routine will terminate immediately, without examining the + rest of the elements. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX14.equal.h4"></a> + <span class="phrase"><a name="the_boost_algorithm_library.CXX14.equal.exception_safety"></a></span><a class="link" href="CXX14.html#the_boost_algorithm_library.CXX14.equal.exception_safety">Exception + Safety</a> + </h5> +<p> + Both of the variants of <code class="computeroutput"><span class="identifier">equal</span></code> + take their parameters by value 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.CXX14.equal.h5"></a> + <span class="phrase"><a name="the_boost_algorithm_library.CXX14.equal.notes"></a></span><a class="link" href="CXX14.html#the_boost_algorithm_library.CXX14.equal.notes">Notes</a> + </h5> +<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "> +<li class="listitem"> + The four iterator version of the routine <code class="computeroutput"><span class="identifier">equal</span></code> + is part of the C++14 standard. When C++14 standard library implementations + become available, the implementation from the standard library should + be used. + </li> +<li class="listitem"> + <code class="computeroutput"><span class="identifier">equal</span></code> returns true for + two empty ranges, no matter what predicate is passed to test against. + </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/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/CXX14/mismatch.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 index edd190a0f9..ace49e0ae8 100644 --- a/libs/algorithm/doc/html/algorithm/Misc.html +++ b/libs/algorithm/doc/html/algorithm/Misc.html @@ -3,11 +3,11 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> +<link rel="prev" href="../the_boost_algorithm_library/CXX14/mismatch.html" title="mismatch"> +<link rel="next" href="../the_boost_algorithm_library/Misc/gather.html" title="gather"> </head> <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> <table cellpadding="2" width="100%"><tr> @@ -20,14 +20,15 @@ </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> +<a accesskey="p" href="../the_boost_algorithm_library/CXX14/mismatch.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/gather.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> +<div class="toc"><dl class="toc"> <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/gather.html">gather</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"> @@ -40,13 +41,13 @@ </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> + <span class="phrase"><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"> +<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "> <li class="listitem"> lo if v < lo </li> @@ -92,7 +93,7 @@ </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> + <span class="phrase"><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 @@ -140,7 +141,7 @@ </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> +<a accesskey="p" href="../the_boost_algorithm_library/CXX14/mismatch.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/gather.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 index 9183fdfc09..b27ebbdff6 100644 --- a/libs/algorithm/doc/html/algorithm/Searching.html +++ b/libs/algorithm/doc/html/algorithm/Searching.html @@ -3,7 +3,7 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> @@ -26,7 +26,7 @@ <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> +<div class="toc"><dl class="toc"> <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 @@ -41,10 +41,10 @@ </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> + <span class="phrase"><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 + The header file 'boyer_moore.hpp' contains an implementation of the Boyer-Moore algorithm for searching sequences of values. </p> <p> @@ -71,10 +71,10 @@ </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> + <span class="phrase"><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 + For flexibility, the Boyer-Moore algorithm 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 @@ -122,7 +122,7 @@ </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> + <span class="phrase"><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 @@ -137,7 +137,7 @@ </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 + <span class="phrase"><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> @@ -148,7 +148,7 @@ </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> + <span class="phrase"><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> @@ -158,7 +158,7 @@ </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 + <span class="phrase"><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> @@ -169,9 +169,9 @@ </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> + <span class="phrase"><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"> +<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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 @@ -184,7 +184,7 @@ </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 + <span class="phrase"><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> diff --git a/libs/algorithm/doc/html/algorithm/reference.html b/libs/algorithm/doc/html/algorithm/reference.html index f94a8b2496..6435e2640c 100644 --- a/libs/algorithm/doc/html/algorithm/reference.html +++ b/libs/algorithm/doc/html/algorithm/reference.html @@ -3,11 +3,11 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> +<link rel="next" href="../boost/algorithm/clamp_idp34169904.html" title="Function template clamp"> </head> <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> <table cellpadding="2" width="100%"><tr> @@ -20,13 +20,30 @@ </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> +<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_idp34169904.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> +<div class="toc"><dl class="toc"> <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/cxx11/all_of_hpp.html">Header <boost/algorithm/cxx11/all_of.hpp></a></span></dt> +<dt><span class="section"><a href="../header/boost/algorithm/cxx11/any_of_hpp.html">Header <boost/algorithm/cxx11/any_of.hpp></a></span></dt> +<dt><span class="section"><a href="../header/boost/algorithm/cxx11/copy_if_hpp.html">Header <boost/algorithm/cxx11/copy_if.hpp></a></span></dt> +<dt><span class="section"><a href="../header/boost/algorithm/cxx11/copy_n_hpp.html">Header <boost/algorithm/cxx11/copy_n.hpp></a></span></dt> +<dt><span class="section"><a href="../header/boost/algorithm/cxx11/find_if_not_hpp.html">Header <boost/algorithm/cxx11/find_if_not.hpp></a></span></dt> +<dt><span class="section"><a href="../header/boost/algorithm/cxx11/iota_hpp.html">Header <boost/algorithm/cxx11/iota.hpp></a></span></dt> +<dt><span class="section"><a href="../header/boost/algorithm/cxx11/is_partitioned_hpp.html">Header <boost/algorithm/cxx11/is_partitioned.hpp></a></span></dt> +<dt><span class="section"><a href="../header/boost/algorithm/cxx11/is_permutation_hpp.html">Header <boost/algorithm/cxx11/is_permutation.hpp></a></span></dt> +<dt><span class="section"><a href="../header/boost/algorithm/cxx14/is_permutation_hpp.html">Header <boost/algorithm/cxx14/is_permutation.hpp></a></span></dt> +<dt><span class="section"><a href="../header/boost/algorithm/cxx11/is_sorted_hpp.html">Header <boost/algorithm/cxx11/is_sorted.hpp></a></span></dt> +<dt><span class="section"><a href="../header/boost/algorithm/cxx11/none_of_hpp.html">Header <boost/algorithm/cxx11/none_of.hpp></a></span></dt> +<dt><span class="section"><a href="../header/boost/algorithm/cxx11/one_of_hpp.html">Header <boost/algorithm/cxx11/one_of.hpp></a></span></dt> +<dt><span class="section"><a href="../header/boost/algorithm/cxx11/partition_copy_hpp.html">Header <boost/algorithm/cxx11/partition_copy.hpp></a></span></dt> +<dt><span class="section"><a href="../header/boost/algorithm/cxx11/partition_point_hpp.html">Header <boost/algorithm/cxx11/partition_point.hpp></a></span></dt> +<dt><span class="section"><a href="../header/boost/algorithm/cxx14/equal_hpp.html">Header <boost/algorithm/cxx14/equal.hpp></a></span></dt> +<dt><span class="section"><a href="../header/boost/algorithm/cxx14/mismatch_hpp.html">Header <boost/algorithm/cxx14/mismatch.hpp></a></span></dt> +<dt><span class="section"><a href="../header/boost/algorithm/gather_hpp.html">Header <boost/algorithm/gather.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> @@ -46,34 +63,34 @@ Suggested by olafvdspek in <a href="https://svn.boost.org/trac/boost/ticket/3215 <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="identifier">T</span> <span class="keyword">const</span> <span class="special">&</span> <a class="link" href="../boost/algorithm/clamp_idp34169904.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="identifier">T</span> <span class="keyword">const</span> <span class="special">&</span> <a class="link" href="../boost/algorithm/clamp_idp29107056.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> + <a name="boost.algorithm.clamp_range_idp29113152"></a><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> <span class="keyword">const</span> <span class="special">&</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> <span class="keyword">const</span> <span class="special">&</span> hi<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> + <a class="link" href="../boost/algorithm/clamp_range_idp29118784.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="keyword">const</span> <span class="special">&</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="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="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> + <a name="boost.algorithm.clamp_range_idp29126720"></a><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> <span class="keyword">const</span> <span class="special">&</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> <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> <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> + <a class="link" href="../boost/algorithm/clamp_range_idp29133760.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="keyword">const</span> <span class="special">&</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="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="special">}</span> <span class="special">}</span></pre> @@ -89,7 +106,7 @@ Suggested by olafvdspek in <a href="https://svn.boost.org/trac/boost/ticket/3215 </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> +<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_idp34169904.html"><img src="../../../../../doc/src/images/next.png" alt="Next"></a> </div> </body> </html> diff --git a/libs/algorithm/doc/html/boost/algorithm/all_of_equal_idp37434976.html b/libs/algorithm/doc/html/boost/algorithm/all_of_equal_idp37434976.html new file mode 100644 index 0000000000..b512286c43 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/all_of_equal_idp37434976.html @@ -0,0 +1,101 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template all_of_equal</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/all_of_hpp.html" title="Header <boost/algorithm/cxx11/all_of.hpp>"> +<link rel="prev" href="all_of_idp37429008.html" title="Function template all_of"> +<link rel="next" href="all_of_equal_idp37442064.html" title="Function template all_of_equal"> +</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="all_of_idp37429008.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/all_of_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="all_of_equal_idp37442064.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.all_of_equal_idp37434976"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template all_of_equal</span></h2> +<p>boost::algorithm::all_of_equal</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/cxx11/all_of_hpp.html" title="Header <boost/algorithm/cxx11/all_of.hpp>">boost/algorithm/cxx11/all_of.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> T<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> first<span class="special">,</span> <span class="identifier">InputIterator</span> last<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="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp85377872"></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>returns true on an empty range</p></td></tr> +</table></div> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<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">val</code></span></p></td> +<td><p>A value to compare against </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>true if all elements in [first, last) are equal to 'val' </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="all_of_idp37429008.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/all_of_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="all_of_equal_idp37442064.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/all_of_equal_idp37442064.html b/libs/algorithm/doc/html/boost/algorithm/all_of_equal_idp37442064.html new file mode 100644 index 0000000000..5862a9dfc5 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/all_of_equal_idp37442064.html @@ -0,0 +1,97 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template all_of_equal</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/all_of_hpp.html" title="Header <boost/algorithm/cxx11/all_of.hpp>"> +<link rel="prev" href="all_of_equal_idp37434976.html" title="Function template all_of_equal"> +<link rel="next" href="../../header/boost/algorithm/cxx11/any_of_hpp.html" title="Header <boost/algorithm/cxx11/any_of.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="all_of_equal_idp37434976.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/all_of_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/cxx11/any_of_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.all_of_equal_idp37442064"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template all_of_equal</span></h2> +<p>boost::algorithm::all_of_equal</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/cxx11/all_of_hpp.html" title="Header <boost/algorithm/cxx11/all_of.hpp>">boost/algorithm/cxx11/all_of.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> T<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> r<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="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp85400960"></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>returns true on an empty range</p></td></tr> +</table></div> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">r</code></span></p></td> +<td><p>The input range </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">val</code></span></p></td> +<td><p>A value to compare against </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>true if all elements in the range are equal to 'val' </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="all_of_equal_idp37434976.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/all_of_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/cxx11/any_of_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/all_of_idp37421200.html b/libs/algorithm/doc/html/boost/algorithm/all_of_idp37421200.html new file mode 100644 index 0000000000..168468802f --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/all_of_idp37421200.html @@ -0,0 +1,110 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template all_of</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/all_of_hpp.html" title="Header <boost/algorithm/cxx11/all_of.hpp>"> +<link rel="prev" href="../../header/boost/algorithm/cxx11/all_of_hpp.html" title="Header <boost/algorithm/cxx11/all_of.hpp>"> +<link rel="next" href="all_of_idp37429008.html" title="Function template all_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="../../header/boost/algorithm/cxx11/all_of_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/all_of_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="all_of_idp37429008.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.all_of_idp37421200"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template all_of</span></h2> +<p>boost::algorithm::all_of</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/cxx11/all_of_hpp.html" title="Header <boost/algorithm/cxx11/all_of.hpp>">boost/algorithm/cxx11/all_of.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> Predicate<span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">all_of</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">Predicate</span> p<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp85333504"></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>returns true on an empty range</p></td></tr> +</table></div> +<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>This function is part of the C++2011 standard library. We will use the standard one if it is available, otherwise we have our own implementation. </p></td></tr> +</table></div> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<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">p</code></span></p></td> +<td><p>A predicate for testing the elements of the sequence</p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>true if all elements in [first, last) satisfy the 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="../../header/boost/algorithm/cxx11/all_of_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/all_of_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="all_of_idp37429008.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/all_of_idp37429008.html b/libs/algorithm/doc/html/boost/algorithm/all_of_idp37429008.html new file mode 100644 index 0000000000..6223ae6aef --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/all_of_idp37429008.html @@ -0,0 +1,97 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template all_of</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/all_of_hpp.html" title="Header <boost/algorithm/cxx11/all_of.hpp>"> +<link rel="prev" href="all_of_idp37421200.html" title="Function template all_of"> +<link rel="next" href="all_of_equal_idp37434976.html" title="Function template all_of_equal"> +</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="all_of_idp37421200.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/all_of_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="all_of_equal_idp37434976.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.all_of_idp37429008"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template all_of</span></h2> +<p>boost::algorithm::all_of</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/cxx11/all_of_hpp.html" title="Header <boost/algorithm/cxx11/all_of.hpp>">boost/algorithm/cxx11/all_of.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> Predicate<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> r<span class="special">,</span> <span class="identifier">Predicate</span> p<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp85355840"></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>returns true on an empty range</p></td></tr> +</table></div> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">p</code></span></p></td> +<td><p>A predicate for testing the elements of the range </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>true if all elements in the range satisfy the 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="all_of_idp37421200.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/all_of_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="all_of_equal_idp37434976.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/any_of_equal_idp37464240.html b/libs/algorithm/doc/html/boost/algorithm/any_of_equal_idp37464240.html new file mode 100644 index 0000000000..bff96ba37f --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/any_of_equal_idp37464240.html @@ -0,0 +1,101 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template any_of_equal</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/any_of_hpp.html" title="Header <boost/algorithm/cxx11/any_of.hpp>"> +<link rel="prev" href="any_of_idp37458272.html" title="Function template any_of"> +<link rel="next" href="any_of_equal_idp37471328.html" title="Function template any_of_equal"> +</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_idp37458272.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/any_of_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="any_of_equal_idp37471328.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.any_of_equal_idp37464240"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template any_of_equal</span></h2> +<p>boost::algorithm::any_of_equal</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/cxx11/any_of_hpp.html" title="Header <boost/algorithm/cxx11/any_of.hpp>">boost/algorithm/cxx11/any_of.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> V<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> first<span class="special">,</span> <span class="identifier">InputIterator</span> last<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">V</span> <span class="special">&</span> val<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp85518912"></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>returns false on an empty range</p></td></tr> +</table></div> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<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">val</code></span></p></td> +<td><p>A value to compare against </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>true if any of the elements in [first, last) are equal to 'val' </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="any_of_idp37458272.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/any_of_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="any_of_equal_idp37471328.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/any_of_equal_idp37471328.html b/libs/algorithm/doc/html/boost/algorithm/any_of_equal_idp37471328.html new file mode 100644 index 0000000000..51a8cd1ddc --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/any_of_equal_idp37471328.html @@ -0,0 +1,97 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template any_of_equal</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/any_of_hpp.html" title="Header <boost/algorithm/cxx11/any_of.hpp>"> +<link rel="prev" href="any_of_equal_idp37464240.html" title="Function template any_of_equal"> +<link rel="next" href="../../header/boost/algorithm/cxx11/copy_if_hpp.html" title="Header <boost/algorithm/cxx11/copy_if.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="any_of_equal_idp37464240.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/any_of_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/cxx11/copy_if_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.any_of_equal_idp37471328"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template any_of_equal</span></h2> +<p>boost::algorithm::any_of_equal</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/cxx11/any_of_hpp.html" title="Header <boost/algorithm/cxx11/any_of.hpp>">boost/algorithm/cxx11/any_of.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> V<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> r<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">V</span> <span class="special">&</span> val<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp85542064"></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>returns false on an empty range</p></td></tr> +</table></div> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">r</code></span></p></td> +<td><p>The input range </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">val</code></span></p></td> +<td><p>A value to compare against </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>true if any of the elements in the range are equal to 'val' </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="any_of_equal_idp37464240.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/any_of_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/cxx11/copy_if_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/any_of_idp37451168.html b/libs/algorithm/doc/html/boost/algorithm/any_of_idp37451168.html new file mode 100644 index 0000000000..740b7ddb0c --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/any_of_idp37451168.html @@ -0,0 +1,101 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template any_of</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/any_of_hpp.html" title="Header <boost/algorithm/cxx11/any_of.hpp>"> +<link rel="prev" href="../../header/boost/algorithm/cxx11/any_of_hpp.html" title="Header <boost/algorithm/cxx11/any_of.hpp>"> +<link rel="next" href="any_of_idp37458272.html" title="Function template 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="../../header/boost/algorithm/cxx11/any_of_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/any_of_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="any_of_idp37458272.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.any_of_idp37451168"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template any_of</span></h2> +<p>boost::algorithm::any_of</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/cxx11/any_of_hpp.html" title="Header <boost/algorithm/cxx11/any_of.hpp>">boost/algorithm/cxx11/any_of.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> Predicate<span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">any_of</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">Predicate</span> p<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp85475216"></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>returns false on an empty range</p></td></tr> +</table></div> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<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">p</code></span></p></td> +<td><p>A predicate for testing the elements of the sequence </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>true if any of the elements in [first, last) satisfy the predicate </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="../../header/boost/algorithm/cxx11/any_of_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/any_of_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="any_of_idp37458272.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/any_of_idp37458272.html b/libs/algorithm/doc/html/boost/algorithm/any_of_idp37458272.html new file mode 100644 index 0000000000..287fc2e68d --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/any_of_idp37458272.html @@ -0,0 +1,97 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template any_of</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/any_of_hpp.html" title="Header <boost/algorithm/cxx11/any_of.hpp>"> +<link rel="prev" href="any_of_idp37451168.html" title="Function template any_of"> +<link rel="next" href="any_of_equal_idp37464240.html" title="Function template any_of_equal"> +</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_idp37451168.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/any_of_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="any_of_equal_idp37464240.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.any_of_idp37458272"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template any_of</span></h2> +<p>boost::algorithm::any_of</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/cxx11/any_of_hpp.html" title="Header <boost/algorithm/cxx11/any_of.hpp>">boost/algorithm/cxx11/any_of.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> Predicate<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> r<span class="special">,</span> <span class="identifier">Predicate</span> p<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp85496848"></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>returns false on an empty range</p></td></tr> +</table></div> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">p</code></span></p></td> +<td><p>A predicate for testing the elements of the range </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>true if any elements in the range satisfy the 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="any_of_idp37451168.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/any_of_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="any_of_equal_idp37464240.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 index 30b94946c9..95519b4118 100644 --- a/libs/algorithm/doc/html/boost/algorithm/boyer_moore.html +++ b/libs/algorithm/doc/html/boost/algorithm/boyer_moore.html @@ -3,11 +3,11 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> +<link rel="next" href="boyer_moore_se_idp38022400.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> @@ -20,7 +20,7 @@ </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> +<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_se_idp38022400.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> @@ -35,35 +35,35 @@ <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> + <a class="link" href="boyer_moore.html#idp38020272-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#idp38021936-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="comment">// <a class="link" href="boyer_moore.html#idp38013536-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="identifier">corpusIter</span> <a class="link" href="boyer_moore.html#idp38014096-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="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#idp38017440-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> +<a name="idp88355104"></a><h2>Description</h2> <div class="refsect2"> -<a name="id795789"></a><h3> +<a name="idp88355520"></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> +<li class="listitem"><pre class="literallayout"><a name="idp38020272-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="idp38021936-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> +<a name="idp88367584"></a><h3> +<a name="idp38013536-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> + <span class="identifier">corpusIter</span> <a name="idp38014096-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> + <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="idp38017440-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> @@ -78,7 +78,7 @@ </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> +<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_se_idp38022400.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_ho_idp38060992.html index a77ae3b701..8075d9fdc3 100644 --- a/libs/algorithm/doc/html/boost/algorithm/boyer_moore_horsp_id339130.html +++ b/libs/algorithm/doc/html/boost/algorithm/boyer_moore_ho_idp38060992.html @@ -3,7 +3,7 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> @@ -23,7 +23,7 @@ <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> +<a name="boost.algorithm.boyer_moore_ho_idp38060992"></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> @@ -37,15 +37,21 @@ <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> +<a name="idp88638704"></a><h2>Description</h2> <p> </p> -<div class="variablelist"><table border="0"> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody><tr> <td><p><span class="term">Parameters:</span></p></td> -<td><div class="variablelist"><table border="0"> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody> <tr> <td><p><span class="term"><code class="computeroutput">corpus_first</code></span></p></td> diff --git a/libs/algorithm/doc/html/boost/algorithm/boyer_moore_horspool.html b/libs/algorithm/doc/html/boost/algorithm/boyer_moore_horspool.html index 3132462f35..deb713d176 100644 --- a/libs/algorithm/doc/html/boost/algorithm/boyer_moore_horspool.html +++ b/libs/algorithm/doc/html/boost/algorithm/boyer_moore_horspool.html @@ -3,11 +3,11 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> +<link rel="next" href="boyer_moore_ho_idp38060992.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> @@ -20,7 +20,7 @@ </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> +<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_ho_idp38060992.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> @@ -35,35 +35,35 @@ <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> + <a class="link" href="boyer_moore_horspool.html#idp38058880-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#idp38060544-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="comment">// <a class="link" href="boyer_moore_horspool.html#idp38052144-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="identifier">corpusIter</span> <a class="link" href="boyer_moore_horspool.html#idp38052704-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="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#idp38056048-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> +<a name="idp88583184"></a><h2>Description</h2> <div class="refsect2"> -<a name="id797660"></a><h3> +<a name="idp88583600"></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> +<li class="listitem"><pre class="literallayout"><a name="idp38058880-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="idp38060544-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> +<a name="idp88595824"></a><h3> +<a name="idp38052144-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> + <span class="identifier">corpusIter</span> <a name="idp38052704-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> + <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="idp38056048-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> @@ -78,7 +78,7 @@ </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> +<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_ho_idp38060992.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_se_idp38022400.html index 260034555c..370e1c71de 100644 --- a/libs/algorithm/doc/html/boost/algorithm/boyer_moore_searc_id338832.html +++ b/libs/algorithm/doc/html/boost/algorithm/boyer_moore_se_idp38022400.html @@ -3,7 +3,7 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> @@ -23,7 +23,7 @@ <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> +<a name="boost.algorithm.boyer_moore_se_idp38022400"></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> @@ -37,15 +37,21 @@ <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> +<a name="idp88410544"></a><h2>Description</h2> <p> </p> -<div class="variablelist"><table border="0"> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody><tr> <td><p><span class="term">Parameters:</span></p></td> -<td><div class="variablelist"><table border="0"> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody> <tr> <td><p><span class="term"><code class="computeroutput">corpus_first</code></span></p></td> diff --git a/libs/algorithm/doc/html/boost/algorithm/clamp_id337315.html b/libs/algorithm/doc/html/boost/algorithm/clamp_idp29107056.html index 99f34c953c..739a8f60e6 100644 --- a/libs/algorithm/doc/html/boost/algorithm/clamp_id337315.html +++ b/libs/algorithm/doc/html/boost/algorithm/clamp_idp29107056.html @@ -3,11 +3,11 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> +<link rel="prev" href="clamp_idp34169904.html" title="Function template clamp"> +<link rel="next" href="clamp_range_idp29118784.html" title="Function template clamp_range"> </head> <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> <table cellpadding="2" width="100%"><tr> @@ -20,10 +20,10 @@ </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> +<a accesskey="p" href="clamp_idp34169904.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_idp29118784.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> +<a name="boost.algorithm.clamp_idp29107056"></a><div class="titlepage"></div> <div class="refnamediv"> <h2><span class="refentrytitle">Function template clamp</span></h2> <p>boost::algorithm::clamp</p> @@ -37,17 +37,23 @@ <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> +<a name="idp85136000"></a><h2>Description</h2> <p> </p> -<div class="variablelist"><table border="0"> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody> <tr> <td><p><span class="term">Parameters:</span></p></td> -<td><div class="variablelist"><table border="0"> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody> <tr> <td><p><span class="term"><code class="computeroutput">hi</code></span></p></td> @@ -82,7 +88,7 @@ </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> +<a accesskey="p" href="clamp_idp34169904.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_idp29118784.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_idp34169904.html index c10cb97d41..7584aae1d4 100644 --- a/libs/algorithm/doc/html/boost/algorithm/clamp_id337250.html +++ b/libs/algorithm/doc/html/boost/algorithm/clamp_idp34169904.html @@ -3,11 +3,11 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> +<link rel="next" href="clamp_idp29107056.html" title="Function template clamp"> </head> <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> <table cellpadding="2" width="100%"><tr> @@ -20,10 +20,10 @@ </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> +<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_idp29107056.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> +<a name="boost.algorithm.clamp_idp34169904"></a><div class="titlepage"></div> <div class="refnamediv"> <h2><span class="refentrytitle">Function template clamp</span></h2> <p>boost::algorithm::clamp</p> @@ -38,17 +38,23 @@ <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> +<a name="idp85097440"></a><h2>Description</h2> <p> </p> -<div class="variablelist"><table border="0"> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody> <tr> <td><p><span class="term">Parameters:</span></p></td> -<td><div class="variablelist"><table border="0"> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody> <tr> <td><p><span class="term"><code class="computeroutput">hi</code></span></p></td> @@ -87,7 +93,7 @@ </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> +<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_idp29107056.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 deleted file mode 100644 index 391ae1edd3..0000000000 --- a/libs/algorithm/doc/html/boost/algorithm/clamp_range_id337367.html +++ /dev/null @@ -1,97 +0,0 @@ -<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_id337510.html b/libs/algorithm/doc/html/boost/algorithm/clamp_range_id337510.html deleted file mode 100644 index cf7e36b360..0000000000 --- a/libs/algorithm/doc/html/boost/algorithm/clamp_range_id337510.html +++ /dev/null @@ -1,102 +0,0 @@ -<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_id337442.html b/libs/algorithm/doc/html/boost/algorithm/clamp_range_idp29118784.html index 239fc3e699..fdc04524b8 100644 --- a/libs/algorithm/doc/html/boost/algorithm/clamp_range_id337442.html +++ b/libs/algorithm/doc/html/boost/algorithm/clamp_range_idp29118784.html @@ -3,11 +3,11 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> +<link rel="prev" href="clamp_idp29107056.html" title="Function template clamp"> +<link rel="next" href="clamp_range_idp29133760.html" title="Function template clamp_range"> </head> <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> <table cellpadding="2" width="100%"><tr> @@ -20,10 +20,10 @@ </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> +<a accesskey="p" href="clamp_idp29107056.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_idp29133760.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> +<a name="boost.algorithm.clamp_range_idp29118784"></a><div class="titlepage"></div> <div class="refnamediv"> <h2><span class="refentrytitle">Function template clamp_range</span></h2> <p>boost::algorithm::clamp_range</p> @@ -35,20 +35,26 @@ <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> + <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="keyword">const</span> <span class="special">&</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> <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="id788822"></a><h2>Description</h2> +<a name="idp85194032"></a><h2>Description</h2> <p> </p> -<div class="variablelist"><table border="0"> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody> <tr> <td><p><span class="term">Parameters:</span></p></td> -<td><div class="variablelist"><table border="0"> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody> <tr> <td><p><span class="term"><code class="computeroutput">hi</code></span></p></td> @@ -87,7 +93,7 @@ </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> +<a accesskey="p" href="clamp_idp29107056.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_idp29133760.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_idp29133760.html index 5f804802f9..eed084e56d 100644 --- a/libs/algorithm/doc/html/boost/algorithm/clamp_range_id337600.html +++ b/libs/algorithm/doc/html/boost/algorithm/clamp_range_idp29133760.html @@ -3,11 +3,11 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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>"> +<link rel="prev" href="clamp_range_idp29118784.html" title="Function template clamp_range"> +<link rel="next" href="../../header/boost/algorithm/cxx11/all_of_hpp.html" title="Header <boost/algorithm/cxx11/all_of.hpp>"> </head> <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> <table cellpadding="2" width="100%"><tr> @@ -20,10 +20,10 @@ </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> +<a accesskey="p" href="clamp_range_idp29118784.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/cxx11/all_of_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> +<a name="boost.algorithm.clamp_range_idp29133760"></a><div class="titlepage"></div> <div class="refnamediv"> <h2><span class="refentrytitle">Function template clamp_range</span></h2> <p>boost::algorithm::clamp_range</p> @@ -35,21 +35,27 @@ <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="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="keyword">const</span> <span class="special">&</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> <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="id789639"></a><h2>Description</h2> +<a name="idp85255648"></a><h2>Description</h2> <p> </p> -<div class="variablelist"><table border="0"> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody> <tr> <td><p><span class="term">Parameters:</span></p></td> -<td><div class="variablelist"><table border="0"> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody> <tr> <td><p><span class="term"><code class="computeroutput">hi</code></span></p></td> @@ -92,7 +98,7 @@ </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> +<a accesskey="p" href="clamp_range_idp29118784.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/cxx11/all_of_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> </div> </body> </html> diff --git a/libs/algorithm/doc/html/boost/algorithm/copy_if_idp37480416.html b/libs/algorithm/doc/html/boost/algorithm/copy_if_idp37480416.html new file mode 100644 index 0000000000..17a5a5f7d2 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/copy_if_idp37480416.html @@ -0,0 +1,107 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template copy_if</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/copy_if_hpp.html" title="Header <boost/algorithm/cxx11/copy_if.hpp>"> +<link rel="prev" href="../../header/boost/algorithm/cxx11/copy_if_hpp.html" title="Header <boost/algorithm/cxx11/copy_if.hpp>"> +<link rel="next" href="copy_if_idp37489664.html" title="Function template copy_if"> +</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/cxx11/copy_if_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/copy_if_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="copy_if_idp37489664.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.copy_if_idp37480416"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template copy_if</span></h2> +<p>boost::algorithm::copy_if — Copies all the elements from the input range that satisfy the predicate to the output 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="../../header/boost/algorithm/cxx11/copy_if_hpp.html" title="Header <boost/algorithm/cxx11/copy_if.hpp>">boost/algorithm/cxx11/copy_if.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> Predicate<span class="special">></span> + <span class="identifier">OutputIterator</span> + <span class="identifier">copy_if</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> result<span class="special">,</span> + <span class="identifier">Predicate</span> p<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp85681472"></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>This function is part of the C++2011 standard library. We will use the standard one if it is available, otherwise we have our own implementation. </p></td></tr> +</table></div> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<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">p</code></span></p></td> +<td><p>A predicate for testing the elements of the range </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">result</code></span></p></td> +<td><p>An output iterator to write 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="../../header/boost/algorithm/cxx11/copy_if_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/copy_if_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="copy_if_idp37489664.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/copy_if_idp37489664.html b/libs/algorithm/doc/html/boost/algorithm/copy_if_idp37489664.html new file mode 100644 index 0000000000..fb9e859124 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/copy_if_idp37489664.html @@ -0,0 +1,92 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template copy_if</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/copy_if_hpp.html" title="Header <boost/algorithm/cxx11/copy_if.hpp>"> +<link rel="prev" href="copy_if_idp37480416.html" title="Function template copy_if"> +<link rel="next" href="copy_while_idp37497072.html" title="Function template copy_while"> +</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="copy_if_idp37480416.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/copy_if_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="copy_while_idp37497072.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.copy_if_idp37489664"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template copy_if</span></h2> +<p>boost::algorithm::copy_if — Copies all the elements from the input range that satisfy the predicate to the output 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="../../header/boost/algorithm/cxx11/copy_if_hpp.html" title="Header <boost/algorithm/cxx11/copy_if.hpp>">boost/algorithm/cxx11/copy_if.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> Predicate<span class="special">></span> + <span class="identifier">OutputIterator</span> <span class="identifier">copy_if</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> result<span class="special">,</span> <span class="identifier">Predicate</span> p<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp85707568"></a><h2>Description</h2> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">p</code></span></p></td> +<td><p>A predicate for testing the elements of the range </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> +<tr> +<td><p><span class="term"><code class="computeroutput">result</code></span></p></td> +<td><p>An output iterator to write 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="copy_if_idp37480416.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/copy_if_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="copy_while_idp37497072.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/copy_n.html b/libs/algorithm/doc/html/boost/algorithm/copy_n.html new file mode 100644 index 0000000000..bc3933fe5b --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/copy_n.html @@ -0,0 +1,101 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template copy_n</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/copy_n_hpp.html" title="Header <boost/algorithm/cxx11/copy_n.hpp>"> +<link rel="prev" href="../../header/boost/algorithm/cxx11/copy_n_hpp.html" title="Header <boost/algorithm/cxx11/copy_n.hpp>"> +<link rel="next" href="../../header/boost/algorithm/cxx11/find_if_not_hpp.html" title="Header <boost/algorithm/cxx11/find_if_not.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="../../header/boost/algorithm/cxx11/copy_n_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/copy_n_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/cxx11/find_if_not_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.copy_n"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template copy_n</span></h2> +<p>boost::algorithm::copy_n — Copies exactly n (n > 0) elements from the range starting at first to the range starting at result. </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/cxx11/copy_n_hpp.html" title="Header <boost/algorithm/cxx11/copy_n.hpp>">boost/algorithm/cxx11/copy_n.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> Size<span class="special">,</span> <span class="keyword">typename</span> OutputIterator<span class="special">></span> + <span class="identifier">OutputIterator</span> <span class="identifier">copy_n</span><span class="special">(</span><span class="identifier">InputIterator</span> first<span class="special">,</span> <span class="identifier">Size</span> n<span class="special">,</span> <span class="identifier">OutputIterator</span> result<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp85878144"></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>This function is part of the C++2011 standard library. We will use the standard one if it is available, otherwise we have our own implementation. </p></td></tr> +</table></div> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<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">n</code></span></p></td> +<td><p>The number of elements to copy </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">result</code></span></p></td> +<td><p>An output iterator to write 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="../../header/boost/algorithm/cxx11/copy_n_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/copy_n_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/cxx11/find_if_not_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/copy_until_idp37513056.html b/libs/algorithm/doc/html/boost/algorithm/copy_until_idp37513056.html new file mode 100644 index 0000000000..b47eedd2ff --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/copy_until_idp37513056.html @@ -0,0 +1,98 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template copy_until</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/copy_if_hpp.html" title="Header <boost/algorithm/cxx11/copy_if.hpp>"> +<link rel="prev" href="copy_while_idp37505664.html" title="Function template copy_while"> +<link rel="next" href="copy_until_idp37521648.html" title="Function template copy_until"> +</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="copy_while_idp37505664.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/copy_if_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="copy_until_idp37521648.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.copy_until_idp37513056"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template copy_until</span></h2> +<p>boost::algorithm::copy_until — Copies all the elements at the start of the input range that do not satisfy the predicate to the output 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="../../header/boost/algorithm/cxx11/copy_if_hpp.html" title="Header <boost/algorithm/cxx11/copy_if.hpp>">boost/algorithm/cxx11/copy_if.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> Predicate<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">InputIterator</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="special">></span> + <span class="identifier">copy_until</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> result<span class="special">,</span> + <span class="identifier">Predicate</span> p<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp85799472"></a><h2>Description</h2> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<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">p</code></span></p></td> +<td><p>A predicate for testing the elements of the range </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">result</code></span></p></td> +<td><p>An output iterator to write 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="copy_while_idp37505664.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/copy_if_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="copy_until_idp37521648.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/copy_until_idp37521648.html b/libs/algorithm/doc/html/boost/algorithm/copy_until_idp37521648.html new file mode 100644 index 0000000000..2c1724a250 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/copy_until_idp37521648.html @@ -0,0 +1,93 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template copy_until</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/copy_if_hpp.html" title="Header <boost/algorithm/cxx11/copy_if.hpp>"> +<link rel="prev" href="copy_until_idp37513056.html" title="Function template copy_until"> +<link rel="next" href="../../header/boost/algorithm/cxx11/copy_n_hpp.html" title="Header <boost/algorithm/cxx11/copy_n.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="copy_until_idp37513056.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/copy_if_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/cxx11/copy_n_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.copy_until_idp37521648"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template copy_until</span></h2> +<p>boost::algorithm::copy_until — Copies all the elements at the start of the input range that do not satisfy the predicate to the output 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="../../header/boost/algorithm/cxx11/copy_if_hpp.html" title="Header <boost/algorithm/cxx11/copy_if.hpp>">boost/algorithm/cxx11/copy_if.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> Predicate<span class="special">></span> + <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</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="identifier">OutputIterator</span> <span class="special">></span> + <span class="identifier">copy_until</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> result<span class="special">,</span> <span class="identifier">Predicate</span> p<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp85834672"></a><h2>Description</h2> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">p</code></span></p></td> +<td><p>A predicate for testing the elements of the range </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> +<tr> +<td><p><span class="term"><code class="computeroutput">result</code></span></p></td> +<td><p>An output iterator to write 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="copy_until_idp37513056.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/copy_if_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/cxx11/copy_n_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/copy_while_idp37497072.html b/libs/algorithm/doc/html/boost/algorithm/copy_while_idp37497072.html new file mode 100644 index 0000000000..6894e3c378 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/copy_while_idp37497072.html @@ -0,0 +1,98 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template copy_while</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/copy_if_hpp.html" title="Header <boost/algorithm/cxx11/copy_if.hpp>"> +<link rel="prev" href="copy_if_idp37489664.html" title="Function template copy_if"> +<link rel="next" href="copy_while_idp37505664.html" title="Function template copy_while"> +</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="copy_if_idp37489664.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/copy_if_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="copy_while_idp37505664.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.copy_while_idp37497072"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template copy_while</span></h2> +<p>boost::algorithm::copy_while — Copies all the elements at the start of the input range that satisfy the predicate to the output 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="../../header/boost/algorithm/cxx11/copy_if_hpp.html" title="Header <boost/algorithm/cxx11/copy_if.hpp>">boost/algorithm/cxx11/copy_if.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> Predicate<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">InputIterator</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="special">></span> + <span class="identifier">copy_while</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> result<span class="special">,</span> + <span class="identifier">Predicate</span> p<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp85735952"></a><h2>Description</h2> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<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">p</code></span></p></td> +<td><p>A predicate for testing the elements of the range </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">result</code></span></p></td> +<td><p>An output iterator to write 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 input and output iterators</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="copy_if_idp37489664.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/copy_if_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="copy_while_idp37505664.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/copy_while_idp37505664.html b/libs/algorithm/doc/html/boost/algorithm/copy_while_idp37505664.html new file mode 100644 index 0000000000..673904d8cc --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/copy_while_idp37505664.html @@ -0,0 +1,93 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template copy_while</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/copy_if_hpp.html" title="Header <boost/algorithm/cxx11/copy_if.hpp>"> +<link rel="prev" href="copy_while_idp37497072.html" title="Function template copy_while"> +<link rel="next" href="copy_until_idp37513056.html" title="Function template copy_until"> +</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="copy_while_idp37497072.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/copy_if_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="copy_until_idp37513056.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.copy_while_idp37505664"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template copy_while</span></h2> +<p>boost::algorithm::copy_while — Copies all the elements at the start of the input range that satisfy the predicate to the output 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="../../header/boost/algorithm/cxx11/copy_if_hpp.html" title="Header <boost/algorithm/cxx11/copy_if.hpp>">boost/algorithm/cxx11/copy_if.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> Predicate<span class="special">></span> + <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</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="identifier">OutputIterator</span> <span class="special">></span> + <span class="identifier">copy_while</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> result<span class="special">,</span> <span class="identifier">Predicate</span> p<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp85770928"></a><h2>Description</h2> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">p</code></span></p></td> +<td><p>A predicate for testing the elements of the range </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> +<tr> +<td><p><span class="term"><code class="computeroutput">result</code></span></p></td> +<td><p>An output iterator to write 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 input and output iterators</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="copy_while_idp37497072.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/copy_if_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="copy_until_idp37513056.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/equal_idp37825632.html b/libs/algorithm/doc/html/boost/algorithm/equal_idp37825632.html new file mode 100644 index 0000000000..58f5378cf5 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/equal_idp37825632.html @@ -0,0 +1,103 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template equal</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx14/equal_hpp.html" title="Header <boost/algorithm/cxx14/equal.hpp>"> +<link rel="prev" href="../../header/boost/algorithm/cxx14/equal_hpp.html" title="Header <boost/algorithm/cxx14/equal.hpp>"> +<link rel="next" href="equal_idp37834928.html" title="Function template equal"> +</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/cxx14/equal_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx14/equal_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="equal_idp37834928.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.equal_idp37825632"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template equal</span></h2> +<p>boost::algorithm::equal</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/cxx14/equal_hpp.html" title="Header <boost/algorithm/cxx14/equal.hpp>">boost/algorithm/cxx14/equal.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator1<span class="special">,</span> <span class="keyword">typename</span> InputIterator2<span class="special">,</span> + <span class="keyword">typename</span> BinaryPredicate<span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">equal</span><span class="special">(</span><span class="identifier">InputIterator1</span> first1<span class="special">,</span> <span class="identifier">InputIterator1</span> last1<span class="special">,</span> + <span class="identifier">InputIterator2</span> first2<span class="special">,</span> <span class="identifier">InputIterator2</span> last2<span class="special">,</span> + <span class="identifier">BinaryPredicate</span> pred<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp87420128"></a><h2>Description</h2> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first1</code></span></p></td> +<td><p>The start of the first range. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">first2</code></span></p></td> +<td><p>The start of the second range. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last1</code></span></p></td> +<td><p>One past the end of the first range. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last2</code></span></p></td> +<td><p>One past the end of the second range. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">pred</code></span></p></td> +<td><p>A predicate for comparing the elements of the ranges </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>true if all elements in the two ranges are equal</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="../../header/boost/algorithm/cxx14/equal_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx14/equal_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="equal_idp37834928.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/equal_idp37834928.html b/libs/algorithm/doc/html/boost/algorithm/equal_idp37834928.html new file mode 100644 index 0000000000..3912ca233a --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/equal_idp37834928.html @@ -0,0 +1,97 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template equal</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx14/equal_hpp.html" title="Header <boost/algorithm/cxx14/equal.hpp>"> +<link rel="prev" href="equal_idp37825632.html" title="Function template equal"> +<link rel="next" href="../../header/boost/algorithm/cxx14/mismatch_hpp.html" title="Header <boost/algorithm/cxx14/mismatch.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="equal_idp37825632.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx14/equal_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/cxx14/mismatch_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.equal_idp37834928"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template equal</span></h2> +<p>boost::algorithm::equal</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/cxx14/equal_hpp.html" title="Header <boost/algorithm/cxx14/equal.hpp>">boost/algorithm/cxx14/equal.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator1<span class="special">,</span> <span class="keyword">typename</span> InputIterator2<span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">equal</span><span class="special">(</span><span class="identifier">InputIterator1</span> first1<span class="special">,</span> <span class="identifier">InputIterator1</span> last1<span class="special">,</span> + <span class="identifier">InputIterator2</span> first2<span class="special">,</span> <span class="identifier">InputIterator2</span> last2<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp87445280"></a><h2>Description</h2> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first1</code></span></p></td> +<td><p>The start of the first range. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">first2</code></span></p></td> +<td><p>The start of the second range. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last1</code></span></p></td> +<td><p>One past the end of the first range. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last2</code></span></p></td> +<td><p>One past the end of the second range. </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>true if all elements in the two ranges are equal</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="equal_idp37825632.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx14/equal_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/cxx14/mismatch_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/find_if_not_idp37543536.html b/libs/algorithm/doc/html/boost/algorithm/find_if_not_idp37543536.html new file mode 100644 index 0000000000..fdfa1dbb1f --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/find_if_not_idp37543536.html @@ -0,0 +1,102 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template find_if_not</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/find_if_not_hpp.html" title="Header <boost/algorithm/cxx11/find_if_not.hpp>"> +<link rel="prev" href="../../header/boost/algorithm/cxx11/find_if_not_hpp.html" title="Header <boost/algorithm/cxx11/find_if_not.hpp>"> +<link rel="next" href="find_if_not_idp37551088.html" title="Function template find_if_not"> +</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/cxx11/find_if_not_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/find_if_not_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="find_if_not_idp37551088.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.find_if_not_idp37543536"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template find_if_not</span></h2> +<p>boost::algorithm::find_if_not — Finds the first element in the sequence that does not satisfy the predicate. </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/cxx11/find_if_not_hpp.html" title="Header <boost/algorithm/cxx11/find_if_not.hpp>">boost/algorithm/cxx11/find_if_not.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> Predicate<span class="special">></span> + <span class="identifier">InputIterator</span> + <span class="identifier">find_if_not</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">Predicate</span> p<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp85935024"></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>This function is part of the C++2011 standard library. We will use the standard one if it is available, otherwise we have our own implementation. </p></td></tr> +</table></div> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<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">p</code></span></p></td> +<td><p>A predicate for testing the elements of the range </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>The iterator pointing to the desired element.</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="../../header/boost/algorithm/cxx11/find_if_not_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/find_if_not_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="find_if_not_idp37551088.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/find_if_not_idp37551088.html b/libs/algorithm/doc/html/boost/algorithm/find_if_not_idp37551088.html new file mode 100644 index 0000000000..303f613f3e --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/find_if_not_idp37551088.html @@ -0,0 +1,89 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template find_if_not</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/find_if_not_hpp.html" title="Header <boost/algorithm/cxx11/find_if_not.hpp>"> +<link rel="prev" href="find_if_not_idp37543536.html" title="Function template find_if_not"> +<link rel="next" href="../../header/boost/algorithm/cxx11/iota_hpp.html" title="Header <boost/algorithm/cxx11/iota.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="find_if_not_idp37543536.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/find_if_not_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/cxx11/iota_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.find_if_not_idp37551088"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template find_if_not</span></h2> +<p>boost::algorithm::find_if_not — Finds the first element in the sequence that does not satisfy the predicate. </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/cxx11/find_if_not_hpp.html" title="Header <boost/algorithm/cxx11/find_if_not.hpp>">boost/algorithm/cxx11/find_if_not.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> Predicate<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="keyword">const</span> <span class="identifier">Range</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> + <span class="identifier">find_if_not</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">Predicate</span> p<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp85961968"></a><h2>Description</h2> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">p</code></span></p></td> +<td><p>A predicate for testing the elements of the range </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 iterator pointing to the desired element.</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="find_if_not_idp37543536.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/find_if_not_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/cxx11/iota_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 index 7b62aeab21..448eb43dad 100644 --- a/libs/algorithm/doc/html/boost/algorithm/hex_decode_error.html +++ b/libs/algorithm/doc/html/boost/algorithm/hex_decode_error.html @@ -3,7 +3,7 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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>"> @@ -32,7 +32,7 @@ <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="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="keyword">public</span> <span class="identifier">exception</span>, <span class="keyword">public</span> <span class="identifier">exception</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> diff --git a/libs/algorithm/doc/html/boost/algorithm/hex_id337739.html b/libs/algorithm/doc/html/boost/algorithm/hex_idp37883616.html index adebd33adc..6daf0a34dd 100644 --- a/libs/algorithm/doc/html/boost/algorithm/hex_id337739.html +++ b/libs/algorithm/doc/html/boost/algorithm/hex_idp37883616.html @@ -3,11 +3,11 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> +<link rel="next" href="hex_idp37891168.html" title="Function template hex"> </head> <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> <table cellpadding="2" width="100%"><tr> @@ -20,10 +20,10 @@ </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> +<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_idp37891168.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> +<a name="boost.algorithm.hex_idp37883616"></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> @@ -35,7 +35,7 @@ <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> +<a name="idp87776480"></a><h2>Description</h2> <p> </p> @@ -48,13 +48,19 @@ </table></div> <p> </p> -<div class="variablelist"><table border="0"> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody> <tr> <td><p><span class="term">Parameters:</span></p></td> -<td><div class="variablelist"><table border="0"> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody> <tr> <td><p><span class="term"><code class="computeroutput">first</code></span></p></td> @@ -89,7 +95,7 @@ </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> +<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_idp37891168.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_idp37891168.html index 0ffb34b619..67e956b29e 100644 --- a/libs/algorithm/doc/html/boost/algorithm/hex_id337802.html +++ b/libs/algorithm/doc/html/boost/algorithm/hex_idp37891168.html @@ -3,11 +3,11 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> +<link rel="prev" href="hex_idp37883616.html" title="Function template hex"> +<link rel="next" href="hex_idp37897536.html" title="Function template hex"> </head> <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> <table cellpadding="2" width="100%"><tr> @@ -20,10 +20,10 @@ </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> +<a accesskey="p" href="hex_idp37883616.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_idp37897536.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> +<a name="boost.algorithm.hex_idp37891168"></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> @@ -36,7 +36,7 @@ <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> +<a name="idp87806640"></a><h2>Description</h2> <p> </p> @@ -49,13 +49,19 @@ </table></div> <p> </p> -<div class="variablelist"><table border="0"> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody> <tr> <td><p><span class="term">Parameters:</span></p></td> -<td><div class="variablelist"><table border="0"> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody> <tr> <td><p><span class="term"><code class="computeroutput">out</code></span></p></td> @@ -86,7 +92,7 @@ </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> +<a accesskey="p" href="hex_idp37883616.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_idp37897536.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_idp37897536.html index b78f72f809..a121e8e803 100644 --- a/libs/algorithm/doc/html/boost/algorithm/hex_id337856.html +++ b/libs/algorithm/doc/html/boost/algorithm/hex_idp37897536.html @@ -3,11 +3,11 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> +<link rel="prev" href="hex_idp37891168.html" title="Function template hex"> +<link rel="next" href="unhex_idp37903952.html" title="Function template unhex"> </head> <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> <table cellpadding="2" width="100%"><tr> @@ -20,10 +20,10 @@ </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> +<a accesskey="p" href="hex_idp37891168.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_idp37903952.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> +<a name="boost.algorithm.hex_idp37897536"></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> @@ -35,7 +35,7 @@ <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> +<a name="idp87827488"></a><h2>Description</h2> <p> </p> @@ -48,13 +48,19 @@ </table></div> <p> </p> -<div class="variablelist"><table border="0"> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody> <tr> <td><p><span class="term">Parameters:</span></p></td> -<td><div class="variablelist"><table border="0"> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody> <tr> <td><p><span class="term"><code class="computeroutput">out</code></span></p></td> @@ -85,7 +91,7 @@ </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> +<a accesskey="p" href="hex_idp37891168.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_idp37903952.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_idp37923984.html index 6be71ee6be..25171c1901 100644 --- a/libs/algorithm/doc/html/boost/algorithm/hex_id338075.html +++ b/libs/algorithm/doc/html/boost/algorithm/hex_idp37923984.html @@ -3,11 +3,11 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> +<link rel="prev" href="unhex_idp37917696.html" title="Function template unhex"> +<link rel="next" href="unhex_idp37928000.html" title="Function template unhex"> </head> <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> <table cellpadding="2" width="100%"><tr> @@ -20,10 +20,10 @@ </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> +<a accesskey="p" href="unhex_idp37917696.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_idp37928000.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> +<a name="boost.algorithm.hex_idp37923984"></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> @@ -34,17 +34,23 @@ </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> +<a name="idp87908592"></a><h2>Description</h2> <p> </p> -<div class="variablelist"><table border="0"> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody> <tr> <td><p><span class="term">Parameters:</span></p></td> -<td><div class="variablelist"><table border="0"> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody><tr> <td><p><span class="term"><code class="computeroutput">input</code></span></p></td> <td><p>A container to be converted </p></td> @@ -69,7 +75,7 @@ </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> +<a accesskey="p" href="unhex_idp37917696.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_idp37928000.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> </div> </body> </html> diff --git a/libs/algorithm/doc/html/boost/algorithm/iota_idp37559984.html b/libs/algorithm/doc/html/boost/algorithm/iota_idp37559984.html new file mode 100644 index 0000000000..25b0fbfc34 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/iota_idp37559984.html @@ -0,0 +1,94 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template iota</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/iota_hpp.html" title="Header <boost/algorithm/cxx11/iota.hpp>"> +<link rel="prev" href="../../header/boost/algorithm/cxx11/iota_hpp.html" title="Header <boost/algorithm/cxx11/iota.hpp>"> +<link rel="next" href="iota_idp37567088.html" title="Function template iota"> +</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/cxx11/iota_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/iota_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="iota_idp37567088.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.iota_idp37559984"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template iota</span></h2> +<p>boost::algorithm::iota — Generates an increasing sequence of values, and stores them in [first, last) </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/cxx11/iota_hpp.html" title="Header <boost/algorithm/cxx11/iota.hpp>">boost/algorithm/cxx11/iota.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIterator<span class="special">,</span> <span class="keyword">typename</span> T<span class="special">></span> + <span class="keyword">void</span> <span class="identifier">iota</span><span class="special">(</span><span class="identifier">ForwardIterator</span> first<span class="special">,</span> <span class="identifier">ForwardIterator</span> last<span class="special">,</span> <span class="identifier">T</span> value<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp86022496"></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>This function is part of the C++2011 standard library. We will use the standard one if it is available, otherwise we have our own implementation. </p></td></tr> +</table></div> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody><tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<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">value</code></span></p></td> +<td><p>The initial value of the sequence to be generated </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="../../header/boost/algorithm/cxx11/iota_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/iota_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="iota_idp37567088.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/iota_idp37567088.html b/libs/algorithm/doc/html/boost/algorithm/iota_idp37567088.html new file mode 100644 index 0000000000..9764d65461 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/iota_idp37567088.html @@ -0,0 +1,80 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template iota</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/iota_hpp.html" title="Header <boost/algorithm/cxx11/iota.hpp>"> +<link rel="prev" href="iota_idp37559984.html" title="Function template iota"> +<link rel="next" href="iota_n.html" title="Function template iota_n"> +</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="iota_idp37559984.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/iota_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="iota_n.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.iota_idp37567088"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template iota</span></h2> +<p>boost::algorithm::iota — Generates an increasing sequence of values, and stores them in the input 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="../../header/boost/algorithm/cxx11/iota_hpp.html" title="Header <boost/algorithm/cxx11/iota.hpp>">boost/algorithm/cxx11/iota.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> T<span class="special">></span> <span class="keyword">void</span> <span class="identifier">iota</span><span class="special">(</span><span class="identifier">Range</span> <span class="special">&</span> r<span class="special">,</span> <span class="identifier">T</span> value<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp86042976"></a><h2>Description</h2> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody><tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">r</code></span></p></td> +<td><p>The input range </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">value</code></span></p></td> +<td><p>The initial value of the sequence to be generated </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="iota_idp37559984.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/iota_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="iota_n.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/iota_n.html b/libs/algorithm/doc/html/boost/algorithm/iota_n.html new file mode 100644 index 0000000000..c701c05b35 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/iota_n.html @@ -0,0 +1,85 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template iota_n</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/iota_hpp.html" title="Header <boost/algorithm/cxx11/iota.hpp>"> +<link rel="prev" href="iota_idp37567088.html" title="Function template iota"> +<link rel="next" href="../../header/boost/algorithm/cxx11/is_partitioned_hpp.html" title="Header <boost/algorithm/cxx11/is_partitioned.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="iota_idp37567088.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/iota_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/cxx11/is_partitioned_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.iota_n"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template iota_n</span></h2> +<p>boost::algorithm::iota_n — Generates an increasing sequence of values, and stores them in the input 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="../../header/boost/algorithm/cxx11/iota_hpp.html" title="Header <boost/algorithm/cxx11/iota.hpp>">boost/algorithm/cxx11/iota.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> OutputIterator<span class="special">,</span> <span class="keyword">typename</span> T<span class="special">></span> + <span class="identifier">OutputIterator</span> <span class="identifier">iota_n</span><span class="special">(</span><span class="identifier">OutputIterator</span> out<span class="special">,</span> <span class="identifier">T</span> value<span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</span> n<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp86063216"></a><h2>Description</h2> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody><tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">n</code></span></p></td> +<td><p>The number of items to write </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 results into </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">value</code></span></p></td> +<td><p>The initial value of the sequence to be generated </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="iota_idp37567088.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/iota_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/cxx11/is_partitioned_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/is_decreasing_idp37698432.html b/libs/algorithm/doc/html/boost/algorithm/is_decreasing_idp37698432.html new file mode 100644 index 0000000000..34eacbfbde --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/is_decreasing_idp37698432.html @@ -0,0 +1,97 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template is_decreasing</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>"> +<link rel="prev" href="is_increasing_idp37694000.html" title="Function template is_increasing"> +<link rel="next" href="is_decreasing_idp37704016.html" title="Function template is_decreasing"> +</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_increasing_idp37694000.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_decreasing_idp37704016.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.is_decreasing_idp37698432"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template is_decreasing</span></h2> +<p>boost::algorithm::is_decreasing</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/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>">boost/algorithm/cxx11/is_sorted.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIterator<span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_decreasing</span><span class="special">(</span><span class="identifier">ForwardIterator</span> first<span class="special">,</span> <span class="identifier">ForwardIterator</span> last<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp86803808"></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>This function will return true for sequences that contain items that compare equal. If that is not what you intended, you should use is_strictly_decreasing instead. </p></td></tr> +</table></div> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first</code></span></p></td> +<td><p>The start of the sequence to be tested. </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 sequence</p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>true if the entire sequence is decreasing; i.e, each item is less than or equal to the previous one.</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="is_increasing_idp37694000.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_decreasing_idp37704016.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/is_decreasing_idp37704016.html b/libs/algorithm/doc/html/boost/algorithm/is_decreasing_idp37704016.html new file mode 100644 index 0000000000..3e2f018c6d --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/is_decreasing_idp37704016.html @@ -0,0 +1,90 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template is_decreasing</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>"> +<link rel="prev" href="is_decreasing_idp37698432.html" title="Function template is_decreasing"> +<link rel="next" href="is_strictly_in_idp37708448.html" title="Function template is_strictly_increasing"> +</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_decreasing_idp37698432.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_strictly_in_idp37708448.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.is_decreasing_idp37704016"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template is_decreasing</span></h2> +<p>boost::algorithm::is_decreasing</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/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>">boost/algorithm/cxx11/is_sorted.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> R<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> range<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp86821856"></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>This function will return true for sequences that contain items that compare equal. If that is not what you intended, you should use is_strictly_decreasing instead. </p></td></tr> +</table></div> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody><tr> +<td><p><span class="term"><code class="computeroutput">range</code></span></p></td> +<td><p>The range to be tested.</p></td> +</tr></tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>true if the entire sequence is decreasing; i.e, each item is less than or equal to the previous one.</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="is_decreasing_idp37698432.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_strictly_in_idp37708448.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/is_increasing_idp37688256.html b/libs/algorithm/doc/html/boost/algorithm/is_increasing_idp37688256.html new file mode 100644 index 0000000000..6ae808c211 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/is_increasing_idp37688256.html @@ -0,0 +1,97 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template is_increasing</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>"> +<link rel="prev" href="is_sorted_idp37684576.html" title="Function template is_sorted"> +<link rel="next" href="is_increasing_idp37694000.html" title="Function template is_increasing"> +</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_idp37684576.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_increasing_idp37694000.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.is_increasing_idp37688256"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template is_increasing</span></h2> +<p>boost::algorithm::is_increasing</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/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>">boost/algorithm/cxx11/is_sorted.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIterator<span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_increasing</span><span class="special">(</span><span class="identifier">ForwardIterator</span> first<span class="special">,</span> <span class="identifier">ForwardIterator</span> last<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp86768800"></a><h2>Description</h2> +<p><span style="color: red"><ndash></ndash></span> Range based versions of the C++11 functions + +</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>This function will return true for sequences that contain items that compare equal. If that is not what you intended, you should use is_strictly_increasing instead. </p></td></tr> +</table></div> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first</code></span></p></td> +<td><p>The start of the sequence to be tested. </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 sequence</p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>true if the entire sequence is increasing; i.e, each item is greater than or equal to the previous one.</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="is_sorted_idp37684576.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_increasing_idp37694000.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/is_increasing_idp37694000.html b/libs/algorithm/doc/html/boost/algorithm/is_increasing_idp37694000.html new file mode 100644 index 0000000000..f8e8e5de50 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/is_increasing_idp37694000.html @@ -0,0 +1,90 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template is_increasing</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>"> +<link rel="prev" href="is_increasing_idp37688256.html" title="Function template is_increasing"> +<link rel="next" href="is_decreasing_idp37698432.html" title="Function template is_decreasing"> +</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_increasing_idp37688256.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_decreasing_idp37698432.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.is_increasing_idp37694000"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template is_increasing</span></h2> +<p>boost::algorithm::is_increasing</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/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>">boost/algorithm/cxx11/is_sorted.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> R<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> range<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp86786976"></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>This function will return true for sequences that contain items that compare equal. If that is not what you intended, you should use is_strictly_increasing instead. </p></td></tr> +</table></div> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody><tr> +<td><p><span class="term"><code class="computeroutput">range</code></span></p></td> +<td><p>The range to be tested.</p></td> +</tr></tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>true if the entire sequence is increasing; i.e, each item is greater than or equal to the previous one.</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="is_increasing_idp37688256.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_decreasing_idp37698432.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/is_partitioned_idp37581904.html b/libs/algorithm/doc/html/boost/algorithm/is_partitioned_idp37581904.html new file mode 100644 index 0000000000..14880ccfb5 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/is_partitioned_idp37581904.html @@ -0,0 +1,95 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template is_partitioned</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/is_partitioned_hpp.html" title="Header <boost/algorithm/cxx11/is_partitioned.hpp>"> +<link rel="prev" href="../../header/boost/algorithm/cxx11/is_partitioned_hpp.html" title="Header <boost/algorithm/cxx11/is_partitioned.hpp>"> +<link rel="next" href="is_partitioned_idp37588976.html" title="Function template 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="../../header/boost/algorithm/cxx11/is_partitioned_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_partitioned_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="is_partitioned_idp37588976.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.is_partitioned_idp37581904"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template is_partitioned</span></h2> +<p>boost::algorithm::is_partitioned — Tests to see if a sequence is partitioned according to a predicate. </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/cxx11/is_partitioned_hpp.html" title="Header <boost/algorithm/cxx11/is_partitioned.hpp>">boost/algorithm/cxx11/is_partitioned.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> UnaryPredicate<span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_partitioned</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">UnaryPredicate</span> p<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp86114112"></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>This function is part of the C++2011 standard library. We will use the standard one if it is available, otherwise we have our own implementation. </p></td></tr> +</table></div> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody><tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<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">p</code></span></p></td> +<td><p>The predicate to test the values with </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="../../header/boost/algorithm/cxx11/is_partitioned_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_partitioned_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="is_partitioned_idp37588976.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/is_partitioned_idp37588976.html b/libs/algorithm/doc/html/boost/algorithm/is_partitioned_idp37588976.html new file mode 100644 index 0000000000..da796ca8e2 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/is_partitioned_idp37588976.html @@ -0,0 +1,81 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template is_partitioned</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/is_partitioned_hpp.html" title="Header <boost/algorithm/cxx11/is_partitioned.hpp>"> +<link rel="prev" href="is_partitioned_idp37581904.html" title="Function template is_partitioned"> +<link rel="next" href="../../header/boost/algorithm/cxx11/is_permutation_hpp.html" title="Header <boost/algorithm/cxx11/is_permutation.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="is_partitioned_idp37581904.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_partitioned_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/cxx11/is_permutation_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.is_partitioned_idp37588976"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template is_partitioned</span></h2> +<p>boost::algorithm::is_partitioned — Generates an increasing sequence of values, and stores them in the input 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="../../header/boost/algorithm/cxx11/is_partitioned_hpp.html" title="Header <boost/algorithm/cxx11/is_partitioned.hpp>">boost/algorithm/cxx11/is_partitioned.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> UnaryPredicate<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> r<span class="special">,</span> <span class="identifier">UnaryPredicate</span> p<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp86135264"></a><h2>Description</h2> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody><tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">p</code></span></p></td> +<td><p>The predicate to test the values with </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></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="is_partitioned_idp37581904.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_partitioned_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/cxx11/is_permutation_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/is_permutation_idp37596448.html b/libs/algorithm/doc/html/boost/algorithm/is_permutation_idp37596448.html new file mode 100644 index 0000000000..6713631521 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/is_permutation_idp37596448.html @@ -0,0 +1,100 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template is_permutation</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/is_permutation_hpp.html" title="Header <boost/algorithm/cxx11/is_permutation.hpp>"> +<link rel="prev" href="../../header/boost/algorithm/cxx11/is_permutation_hpp.html" title="Header <boost/algorithm/cxx11/is_permutation.hpp>"> +<link rel="next" href="is_permutation_idp37605232.html" title="Function template is_permutation"> +</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/cxx11/is_permutation_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_permutation_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="is_permutation_idp37605232.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.is_permutation_idp37596448"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template is_permutation</span></h2> +<p>boost::algorithm::is_permutation — Tests to see if the sequence [first,last) is a permutation of the sequence starting at first2. </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/cxx11/is_permutation_hpp.html" title="Header <boost/algorithm/cxx11/is_permutation.hpp>">boost/algorithm/cxx11/is_permutation.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIterator1<span class="special">,</span> <span class="keyword">typename</span> ForwardIterator2<span class="special">,</span> + <span class="keyword">typename</span> BinaryPredicate<span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_permutation</span><span class="special">(</span><span class="identifier">ForwardIterator1</span> first1<span class="special">,</span> <span class="identifier">ForwardIterator1</span> last1<span class="special">,</span> + <span class="identifier">ForwardIterator2</span> first2<span class="special">,</span> <span class="identifier">BinaryPredicate</span> p<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp86224080"></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>This function is part of the C++2011 standard library. We will use the standard one if it is available, otherwise we have our own implementation. </p></td></tr> +</table></div> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody><tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first1</code></span></p></td> +<td><p>The start of the input sequence </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">first2</code></span></p></td> +<td><p>The start of the second sequence </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last1</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">p</code></span></p></td> +<td><p>The predicate to compare elements with</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="../../header/boost/algorithm/cxx11/is_permutation_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_permutation_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="is_permutation_idp37605232.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/is_permutation_idp37605232.html b/libs/algorithm/doc/html/boost/algorithm/is_permutation_idp37605232.html new file mode 100644 index 0000000000..bd62afbb2e --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/is_permutation_idp37605232.html @@ -0,0 +1,91 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template is_permutation</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/is_permutation_hpp.html" title="Header <boost/algorithm/cxx11/is_permutation.hpp>"> +<link rel="prev" href="is_permutation_idp37596448.html" title="Function template is_permutation"> +<link rel="next" href="is_permutation_idp37611904.html" title="Function template is_permutation"> +</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_permutation_idp37596448.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_permutation_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="is_permutation_idp37611904.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.is_permutation_idp37605232"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template is_permutation</span></h2> +<p>boost::algorithm::is_permutation — Tests to see if the sequence [first,last) is a permutation of the sequence starting at first2. </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/cxx11/is_permutation_hpp.html" title="Header <boost/algorithm/cxx11/is_permutation.hpp>">boost/algorithm/cxx11/is_permutation.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIterator1<span class="special">,</span> <span class="keyword">typename</span> ForwardIterator2<span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_permutation</span><span class="special">(</span><span class="identifier">ForwardIterator1</span> first1<span class="special">,</span> <span class="identifier">ForwardIterator1</span> last1<span class="special">,</span> + <span class="identifier">ForwardIterator2</span> first2<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp86246720"></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>This function is part of the C++2011 standard library. We will use the standard one if it is available, otherwise we have our own implementation. </p></td></tr> +</table></div> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody><tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first1</code></span></p></td> +<td><p>The start of the input sequence </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">first2</code></span></p></td> +<td><p>The start of the second sequence </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="is_permutation_idp37596448.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_permutation_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="is_permutation_idp37611904.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/is_permutation_idp37611904.html b/libs/algorithm/doc/html/boost/algorithm/is_permutation_idp37611904.html new file mode 100644 index 0000000000..c3a0b40acc --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/is_permutation_idp37611904.html @@ -0,0 +1,81 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template is_permutation</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/is_permutation_hpp.html" title="Header <boost/algorithm/cxx11/is_permutation.hpp>"> +<link rel="prev" href="is_permutation_idp37605232.html" title="Function template is_permutation"> +<link rel="next" href="is_permutation_idp37617168.html" title="Function template is_permutation"> +</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_permutation_idp37605232.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_permutation_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="is_permutation_idp37617168.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.is_permutation_idp37611904"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template is_permutation</span></h2> +<p>boost::algorithm::is_permutation — Tests to see if the sequence [first,last) is a permutation of the sequence starting at first2. </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/cxx11/is_permutation_hpp.html" title="Header <boost/algorithm/cxx11/is_permutation.hpp>">boost/algorithm/cxx11/is_permutation.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> ForwardIterator<span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_permutation</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">ForwardIterator</span> first2<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp86266864"></a><h2>Description</h2> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody><tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first2</code></span></p></td> +<td><p>The start of the second sequence </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></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="is_permutation_idp37605232.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_permutation_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="is_permutation_idp37617168.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/is_permutation_idp37617168.html b/libs/algorithm/doc/html/boost/algorithm/is_permutation_idp37617168.html new file mode 100644 index 0000000000..b36c129952 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/is_permutation_idp37617168.html @@ -0,0 +1,87 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template is_permutation</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/is_permutation_hpp.html" title="Header <boost/algorithm/cxx11/is_permutation.hpp>"> +<link rel="prev" href="is_permutation_idp37611904.html" title="Function template is_permutation"> +<link rel="next" href="../../header/boost/algorithm/cxx14/is_permutation_hpp.html" title="Header <boost/algorithm/cxx14/is_permutation.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="is_permutation_idp37611904.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_permutation_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/cxx14/is_permutation_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.is_permutation_idp37617168"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template is_permutation</span></h2> +<p>boost::algorithm::is_permutation — Tests to see if the sequence [first,last) is a permutation of the sequence starting at first2. </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/cxx11/is_permutation_hpp.html" title="Header <boost/algorithm/cxx11/is_permutation.hpp>">boost/algorithm/cxx11/is_permutation.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> ForwardIterator<span class="special">,</span> <span class="keyword">typename</span> BinaryPredicate<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">ForwardIterator</span> <span class="special">></span><span class="special">::</span><span class="identifier">value</span><span class="special">,</span> <span class="keyword">bool</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> + <span class="identifier">is_permutation</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">ForwardIterator</span> first2<span class="special">,</span> + <span class="identifier">BinaryPredicate</span> pred<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp86299744"></a><h2>Description</h2> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody><tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first2</code></span></p></td> +<td><p>The start of the second sequence </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">pred</code></span></p></td> +<td><p>The predicate to compare elements with </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></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="is_permutation_idp37611904.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_permutation_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/cxx14/is_permutation_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/is_permutation_idp37626480.html b/libs/algorithm/doc/html/boost/algorithm/is_permutation_idp37626480.html new file mode 100644 index 0000000000..07db27d49b --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/is_permutation_idp37626480.html @@ -0,0 +1,99 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template is_permutation</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx14/is_permutation_hpp.html" title="Header <boost/algorithm/cxx14/is_permutation.hpp>"> +<link rel="prev" href="../../header/boost/algorithm/cxx14/is_permutation_hpp.html" title="Header <boost/algorithm/cxx14/is_permutation.hpp>"> +<link rel="next" href="is_permutation_idp37634720.html" title="Function template is_permutation"> +</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/cxx14/is_permutation_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx14/is_permutation_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="is_permutation_idp37634720.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.is_permutation_idp37626480"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template is_permutation</span></h2> +<p>boost::algorithm::is_permutation — Tests to see if the sequence [first,last) is a permutation of the sequence starting at first2. </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/cxx14/is_permutation_hpp.html" title="Header <boost/algorithm/cxx14/is_permutation.hpp>">boost/algorithm/cxx14/is_permutation.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIterator1<span class="special">,</span> <span class="keyword">typename</span> ForwardIterator2<span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_permutation</span><span class="special">(</span><span class="identifier">ForwardIterator1</span> first1<span class="special">,</span> <span class="identifier">ForwardIterator1</span> last1<span class="special">,</span> + <span class="identifier">ForwardIterator2</span> first2<span class="special">,</span> <span class="identifier">ForwardIterator2</span> last2<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp86355936"></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>This function is part of the C++2014 standard library. We will use the standard one if it is available, otherwise we have our own implementation. </p></td></tr> +</table></div> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody><tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first1</code></span></p></td> +<td><p>The start of the input sequence </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">first2</code></span></p></td> +<td><p>The start of the second sequence </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last1</code></span></p></td> +<td><p>One past the end of the second sequence </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last2</code></span></p></td> +<td><p>One past the end of the input sequence </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="../../header/boost/algorithm/cxx14/is_permutation_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx14/is_permutation_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="is_permutation_idp37634720.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/is_permutation_idp37634720.html b/libs/algorithm/doc/html/boost/algorithm/is_permutation_idp37634720.html new file mode 100644 index 0000000000..10ae855366 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/is_permutation_idp37634720.html @@ -0,0 +1,105 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template is_permutation</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx14/is_permutation_hpp.html" title="Header <boost/algorithm/cxx14/is_permutation.hpp>"> +<link rel="prev" href="is_permutation_idp37626480.html" title="Function template is_permutation"> +<link rel="next" href="../../header/boost/algorithm/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.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="is_permutation_idp37626480.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx14/is_permutation_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/cxx11/is_sorted_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.is_permutation_idp37634720"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template is_permutation</span></h2> +<p>boost::algorithm::is_permutation — Tests to see if the sequence [first,last) is a permutation of the sequence starting at first2. </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/cxx14/is_permutation_hpp.html" title="Header <boost/algorithm/cxx14/is_permutation.hpp>">boost/algorithm/cxx14/is_permutation.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIterator1<span class="special">,</span> <span class="keyword">typename</span> ForwardIterator2<span class="special">,</span> + <span class="keyword">typename</span> BinaryPredicate<span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_permutation</span><span class="special">(</span><span class="identifier">ForwardIterator1</span> first1<span class="special">,</span> <span class="identifier">ForwardIterator1</span> last1<span class="special">,</span> + <span class="identifier">ForwardIterator2</span> first2<span class="special">,</span> <span class="identifier">ForwardIterator2</span> last2<span class="special">,</span> + <span class="identifier">BinaryPredicate</span> pred<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp86382688"></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>This function is part of the C++2014 standard library. We will use the standard one if it is available, otherwise we have our own implementation. </p></td></tr> +</table></div> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody><tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first1</code></span></p></td> +<td><p>The start of the input sequence </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">first2</code></span></p></td> +<td><p>The start of the second sequence </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last1</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">last2</code></span></p></td> +<td><p>One past the end of the second sequence </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">pred</code></span></p></td> +<td><p>The predicate to compare elements with</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="is_permutation_idp37626480.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx14/is_permutation_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/cxx11/is_sorted_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/is_sorted_idp37658304.html b/libs/algorithm/doc/html/boost/algorithm/is_sorted_idp37658304.html new file mode 100644 index 0000000000..c911efed3d --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/is_sorted_idp37658304.html @@ -0,0 +1,92 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template is_sorted</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>"> +<link rel="prev" href="is_sorted_unti_idp37653456.html" title="Function template is_sorted_until"> +<link rel="next" href="is_sorted_idp37664832.html" title="Function template 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="is_sorted_unti_idp37653456.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_sorted_idp37664832.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.is_sorted_idp37658304"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template is_sorted</span></h2> +<p>boost::algorithm::is_sorted</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/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>">boost/algorithm/cxx11/is_sorted.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIterator<span class="special">,</span> <span class="keyword">typename</span> Pred<span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_sorted</span><span class="special">(</span><span class="identifier">ForwardIterator</span> first<span class="special">,</span> <span class="identifier">ForwardIterator</span> last<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="idp86626240"></a><h2>Description</h2> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first</code></span></p></td> +<td><p>The start of the sequence to be tested. </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 sequence </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">p</code></span></p></td> +<td><p>A binary predicate that returns true if two elements are ordered. </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>whether or not the entire sequence is sorted</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="is_sorted_unti_idp37653456.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_sorted_idp37664832.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/is_sorted_idp37664832.html b/libs/algorithm/doc/html/boost/algorithm/is_sorted_idp37664832.html new file mode 100644 index 0000000000..ff426d030d --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/is_sorted_idp37664832.html @@ -0,0 +1,88 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template is_sorted</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>"> +<link rel="prev" href="is_sorted_idp37658304.html" title="Function template is_sorted"> +<link rel="next" href="is_sorted_unti_idp37669648.html" title="Function template is_sorted_until"> +</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_idp37658304.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_sorted_unti_idp37669648.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.is_sorted_idp37664832"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template is_sorted</span></h2> +<p>boost::algorithm::is_sorted</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/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>">boost/algorithm/cxx11/is_sorted.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIterator<span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_sorted</span><span class="special">(</span><span class="identifier">ForwardIterator</span> first<span class="special">,</span> <span class="identifier">ForwardIterator</span> last<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp86644768"></a><h2>Description</h2> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first</code></span></p></td> +<td><p>The start of the sequence to be tested. </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 sequence </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>whether or not the entire sequence is sorted</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="is_sorted_idp37658304.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_sorted_unti_idp37669648.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/is_sorted_idp37679056.html b/libs/algorithm/doc/html/boost/algorithm/is_sorted_idp37679056.html new file mode 100644 index 0000000000..0a57c9bea2 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/is_sorted_idp37679056.html @@ -0,0 +1,89 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template is_sorted</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>"> +<link rel="prev" href="is_sorted_unti_idp37675344.html" title="Function template is_sorted_until"> +<link rel="next" href="is_sorted_idp37684576.html" title="Function template 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="is_sorted_unti_idp37675344.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_sorted_idp37684576.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.is_sorted_idp37679056"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template is_sorted</span></h2> +<p>boost::algorithm::is_sorted</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/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>">boost/algorithm/cxx11/is_sorted.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> R<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">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">R</span><span class="special">,</span> <span class="identifier">Pred</span> <span class="special">></span><span class="special">::</span><span class="identifier">value</span><span class="special">,</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="keyword">bool</span> <span class="special">></span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> + <span class="identifier">is_sorted</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">R</span> <span class="special">&</span> range<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="idp86735408"></a><h2>Description</h2> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">p</code></span></p></td> +<td><p>A binary predicate that returns true if two elements are ordered. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">range</code></span></p></td> +<td><p>The range to be tested. </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>whether or not the entire range R is sorted (according to 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="is_sorted_unti_idp37675344.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_sorted_idp37684576.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/is_sorted_idp37684576.html b/libs/algorithm/doc/html/boost/algorithm/is_sorted_idp37684576.html new file mode 100644 index 0000000000..f017cec568 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/is_sorted_idp37684576.html @@ -0,0 +1,81 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template is_sorted</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>"> +<link rel="prev" href="is_sorted_idp37679056.html" title="Function template is_sorted"> +<link rel="next" href="is_increasing_idp37688256.html" title="Function template is_increasing"> +</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_idp37679056.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_increasing_idp37688256.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.is_sorted_idp37684576"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template is_sorted</span></h2> +<p>boost::algorithm::is_sorted</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/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>">boost/algorithm/cxx11/is_sorted.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> R<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">R</span> <span class="special">&</span> range<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp86752752"></a><h2>Description</h2> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody><tr> +<td><p><span class="term"><code class="computeroutput">range</code></span></p></td> +<td><p>The range to be tested. </p></td> +</tr></tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>whether or not the entire range R is sorted</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="is_sorted_idp37679056.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_increasing_idp37688256.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/is_sorted_unti_idp37646864.html b/libs/algorithm/doc/html/boost/algorithm/is_sorted_unti_idp37646864.html new file mode 100644 index 0000000000..460939bbdc --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/is_sorted_unti_idp37646864.html @@ -0,0 +1,93 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template is_sorted_until</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>"> +<link rel="prev" href="../../header/boost/algorithm/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>"> +<link rel="next" href="is_sorted_unti_idp37653456.html" title="Function template is_sorted_until"> +</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/cxx11/is_sorted_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_sorted_unti_idp37653456.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.is_sorted_unti_idp37646864"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template is_sorted_until</span></h2> +<p>boost::algorithm::is_sorted_until</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/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>">boost/algorithm/cxx11/is_sorted.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIterator<span class="special">,</span> <span class="keyword">typename</span> Pred<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> first<span class="special">,</span> <span class="identifier">ForwardIterator</span> last<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="idp86587456"></a><h2>Description</h2> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first</code></span></p></td> +<td><p>The start of the sequence to be tested. </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 sequence </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">p</code></span></p></td> +<td><p>A binary predicate that returns true if two elements are ordered. </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>the point in the sequence [first, last) where the elements are unordered (according to 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="../../header/boost/algorithm/cxx11/is_sorted_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_sorted_unti_idp37653456.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/is_sorted_unti_idp37653456.html b/libs/algorithm/doc/html/boost/algorithm/is_sorted_unti_idp37653456.html new file mode 100644 index 0000000000..00e425f6c8 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/is_sorted_unti_idp37653456.html @@ -0,0 +1,88 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template is_sorted_until</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>"> +<link rel="prev" href="is_sorted_unti_idp37646864.html" title="Function template is_sorted_until"> +<link rel="next" href="is_sorted_idp37658304.html" title="Function template 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="is_sorted_unti_idp37646864.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_sorted_idp37658304.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.is_sorted_unti_idp37653456"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template is_sorted_until</span></h2> +<p>boost::algorithm::is_sorted_until</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/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>">boost/algorithm/cxx11/is_sorted.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIterator<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> first<span class="special">,</span> <span class="identifier">ForwardIterator</span> last<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp86606144"></a><h2>Description</h2> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first</code></span></p></td> +<td><p>The start of the sequence to be tested. </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 sequence </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>the point in the sequence [first, last) where the elements are unordered</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="is_sorted_unti_idp37646864.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_sorted_idp37658304.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/is_sorted_unti_idp37669648.html b/libs/algorithm/doc/html/boost/algorithm/is_sorted_unti_idp37669648.html new file mode 100644 index 0000000000..c8730ecf47 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/is_sorted_unti_idp37669648.html @@ -0,0 +1,89 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template is_sorted_until</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>"> +<link rel="prev" href="is_sorted_idp37664832.html" title="Function template is_sorted"> +<link rel="next" href="is_sorted_unti_idp37675344.html" title="Function template is_sorted_until"> +</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_idp37664832.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_sorted_unti_idp37675344.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.is_sorted_unti_idp37669648"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template is_sorted_until</span></h2> +<p>boost::algorithm::is_sorted_until</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/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>">boost/algorithm/cxx11/is_sorted.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> R<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">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">R</span><span class="special">,</span> <span class="identifier">Pred</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="keyword">const</span> <span class="identifier">R</span> <span class="special">></span> <span class="special">></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">R</span> <span class="special">&</span> range<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="idp86679728"></a><h2>Description</h2> +<p><span style="color: red"><ndash></ndash></span> Range based versions of the C++11 functions + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">p</code></span></p></td> +<td><p>A binary predicate that returns true if two elements are ordered. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">range</code></span></p></td> +<td><p>The range to be tested. </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>the point in the range R where the elements are unordered (according to 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="is_sorted_idp37664832.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_sorted_unti_idp37675344.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/is_sorted_unti_idp37675344.html b/libs/algorithm/doc/html/boost/algorithm/is_sorted_unti_idp37675344.html new file mode 100644 index 0000000000..01b1dc9fc8 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/is_sorted_unti_idp37675344.html @@ -0,0 +1,82 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template is_sorted_until</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>"> +<link rel="prev" href="is_sorted_unti_idp37669648.html" title="Function template is_sorted_until"> +<link rel="next" href="is_sorted_idp37679056.html" title="Function template 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="is_sorted_unti_idp37669648.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_sorted_idp37679056.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.is_sorted_unti_idp37675344"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template is_sorted_until</span></h2> +<p>boost::algorithm::is_sorted_until</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/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>">boost/algorithm/cxx11/is_sorted.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> R<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="keyword">const</span> <span class="identifier">R</span> <span class="special">></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">R</span> <span class="special">&</span> range<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp86702032"></a><h2>Description</h2> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody><tr> +<td><p><span class="term"><code class="computeroutput">range</code></span></p></td> +<td><p>The range to be tested. </p></td> +</tr></tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>the point in the range R where the elements are unordered</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="is_sorted_unti_idp37669648.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_sorted_idp37679056.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/is_strictly_de_idp37718464.html b/libs/algorithm/doc/html/boost/algorithm/is_strictly_de_idp37718464.html new file mode 100644 index 0000000000..69ca22e824 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/is_strictly_de_idp37718464.html @@ -0,0 +1,97 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template is_strictly_decreasing</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>"> +<link rel="prev" href="is_strictly_in_idp37714032.html" title="Function template is_strictly_increasing"> +<link rel="next" href="is_strictly_de_idp37724048.html" title="Function template is_strictly_decreasing"> +</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_strictly_in_idp37714032.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_strictly_de_idp37724048.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.is_strictly_de_idp37718464"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template is_strictly_decreasing</span></h2> +<p>boost::algorithm::is_strictly_decreasing</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/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>">boost/algorithm/cxx11/is_sorted.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIterator<span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_strictly_decreasing</span><span class="special">(</span><span class="identifier">ForwardIterator</span> first<span class="special">,</span> <span class="identifier">ForwardIterator</span> last<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp86873664"></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>This function will return false for sequences that contain items that compare equal. If that is not what you intended, you should use is_decreasing instead. </p></td></tr> +</table></div> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first</code></span></p></td> +<td><p>The start of the sequence to be tested. </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 sequence</p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>true if the entire sequence is strictly decreasing; i.e, each item is less than the previous one</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="is_strictly_in_idp37714032.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_strictly_de_idp37724048.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/is_strictly_de_idp37724048.html b/libs/algorithm/doc/html/boost/algorithm/is_strictly_de_idp37724048.html new file mode 100644 index 0000000000..30b8ef52a7 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/is_strictly_de_idp37724048.html @@ -0,0 +1,90 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template is_strictly_decreasing</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>"> +<link rel="prev" href="is_strictly_de_idp37718464.html" title="Function template is_strictly_decreasing"> +<link rel="next" href="../../header/boost/algorithm/cxx11/none_of_hpp.html" title="Header <boost/algorithm/cxx11/none_of.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="is_strictly_de_idp37718464.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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/cxx11/none_of_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.is_strictly_de_idp37724048"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template is_strictly_decreasing</span></h2> +<p>boost::algorithm::is_strictly_decreasing</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/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>">boost/algorithm/cxx11/is_sorted.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> R<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> range<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp86891744"></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>This function will return false for sequences that contain items that compare equal. If that is not what you intended, you should use is_decreasing instead. </p></td></tr> +</table></div> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody><tr> +<td><p><span class="term"><code class="computeroutput">range</code></span></p></td> +<td><p>The range to be tested.</p></td> +</tr></tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>true if the entire sequence is strictly decreasing; i.e, each item is less than the previous one</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="is_strictly_de_idp37718464.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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/cxx11/none_of_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/is_strictly_in_idp37708448.html b/libs/algorithm/doc/html/boost/algorithm/is_strictly_in_idp37708448.html new file mode 100644 index 0000000000..82a7c693ca --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/is_strictly_in_idp37708448.html @@ -0,0 +1,97 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template is_strictly_increasing</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>"> +<link rel="prev" href="is_decreasing_idp37704016.html" title="Function template is_decreasing"> +<link rel="next" href="is_strictly_in_idp37714032.html" title="Function template is_strictly_increasing"> +</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_decreasing_idp37704016.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_strictly_in_idp37714032.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.is_strictly_in_idp37708448"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template is_strictly_increasing</span></h2> +<p>boost::algorithm::is_strictly_increasing</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/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>">boost/algorithm/cxx11/is_sorted.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIterator<span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_strictly_increasing</span><span class="special">(</span><span class="identifier">ForwardIterator</span> first<span class="special">,</span> <span class="identifier">ForwardIterator</span> last<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp86838720"></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>This function will return false for sequences that contain items that compare equal. If that is not what you intended, you should use is_increasing instead. </p></td></tr> +</table></div> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first</code></span></p></td> +<td><p>The start of the sequence to be tested. </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 sequence</p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>true if the entire sequence is strictly increasing; i.e, each item is greater than the previous one</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="is_decreasing_idp37704016.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_strictly_in_idp37714032.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/is_strictly_in_idp37714032.html b/libs/algorithm/doc/html/boost/algorithm/is_strictly_in_idp37714032.html new file mode 100644 index 0000000000..fe5a1daaf4 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/is_strictly_in_idp37714032.html @@ -0,0 +1,90 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template is_strictly_increasing</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>"> +<link rel="prev" href="is_strictly_in_idp37708448.html" title="Function template is_strictly_increasing"> +<link rel="next" href="is_strictly_de_idp37718464.html" title="Function template is_strictly_decreasing"> +</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_strictly_in_idp37708448.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_strictly_de_idp37718464.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.is_strictly_in_idp37714032"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template is_strictly_increasing</span></h2> +<p>boost::algorithm::is_strictly_increasing</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/cxx11/is_sorted_hpp.html" title="Header <boost/algorithm/cxx11/is_sorted.hpp>">boost/algorithm/cxx11/is_sorted.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> R<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> range<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp86856800"></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>This function will return false for sequences that contain items that compare equal. If that is not what you intended, you should use is_increasing instead. </p></td></tr> +</table></div> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody><tr> +<td><p><span class="term"><code class="computeroutput">range</code></span></p></td> +<td><p>The range to be tested.</p></td> +</tr></tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>true if the entire sequence is strictly increasing; i.e, each item is greater than the previous one</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="is_strictly_in_idp37708448.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/is_sorted_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="is_strictly_de_idp37718464.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_p_idp38098816.html index cb2f3f5a98..557108eea9 100644 --- a/libs/algorithm/doc/html/boost/algorithm/knuth_morris_prat_id339421.html +++ b/libs/algorithm/doc/html/boost/algorithm/knuth_morris_p_idp38098816.html @@ -3,7 +3,7 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> @@ -23,7 +23,7 @@ <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> +<a name="boost.algorithm.knuth_morris_p_idp38098816"></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> @@ -37,15 +37,21 @@ <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> +<a name="idp88855808"></a><h2>Description</h2> <p> </p> -<div class="variablelist"><table border="0"> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody><tr> <td><p><span class="term">Parameters:</span></p></td> -<td><div class="variablelist"><table border="0"> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody> <tr> <td><p><span class="term"><code class="computeroutput">corpus_first</code></span></p></td> diff --git a/libs/algorithm/doc/html/boost/algorithm/knuth_morris_pratt.html b/libs/algorithm/doc/html/boost/algorithm/knuth_morris_pratt.html index 52f4ea65d6..6a1b7fe013 100644 --- a/libs/algorithm/doc/html/boost/algorithm/knuth_morris_pratt.html +++ b/libs/algorithm/doc/html/boost/algorithm/knuth_morris_pratt.html @@ -3,11 +3,11 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> +<link rel="next" href="knuth_morris_p_idp38098816.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> @@ -20,7 +20,7 @@ </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> +<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_p_idp38098816.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> @@ -35,35 +35,35 @@ <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> + <a class="link" href="knuth_morris_pratt.html#idp38096704-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#idp38098368-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="comment">// <a class="link" href="knuth_morris_pratt.html#idp38089968-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="identifier">corpusIter</span> <a class="link" href="knuth_morris_pratt.html#idp38090528-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="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#idp38093872-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> +<a name="idp88800208"></a><h2>Description</h2> <div class="refsect2"> -<a name="id799442"></a><h3> +<a name="idp88800624"></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> +<li class="listitem"><pre class="literallayout"><a name="idp38096704-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="idp38098368-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> +<a name="idp88812848"></a><h3> +<a name="idp38089968-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> + <span class="identifier">corpusIter</span> <a name="idp38090528-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> + <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="idp38093872-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> @@ -78,7 +78,7 @@ </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> +<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_p_idp38098816.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> </div> </body> </html> diff --git a/libs/algorithm/doc/html/boost/algorithm/mismatch_idp37845680.html b/libs/algorithm/doc/html/boost/algorithm/mismatch_idp37845680.html new file mode 100644 index 0000000000..4de79ca6c0 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/mismatch_idp37845680.html @@ -0,0 +1,103 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template mismatch</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx14/mismatch_hpp.html" title="Header <boost/algorithm/cxx14/mismatch.hpp>"> +<link rel="prev" href="../../header/boost/algorithm/cxx14/mismatch_hpp.html" title="Header <boost/algorithm/cxx14/mismatch.hpp>"> +<link rel="next" href="mismatch_idp37855040.html" title="Function template mismatch"> +</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/cxx14/mismatch_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx14/mismatch_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="mismatch_idp37855040.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.mismatch_idp37845680"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template mismatch</span></h2> +<p>boost::algorithm::mismatch</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/cxx14/mismatch_hpp.html" title="Header <boost/algorithm/cxx14/mismatch.hpp>">boost/algorithm/cxx14/mismatch.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator1<span class="special">,</span> <span class="keyword">typename</span> InputIterator2<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">InputIterator1</span><span class="special">,</span> <span class="identifier">InputIterator2</span> <span class="special">></span> + <span class="identifier">mismatch</span><span class="special">(</span><span class="identifier">InputIterator1</span> first1<span class="special">,</span> <span class="identifier">InputIterator1</span> last1<span class="special">,</span> <span class="identifier">InputIterator2</span> first2<span class="special">,</span> + <span class="identifier">InputIterator2</span> last2<span class="special">,</span> <span class="identifier">BinaryPredicate</span> pred<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp87519392"></a><h2>Description</h2> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first1</code></span></p></td> +<td><p>The start of the first range. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">first2</code></span></p></td> +<td><p>The start of the second range. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last1</code></span></p></td> +<td><p>One past the end of the first range. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last2</code></span></p></td> +<td><p>One past the end of the second range. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">pred</code></span></p></td> +<td><p>A predicate for comparing the elements of the ranges </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>a pair of iterators pointing to the first elements in the sequence that do not match</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="../../header/boost/algorithm/cxx14/mismatch_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx14/mismatch_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="mismatch_idp37855040.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/mismatch_idp37855040.html b/libs/algorithm/doc/html/boost/algorithm/mismatch_idp37855040.html new file mode 100644 index 0000000000..784d570cd9 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/mismatch_idp37855040.html @@ -0,0 +1,98 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template mismatch</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx14/mismatch_hpp.html" title="Header <boost/algorithm/cxx14/mismatch.hpp>"> +<link rel="prev" href="mismatch_idp37845680.html" title="Function template mismatch"> +<link rel="next" href="../../header/boost/algorithm/gather_hpp.html" title="Header <boost/algorithm/gather.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="mismatch_idp37845680.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx14/mismatch_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/gather_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.mismatch_idp37855040"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template mismatch</span></h2> +<p>boost::algorithm::mismatch</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/cxx14/mismatch_hpp.html" title="Header <boost/algorithm/cxx14/mismatch.hpp>">boost/algorithm/cxx14/mismatch.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator1<span class="special">,</span> <span class="keyword">typename</span> InputIterator2<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">InputIterator1</span><span class="special">,</span> <span class="identifier">InputIterator2</span> <span class="special">></span> + <span class="identifier">mismatch</span><span class="special">(</span><span class="identifier">InputIterator1</span> first1<span class="special">,</span> <span class="identifier">InputIterator1</span> last1<span class="special">,</span> <span class="identifier">InputIterator2</span> first2<span class="special">,</span> + <span class="identifier">InputIterator2</span> last2<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp87548944"></a><h2>Description</h2> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">first1</code></span></p></td> +<td><p>The start of the first range. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">first2</code></span></p></td> +<td><p>The start of the second range. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last1</code></span></p></td> +<td><p>One past the end of the first range. </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">last2</code></span></p></td> +<td><p>One past the end of the second range. </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>a pair of iterators pointing to the first elements in the sequence that do not match</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="mismatch_idp37845680.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx14/mismatch_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/gather_hpp.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 index 199a29b56f..88c4f903bb 100644 --- a/libs/algorithm/doc/html/boost/algorithm/non_hex_input.html +++ b/libs/algorithm/doc/html/boost/algorithm/non_hex_input.html @@ -3,11 +3,11 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> +<link rel="next" href="hex_idp37883616.html" title="Function template hex"> </head> <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> <table cellpadding="2" width="100%"><tr> @@ -20,7 +20,7 @@ </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> +<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_idp37883616.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> @@ -45,7 +45,7 @@ </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> +<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_idp37883616.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> </div> </body> </html> diff --git a/libs/algorithm/doc/html/boost/algorithm/none_of_equal_idp37744736.html b/libs/algorithm/doc/html/boost/algorithm/none_of_equal_idp37744736.html new file mode 100644 index 0000000000..ce61a000a0 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/none_of_equal_idp37744736.html @@ -0,0 +1,101 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template none_of_equal</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/none_of_hpp.html" title="Header <boost/algorithm/cxx11/none_of.hpp>"> +<link rel="prev" href="none_of_idp37738768.html" title="Function template none_of"> +<link rel="next" href="none_of_equal_idp37751824.html" title="Function template none_of_equal"> +</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_idp37738768.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/none_of_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="none_of_equal_idp37751824.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.none_of_equal_idp37744736"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template none_of_equal</span></h2> +<p>boost::algorithm::none_of_equal</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/cxx11/none_of_hpp.html" title="Header <boost/algorithm/cxx11/none_of.hpp>">boost/algorithm/cxx11/none_of.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> V<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> first<span class="special">,</span> <span class="identifier">InputIterator</span> last<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">V</span> <span class="special">&</span> val<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp87008976"></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>returns true on an empty range</p></td></tr> +</table></div> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<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">val</code></span></p></td> +<td><p>A value to compare against </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>true if none of the elements in [first, last) are equal to 'val' </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="none_of_idp37738768.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/none_of_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="none_of_equal_idp37751824.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/none_of_equal_idp37751824.html b/libs/algorithm/doc/html/boost/algorithm/none_of_equal_idp37751824.html new file mode 100644 index 0000000000..a0c4aee4da --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/none_of_equal_idp37751824.html @@ -0,0 +1,97 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template none_of_equal</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/none_of_hpp.html" title="Header <boost/algorithm/cxx11/none_of.hpp>"> +<link rel="prev" href="none_of_equal_idp37744736.html" title="Function template none_of_equal"> +<link rel="next" href="../../header/boost/algorithm/cxx11/one_of_hpp.html" title="Header <boost/algorithm/cxx11/one_of.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="none_of_equal_idp37744736.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/none_of_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/cxx11/one_of_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.none_of_equal_idp37751824"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template none_of_equal</span></h2> +<p>boost::algorithm::none_of_equal</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/cxx11/none_of_hpp.html" title="Header <boost/algorithm/cxx11/none_of.hpp>">boost/algorithm/cxx11/none_of.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> V<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> r<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">V</span> <span class="special">&</span> val<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp87032160"></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>returns true on an empty range</p></td></tr> +</table></div> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">r</code></span></p></td> +<td><p>The input range </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">val</code></span></p></td> +<td><p>A value to compare against </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>true if none of the elements in the range are equal to 'val' </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="none_of_equal_idp37744736.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/none_of_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/cxx11/one_of_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/none_of_idp37731648.html b/libs/algorithm/doc/html/boost/algorithm/none_of_idp37731648.html new file mode 100644 index 0000000000..cc9bb6ccde --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/none_of_idp37731648.html @@ -0,0 +1,101 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template none_of</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/none_of_hpp.html" title="Header <boost/algorithm/cxx11/none_of.hpp>"> +<link rel="prev" href="../../header/boost/algorithm/cxx11/none_of_hpp.html" title="Header <boost/algorithm/cxx11/none_of.hpp>"> +<link rel="next" href="none_of_idp37738768.html" title="Function template 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="../../header/boost/algorithm/cxx11/none_of_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/none_of_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="none_of_idp37738768.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.none_of_idp37731648"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template none_of</span></h2> +<p>boost::algorithm::none_of</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/cxx11/none_of_hpp.html" title="Header <boost/algorithm/cxx11/none_of.hpp>">boost/algorithm/cxx11/none_of.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> Predicate<span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">none_of</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">Predicate</span> p<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp86965200"></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>returns true on an empty range</p></td></tr> +</table></div> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<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">p</code></span></p></td> +<td><p>A predicate for testing the elements of the sequence </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>true if none of the elements in [first, last) satisfy the 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="../../header/boost/algorithm/cxx11/none_of_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/none_of_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="none_of_idp37738768.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/none_of_idp37738768.html b/libs/algorithm/doc/html/boost/algorithm/none_of_idp37738768.html new file mode 100644 index 0000000000..ed746dc16a --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/none_of_idp37738768.html @@ -0,0 +1,97 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template none_of</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/none_of_hpp.html" title="Header <boost/algorithm/cxx11/none_of.hpp>"> +<link rel="prev" href="none_of_idp37731648.html" title="Function template none_of"> +<link rel="next" href="none_of_equal_idp37744736.html" title="Function template none_of_equal"> +</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_idp37731648.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/none_of_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="none_of_equal_idp37744736.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.none_of_idp37738768"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template none_of</span></h2> +<p>boost::algorithm::none_of</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/cxx11/none_of_hpp.html" title="Header <boost/algorithm/cxx11/none_of.hpp>">boost/algorithm/cxx11/none_of.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> Predicate<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> r<span class="special">,</span> <span class="identifier">Predicate</span> p<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp86986880"></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>returns true on an empty range</p></td></tr> +</table></div> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">p</code></span></p></td> +<td><p>A predicate for testing the elements of the range </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>true if none of the elements in the range satisfy the 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="none_of_idp37731648.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/none_of_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="none_of_equal_idp37744736.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 index 7a3fc56df0..72d61b9f02 100644 --- a/libs/algorithm/doc/html/boost/algorithm/not_enough_input.html +++ b/libs/algorithm/doc/html/boost/algorithm/not_enough_input.html @@ -3,7 +3,7 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> diff --git a/libs/algorithm/doc/html/boost/algorithm/one_of_equal_idp37772832.html b/libs/algorithm/doc/html/boost/algorithm/one_of_equal_idp37772832.html new file mode 100644 index 0000000000..bf37ab2947 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/one_of_equal_idp37772832.html @@ -0,0 +1,92 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template one_of_equal</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/one_of_hpp.html" title="Header <boost/algorithm/cxx11/one_of.hpp>"> +<link rel="prev" href="one_of_idp37767456.html" title="Function template one_of"> +<link rel="next" href="one_of_equal_idp37779328.html" title="Function template one_of_equal"> +</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_idp37767456.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/one_of_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="one_of_equal_idp37779328.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.one_of_equal_idp37772832"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template one_of_equal</span></h2> +<p>boost::algorithm::one_of_equal</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/cxx11/one_of_hpp.html" title="Header <boost/algorithm/cxx11/one_of.hpp>">boost/algorithm/cxx11/one_of.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> V<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> first<span class="special">,</span> <span class="identifier">InputIterator</span> last<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">V</span> <span class="special">&</span> val<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp87149216"></a><h2>Description</h2> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<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">val</code></span></p></td> +<td><p>A value to compare against </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>true if the value 'val' exists only once in [first, last).</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="one_of_idp37767456.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/one_of_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="one_of_equal_idp37779328.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/one_of_equal_idp37779328.html b/libs/algorithm/doc/html/boost/algorithm/one_of_equal_idp37779328.html new file mode 100644 index 0000000000..c6ee291ecb --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/one_of_equal_idp37779328.html @@ -0,0 +1,88 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template one_of_equal</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/one_of_hpp.html" title="Header <boost/algorithm/cxx11/one_of.hpp>"> +<link rel="prev" href="one_of_equal_idp37772832.html" title="Function template one_of_equal"> +<link rel="next" href="../../header/boost/algorithm/cxx11/partition_copy_hpp.html" title="Header <boost/algorithm/cxx11/partition_copy.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="one_of_equal_idp37772832.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/one_of_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/cxx11/partition_copy_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.one_of_equal_idp37779328"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template one_of_equal</span></h2> +<p>boost::algorithm::one_of_equal</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/cxx11/one_of_hpp.html" title="Header <boost/algorithm/cxx11/one_of.hpp>">boost/algorithm/cxx11/one_of.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> V<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> r<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">V</span> <span class="special">&</span> val<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp87171744"></a><h2>Description</h2> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">r</code></span></p></td> +<td><p>The input range </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">val</code></span></p></td> +<td><p>A value to compare against </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>true if the value 'val' exists only once in the range.</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="one_of_equal_idp37772832.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/one_of_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/cxx11/partition_copy_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/one_of_idp37760928.html b/libs/algorithm/doc/html/boost/algorithm/one_of_idp37760928.html new file mode 100644 index 0000000000..1054d3c1a7 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/one_of_idp37760928.html @@ -0,0 +1,92 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template one_of</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/one_of_hpp.html" title="Header <boost/algorithm/cxx11/one_of.hpp>"> +<link rel="prev" href="../../header/boost/algorithm/cxx11/one_of_hpp.html" title="Header <boost/algorithm/cxx11/one_of.hpp>"> +<link rel="next" href="one_of_idp37767456.html" title="Function template 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="../../header/boost/algorithm/cxx11/one_of_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/one_of_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="one_of_idp37767456.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.one_of_idp37760928"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template one_of</span></h2> +<p>boost::algorithm::one_of</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/cxx11/one_of_hpp.html" title="Header <boost/algorithm/cxx11/one_of.hpp>">boost/algorithm/cxx11/one_of.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> Predicate<span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">one_of</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">Predicate</span> p<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp87106560"></a><h2>Description</h2> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<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">p</code></span></p></td> +<td><p>A predicate for testing the elements of the sequence </p></td> +</tr> +</tbody> +</table></div></td> +</tr> +<tr> +<td><p><span class="term">Returns:</span></p></td> +<td><p>true if the predicate 'p' is true for exactly one item in [first, last).</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="../../header/boost/algorithm/cxx11/one_of_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/one_of_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="one_of_idp37767456.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/one_of_idp37767456.html b/libs/algorithm/doc/html/boost/algorithm/one_of_idp37767456.html new file mode 100644 index 0000000000..b7f4bc83b1 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/one_of_idp37767456.html @@ -0,0 +1,88 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template one_of</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/one_of_hpp.html" title="Header <boost/algorithm/cxx11/one_of.hpp>"> +<link rel="prev" href="one_of_idp37760928.html" title="Function template one_of"> +<link rel="next" href="one_of_equal_idp37772832.html" title="Function template one_of_equal"> +</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_idp37760928.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/one_of_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="one_of_equal_idp37772832.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.one_of_idp37767456"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template one_of</span></h2> +<p>boost::algorithm::one_of</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/cxx11/one_of_hpp.html" title="Header <boost/algorithm/cxx11/one_of.hpp>">boost/algorithm/cxx11/one_of.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> Predicate<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> r<span class="special">,</span> <span class="identifier">Predicate</span> p<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp87127808"></a><h2>Description</h2> +<p> + +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">p</code></span></p></td> +<td><p>A predicate for testing the elements of the range </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>true if the predicate 'p' is true for exactly one item in the range.</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="one_of_idp37760928.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/one_of_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="one_of_equal_idp37772832.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/partition_copy_idp37787824.html b/libs/algorithm/doc/html/boost/algorithm/partition_copy_idp37787824.html new file mode 100644 index 0000000000..90a4bd11f8 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/partition_copy_idp37787824.html @@ -0,0 +1,106 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template partition_copy</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/partition_copy_hpp.html" title="Header <boost/algorithm/cxx11/partition_copy.hpp>"> +<link rel="prev" href="../../header/boost/algorithm/cxx11/partition_copy_hpp.html" title="Header <boost/algorithm/cxx11/partition_copy.hpp>"> +<link rel="next" href="partition_copy_idp37798560.html" title="Function template partition_copy"> +</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/cxx11/partition_copy_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/partition_copy_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="partition_copy_idp37798560.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.partition_copy_idp37787824"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template partition_copy</span></h2> +<p>boost::algorithm::partition_copy — Copies the elements that satisfy the predicate p from the range [first, last) to the range beginning at d_first_true, and copies the elements that do not satisfy p to the range beginning at d_first_false. </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/cxx11/partition_copy_hpp.html" title="Header <boost/algorithm/cxx11/partition_copy.hpp>">boost/algorithm/cxx11/partition_copy.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> OutputIterator1<span class="special">,</span> + <span class="keyword">typename</span> OutputIterator2<span class="special">,</span> <span class="keyword">typename</span> UnaryPredicate<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">OutputIterator1</span><span class="special">,</span> <span class="identifier">OutputIterator2</span> <span class="special">></span> + <span class="identifier">partition_copy</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">OutputIterator1</span> out_true<span class="special">,</span> <span class="identifier">OutputIterator2</span> out_false<span class="special">,</span> + <span class="identifier">UnaryPredicate</span> p<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp87250656"></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>This function is part of the C++2011 standard library. We will use the standard one if it is available, otherwise we have our own implementation. </p></td></tr> +</table></div> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody><tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<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_false</code></span></p></td> +<td><p>An output iterator to write the elements that do not satisfy the predicate into </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">out_true</code></span></p></td> +<td><p>An output iterator to write the elements that satisfy the predicate into </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">p</code></span></p></td> +<td><p>A predicate for dividing the elements of the input sequence.</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="../../header/boost/algorithm/cxx11/partition_copy_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/partition_copy_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="partition_copy_idp37798560.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/partition_copy_idp37798560.html b/libs/algorithm/doc/html/boost/algorithm/partition_copy_idp37798560.html new file mode 100644 index 0000000000..3ef529f3a8 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/partition_copy_idp37798560.html @@ -0,0 +1,92 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template partition_copy</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/partition_copy_hpp.html" title="Header <boost/algorithm/cxx11/partition_copy.hpp>"> +<link rel="prev" href="partition_copy_idp37787824.html" title="Function template partition_copy"> +<link rel="next" href="../../header/boost/algorithm/cxx11/partition_point_hpp.html" title="Header <boost/algorithm/cxx11/partition_point.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="partition_copy_idp37787824.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/partition_copy_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/cxx11/partition_point_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.partition_copy_idp37798560"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template partition_copy</span></h2> +<p>boost::algorithm::partition_copy</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/cxx11/partition_copy_hpp.html" title="Header <boost/algorithm/cxx11/partition_copy.hpp>">boost/algorithm/cxx11/partition_copy.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> OutputIterator1<span class="special">,</span> <span class="keyword">typename</span> OutputIterator2<span class="special">,</span> + <span class="keyword">typename</span> UnaryPredicate<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">OutputIterator1</span><span class="special">,</span> <span class="identifier">OutputIterator2</span> <span class="special">></span> + <span class="identifier">partition_copy</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">OutputIterator1</span> out_true<span class="special">,</span> + <span class="identifier">OutputIterator2</span> out_false<span class="special">,</span> <span class="identifier">UnaryPredicate</span> p<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp87284176"></a><h2>Description</h2> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody><tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">out_false</code></span></p></td> +<td><p>An output iterator to write the elements that do not satisfy the predicate into </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">out_true</code></span></p></td> +<td><p>An output iterator to write the elements that satisfy the predicate into </p></td> +</tr> +<tr> +<td><p><span class="term"><code class="computeroutput">p</code></span></p></td> +<td><p>A predicate for dividing the elements of the input sequence. </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></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="partition_copy_idp37787824.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/partition_copy_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/cxx11/partition_point_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/partition_poin_idp37810128.html b/libs/algorithm/doc/html/boost/algorithm/partition_poin_idp37810128.html new file mode 100644 index 0000000000..dd7c8b5257 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/partition_poin_idp37810128.html @@ -0,0 +1,95 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template partition_point</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/partition_point_hpp.html" title="Header <boost/algorithm/cxx11/partition_point.hpp>"> +<link rel="prev" href="../../header/boost/algorithm/cxx11/partition_point_hpp.html" title="Header <boost/algorithm/cxx11/partition_point.hpp>"> +<link rel="next" href="partition_poin_idp37817248.html" title="Function template 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="../../header/boost/algorithm/cxx11/partition_point_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/partition_point_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="partition_poin_idp37817248.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.partition_poin_idp37810128"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template partition_point</span></h2> +<p>boost::algorithm::partition_point — Given a partitioned range, returns the partition point, i.e, the first element that does not satisfy p. </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/cxx11/partition_point_hpp.html" title="Header <boost/algorithm/cxx11/partition_point.hpp>">boost/algorithm/cxx11/partition_point.hpp</a>> + +</span> +<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIterator<span class="special">,</span> <span class="keyword">typename</span> Predicate<span class="special">></span> + <span class="identifier">ForwardIterator</span> + <span class="identifier">partition_point</span><span class="special">(</span><span class="identifier">ForwardIterator</span> first<span class="special">,</span> <span class="identifier">ForwardIterator</span> last<span class="special">,</span> <span class="identifier">Predicate</span> p<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp87338656"></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>This function is part of the C++2011 standard library. We will use the standard one if it is available, otherwise we have our own implementation. </p></td></tr> +</table></div> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody><tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<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">p</code></span></p></td> +<td><p>The predicate to test the values with </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="../../header/boost/algorithm/cxx11/partition_point_hpp.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/partition_point_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="partition_poin_idp37817248.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/boost/algorithm/partition_poin_idp37817248.html b/libs/algorithm/doc/html/boost/algorithm/partition_poin_idp37817248.html new file mode 100644 index 0000000000..fc33011764 --- /dev/null +++ b/libs/algorithm/doc/html/boost/algorithm/partition_poin_idp37817248.html @@ -0,0 +1,81 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Function template partition_point</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../header/boost/algorithm/cxx11/partition_point_hpp.html" title="Header <boost/algorithm/cxx11/partition_point.hpp>"> +<link rel="prev" href="partition_poin_idp37810128.html" title="Function template partition_point"> +<link rel="next" href="../../header/boost/algorithm/cxx14/equal_hpp.html" title="Header <boost/algorithm/cxx14/equal.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="partition_poin_idp37810128.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/partition_point_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/cxx14/equal_hpp.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +<div class="refentry"> +<a name="boost.algorithm.partition_poin_idp37817248"></a><div class="titlepage"></div> +<div class="refnamediv"> +<h2><span class="refentrytitle">Function template partition_point</span></h2> +<p>boost::algorithm::partition_point — Given a partitioned range, returns the partition point. </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/cxx11/partition_point_hpp.html" title="Header <boost/algorithm/cxx11/partition_point.hpp>">boost/algorithm/cxx11/partition_point.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> Predicate<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="identifier">Range</span> <span class="special">&</span> r<span class="special">,</span> <span class="identifier">Predicate</span> p<span class="special">)</span><span class="special">;</span></pre></div> +<div class="refsect1"> +<a name="idp87362224"></a><h2>Description</h2> +<p> +</p> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody><tr> +<td><p><span class="term">Parameters:</span></p></td> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> +<col align="left" valign="top"> +<col> +</colgroup> +<tbody> +<tr> +<td><p><span class="term"><code class="computeroutput">p</code></span></p></td> +<td><p>The predicate to test the values with </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></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="partition_poin_idp37810128.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../header/boost/algorithm/cxx11/partition_point_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/cxx14/equal_hpp.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_idp37903952.html index 0e63ffe92d..b2bcb9c73a 100644 --- a/libs/algorithm/doc/html/boost/algorithm/unhex_id337909.html +++ b/libs/algorithm/doc/html/boost/algorithm/unhex_idp37903952.html @@ -3,11 +3,11 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> +<link rel="prev" href="hex_idp37897536.html" title="Function template hex"> +<link rel="next" href="unhex_idp37911376.html" title="Function template unhex"> </head> <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> <table cellpadding="2" width="100%"><tr> @@ -20,10 +20,10 @@ </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> +<a accesskey="p" href="hex_idp37897536.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_idp37911376.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> +<a name="boost.algorithm.unhex_idp37903952"></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> @@ -36,7 +36,7 @@ <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> +<a name="idp87848192"></a><h2>Description</h2> <p> </p> @@ -49,13 +49,19 @@ </table></div> <p> </p> -<div class="variablelist"><table border="0"> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody> <tr> <td><p><span class="term">Parameters:</span></p></td> -<td><div class="variablelist"><table border="0"> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody> <tr> <td><p><span class="term"><code class="computeroutput">first</code></span></p></td> @@ -90,7 +96,7 @@ </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> +<a accesskey="p" href="hex_idp37897536.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_idp37911376.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_idp37911376.html index 42729eda3d..eae01eda8f 100644 --- a/libs/algorithm/doc/html/boost/algorithm/unhex_id337971.html +++ b/libs/algorithm/doc/html/boost/algorithm/unhex_idp37911376.html @@ -3,11 +3,11 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> +<link rel="prev" href="unhex_idp37903952.html" title="Function template unhex"> +<link rel="next" href="unhex_idp37917696.html" title="Function template unhex"> </head> <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> <table cellpadding="2" width="100%"><tr> @@ -20,10 +20,10 @@ </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> +<a accesskey="p" href="unhex_idp37903952.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_idp37917696.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> +<a name="boost.algorithm.unhex_idp37911376"></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> @@ -35,7 +35,7 @@ <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> +<a name="idp87870032"></a><h2>Description</h2> <p> </p> @@ -48,13 +48,19 @@ </table></div> <p> </p> -<div class="variablelist"><table border="0"> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody> <tr> <td><p><span class="term">Parameters:</span></p></td> -<td><div class="variablelist"><table border="0"> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody> <tr> <td><p><span class="term"><code class="computeroutput">out</code></span></p></td> @@ -85,7 +91,7 @@ </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> +<a accesskey="p" href="unhex_idp37903952.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_idp37917696.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_idp37917696.html index d93ebba23e..a19bde451b 100644 --- a/libs/algorithm/doc/html/boost/algorithm/unhex_id338023.html +++ b/libs/algorithm/doc/html/boost/algorithm/unhex_idp37917696.html @@ -3,11 +3,11 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> +<link rel="prev" href="unhex_idp37911376.html" title="Function template unhex"> +<link rel="next" href="hex_idp37923984.html" title="Function template hex"> </head> <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> <table cellpadding="2" width="100%"><tr> @@ -20,10 +20,10 @@ </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> +<a accesskey="p" href="unhex_idp37911376.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_idp37923984.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> +<a name="boost.algorithm.unhex_idp37917696"></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> @@ -35,7 +35,7 @@ <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> +<a name="idp87890672"></a><h2>Description</h2> <p> </p> @@ -48,13 +48,19 @@ </table></div> <p> </p> -<div class="variablelist"><table border="0"> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody> <tr> <td><p><span class="term">Parameters:</span></p></td> -<td><div class="variablelist"><table border="0"> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody> <tr> <td><p><span class="term"><code class="computeroutput">out</code></span></p></td> @@ -85,7 +91,7 @@ </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> +<a accesskey="p" href="unhex_idp37911376.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_idp37923984.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_idp37928000.html index 741c537ce8..b996c4c972 100644 --- a/libs/algorithm/doc/html/boost/algorithm/unhex_id338108.html +++ b/libs/algorithm/doc/html/boost/algorithm/unhex_idp37928000.html @@ -3,10 +3,10 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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="prev" href="hex_idp37923984.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"> @@ -20,10 +20,10 @@ </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> +<a accesskey="p" href="hex_idp37923984.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> +<a name="boost.algorithm.unhex_idp37928000"></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> @@ -34,17 +34,23 @@ </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> +<a name="idp87924768"></a><h2>Description</h2> <p> </p> -<div class="variablelist"><table border="0"> +<div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody> <tr> <td><p><span class="term">Parameters:</span></p></td> -<td><div class="variablelist"><table border="0"> +<td><div class="variablelist"><table border="0" class="variablelist compact"> +<colgroup> <col align="left" valign="top"> +<col> +</colgroup> <tbody><tr> <td><p><span class="term"><code class="computeroutput">input</code></span></p></td> <td><p>A container to be converted </p></td> @@ -69,7 +75,7 @@ </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> +<a accesskey="p" href="hex_idp37923984.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/cxx11/all_of_hpp.html b/libs/algorithm/doc/html/header/boost/algorithm/cxx11/all_of_hpp.html new file mode 100644 index 0000000000..250d3ec1ad --- /dev/null +++ b/libs/algorithm/doc/html/header/boost/algorithm/cxx11/all_of_hpp.html @@ -0,0 +1,58 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Header <boost/algorithm/cxx11/all_of.hpp></title> +<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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_idp29133760.html" title="Function template clamp_range"> +<link rel="next" href="../../../../boost/algorithm/all_of_idp37421200.html" title="Function template all_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="../../../../boost/algorithm/clamp_range_idp29133760.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/all_of_idp37421200.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.cxx11.all_of_hpp"></a>Header <<a href="../../../../../../../../boost/algorithm/cxx11/all_of.hpp" target="_top">boost/algorithm/cxx11/all_of.hpp</a>></h3></div></div></div> +<p>Test ranges to see if all elements match a value or predicate. </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">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">,</span> <span class="keyword">typename</span> Predicate<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/all_of_idp37421200.html" title="Function template all_of"><span class="identifier">all_of</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">Predicate</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> Predicate<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/all_of_idp37429008.html" title="Function template all_of"><span class="identifier">all_of</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">Predicate</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> T<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/all_of_equal_idp37434976.html" title="Function template all_of_equal"><span class="identifier">all_of_equal</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="keyword">const</span> <span class="identifier">T</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> Range<span class="special">,</span> <span class="keyword">typename</span> T<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/all_of_equal_idp37442064.html" title="Function template all_of_equal"><span class="identifier">all_of_equal</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="keyword">const</span> <span class="identifier">T</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_idp29133760.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/all_of_idp37421200.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/header/boost/algorithm/cxx11/any_of_hpp.html b/libs/algorithm/doc/html/header/boost/algorithm/cxx11/any_of_hpp.html new file mode 100644 index 0000000000..3960021aef --- /dev/null +++ b/libs/algorithm/doc/html/header/boost/algorithm/cxx11/any_of_hpp.html @@ -0,0 +1,58 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Header <boost/algorithm/cxx11/any_of.hpp></title> +<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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/all_of_equal_idp37442064.html" title="Function template all_of_equal"> +<link rel="next" href="../../../../boost/algorithm/any_of_idp37451168.html" title="Function template 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="../../../../boost/algorithm/all_of_equal_idp37442064.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/any_of_idp37451168.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.cxx11.any_of_hpp"></a>Header <<a href="../../../../../../../../boost/algorithm/cxx11/any_of.hpp" target="_top">boost/algorithm/cxx11/any_of.hpp</a>></h3></div></div></div> +<p>Test ranges to see if any elements match a value or predicate. </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">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">,</span> <span class="keyword">typename</span> Predicate<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/any_of_idp37451168.html" title="Function template any_of"><span class="identifier">any_of</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">Predicate</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> Predicate<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/any_of_idp37458272.html" title="Function template any_of"><span class="identifier">any_of</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">Predicate</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> V<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/any_of_equal_idp37464240.html" title="Function template any_of_equal"><span class="identifier">any_of_equal</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="keyword">const</span> <span class="identifier">V</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> Range<span class="special">,</span> <span class="keyword">typename</span> V<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/any_of_equal_idp37471328.html" title="Function template any_of_equal"><span class="identifier">any_of_equal</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="keyword">const</span> <span class="identifier">V</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/all_of_equal_idp37442064.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/any_of_idp37451168.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/header/boost/algorithm/cxx11/copy_if_hpp.html b/libs/algorithm/doc/html/header/boost/algorithm/cxx11/copy_if_hpp.html new file mode 100644 index 0000000000..c3c048e54e --- /dev/null +++ b/libs/algorithm/doc/html/header/boost/algorithm/cxx11/copy_if_hpp.html @@ -0,0 +1,70 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Header <boost/algorithm/cxx11/copy_if.hpp></title> +<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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/any_of_equal_idp37471328.html" title="Function template any_of_equal"> +<link rel="next" href="../../../../boost/algorithm/copy_if_idp37480416.html" title="Function template copy_if"> +</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/any_of_equal_idp37471328.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/copy_if_idp37480416.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.cxx11.copy_if_hpp"></a>Header <<a href="../../../../../../../../boost/algorithm/cxx11/copy_if.hpp" target="_top">boost/algorithm/cxx11/copy_if.hpp</a>></h3></div></div></div> +<p>Copy a subset of a sequence to a new sequence. </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">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> Predicate<span class="special">></span> + <span class="identifier">OutputIterator</span> + <a class="link" href="../../../../boost/algorithm/copy_if_idp37480416.html" title="Function template copy_if"><span class="identifier">copy_if</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="identifier">Predicate</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> Predicate<span class="special">></span> + <span class="identifier">OutputIterator</span> <a class="link" href="../../../../boost/algorithm/copy_if_idp37489664.html" title="Function template copy_if"><span class="identifier">copy_if</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="identifier">Predicate</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> Predicate<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">InputIterator</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="special">></span> + <a class="link" href="../../../../boost/algorithm/copy_while_idp37497072.html" title="Function template copy_while"><span class="identifier">copy_while</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="identifier">Predicate</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> Predicate<span class="special">></span> + <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</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="identifier">OutputIterator</span> <span class="special">></span> + <a class="link" href="../../../../boost/algorithm/copy_while_idp37505664.html" title="Function template copy_while"><span class="identifier">copy_while</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="identifier">Predicate</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> Predicate<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">InputIterator</span><span class="special">,</span> <span class="identifier">OutputIterator</span> <span class="special">></span> + <a class="link" href="../../../../boost/algorithm/copy_until_idp37513056.html" title="Function template copy_until"><span class="identifier">copy_until</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="identifier">Predicate</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> Predicate<span class="special">></span> + <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</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="identifier">OutputIterator</span> <span class="special">></span> + <a class="link" href="../../../../boost/algorithm/copy_until_idp37521648.html" title="Function template copy_until"><span class="identifier">copy_until</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="identifier">Predicate</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/any_of_equal_idp37471328.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/copy_if_idp37480416.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/header/boost/algorithm/cxx11/copy_n_hpp.html b/libs/algorithm/doc/html/header/boost/algorithm/cxx11/copy_n_hpp.html new file mode 100644 index 0000000000..ab37f8a52e --- /dev/null +++ b/libs/algorithm/doc/html/header/boost/algorithm/cxx11/copy_n_hpp.html @@ -0,0 +1,52 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Header <boost/algorithm/cxx11/copy_n.hpp></title> +<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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/copy_until_idp37521648.html" title="Function template copy_until"> +<link rel="next" href="../../../../boost/algorithm/copy_n.html" title="Function template copy_n"> +</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/copy_until_idp37521648.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/copy_n.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.cxx11.copy_n_hpp"></a>Header <<a href="../../../../../../../../boost/algorithm/cxx11/copy_n.hpp" target="_top">boost/algorithm/cxx11/copy_n.hpp</a>></h3></div></div></div> +<p>Copy n items from one sequence to another. </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">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">,</span> <span class="keyword">typename</span> Size<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/copy_n.html" title="Function template copy_n"><span class="identifier">copy_n</span></a><span class="special">(</span><span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">Size</span><span class="special">,</span> <span class="identifier">OutputIterator</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/copy_until_idp37521648.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/copy_n.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/header/boost/algorithm/cxx11/find_if_not_hpp.html b/libs/algorithm/doc/html/header/boost/algorithm/cxx11/find_if_not_hpp.html new file mode 100644 index 0000000000..615d08641b --- /dev/null +++ b/libs/algorithm/doc/html/header/boost/algorithm/cxx11/find_if_not_hpp.html @@ -0,0 +1,55 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Header <boost/algorithm/cxx11/find_if_not.hpp></title> +<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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/copy_n.html" title="Function template copy_n"> +<link rel="next" href="../../../../boost/algorithm/find_if_not_idp37543536.html" title="Function template find_if_not"> +</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/copy_n.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/find_if_not_idp37543536.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.cxx11.find_if_not_hpp"></a>Header <<a href="../../../../../../../../boost/algorithm/cxx11/find_if_not.hpp" target="_top">boost/algorithm/cxx11/find_if_not.hpp</a>></h3></div></div></div> +<p>Find the first element in a sequence that does not satisfy a predicate. </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">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">,</span> <span class="keyword">typename</span> Predicate<span class="special">></span> + <span class="identifier">InputIterator</span> <a class="link" href="../../../../boost/algorithm/find_if_not_idp37543536.html" title="Function template find_if_not"><span class="identifier">find_if_not</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">Predicate</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> Predicate<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="keyword">const</span> <span class="identifier">Range</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> + <a class="link" href="../../../../boost/algorithm/find_if_not_idp37551088.html" title="Function template find_if_not"><span class="identifier">find_if_not</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">Predicate</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/copy_n.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/find_if_not_idp37543536.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/header/boost/algorithm/cxx11/iota_hpp.html b/libs/algorithm/doc/html/header/boost/algorithm/cxx11/iota_hpp.html new file mode 100644 index 0000000000..b122f88fa0 --- /dev/null +++ b/libs/algorithm/doc/html/header/boost/algorithm/cxx11/iota_hpp.html @@ -0,0 +1,55 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Header <boost/algorithm/cxx11/iota.hpp></title> +<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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/find_if_not_idp37551088.html" title="Function template find_if_not"> +<link rel="next" href="../../../../boost/algorithm/iota_idp37559984.html" title="Function template iota"> +</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/find_if_not_idp37551088.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/iota_idp37559984.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.cxx11.iota_hpp"></a>Header <<a href="../../../../../../../../boost/algorithm/cxx11/iota.hpp" target="_top">boost/algorithm/cxx11/iota.hpp</a>></h3></div></div></div> +<p>Generate an increasing series. </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">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIterator<span class="special">,</span> <span class="keyword">typename</span> T<span class="special">></span> + <span class="keyword">void</span> <a class="link" href="../../../../boost/algorithm/iota_idp37559984.html" title="Function template iota"><span class="identifier">iota</span></a><span class="special">(</span><span class="identifier">ForwardIterator</span><span class="special">,</span> <span class="identifier">ForwardIterator</span><span class="special">,</span> <span class="identifier">T</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> T<span class="special">></span> <span class="keyword">void</span> <a class="link" href="../../../../boost/algorithm/iota_idp37567088.html" title="Function template iota"><span class="identifier">iota</span></a><span class="special">(</span><span class="identifier">Range</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">T</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> OutputIterator<span class="special">,</span> <span class="keyword">typename</span> T<span class="special">></span> + <span class="identifier">OutputIterator</span> <a class="link" href="../../../../boost/algorithm/iota_n.html" title="Function template iota_n"><span class="identifier">iota_n</span></a><span class="special">(</span><span class="identifier">OutputIterator</span><span class="special">,</span> <span class="identifier">T</span><span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">size_t</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/find_if_not_idp37551088.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/iota_idp37559984.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/header/boost/algorithm/cxx11/is_partitioned_hpp.html b/libs/algorithm/doc/html/header/boost/algorithm/cxx11/is_partitioned_hpp.html new file mode 100644 index 0000000000..689999feb2 --- /dev/null +++ b/libs/algorithm/doc/html/header/boost/algorithm/cxx11/is_partitioned_hpp.html @@ -0,0 +1,54 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Header <boost/algorithm/cxx11/is_partitioned.hpp></title> +<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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/iota_n.html" title="Function template iota_n"> +<link rel="next" href="../../../../boost/algorithm/is_partitioned_idp37581904.html" title="Function template 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="../../../../boost/algorithm/iota_n.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/is_partitioned_idp37581904.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.cxx11.is_partitioned_hpp"></a>Header <<a href="../../../../../../../../boost/algorithm/cxx11/is_partitioned.hpp" target="_top">boost/algorithm/cxx11/is_partitioned.hpp</a>></h3></div></div></div> +<p>Tell if a sequence is partitioned. </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">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">,</span> <span class="keyword">typename</span> UnaryPredicate<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/is_partitioned_idp37581904.html" title="Function template is_partitioned"><span class="identifier">is_partitioned</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">UnaryPredicate</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> UnaryPredicate<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/is_partitioned_idp37588976.html" title="Function template is_partitioned"><span class="identifier">is_partitioned</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">UnaryPredicate</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/iota_n.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/is_partitioned_idp37581904.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/header/boost/algorithm/cxx11/is_permutation_hpp.html b/libs/algorithm/doc/html/header/boost/algorithm/cxx11/is_permutation_hpp.html new file mode 100644 index 0000000000..16ea1712f0 --- /dev/null +++ b/libs/algorithm/doc/html/header/boost/algorithm/cxx11/is_permutation_hpp.html @@ -0,0 +1,59 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Header <boost/algorithm/cxx11/is_permutation.hpp></title> +<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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/is_partitioned_idp37588976.html" title="Function template is_partitioned"> +<link rel="next" href="../../../../boost/algorithm/is_permutation_idp37596448.html" title="Function template is_permutation"> +</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/is_partitioned_idp37588976.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/is_permutation_idp37596448.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.cxx11.is_permutation_hpp"></a>Header <<a href="../../../../../../../../boost/algorithm/cxx11/is_permutation.hpp" target="_top">boost/algorithm/cxx11/is_permutation.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> ForwardIterator1<span class="special">,</span> <span class="keyword">typename</span> ForwardIterator2<span class="special">,</span> + <span class="keyword">typename</span> BinaryPredicate<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/is_permutation_idp37596448.html" title="Function template is_permutation"><span class="identifier">is_permutation</span></a><span class="special">(</span><span class="identifier">ForwardIterator1</span><span class="special">,</span> <span class="identifier">ForwardIterator1</span><span class="special">,</span> + <span class="identifier">ForwardIterator2</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIterator1<span class="special">,</span> <span class="keyword">typename</span> ForwardIterator2<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/is_permutation_idp37605232.html" title="Function template is_permutation"><span class="identifier">is_permutation</span></a><span class="special">(</span><span class="identifier">ForwardIterator1</span><span class="special">,</span> <span class="identifier">ForwardIterator1</span><span class="special">,</span> + <span class="identifier">ForwardIterator2</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> ForwardIterator<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/is_permutation_idp37611904.html" title="Function template is_permutation"><span class="identifier">is_permutation</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">ForwardIterator</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> ForwardIterator<span class="special">,</span> + <span class="keyword">typename</span> BinaryPredicate<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">ForwardIterator</span> <span class="special">></span><span class="special">::</span><span class="identifier">value</span><span class="special">,</span> <span class="keyword">bool</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> + <a class="link" href="../../../../boost/algorithm/is_permutation_idp37617168.html" title="Function template is_permutation"><span class="identifier">is_permutation</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">ForwardIterator</span><span class="special">,</span> <span class="identifier">BinaryPredicate</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/is_partitioned_idp37588976.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/is_permutation_idp37596448.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/header/boost/algorithm/cxx11/is_sorted_hpp.html b/libs/algorithm/doc/html/header/boost/algorithm/cxx11/is_sorted_hpp.html new file mode 100644 index 0000000000..22c7aae505 --- /dev/null +++ b/libs/algorithm/doc/html/header/boost/algorithm/cxx11/is_sorted_hpp.html @@ -0,0 +1,75 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Header <boost/algorithm/cxx11/is_sorted.hpp></title> +<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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/is_permutation_idp37634720.html" title="Function template is_permutation"> +<link rel="next" href="../../../../boost/algorithm/is_sorted_unti_idp37646864.html" title="Function template is_sorted_until"> +</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/is_permutation_idp37634720.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/is_sorted_unti_idp37646864.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.cxx11.is_sorted_hpp"></a>Header <<a href="../../../../../../../../boost/algorithm/cxx11/is_sorted.hpp" target="_top">boost/algorithm/cxx11/is_sorted.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> ForwardIterator<span class="special">,</span> <span class="keyword">typename</span> Pred<span class="special">></span> + <span class="identifier">ForwardIterator</span> <a class="link" href="../../../../boost/algorithm/is_sorted_unti_idp37646864.html" title="Function template is_sorted_until"><span class="identifier">is_sorted_until</span></a><span class="special">(</span><span class="identifier">ForwardIterator</span><span class="special">,</span> <span class="identifier">ForwardIterator</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> ForwardIterator<span class="special">></span> + <span class="identifier">ForwardIterator</span> <a class="link" href="../../../../boost/algorithm/is_sorted_unti_idp37653456.html" title="Function template is_sorted_until"><span class="identifier">is_sorted_until</span></a><span class="special">(</span><span class="identifier">ForwardIterator</span><span class="special">,</span> <span class="identifier">ForwardIterator</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIterator<span class="special">,</span> <span class="keyword">typename</span> Pred<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/is_sorted_idp37658304.html" title="Function template is_sorted"><span class="identifier">is_sorted</span></a><span class="special">(</span><span class="identifier">ForwardIterator</span><span class="special">,</span> <span class="identifier">ForwardIterator</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> ForwardIterator<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/is_sorted_idp37664832.html" title="Function template is_sorted"><span class="identifier">is_sorted</span></a><span class="special">(</span><span class="identifier">ForwardIterator</span><span class="special">,</span> <span class="identifier">ForwardIterator</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> R<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">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">R</span><span class="special">,</span> <span class="identifier">Pred</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="keyword">const</span> <span class="identifier">R</span> <span class="special">></span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> + <a class="link" href="../../../../boost/algorithm/is_sorted_unti_idp37669648.html" title="Function template is_sorted_until"><span class="identifier">is_sorted_until</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">R</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> R<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="keyword">const</span> <span class="identifier">R</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <a class="link" href="../../../../boost/algorithm/is_sorted_unti_idp37675344.html" title="Function template is_sorted_until"><span class="identifier">is_sorted_until</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">R</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> R<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">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">R</span><span class="special">,</span> <span class="identifier">Pred</span> <span class="special">></span><span class="special">::</span><span class="identifier">value</span><span class="special">,</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="keyword">bool</span> <span class="special">></span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> + <a class="link" href="../../../../boost/algorithm/is_sorted_idp37679056.html" title="Function template is_sorted"><span class="identifier">is_sorted</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">R</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> R<span class="special">></span> <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/is_sorted_idp37684576.html" title="Function template is_sorted"><span class="identifier">is_sorted</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">R</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> ForwardIterator<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/is_increasing_idp37688256.html" title="Function template is_increasing"><span class="identifier">is_increasing</span></a><span class="special">(</span><span class="identifier">ForwardIterator</span><span class="special">,</span> <span class="identifier">ForwardIterator</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> R<span class="special">></span> <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/is_increasing_idp37694000.html" title="Function template is_increasing"><span class="identifier">is_increasing</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">R</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> ForwardIterator<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/is_decreasing_idp37698432.html" title="Function template is_decreasing"><span class="identifier">is_decreasing</span></a><span class="special">(</span><span class="identifier">ForwardIterator</span><span class="special">,</span> <span class="identifier">ForwardIterator</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> R<span class="special">></span> <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/is_decreasing_idp37704016.html" title="Function template is_decreasing"><span class="identifier">is_decreasing</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">R</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> ForwardIterator<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/is_strictly_in_idp37708448.html" title="Function template is_strictly_increasing"><span class="identifier">is_strictly_increasing</span></a><span class="special">(</span><span class="identifier">ForwardIterator</span><span class="special">,</span> <span class="identifier">ForwardIterator</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> R<span class="special">></span> <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/is_strictly_in_idp37714032.html" title="Function template is_strictly_increasing"><span class="identifier">is_strictly_increasing</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">R</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> ForwardIterator<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/is_strictly_de_idp37718464.html" title="Function template is_strictly_decreasing"><span class="identifier">is_strictly_decreasing</span></a><span class="special">(</span><span class="identifier">ForwardIterator</span><span class="special">,</span> <span class="identifier">ForwardIterator</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> R<span class="special">></span> <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/is_strictly_de_idp37724048.html" title="Function template is_strictly_decreasing"><span class="identifier">is_strictly_decreasing</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">R</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/is_permutation_idp37634720.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/is_sorted_unti_idp37646864.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/header/boost/algorithm/cxx11/none_of_hpp.html b/libs/algorithm/doc/html/header/boost/algorithm/cxx11/none_of_hpp.html new file mode 100644 index 0000000000..ef983de1e0 --- /dev/null +++ b/libs/algorithm/doc/html/header/boost/algorithm/cxx11/none_of_hpp.html @@ -0,0 +1,58 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Header <boost/algorithm/cxx11/none_of.hpp></title> +<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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/is_strictly_de_idp37724048.html" title="Function template is_strictly_decreasing"> +<link rel="next" href="../../../../boost/algorithm/none_of_idp37731648.html" title="Function template 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="../../../../boost/algorithm/is_strictly_de_idp37724048.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/none_of_idp37731648.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.cxx11.none_of_hpp"></a>Header <<a href="../../../../../../../../boost/algorithm/cxx11/none_of.hpp" target="_top">boost/algorithm/cxx11/none_of.hpp</a>></h3></div></div></div> +<p>Test ranges to see if no elements match a value or predicate. </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">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">,</span> <span class="keyword">typename</span> Predicate<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/none_of_idp37731648.html" title="Function template none_of"><span class="identifier">none_of</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">Predicate</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> Predicate<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/none_of_idp37738768.html" title="Function template none_of"><span class="identifier">none_of</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">Predicate</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> V<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/none_of_equal_idp37744736.html" title="Function template none_of_equal"><span class="identifier">none_of_equal</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="keyword">const</span> <span class="identifier">V</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> Range<span class="special">,</span> <span class="keyword">typename</span> V<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/none_of_equal_idp37751824.html" title="Function template none_of_equal"><span class="identifier">none_of_equal</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="keyword">const</span> <span class="identifier">V</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/is_strictly_de_idp37724048.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/none_of_idp37731648.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/header/boost/algorithm/cxx11/one_of_hpp.html b/libs/algorithm/doc/html/header/boost/algorithm/cxx11/one_of_hpp.html new file mode 100644 index 0000000000..91a348d661 --- /dev/null +++ b/libs/algorithm/doc/html/header/boost/algorithm/cxx11/one_of_hpp.html @@ -0,0 +1,58 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Header <boost/algorithm/cxx11/one_of.hpp></title> +<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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/none_of_equal_idp37751824.html" title="Function template none_of_equal"> +<link rel="next" href="../../../../boost/algorithm/one_of_idp37760928.html" title="Function template 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="../../../../boost/algorithm/none_of_equal_idp37751824.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/one_of_idp37760928.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.cxx11.one_of_hpp"></a>Header <<a href="../../../../../../../../boost/algorithm/cxx11/one_of.hpp" target="_top">boost/algorithm/cxx11/one_of.hpp</a>></h3></div></div></div> +<p>Test ranges to see if only one element matches a value or predicate. </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">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">,</span> <span class="keyword">typename</span> Predicate<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/one_of_idp37760928.html" title="Function template one_of"><span class="identifier">one_of</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">Predicate</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> Predicate<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/one_of_idp37767456.html" title="Function template one_of"><span class="identifier">one_of</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">Predicate</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> V<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/one_of_equal_idp37772832.html" title="Function template one_of_equal"><span class="identifier">one_of_equal</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="keyword">const</span> <span class="identifier">V</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> Range<span class="special">,</span> <span class="keyword">typename</span> V<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/one_of_equal_idp37779328.html" title="Function template one_of_equal"><span class="identifier">one_of_equal</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="keyword">const</span> <span class="identifier">V</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/none_of_equal_idp37751824.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/one_of_idp37760928.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/header/boost/algorithm/cxx11/partition_copy_hpp.html b/libs/algorithm/doc/html/header/boost/algorithm/cxx11/partition_copy_hpp.html new file mode 100644 index 0000000000..10d553a02c --- /dev/null +++ b/libs/algorithm/doc/html/header/boost/algorithm/cxx11/partition_copy_hpp.html @@ -0,0 +1,60 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Header <boost/algorithm/cxx11/partition_copy.hpp></title> +<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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/one_of_equal_idp37779328.html" title="Function template one_of_equal"> +<link rel="next" href="../../../../boost/algorithm/partition_copy_idp37787824.html" title="Function template partition_copy"> +</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/one_of_equal_idp37779328.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/partition_copy_idp37787824.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.cxx11.partition_copy_hpp"></a>Header <<a href="../../../../../../../../boost/algorithm/cxx11/partition_copy.hpp" target="_top">boost/algorithm/cxx11/partition_copy.hpp</a>></h3></div></div></div> +<p>Copy a subset of a sequence to a new sequence. </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">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator<span class="special">,</span> <span class="keyword">typename</span> OutputIterator1<span class="special">,</span> + <span class="keyword">typename</span> OutputIterator2<span class="special">,</span> <span class="keyword">typename</span> UnaryPredicate<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">OutputIterator1</span><span class="special">,</span> <span class="identifier">OutputIterator2</span> <span class="special">></span> + <a class="link" href="../../../../boost/algorithm/partition_copy_idp37787824.html" title="Function template partition_copy"><span class="identifier">partition_copy</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">OutputIterator1</span><span class="special">,</span> + <span class="identifier">OutputIterator2</span><span class="special">,</span> <span class="identifier">UnaryPredicate</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> OutputIterator1<span class="special">,</span> + <span class="keyword">typename</span> OutputIterator2<span class="special">,</span> <span class="keyword">typename</span> UnaryPredicate<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">OutputIterator1</span><span class="special">,</span> <span class="identifier">OutputIterator2</span> <span class="special">></span> + <a class="link" href="../../../../boost/algorithm/partition_copy_idp37798560.html" title="Function template partition_copy"><span class="identifier">partition_copy</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">OutputIterator1</span><span class="special">,</span> <span class="identifier">OutputIterator2</span><span class="special">,</span> + <span class="identifier">UnaryPredicate</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/one_of_equal_idp37779328.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/partition_copy_idp37787824.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/header/boost/algorithm/cxx11/partition_point_hpp.html b/libs/algorithm/doc/html/header/boost/algorithm/cxx11/partition_point_hpp.html new file mode 100644 index 0000000000..5fee205f6a --- /dev/null +++ b/libs/algorithm/doc/html/header/boost/algorithm/cxx11/partition_point_hpp.html @@ -0,0 +1,55 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Header <boost/algorithm/cxx11/partition_point.hpp></title> +<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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/partition_copy_idp37798560.html" title="Function template partition_copy"> +<link rel="next" href="../../../../boost/algorithm/partition_poin_idp37810128.html" title="Function template 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="../../../../boost/algorithm/partition_copy_idp37798560.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/partition_poin_idp37810128.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.cxx11.partition_point_hpp"></a>Header <<a href="../../../../../../../../boost/algorithm/cxx11/partition_point.hpp" target="_top">boost/algorithm/cxx11/partition_point.hpp</a>></h3></div></div></div> +<p>Find the partition point in a sequence. </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">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIterator<span class="special">,</span> <span class="keyword">typename</span> Predicate<span class="special">></span> + <span class="identifier">ForwardIterator</span> + <a class="link" href="../../../../boost/algorithm/partition_poin_idp37810128.html" title="Function template partition_point"><span class="identifier">partition_point</span></a><span class="special">(</span><span class="identifier">ForwardIterator</span><span class="special">,</span> <span class="identifier">ForwardIterator</span><span class="special">,</span> <span class="identifier">Predicate</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> Predicate<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> <a class="link" href="../../../../boost/algorithm/partition_poin_idp37817248.html" title="Function template partition_point"><span class="identifier">partition_point</span></a><span class="special">(</span><span class="identifier">Range</span> <span class="special">&</span><span class="special">,</span> <span class="identifier">Predicate</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/partition_copy_idp37798560.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/partition_poin_idp37810128.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/header/boost/algorithm/cxx14/equal_hpp.html b/libs/algorithm/doc/html/header/boost/algorithm/cxx14/equal_hpp.html new file mode 100644 index 0000000000..f905cc50f5 --- /dev/null +++ b/libs/algorithm/doc/html/header/boost/algorithm/cxx14/equal_hpp.html @@ -0,0 +1,57 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Header <boost/algorithm/cxx14/equal.hpp></title> +<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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/partition_poin_idp37817248.html" title="Function template partition_point"> +<link rel="next" href="../../../../boost/algorithm/equal_idp37825632.html" title="Function template equal"> +</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/partition_poin_idp37817248.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/equal_idp37825632.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.cxx14.equal_hpp"></a>Header <<a href="../../../../../../../../boost/algorithm/cxx14/equal.hpp" target="_top">boost/algorithm/cxx14/equal.hpp</a>></h3></div></div></div> +<p>Test ranges to if they are equal. </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">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator1<span class="special">,</span> <span class="keyword">typename</span> InputIterator2<span class="special">,</span> + <span class="keyword">typename</span> BinaryPredicate<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/equal_idp37825632.html" title="Function template equal"><span class="identifier">equal</span></a><span class="special">(</span><span class="identifier">InputIterator1</span><span class="special">,</span> <span class="identifier">InputIterator1</span><span class="special">,</span> <span class="identifier">InputIterator2</span><span class="special">,</span> + <span class="identifier">InputIterator2</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator1<span class="special">,</span> <span class="keyword">typename</span> InputIterator2<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/equal_idp37834928.html" title="Function template equal"><span class="identifier">equal</span></a><span class="special">(</span><span class="identifier">InputIterator1</span><span class="special">,</span> <span class="identifier">InputIterator1</span><span class="special">,</span> <span class="identifier">InputIterator2</span><span class="special">,</span> + <span class="identifier">InputIterator2</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/partition_poin_idp37817248.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/equal_idp37825632.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/header/boost/algorithm/cxx14/is_permutation_hpp.html b/libs/algorithm/doc/html/header/boost/algorithm/cxx14/is_permutation_hpp.html new file mode 100644 index 0000000000..0c86cb006a --- /dev/null +++ b/libs/algorithm/doc/html/header/boost/algorithm/cxx14/is_permutation_hpp.html @@ -0,0 +1,54 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Header <boost/algorithm/cxx14/is_permutation.hpp></title> +<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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/is_permutation_idp37617168.html" title="Function template is_permutation"> +<link rel="next" href="../../../../boost/algorithm/is_permutation_idp37626480.html" title="Function template is_permutation"> +</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/is_permutation_idp37617168.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/is_permutation_idp37626480.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.cxx14.is_permutation_hpp"></a>Header <<a href="../../../../../../../../boost/algorithm/cxx14/is_permutation.hpp" target="_top">boost/algorithm/cxx14/is_permutation.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> ForwardIterator1<span class="special">,</span> <span class="keyword">typename</span> ForwardIterator2<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/is_permutation_idp37626480.html" title="Function template is_permutation"><span class="identifier">is_permutation</span></a><span class="special">(</span><span class="identifier">ForwardIterator1</span><span class="special">,</span> <span class="identifier">ForwardIterator1</span><span class="special">,</span> + <span class="identifier">ForwardIterator2</span><span class="special">,</span> <span class="identifier">ForwardIterator2</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> ForwardIterator1<span class="special">,</span> <span class="keyword">typename</span> ForwardIterator2<span class="special">,</span> + <span class="keyword">typename</span> BinaryPredicate<span class="special">></span> + <span class="keyword">bool</span> <a class="link" href="../../../../boost/algorithm/is_permutation_idp37634720.html" title="Function template is_permutation"><span class="identifier">is_permutation</span></a><span class="special">(</span><span class="identifier">ForwardIterator1</span><span class="special">,</span> <span class="identifier">ForwardIterator1</span><span class="special">,</span> + <span class="identifier">ForwardIterator2</span><span class="special">,</span> <span class="identifier">ForwardIterator2</span><span class="special">,</span> + <span class="identifier">BinaryPredicate</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/is_permutation_idp37617168.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/is_permutation_idp37626480.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/header/boost/algorithm/cxx14/mismatch_hpp.html b/libs/algorithm/doc/html/header/boost/algorithm/cxx14/mismatch_hpp.html new file mode 100644 index 0000000000..57558b43c8 --- /dev/null +++ b/libs/algorithm/doc/html/header/boost/algorithm/cxx14/mismatch_hpp.html @@ -0,0 +1,58 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Header <boost/algorithm/cxx14/mismatch.hpp></title> +<link rel="stylesheet" href="../../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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/equal_idp37834928.html" title="Function template equal"> +<link rel="next" href="../../../../boost/algorithm/mismatch_idp37845680.html" title="Function template mismatch"> +</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/equal_idp37834928.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/mismatch_idp37845680.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.cxx14.mismatch_hpp"></a>Header <<a href="../../../../../../../../boost/algorithm/cxx14/mismatch.hpp" target="_top">boost/algorithm/cxx14/mismatch.hpp</a>></h3></div></div></div> +<p>Find the first mismatched element in a sequence. </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">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator1<span class="special">,</span> <span class="keyword">typename</span> InputIterator2<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">InputIterator1</span><span class="special">,</span> <span class="identifier">InputIterator2</span> <span class="special">></span> + <a class="link" href="../../../../boost/algorithm/mismatch_idp37845680.html" title="Function template mismatch"><span class="identifier">mismatch</span></a><span class="special">(</span><span class="identifier">InputIterator1</span><span class="special">,</span> <span class="identifier">InputIterator1</span><span class="special">,</span> <span class="identifier">InputIterator2</span><span class="special">,</span> <span class="identifier">InputIterator2</span><span class="special">,</span> + <span class="identifier">BinaryPredicate</span><span class="special">)</span><span class="special">;</span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> InputIterator1<span class="special">,</span> <span class="keyword">typename</span> InputIterator2<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">InputIterator1</span><span class="special">,</span> <span class="identifier">InputIterator2</span> <span class="special">></span> + <a class="link" href="../../../../boost/algorithm/mismatch_idp37855040.html" title="Function template mismatch"><span class="identifier">mismatch</span></a><span class="special">(</span><span class="identifier">InputIterator1</span><span class="special">,</span> <span class="identifier">InputIterator1</span><span class="special">,</span> <span class="identifier">InputIterator2</span><span class="special">,</span> <span class="identifier">InputIterator2</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/equal_idp37834928.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/mismatch_idp37845680.html"><img src="../../../../../../../../doc/src/images/next.png" alt="Next"></a> +</div> +</body> +</html> diff --git a/libs/algorithm/doc/html/header/boost/algorithm/gather_hpp.html b/libs/algorithm/doc/html/header/boost/algorithm/gather_hpp.html new file mode 100644 index 0000000000..68777fd134 --- /dev/null +++ b/libs/algorithm/doc/html/header/boost/algorithm/gather_hpp.html @@ -0,0 +1,59 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>Header <boost/algorithm/gather.hpp></title> +<link rel="stylesheet" href="../../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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/mismatch_idp37855040.html" title="Function template mismatch"> +<link rel="next" href="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="../../../boost/algorithm/mismatch_idp37855040.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="hex_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.gather_hpp"></a>Header <<a href="../../../../../../../boost/algorithm/gather.hpp" target="_top">boost/algorithm/gather.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="comment">// iterator-based gather implementation </span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> BidirectionalIterator<span class="special">,</span> <span class="keyword">typename</span> Pred<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">BidirectionalIterator</span><span class="special">,</span> <span class="identifier">BidirectionalIterator</span> <span class="special">></span> + <a name="boost.algorithm.gather_idp37864880"></a><span class="identifier">gather</span><span class="special">(</span><span class="identifier">BidirectionalIterator</span> first<span class="special">,</span> <span class="identifier">BidirectionalIterator</span> last<span class="special">,</span> + <span class="identifier">BidirectionalIterator</span> pivot<span class="special">,</span> <span class="identifier">Pred</span> pred<span class="special">)</span><span class="special">;</span> + + <span class="comment">// range-based gather implementation </span> + <span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> BidirectionalRange<span class="special">,</span> <span class="keyword">typename</span> Pred<span class="special">></span> + <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</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">BidirectionalRange</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</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">BidirectionalRange</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <span class="special">></span> + <a name="boost.algorithm.gather_idp37870240"></a><span class="identifier">gather</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">BidirectionalRange</span> <span class="special">&</span> range<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">BidirectionalRange</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> pivot<span class="special">,</span> + <span class="identifier">Pred</span> pred<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/mismatch_idp37855040.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="hex_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 index e87c715c21..b3fc70ee66 100644 --- a/libs/algorithm/doc/html/header/boost/algorithm/hex_hpp.html +++ b/libs/algorithm/doc/html/header/boost/algorithm/hex_hpp.html @@ -3,10 +3,10 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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="prev" href="gather_hpp.html" title="Header <boost/algorithm/gather.hpp>"> <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"> @@ -20,7 +20,7 @@ </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> +<a accesskey="p" href="gather_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/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"> @@ -37,20 +37,20 @@ <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="emphasis"><em><span class="identifier">unspecified</span></em></span> <a class="link" href="../../../boost/algorithm/hex_idp37883616.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> + <a class="link" href="../../../boost/algorithm/hex_idp37891168.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="emphasis"><em><span class="identifier">unspecified</span></em></span> <a class="link" href="../../../boost/algorithm/hex_idp37897536.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="identifier">OutputIterator</span> <a class="link" href="../../../boost/algorithm/unhex_idp37903952.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="identifier">OutputIterator</span> <a class="link" href="../../../boost/algorithm/unhex_idp37911376.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="identifier">OutputIterator</span> <a class="link" href="../../../boost/algorithm/unhex_idp37917696.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_idp37923984.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_idp37928000.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> @@ -64,7 +64,7 @@ </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> +<a accesskey="p" href="gather_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/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 index 4aff67e323..218f7c5465 100644 --- a/libs/algorithm/doc/html/header/boost/algorithm/minmax_element_hpp.html +++ b/libs/algorithm/doc/html/header/boost/algorithm/minmax_element_hpp.html @@ -3,7 +3,7 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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>"> @@ -28,57 +28,57 @@ <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> + <a name="boost.minmax_element_idp37942576"></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> + <a name="boost.minmax_element_idp37945664"></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="identifier">ForwardIter</span> <a name="boost.first_min_elem_idp37950000"></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">ForwardIter</span> <a name="boost.first_min_elem_idp37953072"></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="identifier">ForwardIter</span> <a name="boost.last_min_eleme_idp37957392"></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">ForwardIter</span> <a name="boost.last_min_eleme_idp37960464"></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="identifier">ForwardIter</span> <a name="boost.first_max_elem_idp37964784"></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">ForwardIter</span> <a name="boost.first_max_elem_idp37967856"></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="identifier">ForwardIter</span> <a name="boost.last_max_eleme_idp37972176"></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">ForwardIter</span> <a name="boost.last_max_eleme_idp37975248"></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> + <a name="boost.first_min_firs_idp37979568"></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> + <a name="boost.first_min_firs_idp37982672"></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> + <a name="boost.first_min_last_idp37987024"></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> + <a name="boost.first_min_last_idp37990128"></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> + <a name="boost.last_min_first_idp37994480"></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> + <a name="boost.last_min_first_idp37997584"></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> + <a name="boost.last_min_last__idp38001936"></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> + <a name="boost.last_min_last__idp38005040"></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> diff --git a/libs/algorithm/doc/html/header/boost/algorithm/minmax_hpp.html b/libs/algorithm/doc/html/header/boost/algorithm/minmax_hpp.html index 094d1b4162..dcac2e4053 100644 --- a/libs/algorithm/doc/html/header/boost/algorithm/minmax_hpp.html +++ b/libs/algorithm/doc/html/header/boost/algorithm/minmax_hpp.html @@ -3,10 +3,10 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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="prev" href="../../../boost/algorithm/unhex_idp37928000.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"> @@ -20,17 +20,17 @@ </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> +<a accesskey="p" href="../../../boost/algorithm/unhex_idp37928000.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="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_idp37933696"></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> + <a name="boost.minmax_idp37936784"></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> @@ -43,7 +43,7 @@ </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> +<a accesskey="p" href="../../../boost/algorithm/unhex_idp37928000.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 index 22bf6c63ce..c07076b6d5 100644 --- 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 @@ -3,10 +3,10 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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="prev" href="../../../../boost/algorithm/boyer_moore_se_idp38022400.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"> @@ -20,7 +20,7 @@ </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> +<a accesskey="p" href="../../../../boost/algorithm/boyer_moore_se_idp38022400.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"> @@ -30,26 +30,26 @@ <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">corpusIter</span> <a class="link" href="../../../../boost/algorithm/boyer_moore_ho_idp38060992.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> <a name="boost.algorithm.boyer_moore_ho_idp38068544"></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> + <a name="boost.algorithm.boyer_moore_ho_idp38072880"></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> + <a name="boost.algorithm.boyer_moore_ho_idp38077328"></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> + <a name="boost.algorithm.make_boyer_moo_idp38081008"></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> + <a name="boost.algorithm.make_boyer_moo_idp38083744"></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> @@ -63,7 +63,7 @@ </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> +<a accesskey="p" href="../../../../boost/algorithm/boyer_moore_se_idp38022400.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 index 935c2c04e3..07fb8fb5f2 100644 --- 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 @@ -3,7 +3,7 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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>"> @@ -30,24 +30,24 @@ <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="identifier">corpusIter</span> <a class="link" href="../../../../boost/algorithm/boyer_moore_se_idp38022400.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> <a name="boost.algorithm.boyer_moore_se_idp38029936"></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> + <a name="boost.algorithm.boyer_moore_se_idp38034256"></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> + <a name="boost.algorithm.boyer_moore_se_idp38038688"></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> + <a name="boost.algorithm.make_boyer_moo_idp38042352"></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> + <a name="boost.algorithm.make_boyer_moo_idp38045072"></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> 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 index 068484409b..7b835a66fa 100644 --- 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 @@ -3,10 +3,10 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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="prev" href="../../../../boost/algorithm/boyer_moore_ho_idp38060992.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"> @@ -20,7 +20,7 @@ </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> +<a accesskey="p" href="../../../../boost/algorithm/boyer_moore_ho_idp38060992.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"> @@ -29,26 +29,26 @@ <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">corpusIter</span> <a class="link" href="../../../../boost/algorithm/knuth_morris_p_idp38098816.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> <a name="boost.algorithm.knuth_morris_p_idp38106368"></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> + <a name="boost.algorithm.knuth_morris_p_idp38110704"></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> + <a name="boost.algorithm.knuth_morris_p_idp38115152"></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> + <a name="boost.algorithm.make_knuth_mor_idp38118832"></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> + <a name="boost.algorithm.make_knuth_mor_idp38121552"></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> @@ -62,7 +62,7 @@ </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> +<a accesskey="p" href="../../../../boost/algorithm/boyer_moore_ho_idp38060992.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 index dc4d0a114e..72a3a5273b 100644 --- a/libs/algorithm/doc/html/header/boost/algorithm/string_hpp.html +++ b/libs/algorithm/doc/html/header/boost/algorithm/string_hpp.html @@ -3,10 +3,10 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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="prev" href="../../../boost/algorithm/knuth_morris_p_idp38098816.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"> @@ -20,7 +20,7 @@ </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> +<a accesskey="p" href="../../../boost/algorithm/knuth_morris_p_idp38098816.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"> @@ -37,7 +37,7 @@ </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> +<a accesskey="p" href="../../../boost/algorithm/knuth_morris_p_idp38098816.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 index 189e7380f4..be7ea07d67 100644 --- a/libs/algorithm/doc/html/header/boost/algorithm/string_regex_hpp.html +++ b/libs/algorithm/doc/html/header/boost/algorithm/string_regex_hpp.html @@ -3,7 +3,7 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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>"> @@ -24,7 +24,7 @@ <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> +<p>Cumulative include for string_algo library. In addition 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> diff --git a/libs/algorithm/doc/html/index.html b/libs/algorithm/doc/html/index.html index a7123946fc..fa05f0505f 100644 --- a/libs/algorithm/doc/html/index.html +++ b/libs/algorithm/doc/html/index.html @@ -3,7 +3,7 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> <link rel="home" href="index.html" title="The Boost Algorithm Library"> <link rel="next" href="algorithm/Searching.html" title="Searching Algorithms"> </head> @@ -35,7 +35,7 @@ </div></div> <div class="toc"> <p><b>Table of Contents</b></p> -<dl> +<dl class="toc"> <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> @@ -56,17 +56,43 @@ </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/is_permutation.html">is_permutation + </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/CXX14.html">C++14 Algorithms</a></span></dt> +<dd><dl> +<dt><span class="section"><a href="algorithm/CXX14.html#the_boost_algorithm_library.CXX14.equal">equal </a></span></dt> +<dt><span class="section"><a href="the_boost_algorithm_library/CXX14/mismatch.html">mismatch + </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/gather.html">gather</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/cxx11/all_of_hpp.html">Header <boost/algorithm/cxx11/all_of.hpp></a></span></dt> +<dt><span class="section"><a href="header/boost/algorithm/cxx11/any_of_hpp.html">Header <boost/algorithm/cxx11/any_of.hpp></a></span></dt> +<dt><span class="section"><a href="header/boost/algorithm/cxx11/copy_if_hpp.html">Header <boost/algorithm/cxx11/copy_if.hpp></a></span></dt> +<dt><span class="section"><a href="header/boost/algorithm/cxx11/copy_n_hpp.html">Header <boost/algorithm/cxx11/copy_n.hpp></a></span></dt> +<dt><span class="section"><a href="header/boost/algorithm/cxx11/find_if_not_hpp.html">Header <boost/algorithm/cxx11/find_if_not.hpp></a></span></dt> +<dt><span class="section"><a href="header/boost/algorithm/cxx11/iota_hpp.html">Header <boost/algorithm/cxx11/iota.hpp></a></span></dt> +<dt><span class="section"><a href="header/boost/algorithm/cxx11/is_partitioned_hpp.html">Header <boost/algorithm/cxx11/is_partitioned.hpp></a></span></dt> +<dt><span class="section"><a href="header/boost/algorithm/cxx11/is_permutation_hpp.html">Header <boost/algorithm/cxx11/is_permutation.hpp></a></span></dt> +<dt><span class="section"><a href="header/boost/algorithm/cxx14/is_permutation_hpp.html">Header <boost/algorithm/cxx14/is_permutation.hpp></a></span></dt> +<dt><span class="section"><a href="header/boost/algorithm/cxx11/is_sorted_hpp.html">Header <boost/algorithm/cxx11/is_sorted.hpp></a></span></dt> +<dt><span class="section"><a href="header/boost/algorithm/cxx11/none_of_hpp.html">Header <boost/algorithm/cxx11/none_of.hpp></a></span></dt> +<dt><span class="section"><a href="header/boost/algorithm/cxx11/one_of_hpp.html">Header <boost/algorithm/cxx11/one_of.hpp></a></span></dt> +<dt><span class="section"><a href="header/boost/algorithm/cxx11/partition_copy_hpp.html">Header <boost/algorithm/cxx11/partition_copy.hpp></a></span></dt> +<dt><span class="section"><a href="header/boost/algorithm/cxx11/partition_point_hpp.html">Header <boost/algorithm/cxx11/partition_point.hpp></a></span></dt> +<dt><span class="section"><a href="header/boost/algorithm/cxx14/equal_hpp.html">Header <boost/algorithm/cxx14/equal.hpp></a></span></dt> +<dt><span class="section"><a href="header/boost/algorithm/cxx14/mismatch_hpp.html">Header <boost/algorithm/cxx14/mismatch.hpp></a></span></dt> +<dt><span class="section"><a href="header/boost/algorithm/gather_hpp.html">Header <boost/algorithm/gather.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> @@ -98,7 +124,7 @@ </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 + <span class="phrase"><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> @@ -114,7 +140,7 @@ </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> + <span class="phrase"><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, @@ -122,7 +148,7 @@ </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> + <span class="phrase"><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 @@ -132,7 +158,7 @@ </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="left"><p><small>Last revised: October 30, 2014 at 10:13:50 GMT</small></p></td> <td align="right"><div class="copyright-footer"></div></td> </tr></table> <hr> diff --git a/libs/algorithm/doc/html/standalone_HTML.manifest b/libs/algorithm/doc/html/standalone_HTML.manifest index efe1a9c2dc..52285d6952 100644 --- a/libs/algorithm/doc/html/standalone_HTML.manifest +++ b/libs/algorithm/doc/html/standalone_HTML.manifest @@ -8,38 +8,117 @@ 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/is_permutation.html the_boost_algorithm_library/CXX11/partition_point.html +algorithm/CXX14.html +the_boost_algorithm_library/CXX14/mismatch.html algorithm/Misc.html +the_boost_algorithm_library/Misc/gather.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 +boost/algorithm/clamp_idp34169904.html +boost/algorithm/clamp_idp29107056.html +boost/algorithm/clamp_range_idp29118784.html +boost/algorithm/clamp_range_idp29133760.html +header/boost/algorithm/cxx11/all_of_hpp.html +boost/algorithm/all_of_idp37421200.html +boost/algorithm/all_of_idp37429008.html +boost/algorithm/all_of_equal_idp37434976.html +boost/algorithm/all_of_equal_idp37442064.html +header/boost/algorithm/cxx11/any_of_hpp.html +boost/algorithm/any_of_idp37451168.html +boost/algorithm/any_of_idp37458272.html +boost/algorithm/any_of_equal_idp37464240.html +boost/algorithm/any_of_equal_idp37471328.html +header/boost/algorithm/cxx11/copy_if_hpp.html +boost/algorithm/copy_if_idp37480416.html +boost/algorithm/copy_if_idp37489664.html +boost/algorithm/copy_while_idp37497072.html +boost/algorithm/copy_while_idp37505664.html +boost/algorithm/copy_until_idp37513056.html +boost/algorithm/copy_until_idp37521648.html +header/boost/algorithm/cxx11/copy_n_hpp.html +boost/algorithm/copy_n.html +header/boost/algorithm/cxx11/find_if_not_hpp.html +boost/algorithm/find_if_not_idp37543536.html +boost/algorithm/find_if_not_idp37551088.html +header/boost/algorithm/cxx11/iota_hpp.html +boost/algorithm/iota_idp37559984.html +boost/algorithm/iota_idp37567088.html +boost/algorithm/iota_n.html +header/boost/algorithm/cxx11/is_partitioned_hpp.html +boost/algorithm/is_partitioned_idp37581904.html +boost/algorithm/is_partitioned_idp37588976.html +header/boost/algorithm/cxx11/is_permutation_hpp.html +boost/algorithm/is_permutation_idp37596448.html +boost/algorithm/is_permutation_idp37605232.html +boost/algorithm/is_permutation_idp37611904.html +boost/algorithm/is_permutation_idp37617168.html +header/boost/algorithm/cxx14/is_permutation_hpp.html +boost/algorithm/is_permutation_idp37626480.html +boost/algorithm/is_permutation_idp37634720.html +header/boost/algorithm/cxx11/is_sorted_hpp.html +boost/algorithm/is_sorted_unti_idp37646864.html +boost/algorithm/is_sorted_unti_idp37653456.html +boost/algorithm/is_sorted_idp37658304.html +boost/algorithm/is_sorted_idp37664832.html +boost/algorithm/is_sorted_unti_idp37669648.html +boost/algorithm/is_sorted_unti_idp37675344.html +boost/algorithm/is_sorted_idp37679056.html +boost/algorithm/is_sorted_idp37684576.html +boost/algorithm/is_increasing_idp37688256.html +boost/algorithm/is_increasing_idp37694000.html +boost/algorithm/is_decreasing_idp37698432.html +boost/algorithm/is_decreasing_idp37704016.html +boost/algorithm/is_strictly_in_idp37708448.html +boost/algorithm/is_strictly_in_idp37714032.html +boost/algorithm/is_strictly_de_idp37718464.html +boost/algorithm/is_strictly_de_idp37724048.html +header/boost/algorithm/cxx11/none_of_hpp.html +boost/algorithm/none_of_idp37731648.html +boost/algorithm/none_of_idp37738768.html +boost/algorithm/none_of_equal_idp37744736.html +boost/algorithm/none_of_equal_idp37751824.html +header/boost/algorithm/cxx11/one_of_hpp.html +boost/algorithm/one_of_idp37760928.html +boost/algorithm/one_of_idp37767456.html +boost/algorithm/one_of_equal_idp37772832.html +boost/algorithm/one_of_equal_idp37779328.html +header/boost/algorithm/cxx11/partition_copy_hpp.html +boost/algorithm/partition_copy_idp37787824.html +boost/algorithm/partition_copy_idp37798560.html +header/boost/algorithm/cxx11/partition_point_hpp.html +boost/algorithm/partition_poin_idp37810128.html +boost/algorithm/partition_poin_idp37817248.html +header/boost/algorithm/cxx14/equal_hpp.html +boost/algorithm/equal_idp37825632.html +boost/algorithm/equal_idp37834928.html +header/boost/algorithm/cxx14/mismatch_hpp.html +boost/algorithm/mismatch_idp37845680.html +boost/algorithm/mismatch_idp37855040.html +header/boost/algorithm/gather_hpp.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 +boost/algorithm/hex_idp37883616.html +boost/algorithm/hex_idp37891168.html +boost/algorithm/hex_idp37897536.html +boost/algorithm/unhex_idp37903952.html +boost/algorithm/unhex_idp37911376.html +boost/algorithm/unhex_idp37917696.html +boost/algorithm/hex_idp37923984.html +boost/algorithm/unhex_idp37928000.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 +boost/algorithm/boyer_moore_se_idp38022400.html header/boost/algorithm/searching/boyer_moore_horspool_hpp.html boost/algorithm/boyer_moore_horspool.html -boost/algorithm/boyer_moore_horsp_id339130.html +boost/algorithm/boyer_moore_ho_idp38060992.html header/boost/algorithm/searching/knuth_morris_pratt_hpp.html boost/algorithm/knuth_morris_pratt.html -boost/algorithm/knuth_morris_prat_id339421.html +boost/algorithm/knuth_morris_p_idp38098816.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 index 03d6b640d2..f14065d740 100644 --- 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 @@ -3,7 +3,7 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> @@ -49,7 +49,7 @@ </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> + <span class="phrase"><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 @@ -86,7 +86,7 @@ </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> + <span class="phrase"><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 @@ -110,7 +110,7 @@ </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 + <span class="phrase"><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> @@ -119,7 +119,7 @@ </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> + <span class="phrase"><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> @@ -131,7 +131,7 @@ </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 + <span class="phrase"><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> @@ -143,9 +143,9 @@ </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> + <span class="phrase"><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"> +<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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, 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 index 4b236a294c..2d035cfb96 100644 --- 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 @@ -3,11 +3,11 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> +<link rel="next" href="is_permutation.html" title="is_permutation"> </head> <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> <table cellpadding="2" width="100%"><tr> @@ -20,7 +20,7 @@ </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> +<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="is_permutation.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> </div> <div class="section"> <div class="titlepage"><div><div><h3 class="title"> @@ -46,12 +46,12 @@ </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> + <span class="phrase"><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, + returns true if 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> @@ -65,7 +65,7 @@ </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> + <span class="phrase"><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 @@ -86,7 +86,7 @@ </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 + <span class="phrase"><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> @@ -95,7 +95,7 @@ </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> + <span class="phrase"><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> @@ -106,7 +106,7 @@ </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 + <span class="phrase"><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> @@ -117,9 +117,9 @@ </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> + <span class="phrase"><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"> +<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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, @@ -141,7 +141,7 @@ </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> +<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="is_permutation.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_permutation.html b/libs/algorithm/doc/html/the_boost_algorithm_library/CXX11/is_permutation.html new file mode 100644 index 0000000000..2b55337cc6 --- /dev/null +++ b/libs/algorithm/doc/html/the_boost_algorithm_library/CXX11/is_permutation.html @@ -0,0 +1,177 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>is_permutation</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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="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_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="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_permutation"></a><a class="link" href="is_permutation.html" title="is_permutation">is_permutation + </a> +</h3></div></div></div> +<p> + The header file 'is_permutation.hpp' contains six variants of a single algorithm, + <code class="computeroutput"><span class="identifier">is_permutation</span></code>. The algorithm + tests to see if one sequence is a permutation of a second one; in other words, + it contains all the same members, possibly in a different order. + </p> +<p> + The routine <code class="computeroutput"><span class="identifier">is_permutation</span></code> + takes two sequences and an (optional) predicate. It returns true if the two + sequences contain the same members. If it is passed a predicate, it uses + the predicate to compare the elements of the sequence to see if they are + the same. + </p> +<p> + <code class="computeroutput"><span class="identifier">is_permutation</span></code> come in three + forms. The first one takes two iterators to define the first range, and the + starting iterator of the second range. The second form takes a two iterators + to define the first range and two more to define the second range. The third + form takes a single range parameter, and uses Boost.Range to traverse it. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.is_permutation.h0"></a> + <span class="phrase"><a name="the_boost_algorithm_library.CXX11.is_permutation.interface"></a></span><a class="link" href="is_permutation.html#the_boost_algorithm_library.CXX11.is_permutation.interface">Interface</a> + </h5> +<p> + The function <code class="computeroutput"><span class="identifier">is_permutation</span></code> + returns true if the two input sequences contain the same elements. There + are six versions; two take three iterators, two take four iterators, and + the other two take two ranges. + </p> +<p> + In general, you should prefer the four iterator versions over the three iterator + ones. The three iterator version has to "create" the fourth iterator + internally by calling <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">advance</span><span class="special">(</span><span class="identifier">first2</span><span class="special">,</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">distance</span><span class="special">(</span><span class="identifier">first1</span><span class="special">,</span><span class="identifier">last1</span><span class="special">))</span></code>, + and if the second sequence is shorter than the first, that's undefined behavior. + </p> +<p> +</p> +<pre class="programlisting"><span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardIterator1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardIterator2</span> <span class="special">></span> +<span class="keyword">bool</span> <span class="identifier">is_permutation</span> <span class="special">(</span> <span class="identifier">ForwardIterator1</span> <span class="identifier">first1</span><span class="special">,</span> <span class="identifier">ForwardIterator1</span> <span class="identifier">last1</span><span class="special">,</span> <span class="identifier">ForwardIterator2</span> <span class="identifier">first2</span> <span class="special">);</span> + +<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardIterator1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardIterator2</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span> <span class="special">></span> +<span class="keyword">bool</span> <span class="identifier">is_permutation</span> <span class="special">(</span> <span class="identifier">ForwardIterator1</span> <span class="identifier">first1</span><span class="special">,</span> <span class="identifier">ForwardIterator1</span> <span class="identifier">last1</span><span class="special">,</span> + <span class="identifier">ForwardIterator2</span> <span class="identifier">first2</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">p</span> <span class="special">);</span> + + +<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardIterator1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardIterator2</span> <span class="special">></span> +<span class="keyword">bool</span> <span class="identifier">is_permutation</span> <span class="special">(</span> <span class="identifier">ForwardIterator1</span> <span class="identifier">first1</span><span class="special">,</span> <span class="identifier">ForwardIterator1</span> <span class="identifier">last1</span><span class="special">,</span> <span class="identifier">ForwardIterator2</span> <span class="identifier">first2</span><span class="special">,</span> <span class="identifier">ForwardIterator2</span> <span class="identifier">last2</span> <span class="special">);</span> + +<span class="keyword">template</span><span class="special"><</span> <span class="keyword">class</span> <span class="identifier">ForwardIterator1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">ForwardIterator2</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span> <span class="special">></span> +<span class="keyword">bool</span> <span class="identifier">is_permutation</span> <span class="special">(</span> <span class="identifier">ForwardIterator1</span> <span class="identifier">first1</span><span class="special">,</span> <span class="identifier">ForwardIterator1</span> <span class="identifier">last1</span><span class="special">,</span> + <span class="identifier">ForwardIterator2</span> <span class="identifier">first2</span><span class="special">,</span> <span class="identifier">ForwardIterator2</span> <span class="identifier">last2</span><span class="special">,</span> + <span class="identifier">BinaryPredicate</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">ForwardIterator</span><span class="special">></span> +<span class="keyword">bool</span> <span class="identifier">is_permutation</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">ForwardIterator</span> <span class="identifier">first2</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">ForwardIterator</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">BinaryPredicate</span><span class="special">></span> +<span class="keyword">bool</span> <span class="identifier">is_permutation</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">ForwardIterator</span> <span class="identifier">first2</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span> <span class="special">);</span> +</pre> +<p> + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.is_permutation.h1"></a> + <span class="phrase"><a name="the_boost_algorithm_library.CXX11.is_permutation.examples"></a></span><a class="link" href="is_permutation.html#the_boost_algorithm_library.CXX11.is_permutation.examples">Examples</a> + </h5> +<p> + Given the container <code class="computeroutput"><span class="identifier">c1</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>, + and <code class="computeroutput"><span class="identifier">c2</span></code> containing <code class="computeroutput"><span class="special">{</span> <span class="number">15</span><span class="special">,</span> + <span class="number">14</span><span class="special">,</span> <span class="number">3</span><span class="special">,</span> <span class="number">1</span><span class="special">,</span> <span class="number">2</span> <span class="special">}</span></code>, + then +</p> +<pre class="programlisting"><span class="identifier">is_permutation</span> <span class="special">(</span> <span class="identifier">c1</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c1</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">c2</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c2</span><span class="special">.</span><span class="identifier">end</span> <span class="special">())</span> <span class="special">--></span> <span class="keyword">false</span> +<span class="identifier">is_permutation</span> <span class="special">(</span> <span class="identifier">c1</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span> <span class="special">+</span> <span class="number">1</span><span class="special">,</span> <span class="identifier">c1</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">c2</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c2</span><span class="special">.</span><span class="identifier">end</span> <span class="special">())</span> <span class="special">--></span> <span class="keyword">true</span> + +<span class="identifier">is_permutation</span> <span class="special">(</span> <span class="identifier">c1</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">c1</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">c2</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">c2</span><span class="special">.</span><span class="identifier">end</span> <span class="special">())</span> <span class="special">--></span> <span class="keyword">true</span> <span class="comment">// all empty ranges are permutations of each other</span> +</pre> +<p> + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.is_permutation.h2"></a> + <span class="phrase"><a name="the_boost_algorithm_library.CXX11.is_permutation.iterator_requirements"></a></span><a class="link" href="is_permutation.html#the_boost_algorithm_library.CXX11.is_permutation.iterator_requirements">Iterator + Requirements</a> + </h5> +<p> + <code class="computeroutput"><span class="identifier">is_permutation</span></code> works on forward + iterators or better. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.is_permutation.h3"></a> + <span class="phrase"><a name="the_boost_algorithm_library.CXX11.is_permutation.complexity"></a></span><a class="link" href="is_permutation.html#the_boost_algorithm_library.CXX11.is_permutation.complexity">Complexity</a> + </h5> +<p> + All of the variants of <code class="computeroutput"><span class="identifier">is_permutation</span></code> + run in <span class="emphasis"><em>O(N^2)</em></span> (quadratic) time; that is, they compare + against each element in the list (potentially) N times. If passed random-access + iterators, <code class="computeroutput"><span class="identifier">is_permutation</span></code> + can return quickly if the sequences are different sizes. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX11.is_permutation.h4"></a> + <span class="phrase"><a name="the_boost_algorithm_library.CXX11.is_permutation.exception_safety"></a></span><a class="link" href="is_permutation.html#the_boost_algorithm_library.CXX11.is_permutation.exception_safety">Exception + Safety</a> + </h5> +<p> + All of the variants of <code class="computeroutput"><span class="identifier">is_permutation</span></code> + take their parameters by value, 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_permutation.h5"></a> + <span class="phrase"><a name="the_boost_algorithm_library.CXX11.is_permutation.notes"></a></span><a class="link" href="is_permutation.html#the_boost_algorithm_library.CXX11.is_permutation.notes">Notes</a> + </h5> +<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "> +<li class="listitem"> + The three iterator versions of the routine <code class="computeroutput"><span class="identifier">is_permutation</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"> + The four iterator versions of the routine <code class="computeroutput"><span class="identifier">is_permutation</span></code> + are part of the proposed C++14 standard. When C++14 standard libraries + become available, the implementation should be changed to use the implementation + from the standard library (if available). + </li> +<li class="listitem"> + <code class="computeroutput"><span class="identifier">is_permutation</span></code> returns + true when passed a pair of empty ranges, no matter what predicate is + passed to test with. + </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="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 index 7a0327c3ef..109c13fc4c 100644 --- 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 @@ -3,7 +3,7 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> @@ -33,7 +33,7 @@ </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> + <span class="phrase"><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> @@ -44,11 +44,11 @@ <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">ForwardIterator</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">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">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">ForwardIterator</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_sorted</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> @@ -62,11 +62,11 @@ </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). + functions will work forward iterators or better. </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> + <span class="phrase"><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 @@ -140,7 +140,7 @@ </p> <p> To test if a sequence is increasing (each element at least as large as the - preceeding one): + preceding 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> @@ -153,14 +153,14 @@ <p> </p> <p> - To test if a sequence is decreasing (each element no larger than the preceeding + To test if a sequence is decreasing (each element no larger than the preceding 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">ForwardIterator</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_decreasing</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">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> @@ -170,11 +170,11 @@ </p> <p> To test if a sequence is strictly increasing (each element larger than the - preceeding one): + preceding 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">ForwardIterator</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_strictly_increasing</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">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> @@ -184,11 +184,11 @@ </p> <p> To test if a sequence is strictly decreasing (each element smaller than the - preceeding one): + preceding 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">ForwardIterator</span><span class="special">></span> + <span class="keyword">bool</span> <span class="identifier">is_strictly_decreasing</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">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> @@ -202,9 +202,9 @@ </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> + <span class="phrase"><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"> +<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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 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 index 6cd0057629..19bed08f9c 100644 --- 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 @@ -3,7 +3,7 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> @@ -49,7 +49,7 @@ </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> + <span class="phrase"><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 @@ -86,7 +86,7 @@ </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> + <span class="phrase"><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 @@ -111,7 +111,7 @@ </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 + <span class="phrase"><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> @@ -120,7 +120,7 @@ </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> + <span class="phrase"><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> @@ -132,7 +132,7 @@ </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 + <span class="phrase"><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> @@ -144,9 +144,9 @@ </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> + <span class="phrase"><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"> +<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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, 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 index a36220996c..beff3783f5 100644 --- 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 @@ -3,7 +3,7 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> @@ -49,7 +49,7 @@ </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> + <span class="phrase"><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 @@ -86,7 +86,7 @@ </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> + <span class="phrase"><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 @@ -110,7 +110,7 @@ </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 + <span class="phrase"><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> @@ -119,7 +119,7 @@ </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> + <span class="phrase"><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> @@ -131,7 +131,7 @@ </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 + <span class="phrase"><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> @@ -143,15 +143,15 @@ </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> + <span class="phrase"><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"> +<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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> + The second parameter to <code class="computeroutput"><span class="identifier">one_of_equal</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 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 index 68242bb249..2ac0ca6fb1 100644 --- 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 @@ -3,11 +3,11 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> +<link rel="prev" href="is_permutation.html" title="is_permutation"> +<link rel="next" href="../../algorithm/CXX14.html" title="C++14 Algorithms"> </head> <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> <table cellpadding="2" width="100%"><tr> @@ -20,7 +20,7 @@ </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> +<a accesskey="p" href="is_permutation.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/CXX14.html"><img src="../../../../../../doc/src/images/next.png" alt="Next"></a> </div> <div class="section"> <div class="titlepage"><div><div><h3 class="title"> @@ -47,7 +47,7 @@ </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> + <span class="phrase"><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. @@ -63,7 +63,7 @@ </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> + <span class="phrase"><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 @@ -83,7 +83,7 @@ </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 + <span class="phrase"><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> @@ -93,7 +93,7 @@ </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> + <span class="phrase"><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> @@ -105,7 +105,7 @@ </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 + <span class="phrase"><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> @@ -116,9 +116,9 @@ </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> + <span class="phrase"><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"> +<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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, @@ -139,7 +139,7 @@ </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> +<a accesskey="p" href="is_permutation.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/CXX14.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/CXX14/mismatch.html b/libs/algorithm/doc/html/the_boost_algorithm_library/CXX14/mismatch.html new file mode 100644 index 0000000000..56d2d0bfd3 --- /dev/null +++ b/libs/algorithm/doc/html/the_boost_algorithm_library/CXX14/mismatch.html @@ -0,0 +1,175 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>mismatch</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.1"> +<link rel="home" href="../../index.html" title="The Boost Algorithm Library"> +<link rel="up" href="../../algorithm/CXX14.html" title="C++14 Algorithms"> +<link rel="prev" href="../../algorithm/CXX14.html" title="C++14 Algorithms"> +<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="../../algorithm/CXX14.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/CXX14.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.CXX14.mismatch"></a><a class="link" href="mismatch.html" title="mismatch">mismatch + </a> +</h3></div></div></div> +<p> + The header file 'mismatch.hpp' contains two variants of a the stl algorithm + <code class="computeroutput"><span class="identifier">mismatch</span></code>. The algorithm finds + the first point in two sequences where they do not match. + </p> +<p> + Before (the proposed) C++14 the algorithm <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">mismatch</span></code> + took three iterators and an optional comparison predicate. The first two + iterators <code class="computeroutput"><span class="special">[</span><span class="identifier">first1</span><span class="special">,</span> <span class="identifier">last1</span><span class="special">)</span></code> defined a sequence, and the second one + <code class="computeroutput"><span class="identifier">first2</span></code> defined the start + of the second sequence. The second sequence was assumed to be the same length + as the first. + </p> +<p> + In C++14, two new variants were introduced, taking four iterators and an + optional comparison predicate. The four iterators define two sequences <code class="computeroutput"><span class="special">[</span><span class="identifier">first1</span><span class="special">,</span> <span class="identifier">last1</span><span class="special">)</span></code> and <code class="computeroutput"><span class="special">[</span><span class="identifier">first2</span><span class="special">,</span> <span class="identifier">last2</span><span class="special">)</span></code> + explicitly, rather than defining the second one implicitly. This leads to + correct answers in more cases (and avoid undefined behavior in others). + </p> +<p> + Consider the two sequences: +</p> +<pre class="programlisting"><span class="keyword">auto</span> <span class="identifier">seq1</span> <span class="special">=</span> <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="keyword">auto</span> <span class="identifier">seq2</span> <span class="special">=</span> <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">4</span> <span class="special">};</span> + +<span class="identifier">std</span><span class="special">::</span><span class="identifier">mismatch</span> <span class="special">(</span> <span class="identifier">seq1</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="identifier">seq1</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">seq2</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">());</span> <span class="comment">// <3, 3></span> +<span class="identifier">std</span><span class="special">::</span><span class="identifier">mismatch</span> <span class="special">(</span> <span class="identifier">seq2</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="identifier">seq2</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">seq1</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">());</span> <span class="comment">// Undefined behavior</span> +<span class="identifier">std</span><span class="special">::</span><span class="identifier">mismatch</span> <span class="special">(</span> <span class="identifier">seq1</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="identifier">seq1</span><span class="special">.</span><span class="identifier">end</span> <span class="special">(),</span> <span class="identifier">seq2</span><span class="special">.</span><span class="identifier">begin</span> <span class="special">(),</span> <span class="identifier">seq2</span><span class="special">.</span><span class="identifier">end</span> <span class="special">());</span> <span class="comment">// <3, 3></span> +</pre> +<p> + </p> +<p> + The first N entries in <code class="computeroutput"><span class="identifier">seq2</span></code> + are the same as the entries in <code class="computeroutput"><span class="identifier">seq1</span></code> + - but that's not all that's in <code class="computeroutput"><span class="identifier">seq2</span></code>. + In the second case, the algorithm will read past the end of <code class="computeroutput"><span class="identifier">seq1</span></code>, resulting in undefined behavior (large + earthquake, incorrect results, pregnant cat, etc). + </p> +<p> + However, if the two sequences are specified completely, it's clear that where + the mismatch occurs. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX14.mismatch.h0"></a> + <span class="phrase"><a name="the_boost_algorithm_library.CXX14.mismatch.interface"></a></span><a class="link" href="mismatch.html#the_boost_algorithm_library.CXX14.mismatch.interface">interface</a> + </h5> +<p> + The function <code class="computeroutput"><span class="identifier">mismatch</span></code> returns + a pair of iterators which denote the first mismatching elements in each sequence. + If the sequences match completely, <code class="computeroutput"><span class="identifier">mismatch</span></code> + returns their end iterators. One version uses <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">equal_to</span></code> + to do the comparison; the other lets the caller pass predicate to do the + comparisons. + </p> +<p> +</p> +<pre class="programlisting"><span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">InputIterator1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">InputIterator2</span><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">InputIterator1</span><span class="special">,</span> <span class="identifier">InputIterator2</span><span class="special">></span> +<span class="identifier">mismatch</span> <span class="special">(</span> <span class="identifier">InputIterator1</span> <span class="identifier">first1</span><span class="special">,</span> <span class="identifier">InputIterator1</span> <span class="identifier">last1</span><span class="special">,</span> + <span class="identifier">InputIterator2</span> <span class="identifier">first2</span><span class="special">,</span> <span class="identifier">InputIterator2</span> <span class="identifier">last2</span> <span class="special">);</span> + +<span class="keyword">template</span> <span class="special"><</span><span class="keyword">class</span> <span class="identifier">InputIterator1</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">InputIterator2</span><span class="special">,</span> <span class="keyword">class</span> <span class="identifier">BinaryPredicate</span><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">InputIterator1</span><span class="special">,</span> <span class="identifier">InputIterator2</span><span class="special">></span> +<span class="identifier">mismatch</span> <span class="special">(</span> <span class="identifier">InputIterator1</span> <span class="identifier">first1</span><span class="special">,</span> <span class="identifier">InputIterator1</span> <span class="identifier">last1</span><span class="special">,</span> + <span class="identifier">InputIterator2</span> <span class="identifier">first2</span><span class="special">,</span> <span class="identifier">InputIterator2</span> <span class="identifier">last2</span><span class="special">,</span> <span class="identifier">BinaryPredicate</span> <span class="identifier">pred</span> <span class="special">);</span> +</pre> +<p> + </p> +<h5> +<a name="the_boost_algorithm_library.CXX14.mismatch.h1"></a> + <span class="phrase"><a name="the_boost_algorithm_library.CXX14.mismatch.examples"></a></span><a class="link" href="mismatch.html#the_boost_algorithm_library.CXX14.mismatch.examples">Examples</a> + </h5> +<p> + Given the container <code class="computeroutput"><span class="identifier">c1</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>, + and <code class="computeroutput"><span class="identifier">c2</span></code> containing <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></code>, then +</p> +<pre class="programlisting"><span class="identifier">mismatch</span> <span class="special">(</span> <span class="identifier">c1</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c1</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">c2</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c2</span><span class="special">.</span><span class="identifier">end</span><span class="special">())</span> <span class="special">--></span> <span class="special"><</span><span class="identifier">c1</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c2</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()></span> <span class="comment">// first elements do not match</span> +<span class="identifier">mismatch</span> <span class="special">(</span> <span class="identifier">c1</span><span class="special">.</span><span class="identifier">begin</span><span class="special">()</span> <span class="special">+</span> <span class="number">1</span><span class="special">,</span> <span class="identifier">c1</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">c2</span><span class="special">.</span><span class="identifier">begin</span><span class="special">(),</span> <span class="identifier">c2</span><span class="special">.</span><span class="identifier">end</span><span class="special">())</span> <span class="special">--></span> <span class="special"><</span><span class="identifier">c1</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">c2</span><span class="special">.</span><span class="identifier">end</span> <span class="special">()></span> <span class="comment">// all elements of `c2` match</span> +<span class="identifier">mismatch</span> <span class="special">(</span> <span class="identifier">c1</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">c1</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">c2</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">c2</span><span class="special">.</span><span class="identifier">end</span><span class="special">())</span> <span class="special">--></span> <span class="special"><</span><span class="identifier">c1</span><span class="special">.</span><span class="identifier">end</span><span class="special">(),</span> <span class="identifier">c2</span><span class="special">.</span><span class="identifier">end</span><span class="special">()></span> <span class="comment">// empty sequences don't match at the end.</span> +</pre> +<p> + </p> +<h5> +<a name="the_boost_algorithm_library.CXX14.mismatch.h2"></a> + <span class="phrase"><a name="the_boost_algorithm_library.CXX14.mismatch.iterator_requirements"></a></span><a class="link" href="mismatch.html#the_boost_algorithm_library.CXX14.mismatch.iterator_requirements">Iterator + Requirements</a> + </h5> +<p> + <code class="computeroutput"><span class="identifier">mismatch</span></code> works on all iterators + except output iterators. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX14.mismatch.h3"></a> + <span class="phrase"><a name="the_boost_algorithm_library.CXX14.mismatch.complexity"></a></span><a class="link" href="mismatch.html#the_boost_algorithm_library.CXX14.mismatch.complexity">Complexity</a> + </h5> +<p> + Both of the variants of <code class="computeroutput"><span class="identifier">mismatch</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 equal at any + point, the routine will terminate immediately, without examining the rest + of the elements. + </p> +<h5> +<a name="the_boost_algorithm_library.CXX14.mismatch.h4"></a> + <span class="phrase"><a name="the_boost_algorithm_library.CXX14.mismatch.exception_safety"></a></span><a class="link" href="mismatch.html#the_boost_algorithm_library.CXX14.mismatch.exception_safety">Exception + Safety</a> + </h5> +<p> + Both of the variants of <code class="computeroutput"><span class="identifier">mismatch</span></code> + take their parameters by value 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.CXX14.mismatch.h5"></a> + <span class="phrase"><a name="the_boost_algorithm_library.CXX14.mismatch.notes"></a></span><a class="link" href="mismatch.html#the_boost_algorithm_library.CXX14.mismatch.notes">Notes</a> + </h5> +<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "> +<li class="listitem"> + If the sequences are equal (or both are empty), then mismatch returns + the end iterators of both sequences. + </li> +<li class="listitem"> + The four iterator version of the routine <code class="computeroutput"><span class="identifier">mismatch</span></code> + is part of the C++14 standard. When C++14 standard library implementations + become available, the implementation from the standard library should + be used. + </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/CXX14.html"><img src="../../../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../algorithm/CXX14.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/gather.html b/libs/algorithm/doc/html/the_boost_algorithm_library/Misc/gather.html new file mode 100644 index 0000000000..24b1639d99 --- /dev/null +++ b/libs/algorithm/doc/html/the_boost_algorithm_library/Misc/gather.html @@ -0,0 +1,149 @@ +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII"> +<title>gather</title> +<link rel="stylesheet" href="../../../../../../doc/src/boostbook.css" type="text/css"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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="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="../../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="hex.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.gather"></a><a class="link" href="gather.html" title="gather">gather</a> +</h3></div></div></div> +<p> + The header file 'boost/algorithm/gather.hpp' contains two variants of a single + algorithm, <code class="computeroutput"><span class="identifier">gather</span></code>. + </p> +<p> + <code class="computeroutput"><span class="identifier">gather</span><span class="special">()</span></code> + takes a collection of elements defined by a pair of iterators and moves the + ones satisfying a predicate to them to a position (called the pivot) within + the sequence. The algorithm is stable. The result is a pair of iterators + that contains the items that satisfy the predicate. + </p> +<h5> +<a name="the_boost_algorithm_library.Misc.gather.h0"></a> + <span class="phrase"><a name="the_boost_algorithm_library.Misc.gather.interface"></a></span><a class="link" href="gather.html#the_boost_algorithm_library.Misc.gather.interface">Interface</a> + </h5> +<p> + The function <code class="computeroutput"><span class="identifier">gather</span></code> returns + a <code class="computeroutput"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span></code> of iterators that denote the elements + that satisfy the predicate. + </p> +<p> + 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">BidirectionalIterator</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Pred</span><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">BidirectionalIterator</span><span class="special">,</span><span class="identifier">BidirectionalIterator</span><span class="special">></span> +<span class="identifier">gather</span> <span class="special">(</span> <span class="identifier">BidirectionalIterator</span> <span class="identifier">first</span><span class="special">,</span> <span class="identifier">BidirectionalIterator</span> <span class="identifier">last</span><span class="special">,</span> <span class="identifier">BidirectionalIterator</span> <span class="identifier">pivot</span><span class="special">,</span> <span class="identifier">Pred</span> <span class="identifier">pred</span> <span class="special">);</span> + +<span class="keyword">template</span> <span class="special"><</span><span class="keyword">typename</span> <span class="identifier">BidirectionalRange</span><span class="special">,</span> <span class="keyword">typename</span> <span class="identifier">Pred</span><span class="special">></span> +<span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</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">BidirectionalRange</span><span class="special">>::</span><span class="identifier">type</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">BidirectionalRange</span><span class="special">>::</span><span class="identifier">type</span><span class="special">></span> +<span class="identifier">gather</span> <span class="special">(</span> <span class="keyword">const</span> <span class="identifier">BidirectionalRange</span> <span class="special">&</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">BidirectionalRange</span><span class="special">>::</span><span class="identifier">type</span> <span class="identifier">pivot</span><span class="special">,</span> <span class="identifier">Pred</span> <span class="identifier">pred</span> <span class="special">);</span> + +<span class="special">}}</span> +</pre> +<p> + </p> +<h5> +<a name="the_boost_algorithm_library.Misc.gather.h1"></a> + <span class="phrase"><a name="the_boost_algorithm_library.Misc.gather.examples"></a></span><a class="link" href="gather.html#the_boost_algorithm_library.Misc.gather.examples">Examples</a> + </h5> +<p> + Given an sequence containing: +</p> +<pre class="programlisting"><span class="number">0</span> <span class="number">1</span> <span class="number">2</span> <span class="number">3</span> <span class="number">4</span> <span class="number">5</span> <span class="number">6</span> <span class="number">7</span> <span class="number">8</span> <span class="number">9</span> +</pre> +<p> + </p> +<p> + a call to gather ( arr, arr + 10, arr + 4, IsEven ) will result in: + </p> +<p> +</p> +<pre class="programlisting"><span class="number">1</span> <span class="number">3</span> <span class="number">0</span> <span class="number">2</span> <span class="number">4</span> <span class="number">6</span> <span class="number">8</span> <span class="number">5</span> <span class="number">7</span> <span class="number">9</span> + <span class="special">|---|-----|</span> + <span class="identifier">first</span> <span class="special">|</span> <span class="identifier">second</span> + <span class="identifier">pivot</span> +</pre> +<p> + where <code class="computeroutput"><span class="identifier">first</span></code> and <code class="computeroutput"><span class="identifier">second</span></code> are the fields of the pair that + is returned by the call. + </p> +<h5> +<a name="the_boost_algorithm_library.Misc.gather.h2"></a> + <span class="phrase"><a name="the_boost_algorithm_library.Misc.gather.iterator_requirements"></a></span><a class="link" href="gather.html#the_boost_algorithm_library.Misc.gather.iterator_requirements">Iterator + Requirements</a> + </h5> +<p> + <code class="computeroutput"><span class="identifier">gather</span></code> work on bidirectional + iterators or better. This requirement comes from the usage of <code class="computeroutput"><span class="identifier">stable_partition</span></code>, which requires bidirectional + iterators. Some standard libraries (libstdc++ and libc++, for example) have + implementations of <code class="computeroutput"><span class="identifier">stable_partition</span></code> + that work with forward iterators. If that is the case, then <code class="computeroutput"><span class="identifier">gather</span></code> will work with forward iterators + as well. + </p> +<h5> +<a name="the_boost_algorithm_library.Misc.gather.h3"></a> + <span class="phrase"><a name="the_boost_algorithm_library.Misc.gather.storage_requirements"></a></span><a class="link" href="gather.html#the_boost_algorithm_library.Misc.gather.storage_requirements">Storage + Requirements</a> + </h5> +<p> + <code class="computeroutput"><span class="identifier">gather</span></code> uses <code class="computeroutput"><span class="identifier">stable_partition</span></code>, which will attempt to + allocate temporary memory, but will work in-situ if there is none available. + </p> +<h5> +<a name="the_boost_algorithm_library.Misc.gather.h4"></a> + <span class="phrase"><a name="the_boost_algorithm_library.Misc.gather.complexity"></a></span><a class="link" href="gather.html#the_boost_algorithm_library.Misc.gather.complexity">Complexity</a> + </h5> +<p> + If there is sufficient memory available, the run time is linear: <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span><span class="special">)</span></code> + </p> +<p> + If there is not any memory available, then the run time is <code class="computeroutput"><span class="identifier">O</span><span class="special">(</span><span class="identifier">N</span> + <span class="identifier">log</span> <span class="identifier">N</span><span class="special">)</span></code>. + </p> +<h5> +<a name="the_boost_algorithm_library.Misc.gather.h5"></a> + <span class="phrase"><a name="the_boost_algorithm_library.Misc.gather.exception_safety"></a></span><a class="link" href="gather.html#the_boost_algorithm_library.Misc.gather.exception_safety">Exception + Safety</a> + </h5> +<h5> +<a name="the_boost_algorithm_library.Misc.gather.h6"></a> + <span class="phrase"><a name="the_boost_algorithm_library.Misc.gather.notes"></a></span><a class="link" href="gather.html#the_boost_algorithm_library.Misc.gather.notes">Notes</a> + </h5> +</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="hex.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 index 61e4e43027..b40ad87e98 100644 --- a/libs/algorithm/doc/html/the_boost_algorithm_library/Misc/hex.html +++ b/libs/algorithm/doc/html/the_boost_algorithm_library/Misc/hex.html @@ -3,10 +3,10 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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="prev" href="gather.html" title="gather"> <link rel="next" href="../../algorithm/reference.html" title="Reference"> </head> <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"> @@ -20,7 +20,7 @@ </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> +<a accesskey="p" href="gather.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"> @@ -41,7 +41,7 @@ </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> + <span class="phrase"><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 @@ -96,7 +96,7 @@ </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 + <span class="phrase"><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> @@ -124,7 +124,7 @@ </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> + <span class="phrase"><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 @@ -153,7 +153,7 @@ </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 + <span class="phrase"><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> @@ -162,7 +162,7 @@ </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> + <span class="phrase"><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> @@ -172,7 +172,7 @@ </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 + <span class="phrase"><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> @@ -186,9 +186,9 @@ </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> + <span class="phrase"><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"> +<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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> @@ -203,7 +203,7 @@ </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> +<a accesskey="p" href="gather.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 index 3bbabd6d40..249a36e21f 100644 --- a/libs/algorithm/doc/html/the_boost_algorithm_library/Searching/BoyerMooreHorspool.html +++ b/libs/algorithm/doc/html/the_boost_algorithm_library/Searching/BoyerMooreHorspool.html @@ -3,7 +3,7 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> @@ -29,11 +29,11 @@ </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> + <span class="phrase"><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. + The header file 'boyer_moore_horspool.hpp' contains 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 @@ -47,20 +47,19 @@ </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> + <span class="phrase"><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. + For flexibility, the Boyer-Moore-Horspool algorithm 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: @@ -103,7 +102,7 @@ </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> + <span class="phrase"><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 @@ -118,7 +117,7 @@ </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 + <span class="phrase"><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> @@ -128,7 +127,7 @@ </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> + <span class="phrase"><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> @@ -139,7 +138,7 @@ </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 + <span class="phrase"><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> @@ -150,9 +149,9 @@ </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> + <span class="phrase"><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"> +<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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 @@ -165,7 +164,7 @@ </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 + <span class="phrase"><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> 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 index 8ce2c8fbc9..81ec65cab4 100644 --- a/libs/algorithm/doc/html/the_boost_algorithm_library/Searching/KnuthMorrisPratt.html +++ b/libs/algorithm/doc/html/the_boost_algorithm_library/Searching/KnuthMorrisPratt.html @@ -3,7 +3,7 @@ <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"> +<meta name="generator" content="DocBook XSL Stylesheets V1.78.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"> @@ -29,12 +29,146 @@ </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> + <span class="phrase"><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. + The header file 'knuth_morris_pratt.hpp' contains an implementation of the + Knuth-Morris-Pratt algorithm for searching sequences of values. </p> +<p> + The basic premise of the Knuth-Morris-Pratt algorithm is that when a mismatch + occurs, there is information in the pattern being searched for that can be + used to determine where the next match could begin, enabling the skipping + of some elements of the corpus that have already been examined. + </p> +<p> + It does this by building a table from the pattern being searched for, with + one entry for each element in the pattern. + </p> +<p> + The algorithm was conceived in 1974 by Donald Knuth and Vaughan Pratt, and + independently by James H. Morris. The three published it jointly in 1977 + in the SIAM Journal on Computing <a href="http://citeseer.ist.psu.edu/context/23820/0" target="_top">http://citeseer.ist.psu.edu/context/23820/0</a> + </p> +<p> + However, the Knuth-Morris-Pratt 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.KnuthMorrisPratt.h1"></a> + <span class="phrase"><a name="the_boost_algorithm_library.Searching.KnuthMorrisPratt.interface"></a></span><a class="link" href="KnuthMorrisPratt.html#the_boost_algorithm_library.Searching.KnuthMorrisPratt.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 Knuth-Morris-Pratt algorithm has two interfaces; an + object-based interface and a procedural one. The object-based interface builds + the table 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">knuth_morris_pratt</span> <span class="special">{</span> +<span class="keyword">public</span><span class="special">:</span> + <span class="identifier">knuth_morris_pratt</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">knuth_morris_pratt</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">knuth_morris_pratt_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.KnuthMorrisPratt.h2"></a> + <span class="phrase"><a name="the_boost_algorithm_library.Searching.KnuthMorrisPratt.performance"></a></span><a class="link" href="KnuthMorrisPratt.html#the_boost_algorithm_library.Searching.KnuthMorrisPratt.performance">Performance</a> + </h5> +<p> + The execution time of the Knuth-Morris-Pratt algorithm is linear in the size + of the string being searched. 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.KnuthMorrisPratt.h3"></a> + <span class="phrase"><a name="the_boost_algorithm_library.Searching.KnuthMorrisPratt.memory_use"></a></span><a class="link" href="KnuthMorrisPratt.html#the_boost_algorithm_library.Searching.KnuthMorrisPratt.memory_use">Memory + Use</a> + </h5> +<p> + The algorithm an that contains one entry for each element the pattern, plus + one extra. So, when searching for a 1026 byte string, the table will have + 1027 entries. + </p> +<h5> +<a name="the_boost_algorithm_library.Searching.KnuthMorrisPratt.h4"></a> + <span class="phrase"><a name="the_boost_algorithm_library.Searching.KnuthMorrisPratt.complexity"></a></span><a class="link" href="KnuthMorrisPratt.html#the_boost_algorithm_library.Searching.KnuthMorrisPratt.complexity">Complexity</a> + </h5> +<p> + The worst-case performance is <span class="emphasis"><em>O(2n)</em></span>, where <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. + </p> +<h5> +<a name="the_boost_algorithm_library.Searching.KnuthMorrisPratt.h5"></a> + <span class="phrase"><a name="the_boost_algorithm_library.Searching.KnuthMorrisPratt.exception_safety"></a></span><a class="link" href="KnuthMorrisPratt.html#the_boost_algorithm_library.Searching.KnuthMorrisPratt.exception_safety">Exception + Safety</a> + </h5> +<p> + Both the object-oriented and procedural versions of the Knuth-Morris-Pratt + 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.KnuthMorrisPratt.h6"></a> + <span class="phrase"><a name="the_boost_algorithm_library.Searching.KnuthMorrisPratt.notes"></a></span><a class="link" href="KnuthMorrisPratt.html#the_boost_algorithm_library.Searching.KnuthMorrisPratt.notes">Notes</a> + </h5> +<div class="itemizedlist"><ul class="itemizedlist" style="list-style-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 Knuth-Morris-Pratt algorithm requires random-access iterators for + both the pattern and the corpus. It should be possible to write this + to use bidirectional iterators (or possibly even forward ones), but this + implementation does not do that. + </li> +</ul></div> </div> <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr> <td align="left"></td> diff --git a/libs/algorithm/doc/is_partitioned.qbk b/libs/algorithm/doc/is_partitioned.qbk index 3c7075b735..16dce6a539 100644 --- a/libs/algorithm/doc/is_partitioned.qbk +++ b/libs/algorithm/doc/is_partitioned.qbk @@ -18,7 +18,7 @@ The routine `is_partitioned` takes a sequence and a predicate. It returns true i [heading interface] -The function `is_partitioned` 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. +The function `is_partitioned` returns true if 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. `` template<typename InputIterator, typename Predicate> diff --git a/libs/algorithm/doc/is_permutation.qbk b/libs/algorithm/doc/is_permutation.qbk new file mode 100644 index 0000000000..267bfabc8a --- /dev/null +++ b/libs/algorithm/doc/is_permutation.qbk @@ -0,0 +1,87 @@ +[/ File is_permutation.qbk] + +[section:is_permutation is_permutation ] + +[/license +Copyright (c) 2010-2012 Marshall Clow + +Distributed under the Boost Software License, Version 1.0. +(See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +] + +The header file 'is_permutation.hpp' contains six variants of a single algorithm, `is_permutation`. The algorithm tests to see if one sequence is a permutation of a second one; in other words, it contains all the same members, possibly in a different order. + +The routine `is_permutation` takes two sequences and an (optional) predicate. It returns true if the two sequences contain the same members. If it is passed a predicate, it uses the predicate to compare the elements of the sequence to see if they are the same. + +`is_permutation` come in three forms. The first one takes two iterators to define the first range, and the starting iterator of the second range. The second form takes a two iterators to define the first range and two more to define the second range. The third form takes a single range parameter, and uses Boost.Range to traverse it. + + +[heading Interface] + +The function `is_permutation` returns true if the two input sequences contain the same elements. There are six versions; two take three iterators, two take four iterators, and the other two take two ranges. + +In general, you should prefer the four iterator versions over the three iterator ones. The three iterator version has to "create" the fourth iterator internally by calling `std::advance(first2, std::distance(first1,last1))`, and if the second sequence is shorter than the first, that's undefined behavior. + +`` +template< class ForwardIterator1, class ForwardIterator2 > +bool is_permutation ( ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2 ); + +template< class ForwardIterator1, class ForwardIterator2, class BinaryPredicate > +bool is_permutation ( ForwardIterator1 first1, ForwardIterator1 last1, + ForwardIterator2 first2, BinaryPredicate p ); + + +template< class ForwardIterator1, class ForwardIterator2 > +bool is_permutation ( ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2 ); + +template< class ForwardIterator1, class ForwardIterator2, class BinaryPredicate > +bool is_permutation ( ForwardIterator1 first1, ForwardIterator1 last1, + ForwardIterator2 first2, ForwardIterator2 last2, + BinaryPredicate p ); + +template <typename Range, typename ForwardIterator> +bool is_permutation ( const Range &r, ForwardIterator first2 ); + +template <typename Range, typename ForwardIterator, typename BinaryPredicate> +bool is_permutation ( const Range &r, ForwardIterator first2, BinaryPredicate pred ); + +`` + +[heading Examples] + +Given the container `c1` containing `{ 0, 1, 2, 3, 14, 15 }`, and `c2` containing `{ 15, 14, 3, 1, 2 }`, then +`` +is_permutation ( c1.begin(), c1.end (), c2.begin(), c2.end ()) --> false +is_permutation ( c1.begin() + 1, c1.end (), c2.begin(), c2.end ()) --> true + +is_permutation ( c1.end (), c1.end (), c2.end(), c2.end ()) --> true // all empty ranges are permutations of each other +`` + +[heading Iterator Requirements] + +`is_permutation` works on forward iterators or better. + +[heading Complexity] + +All of the variants of `is_permutation` run in ['O(N^2)] (quadratic) time; that is, they compare against each element in the list (potentially) N times. If passed random-access iterators, `is_permutation` can return quickly if the sequences are different sizes. + +[heading Exception Safety] + +All of the variants of `is_permutation` take their parameters by value, and do not depend upon any global state. Therefore, all the routines in this file provide the strong exception guarantee. + +[heading Notes] + +* The three iterator versions of the routine `is_permutation` are part of the C++11 standard. When compiled using a C++11 implementation, the implementation from the standard library will be used. + +* The four iterator versions of the routine `is_permutation` are part of the proposed C++14 standard. When C++14 standard libraries become available, the implementation should be changed to use the implementation from the standard library (if available). + +* `is_permutation` returns true when passed a pair of empty ranges, no matter what predicate is passed to test with. + +[endsect] + +[/ File is_permutation.qbk +Copyright 2011 Marshall Clow +Distributed under the Boost Software License, Version 1.0. +(See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt). +] + diff --git a/libs/algorithm/doc/knuth_morris_pratt.qbk b/libs/algorithm/doc/knuth_morris_pratt.qbk index dfe717e54d..7b184cfb74 100644 --- a/libs/algorithm/doc/knuth_morris_pratt.qbk +++ b/libs/algorithm/doc/knuth_morris_pratt.qbk @@ -14,8 +14,69 @@ http://www.boost.org/LICENSE_1_0.txt) [heading Overview] -The header file 'knuth_morris_pratt.hpp' contains an an implementation of the Knuth-Morris-Pratt algorithm for searching sequences of values. +The header file 'knuth_morris_pratt.hpp' contains an implementation of the Knuth-Morris-Pratt algorithm for searching sequences of values. +The basic premise of the Knuth-Morris-Pratt algorithm is that when a mismatch occurs, there is information in the pattern being searched for that can be used to determine where the next match could begin, enabling the skipping of some elements of the corpus that have already been examined. + +It does this by building a table from the pattern being searched for, with one entry for each element in the pattern. + +The algorithm was conceived in 1974 by Donald Knuth and Vaughan Pratt, and independently by James H. Morris. The three published it jointly in 1977 in the SIAM Journal on Computing [@http://citeseer.ist.psu.edu/context/23820/0] + +However, the Knuth-Morris-Pratt algorithm cannot be used with comparison predicates like `std::search`. + +[heading Interface] + +Nomenclature: I refer to the sequence being searched for as the "pattern", and the sequence being searched in as the "corpus". + +For flexibility, the Knuth-Morris-Pratt algorithm has two interfaces; an object-based interface and a procedural one. The object-based interface builds the table 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. + +Here is the object interface: +`` +template <typename patIter> +class knuth_morris_pratt { +public: + knuth_morris_pratt ( patIter first, patIter last ); + ~knuth_morris_pratt (); + + template <typename corpusIter> + corpusIter operator () ( corpusIter corpus_first, corpusIter corpus_last ); + }; +`` + +and here is the corresponding procedural interface: + +`` +template <typename patIter, typename corpusIter> +corpusIter knuth_morris_pratt_search ( + corpusIter corpus_first, corpusIter corpus_last, + patIter pat_first, patIter pat_last ); +`` + +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, `patIter::value_type` and `curpusIter::value_type` need to be the same type. + +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 (`corpus_last`). + +[heading Performance] + +The execution time of the Knuth-Morris-Pratt algorithm is linear in the size of the string being searched. 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. + +[heading Memory Use] + +The algorithm an that contains one entry for each element the pattern, plus one extra. So, when searching for a 1026 byte string, the table will have 1027 entries. + +[heading Complexity] + +The worst-case performance is ['O(2n)], where ['n] is the length of the corpus. The average time is ['O(n)]. The best case performance is sub-linear. + +[heading Exception Safety] + +Both the object-oriented and procedural versions of the Knuth-Morris-Pratt 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. + +[heading Notes] + +* 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. + +* The Knuth-Morris-Pratt algorithm requires random-access iterators for both the pattern and the corpus. It should be possible to write this to use bidirectional iterators (or possibly even forward ones), but this implementation does not do that. [endsect] diff --git a/libs/algorithm/doc/mismatch.qbk b/libs/algorithm/doc/mismatch.qbk new file mode 100644 index 0000000000..cf74293efd --- /dev/null +++ b/libs/algorithm/doc/mismatch.qbk @@ -0,0 +1,82 @@ +[/ File mismatch.qbk] + +[section:mismatch mismatch ] + +[/license +Copyright (c) 2013 Marshall Clow + +Distributed under the Boost Software License, Version 1.0. +(See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) +] + +The header file 'mismatch.hpp' contains two variants of a the stl algorithm `mismatch`. The algorithm finds the first point in two sequences where they do not match. + +Before (the proposed) C++14 the algorithm `std::mismatch` took three iterators and an optional comparison predicate. The first two iterators `[first1, last1)` defined a sequence, and the second one `first2` defined the start of the second sequence. The second sequence was assumed to be the same length as the first. + +In C++14, two new variants were introduced, taking four iterators and an optional comparison predicate. The four iterators define two sequences `[first1, last1)` and `[first2, last2)` explicitly, rather than defining the second one implicitly. This leads to correct answers in more cases (and avoid undefined behavior in others). + +Consider the two sequences: +``` + auto seq1 = { 0, 1, 2 }; + auto seq2 = { 0, 1, 2, 3, 4 }; + + std::mismatch ( seq1.begin (), seq1.end (), seq2.begin ()); // <3, 3> + std::mismatch ( seq2.begin (), seq2.end (), seq1.begin ()); // Undefined behavior + std::mismatch ( seq1.begin (), seq1.end (), seq2.begin (), seq2.end ()); // <3, 3> +``` + +The first N entries in `seq2` are the same as the entries in `seq1` - but that's not all that's in `seq2`. In the second case, the algorithm will read past the end of `seq1`, resulting in undefined behavior (large earthquake, incorrect results, pregnant cat, etc). + +However, if the two sequences are specified completely, it's clear that where the mismatch occurs. + +[heading interface] + +The function `mismatch` returns a pair of iterators which denote the first mismatching elements in each sequence. If the sequences match completely, `mismatch` returns their end iterators. One version uses `std::equal_to` to do the comparison; the other lets the caller pass predicate to do the comparisons. + +`` +template <class InputIterator1, class InputIterator2> +std::pair<InputIterator1, InputIterator2> +mismatch ( InputIterator1 first1, InputIterator1 last1, + InputIterator2 first2, InputIterator2 last2 ); + +template <class InputIterator1, class InputIterator2, class BinaryPredicate> +std::pair<InputIterator1, InputIterator2> +mismatch ( InputIterator1 first1, InputIterator1 last1, + InputIterator2 first2, InputIterator2 last2, BinaryPredicate pred ); +`` + +[heading Examples] + +Given the container `c1` containing `{ 0, 1, 2, 3, 14, 15 }`, and `c2` containing `{ 1, 2, 3 }`, then +`` +mismatch ( c1.begin(), c1.end(), c2.begin(), c2.end()) --> <c1.begin(), c2.begin()> // first elements do not match +mismatch ( c1.begin() + 1, c1.begin() + 4, c2.begin(), c2.end()) --> <c1.begin() + 4, c2.end ()> // all elements of `c2` match +mismatch ( c1.end(), c1.end(), c2.end(), c2.end()) --> <c1.end(), c2.end()> // empty sequences don't match at the end. +`` + +[heading Iterator Requirements] + +`mismatch` works on all iterators except output iterators. + +[heading Complexity] + +Both of the variants of `mismatch` run in ['O(N)] (linear) time; that is, they compare against each element in the list once. If the sequence is found to be equal at any point, the routine will terminate immediately, without examining the rest of the elements. + +[heading Exception Safety] + +Both of the variants of `mismatch` take their parameters by value and do not depend upon any global state. Therefore, all the routines in this file provide the strong exception guarantee. + +[heading Notes] + +* If the sequences are equal (or both are empty), then mismatch returns the end iterators of both sequences. + +* The four iterator version of the routine `mismatch` is part of the C++14 standard. When C++14 standard library implementations become available, the implementation from the standard library should be used. + +[endsect] + +[/ File mismatch.qbk +Copyright 2011 Marshall Clow +Distributed under the Boost Software License, Version 1.0. +(See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt). +] + diff --git a/libs/algorithm/doc/one_of.qbk b/libs/algorithm/doc/one_of.qbk index 4170407e59..e5d873be40 100644 --- a/libs/algorithm/doc/one_of.qbk +++ b/libs/algorithm/doc/one_of.qbk @@ -75,7 +75,7 @@ All of the variants of `one_of` and `one_of_equal` take their parameters by valu * `one_of` and `one_of_equal` both return false for empty ranges, no matter what is passed to test against. -* The second parameter to `one_of_value` is a template parameter, rather than deduced from the first parameter (`std::iterator_traits<InputIterator>::value_type`) 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 `*iter == val` evaluates to true (where `iter` is an iterator to each element in the sequence) +* The second parameter to `one_of_equal` is a template parameter, rather than deduced from the first parameter (`std::iterator_traits<InputIterator>::value_type`) 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 `*iter == val` evaluates to true (where `iter` is an iterator to each element in the sequence) [endsect] diff --git a/libs/algorithm/doc/ordered-hpp.qbk b/libs/algorithm/doc/ordered-hpp.qbk index 687066a50f..9e860d4233 100644 --- a/libs/algorithm/doc/ordered-hpp.qbk +++ b/libs/algorithm/doc/ordered-hpp.qbk @@ -19,11 +19,11 @@ The function `is_sorted(sequence)` determines whether or not a sequence is compl `` namespace boost { namespace algorithm { - template <typename Iterator, typename Pred> - bool is_sorted ( Iterator first, Iterator last, Pred p ); + template <typename ForwardIterator, typename Pred> + bool is_sorted ( ForwardIterator first, ForwardIterator last, Pred p ); - template <typename Iterator> - bool is_sorted ( Iterator first, Iterator last ); + template <typename ForwardIterator> + bool is_sorted ( ForwardIterator first, ForwardIterator last ); template <typename Range, typename Pred> @@ -34,7 +34,7 @@ namespace boost { namespace algorithm { }} `` -Iterator requirements: The `is_sorted` functions will work on all kinds of iterators (except output iterators). +Iterator requirements: The `is_sorted` functions will work forward iterators or better. [heading is_sorted_until] @@ -73,7 +73,7 @@ Given the sequence `{ 1, 2, 3, 4, 5, 9 }`, `is_sorted_until ( beg, end, std::l 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. -To test if a sequence is increasing (each element at least as large as the preceeding one): +To test if a sequence is increasing (each element at least as large as the preceding one): `` namespace boost { namespace algorithm { template <typename Iterator> @@ -84,34 +84,34 @@ namespace boost { namespace algorithm { }} `` -To test if a sequence is decreasing (each element no larger than the preceeding one): +To test if a sequence is decreasing (each element no larger than the preceding one): `` namespace boost { namespace algorithm { - template <typename Iterator> - bool is_decreasing ( Iterator first, Iterator last ); + template <typename ForwardIterator> + bool is_decreasing ( ForwardIterator first, ForwardIterator last ); template <typename R> bool is_decreasing ( const R &range ); }} `` -To test if a sequence is strictly increasing (each element larger than the preceeding one): +To test if a sequence is strictly increasing (each element larger than the preceding one): `` namespace boost { namespace algorithm { - template <typename Iterator> - bool is_strictly_increasing ( Iterator first, Iterator last ); + template <typename ForwardIterator> + bool is_strictly_increasing ( ForwardIterator first, ForwardIterator last ); template <typename R> bool is_strictly_increasing ( const R &range ); }} `` -To test if a sequence is strictly decreasing (each element smaller than the preceeding one): +To test if a sequence is strictly decreasing (each element smaller than the preceding one): `` namespace boost { namespace algorithm { - template <typename Iterator> - bool is_strictly_decreasing ( Iterator first, Iterator last ); + template <typename ForwardIterator> + bool is_strictly_decreasing ( ForwardIterator first, ForwardIterator last ); template <typename R> bool is_strictly_decreasing ( const R &range ); diff --git a/libs/algorithm/minmax/index.html b/libs/algorithm/minmax/index.html index af81021be8..72a5116316 100644 --- a/libs/algorithm/minmax/index.html +++ b/libs/algorithm/minmax/index.html @@ -350,7 +350,7 @@ separation into two header files.</p> std::max.</b></h4> <p>I am aware of the problems with std::min and std::max, and all the debate that has been going on (please consult -<a href="http://www.cuj.com/documents/s=7996/cujcexp1904alexandr/alexandr.htm">Alexandrescu's paper</a> and the links therein). But I don't see the purpose of this +<a href="#Alexandrescu">Alexandrescu's paper</a> and the links therein). But I don't see the purpose of this library as fixing something that is part of the C++ standard. I humbly think it's beyond the scope of this library. Rather, I am following the way of the standard in simply providing one more function @@ -485,7 +485,12 @@ to keep it like this. <a name="acks"> <h3> Acknowledgements</h3> -My students in CS903 (Polytechnic Univ., <a href="http://photon.poly.edu/~hbr/cs903/">http://photon.poly.edu/~hbr/cs903/</a>) + +<a name="Alexandrescu"> +<a href="http://www.drdobbs.com/generic-min-and-max-redivivus/184403774">Generic: Min and Max Redivivus, by Andrei Alexandrescu</a> +Dr. Dobbs, April 2001 + +<p>My students in CS903 (Polytechnic Univ., <a href="http://photon.poly.edu/~hbr/cs903/">http://photon.poly.edu/~hbr/cs903/</a>) who had <tt>minmax_element</tt> as an assignment helped clarify the issues, and also come up with the optimum number of comparisons for <tt>first_min_last_max_element</tt>. The identification of the issue surrounding <tt>max_element</tt> is solely @@ -516,7 +521,7 @@ Comparable</a></tt>, <tt><a href="http://www.sgi.com/tech/stl/nth_element.html">nth_element</a></tt> . <hr SIZE="6"> -<br>Last modified 2004-07-01 +<br>Last modified 2012-12-10 <p><font face="Arial,Helvetica"><font size=-1>© Copyright Hervé Brönnimann, Polytechnic University, 2002--2004. Use, modification, and distribution is subject to the Boost Software diff --git a/libs/algorithm/minmax/test/Jamfile.v2 b/libs/algorithm/minmax/test/Jamfile.v2 index 24ae6129ba..fcfba8ae11 100644 --- a/libs/algorithm/minmax/test/Jamfile.v2 +++ b/libs/algorithm/minmax/test/Jamfile.v2 @@ -9,11 +9,16 @@ import testing ; +alias unit_test_framework + : # sources + /boost//unit_test_framework + ; + { test-suite algorithm/minmax: - : [ run minmax_element_test.cpp + : [ run minmax_element_test.cpp unit_test_framework : : : : minmax_element ] - [ run minmax_test.cpp + [ run minmax_test.cpp unit_test_framework : : : : minmax ] ; } diff --git a/libs/algorithm/minmax/test/minmax_element_test.cpp b/libs/algorithm/minmax/test/minmax_element_test.cpp index 8758f12e37..b8c02f5490 100644 --- a/libs/algorithm/minmax/test/minmax_element_test.cpp +++ b/libs/algorithm/minmax/test/minmax_element_test.cpp @@ -15,9 +15,11 @@ #include <boost/config.hpp> /* prevents some nasty warns in MSVC */ #include <boost/algorithm/minmax_element.hpp> -#include <boost/test/included/test_exec_monitor.hpp> #include <boost/iterator/reverse_iterator.hpp> +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> + class custom { int m_x; friend bool operator<(custom const& x, custom const& y); @@ -225,17 +227,14 @@ void test(int n BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(Value)) test_range(first, last, n); } -int test_main( int argc, char* argv[] ) +BOOST_AUTO_TEST_CASE( test_main ) { #ifndef BOOST_NO_STDC_NAMESPACE using std::atoi; #endif int n = 100; - if (argc > 1) n = atoi(argv[1]); test<int>(n); test<custom>(n); - - return 0; } diff --git a/libs/algorithm/minmax/test/minmax_test.cpp b/libs/algorithm/minmax/test/minmax_test.cpp index a2570e9cc2..151b096840 100644 --- a/libs/algorithm/minmax/test/minmax_test.cpp +++ b/libs/algorithm/minmax/test/minmax_test.cpp @@ -8,7 +8,9 @@ #include <boost/config.hpp> #include <boost/algorithm/minmax.hpp> -#include <boost/test/included/test_exec_monitor.hpp> + +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> class custom { int m_x; @@ -76,10 +78,8 @@ void test(BOOST_EXPLICIT_TEMPLATE_TYPE(Value)) BOOST_CHECK_EQUAL( counter, 1); } -int test_main( int , char* [] ) +BOOST_AUTO_TEST_CASE( test_main ) { test<int>(); // ("builtin"); test<custom>(); // ("custom "); - - return 0; } diff --git a/libs/algorithm/string/doc/concept.xml b/libs/algorithm/string/doc/concept.xml index b567975351..8e9c4a8779 100644 --- a/libs/algorithm/string/doc/concept.xml +++ b/libs/algorithm/string/doc/concept.xml @@ -7,7 +7,7 @@ (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) --> -<section id="string_algo.concept" last-revision="$Date: 2008-06-19 05:07:24 -0700 (Thu, 19 Jun 2008) $"> +<section id="string_algo.concept" last-revision="$Date$"> <title>Concepts</title> <using-namespace name="boost"/> @@ -162,8 +162,8 @@ boost::iterator_range<std::string> simple_finder( <para> Similarly to finders, formatters generalize format operations. When a finder is used to - select a part of the input, formatter takes this selection and performs some formating - on it. Algorithms can abstract from formating using a formatter. + select a part of the input, formatter takes this selection and performs some formatting + on it. Algorithms can abstract from formatting using a formatter. </para> <para> <emphasis role="bold">Examples</emphasis> @@ -171,7 +171,7 @@ boost::iterator_range<std::string> simple_finder( <para> <itemizedlist> <listitem> - Formatter implemented as a class. This Formatter does not perform any formating and + Formatter implemented as a class. This Formatter does not perform any formatting and returns the match, repackaged. <code>operator()</code> is templated, so that the Formatter can be used on any Finder type. diff --git a/libs/algorithm/string/doc/credits.xml b/libs/algorithm/string/doc/credits.xml index c8959e9ab2..6acdf74273 100644 --- a/libs/algorithm/string/doc/credits.xml +++ b/libs/algorithm/string/doc/credits.xml @@ -7,7 +7,7 @@ (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) --> -<section id="string_algo.credits" last-revision="$Date: 2008-02-27 12:00:24 -0800 (Wed, 27 Feb 2008) $"> +<section id="string_algo.credits" last-revision="$Date$"> <title>Credits</title> <section id="string_algo.ack"> <title>Acknowledgments</title> diff --git a/libs/algorithm/string/doc/design.xml b/libs/algorithm/string/doc/design.xml index 2d614a563b..e6db25d1c5 100644 --- a/libs/algorithm/string/doc/design.xml +++ b/libs/algorithm/string/doc/design.xml @@ -8,7 +8,7 @@ (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) --> -<section id="string_algo.design" last-revision="$Date: 2010-04-21 16:00:35 -0700 (Wed, 21 Apr 2010) $"> +<section id="string_algo.design" last-revision="$Date$"> <title>Design Topics</title> <using-namespace name="boost"/> diff --git a/libs/algorithm/string/doc/environment.xml b/libs/algorithm/string/doc/environment.xml index 3b65ce99d3..4fef5d96db 100644 --- a/libs/algorithm/string/doc/environment.xml +++ b/libs/algorithm/string/doc/environment.xml @@ -7,7 +7,7 @@ (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) --> -<section id="string_algo.env" last-revision="$Date: 2008-02-27 12:00:24 -0800 (Wed, 27 Feb 2008) $"> +<section id="string_algo.env" last-revision="$Date$"> <title>Environment</title> <section> <title>Build</title> diff --git a/libs/algorithm/string/doc/intro.xml b/libs/algorithm/string/doc/intro.xml index b2afe661c6..47a7e18f17 100644 --- a/libs/algorithm/string/doc/intro.xml +++ b/libs/algorithm/string/doc/intro.xml @@ -8,7 +8,7 @@ (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) --> -<section id="string_algo.intro" last-revision="$Date: 2008-02-27 12:00:24 -0800 (Wed, 27 Feb 2008) $"> +<section id="string_algo.intro" last-revision="$Date$"> <title>Introduction</title> <para> diff --git a/libs/algorithm/string/doc/quickref.xml b/libs/algorithm/string/doc/quickref.xml index 8f495bc015..fe267e718f 100644 --- a/libs/algorithm/string/doc/quickref.xml +++ b/libs/algorithm/string/doc/quickref.xml @@ -7,7 +7,7 @@ (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) --> -<section id="string_algo.quickref" last-revision="$Date: 2012-01-15 08:49:25 -0800 (Sun, 15 Jan 2012) $"> +<section id="string_algo.quickref" last-revision="$Date$"> <title>Quick Reference</title> <using-namespace name="boost"/> diff --git a/libs/algorithm/string/doc/rationale.xml b/libs/algorithm/string/doc/rationale.xml index fe4e8f1c36..e2d1ab11ae 100644 --- a/libs/algorithm/string/doc/rationale.xml +++ b/libs/algorithm/string/doc/rationale.xml @@ -7,7 +7,7 @@ (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) --> -<section id="string_algo.rationale" last-revision="$Date: 2008-02-27 12:00:24 -0800 (Wed, 27 Feb 2008) $"> +<section id="string_algo.rationale" last-revision="$Date$"> <title>Rationale</title> <using-namespace name="boost"/> diff --git a/libs/algorithm/string/doc/release_notes.xml b/libs/algorithm/string/doc/release_notes.xml index b4109a10ed..dd412d5555 100644 --- a/libs/algorithm/string/doc/release_notes.xml +++ b/libs/algorithm/string/doc/release_notes.xml @@ -7,7 +7,7 @@ (See accompanying file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt) --> -<section id="string_algo.release_notes" last-revision="$Date: 2008-02-27 12:00:24 -0800 (Wed, 27 Feb 2008) $"> +<section id="string_algo.release_notes" last-revision="$Date$"> <using-namespace name="boost"/> <using-namespace name="boost::algorithm"/> @@ -36,7 +36,7 @@ New comparison predicates <code>is_less</code>, <code>is_not_greater</code> </listitem> <listitem> - Negative indexes support (like Perl) in various algorihtms + Negative indexes support (like Perl) in various algorithms (<code>*_head/tail</code>, <code>*_nth</code>). </listitem> </itemizedlist> diff --git a/libs/algorithm/string/doc/string_algo.xml b/libs/algorithm/string/doc/string_algo.xml index 1eb4a2c8d6..bbf1fe0a05 100644 --- a/libs/algorithm/string/doc/string_algo.xml +++ b/libs/algorithm/string/doc/string_algo.xml @@ -8,7 +8,7 @@ --> <library name="String Algorithms" dirname="algorithm/string" xmlns:xi="http://www.w3.org/2001/XInclude" - id="string_algo" last-revision="$Date: 2010-07-10 13:29:03 -0700 (Sat, 10 Jul 2010) $"> + id="string_algo" last-revision="$Date$"> <libraryinfo> <author> <firstname>Pavol</firstname> diff --git a/libs/algorithm/string/doc/usage.xml b/libs/algorithm/string/doc/usage.xml index 8202f8c2bb..56fd3acd7b 100644 --- a/libs/algorithm/string/doc/usage.xml +++ b/libs/algorithm/string/doc/usage.xml @@ -9,7 +9,7 @@ --> -<section id="string_algo.usage" last-revision="$Date: 2012-08-15 22:16:42 -0700 (Wed, 15 Aug 2012) $"> +<section id="string_algo.usage" last-revision="$Date$"> <title>Usage</title> <using-namespace name="boost"/> diff --git a/libs/algorithm/string/example/predicate_example.cpp b/libs/algorithm/string/example/predicate_example.cpp index c89c653852..473ab8b57b 100644 --- a/libs/algorithm/string/example/predicate_example.cpp +++ b/libs/algorithm/string/example/predicate_example.cpp @@ -33,7 +33,7 @@ int main() cout << "str1 ends with \"123\": " << (ends_with( str1, string("123") )?"true":"false") << endl; - // Check if str1 containes 'xxx' + // Check if str1 contains 'xxx' cout << "str1 contains \"xxx\": " << (contains( str1, string("xxx") )?"true":"false") << endl; diff --git a/libs/algorithm/string/test/Jamfile.v2 b/libs/algorithm/string/test/Jamfile.v2 index 8b38e2c211..7f60df703f 100644 --- a/libs/algorithm/string/test/Jamfile.v2 +++ b/libs/algorithm/string/test/Jamfile.v2 @@ -9,58 +9,63 @@ import testing ; +alias unit_test_framework + : # sources + /boost//unit_test_framework + ; + test-suite algorithm/string : [ run - trim_test.cpp + trim_test.cpp unit_test_framework : : : : trim ] [ run - conv_test.cpp + conv_test.cpp unit_test_framework : : : : conv ] [ run - predicate_test.cpp + predicate_test.cpp unit_test_framework : : : : predicate ] [ run - find_test.cpp + find_test.cpp unit_test_framework : : : : find ] [ run - split_test.cpp + split_test.cpp unit_test_framework : : : : split ] [ run - join_test.cpp + join_test.cpp unit_test_framework : : : : join ] [ run - replace_test.cpp + replace_test.cpp unit_test_framework : : : : replace ] [ run - regex_test.cpp + regex_test.cpp unit_test_framework ../../../regex/build//boost_regex : : : : regex ] [ run - find_format_test.cpp + find_format_test.cpp unit_test_framework : : : : find_format diff --git a/libs/algorithm/string/test/conv_test.cpp b/libs/algorithm/string/test/conv_test.cpp index ca3c5ffbb1..c583d3efec 100644 --- a/libs/algorithm/string/test/conv_test.cpp +++ b/libs/algorithm/string/test/conv_test.cpp @@ -10,7 +10,8 @@ #include <boost/algorithm/string/case_conv.hpp> // Include unit test framework -#include <boost/test/included/test_exec_monitor.hpp> +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> #include <string> #include <iostream> @@ -87,9 +88,7 @@ void conv_test() } // test main -int test_main( int, char*[] ) +BOOST_AUTO_TEST_CASE( test_main ) { conv_test(); - - return 0; } diff --git a/libs/algorithm/string/test/find_format_test.cpp b/libs/algorithm/string/test/find_format_test.cpp index 4201e1ed81..645cdba3ac 100644 --- a/libs/algorithm/string/test/find_format_test.cpp +++ b/libs/algorithm/string/test/find_format_test.cpp @@ -12,7 +12,8 @@ #include <boost/algorithm/string/formatter.hpp> // Include unit test framework -#include <boost/test/included/test_exec_monitor.hpp> +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> #include <boost/test/test_tools.hpp> @@ -154,10 +155,8 @@ void find_format_all_test() BOOST_CHECK_EQUAL(output, source); } -int test_main( int, char*[] ) +BOOST_AUTO_TEST_CASE( test_main ) { find_format_test(); find_format_all_test(); - - return 0; } diff --git a/libs/algorithm/string/test/find_test.cpp b/libs/algorithm/string/test/find_test.cpp index 67d37598a0..8439b3c106 100644 --- a/libs/algorithm/string/test/find_test.cpp +++ b/libs/algorithm/string/test/find_test.cpp @@ -9,9 +9,11 @@ #include <boost/algorithm/string/find.hpp> #include <boost/algorithm/string/classification.hpp> +#include <boost/algorithm/string/split.hpp> // Include unit test framework -#include <boost/test/included/test_exec_monitor.hpp> +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> #include <string> #include <vector> @@ -44,7 +46,7 @@ void find_test() // find_first - BOOST_CHECKPOINT( "find_first" ); + BOOST_TEST_CHECKPOINT( "find_first" ); nc_result=find_first( str1, string("abc") ); BOOST_CHECK( @@ -65,7 +67,7 @@ void find_test() BOOST_CHECK(( (ch_result.begin() - pch1 ) == 3) && ( (ch_result.end() - pch1 ) == 6 ) ); // find_last - BOOST_CHECKPOINT( "find_last" ); + BOOST_TEST_CHECKPOINT( "find_last" ); nc_result=find_last( str1, string("abc") ); BOOST_CHECK( @@ -86,7 +88,7 @@ void find_test() BOOST_CHECK(( (ch_result.begin() - pch1 ) == 15) && ( (ch_result.end() - pch1 ) == 18 ) ); // find_nth - BOOST_CHECKPOINT( "find_nth" ); + BOOST_TEST_CHECKPOINT( "find_nth" ); nc_result=find_nth( str1, string("abc"), 1 ); BOOST_CHECK( @@ -124,7 +126,7 @@ void find_test() BOOST_CHECK(( (ch_result.begin() - pch1 ) == 9) && ( (ch_result.end() - pch1 ) == 12 ) ); // find_head - BOOST_CHECKPOINT( "find_head" ); + BOOST_TEST_CHECKPOINT( "find_head" ); nc_result=find_head( str1, 6 ); BOOST_CHECK( @@ -145,7 +147,7 @@ void find_test() BOOST_CHECK( ( (ch_result.begin() - pch1 ) == 0 ) && ( (ch_result.end() - pch1 ) == 6 ) ); // find_tail - BOOST_CHECKPOINT( "find_tail" ); + BOOST_TEST_CHECKPOINT( "find_tail" ); nc_result=find_tail( str1, 6 ); BOOST_CHECK( @@ -167,7 +169,7 @@ void find_test() BOOST_CHECK( ( (ch_result.begin() - pch1 ) == 15 ) && ( (ch_result.end() - pch1 ) == 21 ) ); // find_token - BOOST_CHECKPOINT( "find_token" ); + BOOST_TEST_CHECKPOINT( "find_token" ); nc_result=find_token( str1, is_any_of("abc"), token_compress_on ); BOOST_CHECK( @@ -179,6 +181,21 @@ void find_test() ( (cv_result.begin()-str1.begin()) == 3) && ( (cv_result.end()-str1.begin()) == 6) ); + string s1("abc def ghi jkl"); + find_iterator<string::iterator> fEnd; + + find_iterator<string::iterator> fxIt = make_find_iterator(s1, + token_finder(is_alnum(), token_compress_on)); + BOOST_CHECK((fxIt != fEnd) && (*fxIt == string("abc"))); + ++fxIt; + BOOST_CHECK((fxIt != fEnd) && (*fxIt == string("def"))); + ++fxIt; + BOOST_CHECK((fxIt != fEnd) && (*fxIt == string("ghi"))); + ++fxIt; + BOOST_CHECK((fxIt != fEnd) && (*fxIt == string("jkl"))); + ++fxIt; + BOOST_CHECK(fxIt == fEnd); + nc_result=find_token( str1, is_any_of("abc"), token_compress_off ); BOOST_CHECK( ( (nc_result.begin()-str1.begin()) == 3) && @@ -193,7 +210,7 @@ void find_test() BOOST_CHECK( ( (ch_result.begin() - pch1 ) == 3 ) && ( (ch_result.end() - pch1 ) == 4 ) ); // generic find - BOOST_CHECKPOINT( "generic find" ); + BOOST_TEST_CHECKPOINT( "generic find" ); nc_result=find(str1, first_finder(string("abc"))); BOOST_CHECK( @@ -206,7 +223,7 @@ void find_test() ( (cv_result.end()-str1.begin()) == 6) ); // multi-type comparison test - BOOST_CHECKPOINT( "multi-type" ); + BOOST_TEST_CHECKPOINT( "multi-type" ); nc_vresult=find_first( vec1, string("abc") ); BOOST_CHECK( @@ -219,7 +236,7 @@ void find_test() ( (cv_result.end()-str1.begin()) == 6) ); // overflow test - BOOST_CHECKPOINT( "overflow" ); + BOOST_TEST_CHECKPOINT( "overflow" ); nc_result=find_first( str2, string("abcd") ); BOOST_CHECK( nc_result.begin()==nc_result.end() ); @@ -232,7 +249,7 @@ void find_test() BOOST_CHECK( string( cv_result.begin(), cv_result.end() )== string("abc") ); // Empty string test - BOOST_CHECKPOINT( "empty" ); + BOOST_TEST_CHECKPOINT( "empty" ); nc_result=find_first( str3, string("abcd") ); BOOST_CHECK( nc_result.begin()==nc_result.end() ); @@ -248,12 +265,11 @@ void find_test() ostringstream osstr; osstr << find_first( str1, "abc" ); BOOST_CHECK( osstr.str()=="abc" ); + } // test main -int test_main( int, char*[] ) +BOOST_AUTO_TEST_CASE( test_main ) { find_test(); - - return 0; } diff --git a/libs/algorithm/string/test/join_test.cpp b/libs/algorithm/string/test/join_test.cpp index 13e3f0a5bd..9c5150baf2 100644 --- a/libs/algorithm/string/test/join_test.cpp +++ b/libs/algorithm/string/test/join_test.cpp @@ -13,7 +13,8 @@ #include <boost/algorithm/string/predicate.hpp> // Include unit test framework -#include <boost/test/included/test_exec_monitor.hpp> +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> #include <string> #include <vector> @@ -70,10 +71,8 @@ void join_test() BOOST_CHECK( equals(join_if(tokens3, "-", is_not_empty), "") ); } -// test main -int test_main( int, char*[] ) + +BOOST_AUTO_TEST_CASE( test_main ) { join_test(); - - return 0; } diff --git a/libs/algorithm/string/test/predicate_test.cpp b/libs/algorithm/string/test/predicate_test.cpp index 05fede3742..ba1564e53c 100644 --- a/libs/algorithm/string/test/predicate_test.cpp +++ b/libs/algorithm/string/test/predicate_test.cpp @@ -11,7 +11,8 @@ #include <boost/algorithm/string/classification.hpp> // Include unit test framework -#include <boost/test/included/test_exec_monitor.hpp> +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> #include <string> #include <vector> @@ -152,11 +153,8 @@ void classification_test() #undef TEST_CLASS -// test main -int test_main( int, char*[] ) +BOOST_AUTO_TEST_CASE( test_main ) { predicate_test(); classification_test(); - - return 0; } diff --git a/libs/algorithm/string/test/regex_test.cpp b/libs/algorithm/string/test/regex_test.cpp index 8e6b89af99..f93c1d9d34 100644 --- a/libs/algorithm/string/test/regex_test.cpp +++ b/libs/algorithm/string/test/regex_test.cpp @@ -15,7 +15,8 @@ // Include unit test framework -#include <boost/test/included/test_exec_monitor.hpp> +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> #include <string> #include <vector> @@ -114,7 +115,7 @@ static void replace_test() string fmt2("_xXx_"); vector<int> vec1( str1.begin(), str1.end() ); - // inmutable tests + // immutable tests // basic tests BOOST_CHECK( replace_regex_copy( str1, rx1, fmt1 )==string("123_A1C_xxxa23cXXXa456c321") ); @@ -149,11 +150,9 @@ static void replace_test() BOOST_CHECK( str1==string("123AxXxCa23ca456c321") ); } -int test_main( int, char*[] ) +BOOST_AUTO_TEST_CASE( test_main ) { find_test(); join_test(); replace_test(); - - return 0; } diff --git a/libs/algorithm/string/test/replace_test.cpp b/libs/algorithm/string/test/replace_test.cpp index 7264ea9e44..789d8e4825 100644 --- a/libs/algorithm/string/test/replace_test.cpp +++ b/libs/algorithm/string/test/replace_test.cpp @@ -16,7 +16,8 @@ #include <boost/algorithm/string/classification.hpp> // Include unit test framework -#include <boost/test/included/test_exec_monitor.hpp> +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> #include <string> #include <vector> @@ -56,14 +57,14 @@ void sequence_traits_test() #define C_ , #define TEST_ALGO( Algo, Input, Params, Output ) \ {\ - BOOST_CHECKPOINT( #Algo " - Copy" );\ + BOOST_TEST_CHECKPOINT( #Algo " - Copy" );\ \ string str1(Input);\ \ /* Copy test */ \ BOOST_CHECK( Algo##_copy( str1, Params )==Output );\ \ - BOOST_CHECKPOINT( #Algo " - Iterator" );\ + BOOST_TEST_CHECKPOINT( #Algo " - Iterator" );\ /* Iterator test */\ string strout;\ Algo##_copy( back_inserter(strout), str1, Params );\ @@ -73,15 +74,15 @@ void sequence_traits_test() vector<char> vec1( str1.begin(), str1.end() );\ list<char> list1( str1.begin(), str1.end() );\ \ - BOOST_CHECKPOINT( #Algo " - Inplace(string)" );\ + BOOST_TEST_CHECKPOINT( #Algo " - Inplace(string)" );\ Algo( str1, Params ); \ BOOST_CHECK( equals( str1, Output ) ); \ \ - BOOST_CHECKPOINT( #Algo " - Inplace(vector)" );\ + BOOST_TEST_CHECKPOINT( #Algo " - Inplace(vector)" );\ Algo( vec1, Params ); \ BOOST_CHECK( equals( vec1, Output ) );\ \ - BOOST_CHECKPOINT( #Algo " - Inplace(list)" );\ + BOOST_TEST_CHECKPOINT( #Algo " - Inplace(list)" );\ Algo( list1, Params ); \ BOOST_CHECK( equals( list1, Output ) );\ } @@ -206,7 +207,7 @@ void replace_range_test() { // replace_range { - BOOST_CHECKPOINT( "replace_range" ); + BOOST_TEST_CHECKPOINT( "replace_range" ); string str1("1abc3abc2"); BOOST_CHECK( @@ -231,7 +232,7 @@ void replace_range_test() } // erase_range { - BOOST_CHECKPOINT( "erase_range" ); + BOOST_TEST_CHECKPOINT( "erase_range" ); string str1("1abc3abc2"); BOOST_CHECK( @@ -305,8 +306,7 @@ void dissect_format_test() } -// test main -int test_main( int, char*[] ) +BOOST_AUTO_TEST_CASE( test_main ) { sequence_traits_test(); replace_first_test(); @@ -318,6 +318,4 @@ int test_main( int, char*[] ) replace_range_test(); collection_comp_test(); dissect_format_test(); - - return 0; } diff --git a/libs/algorithm/string/test/split_test.cpp b/libs/algorithm/string/test/split_test.cpp index 89d1083f55..582472b8b6 100644 --- a/libs/algorithm/string/test/split_test.cpp +++ b/libs/algorithm/string/test/split_test.cpp @@ -13,10 +13,12 @@ #include <boost/algorithm/string/predicate.hpp> // Include unit test framework -#include <boost/test/included/test_exec_monitor.hpp> +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> #include <string> #include <vector> +#include <list> #include <iostream> #include <boost/test/test_tools.hpp> @@ -44,7 +46,7 @@ void iterator_test() const char* pch1="xx-abc--xx-abb"; vector<string> tokens; vector< vector<int> > vtokens; - + // find_all tests find_all( tokens, @@ -144,30 +146,48 @@ void iterator_test() find_iterator<string::iterator> fiter=make_find_iterator(str1, first_finder("xx")); + find_iterator<string::iterator> fiter2; + BOOST_CHECK(equals(*fiter, "xx")); ++fiter; - BOOST_CHECK(equals(*fiter, "xx")); + + fiter2 = fiter; + BOOST_CHECK(equals(*fiter, "xx")); + BOOST_CHECK(equals(*fiter2, "xx")); + ++fiter; BOOST_CHECK(fiter==find_iterator<string::iterator>()); + BOOST_CHECK(equals(*fiter2, "xx")); + + ++fiter2; + BOOST_CHECK(fiter2==find_iterator<string::iterator>()); split_iterator<string::iterator> siter=make_split_iterator(str1, token_finder(is_any_of("-"), token_compress_on)); + split_iterator<string::iterator> siter2; BOOST_CHECK(equals(*siter, "xx")); ++siter; - BOOST_CHECK(equals(*siter, "abc")); + + siter2 = siter; + BOOST_CHECK(equals(*siter, "abc")); + BOOST_CHECK(equals(*siter2, "abc")); + ++siter; - BOOST_CHECK(equals(*siter, "xx")); + BOOST_CHECK(equals(*siter, "xx")); + BOOST_CHECK(equals(*siter2, "abc")); + ++siter; BOOST_CHECK(equals(*siter, "abb")); ++siter; BOOST_CHECK(siter==split_iterator<string::iterator>(siter)); BOOST_CHECK(siter==split_iterator<string::iterator>()); +// Make sure we work with forward iterators +// See bug #7989 + list<char> l1; + find_iterator<list<char>::iterator> liter=make_find_iterator(l1, first_finder("xx")); } -// test main -int test_main( int, char*[] ) +BOOST_AUTO_TEST_CASE( test_main ) { iterator_test(); - - return 0; } diff --git a/libs/algorithm/string/test/trim_test.cpp b/libs/algorithm/string/test/trim_test.cpp index 8dcce28bfc..b254caaa44 100644 --- a/libs/algorithm/string/test/trim_test.cpp +++ b/libs/algorithm/string/test/trim_test.cpp @@ -11,7 +11,8 @@ #include <boost/algorithm/string/trim_all.hpp> // Include unit test framework -#include <boost/test/included/test_exec_monitor.hpp> +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> #include <string> #include <iostream> @@ -193,12 +194,9 @@ void trim_fill_test() BOOST_CHECK( trim_fill_copy_if( string("<>abc<>def<>"), "-", is_any_of( "<<>>" ) )=="abc-def" ); } -// test main -int test_main( int, char*[] ) +BOOST_AUTO_TEST_CASE( test_main ) { trim_test(); trim_all_test(); trim_fill_test(); - - return 0; } diff --git a/libs/algorithm/test/Jamfile.v2 b/libs/algorithm/test/Jamfile.v2 index b9cfa2a343..ceea3a0d6f 100644 --- a/libs/algorithm/test/Jamfile.v2 +++ b/libs/algorithm/test/Jamfile.v2 @@ -9,43 +9,59 @@ import testing ; +alias unit_test_framework + : # sources + /boost//unit_test_framework + ; + + { test-suite algorithm: # Search tests - : [ run empty_search_test.cpp : : : : empty_search_test ] - [ run search_test1.cpp : : : : search_test1 ] - [ run search_test2.cpp : : : : search_test2 ] - [ run search_test3.cpp : : : : search_test3 ] - [ run search_test4.cpp : : : : search_test4 ] - [ compile-fail search_fail1.cpp : : : : ] - [ compile-fail search_fail2.cpp : : : : ] - [ compile-fail search_fail3.cpp : : : : ] + : [ run empty_search_test.cpp unit_test_framework : : : : empty_search_test ] + [ run search_test1.cpp unit_test_framework : : : : search_test1 ] + [ run search_test2.cpp unit_test_framework : : : : search_test2 ] + [ run search_test3.cpp unit_test_framework : : : : search_test3 ] + [ run search_test4.cpp unit_test_framework : : : : search_test4 ] + [ compile-fail search_fail1.cpp : : : : ] + [ compile-fail search_fail2.cpp : : : : ] + [ compile-fail search_fail3.cpp : : : : ] # Clamp tests - [ run clamp_test.cpp : : : : clamp_test ] + [ run clamp_test.cpp unit_test_framework : : : : clamp_test ] # Cxx11 tests - [ run all_of_test.cpp : : : : all_of_test ] - [ run any_of_test.cpp : : : : any_of_test ] - [ run none_of_test.cpp : : : : none_of_test ] - [ run one_of_test.cpp : : : : one_of_test ] + [ run all_of_test.cpp unit_test_framework : : : : all_of_test ] + [ run any_of_test.cpp unit_test_framework : : : : any_of_test ] + [ run none_of_test.cpp unit_test_framework : : : : none_of_test ] + [ run one_of_test.cpp unit_test_framework : : : : one_of_test ] - [ run ordered_test.cpp : : : : ordered_test ] - [ run find_if_not_test1.cpp : : : : find_if_not_test1 ] - [ run copy_n_test1.cpp : : : : copy_n_test1 ] - [ run iota_test1.cpp : : : : iota_test1 ] + [ run ordered_test.cpp unit_test_framework : : : : ordered_test ] + [ run find_if_not_test1.cpp unit_test_framework : : : : find_if_not_test1 ] + [ run copy_if_test1.cpp unit_test_framework : : : : copy_if_test1 ] + [ run copy_n_test1.cpp unit_test_framework : : : : copy_n_test1 ] + [ run iota_test1.cpp unit_test_framework : : : : iota_test1 ] + + [ run is_permutation_test1.cpp unit_test_framework : : : : is_permutation_test1 ] + [ run partition_point_test1.cpp unit_test_framework : : : : partition_point_test1 ] + [ run is_partitioned_test1.cpp unit_test_framework : : : : is_partitioned_test1 ] + [ run partition_copy_test1.cpp unit_test_framework : : : : partition_copy_test1 ] - [ run is_permutation_test1.cpp : : : : is_permutation_test1 ] - [ run partition_point_test1.cpp : : : : partition_point_test1 ] - [ run is_partitioned_test1.cpp : : : : is_partitioned_test1 ] - [ run partition_copy_test1.cpp : : : : partition_copy_test1 ] +# Cxx14 tests + [ run equal_test.cpp unit_test_framework : : : : equal_test ] + [ run mismatch_test.cpp unit_test_framework : : : : mismatch_test ] # Hex tests - [ run hex_test1.cpp : : : : hex_test1 ] - [ run hex_test2.cpp : : : : hex_test2 ] - [ run hex_test3.cpp : : : : hex_test3 ] - [ run hex_test4.cpp : : : : hex_test4 ] - [ compile-fail hex_fail1.cpp ] + [ run hex_test1.cpp unit_test_framework : : : : hex_test1 ] + [ run hex_test2.cpp unit_test_framework : : : : hex_test2 ] + [ run hex_test3.cpp unit_test_framework : : : : hex_test3 ] + [ run hex_test4.cpp unit_test_framework : : : : hex_test4 ] + [ compile-fail hex_fail1.cpp ] + +# Gather tests + [ run gather_test1.cpp unit_test_framework : : : : gather_test1 ] + [ compile-fail gather_fail1.cpp ] + ; } diff --git a/libs/algorithm/test/all_of_test.cpp b/libs/algorithm/test/all_of_test.cpp index bf35da1e85..36918d5e80 100644 --- a/libs/algorithm/test/all_of_test.cpp +++ b/libs/algorithm/test/all_of_test.cpp @@ -9,7 +9,9 @@ #include <boost/config.hpp> #include <boost/algorithm/cxx11/all_of.hpp> -#include <boost/test/included/test_exec_monitor.hpp> + +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> #include <functional> #include <vector> @@ -79,8 +81,7 @@ void test_all () } -int test_main( int , char* [] ) +BOOST_AUTO_TEST_CASE( test_main ) { test_all (); - return 0; } diff --git a/libs/algorithm/test/any_of_test.cpp b/libs/algorithm/test/any_of_test.cpp index 57f3fb2ce6..a3267c59f6 100644 --- a/libs/algorithm/test/any_of_test.cpp +++ b/libs/algorithm/test/any_of_test.cpp @@ -9,7 +9,9 @@ #include <boost/config.hpp> #include <boost/algorithm/cxx11/any_of.hpp> -#include <boost/test/included/test_exec_monitor.hpp> + +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> #include <functional> #include <vector> @@ -98,8 +100,7 @@ void test_any () } -int test_main( int , char* [] ) +BOOST_AUTO_TEST_CASE( test_main ) { test_any (); - return 0; } diff --git a/libs/algorithm/test/clamp_test.cpp b/libs/algorithm/test/clamp_test.cpp index 7d336aa789..3519659818 100644 --- a/libs/algorithm/test/clamp_test.cpp +++ b/libs/algorithm/test/clamp_test.cpp @@ -9,7 +9,8 @@ #include <boost/config.hpp> #include <boost/algorithm/clamp.hpp> -#include <boost/test/included/test_exec_monitor.hpp> +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> namespace ba = boost::algorithm; @@ -205,7 +206,7 @@ void test_int_range () BOOST_CHECK ( std::equal ( b_e(junk), outputs )); } -int test_main( int , char* [] ) +BOOST_AUTO_TEST_CASE( test_main ) { test_ints (); test_floats (); @@ -214,5 +215,4 @@ int test_main( int , char* [] ) test_int_range (); // test_float_range (); // test_custom_range (); - return 0; } diff --git a/libs/algorithm/test/copy_if_test1.cpp b/libs/algorithm/test/copy_if_test1.cpp new file mode 100644 index 0000000000..59944bc52d --- /dev/null +++ b/libs/algorithm/test/copy_if_test1.cpp @@ -0,0 +1,179 @@ +/* + Copyright (c) Marshall Clow 2012. + + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + + For more information, see http://www.boost.org +*/ + +#include <boost/config.hpp> +#include <boost/algorithm/cxx11/copy_if.hpp> + +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> + +#include <algorithm> +#include <string> +#include <iostream> +#include <vector> +#include <list> + +#include <boost/algorithm/cxx11/all_of.hpp> +#include <boost/algorithm/cxx11/none_of.hpp> + +namespace ba = boost::algorithm; +// namespace ba = boost; + +bool is_true ( int v ) { return true; } +bool is_false ( int v ) { return false; } +bool is_even ( int v ) { return v % 2 == 0; } +bool is_odd ( int v ) { return v % 2 == 1; } + +template <typename Container> +void test_copy_if ( Container const &c ) { + + typedef typename Container::value_type value_type; + std::vector<value_type> v; + +// None of the elements + v.clear (); + ba::copy_if ( c.begin (), c.end (), back_inserter ( v ), is_false); + BOOST_CHECK ( v.size () == 0 ); + + v.clear (); + ba::copy_if ( c, back_inserter ( v ), is_false); + BOOST_CHECK ( v.size () == 0 ); + +// All the elements + v.clear (); + ba::copy_if ( c.begin (), c.end (), back_inserter ( v ), is_true); + BOOST_CHECK ( v.size () == c.size ()); + BOOST_CHECK ( std::equal ( v.begin (), v.end (), c.begin ())); + + v.clear (); + ba::copy_if ( c, back_inserter ( v ), is_true); + BOOST_CHECK ( v.size () == c.size ()); + BOOST_CHECK ( v.size () == c.size ()); + BOOST_CHECK ( std::equal ( v.begin (), v.end (), c.begin ())); + +// Some of the elements + v.clear (); + ba::copy_if ( c.begin (), c.end (), back_inserter ( v ), is_even ); + BOOST_CHECK ( v.size () == (size_t) std::count_if ( c.begin (), c.end (), is_even )); + BOOST_CHECK ( ba::all_of ( v.begin (), v.end (), is_even )); + + v.clear (); + ba::copy_if ( c, back_inserter ( v ), is_even ); + BOOST_CHECK ( v.size () == (size_t) std::count_if ( c.begin (), c.end (), is_even )); + BOOST_CHECK ( ba::all_of ( v.begin (), v.end (), is_even )); + } + + +template <typename Container> +void test_copy_while ( Container const &c ) { + + typedef typename Container::value_type value_type; + typename Container::const_iterator it; + std::vector<value_type> v; + +// None of the elements + v.clear (); + ba::copy_while ( c.begin (), c.end (), back_inserter ( v ), is_false); + BOOST_CHECK ( v.size () == 0 ); + + v.clear (); + ba::copy_while ( c, back_inserter ( v ), is_false); + BOOST_CHECK ( v.size () == 0 ); + +// All the elements + v.clear (); + ba::copy_while ( c.begin (), c.end (), back_inserter ( v ), is_true); + BOOST_CHECK ( v.size () == c.size ()); + BOOST_CHECK ( std::equal ( v.begin (), v.end (), c.begin ())); + + v.clear (); + ba::copy_while ( c, back_inserter ( v ), is_true); + BOOST_CHECK ( v.size () == c.size ()); + BOOST_CHECK ( std::equal ( v.begin (), v.end (), c.begin ())); + +// Some of the elements + v.clear (); + it = ba::copy_while ( c.begin (), c.end (), back_inserter ( v ), is_even ).first; + BOOST_CHECK ( v.size () == (size_t) std::distance ( c.begin (), it )); + BOOST_CHECK ( it == c.end () || !is_even ( *it )); + BOOST_CHECK ( ba::all_of ( v.begin (), v.end (), is_even )); + BOOST_CHECK ( std::equal ( v.begin (), v.end (), c.begin ())); + + v.clear (); + it = ba::copy_while ( c, back_inserter ( v ), is_even ).first; + BOOST_CHECK ( v.size () == (size_t) std::distance ( c.begin (), it )); + BOOST_CHECK ( it == c.end () || !is_even ( *it )); + BOOST_CHECK ( ba::all_of ( v.begin (), v.end (), is_even )); + BOOST_CHECK ( std::equal ( v.begin (), v.end (), c.begin ())); + } + +template <typename Container> +void test_copy_until ( Container const &c ) { + + typedef typename Container::value_type value_type; + typename Container::const_iterator it; + std::vector<value_type> v; + +// None of the elements + v.clear (); + ba::copy_until ( c.begin (), c.end (), back_inserter ( v ), is_true); + BOOST_CHECK ( v.size () == 0 ); + + v.clear (); + ba::copy_until ( c, back_inserter ( v ), is_true); + BOOST_CHECK ( v.size () == 0 ); + +// All the elements + v.clear (); + ba::copy_until ( c.begin (), c.end (), back_inserter ( v ), is_false); + BOOST_CHECK ( v.size () == c.size ()); + BOOST_CHECK ( std::equal ( v.begin (), v.end (), c.begin ())); + + v.clear (); + ba::copy_until ( c, back_inserter ( v ), is_false); + BOOST_CHECK ( v.size () == c.size ()); + BOOST_CHECK ( std::equal ( v.begin (), v.end (), c.begin ())); + +// Some of the elements + v.clear (); + it = ba::copy_until ( c.begin (), c.end (), back_inserter ( v ), is_even ).first; + BOOST_CHECK ( v.size () == (size_t) std::distance ( c.begin (), it )); + BOOST_CHECK ( it == c.end () || is_even ( *it )); + BOOST_CHECK ( ba::none_of ( v.begin (), v.end (), is_even )); + BOOST_CHECK ( std::equal ( v.begin (), v.end (), c.begin ())); + + v.clear (); + it = ba::copy_until ( c, back_inserter ( v ), is_even ).first; + BOOST_CHECK ( v.size () == (size_t) std::distance ( c.begin (), it )); + BOOST_CHECK ( it == c.end () || is_even ( *it )); + BOOST_CHECK ( ba::none_of ( v.begin (), v.end (), is_even )); + BOOST_CHECK ( std::equal ( v.begin (), v.end (), c.begin ())); + } + +void test_sequence1 () { + std::vector<int> v; + for ( int i = 5; i < 15; ++i ) + v.push_back ( i ); + test_copy_if ( v ); + test_copy_while ( v ); + test_copy_until ( v ); + + std::list<int> l; + for ( int i = 25; i > 15; --i ) + l.push_back ( i ); + test_copy_if ( l ); + test_copy_while ( l ); + test_copy_until ( l ); + } + + +BOOST_AUTO_TEST_CASE( test_main ) +{ + test_sequence1 (); +} diff --git a/libs/algorithm/test/copy_n_test1.cpp b/libs/algorithm/test/copy_n_test1.cpp index 69d8a46b9b..a61c1083f3 100644 --- a/libs/algorithm/test/copy_n_test1.cpp +++ b/libs/algorithm/test/copy_n_test1.cpp @@ -9,7 +9,9 @@ #include <boost/config.hpp> #include <boost/algorithm/cxx11/copy_n.hpp> -#include <boost/test/included/test_exec_monitor.hpp> + +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> #include <string> #include <iostream> @@ -78,8 +80,7 @@ void test_sequence1 () { } -int test_main( int , char* [] ) +BOOST_AUTO_TEST_CASE( test_main ) { test_sequence1 (); - return 0; } diff --git a/libs/algorithm/test/empty_search_test.cpp b/libs/algorithm/test/empty_search_test.cpp index 941d6f6d68..22317f1365 100644 --- a/libs/algorithm/test/empty_search_test.cpp +++ b/libs/algorithm/test/empty_search_test.cpp @@ -13,9 +13,10 @@ #include <boost/algorithm/searching/boyer_moore_horspool.hpp> #include <boost/algorithm/searching/knuth_morris_pratt.hpp> -#include <boost/test/included/test_exec_monitor.hpp> +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> -int test_main( int argc, char *argv [] ) +BOOST_AUTO_TEST_CASE( test_main ) { const std::string cs; std::string estr; @@ -77,7 +78,4 @@ int test_main( int argc, char *argv [] ) str.begin (), str.end (), estr.begin (), estr.end ()) == str.begin () ); - - (void) argv; (void) argc; - return 0; } diff --git a/libs/algorithm/test/equal_test.cpp b/libs/algorithm/test/equal_test.cpp new file mode 100644 index 0000000000..c54e64d337 --- /dev/null +++ b/libs/algorithm/test/equal_test.cpp @@ -0,0 +1,129 @@ +/* + Copyright (c) Marshall Clow 2013. + + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + + For more information, see http://www.boost.org +*/ + +#include <boost/config.hpp> +#include <boost/algorithm/cxx14/equal.hpp> + +#include "iterator_test.hpp" + +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> + +template <typename T> +bool eq ( const T& a, const T& b ) { return a == b; } + +template <typename T> +bool never_eq ( const T&, const T& ) { return false; } + +int comparison_count = 0; +template <typename T> +bool counting_equals ( const T &a, const T &b ) { + ++comparison_count; + return a == b; + } + +namespace ba = boost::algorithm; + +void test_equal () +{ +// Note: The literal values here are tested against directly, careful if you change them: + int num[] = { 1, 1, 2, 3, 5 }; + const int sz = sizeof (num)/sizeof(num[0]); + + +// Empty sequences are equal to each other, but not to non-empty sequences + BOOST_CHECK ( ba::equal ( input_iterator<int *>(num), input_iterator<int *>(num), + input_iterator<int *>(num), input_iterator<int *>(num))); + BOOST_CHECK ( ba::equal ( input_iterator<int *>(num), input_iterator<int *>(num), + input_iterator<int *>(num), input_iterator<int *>(num), + never_eq<int> )); + BOOST_CHECK ( ba::equal ( random_access_iterator<int *>(num), random_access_iterator<int *>(num), + random_access_iterator<int *>(num), random_access_iterator<int *>(num), + never_eq<int> )); + + BOOST_CHECK (!ba::equal ( input_iterator<int *>(num), input_iterator<int *>(num), + input_iterator<int *>(num), input_iterator<int *>(num + 1))); + BOOST_CHECK (!ba::equal ( input_iterator<int *>(num + 1), input_iterator<int *>(num + 2), + input_iterator<int *>(num), input_iterator<int *>(num))); + BOOST_CHECK (!ba::equal ( random_access_iterator<int *>(num + 1), random_access_iterator<int *>(num + 2), + random_access_iterator<int *>(num), random_access_iterator<int *>(num))); + +// Single element sequences are equal if they contain the same value + BOOST_CHECK ( ba::equal ( input_iterator<int *>(num), input_iterator<int *>(num + 1), + input_iterator<int *>(num), input_iterator<int *>(num + 1))); + BOOST_CHECK ( ba::equal ( input_iterator<int *>(num), input_iterator<int *>(num + 1), + input_iterator<int *>(num), input_iterator<int *>(num + 1), + eq<int> )); + BOOST_CHECK ( ba::equal ( random_access_iterator<int *>(num), random_access_iterator<int *>(num + 1), + random_access_iterator<int *>(num), random_access_iterator<int *>(num + 1), + eq<int> )); + BOOST_CHECK (!ba::equal ( input_iterator<int *>(num), input_iterator<int *>(num + 1), + input_iterator<int *>(num), input_iterator<int *>(num + 1), + never_eq<int> )); + BOOST_CHECK (!ba::equal ( random_access_iterator<int *>(num), random_access_iterator<int *>(num + 1), + random_access_iterator<int *>(num), random_access_iterator<int *>(num + 1), + never_eq<int> )); + + BOOST_CHECK ( ba::equal ( input_iterator<int *>(num), input_iterator<int *>(num + 1), + input_iterator<int *>(num + 1), input_iterator<int *>(num + 2))); + BOOST_CHECK ( ba::equal ( input_iterator<int *>(num), input_iterator<int *>(num + 1), + input_iterator<int *>(num + 1), input_iterator<int *>(num + 2), + eq<int> )); + + BOOST_CHECK (!ba::equal ( input_iterator<int *>(num + 2), input_iterator<int *>(num + 3), + input_iterator<int *>(num), input_iterator<int *>(num + 1))); + BOOST_CHECK (!ba::equal ( input_iterator<int *>(num + 2), input_iterator<int *>(num + 3), + input_iterator<int *>(num), input_iterator<int *>(num + 1), + eq<int> )); + +// Identical long sequences are equal. + BOOST_CHECK ( ba::equal ( input_iterator<int *>(num), input_iterator<int *>(num + sz), + input_iterator<int *>(num), input_iterator<int *>(num + sz))); + BOOST_CHECK ( ba::equal ( input_iterator<int *>(num), input_iterator<int *>(num + sz), + input_iterator<int *>(num), input_iterator<int *>(num + sz), + eq<int> )); + BOOST_CHECK (!ba::equal ( input_iterator<int *>(num), input_iterator<int *>(num + sz), + input_iterator<int *>(num), input_iterator<int *>(num + sz), + never_eq<int> )); + BOOST_CHECK ( ba::equal ( input_iterator<int *>(num), input_iterator<int *>(num + sz), + random_access_iterator<int *>(num), random_access_iterator<int *>(num + sz), + eq<int> )); + +// different sequences are different + BOOST_CHECK (!ba::equal ( input_iterator<int *>(num + 1), input_iterator<int *>(num + sz), + input_iterator<int *>(num), input_iterator<int *>(num + sz))); + BOOST_CHECK (!ba::equal ( input_iterator<int *>(num + 1), input_iterator<int *>(num + sz), + input_iterator<int *>(num), input_iterator<int *>(num + sz), + eq<int> )); + BOOST_CHECK (!ba::equal ( input_iterator<int *>(num), input_iterator<int *>(num + sz), + input_iterator<int *>(num), input_iterator<int *>(num + sz - 1))); + BOOST_CHECK (!ba::equal ( input_iterator<int *>(num), input_iterator<int *>(num + sz), + input_iterator<int *>(num), input_iterator<int *>(num + sz - 1), + eq<int> )); + +// When there's a cheap check, bail early + comparison_count = 0; + BOOST_CHECK (!ba::equal ( random_access_iterator<int *>(num), random_access_iterator<int *>(num + sz), + random_access_iterator<int *>(num), random_access_iterator<int *>(num + sz - 1), + counting_equals<int> )); + BOOST_CHECK ( comparison_count == 0 ); +// And when there's not, we can't + comparison_count = 0; + BOOST_CHECK (!ba::equal ( input_iterator<int *>(num), input_iterator<int *>(num + sz), + input_iterator<int *>(num), input_iterator<int *>(num + sz - 1), + counting_equals<int> )); + BOOST_CHECK ( comparison_count > 0 ); + +} + + +BOOST_AUTO_TEST_CASE( test_main ) +{ + test_equal (); +} diff --git a/libs/algorithm/test/find_if_not_test1.cpp b/libs/algorithm/test/find_if_not_test1.cpp index b23285a08c..1a17d95923 100644 --- a/libs/algorithm/test/find_if_not_test1.cpp +++ b/libs/algorithm/test/find_if_not_test1.cpp @@ -11,7 +11,9 @@ #include <boost/config.hpp> #include <boost/algorithm/cxx11/find_if_not.hpp> -#include <boost/test/included/test_exec_monitor.hpp> + +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> #include <string> #include <vector> @@ -83,8 +85,7 @@ void test_sequence1 () { } -int test_main( int , char* [] ) +BOOST_AUTO_TEST_CASE( test_main ) { test_sequence1 (); - return 0; } diff --git a/libs/algorithm/test/gather_fail1.cpp b/libs/algorithm/test/gather_fail1.cpp new file mode 100644 index 0000000000..7fe5b7fb7d --- /dev/null +++ b/libs/algorithm/test/gather_fail1.cpp @@ -0,0 +1,38 @@ +/* + Copyright (c) Marshall Clow 2011-2012. + + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + + For more information, see http://www.boost.org +*/ + +#include <iostream> + +#include <boost/config.hpp> +#include <boost/algorithm/gather.hpp> + +#include <string> +#include <vector> +#include <list> + +#include "iterator_test.hpp" + +namespace ba = boost::algorithm; + +bool is_ten ( int i ) { return i == 10; } + +void test_sequence1 () { + std::vector<int> v; + typedef input_iterator<std::vector<int>::iterator> II; + +// This should fail to compile, since gather doesn't work with input iterators + (void) ba::gather ( II( v.begin ()), II( v.end ()), II( v.begin ()), is_ten ); + } + + +int main () +{ + test_sequence1 (); + return 0; +} diff --git a/libs/algorithm/test/gather_test1.cpp b/libs/algorithm/test/gather_test1.cpp new file mode 100644 index 0000000000..28f63b59d4 --- /dev/null +++ b/libs/algorithm/test/gather_test1.cpp @@ -0,0 +1,138 @@ +/* + Copyright (c) Marshall Clow 2011-2012. + + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + + For more information, see http://www.boost.org +*/ + +#include <iostream> + +#include <boost/config.hpp> +#include <boost/algorithm/gather.hpp> + +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> + +#include <string> +#include <vector> +#include <list> + +#include "iterator_test.hpp" + +namespace ba = boost::algorithm; + +template <typename Container> +void print ( const char *prompt, const Container &c ) { + std::cout << prompt << " { "; + std::copy ( c.begin (), c.end (), std::ostream_iterator<typename Container::value_type>(std::cout, " ")); + std::cout << std::endl; + } + +template <typename Iterator, typename Predicate> +void test_iterators ( Iterator first, Iterator last, Predicate comp, std::size_t offset ) { +// Create the pivot point + Iterator off = first; + std::advance(off, offset); + +// Gather the elements + std::pair<Iterator, Iterator> res = ba::gather ( first, last, off, comp ); + +// We should now have three sequences, any of which may be empty: +// * [begin .. result.first) - items that do not satisfy the predicate +// * [result.first .. result.second) - items that do satisfy the predicate +// * [result.second .. end) - items that do not satisfy the predicate + Iterator iter = first; + for ( ; iter != res.first; ++iter ) + BOOST_CHECK ( !comp ( *iter )); + for ( ; iter != res.second; ++iter) + BOOST_CHECK ( comp ( *iter )); + for ( ; iter != last; ++iter ) + BOOST_CHECK ( !comp ( *iter )); + } + +template <typename Container, typename Predicate> +void test_iterator_types ( const Container &c, Predicate comp, std::size_t offset ) { + typedef std::vector<typename Container::value_type> vec; + + typedef bidirectional_iterator<typename vec::iterator> BDI; + typedef random_access_iterator<typename vec::iterator> RAI; + + vec v; + v.assign ( c.begin (), c.end ()); + test_iterators ( BDI ( v.begin ()), BDI ( v.end ()), comp, offset ); + v.assign ( c.begin (), c.end ()); + test_iterators ( RAI ( v.begin ()), RAI ( v.end ()), comp, offset ); + } + + +template <typename T> +struct less_than { +public: +// typedef T argument_type; +// typedef bool result_type; + + less_than ( T foo ) : val ( foo ) {} + less_than ( const less_than &rhs ) : val ( rhs.val ) {} + + bool operator () ( const T &v ) const { return v < val; } +private: + less_than (); + less_than operator = ( const less_than &rhs ); + T val; + }; + +bool is_even ( int i ) { return i % 2 == 0; } +bool is_ten ( int i ) { return i == 10; } + +void test_sequence1 () { + std::vector<int> v; + + for ( int i = 5; i < 15; ++i ) + v.push_back ( i ); + test_iterator_types ( v, less_than<int>(10), 0 ); // at beginning + test_iterator_types ( v, less_than<int>(10), 5 ); + test_iterator_types ( v, less_than<int>(10), v.size () - 1 ); // at end + + test_iterator_types ( v, is_even, 0 ); + test_iterator_types ( v, is_even, 5 ); + test_iterator_types ( v, is_even, v.size () - 1 ); + +// Exactly one element in the sequence matches + test_iterator_types ( v, is_ten, 0 ); + test_iterator_types ( v, is_ten, 5 ); + test_iterator_types ( v, is_ten, v.size () - 1 ); + +// Everything in the sequence matches + test_iterator_types ( v, less_than<int>(99), 0 ); + test_iterator_types ( v, less_than<int>(99), 5 ); + test_iterator_types ( v, less_than<int>(99), v.size () - 1 ); + +// Nothing in the sequence matches + test_iterator_types ( v, less_than<int>(0), 0 ); + test_iterator_types ( v, less_than<int>(0), 5 ); + test_iterator_types ( v, less_than<int>(0), v.size () - 1 ); + +// All the elements in the sequence are the same + v.clear (); + for ( int i = 0; i < 11; ++i ) + v.push_back ( 10 ); + +// Everything in the sequence matches + test_iterator_types ( v, is_ten, 0 ); + test_iterator_types ( v, is_ten, 5 ); + test_iterator_types ( v, is_ten, v.size () - 1 ); + +// Nothing in the sequence matches + test_iterator_types ( v, less_than<int>(5), 0 ); + test_iterator_types ( v, less_than<int>(5), 5 ); + test_iterator_types ( v, less_than<int>(5), v.size () - 1 ); + + } + + +BOOST_AUTO_TEST_CASE( test_main ) +{ + test_sequence1 (); +} diff --git a/libs/algorithm/test/hex_fail1.cpp b/libs/algorithm/test/hex_fail1.cpp index cd17852bc1..bd5ca46f2e 100644 --- a/libs/algorithm/test/hex_fail1.cpp +++ b/libs/algorithm/test/hex_fail1.cpp @@ -9,17 +9,17 @@ #include <boost/config.hpp> #include <boost/algorithm/hex.hpp> -#include <boost/test/included/test_exec_monitor.hpp> #include <string> #include <iostream> #include <vector> // should not compile: vector is not an integral type -int test_main( int , char* [] ) +int main( int , char* [] ) { std::vector<float> v; std::string out; boost::algorithm::unhex ( out, std::back_inserter(v)); + return 0; } diff --git a/libs/algorithm/test/hex_test1.cpp b/libs/algorithm/test/hex_test1.cpp index 891afe45e0..d9f5364643 100644 --- a/libs/algorithm/test/hex_test1.cpp +++ b/libs/algorithm/test/hex_test1.cpp @@ -9,7 +9,9 @@ #include <boost/config.hpp> #include <boost/algorithm/hex.hpp> -#include <boost/test/included/test_exec_monitor.hpp> + +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> #include <string> #include <iostream> @@ -141,7 +143,7 @@ const wchar_t *fromhex_fail_w [] = { }; -int test_main( int , char* [] ) +BOOST_AUTO_TEST_CASE( test_main ) { test_to_hex<std::string> ( tohex ); test_from_hex_success<std::string> ( fromhex ); @@ -150,5 +152,4 @@ int test_main( int , char* [] ) test_to_hex<std::wstring> ( tohex_w ); test_from_hex_success<std::wstring> ( fromhex_w ); test_from_hex_failure<std::wstring> ( fromhex_fail_w ); - return 0; } diff --git a/libs/algorithm/test/hex_test2.cpp b/libs/algorithm/test/hex_test2.cpp index 7092154182..af5579a616 100644 --- a/libs/algorithm/test/hex_test2.cpp +++ b/libs/algorithm/test/hex_test2.cpp @@ -11,7 +11,9 @@ Test non-string cases; vector and list #include <boost/config.hpp> #include <boost/algorithm/hex.hpp> -#include <boost/test/included/test_exec_monitor.hpp> + +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> #include <string> #include <iostream> @@ -129,9 +131,8 @@ void test_from_hex_success () { } -int test_main( int , char* [] ) +BOOST_AUTO_TEST_CASE( test_main ) { test_to_hex (); test_from_hex_success (); - return 0; } diff --git a/libs/algorithm/test/hex_test3.cpp b/libs/algorithm/test/hex_test3.cpp index e9a47a494f..64f0ff49eb 100644 --- a/libs/algorithm/test/hex_test3.cpp +++ b/libs/algorithm/test/hex_test3.cpp @@ -11,7 +11,9 @@ Try ostream_iterators #include <boost/config.hpp> #include <boost/algorithm/hex.hpp> -#include <boost/test/included/test_exec_monitor.hpp> + +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> #include <string> #include <iostream> @@ -113,11 +115,10 @@ const wchar_t *fromhex_w [] = { -int test_main( int , char* [] ) +BOOST_AUTO_TEST_CASE( test_main ) { test_to_hex ( tohex ); test_to_hex ( tohex_w ); test_from_hex_success ( fromhex ); test_from_hex_success ( fromhex_w ); - return 0; } diff --git a/libs/algorithm/test/hex_test4.cpp b/libs/algorithm/test/hex_test4.cpp index 002dd00536..df6e8d8545 100644 --- a/libs/algorithm/test/hex_test4.cpp +++ b/libs/algorithm/test/hex_test4.cpp @@ -11,7 +11,9 @@ Try ostream_iterators #include <boost/config.hpp> #include <boost/algorithm/hex.hpp> -#include <boost/test/included/test_exec_monitor.hpp> + +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> #include <string> #include <iostream> @@ -129,17 +131,15 @@ void test_nonhex_input4 () { } void test_nonhex_input () { -// BOOST_TEST_MESSAGE ( "Non hex input tests for for boost::algorithm::unhex" ); +// BOOST_TEST_MESSAGE ( "Non hex input tests for boost::algorithm::unhex" ); test_nonhex_input1 (); test_nonhex_input2 (); test_nonhex_input3 (); test_nonhex_input4 (); } -int test_main( int , char* [] ) +BOOST_AUTO_TEST_CASE( test_main ) { test_short_input (); test_nonhex_input (); - - return 0; } diff --git a/libs/algorithm/test/iota_test1.cpp b/libs/algorithm/test/iota_test1.cpp index 24fd0e3e38..747691f037 100644 --- a/libs/algorithm/test/iota_test1.cpp +++ b/libs/algorithm/test/iota_test1.cpp @@ -9,7 +9,9 @@ #include <boost/config.hpp> #include <boost/algorithm/cxx11/iota.hpp> -#include <boost/test/included/test_exec_monitor.hpp> + +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> #include <iostream> #include <string> @@ -40,11 +42,11 @@ void test_ints () { std::vector<int> v; std::list<int> l; - v.clear (); v.reserve ( 10 ); + v.clear (); v.resize ( 10 ); boost::algorithm::iota ( v.begin (), v.end (), 23 ); BOOST_CHECK ( test_iota_results ( v.begin (), v.end (), 23 )); - v.clear (); v.reserve ( 19 ); + v.clear (); v.resize ( 19 ); boost::algorithm::iota ( v, 18 ); BOOST_CHECK ( test_iota_results ( v, 18 )); @@ -52,6 +54,10 @@ void test_ints () { boost::algorithm::iota_n ( std::back_inserter(v), 99, 20 ); BOOST_CHECK ( test_iota_results ( v, 99 )); + v.clear (); + boost::algorithm::iota_n ( std::back_inserter(v), 99, 0 ); + BOOST_CHECK ( v.size() == 0 ); + /* l.clear (); l.reserve ( 5 ); boost::algorithm::iota ( l.begin (), l.end (), 123 ); @@ -72,8 +78,7 @@ void test_ints () { } -int test_main( int , char* [] ) +BOOST_AUTO_TEST_CASE( test_main ) { test_ints (); - return 0; } diff --git a/libs/algorithm/test/is_partitioned_test1.cpp b/libs/algorithm/test/is_partitioned_test1.cpp index 429ae7d67a..835de2df9c 100644 --- a/libs/algorithm/test/is_partitioned_test1.cpp +++ b/libs/algorithm/test/is_partitioned_test1.cpp @@ -11,7 +11,9 @@ #include <boost/config.hpp> #include <boost/algorithm/cxx11/is_partitioned.hpp> -#include <boost/test/included/test_exec_monitor.hpp> + +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> #include <string> #include <vector> @@ -56,8 +58,7 @@ void test_sequence1 () { } -int test_main( int , char* [] ) +BOOST_AUTO_TEST_CASE( test_main ) { test_sequence1 (); - return 0; } diff --git a/libs/algorithm/test/is_permutation_test1.cpp b/libs/algorithm/test/is_permutation_test1.cpp index f9c3b1bffd..2e1a12f356 100644 --- a/libs/algorithm/test/is_permutation_test1.cpp +++ b/libs/algorithm/test/is_permutation_test1.cpp @@ -11,16 +11,104 @@ #include <boost/config.hpp> #include <boost/algorithm/cxx11/is_permutation.hpp> -#include <boost/test/included/test_exec_monitor.hpp> +#include <boost/algorithm/cxx14/is_permutation.hpp> + +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> #include <string> #include <vector> #include <list> +#include "iterator_test.hpp" + +template <typename T> +bool eq ( const T& a, const T& b ) { return a == b; } + +template <typename T> +bool never_eq ( const T&, const T& ) { return false; } + namespace ba = boost::algorithm; -// namespace ba = boost; void test_sequence1 () { + int num[] = { 1, 1, 2, 3, 5 }; + const int sz = sizeof (num)/sizeof(num[0]); + +// Empty sequences + BOOST_CHECK ( + ba::is_permutation ( + forward_iterator<int *>(num), forward_iterator<int *>(num), + forward_iterator<int *>(num))); + BOOST_CHECK ( + ba::is_permutation ( + forward_iterator<int *>(num), forward_iterator<int *>(num), + forward_iterator<int *>(num), forward_iterator<int *>(num))); + BOOST_CHECK ( + ba::is_permutation ( + random_access_iterator<int *>(num), random_access_iterator<int *>(num), + random_access_iterator<int *>(num), random_access_iterator<int *>(num))); + BOOST_CHECK ( + ba::is_permutation ( + forward_iterator<int *>(num), forward_iterator<int *>(num), + forward_iterator<int *>(num), + never_eq<int> )); // Since the sequences are empty, the pred is never called + +// Empty vs. non-empty + BOOST_CHECK ( ! + ba::is_permutation ( + forward_iterator<int *>(num), forward_iterator<int *>(num), + forward_iterator<int *>(num), forward_iterator<int *>(num + 1))); + + BOOST_CHECK ( ! + ba::is_permutation ( + forward_iterator<int *>(num + 1), forward_iterator<int *>(num + 2), + forward_iterator<int *>(num), forward_iterator<int *>(num))); + + BOOST_CHECK ( ! + ba::is_permutation ( + random_access_iterator<int *>(num + 1), random_access_iterator<int *>(num + 2), + random_access_iterator<int *>(num), random_access_iterator<int *>(num))); + + BOOST_CHECK ( ! + ba::is_permutation ( + random_access_iterator<int *>(num), random_access_iterator<int *>(num), + random_access_iterator<int *>(num + 1), random_access_iterator<int *>(num + 2))); + +// Something should be a permutation of itself + BOOST_CHECK ( + ba::is_permutation ( + forward_iterator<int *>(num), forward_iterator<int *>(num + sz), + forward_iterator<int *>(num))); + BOOST_CHECK ( + ba::is_permutation ( + forward_iterator<int *>(num), forward_iterator<int *>(num + sz), + forward_iterator<int *>(num), eq<int> )); + BOOST_CHECK ( + ba::is_permutation ( + forward_iterator<int *>(num), forward_iterator<int *>(num + sz), + forward_iterator<int *>(num), forward_iterator<int *>(num + sz ))); + BOOST_CHECK ( + ba::is_permutation ( + forward_iterator<int *>(num), forward_iterator<int *>(num + sz), + forward_iterator<int *>(num), forward_iterator<int *>(num + sz ), + eq<int> )); + + BOOST_CHECK ( + ba::is_permutation ( + random_access_iterator<int *>(num), random_access_iterator<int *>(num + sz), + random_access_iterator<int *>(num), random_access_iterator<int *>(num + sz))); + BOOST_CHECK ( + ba::is_permutation ( + random_access_iterator<int *>(num), random_access_iterator<int *>(num + sz), + random_access_iterator<int *>(num), random_access_iterator<int *>(num + sz), + eq<int> )); + BOOST_CHECK ( + ba::is_permutation ( + random_access_iterator<int *>(num), random_access_iterator<int *>(num + sz), + forward_iterator<int *>(num), forward_iterator<int *>(num + sz), + eq<int> )); + + std::vector<int> v, v1; v.clear (); @@ -42,8 +130,7 @@ void test_sequence1 () { } -int test_main( int , char* [] ) +BOOST_AUTO_TEST_CASE( test_main ) { test_sequence1 (); - return 0; } diff --git a/libs/algorithm/test/iterator_test.hpp b/libs/algorithm/test/iterator_test.hpp new file mode 100644 index 0000000000..a79e7cfb16 --- /dev/null +++ b/libs/algorithm/test/iterator_test.hpp @@ -0,0 +1,305 @@ +/* + Copyright (c) Marshall Clow 2013. + + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + + For more information, see http://www.boost.org +*/ + +#ifndef ITERATOR_TEST_H +#define ITERATOR_TEST_H + +/* + A set of iterator adapters for constructing test cases + From an iterator (or a pointer), you can make any class of iterator. + Assuming you want to degrade the capabilities. + + Modeled closely on work that Howard Hinnant did for libc++. +*/ + +#include <iterator> + +// == Input Iterator == +template <typename It> +class input_iterator { +public: + typedef std::input_iterator_tag iterator_category; + typedef typename std::iterator_traits<It>::value_type value_type; + typedef typename std::iterator_traits<It>::difference_type difference_type; + typedef It pointer; + typedef typename std::iterator_traits<It>::reference reference; + + It base() const {return it_;} + + input_iterator() : it_() {} + explicit input_iterator(It it) : it_(it) {} + + template <typename U> + input_iterator(const input_iterator<U>& u) :it_(u.it_) {} + + reference operator*() const {return *it_;} + pointer operator->() const {return it_;} + + input_iterator& operator++() {++it_; return *this;} + input_iterator operator++(int) {input_iterator tmp(*this); ++(*this); return tmp;} + + friend bool operator==(const input_iterator& x, const input_iterator& y) + {return x.it_ == y.it_;} + friend bool operator!=(const input_iterator& x, const input_iterator& y) + {return !(x == y);} + +private: + It it_; + template <typename U> friend class input_iterator; +}; + +template <typename T, typename U> +inline bool +operator==(const input_iterator<T>& x, const input_iterator<U>& y) +{ + return x.base() == y.base(); +} + +template <typename T, typename U> +inline bool +operator!=(const input_iterator<T>& x, const input_iterator<U>& y) +{ + return !(x == y); +} + + +// == Forward Iterator == +template <typename It> +class forward_iterator { +public: + typedef std::forward_iterator_tag iterator_category; + typedef typename std::iterator_traits<It>::value_type value_type; + typedef typename std::iterator_traits<It>::difference_type difference_type; + typedef It pointer; + typedef typename std::iterator_traits<It>::reference reference; + + It base() const {return it_;} + + forward_iterator() : it_() {} + explicit forward_iterator(It it) : it_(it) {} + template <typename U> + forward_iterator(const forward_iterator<U>& u) :it_(u.it_) {} + + reference operator*() const {return *it_;} + pointer operator->() const {return it_;} + + forward_iterator& operator++() {++it_; return *this;} + forward_iterator operator++(int) {forward_iterator tmp(*this); ++(*this); return tmp;} + + friend bool operator==(const forward_iterator& x, const forward_iterator& y) + {return x.it_ == y.it_;} + friend bool operator!=(const forward_iterator& x, const forward_iterator& y) + {return !(x == y);} +private: + It it_; + + template <typename U> friend class forward_iterator; +}; + +template <typename T, typename U> +inline bool +operator==(const forward_iterator<T>& x, const forward_iterator<U>& y) +{ + return x.base() == y.base(); +} + +template <typename T, typename U> +inline bool +operator!=(const forward_iterator<T>& x, const forward_iterator<U>& y) +{ + return !(x == y); +} + +// == Bidirectional Iterator == +template <typename It> +class bidirectional_iterator +{ +public: + typedef std::bidirectional_iterator_tag iterator_category; + typedef typename std::iterator_traits<It>::value_type value_type; + typedef typename std::iterator_traits<It>::difference_type difference_type; + typedef It pointer; + typedef typename std::iterator_traits<It>::reference reference; + + It base() const {return it_;} + + bidirectional_iterator() : it_() {} + explicit bidirectional_iterator(It it) : it_(it) {} + template <typename U> + bidirectional_iterator(const bidirectional_iterator<U>& u) :it_(u.it_) {} + + reference operator*() const {return *it_;} + pointer operator->() const {return it_;} + + bidirectional_iterator& operator++() {++it_; return *this;} + bidirectional_iterator operator++(int) {bidirectional_iterator tmp(*this); ++(*this); return tmp;} + + bidirectional_iterator& operator--() {--it_; return *this;} + bidirectional_iterator operator--(int) {bidirectional_iterator tmp(*this); --(*this); return tmp;} +private: + It it_; + template <typename U> friend class bidirectional_iterator; +}; + +template <typename T, typename U> +inline bool +operator==(const bidirectional_iterator<T>& x, const bidirectional_iterator<U>& y) +{ + return x.base() == y.base(); +} + +template <typename T, typename U> +inline bool +operator!=(const bidirectional_iterator<T>& x, const bidirectional_iterator<U>& y) +{ + return !(x == y); +} + + +// == Random Access Iterator == +template <typename It> +class random_access_iterator { +public: + typedef std::random_access_iterator_tag iterator_category; + typedef typename std::iterator_traits<It>::value_type value_type; + typedef typename std::iterator_traits<It>::difference_type difference_type; + typedef It pointer; + typedef typename std::iterator_traits<It>::reference reference; + + It base() const {return it_;} + + random_access_iterator() : it_() {} + explicit random_access_iterator(It it) : it_(it) {} + template <typename U> + random_access_iterator(const random_access_iterator<U>& u) :it_(u.it_) {} + + reference operator*() const {return *it_;} + pointer operator->() const {return it_;} + + random_access_iterator& operator++() {++it_; return *this;} + random_access_iterator operator++(int) {random_access_iterator tmp(*this); ++(*this); return tmp;} + + random_access_iterator& operator--() {--it_; return *this;} + random_access_iterator operator--(int) {random_access_iterator tmp(*this); --(*this); return tmp;} + + random_access_iterator& operator+=(difference_type n) {it_ += n; return *this;} + random_access_iterator operator+ (difference_type n) const {random_access_iterator tmp(*this); tmp += n; return tmp;} + friend random_access_iterator operator+(difference_type n, random_access_iterator x) {x += n; return x;} + + random_access_iterator& operator-=(difference_type n) {return *this += -n;} + random_access_iterator operator- (difference_type n) const {random_access_iterator tmp(*this); tmp -= n; return tmp;} + + reference operator[](difference_type n) const {return it_[n];} +private: + It it_; + + template <typename U> friend class random_access_iterator; +}; + +template <typename T, typename U> +inline bool +operator==(const random_access_iterator<T>& x, const random_access_iterator<U>& y) +{ + return x.base() == y.base(); +} + +template <typename T, typename U> +inline bool +operator!=(const random_access_iterator<T>& x, const random_access_iterator<U>& y) +{ + return !(x == y); +} + +template <typename T, typename U> +inline bool +operator<(const random_access_iterator<T>& x, const random_access_iterator<U>& y) +{ + return x.base() < y.base(); +} + +template <typename T, typename U> +inline bool +operator<=(const random_access_iterator<T>& x, const random_access_iterator<U>& y) +{ + return !(y < x); +} + +template <typename T, typename U> +inline bool +operator>(const random_access_iterator<T>& x, const random_access_iterator<U>& y) +{ + return y < x; +} + +template <typename T, typename U> +inline bool +operator>=(const random_access_iterator<T>& x, const random_access_iterator<U>& y) +{ + return !(x < y); +} + +template <typename T, typename U> +inline typename std::iterator_traits<T>::difference_type +operator-(const random_access_iterator<T>& x, const random_access_iterator<U>& y) +{ + return x.base() - y.base(); +} + + +// == Output Iterator == +template <typename It> +class output_iterator { +public: + typedef std::output_iterator_tag iterator_category; + typedef void value_type; + typedef typename std::iterator_traits<It>::difference_type difference_type; + typedef It pointer; + typedef typename std::iterator_traits<It>::reference reference; + + It base() const {return it_;} + + output_iterator () {} + explicit output_iterator(It it) : it_(it) {} + + template <typename U> + output_iterator(const output_iterator<U>& u) :it_(u.it_) {} + + reference operator*() const {return *it_;} + + output_iterator& operator++() {++it_; return *this;} + output_iterator operator++(int) {output_iterator tmp(*this); ++(*this); return tmp;} + +private: + It it_; + template <typename U> friend class output_iterator; + }; + +// No comparison operators for output iterators + + +// == Get the base of an iterator; used for comparisons == +template <typename Iter> +inline Iter base(output_iterator<Iter> i) { return i.base(); } + +template <typename Iter> +inline Iter base(input_iterator<Iter> i) { return i.base(); } + +template <typename Iter> +inline Iter base(forward_iterator<Iter> i) { return i.base(); } + +template <typename Iter> +inline Iter base(bidirectional_iterator<Iter> i) { return i.base(); } + +template <typename Iter> +inline Iter base(random_access_iterator<Iter> i) { return i.base(); } + +template <typename Iter> // everything else +inline Iter base(Iter i) { return i; } + +#endif // ITERATORS_H diff --git a/libs/algorithm/test/mismatch_test.cpp b/libs/algorithm/test/mismatch_test.cpp new file mode 100644 index 0000000000..61a7506a86 --- /dev/null +++ b/libs/algorithm/test/mismatch_test.cpp @@ -0,0 +1,168 @@ +/* + Copyright (c) Marshall Clow 2013. + + Distributed under the Boost Software License, Version 1.0. (See accompanying + file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) + + For more information, see http://www.boost.org +*/ + +#include <boost/config.hpp> +#include <boost/algorithm/cxx14/mismatch.hpp> + +#include "iterator_test.hpp" + +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> + +template <typename T> +bool eq ( const T& a, const T& b ) { return a == b; } + +template <typename T> +bool never_eq ( const T&, const T& ) { return false; } + +namespace ba = boost::algorithm; + +template <typename Iter1, typename Iter2> +bool iter_eq ( std::pair<Iter1, Iter2> pr, Iter1 first, Iter2 second ) { + return pr.first == first && pr.second == second; + } + +void test_mismatch () +{ +// Note: The literal values here are tested against directly, careful if you change them: + int num[] = { 1, 1, 2, 3, 5 }; + const int sz = sizeof (num)/sizeof(num[0]); + + +// No mismatch for empty sequences + BOOST_CHECK ( iter_eq ( + ba::mismatch ( input_iterator<int *>(num), input_iterator<int *>(num), + input_iterator<int *>(num), input_iterator<int *>(num)), + input_iterator<int *>(num), input_iterator<int *>(num))); + BOOST_CHECK ( iter_eq ( + ba::mismatch ( input_iterator<int *>(num), input_iterator<int *>(num), + input_iterator<int *>(num), input_iterator<int *>(num), + never_eq<int> ), + input_iterator<int *>(num), input_iterator<int *>(num))); + + BOOST_CHECK ( iter_eq ( + ba::mismatch ( random_access_iterator<int *>(num), random_access_iterator<int *>(num), + random_access_iterator<int *>(num), random_access_iterator<int *>(num), + never_eq<int> ), + random_access_iterator<int *>(num), random_access_iterator<int *>(num))); + +// Empty vs. non-empty mismatch immediately + BOOST_CHECK ( iter_eq ( + ba::mismatch ( input_iterator<int *>(num), input_iterator<int *>(num), + input_iterator<int *>(num), input_iterator<int *>(num + 1)), + input_iterator<int *>(num), input_iterator<int *>(num))); + + BOOST_CHECK ( iter_eq ( + ba::mismatch ( input_iterator<int *>(num + 1), input_iterator<int *>(num + 2), + input_iterator<int *>(num), input_iterator<int *>(num)), + input_iterator<int *>(num + 1), input_iterator<int *>(num))); + + BOOST_CHECK ( iter_eq ( + ba::mismatch ( random_access_iterator<int *>(num + 1), random_access_iterator<int *>(num + 2), + random_access_iterator<int *>(num), random_access_iterator<int *>(num)), + random_access_iterator<int *>(num + 1), random_access_iterator<int *>(num))); + +// Single element sequences are equal if they contain the same value + BOOST_CHECK ( iter_eq ( + ba::mismatch ( input_iterator<int *>(num), input_iterator<int *>(num + 1), + input_iterator<int *>(num), input_iterator<int *>(num + 1)), + input_iterator<int *>(num + 1), input_iterator<int *>(num + 1))); + + BOOST_CHECK ( iter_eq ( + ba::mismatch ( input_iterator<int *>(num), input_iterator<int *>(num + 1), + input_iterator<int *>(num), input_iterator<int *>(num + 1), + eq<int> ), + input_iterator<int *>(num + 1), input_iterator<int *>(num + 1))); + + BOOST_CHECK ( iter_eq ( + ba::mismatch ( random_access_iterator<int *>(num), random_access_iterator<int *>(num + 1), + random_access_iterator<int *>(num), random_access_iterator<int *>(num + 1), + eq<int> ), + random_access_iterator<int *>(num + 1), random_access_iterator<int *>(num + 1))); + + + BOOST_CHECK ( iter_eq ( + ba::mismatch ( input_iterator<int *>(num), input_iterator<int *>(num + 1), + input_iterator<int *>(num), input_iterator<int *>(num + 1), + never_eq<int> ), + input_iterator<int *>(num), input_iterator<int *>(num))); + + BOOST_CHECK ( iter_eq ( + ba::mismatch ( random_access_iterator<int *>(num), random_access_iterator<int *>(num + 1), + random_access_iterator<int *>(num), random_access_iterator<int *>(num + 1), + never_eq<int> ), + random_access_iterator<int *>(num), random_access_iterator<int *>(num))); + + BOOST_CHECK ( iter_eq ( + ba::mismatch ( input_iterator<int *>(num), input_iterator<int *>(num + 1), + input_iterator<int *>(num + 1), input_iterator<int *>(num + 2)), + input_iterator<int *>(num + 1), input_iterator<int *>(num + 2))); + + BOOST_CHECK ( iter_eq ( + ba::mismatch ( input_iterator<int *>(num), input_iterator<int *>(num + 1), + input_iterator<int *>(num + 1), input_iterator<int *>(num + 2), + eq<int> ), + input_iterator<int *>(num + 1), input_iterator<int *>(num + 2))); + + BOOST_CHECK ( iter_eq ( + ba::mismatch ( input_iterator<int *>(num + 2), input_iterator<int *>(num + 3), + input_iterator<int *>(num), input_iterator<int *>(num + 1)), + input_iterator<int *>(num + 2), input_iterator<int *>(num))); + + BOOST_CHECK ( iter_eq ( + ba::mismatch ( input_iterator<int *>(num + 2), input_iterator<int *>(num + 3), + input_iterator<int *>(num), input_iterator<int *>(num + 1), + eq<int> ), + input_iterator<int *>(num + 2), input_iterator<int *>(num))); + + + +// Identical long sequences are equal. + BOOST_CHECK ( iter_eq ( + ba::mismatch ( input_iterator<int *>(num), input_iterator<int *>(num + sz), + input_iterator<int *>(num), input_iterator<int *>(num + sz)), + input_iterator<int *>(num + sz), input_iterator<int *>(num + sz))); + + BOOST_CHECK ( iter_eq ( + ba::mismatch ( input_iterator<int *>(num), input_iterator<int *>(num + sz), + input_iterator<int *>(num), input_iterator<int *>(num + sz), + eq<int> ), + input_iterator<int *>(num + sz), input_iterator<int *>(num + sz))); + + BOOST_CHECK ( iter_eq ( + ba::mismatch ( input_iterator<int *>(num), input_iterator<int *>(num + sz), + input_iterator<int *>(num), input_iterator<int *>(num + sz), + never_eq<int> ), + input_iterator<int *>(num), input_iterator<int *>(num))); + + BOOST_CHECK ( iter_eq ( + ba::mismatch ( input_iterator<int *>(num), input_iterator<int *>(num + sz), + random_access_iterator<int *>(num), random_access_iterator<int *>(num + sz), + never_eq<int> ), + input_iterator<int *>(num), random_access_iterator<int *>(num))); + +// different sequences are different + BOOST_CHECK ( iter_eq ( + ba::mismatch ( input_iterator<int *>(num + 1), input_iterator<int *>(num + sz), + input_iterator<int *>(num), input_iterator<int *>(num + sz)), + input_iterator<int *>(num + 2), input_iterator<int *>(num + 1))); + + BOOST_CHECK ( iter_eq ( + ba::mismatch ( input_iterator<int *>(num + 1), input_iterator<int *>(num + sz), + input_iterator<int *>(num), input_iterator<int *>(num + sz), + eq<int> ), + input_iterator<int *>(num + 2), input_iterator<int *>(num + 1))); + +} + + +BOOST_AUTO_TEST_CASE( test_main ) +{ + test_mismatch (); +} diff --git a/libs/algorithm/test/none_of_test.cpp b/libs/algorithm/test/none_of_test.cpp index ab7ded3375..fc74945e9a 100644 --- a/libs/algorithm/test/none_of_test.cpp +++ b/libs/algorithm/test/none_of_test.cpp @@ -9,7 +9,9 @@ #include <boost/config.hpp> #include <boost/algorithm/cxx11/none_of.hpp> -#include <boost/test/included/test_exec_monitor.hpp> + +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> #include <functional> #include <vector> @@ -89,8 +91,7 @@ void test_none() BOOST_CHECK (!ba::none_of ( li.begin(), l_iter, is_<int> ( 5 ))); } -int test_main( int , char* [] ) +BOOST_AUTO_TEST_CASE( test_main ) { test_none(); - return 0; } diff --git a/libs/algorithm/test/one_of_test.cpp b/libs/algorithm/test/one_of_test.cpp index 0b3f5e0c94..9422881893 100644 --- a/libs/algorithm/test/one_of_test.cpp +++ b/libs/algorithm/test/one_of_test.cpp @@ -9,7 +9,9 @@ #include <boost/config.hpp> #include <boost/algorithm/cxx11/one_of.hpp> -#include <boost/test/included/test_exec_monitor.hpp> + +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> #include <functional> #include <vector> @@ -94,8 +96,7 @@ void test_one () } -int test_main( int , char* [] ) +BOOST_AUTO_TEST_CASE( test_main ) { test_one (); - return 0; } diff --git a/libs/algorithm/test/ordered_test.cpp b/libs/algorithm/test/ordered_test.cpp index 8265c5b483..dbaf94039a 100644 --- a/libs/algorithm/test/ordered_test.cpp +++ b/libs/algorithm/test/ordered_test.cpp @@ -13,7 +13,9 @@ #include <iostream> #include <boost/algorithm/cxx11/is_sorted.hpp> -#include <boost/test/included/test_exec_monitor.hpp> + +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> using namespace boost; @@ -146,9 +148,8 @@ test_increasing_decreasing(void) } -int test_main( int, char * [] ) +BOOST_AUTO_TEST_CASE( test_main ) { test_ordered (); test_increasing_decreasing (); - return 0; } diff --git a/libs/algorithm/test/partition_copy_test1.cpp b/libs/algorithm/test/partition_copy_test1.cpp index f3d8d2a1f1..c3afb1e699 100644 --- a/libs/algorithm/test/partition_copy_test1.cpp +++ b/libs/algorithm/test/partition_copy_test1.cpp @@ -11,7 +11,9 @@ #include <boost/config.hpp> #include <boost/algorithm/cxx11/partition_copy.hpp> -#include <boost/test/included/test_exec_monitor.hpp> + +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> #include <boost/algorithm/cxx11/all_of.hpp> #include <boost/algorithm/cxx11/none_of.hpp> @@ -80,8 +82,7 @@ void test_sequence1 () { } -int test_main( int , char* [] ) +BOOST_AUTO_TEST_CASE( test_main ) { test_sequence1 (); - return 0; } diff --git a/libs/algorithm/test/partition_point_test1.cpp b/libs/algorithm/test/partition_point_test1.cpp index 4306a4aef7..95f6058035 100644 --- a/libs/algorithm/test/partition_point_test1.cpp +++ b/libs/algorithm/test/partition_point_test1.cpp @@ -11,7 +11,9 @@ #include <boost/config.hpp> #include <boost/algorithm/cxx11/partition_point.hpp> -#include <boost/test/included/test_exec_monitor.hpp> + +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> #include <string> #include <vector> @@ -91,8 +93,7 @@ void test_sequence1 () { } -int test_main( int , char* [] ) +BOOST_AUTO_TEST_CASE( test_main ) { test_sequence1 (); - return 0; } diff --git a/libs/algorithm/test/search_fail1.cpp b/libs/algorithm/test/search_fail1.cpp index 15459a4e72..2b9f6f7fb6 100644 --- a/libs/algorithm/test/search_fail1.cpp +++ b/libs/algorithm/test/search_fail1.cpp @@ -10,7 +10,7 @@ #include <vector> #include <boost/algorithm/searching/boyer_moore.hpp> -int main( int argc, char *argv [] ) +int main( int , char* [] ) { std::vector<char> cv; std::vector<int> iv; @@ -20,7 +20,5 @@ int main( int argc, char *argv [] ) (void) boost::algorithm::boyer_moore_search ( cv.begin (), cv.end (), iv.begin (), iv.end ()); - - (void) argv; (void) argc; return 0; } diff --git a/libs/algorithm/test/search_fail2.cpp b/libs/algorithm/test/search_fail2.cpp index 7b90f1bf08..463d242415 100644 --- a/libs/algorithm/test/search_fail2.cpp +++ b/libs/algorithm/test/search_fail2.cpp @@ -11,7 +11,7 @@ #include <boost/cstdint.hpp> #include <boost/algorithm/searching/boyer_moore.hpp> -int main( int argc, char *argv [] ) +int main( int , char* [] ) { std::vector<boost::uint8_t> cv; std::vector<boost:: int8_t> iv; @@ -21,7 +21,5 @@ int main( int argc, char *argv [] ) (void) boost::algorithm::boyer_moore_search ( cv.begin (), cv.end (), iv.begin (), iv.end ()); - - (void) argv; (void) argc; return 0; } diff --git a/libs/algorithm/test/search_fail3.cpp b/libs/algorithm/test/search_fail3.cpp index b2f1febeda..caf8335d05 100644 --- a/libs/algorithm/test/search_fail3.cpp +++ b/libs/algorithm/test/search_fail3.cpp @@ -10,11 +10,10 @@ #include <vector> #include <boost/algorithm/searching/boyer_moore.hpp> -int main( int argc, char *argv [] ) +int main( int , char* [] ) { // Should fail to compile because the search objects are not default-constructible boost::algorithm::boyer_moore<std::vector<char>::iterator> bm; - (void) argv; (void) argc; return 0; } diff --git a/libs/algorithm/test/search_test1.cpp b/libs/algorithm/test/search_test1.cpp index e33a6ad3fa..7c49a3a823 100644 --- a/libs/algorithm/test/search_test1.cpp +++ b/libs/algorithm/test/search_test1.cpp @@ -11,7 +11,8 @@ #include <boost/algorithm/searching/boyer_moore_horspool.hpp> #include <boost/algorithm/searching/knuth_morris_pratt.hpp> -#include <boost/test/included/test_exec_monitor.hpp> +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> #include <iostream> #include <string> @@ -218,7 +219,7 @@ namespace { } -int test_main( int , char* [] ) +BOOST_AUTO_TEST_CASE( test_main ) { std::string haystack1 ( "NOW AN FOWE\220ER ANNMAN THE ANPANMANEND" ); std::string needle1 ( "ANPANMAN" ); @@ -268,5 +269,4 @@ int test_main( int , char* [] ) const std::string mikhail_corpus = std::string (8, 'a') + mikhail_pattern; check_one ( mikhail_corpus, mikhail_pattern, 8 ); - return 0; } diff --git a/libs/algorithm/test/search_test2.cpp b/libs/algorithm/test/search_test2.cpp index 0b3295f46d..4d772caaca 100644 --- a/libs/algorithm/test/search_test2.cpp +++ b/libs/algorithm/test/search_test2.cpp @@ -11,9 +11,13 @@ #include <boost/algorithm/searching/boyer_moore_horspool.hpp> #include <boost/algorithm/searching/knuth_morris_pratt.hpp> -#include <boost/test/included/test_exec_monitor.hpp> +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> +#include <ctime> // for clock_t #include <iostream> +#include <fstream> +#include <iomanip> #include <algorithm> #include <vector> @@ -122,7 +126,7 @@ namespace { } } -int test_main( int , char* [] ) +BOOST_AUTO_TEST_CASE( test_main ) { vec c1 = ReadFromFile ( "search_test_data/0001.corpus" ); vec p1b = ReadFromFile ( "search_test_data/0001b.pat" ); @@ -140,6 +144,4 @@ int test_main( int , char* [] ) check_one ( c1, p1e, c1.size() - p1e.size ()); std::cout << "--- Not found ---" << std::endl; check_one ( c1, p1n, -1 ); // Not found - - return 0; } diff --git a/libs/algorithm/test/search_test3.cpp b/libs/algorithm/test/search_test3.cpp index ee5730358c..96226cdbc0 100644 --- a/libs/algorithm/test/search_test3.cpp +++ b/libs/algorithm/test/search_test3.cpp @@ -11,9 +11,13 @@ #include <boost/algorithm/searching/boyer_moore_horspool.hpp> #include <boost/algorithm/searching/knuth_morris_pratt.hpp> -#include <boost/test/included/test_exec_monitor.hpp> +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> +#include <ctime> // for clock_t #include <iostream> +#include <fstream> +#include <iomanip> #include <algorithm> #include <vector> #include <string> @@ -122,7 +126,7 @@ namespace { } } -int test_main( int , char* [] ) +BOOST_AUTO_TEST_CASE( test_main ) { vec c1 = ReadFromFile ( "search_test_data/0001.corpus" ); vec p1b = ReadFromFile ( "search_test_data/0002b.pat" ); @@ -140,6 +144,4 @@ int test_main( int , char* [] ) check_one ( c1, p1e, c1.size() - p1e.size ()); std::cout << "--- Not found ---" << std::endl; check_one ( c1, p1n, -1 ); // Not found - - return 0; } diff --git a/libs/algorithm/test/search_test4.cpp b/libs/algorithm/test/search_test4.cpp index ff82d1c1d7..2b83267f92 100644 --- a/libs/algorithm/test/search_test4.cpp +++ b/libs/algorithm/test/search_test4.cpp @@ -13,9 +13,12 @@ #include <boost/algorithm/searching/boyer_moore_horspool.hpp> #include <boost/algorithm/searching/knuth_morris_pratt.hpp> -#include <boost/test/included/test_exec_monitor.hpp> +#define BOOST_TEST_MAIN +#include <boost/test/unit_test.hpp> #include <iostream> +#include <fstream> +#include <iomanip> #include <algorithm> #include <vector> #include <string> @@ -93,7 +96,7 @@ namespace { } -int test_main( int , char* [] ) +BOOST_AUTO_TEST_CASE( test_main ) { vec c1 = ReadFromFile ( "search_test_data/0001.corpus" ); vec p1b = ReadFromFile ( "search_test_data/0002b.pat" ); @@ -111,6 +114,4 @@ int test_main( int , char* [] ) check_one ( c1, p1e, c1.size() - p1e.size ()); std::cout << "--- Not found ---" << std::endl; check_one ( c1, p1n, -1 ); // Not found - - return 0; } |