summaryrefslogtreecommitdiff
path: root/doc/html/boost/algorithm/find_all.html
diff options
context:
space:
mode:
Diffstat (limited to 'doc/html/boost/algorithm/find_all.html')
-rw-r--r--doc/html/boost/algorithm/find_all.html2
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/html/boost/algorithm/find_all.html b/doc/html/boost/algorithm/find_all.html
index 1d536227fc..57d02f34a0 100644
--- a/doc/html/boost/algorithm/find_all.html
+++ b/doc/html/boost/algorithm/find_all.html
@@ -38,7 +38,7 @@
<span class="identifier">find_all</span><span class="special">(</span><span class="identifier">SequenceSequenceT</span> <span class="special">&amp;</span> Result<span class="special">,</span> <span class="identifier">Range1T</span> <span class="special">&amp;</span> Input<span class="special">,</span>
<span class="keyword">const</span> <span class="identifier">Range2T</span> <span class="special">&amp;</span> Search<span class="special">)</span><span class="special">;</span></pre></div>
<div class="refsect1">
-<a name="idm45928156743232"></a><h2>Description</h2>
+<a name="idp121369344"></a><h2>Description</h2>
<p>This algorithm finds all occurrences of the search string in the input.</p>
<p>Each part is copied and added as a new element to the output container. Thus the result container must be able to hold copies of the matches (in a compatible structure like std::string) or a reference to it (e.g. using the iterator range class). Examples of such a container are <code class="computeroutput">std::vector&lt;std::string&gt;</code> or <code class="computeroutput">std::list&lt;boost::iterator_range&lt;std::string::iterator&gt;&gt;</code> </p>
<p>