add doc:is_sorted, is_sorted_until

docs/_sources/libs/sprout/algorithm/index.txt

@@ -27,6 +27,8 @@ Sprout.Algorithm
     is_permutation
     search
     search_n
+    is_sorted
+    is_sorted_until
 
 .. _sprout-algorithm-non_modifying:
 *******************************************************************************

docs/_sources/libs/sprout/algorithm/is_sorted.txt

@@ -0,0 +1,46 @@
+.. _sprout-algorithm-is_sorted:
+###############################################################################
+is_sorted
+###############################################################################
+
+Interface
+========================================
+.. sourcecode:: c++
+
+  template<typename ForwardIterator>
+  inline SPROUT_CONSTEXPR bool
+  is_sorted(ForwardIterator first, ForwardIterator last);
+  
+  template<typename ForwardIterator, typename Compare>
+  inline SPROUT_CONSTEXPR bool
+  is_sorted(ForwardIterator first, ForwardIterator last, Compare comp);
+
+Returns
+========================================
+
+| ``is_sorted_until(first, last) == last``, ``is_sorted_until(first, last, comp) == last``
+
+Examples
+========================================
+.. sourcecode:: c++
+
+  #include <sprout/algorithm/is_sorted.hpp>
+  #include <sprout/array.hpp>
+  #include <sprout/container.hpp>
+  using namespace sprout;
+
+  SPROUT_STATIC_CONSTEXPR auto input = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
+  SPROUT_STATIC_CONSTEXPR auto result = sprout::is_sorted(begin(input), end(input));
+  static_assert(result, "input is sorted.");
+
+Complexity
+========================================
+
+| Recursive function invocations in *O(logN)* (logarithmic) depth.
+
+Header
+========================================
+
+| ``sprout/algorithm/is_sorted.hpp``
+| Convenience header: ``sprout/algorithm.hpp``
+

docs/_sources/libs/sprout/algorithm/is_sorted_until.txt

@@ -0,0 +1,48 @@
+.. _sprout-algorithm-is_sorted_until:
+###############################################################################
+is_sorted_until
+###############################################################################
+
+Interface
+========================================
+.. sourcecode:: c++
+
+  template<typename ForwardIterator>
+  inline SPROUT_CONSTEXPR ForwardIterator
+  is_sorted_until(ForwardIterator first, ForwardIterator last);
+  
+  template<typename ForwardIterator, typename Compare>
+  inline SPROUT_CONSTEXPR ForwardIterator
+  is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp);
+
+Returns
+========================================
+
+| If ``distance(first, last) < 2``, returns last.
+| Otherwise, returns the last iterator i in [first,last] for which the range [first,i) is sorted.
+
+Examples
+========================================
+.. sourcecode:: c++
+
+  #include <sprout/algorithm/is_sorted_until.hpp>
+  #include <sprout/array.hpp>
+  #include <sprout/container.hpp>
+  using namespace sprout;
+
+  SPROUT_STATIC_CONSTEXPR auto input = array<int, 10>{{6, 7, 8, 8, 10, 1, 2, 3, 4, 5}};
+  SPROUT_STATIC_CONSTEXPR auto result = sprout::is_sorted_until(begin(input), end(input));
+  static_assert(result - begin(input) == 5, "input is sorted until position 5.");
+
+Complexity
+========================================
+
+| Linear.
+| Recursive function invocations in *O(logN)* (logarithmic) depth.
+
+Header
+========================================
+
+| ``sprout/algorithm/is_sorted_until.hpp``
+| Convenience header: ``sprout/algorithm.hpp``
+

docs/_sources/libs/sprout/algorithm/mismatch.txt

@@ -13,7 +13,7 @@ Interface
   
   template<typename InputIterator1, typename InputIterator2>
   inline SPROUT_CONSTEXPR sprout::pair<InputIterator1, InputIterator2>
-  mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2;
+  mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2);
   
   template<typename InputIterator1, typename InputIterator2>
   inline SPROUT_CONSTEXPR sprout::pair<InputIterator1, InputIterator2>

docs/libs/sprout/algorithm/index.html

@@ -78,8 +78,8 @@
 <div class="section" id="sorting">
 <h3>Sorting<a class="headerlink" href="#sorting" title="Permalink to this headline">¶</a></h3>
 <ul class="simple">
-<li><tt class="xref docutils literal"><span class="pre">is_sorted</span></tt></li>
+<li><a class="reference external" href="is_sorted.html"><em>is_sorted</em></a></li>
-<li><tt class="xref docutils literal"><span class="pre">is_sorted_until</span></tt></li>
+<li><a class="reference external" href="is_sorted_until.html"><em>is_sorted_until</em></a></li>
 <li><tt class="xref docutils literal"><span class="pre">is_increasing</span></tt></li>
 <li><tt class="xref docutils literal"><span class="pre">is_decreasing</span></tt></li>
 <li><tt class="xref docutils literal"><span class="pre">is_strictly_increasing</span></tt></li>

docs/libs/sprout/algorithm/is_sorted.html

@@ -0,0 +1,169 @@
+<!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>is_sorted &mdash; Sprout v1.0 documentation</title>
+    <link rel="stylesheet" href="../../../_static/default.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_MODINDEX: false,
+        FILE_SUFFIX: '.html',
+        HAS_SOURCE:  true
+      };
+    </script>
+    <script type="text/javascript" src="../../../_static/jquery.js"></script>
+    <script type="text/javascript" src="../../../_static/doctools.js"></script>
+    <link rel="top" title="Sprout v1.0 documentation" href="../../../index.html" />
+    <link rel="up" title="Sprout.Algorithm" href="index.html" />
+    <link rel="next" title="is_sorted_until" href="is_sorted_until.html" />
+    <link rel="prev" title="search_n" href="search_n.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="is_sorted_until.html" title="is_sorted_until"
+             accesskey="N">next</a> |</li>
+        <li class="right" >
+          <a href="search_n.html" title="search_n"
+             accesskey="P">previous</a> |</li>
+        <li><a href="../../../index.html">Sprout v1.0 documentation</a> &raquo;</li>
+          <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>
+    </div>  
+
+    <div class="document">
+      <div class="documentwrapper">
+        <div class="bodywrapper">
+          <div class="body">
+            
+  <div class="section" id="is-sorted">
+<h1>is_sorted<a class="headerlink" href="#is-sorted" 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">ForwardIterator</span><span class="o">&gt;</span>
+<span class="kr">inline</span> <span class="n">SPROUT_CONSTEXPR</span> <span class="kt">bool</span>
+<span class="n">is_sorted</span><span class="p">(</span><span class="n">ForwardIterator</span> <span class="n">first</span><span class="p">,</span> <span class="n">ForwardIterator</span> <span class="n">last</span><span class="p">);</span>
+
+<span class="k">template</span><span class="o">&lt;</span><span class="k">typename</span> <span class="n">ForwardIterator</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="kt">bool</span>
+<span class="n">is_sorted</span><span class="p">(</span><span class="n">ForwardIterator</span> <span class="n">first</span><span class="p">,</span> <span class="n">ForwardIterator</span> <span class="n">last</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="returns">
+<h2>Returns<a class="headerlink" href="#returns" title="Permalink to this headline">¶</a></h2>
+<div class="line-block">
+<div class="line"><tt class="docutils literal"><span class="pre">is_sorted_until(first,</span> <span class="pre">last)</span> <span class="pre">==</span> <span class="pre">last</span></tt>, <tt class="docutils literal"><span class="pre">is_sorted_until(first,</span> <span class="pre">last,</span> <span class="pre">comp)</span> <span class="pre">==</span> <span class="pre">last</span></tt></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 &lt;sprout/algorithm/is_sorted.hpp&gt;</span>
+<span class="cp">#include &lt;sprout/array.hpp&gt;</span>
+<span class="cp">#include &lt;sprout/container.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="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">6</span><span class="p">,</span> <span class="mi">7</span><span class="p">,</span> <span class="mi">8</span><span class="p">,</span> <span class="mi">9</span><span class="p">,</span> <span class="mi">10</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">is_sorted</span><span class="p">(</span><span class="n">begin</span><span class="p">(</span><span class="n">input</span><span class="p">),</span> <span class="n">end</span><span class="p">(</span><span class="n">input</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="s">&quot;input is sorted.&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">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/is_sorted.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="sphinxsidebar">
+        <div class="sphinxsidebarwrapper">
+            <h3><a href="../../../index.html">Table Of Contents</a></h3>
+            <ul>
+<li><a class="reference external" href="#">is_sorted</a><ul>
+<li><a class="reference external" href="#interface">Interface</a></li>
+<li><a class="reference external" href="#returns">Returns</a></li>
+<li><a class="reference external" href="#examples">Examples</a></li>
+<li><a class="reference external" href="#complexity">Complexity</a></li>
+<li><a class="reference external" href="#header">Header</a></li>
+</ul>
+</li>
+</ul>
+
+            <h4>Previous topic</h4>
+            <p class="topless"><a href="search_n.html"
+                                  title="previous chapter">search_n</a></p>
+            <h4>Next topic</h4>
+            <p class="topless"><a href="is_sorted_until.html"
+                                  title="next chapter">is_sorted_until</a></p>
+            <h3>This Page</h3>
+            <ul class="this-page-menu">
+              <li><a href="../../../_sources/libs/sprout/algorithm/is_sorted.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" size="18" />
+                <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="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="is_sorted_until.html" title="is_sorted_until"
+             >next</a> |</li>
+        <li class="right" >
+          <a href="search_n.html" title="search_n"
+             >previous</a> |</li>
+        <li><a href="../../../index.html">Sprout v1.0 documentation</a> &raquo;</li>
+          <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">
+      &copy; Copyright 2013, Bolero MURAKAMI.
+      Created using <a href="http://sphinx.pocoo.org/">Sphinx</a> 0.6.4.
+    </div>
+  </body>
+</html>

docs/libs/sprout/algorithm/is_sorted_until.html

@@ -0,0 +1,161 @@
+<!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>is_sorted_until &mdash; Sprout v1.0 documentation</title>
+    <link rel="stylesheet" href="../../../_static/default.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_MODINDEX: false,
+        FILE_SUFFIX: '.html',
+        HAS_SOURCE:  true
+      };
+    </script>
+    <script type="text/javascript" src="../../../_static/jquery.js"></script>
+    <script type="text/javascript" src="../../../_static/doctools.js"></script>
+    <link rel="top" title="Sprout v1.0 documentation" href="../../../index.html" />
+    <link rel="up" title="Sprout.Algorithm" href="index.html" />
+    <link rel="prev" title="is_sorted" href="is_sorted.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="is_sorted.html" title="is_sorted"
+             accesskey="P">previous</a> |</li>
+        <li><a href="../../../index.html">Sprout v1.0 documentation</a> &raquo;</li>
+          <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>
+    </div>  
+
+    <div class="document">
+      <div class="documentwrapper">
+        <div class="bodywrapper">
+          <div class="body">
+            
+  <div class="section" id="is-sorted-until">
+<h1>is_sorted_until<a class="headerlink" href="#is-sorted-until" 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">ForwardIterator</span><span class="o">&gt;</span>
+<span class="kr">inline</span> <span class="n">SPROUT_CONSTEXPR</span> <span class="n">ForwardIterator</span>
+<span class="n">is_sorted_until</span><span class="p">(</span><span class="n">ForwardIterator</span> <span class="n">first</span><span class="p">,</span> <span class="n">ForwardIterator</span> <span class="n">last</span><span class="p">);</span>
+
+<span class="k">template</span><span class="o">&lt;</span><span class="k">typename</span> <span class="n">ForwardIterator</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">ForwardIterator</span>
+<span class="n">is_sorted_until</span><span class="p">(</span><span class="n">ForwardIterator</span> <span class="n">first</span><span class="p">,</span> <span class="n">ForwardIterator</span> <span class="n">last</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="returns">
+<h2>Returns<a class="headerlink" href="#returns" title="Permalink to this headline">¶</a></h2>
+<div class="line-block">
+<div class="line">If <tt class="docutils literal"><span class="pre">distance(first,</span> <span class="pre">last)</span> <span class="pre">&lt;</span> <span class="pre">2</span></tt>, returns last.</div>
+<div class="line">Otherwise, returns the last iterator i in [first,last] for which the range [first,i) is sorted.</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 &lt;sprout/algorithm/is_sorted_until.hpp&gt;</span>
+<span class="cp">#include &lt;sprout/array.hpp&gt;</span>
+<span class="cp">#include &lt;sprout/container.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="mi">6</span><span class="p">,</span> <span class="mi">7</span><span class="p">,</span> <span class="mi">8</span><span class="p">,</span> <span class="mi">8</span><span class="p">,</span> <span class="mi">10</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">result</span> <span class="o">=</span> <span class="n">sprout</span><span class="o">::</span><span class="n">is_sorted_until</span><span class="p">(</span><span class="n">begin</span><span class="p">(</span><span class="n">input</span><span class="p">),</span> <span class="n">end</span><span class="p">(</span><span class="n">input</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">input</span><span class="p">)</span> <span class="o">==</span> <span class="mi">5</span><span class="p">,</span> <span class="s">&quot;input is sorted until position 5.&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">Linear.</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/is_sorted_until.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="sphinxsidebar">
+        <div class="sphinxsidebarwrapper">
+            <h3><a href="../../../index.html">Table Of Contents</a></h3>
+            <ul>
+<li><a class="reference external" href="#">is_sorted_until</a><ul>
+<li><a class="reference external" href="#interface">Interface</a></li>
+<li><a class="reference external" href="#returns">Returns</a></li>
+<li><a class="reference external" href="#examples">Examples</a></li>
+<li><a class="reference external" href="#complexity">Complexity</a></li>
+<li><a class="reference external" href="#header">Header</a></li>
+</ul>
+</li>
+</ul>
+
+            <h4>Previous topic</h4>
+            <p class="topless"><a href="is_sorted.html"
+                                  title="previous chapter">is_sorted</a></p>
+            <h3>This Page</h3>
+            <ul class="this-page-menu">
+              <li><a href="../../../_sources/libs/sprout/algorithm/is_sorted_until.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" size="18" />
+                <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="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="is_sorted.html" title="is_sorted"
+             >previous</a> |</li>
+        <li><a href="../../../index.html">Sprout v1.0 documentation</a> &raquo;</li>
+          <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">
+      &copy; Copyright 2013, Bolero MURAKAMI.
+      Created using <a href="http://sphinx.pocoo.org/">Sphinx</a> 0.6.4.
+    </div>
+  </body>
+</html>

docs/libs/sprout/algorithm/mismatch.html

@@ -59,7 +59,7 @@
 
 <span class="k">template</span><span class="o">&lt;</span><span class="k">typename</span> <span class="n">InputIterator1</span><span class="p">,</span> <span class="k">typename</span> <span class="n">InputIterator2</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">InputIterator1</span><span class="p">,</span> <span class="n">InputIterator2</span><span class="o">&gt;</span>
-<span class="n">mismatch</span><span class="p">(</span><span class="n">InputIterator1</span> <span class="n">first1</span><span class="p">,</span> <span class="n">InputIterator1</span> <span class="n">last1</span><span class="p">,</span> <span class="n">InputIterator2</span> <span class="n">first2</span><span class="p">;</span>
+<span class="n">mismatch</span><span class="p">(</span><span class="n">InputIterator1</span> <span class="n">first1</span><span class="p">,</span> <span class="n">InputIterator1</span> <span class="n">last1</span><span class="p">,</span> <span class="n">InputIterator2</span> <span class="n">first2</span><span class="p">);</span>
 
 <span class="k">template</span><span class="o">&lt;</span><span class="k">typename</span> <span class="n">InputIterator1</span><span class="p">,</span> <span class="k">typename</span> <span class="n">InputIterator2</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">InputIterator1</span><span class="p">,</span> <span class="n">InputIterator2</span><span class="o">&gt;</span>

docs/libs/sprout/algorithm/search_n.html

@@ -21,6 +21,7 @@
     <script type="text/javascript" src="../../../_static/doctools.js"></script>
     <link rel="top" title="Sprout v1.0 documentation" href="../../../index.html" />
     <link rel="up" title="Sprout.Algorithm" href="index.html" />
+    <link rel="next" title="is_sorted" href="is_sorted.html" />
     <link rel="prev" title="search" href="search.html" /> 
   </head>
   <body>
@@ -30,6 +31,9 @@
         <li class="right" style="margin-right: 10px">
           <a href="../../../genindex.html" title="General Index"
              accesskey="I">index</a></li>
+        <li class="right" >
+          <a href="is_sorted.html" title="is_sorted"
+             accesskey="N">next</a> |</li>
         <li class="right" >
           <a href="search.html" title="search"
              accesskey="P">previous</a> |</li>
@@ -131,6 +135,9 @@
             <h4>Previous topic</h4>
             <p class="topless"><a href="search.html"
                                   title="previous chapter">search</a></p>
+            <h4>Next topic</h4>
+            <p class="topless"><a href="is_sorted.html"
+                                  title="next chapter">is_sorted</a></p>
             <h3>This Page</h3>
             <ul class="this-page-menu">
               <li><a href="../../../_sources/libs/sprout/algorithm/search_n.txt"
@@ -159,6 +166,9 @@
         <li class="right" style="margin-right: 10px">
           <a href="../../../genindex.html" title="General Index"
              >index</a></li>
+        <li class="right" >
+          <a href="is_sorted.html" title="is_sorted"
+             >next</a> |</li>
         <li class="right" >
           <a href="search.html" title="search"
              >previous</a> |</li>

source/libs/sprout/algorithm/index.rst

@@ -27,6 +27,8 @@ Sprout.Algorithm
     is_permutation
     search
     search_n
+    is_sorted
+    is_sorted_until
 
 .. _sprout-algorithm-non_modifying:
 *******************************************************************************

source/libs/sprout/algorithm/is_sorted.rst

@@ -0,0 +1,46 @@
+.. _sprout-algorithm-is_sorted:
+###############################################################################
+is_sorted
+###############################################################################
+
+Interface
+========================================
+.. sourcecode:: c++
+
+  template<typename ForwardIterator>
+  inline SPROUT_CONSTEXPR bool
+  is_sorted(ForwardIterator first, ForwardIterator last);
+  
+  template<typename ForwardIterator, typename Compare>
+  inline SPROUT_CONSTEXPR bool
+  is_sorted(ForwardIterator first, ForwardIterator last, Compare comp);
+
+Returns
+========================================
+
+| ``is_sorted_until(first, last) == last``, ``is_sorted_until(first, last, comp) == last``
+
+Examples
+========================================
+.. sourcecode:: c++
+
+  #include <sprout/algorithm/is_sorted.hpp>
+  #include <sprout/array.hpp>
+  #include <sprout/container.hpp>
+  using namespace sprout;
+
+  SPROUT_STATIC_CONSTEXPR auto input = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
+  SPROUT_STATIC_CONSTEXPR auto result = sprout::is_sorted(begin(input), end(input));
+  static_assert(result, "input is sorted.");
+
+Complexity
+========================================
+
+| Recursive function invocations in *O(logN)* (logarithmic) depth.
+
+Header
+========================================
+
+| ``sprout/algorithm/is_sorted.hpp``
+| Convenience header: ``sprout/algorithm.hpp``
+

source/libs/sprout/algorithm/is_sorted_until.rst

@@ -0,0 +1,48 @@
+.. _sprout-algorithm-is_sorted_until:
+###############################################################################
+is_sorted_until
+###############################################################################
+
+Interface
+========================================
+.. sourcecode:: c++
+
+  template<typename ForwardIterator>
+  inline SPROUT_CONSTEXPR ForwardIterator
+  is_sorted_until(ForwardIterator first, ForwardIterator last);
+  
+  template<typename ForwardIterator, typename Compare>
+  inline SPROUT_CONSTEXPR ForwardIterator
+  is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp);
+
+Returns
+========================================
+
+| If ``distance(first, last) < 2``, returns last.
+| Otherwise, returns the last iterator i in [first,last] for which the range [first,i) is sorted.
+
+Examples
+========================================
+.. sourcecode:: c++
+
+  #include <sprout/algorithm/is_sorted_until.hpp>
+  #include <sprout/array.hpp>
+  #include <sprout/container.hpp>
+  using namespace sprout;
+
+  SPROUT_STATIC_CONSTEXPR auto input = array<int, 10>{{6, 7, 8, 8, 10, 1, 2, 3, 4, 5}};
+  SPROUT_STATIC_CONSTEXPR auto result = sprout::is_sorted_until(begin(input), end(input));
+  static_assert(result - begin(input) == 5, "input is sorted until position 5.");
+
+Complexity
+========================================
+
+| Linear.
+| Recursive function invocations in *O(logN)* (logarithmic) depth.
+
+Header
+========================================
+
+| ``sprout/algorithm/is_sorted_until.hpp``
+| Convenience header: ``sprout/algorithm.hpp``
+