1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout synced 2024-11-12 21:09:01 +00:00
Sprout/docs/libs/sprout/algorithm/minmax.html

238 lines
15 KiB
HTML
Raw Normal View History

2013-08-30 02:14:14 +00:00
2013-08-23 14:30:09 +00:00
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
2013-08-30 02:14:14 +00:00
2013-08-23 14:30:09 +00:00
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
2013-08-30 02:14:14 +00:00
<title>minmax &mdash; Sprout 1.0 documentation</title>
2013-08-25 15:09:33 +00:00
<link rel="stylesheet" href="../../../_static/sphinxdoc.css" type="text/css" />
2013-08-23 14:30:09 +00:00
<link rel="stylesheet" href="../../../_static/pygments.css" type="text/css" />
2013-08-30 02:14:14 +00:00
2013-08-23 14:30:09 +00:00
<script type="text/javascript">
var DOCUMENTATION_OPTIONS = {
URL_ROOT: '../../../',
VERSION: '1.0',
2013-08-30 02:14:14 +00:00
COLLAPSE_INDEX: false,
2013-08-23 14:30:09 +00:00
FILE_SUFFIX: '.html',
HAS_SOURCE: true
};
</script>
<script type="text/javascript" src="../../../_static/jquery.js"></script>
2013-08-30 02:14:14 +00:00
<script type="text/javascript" src="../../../_static/underscore.js"></script>
2013-08-23 14:30:09 +00:00
<script type="text/javascript" src="../../../_static/doctools.js"></script>
2013-08-30 02:14:14 +00:00
<link rel="top" title="Sprout 1.0 documentation" href="../../../index.html" />
2013-08-23 14:30:09 +00:00
<link rel="up" title="Sprout.Algorithm" href="index.html" />
<link rel="next" title="min_element" href="min_element.html" />
2013-08-23 14:30:09 +00:00
<link rel="prev" title="max" href="max.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="min_element.html" title="min_element"
accesskey="N">next</a> |</li>
2013-08-23 14:30:09 +00:00
<li class="right" >
<a href="max.html" title="max"
accesskey="P">previous</a> |</li>
2013-08-30 02:14:14 +00:00
<li><a href="../../../index.html">Sprout 1.0 documentation</a> &raquo;</li>
2013-08-23 14:30:09 +00:00
<li><a href="../../index.html" >Sprout C++ Libraries</a> &raquo;</li>
<li><a href="../../libraries.html" >Libraries</a> &raquo;</li>
<li><a href="index.html" accesskey="U">Sprout.Algorithm</a> &raquo;</li>
</ul>
2013-08-25 15:09:33 +00:00
</div>
<div class="sphinxsidebar">
<div class="sphinxsidebarwrapper">
2013-08-30 02:14:14 +00:00
<h3><a href="../../../index.html">Table Of Contents</a></h3>
<ul>
<li><a class="reference internal" href="#">minmax</a><ul>
<li><a class="reference internal" href="#interface">Interface</a></li>
<li><a class="reference internal" href="#requires">Requires</a></li>
<li><a class="reference internal" href="#returns">Returns</a></li>
<li><a class="reference internal" href="#remarks">Remarks</a></li>
<li><a class="reference internal" href="#id1">Remarks</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="#id2">Interface</a></li>
<li><a class="reference internal" href="#id3">Requires</a></li>
<li><a class="reference internal" href="#id4">Returns</a></li>
<li><a class="reference internal" href="#id5">Remarks</a></li>
<li><a class="reference internal" href="#id6">Complexity</a></li>
<li><a class="reference internal" href="#header">Header</a></li>
2013-08-25 15:09:33 +00:00
</ul>
</li>
</ul>
2013-08-30 02:14:14 +00:00
<h4>Previous topic</h4>
<p class="topless"><a href="max.html"
title="previous chapter">max</a></p>
<h4>Next topic</h4>
<p class="topless"><a href="min_element.html"
title="next chapter">min_element</a></p>
<h3>This Page</h3>
<ul class="this-page-menu">
<li><a href="../../../_sources/libs/sprout/algorithm/minmax.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>
2013-08-25 15:09:33 +00:00
</div>
</div>
2013-08-23 14:30:09 +00:00
<div class="document">
<div class="documentwrapper">
<div class="bodywrapper">
<div class="body">
<div class="section" id="minmax">
<h1>minmax<a class="headerlink" href="#minmax" 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">&lt;</span><span class="k">typename</span> <span class="n">T</span><span class="o">&gt;</span>
<span class="kr">inline</span> <span class="n">SPROUT_CONSTEXPR</span> <span class="n">sprout</span><span class="o">::</span><span class="n">pair</span><span class="o">&lt;</span><span class="n">T</span> <span class="k">const</span><span class="o">&amp;</span><span class="p">,</span> <span class="n">T</span> <span class="k">const</span><span class="o">&amp;&gt;</span>
<span class="n">minmax</span><span class="p">(</span><span class="n">T</span> <span class="k">const</span><span class="o">&amp;</span> <span class="n">a</span><span class="p">,</span> <span class="n">T</span> <span class="k">const</span><span class="o">&amp;</span> <span class="n">b</span><span class="p">);</span>
<span class="k">template</span><span class="o">&lt;</span><span class="k">typename</span> <span class="n">T</span><span class="p">,</span> <span class="k">typename</span> <span class="n">Compare</span><span class="o">&gt;</span>
<span class="kr">inline</span> <span class="n">SPROUT_CONSTEXPR</span> <span class="n">sprout</span><span class="o">::</span><span class="n">pair</span><span class="o">&lt;</span><span class="n">T</span> <span class="k">const</span><span class="o">&amp;</span><span class="p">,</span> <span class="n">T</span> <span class="k">const</span><span class="o">&amp;&gt;</span>
<span class="n">minmax</span><span class="p">(</span><span class="n">T</span> <span class="k">const</span><span class="o">&amp;</span> <span class="n">a</span><span class="p">,</span> <span class="n">T</span> <span class="k">const</span><span class="o">&amp;</span> <span class="n">b</span><span class="p">,</span> <span class="n">Compare</span> <span class="n">comp</span><span class="p">);</span>
</pre></div>
</div>
</div>
<div class="section" id="requires">
<h2>Requires<a class="headerlink" href="#requires" title="Permalink to this headline"></a></h2>
<div class="line-block">
<div class="line">Type T shall be LessThanComparable.</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">
2013-08-23 14:35:23 +00:00
<div class="line"><tt class="docutils literal"><span class="pre">pair&lt;T</span> <span class="pre">const&amp;,</span> <span class="pre">T</span> <span class="pre">const&amp;&gt;(b,</span> <span class="pre">a)</span></tt> if b is smaller than a, and <tt class="docutils literal"><span class="pre">pair&lt;T</span> <span class="pre">const&amp;,</span> <span class="pre">T</span> <span class="pre">const&amp;&gt;(a,</span> <span class="pre">b)</span></tt> otherwise.</div>
2013-08-23 14:30:09 +00:00
</div>
</div>
<div class="section" id="remarks">
<h2>Remarks<a class="headerlink" href="#remarks" title="Permalink to this headline"></a></h2>
<div class="line-block">
2013-08-23 14:35:23 +00:00
<div class="line">Returns <tt class="docutils literal"><span class="pre">pair&lt;T</span> <span class="pre">const&amp;,</span> <span class="pre">T</span> <span class="pre">const&amp;&gt;(a,</span> <span class="pre">b)</span></tt> when the arguments are equivalent.</div>
2013-08-23 14:30:09 +00:00
</div>
</div>
<div class="section" id="id1">
<h2>Remarks<a class="headerlink" href="#id1" title="Permalink to this headline"></a></h2>
</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 &lt;sprout/algorithm/minmax.hpp&gt;</span>
<span class="cp">#include &lt;sprout/array.hpp&gt;</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">input</span> <span class="o">=</span> <span class="n">array</span><span class="o">&lt;</span><span class="kt">int</span><span class="p">,</span> <span class="mi">10</span><span class="o">&gt;</span><span class="p">{{</span><span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="mi">1</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">minmax</span><span class="p">(</span><span class="n">input</span><span class="p">[</span><span class="mi">0</span><span class="p">],</span> <span class="n">input</span><span class="p">[</span><span class="mi">1</span><span class="p">]);</span>
<span class="n">static_assert</span><span class="p">(</span><span class="n">result</span><span class="p">.</span><span class="n">first</span> <span class="o">==</span> <span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="s">&quot;min value is -1.&quot;</span><span class="p">);</span>
<span class="n">static_assert</span><span class="p">(</span><span class="n">result</span><span class="p">.</span><span class="n">second</span> <span class="o">==</span> <span class="mi">1</span><span class="p">,</span> <span class="s">&quot;max value is 1.&quot;</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">Exactly one comparison.</div>
</div>
</div>
<hr class="docutils" />
<div class="section" id="id2">
<h2>Interface<a class="headerlink" href="#id2" title="Permalink to this headline"></a></h2>
<div class="highlight-c++"><div class="highlight"><pre><span class="k">template</span><span class="o">&lt;</span><span class="k">typename</span> <span class="n">T</span><span class="p">,</span> <span class="k">typename</span> <span class="n">Compare</span><span class="o">&gt;</span>
<span class="kr">inline</span> <span class="n">SPROUT_CONSTEXPR</span> <span class="n">sprout</span><span class="o">::</span><span class="n">pair</span><span class="o">&lt;</span><span class="n">T</span><span class="p">,</span> <span class="n">T</span><span class="o">&gt;</span>
<span class="n">minmax</span><span class="p">(</span><span class="n">std</span><span class="o">::</span><span class="n">initializer_list</span><span class="o">&lt;</span><span class="n">T</span><span class="o">&gt;</span> <span class="n">t</span><span class="p">,</span> <span class="n">Compare</span> <span class="n">comp</span><span class="p">);</span>
<span class="k">template</span><span class="o">&lt;</span><span class="k">typename</span> <span class="n">T</span><span class="o">&gt;</span>
<span class="kr">inline</span> <span class="n">SPROUT_CONSTEXPR</span> <span class="n">sprout</span><span class="o">::</span><span class="n">pair</span><span class="o">&lt;</span><span class="n">T</span><span class="p">,</span> <span class="n">T</span><span class="o">&gt;</span>
<span class="n">minmax</span><span class="p">(</span><span class="n">std</span><span class="o">::</span><span class="n">initializer_list</span><span class="o">&lt;</span><span class="n">T</span><span class="o">&gt;</span> <span class="n">t</span><span class="p">);</span>
</pre></div>
</div>
</div>
<div class="section" id="id3">
<h2>Requires<a class="headerlink" href="#id3" title="Permalink to this headline"></a></h2>
<div class="line-block">
<div class="line">T is LessThanComparable and CopyConstructible and <tt class="docutils literal"><span class="pre">t.size()</span> <span class="pre">&gt;</span> <span class="pre">0</span></tt>.</div>
</div>
</div>
<div class="section" id="id4">
<h2>Returns<a class="headerlink" href="#id4" title="Permalink to this headline"></a></h2>
<div class="line-block">
<div class="line"><tt class="docutils literal"><span class="pre">pair&lt;T,</span> <span class="pre">T&gt;(x,</span> <span class="pre">y)</span></tt>, where x has the smallest and y has the largest value in the initializer list.</div>
</div>
</div>
<div class="section" id="id5">
<h2>Remarks<a class="headerlink" href="#id5" title="Permalink to this headline"></a></h2>
<div class="line-block">
<div class="line">x is a copy of the leftmost argument when several arguments are equivalent to the smallest.</div>
<div class="line">y is a copy of the rightmost argument when several arguments are equivalent to the largest.</div>
<div class="line">If an implementation not support C++14 initializer_list (<tt class="docutils literal"><span class="pre">SPROUT_NO_CXX14_INITIALIZER_LIST</span></tt> defined), then this function is not specified constexpr.</div>
2013-08-23 14:30:09 +00:00
</div>
</div>
<div class="section" id="id6">
<h2>Complexity<a class="headerlink" href="#id6" title="Permalink to this headline"></a></h2>
<div class="line-block">
<div class="line">At most <tt class="docutils literal"><span class="pre">(3/2)</span> <span class="pre">*</span> <span class="pre">t.size()</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/minmax.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="min_element.html" title="min_element"
>next</a> |</li>
2013-08-23 14:30:09 +00:00
<li class="right" >
<a href="max.html" title="max"
>previous</a> |</li>
2013-08-30 02:14:14 +00:00
<li><a href="../../../index.html">Sprout 1.0 documentation</a> &raquo;</li>
2013-08-23 14:30:09 +00:00
<li><a href="../../index.html" >Sprout C++ Libraries</a> &raquo;</li>
<li><a href="../../libraries.html" >Libraries</a> &raquo;</li>
<li><a href="index.html" >Sprout.Algorithm</a> &raquo;</li>
</ul>
</div>
<div class="footer">
2013-08-30 02:14:14 +00:00
&copy; Copyright 2013, Bolero MURAKAMI.
Created using <a href="http://sphinx.pocoo.org/">Sphinx</a> 1.1.3.
2013-08-23 14:30:09 +00:00
</div>
</body>
</html>