diff options
author | DongHun Kwak <dh0128.kwak@samsung.com> | 2017-09-13 11:05:34 +0900 |
---|---|---|
committer | DongHun Kwak <dh0128.kwak@samsung.com> | 2017-09-13 11:06:28 +0900 |
commit | 34bd32e225e2a8a94104489b31c42e5801cc1f4a (patch) | |
tree | d021b579a0c190354819974e1eaf0baa54b551f3 /doc/html/boost/algorithm/find_nth.html | |
parent | f763a99a501650eff2c60288aa6f10ef916d769e (diff) | |
download | boost-34bd32e225e2a8a94104489b31c42e5801cc1f4a.tar.gz boost-34bd32e225e2a8a94104489b31c42e5801cc1f4a.tar.bz2 boost-34bd32e225e2a8a94104489b31c42e5801cc1f4a.zip |
Imported Upstream version 1.63.0upstream/1.63.0
Change-Id: Iac85556a04b7e58d63ba636dedb0986e3555714a
Signed-off-by: DongHun Kwak <dh0128.kwak@samsung.com>
Diffstat (limited to 'doc/html/boost/algorithm/find_nth.html')
-rw-r--r-- | doc/html/boost/algorithm/find_nth.html | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/html/boost/algorithm/find_nth.html b/doc/html/boost/algorithm/find_nth.html index d496bd2f22..fd79e160d5 100644 --- a/doc/html/boost/algorithm/find_nth.html +++ b/doc/html/boost/algorithm/find_nth.html @@ -37,7 +37,7 @@ <span class="identifier">iterator_range</span><span class="special"><</span> <span class="keyword">typename</span> <span class="identifier">range_iterator</span><span class="special"><</span> <span class="identifier">Range1T</span> <span class="special">></span><span class="special">::</span><span class="identifier">type</span> <span class="special">></span> <span class="identifier">find_nth</span><span class="special">(</span><span class="identifier">Range1T</span> <span class="special">&</span> Input<span class="special">,</span> <span class="keyword">const</span> <span class="identifier">Range2T</span> <span class="special">&</span> Search<span class="special">,</span> <span class="keyword">int</span> Nth<span class="special">)</span><span class="special">;</span></pre></div> <div class="refsect1"> -<a name="idm45928161480784"></a><h2>Description</h2> +<a name="idp116631808"></a><h2>Description</h2> <p>Search for the n-th (zero-indexed) occurrence of the substring in the input.</p> <p> |