mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2025-07-12 14:54:10 +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
|
||||
========================================
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue