mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2025-02-17 10:25:49 +00:00
rebuild: (fix typo)
This commit is contained in:
parent
c2be89cf22
commit
f9472c5100
6 changed files with 3 additions and 25 deletions
|
@ -38,7 +38,7 @@ Examples
|
|||
Complexity
|
||||
========================================
|
||||
|
||||
| For a nonempty range, exactly ``min((i - first) + 1, (last - first) - 1)`` applications of the corresponding predicate, where i is adjacent_find<EFBFBD>fs return value.
|
||||
| For a nonempty range, exactly ``min((i - first) + 1, (last - first) - 1)`` applications of the corresponding predicate, where i is adjacent_find's return value.
|
||||
| Recursive function invocations in *O(logN)* (logarithmic) depth.
|
||||
|
||||
Header
|
||||
|
|
|
@ -100,13 +100,6 @@ Lexicographical comparison
|
|||
* :doc:`lexicographical_compare <./lexicographical_compare>`
|
||||
* :doc:`tristate_lexicographical_compare <./tristate_lexicographical_compare>`
|
||||
|
||||
.. _sprout-algorithm-non_modifying-permutation:
|
||||
Permutation generators
|
||||
========================================
|
||||
|
||||
* :doc:`next_permutation <./next_permutation>`
|
||||
* :doc:`prev_permutation <./prev_permutation>`
|
||||
|
||||
.. _sprout-algorithm-non_modifying-clamp:
|
||||
Clamp algorithm
|
||||
========================================
|
||||
|
|
|
@ -87,7 +87,7 @@
|
|||
<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">For a nonempty range, exactly <tt class="docutils literal"><span class="pre">min((i</span> <span class="pre">-</span> <span class="pre">first)</span> <span class="pre">+</span> <span class="pre">1,</span> <span class="pre">(last</span> <span class="pre">-</span> <span class="pre">first)</span> <span class="pre">-</span> <span class="pre">1)</span></tt> applications of the corresponding predicate, where i is adjacent_find?fs return value.</div>
|
||||
<div class="line">For a nonempty range, exactly <tt class="docutils literal"><span class="pre">min((i</span> <span class="pre">-</span> <span class="pre">first)</span> <span class="pre">+</span> <span class="pre">1,</span> <span class="pre">(last</span> <span class="pre">-</span> <span class="pre">first)</span> <span class="pre">-</span> <span class="pre">1)</span></tt> applications of the corresponding predicate, where i is adjacent_find’s return value.</div>
|
||||
<div class="line">Recursive function invocations in <em>O(logN)</em> (logarithmic) depth.</div>
|
||||
</div>
|
||||
</div>
|
||||
|
|
|
@ -120,13 +120,6 @@
|
|||
<li><tt class="xref docutils literal"><span class="pre">tristate_lexicographical_compare</span></tt></li>
|
||||
</ul>
|
||||
</div>
|
||||
<div class="section" id="permutation-generators">
|
||||
<h3>Permutation generators<a class="headerlink" href="#permutation-generators" title="Permalink to this headline">¶</a></h3>
|
||||
<ul class="simple">
|
||||
<li><tt class="xref docutils literal"><span class="pre">next_permutation</span></tt></li>
|
||||
<li><tt class="xref docutils literal"><span class="pre">prev_permutation</span></tt></li>
|
||||
</ul>
|
||||
</div>
|
||||
<div class="section" id="clamp-algorithm">
|
||||
<h3>Clamp algorithm<a class="headerlink" href="#clamp-algorithm" title="Permalink to this headline">¶</a></h3>
|
||||
<ul class="simple">
|
||||
|
@ -155,7 +148,6 @@
|
|||
<li><a class="reference external" href="#heap-operations">Heap operations</a></li>
|
||||
<li><a class="reference external" href="#minimum-and-maximum">Minimum and maximum</a></li>
|
||||
<li><a class="reference external" href="#lexicographical-comparison">Lexicographical comparison</a></li>
|
||||
<li><a class="reference external" href="#permutation-generators">Permutation generators</a></li>
|
||||
<li><a class="reference external" href="#clamp-algorithm">Clamp algorithm</a></li>
|
||||
<li><a class="reference external" href="#header">Header</a></li>
|
||||
</ul>
|
||||
|
|
File diff suppressed because one or more lines are too long
|
@ -100,13 +100,6 @@ Lexicographical comparison
|
|||
* :doc:`lexicographical_compare <./lexicographical_compare>`
|
||||
* :doc:`tristate_lexicographical_compare <./tristate_lexicographical_compare>`
|
||||
|
||||
.. _sprout-algorithm-non_modifying-permutation:
|
||||
Permutation generators
|
||||
========================================
|
||||
|
||||
* :doc:`next_permutation <./next_permutation>`
|
||||
* :doc:`prev_permutation <./prev_permutation>`
|
||||
|
||||
.. _sprout-algorithm-non_modifying-clamp:
|
||||
Clamp algorithm
|
||||
========================================
|
||||
|
|
Loading…
Add table
Reference in a new issue