mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2024-11-29 01:03:45 +00:00
191 lines
No EOL
12 KiB
HTML
191 lines
No EOL
12 KiB
HTML
|
|
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
|
|
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
|
|
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
|
|
|
|
<title>find_end — Sprout 1.0 documentation</title>
|
|
|
|
<link rel="stylesheet" href="../../_static/sphinxdoc.css" type="text/css" />
|
|
<link rel="stylesheet" href="../../_static/pygments.css" type="text/css" />
|
|
|
|
<script type="text/javascript">
|
|
var DOCUMENTATION_OPTIONS = {
|
|
URL_ROOT: '../../',
|
|
VERSION: '1.0',
|
|
COLLAPSE_INDEX: false,
|
|
FILE_SUFFIX: '.html',
|
|
HAS_SOURCE: true
|
|
};
|
|
</script>
|
|
<script type="text/javascript" src="../../_static/jquery.js"></script>
|
|
<script type="text/javascript" src="../../_static/underscore.js"></script>
|
|
<script type="text/javascript" src="../../_static/doctools.js"></script>
|
|
<link rel="top" title="Sprout 1.0 documentation" href="../../index.html" />
|
|
<link rel="up" title="Sprout.Algorithm" href="index.html" />
|
|
<link rel="next" title="find_first_of" href="find_first_of.html" />
|
|
<link rel="prev" title="find_if_not" href="find_if_not.html" />
|
|
</head>
|
|
<body>
|
|
<div class="related">
|
|
<h3>Navigation</h3>
|
|
<ul>
|
|
<li class="right" style="margin-right: 10px">
|
|
<a href="../../genindex.html" title="General Index"
|
|
accesskey="I">index</a></li>
|
|
<li class="right" >
|
|
<a href="find_first_of.html" title="find_first_of"
|
|
accesskey="N">next</a> |</li>
|
|
<li class="right" >
|
|
<a href="find_if_not.html" title="find_if_not"
|
|
accesskey="P">previous</a> |</li>
|
|
<li><a href="../../index.html">Sprout 1.0 documentation</a> »</li>
|
|
<li><a href="../index.html" >Libraries</a> »</li>
|
|
<li><a href="index.html" accesskey="U">Sprout.Algorithm</a> »</li>
|
|
</ul>
|
|
</div>
|
|
<div class="sphinxsidebar">
|
|
<div class="sphinxsidebarwrapper">
|
|
<h3><a href="../../index.html">Table Of Contents</a></h3>
|
|
<ul>
|
|
<li><a class="reference internal" href="#">find_end</a><ul>
|
|
<li><a class="reference internal" href="#interface">Interface</a></li>
|
|
<li><a class="reference internal" href="#effects">Effects</a></li>
|
|
<li><a class="reference internal" href="#returns">Returns</a></li>
|
|
<li><a class="reference internal" href="#examples">Examples</a></li>
|
|
<li><a class="reference internal" href="#complexity">Complexity</a></li>
|
|
<li><a class="reference internal" href="#header">Header</a></li>
|
|
</ul>
|
|
</li>
|
|
</ul>
|
|
|
|
<h4>Previous topic</h4>
|
|
<p class="topless"><a href="find_if_not.html"
|
|
title="previous chapter">find_if_not</a></p>
|
|
<h4>Next topic</h4>
|
|
<p class="topless"><a href="find_first_of.html"
|
|
title="next chapter">find_first_of</a></p>
|
|
<h3>This Page</h3>
|
|
<ul class="this-page-menu">
|
|
<li><a href="../../_sources/libs/algorithm/find_end.txt"
|
|
rel="nofollow">Show Source</a></li>
|
|
</ul>
|
|
<div id="searchbox" style="display: none">
|
|
<h3>Quick search</h3>
|
|
<form class="search" action="../../search.html" method="get">
|
|
<input type="text" name="q" />
|
|
<input type="submit" value="Go" />
|
|
<input type="hidden" name="check_keywords" value="yes" />
|
|
<input type="hidden" name="area" value="default" />
|
|
</form>
|
|
<p class="searchtip" style="font-size: 90%">
|
|
Enter search terms or a module, class or function name.
|
|
</p>
|
|
</div>
|
|
<script type="text/javascript">$('#searchbox').show(0);</script>
|
|
</div>
|
|
</div>
|
|
|
|
<div class="document">
|
|
<div class="documentwrapper">
|
|
<div class="bodywrapper">
|
|
<div class="body">
|
|
|
|
<div class="section" id="find-end">
|
|
<h1>find_end<a class="headerlink" href="#find-end" title="Permalink to this headline">¶</a></h1>
|
|
<div class="section" id="interface">
|
|
<h2>Interface<a class="headerlink" href="#interface" title="Permalink to this headline">¶</a></h2>
|
|
<div class="highlight-c++"><div class="highlight"><pre><span class="k">template</span><span class="o"><</span><span class="k">typename</span> <span class="n">ForwardIterator1</span><span class="p">,</span> <span class="k">typename</span> <span class="n">ForwardIterator2</span><span class="o">></span>
|
|
<span class="kr">inline</span> <span class="n">SPROUT_CONSTEXPR</span> <span class="n">ForwardIterator1</span>
|
|
<span class="n">find_end</span><span class="p">(</span>
|
|
<span class="n">ForwardIterator1</span> <span class="n">first1</span><span class="p">,</span> <span class="n">ForwardIterator1</span> <span class="n">last1</span><span class="p">,</span>
|
|
<span class="n">ForwardIterator2</span> <span class="n">first2</span><span class="p">,</span> <span class="n">ForwardIterator2</span> <span class="n">last2</span>
|
|
<span class="p">);</span>
|
|
|
|
<span class="k">template</span><span class="o"><</span><span class="k">typename</span> <span class="n">ForwardIterator1</span><span class="p">,</span> <span class="k">typename</span> <span class="n">ForwardIterator2</span><span class="p">,</span> <span class="k">typename</span> <span class="n">BinaryPredicate</span><span class="o">></span>
|
|
<span class="kr">inline</span> <span class="n">SPROUT_CONSTEXPR</span> <span class="n">ForwardIterator1</span>
|
|
<span class="n">find_end</span><span class="p">(</span>
|
|
<span class="n">ForwardIterator1</span> <span class="n">first1</span><span class="p">,</span> <span class="n">ForwardIterator1</span> <span class="n">last1</span><span class="p">,</span>
|
|
<span class="n">ForwardIterator2</span> <span class="n">first2</span><span class="p">,</span> <span class="n">ForwardIterator2</span> <span class="n">last2</span><span class="p">,</span>
|
|
<span class="n">BinaryPredicate</span> <span class="n">pred</span>
|
|
<span class="p">);</span>
|
|
</pre></div>
|
|
</div>
|
|
</div>
|
|
<div class="section" id="effects">
|
|
<h2>Effects<a class="headerlink" href="#effects" title="Permalink to this headline">¶</a></h2>
|
|
<div class="line-block">
|
|
<div class="line">Finds a subsequence of equal values in a sequence.</div>
|
|
</div>
|
|
</div>
|
|
<div class="section" id="returns">
|
|
<h2>Returns<a class="headerlink" href="#returns" title="Permalink to this headline">¶</a></h2>
|
|
<div class="line-block">
|
|
<div class="line">The last iterator i in the range [first1,last1 - (last2 - first2)) such that for any nonnegative integer <tt class="docutils literal"><span class="pre">n</span> <span class="pre"><</span> <span class="pre">(last2</span> <span class="pre">-</span> <span class="pre">first2)</span></tt>, the following corresponding conditions hold: <tt class="docutils literal"><span class="pre">*(i</span> <span class="pre">+</span> <span class="pre">n)</span> <span class="pre">==</span> <span class="pre">*(first2</span> <span class="pre">+</span> <span class="pre">n)</span></tt>, <tt class="docutils literal"><span class="pre">pred(*(i</span> <span class="pre">+</span> <span class="pre">n),</span> <span class="pre">*(first2</span> <span class="pre">+</span> <span class="pre">n))</span></tt>.</div>
|
|
<div class="line">Returns last1 if [first2,last2) is empty or if no such iterator is found.</div>
|
|
</div>
|
|
</div>
|
|
<div class="section" id="examples">
|
|
<h2>Examples<a class="headerlink" href="#examples" title="Permalink to this headline">¶</a></h2>
|
|
<div class="highlight-c++"><div class="highlight"><pre><span class="cp">#include <sprout/algorithm/find_end.hpp></span>
|
|
<span class="cp">#include <sprout/array.hpp></span>
|
|
<span class="cp">#include <sprout/container.hpp></span>
|
|
<span class="k">using</span> <span class="k">namespace</span> <span class="n">sprout</span><span class="p">;</span>
|
|
|
|
<span class="n">SPROUT_STATIC_CONSTEXPR</span> <span class="k">auto</span> <span class="n">input1</span> <span class="o">=</span> <span class="n">array</span><span class="o"><</span><span class="kt">int</span><span class="p">,</span> <span class="mi">10</span><span class="o">></span><span class="p">{{</span><span class="mi">1</span><span class="p">,</span> <span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">4</span><span class="p">,</span> <span class="mi">5</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">4</span><span class="p">,</span> <span class="mi">5</span><span class="p">}};</span>
|
|
<span class="n">SPROUT_STATIC_CONSTEXPR</span> <span class="k">auto</span> <span class="n">input2</span> <span class="o">=</span> <span class="n">array</span><span class="o"><</span><span class="kt">int</span><span class="p">,</span> <span class="mi">3</span><span class="o">></span><span class="p">{{</span><span class="mi">3</span><span class="p">,</span> <span class="mi">4</span><span class="p">,</span> <span class="mi">5</span><span class="p">}};</span>
|
|
<span class="n">SPROUT_STATIC_CONSTEXPR</span> <span class="k">auto</span> <span class="n">result</span> <span class="o">=</span> <span class="n">sprout</span><span class="o">::</span><span class="n">find_end</span><span class="p">(</span><span class="n">begin</span><span class="p">(</span><span class="n">input1</span><span class="p">),</span> <span class="n">end</span><span class="p">(</span><span class="n">input1</span><span class="p">),</span> <span class="n">begin</span><span class="p">(</span><span class="n">input2</span><span class="p">),</span> <span class="n">end</span><span class="p">(</span><span class="n">input2</span><span class="p">));</span>
|
|
<span class="n">static_assert</span><span class="p">(</span><span class="n">result</span> <span class="o">!=</span> <span class="n">end</span><span class="p">(</span><span class="n">input1</span><span class="p">),</span> <span class="s">"found a subsequence equal to input2 from input1."</span><span class="p">);</span>
|
|
<span class="n">static_assert</span><span class="p">(</span><span class="n">result</span> <span class="o">-</span> <span class="n">begin</span><span class="p">(</span><span class="n">input1</span><span class="p">)</span> <span class="o">==</span> <span class="mi">7</span><span class="p">,</span> <span class="s">"a found position is 7."</span><span class="p">);</span>
|
|
</pre></div>
|
|
</div>
|
|
</div>
|
|
<div class="section" id="complexity">
|
|
<h2>Complexity<a class="headerlink" href="#complexity" title="Permalink to this headline">¶</a></h2>
|
|
<div class="line-block">
|
|
<div class="line">At most <tt class="docutils literal"><span class="pre">(last2</span> <span class="pre">-</span> <span class="pre">first2)</span> <span class="pre">*</span> <span class="pre">(last1</span> <span class="pre">-</span> <span class="pre">first1</span> <span class="pre">-</span> <span class="pre">(last2</span> <span class="pre">-</span> <span class="pre">first2)</span> <span class="pre">+</span> <span class="pre">1)</span></tt> applications of the corresponding predicate.</div>
|
|
<div class="line">Recursive function invocations in <em>O(logN)</em> (logarithmic) depth.</div>
|
|
</div>
|
|
</div>
|
|
<div class="section" id="header">
|
|
<h2>Header<a class="headerlink" href="#header" title="Permalink to this headline">¶</a></h2>
|
|
<div class="line-block">
|
|
<div class="line"><tt class="docutils literal"><span class="pre">sprout/algorithm/find_end.hpp</span></tt></div>
|
|
<div class="line">Convenience header: <tt class="docutils literal"><span class="pre">sprout/algorithm.hpp</span></tt></div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
|
|
|
|
</div>
|
|
</div>
|
|
</div>
|
|
<div class="clearer"></div>
|
|
</div>
|
|
<div class="related">
|
|
<h3>Navigation</h3>
|
|
<ul>
|
|
<li class="right" style="margin-right: 10px">
|
|
<a href="../../genindex.html" title="General Index"
|
|
>index</a></li>
|
|
<li class="right" >
|
|
<a href="find_first_of.html" title="find_first_of"
|
|
>next</a> |</li>
|
|
<li class="right" >
|
|
<a href="find_if_not.html" title="find_if_not"
|
|
>previous</a> |</li>
|
|
<li><a href="../../index.html">Sprout 1.0 documentation</a> »</li>
|
|
<li><a href="../index.html" >Libraries</a> »</li>
|
|
<li><a href="index.html" >Sprout.Algorithm</a> »</li>
|
|
</ul>
|
|
</div>
|
|
<div class="footer">
|
|
© Copyright 2013, Bolero MURAKAMI.
|
|
Created using <a href="http://sphinx.pocoo.org/">Sphinx</a> 1.1.3.
|
|
</div>
|
|
</body>
|
|
</html> |