mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2024-12-27 21:45:42 +00:00
35 lines
1.8 KiB
C++
35 lines
1.8 KiB
C++
/*=============================================================================
|
|
Copyright (c) 2011-2019 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_RANGE_ALGORITHM_FIT_HPP
|
|
#define SPROUT_RANGE_ALGORITHM_FIT_HPP
|
|
|
|
#include <sprout/config.hpp>
|
|
#include <sprout/range/algorithm/fit/copy.hpp>
|
|
#include <sprout/range/algorithm/fit/copy_if.hpp>
|
|
#include <sprout/range/algorithm/fit/copy_backward.hpp>
|
|
#include <sprout/range/algorithm/fit/transform.hpp>
|
|
#include <sprout/range/algorithm/fit/replace_copy.hpp>
|
|
#include <sprout/range/algorithm/fit/replace_copy_if.hpp>
|
|
#include <sprout/range/algorithm/fit/remove_copy.hpp>
|
|
#include <sprout/range/algorithm/fit/remove_copy_if.hpp>
|
|
#include <sprout/range/algorithm/fit/unique_copy.hpp>
|
|
#include <sprout/range/algorithm/fit/reverse_copy.hpp>
|
|
#include <sprout/range/algorithm/fit/rotate_copy.hpp>
|
|
#include <sprout/range/algorithm/fit/partition_copy.hpp>
|
|
#include <sprout/range/algorithm/fit/stable_partition_copy.hpp>
|
|
#include <sprout/range/algorithm/fit/merge.hpp>
|
|
#include <sprout/range/algorithm/fit/set_union.hpp>
|
|
#include <sprout/range/algorithm/fit/set_intersection.hpp>
|
|
#include <sprout/range/algorithm/fit/set_difference.hpp>
|
|
#include <sprout/range/algorithm/fit/set_symmetric_difference.hpp>
|
|
#include <sprout/range/algorithm/fit/copy_while.hpp>
|
|
#include <sprout/range/algorithm/fit/copy_until.hpp>
|
|
#include <sprout/range/algorithm/fit/clamp_range_copy.hpp>
|
|
#include <sprout/range/algorithm/fit/swap_element_copy.hpp>
|
|
|
|
#endif // #ifndef SPROUT_RANGE_ALGORITHM_FIT_HPP
|