Sprout/source/libs/sprout/algorithm/index.rst

132 lines
3.2 KiB
ReStructuredText
Raw Normal View History

2013-08-15 09:37:20 +00:00
.. _sprout-algorithm:
###############################################################################
Sprout.Algorithm
###############################################################################
.. toctree::
:hidden:
all_of
2013-08-19 14:55:46 +00:00
all_of_equal
2013-08-15 09:37:20 +00:00
any_of
2013-08-19 14:55:46 +00:00
any_of_equal
2013-08-16 02:43:55 +00:00
none_of
2013-08-19 14:55:46 +00:00
none_of_equal
2013-08-16 02:43:55 +00:00
one_of
2013-08-19 14:55:46 +00:00
one_of_equal
2013-08-20 04:07:21 +00:00
find
find_if
find_if_not
find_end
find_first_of
adjacent_find
count
count_if
mismatch
equal
is_permutation
search
search_n
2013-08-21 16:56:46 +00:00
is_sorted
is_sorted_until
2013-08-22 07:53:23 +00:00
is_increasing
is_decreasing
is_strictly_increasing
is_strictly_decreasing
2013-08-22 15:08:35 +00:00
lower_bound
upper_bound
equal_range
binary_search
2013-08-23 06:28:44 +00:00
is_heap
is_heap_until
2013-08-23 14:30:09 +00:00
min
max
minmax
min_element
max_element
minmax_element
2013-08-15 09:37:20 +00:00
.. _sprout-algorithm-non_modifying:
*******************************************************************************
Non-modifying sequence operations
*******************************************************************************
2013-08-16 09:15:52 +00:00
* :doc:`all_of <./all_of>`
2013-08-19 14:55:46 +00:00
* :doc:`all_of_equal <./all_of_equal>`
2013-08-16 09:15:52 +00:00
* :doc:`any_of <./any_of>`
2013-08-19 14:55:46 +00:00
* :doc:`any_of_equal <./any_of_equal>`
2013-08-16 09:15:52 +00:00
* :doc:`none_of <./none_of>`
2013-08-19 14:55:46 +00:00
* :doc:`none_of_equal <./none_of_equal>`
2013-08-16 09:15:52 +00:00
* :doc:`one_of <./one_of>`
2013-08-19 14:55:46 +00:00
* :doc:`one_of_equal <./one_of_equal>`
* :doc:`find <./find>`
* :doc:`find_if <./find_if>`
* :doc:`find_if_not <./find_if_not>`
* :doc:`find_end <./find_end>`
* :doc:`find_first_of <./find_first_of>`
* :doc:`adjacent_find <./adjacent_find>`
* :doc:`count <./count>`
* :doc:`count_if <./count_if>`
* :doc:`mismatch <./mismatch>`
* :doc:`equal <./equal>`
* :doc:`is_permutation <./is_permutation>`
2013-08-19 14:55:46 +00:00
* :doc:`search <./search>`
* :doc:`search_n <./search_n>`
.. _sprout-algorithm-non_modifying-sorting:
Sorting
========================================
* :doc:`is_sorted <./is_sorted>`
* :doc:`is_sorted_until <./is_sorted_until>`
* :doc:`is_increasing <./is_increasing>`
* :doc:`is_decreasing <./is_decreasing>`
* :doc:`is_strictly_increasing <./is_strictly_increasing>`
* :doc:`is_strictly_decreasing <./is_strictly_decreasing>`
.. _sprout-algorithm-non_modifying-binary:
Binary search
========================================
* :doc:`lower_bound <./lower_bound>`
* :doc:`upper_bound <./upper_bound>`
* :doc:`equal_range <./equal_range>`
* :doc:`binary_search <./binary_search>`
.. _sprout-algorithm-non_modifying-heap:
Heap operations
========================================
* :doc:`is_heap <./is_heap>`
2013-08-22 07:53:23 +00:00
* :doc:`is_heap_until <./is_heap_until>`
2013-08-19 14:55:46 +00:00
.. _sprout-algorithm-non_modifying-minmax:
Minimum and maximum
========================================
* :doc:`min <./min>`
* :doc:`max <./max>`
* :doc:`minmax <./minmax>`
* :doc:`min_element <./min_element>`
* :doc:`max_element <./max_element>`
* :doc:`minmax_element <./minmax_element>`
.. _sprout-algorithm-non_modifying-lexicographical:
Lexicographical comparison
========================================
* :doc:`lexicographical_compare <./lexicographical_compare>`
* :doc:`tristate_lexicographical_compare <./tristate_lexicographical_compare>`
.. _sprout-algorithm-non_modifying-clamp:
Clamp algorithm
========================================
* :doc:`clamp <./clamp>`
2013-08-15 09:37:20 +00:00
2013-08-16 09:15:52 +00:00
Header
========================================
2013-08-15 09:37:20 +00:00
2013-08-16 09:15:52 +00:00
``sprout/algorithm.hpp``
2013-08-16 02:43:55 +00:00