mirror of
https://github.com/bolero-MURAKAMI/Sprout
synced 2024-11-12 21:09:01 +00:00
80 lines
3.5 KiB
C++
80 lines
3.5 KiB
C++
/*=============================================================================
|
|
Copyright (c) 2011-2013 Bolero MURAKAMI
|
|
https://github.com/bolero-MURAKAMI/Sprout
|
|
|
|
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
|
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
|
=============================================================================*/
|
|
#ifndef SPROUT_ALGORITHM_MODIFYIING_HPP
|
|
#define SPROUT_ALGORITHM_MODIFYIING_HPP
|
|
|
|
#include <sprout/config.hpp>
|
|
#include <sprout/algorithm/copy.hpp>
|
|
#include <sprout/algorithm/copy_n.hpp>
|
|
#include <sprout/algorithm/copy_if.hpp>
|
|
#include <sprout/algorithm/copy_backward.hpp>
|
|
#include <sprout/algorithm/move.hpp>
|
|
#include <sprout/algorithm/move_backward.hpp>
|
|
#include <sprout/algorithm/swap_ranges.hpp>
|
|
#include <sprout/algorithm/iter_swap.hpp>
|
|
#include <sprout/algorithm/transform.hpp>
|
|
#include <sprout/algorithm/replace.hpp>
|
|
#include <sprout/algorithm/replace_if.hpp>
|
|
#include <sprout/algorithm/replace_copy.hpp>
|
|
#include <sprout/algorithm/replace_copy_if.hpp>
|
|
#include <sprout/algorithm/fill.hpp>
|
|
#include <sprout/algorithm/fill_n.hpp>
|
|
#include <sprout/algorithm/generate.hpp>
|
|
#include <sprout/algorithm/generate_n.hpp>
|
|
#include <sprout/algorithm/unfold.hpp>
|
|
#include <sprout/algorithm/unfold_n.hpp>
|
|
#include <sprout/algorithm/recurrence.hpp>
|
|
#include <sprout/algorithm/recurrence_n.hpp>
|
|
#include <sprout/algorithm/remove.hpp>
|
|
#include <sprout/algorithm/remove_if.hpp>
|
|
#include <sprout/algorithm/remove_copy.hpp>
|
|
#include <sprout/algorithm/remove_copy_if.hpp>
|
|
#include <sprout/algorithm/unique.hpp>
|
|
#include <sprout/algorithm/unique_copy.hpp>
|
|
#include <sprout/algorithm/reverse.hpp>
|
|
#include <sprout/algorithm/reverse_copy.hpp>
|
|
#include <sprout/algorithm/rotate.hpp>
|
|
#include <sprout/algorithm/rotate_copy.hpp>
|
|
#include <sprout/algorithm/random_shuffle.hpp>
|
|
#include <sprout/algorithm/shuffle.hpp>
|
|
#include <sprout/algorithm/shuffle_result.hpp>
|
|
#include <sprout/algorithm/partition.hpp>
|
|
#include <sprout/algorithm/stable_partition.hpp>
|
|
#include <sprout/algorithm/partition_copy.hpp>
|
|
#include <sprout/algorithm/stable_partition_copy.hpp>
|
|
#include <sprout/algorithm/sort.hpp>
|
|
#include <sprout/algorithm/stable_sort.hpp>
|
|
#include <sprout/algorithm/partial_sort.hpp>
|
|
#include <sprout/algorithm/nth_element.hpp>
|
|
#include <sprout/algorithm/merge.hpp>
|
|
#include <sprout/algorithm/inplace_merge.hpp>
|
|
#include <sprout/algorithm/set_union.hpp>
|
|
#include <sprout/algorithm/set_intersection.hpp>
|
|
#include <sprout/algorithm/set_difference.hpp>
|
|
#include <sprout/algorithm/set_symmetric_difference.hpp>
|
|
#include <sprout/algorithm/push_heap.hpp>
|
|
#include <sprout/algorithm/pop_heap.hpp>
|
|
#include <sprout/algorithm/make_heap.hpp>
|
|
#include <sprout/algorithm/make_partial_heap.hpp>
|
|
#include <sprout/algorithm/sort_heap.hpp>
|
|
#include <sprout/algorithm/next_permutation.hpp>
|
|
#include <sprout/algorithm/prev_permutation.hpp>
|
|
#include <sprout/algorithm/copy_while.hpp>
|
|
#include <sprout/algorithm/copy_until.hpp>
|
|
#include <sprout/algorithm/clamp_range.hpp>
|
|
#include <sprout/algorithm/clamp_range_copy.hpp>
|
|
#include <sprout/algorithm/swap_element.hpp>
|
|
#include <sprout/algorithm/swap_element_copy.hpp>
|
|
#include <sprout/algorithm/random_swap.hpp>
|
|
#include <sprout/algorithm/random_swap_result.hpp>
|
|
#include <sprout/algorithm/bogo_sort.hpp>
|
|
#include <sprout/algorithm/bogo_sort_result.hpp>
|
|
#include <sprout/algorithm/bozo_sort.hpp>
|
|
#include <sprout/algorithm/bozo_sort_result.hpp>
|
|
|
|
#endif // #ifndef SPROUT_ALGORITHM_MODIFYIING_HPP
|