summaryrefslogtreecommitdiff
path: root/doc/html/boost/algorithm/token_finder.html
diff options
context:
space:
mode:
Diffstat (limited to 'doc/html/boost/algorithm/token_finder.html')
-rw-r--r--doc/html/boost/algorithm/token_finder.html14
1 files changed, 4 insertions, 10 deletions
diff --git a/doc/html/boost/algorithm/token_finder.html b/doc/html/boost/algorithm/token_finder.html
index 9bf8ebdace..a5f3effa89 100644
--- a/doc/html/boost/algorithm/token_finder.html
+++ b/doc/html/boost/algorithm/token_finder.html
@@ -4,7 +4,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Function template token_finder</title>
<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.78.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
<link rel="home" href="../../index.html" title="The Boost C++ Libraries BoostBook Documentation Subset">
<link rel="up" href="../../string_algo/reference.html#header.boost.algorithm.string.finder_hpp" title="Header &lt;boost/algorithm/string/finder.hpp&gt;">
<link rel="prev" href="tail_finder.html" title="Function tail_finder">
@@ -37,26 +37,20 @@
<span class="emphasis"><em><span class="identifier">unspecified</span></em></span> <span class="identifier">token_finder</span><span class="special">(</span><span class="identifier">PredicateT</span> Pred<span class="special">,</span>
<span class="identifier">token_compress_mode_type</span> eCompress <span class="special">=</span> <span class="identifier">token_compress_off</span><span class="special">)</span><span class="special">;</span></pre></div>
<div class="refsect1">
-<a name="idm45555124286912"></a><h2>Description</h2>
+<a name="idp402946096"></a><h2>Description</h2>
<p>Construct the <code class="computeroutput">token_finder</code>. The finder searches for a token specified by a predicate. It is similar to std::find_if algorithm, with an exception that it return a range of instead of a single iterator.</p>
<p>If "compress token mode" is enabled, adjacent matching tokens are concatenated into one match. Thus the finder can be used to search for continuous segments of characters satisfying the given predicate.</p>
<p>The result is given as an <code class="computeroutput">iterator_range</code> delimiting the match.</p>
<p>
</p>
-<div class="variablelist"><table border="0" class="variablelist compact">
-<colgroup>
+<div class="variablelist"><table border="0">
<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>
+<td><div class="variablelist"><table border="0">
<col align="left" valign="top">
-<col>
-</colgroup>
<tbody>
<tr>
<td><p><span class="term"><code class="computeroutput">Pred</code></span></p></td>