mirror of
https://github.com/bolero-MURAKAMI/Sprout
synced 2024-11-12 21:09:01 +00:00
75 lines
3.6 KiB
C++
75 lines
3.6 KiB
C++
/*=============================================================================
|
|
Copyright (c) 2011-2015 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_FIXED_HPP
|
|
#define SPROUT_ALGORITHM_FIXED_HPP
|
|
|
|
#include <sprout/config.hpp>
|
|
#include <sprout/algorithm/fixed/copy.hpp>
|
|
#include <sprout/algorithm/fixed/copy_n.hpp>
|
|
#include <sprout/algorithm/fixed/copy_if.hpp>
|
|
#include <sprout/algorithm/fixed/copy_backward.hpp>
|
|
#include <sprout/algorithm/fixed/transform.hpp>
|
|
#include <sprout/algorithm/fixed/replace.hpp>
|
|
#include <sprout/algorithm/fixed/replace_if.hpp>
|
|
#include <sprout/algorithm/fixed/replace_copy.hpp>
|
|
#include <sprout/algorithm/fixed/replace_copy_if.hpp>
|
|
#include <sprout/algorithm/fixed/fill.hpp>
|
|
#include <sprout/algorithm/fixed/fill_n.hpp>
|
|
#include <sprout/algorithm/fixed/generate.hpp>
|
|
#include <sprout/algorithm/fixed/generate_n.hpp>
|
|
#include <sprout/algorithm/fixed/unfold.hpp>
|
|
#include <sprout/algorithm/fixed/unfold_n.hpp>
|
|
#include <sprout/algorithm/fixed/recurrence.hpp>
|
|
#include <sprout/algorithm/fixed/recurrence_n.hpp>
|
|
#include <sprout/algorithm/fixed/remove.hpp>
|
|
#include <sprout/algorithm/fixed/remove_if.hpp>
|
|
#include <sprout/algorithm/fixed/remove_copy.hpp>
|
|
#include <sprout/algorithm/fixed/remove_copy_if.hpp>
|
|
#include <sprout/algorithm/fixed/unique.hpp>
|
|
#include <sprout/algorithm/fixed/unique_copy.hpp>
|
|
#include <sprout/algorithm/fixed/reverse.hpp>
|
|
#include <sprout/algorithm/fixed/reverse_copy.hpp>
|
|
#include <sprout/algorithm/fixed/rotate.hpp>
|
|
#include <sprout/algorithm/fixed/rotate_copy.hpp>
|
|
#include <sprout/algorithm/fixed/shuffle.hpp>
|
|
#include <sprout/algorithm/fixed/shuffle_result.hpp>
|
|
#include <sprout/algorithm/fixed/partition.hpp>
|
|
#include <sprout/algorithm/fixed/partition_copy.hpp>
|
|
#include <sprout/algorithm/fixed/stable_partition.hpp>
|
|
#include <sprout/algorithm/fixed/stable_partition_copy.hpp>
|
|
#include <sprout/algorithm/fixed/sort.hpp>
|
|
#include <sprout/algorithm/fixed/stable_sort.hpp>
|
|
#include <sprout/algorithm/fixed/partial_sort.hpp>
|
|
#include <sprout/algorithm/fixed/nth_element.hpp>
|
|
#include <sprout/algorithm/fixed/merge.hpp>
|
|
#include <sprout/algorithm/fixed/inplace_merge.hpp>
|
|
#include <sprout/algorithm/fixed/set_union.hpp>
|
|
#include <sprout/algorithm/fixed/set_intersection.hpp>
|
|
#include <sprout/algorithm/fixed/set_difference.hpp>
|
|
#include <sprout/algorithm/fixed/set_symmetric_difference.hpp>
|
|
#include <sprout/algorithm/fixed/push_heap.hpp>
|
|
#include <sprout/algorithm/fixed/pop_heap.hpp>
|
|
#include <sprout/algorithm/fixed/make_heap.hpp>
|
|
#include <sprout/algorithm/fixed/make_partial_heap.hpp>
|
|
#include <sprout/algorithm/fixed/sort_heap.hpp>
|
|
#include <sprout/algorithm/fixed/next_permutation.hpp>
|
|
#include <sprout/algorithm/fixed/prev_permutation.hpp>
|
|
#include <sprout/algorithm/fixed/copy_while.hpp>
|
|
#include <sprout/algorithm/fixed/copy_until.hpp>
|
|
#include <sprout/algorithm/fixed/clamp_range.hpp>
|
|
#include <sprout/algorithm/fixed/clamp_range_copy.hpp>
|
|
#include <sprout/algorithm/fixed/swap_element.hpp>
|
|
#include <sprout/algorithm/fixed/swap_element_copy.hpp>
|
|
#include <sprout/algorithm/fixed/random_swap.hpp>
|
|
#include <sprout/algorithm/fixed/random_swap_result.hpp>
|
|
#include <sprout/algorithm/fixed/bogo_sort.hpp>
|
|
#include <sprout/algorithm/fixed/bogo_sort_result.hpp>
|
|
#include <sprout/algorithm/fixed/bozo_sort.hpp>
|
|
#include <sprout/algorithm/fixed/bozo_sort_result.hpp>
|
|
|
|
#endif // #ifndef SPROUT_ALGORITHM_FIXED_HPP
|