summaryrefslogtreecommitdiff
path: root/doc/html/boost/algorithm/iter_find.html
diff options
context:
space:
mode:
Diffstat (limited to 'doc/html/boost/algorithm/iter_find.html')
-rw-r--r--doc/html/boost/algorithm/iter_find.html2
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/html/boost/algorithm/iter_find.html b/doc/html/boost/algorithm/iter_find.html
index 6cf2a9a0a2..970326a8d1 100644
--- a/doc/html/boost/algorithm/iter_find.html
+++ b/doc/html/boost/algorithm/iter_find.html
@@ -37,7 +37,7 @@
<span class="identifier">SequenceSequenceT</span> <span class="special">&amp;</span>
<span class="identifier">iter_find</span><span class="special">(</span><span class="identifier">SequenceSequenceT</span> <span class="special">&amp;</span> Result<span class="special">,</span> <span class="identifier">RangeT</span> <span class="special">&amp;</span> Input<span class="special">,</span> <span class="identifier">FinderT</span> Finder<span class="special">)</span><span class="special">;</span></pre></div>
<div class="refsect1">
-<a name="idm45928160338384"></a><h2>Description</h2>
+<a name="idp117774048"></a><h2>Description</h2>
<p>This algorithm executes a given finder in iteration on the input, until the end of input is reached, or no match is found. Iteration is done using built-in <code class="computeroutput"><a class="link" href="find_iterator.html" title="Class template find_iterator">find_iterator</a></code>, so the real searching is performed only when needed. In each iteration new match is found and added to the result.</p>
<p>