mirror/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout.git synced 2024-12-23 21:25:49 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

fix isolated files

Browse source
This commit is contained in:
bolero-MURAKAMI 2014-05-30 01:22:00 +09:00
parent f45298f81f
commit 7f8a352783
27 changed files with 270 additions and 55 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
sprout/algorithm/fit/results.hpp
View file

@ -5,8 +5,8 @@
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_FIT_RESULT_OF_HPP
#define SPROUT_ALGORITHM_FIT_RESULT_OF_HPP
#ifndef SPROUT_ALGORITHM_FIT_RESULTS_HPP
#define SPROUT_ALGORITHM_FIT_RESULTS_HPP
#include <type_traits>
#include <sprout/config.hpp>
@ -36,4 +36,4 @@ namespace sprout {
} // namespace fit
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIT_RESULT_OF_HPP
#endif // #ifndef SPROUT_ALGORITHM_FIT_RESULTS_HPP

6
sprout/algorithm/fixed/results.hpp
View file

@ -5,8 +5,8 @@
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_RESULT_OF_HPP
#define SPROUT_ALGORITHM_FIXED_RESULT_OF_HPP
#ifndef SPROUT_ALGORITHM_FIXED_RESULTS_HPP
#define SPROUT_ALGORITHM_FIXED_RESULTS_HPP
#include <type_traits>
#include <sprout/config.hpp>
@ -45,4 +45,4 @@ namespace sprout {
} // namespace results
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIXED_RESULT_OF_HPP
#endif // #ifndef SPROUT_ALGORITHM_FIXED_RESULTS_HPP

6
sprout/algorithm/string/join.hpp
View file

@ -18,7 +18,7 @@
#include <sprout/iterator/type_traits/category.hpp>
#include <sprout/range/adaptor/size_enumed.hpp>
#include <sprout/range/algorithm/lower_bound.hpp>
#include <sprout/range/numeric/partial_sum.hpp>
#include <sprout/range/numeric/fixed/partial_sum.hpp>
#include <sprout/type_traits/integral_constant.hpp>
#include <sprout/type_traits/is_c_str.hpp>
@ -144,7 +144,7 @@ namespace sprout {
return sprout::algorithm::detail::join_impl_ra_1<Result>(
sprout::begin(cont_cont),
sprout::container_indexes<Result>::make(),
sprout::range::partial_sum(
sprout::range::fixed::partial_sum(
cont_cont | sprout::adaptors::size_enumed,
sprout::pit<sizes_type>()
)
@ -324,7 +324,7 @@ namespace sprout {
sprout::begin(cont_cont),
sprout::begin(separator),
sprout::container_indexes<Result>::make(),
sprout::range::partial_sum(
sprout::range::fixed::partial_sum(
cont_cont | sprout::adaptors::size_enumed(sprout::algorithm::detail::str_size(separator), true),
sprout::pit<sizes_type>()
)

4
sprout/cinttypes.hpp
View file

@ -9,7 +9,7 @@
#define SPROUT_CINTTYPES_HPP
#include <sprout/config.hpp>
#include <sprout/cstdlib/conversion.hpp>
#include <sprout/cstdlib/arithmetic.hpp>
#include <sprout/cinttypes/conversion.hpp>
#include <sprout/cinttypes/arithmetic.hpp>
#endif // #ifndef SPROUT_CINTTYPES_HPP

1
sprout/compost/waves/white_noise.hpp
View file

@ -16,7 +16,6 @@
#include <sprout/iterator/generator_iterator.hpp>
#include <sprout/range/range_container.hpp>
#include <sprout/range/adaptor/detail/adapted_range_default.hpp>
#include <sprout/range/algorithm/copy.hpp>
#include <sprout/type_traits/lvalue_reference.hpp>
#include <sprout/utility/forward.hpp>
#include <sprout/utility/lvalue_forward.hpp>

2
sprout/functional/hash.hpp
View file

@ -9,7 +9,7 @@
#define SPROUT_FUNCTIONAL_HASH_HPP
#include <sprout/config.hpp>
#include <sprout/functional/hash/hash_fwd.hpp>
#include <sprout/functional/hash_fwd.hpp>
#include <sprout/functional/hash/hash_value.hpp>
#include <sprout/functional/hash/to_hash.hpp>
#include <sprout/functional/hash/hash.hpp>

39
sprout/limits.hpp
View file

@ -251,36 +251,51 @@ namespace sprout {
} \
}
#if !defined(__FLT_DENORM_MIN__)
SPROUT_NUMERIC_LIMITS_FLOATING_POINT_SPECIALIZED_DECL(
float,
FLT_MIN, FLT_MAX,
FLT_EPSILON, 0.5F,
#if !defined(__FLT_DENORM_MIN__)
INFINITY, NAN, NAN, FLT_MIN
#else // #if !defined(__FLT_DENORM_MIN__)
__builtin_huge_valf(), __builtin_nanf(""), __builtin_nansf(""), __FLT_DENORM_MIN__
#endif // #if !defined(__FLT_DENORM_MIN__)
);
#else // #if !defined(__FLT_DENORM_MIN__)
SPROUT_NUMERIC_LIMITS_FLOATING_POINT_SPECIALIZED_DECL(
float,
FLT_MIN, FLT_MAX,
FLT_EPSILON, 0.5F,
__builtin_huge_valf(), __builtin_nanf(""), __builtin_nansf(""), __FLT_DENORM_MIN__
);
#endif // #if !defined(__FLT_DENORM_MIN__)
#if !defined(__DBL_DENORM_MIN__)
SPROUT_NUMERIC_LIMITS_FLOATING_POINT_SPECIALIZED_DECL(
double,
DBL_MIN, DBL_MAX,
DBL_EPSILON, 0.5,
#if !defined(__DBL_DENORM_MIN__)
INFINITY, NAN, NAN, DBL_MIN
#else // #if !defined(__DBL_DENORM_MIN__)
__builtin_huge_val(), __builtin_nan(""), __builtin_nans(""), __DBL_DENORM_MIN__
#endif // #if !defined(__DBL_DENORM_MIN__)
);
#else // #if !defined(__DBL_DENORM_MIN__)
SPROUT_NUMERIC_LIMITS_FLOATING_POINT_SPECIALIZED_DECL(
double,
DBL_MIN, DBL_MAX,
DBL_EPSILON, 0.5,
__builtin_huge_val(), __builtin_nan(""), __builtin_nans(""), __DBL_DENORM_MIN__
);
#endif // #if !defined(__DBL_DENORM_MIN__)
#if !defined(__LDBL_DENORM_MIN__)
SPROUT_NUMERIC_LIMITS_FLOATING_POINT_SPECIALIZED_DECL(
long double,
LDBL_MIN, LDBL_MAX,
LDBL_EPSILON, 0.5L,
#if !defined(__LDBL_DENORM_MIN__)
INFINITY, NAN, NAN, LDBL_MIN
#else // #if !defined(__LDBL_DENORM_MIN__)
__builtin_huge_val(), __builtin_nan(""), __builtin_nans(""), __LDBL_DENORM_MIN__
#endif // #if !defined(__LDBL_DENORM_MIN__)
);
#else // #if !defined(__LDBL_DENORM_MIN__)
SPROUT_NUMERIC_LIMITS_FLOATING_POINT_SPECIALIZED_DECL(
long double,
LDBL_MIN, LDBL_MAX,
LDBL_EPSILON, 0.5L,
__builtin_huge_val(), __builtin_nan(""), __builtin_nans(""), __LDBL_DENORM_MIN__
);
#endif // #if !defined(__LDBL_DENORM_MIN__)
#undef SPROUT_NUMERIC_LIMITS_FLOATING_POINT_SPECIALIZED_DECL
#else // #ifdef SPROUT_NO_CXX11_NUMERIC_LIMITS

2
sprout/logic/tribool.hpp
View file

@ -9,7 +9,7 @@
#define SPROUT_LOGIC_TRIBOOL_HPP
#include <sprout/config.hpp>
#include <sprout/logic/tribool/tribool_fwd.hpp>
#include <sprout/logic/tribool_fwd.hpp>
#include <sprout/logic/tribool/tribool.hpp>
#include <sprout/logic/tribool/io.hpp>
#include <sprout/logic/tribool/hash.hpp>

4
sprout/numeric/dft/cxx14/spectrum.hpp
View file

@ -11,8 +11,8 @@
#include <sprout/config.hpp>
#include <sprout/iterator/type_traits/is_iterator_of.hpp>
#include <sprout/type_traits/enabler_if.hpp>
#include <sprout/numeric/dft/amplitude_spectrum.hpp>
#include <sprout/numeric/dft/phase_spectrum.hpp>
#include <sprout/numeric/dft/cxx14/amplitude_spectrum.hpp>
#include <sprout/numeric/dft/cxx14/phase_spectrum.hpp>
namespace sprout {
//

2
sprout/range/adaptor/copied.hpp
View file

@ -14,7 +14,7 @@
#include <sprout/container/functions.hpp>
#include <sprout/algorithm/fixed/results.hpp>
#include <sprout/range/adaptor/detail/adapted_range_default.hpp>
#include <sprout/range/algorithm/copy.hpp>
#include <sprout/range/algorithm/fixed/copy.hpp>
#include <sprout/type_traits/lvalue_reference.hpp>
#include <sprout/utility/forward.hpp>
#include <sprout/utility/lvalue_forward.hpp>

2
sprout/range/adaptor/detail/adapted_range_default.hpp
View file

@ -13,7 +13,7 @@
#include <sprout/container/traits.hpp>
#include <sprout/container/functions.hpp>
#include <sprout/range/range_container.hpp>
#include <sprout/range/algorithm/copy.hpp>
#include <sprout/range/algorithm/fixed/copy.hpp>
#include <sprout/utility/forward.hpp>
namespace sprout {

2
sprout/range/adaptor/detail/jointed_range_default.hpp
View file

@ -14,7 +14,7 @@
#include <sprout/container/functions.hpp>
#include <sprout/container/metafunctions.hpp>
#include <sprout/range/range_container.hpp>
#include <sprout/range/algorithm/copy.hpp>
#include <sprout/range/algorithm/fixed/copy.hpp>
#include <sprout/utility/forward.hpp>
#include <sprout/type_traits/arithmetic_promote.hpp>

2
sprout/range/adaptor/detail/sized_range_default.hpp
View file

@ -14,7 +14,7 @@
#include <sprout/container/functions.hpp>
#include <sprout/container/metafunctions.hpp>
#include <sprout/range/range_container.hpp>
#include <sprout/range/algorithm/copy.hpp>
#include <sprout/range/algorithm/fixed/copy.hpp>
#include <sprout/utility/forward.hpp>
namespace sprout {

14
sprout/range/algorithm/partial_sort_copy.hpp Normal file
View file

@ -0,0 +1,14 @@
/*=============================================================================
Copyright (c) 2011-2014 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_PARTIAL_SORT_COPY_HPP
#define SPROUT_RANGE_ALGORITHM_PARTIAL_SORT_COPY_HPP
#include <sprout/config.hpp>
#include <sprout/range/algorithm/cxx14/partial_sort_copy.hpp>
#endif // #ifndef SPROUT_RANGE_ALGORITHM_PARTIAL_SORT_COPY_HPP

1
sprout/range/algorithm/swap_element_copy.hpp
View file

@ -11,6 +11,5 @@
#include <sprout/config.hpp>
#include <sprout/range/algorithm/fixed/swap_element_copy.hpp>
#include <sprout/range/algorithm/fit/swap_element_copy.hpp>
#include <sprout/range/algorithm/cxx14/swap_element_copy.hpp>
#endif // #ifndef SPROUT_RANGE_ALGORITHM_SWAP_ELEMENT_COPY_HPP

1
sprout/type.hpp
View file

@ -17,6 +17,7 @@
#include <sprout/type/rebind_types.hpp>
#include <sprout/type/functional.hpp>
#include <sprout/type/algorithm.hpp>
#include <sprout/type/seq/algorithm.hpp>
#include <sprout/type/operation.hpp>
#include <sprout/type/print.hpp>

6
sprout/type_traits/common_type.hpp
View file

@ -9,10 +9,12 @@
#define SPROUT_TYPE_TRAITS_COMMON_TYPE_HPP
#include <utility>
#include <type_traits>
#include <sprout/config.hpp>
#include <sprout/type_traits/identity.hpp>
#include <sprout/type_traits/has_type.hpp>
#include <sprout/utility/pack.hpp>
#include <sprout/detail/nil_base.hpp>
namespace sprout {
//
@ -24,7 +26,9 @@ namespace sprout {
: public sprout::identity<decltype(std::declval<bool>() ? std::declval<T1>() : std::declval<T2>())>
{};
template<typename Void, typename... Types>
struct undecayed_common_type_impl {};
struct undecayed_common_type_impl
: public sprout::detail::nil_base
{};
template<typename T>
struct undecayed_common_type_impl<void, T>
: public sprout::identity<T>

1
sprout/utility.hpp
View file

@ -17,6 +17,7 @@
#include <sprout/utility/pack.hpp>
#include <sprout/utility/value_holder.hpp>
#include <sprout/utility/string_ref.hpp>
#include <sprout/utility/string_view.hpp>
#include <sprout/utility/any_convertible.hpp>
#include <sprout/utility/use_default.hpp>

1
sprout/weed/attr_cnv.hpp
View file

@ -15,5 +15,6 @@
#include <sprout/weed/attr_cnv/modulus.hpp>
#include <sprout/weed/attr_cnv/bitwise_or.hpp>
#include <sprout/weed/attr_cnv/mem_ptr.hpp>
#include <sprout/weed/attr_cnv/results.hpp>
#endif // #ifndef SPROUT_WEED_ATTR_CNV_HPP

6
sprout/weed/attr_cnv/results.hpp
View file

@ -5,8 +5,8 @@
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_WEED_ATTR_CNV_RESULT_OF_HPP
#define SPROUT_WEED_ATTR_CNV_RESULT_OF_HPP
#ifndef SPROUT_WEED_ATTR_CNV_RESULTS_HPP
#define SPROUT_WEED_ATTR_CNV_RESULTS_HPP
#include <sprout/config.hpp>
#include <sprout/weed/attr_cnv/results/times.hpp>
@ -16,4 +16,4 @@
#include <sprout/weed/attr_cnv/results/bitwise_or.hpp>
#include <sprout/weed/attr_cnv/results/mem_ptr.hpp>
#endif // #ifndef SPROUT_WEED_ATTR_CNV_RESULT_OF_HPP
#endif // #ifndef SPROUT_WEED_ATTR_CNV_RESULTS_HPP

6
sprout/weed/attr_cnv/results/bitwise_or.hpp
View file

@ -5,8 +5,8 @@
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_WEED_ATTR_CNV_RESULT_OF_BITWISE_OR_HPP
#define SPROUT_WEED_ATTR_CNV_RESULT_OF_BITWISE_OR_HPP
#ifndef SPROUT_WEED_ATTR_CNV_RESULTS_BITWISE_OR_HPP
#define SPROUT_WEED_ATTR_CNV_RESULTS_BITWISE_OR_HPP
#include <type_traits>
#include <sprout/config.hpp>
@ -164,4 +164,4 @@ namespace sprout {
} // namespace weed
} // namespace sprout
#endif // #ifndef SPROUT_WEED_ATTR_CNV_RESULT_OF_BITWISE_OR_HPP
#endif // #ifndef SPROUT_WEED_ATTR_CNV_RESULTS_BITWISE_OR_HPP

6
sprout/weed/attr_cnv/results/mem_ptr.hpp
View file

@ -5,8 +5,8 @@
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_WEED_ATTR_CNV_RESULT_OF_MEM_PTR_HPP
#define SPROUT_WEED_ATTR_CNV_RESULT_OF_MEM_PTR_HPP
#ifndef SPROUT_WEED_ATTR_CNV_RESULTS_MEM_PTR_HPP
#define SPROUT_WEED_ATTR_CNV_RESULTS_MEM_PTR_HPP
#include <type_traits>
#include <sprout/config.hpp>
@ -27,4 +27,4 @@ namespace sprout {
} // namespace weed
} // namespace sprout
#endif // #ifndef SPROUT_WEED_ATTR_CNV_RESULT_OF_MEM_PTR_HPP
#endif // #ifndef SPROUT_WEED_ATTR_CNV_RESULTS_MEM_PTR_HPP

6
sprout/weed/attr_cnv/results/modulus.hpp
View file

@ -5,8 +5,8 @@
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_WEED_ATTR_CNV_RESULT_OF_MODULUS_HPP
#define SPROUT_WEED_ATTR_CNV_RESULT_OF_MODULUS_HPP
#ifndef SPROUT_WEED_ATTR_CNV_RESULTS_MODULUS_HPP
#define SPROUT_WEED_ATTR_CNV_RESULTS_MODULUS_HPP
#include <sprout/config.hpp>
#include <sprout/workaround/std/cstddef.hpp>
@ -28,4 +28,4 @@ namespace sprout {
} // namespace weed
} // namespace sprout
#endif // #ifndef SPROUT_WEED_ATTR_CNV_RESULT_OF_MODULUS_HPP
#endif // #ifndef SPROUT_WEED_ATTR_CNV_RESULTS_MODULUS_HPP

6
sprout/weed/attr_cnv/results/negate.hpp
View file

@ -5,8 +5,8 @@
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_WEED_ATTR_CNV_RESULT_OF_NEGATE_HPP
#define SPROUT_WEED_ATTR_CNV_RESULT_OF_NEGATE_HPP
#ifndef SPROUT_WEED_ATTR_CNV_RESULTS_NEGATE_HPP
#define SPROUT_WEED_ATTR_CNV_RESULTS_NEGATE_HPP
#include <type_traits>
#include <sprout/config.hpp>
@ -38,4 +38,4 @@ namespace sprout {
} // namespace weed
} // namespace sprout
#endif // #ifndef SPROUT_WEED_ATTR_CNV_RESULT_OF_NEGATE_HPP
#endif // #ifndef SPROUT_WEED_ATTR_CNV_RESULTS_NEGATE_HPP

6
sprout/weed/attr_cnv/results/shift_left.hpp
View file

@ -5,8 +5,8 @@
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_WEED_ATTR_CNV_RESULT_OF_SHIFT_LEFT_HPP
#define SPROUT_WEED_ATTR_CNV_RESULT_OF_SHIFT_LEFT_HPP
#ifndef SPROUT_WEED_ATTR_CNV_RESULTS_SHIFT_LEFT_HPP
#define SPROUT_WEED_ATTR_CNV_RESULTS_SHIFT_LEFT_HPP
#include <type_traits>
#include <sprout/config.hpp>
@ -172,4 +172,4 @@ namespace sprout {
} // namespace weed
} // namespace sprout
#endif // #ifndef SPROUT_WEED_ATTR_CNV_RESULT_OF_SHIFT_LEFT_HPP
#endif // #ifndef SPROUT_WEED_ATTR_CNV_RESULTS_SHIFT_LEFT_HPP

6
sprout/weed/attr_cnv/results/times.hpp
View file

@ -5,8 +5,8 @@
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_WEED_ATTR_CNV_RESULT_OF_TIMES_HPP
#define SPROUT_WEED_ATTR_CNV_RESULT_OF_TIMES_HPP
#ifndef SPROUT_WEED_ATTR_CNV_RESULTS_TIMES_HPP
#define SPROUT_WEED_ATTR_CNV_RESULTS_TIMES_HPP
#include <type_traits>
#include <sprout/config.hpp>
@ -76,4 +76,4 @@ namespace sprout {
} // namespace weed
} // namespace sprout
#endif // #ifndef SPROUT_WEED_ATTR_CNV_RESULT_OF_TIMES_HPP
#endif // #ifndef SPROUT_WEED_ATTR_CNV_RESULTS_TIMES_HPP

181
testspr/header_all.hpp
View file

@ -37,6 +37,7 @@
#include <sprout/darkroom.hpp>
#include <sprout/endian_traits.hpp>
#include <sprout/exempt_ptr.hpp>
#include <sprout/forward_clist.hpp>
#include <sprout/functional.hpp>
#include <sprout/generator.hpp>
#include <sprout/index_tuple.hpp>
@ -60,13 +61,18 @@
#include <sprout/range.hpp>
#include <sprout/range/adaptor.hpp>
#include <sprout/range/algorithm.hpp>
#include <sprout/range/algorithm/string.hpp>
#include <sprout/range/numeric.hpp>
#include <sprout/range/numeric/dft.hpp>
#include <sprout/range/numeric/fft.hpp>
#include <sprout/static_assert.hpp>
#include <sprout/static_warning.hpp>
#include <sprout/string.hpp>
#include <sprout/sub_array.hpp>
#include <sprout/tpp/algorithm.hpp>
#include <sprout/tuple.hpp>
#include <sprout/tuple/algorithm.hpp>
#include <sprout/tuple/operation.hpp>
#include <sprout/type.hpp>
#include <sprout/type_traits.hpp>
#include <sprout/utility.hpp>
@ -75,4 +81,179 @@
#include <sprout/weed.hpp>
#include <sprout/workaround.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>
#include <sprout/algorithm/clamp_range.hpp>
#include <sprout/algorithm/clamp_range_copy.hpp>
#include <sprout/algorithm/copy.hpp>
#include <sprout/algorithm/copy_backward.hpp>
#include <sprout/algorithm/copy_if.hpp>
#include <sprout/algorithm/copy_n.hpp>
#include <sprout/algorithm/copy_until.hpp>
#include <sprout/algorithm/copy_while.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/inplace_merge.hpp>
#include <sprout/algorithm/iter_swap.hpp>
#include <sprout/algorithm/make_heap.hpp>
#include <sprout/algorithm/make_partial_heap.hpp>
#include <sprout/algorithm/merge.hpp>
#include <sprout/algorithm/move.hpp>
#include <sprout/algorithm/move_backward.hpp>
#include <sprout/algorithm/next_permutation.hpp>
#include <sprout/algorithm/nth_element.hpp>
#include <sprout/algorithm/partial_sort.hpp>
#include <sprout/algorithm/partial_sort_copy.hpp>
#include <sprout/algorithm/partition.hpp>
#include <sprout/algorithm/partition_copy.hpp>
#include <sprout/algorithm/pop_heap.hpp>
#include <sprout/algorithm/prev_permutation.hpp>
#include <sprout/algorithm/push_heap.hpp>
#include <sprout/algorithm/random_shuffle.hpp>
#include <sprout/algorithm/random_swap.hpp>
#include <sprout/algorithm/random_swap_result.hpp>
#include <sprout/algorithm/recurrence.hpp>
#include <sprout/algorithm/recurrence_n.hpp>
#include <sprout/algorithm/remove.hpp>
#include <sprout/algorithm/remove_copy.hpp>
#include <sprout/algorithm/remove_copy_if.hpp>
#include <sprout/algorithm/remove_if.hpp>
#include <sprout/algorithm/replace.hpp>
#include <sprout/algorithm/replace_copy.hpp>
#include <sprout/algorithm/replace_copy_if.hpp>
#include <sprout/algorithm/replace_if.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/sample.hpp>
#include <sprout/algorithm/set_difference.hpp>
#include <sprout/algorithm/set_intersection.hpp>
#include <sprout/algorithm/set_symmetric_difference.hpp>
#include <sprout/algorithm/set_union.hpp>
#include <sprout/algorithm/shuffle.hpp>
#include <sprout/algorithm/shuffle_result.hpp>
#include <sprout/algorithm/sort.hpp>
#include <sprout/algorithm/sort_heap.hpp>
#include <sprout/algorithm/stable_partition.hpp>
#include <sprout/algorithm/stable_partition_copy.hpp>
#include <sprout/algorithm/stable_sort.hpp>
#include <sprout/algorithm/swap_element.hpp>
#include <sprout/algorithm/swap_element_copy.hpp>
#include <sprout/algorithm/swap_ranges.hpp>
#include <sprout/algorithm/transform.hpp>
#include <sprout/algorithm/unfold.hpp>
#include <sprout/algorithm/unfold_n.hpp>
#include <sprout/algorithm/unique.hpp>
#include <sprout/algorithm/unique_copy.hpp>
#include <sprout/algorithm/string/to_lower.hpp>
#include <sprout/algorithm/string/to_lower_copy.hpp>
#include <sprout/algorithm/string/to_upper.hpp>
#include <sprout/algorithm/string/to_upper_copy.hpp>
#include <sprout/numeric/adjacent_difference.hpp>
#include <sprout/numeric/dft/amplitude_spectrum.hpp>
#include <sprout/numeric/dft/dft.hpp>
#include <sprout/numeric/dft/idft.hpp>
#include <sprout/numeric/dft/phase_spectrum.hpp>
#include <sprout/numeric/dft/sawtooth.hpp>
#include <sprout/numeric/dft/sinusoid.hpp>
#include <sprout/numeric/dft/spectrum.hpp>
#include <sprout/numeric/dft/square.hpp>
#include <sprout/numeric/dft/triangle.hpp>
#include <sprout/numeric/dft/wave.hpp>
#include <sprout/numeric/iota.hpp>
#include <sprout/numeric/partial_sum.hpp>
#include <sprout/operation/append.hpp>
#include <sprout/operation/append_back.hpp>
#include <sprout/operation/append_front.hpp>
#include <sprout/operation/erase.hpp>
#include <sprout/operation/erase_n.hpp>
#include <sprout/operation/insert.hpp>
#include <sprout/operation/insert_n.hpp>
#include <sprout/operation/pop_back.hpp>
#include <sprout/operation/pop_back_n.hpp>
#include <sprout/operation/pop_front.hpp>
#include <sprout/operation/pop_front_n.hpp>
#include <sprout/operation/push_back.hpp>
#include <sprout/operation/push_back_n.hpp>
#include <sprout/operation/push_front.hpp>
#include <sprout/operation/push_front_n.hpp>
#include <sprout/operation/realign.hpp>
#include <sprout/operation/realign_to.hpp>
#include <sprout/operation/resize.hpp>
#include <sprout/operation/resize_backward.hpp>
#include <sprout/operation/set.hpp>
#include <sprout/range/algorithm/bogo_sort.hpp>
#include <sprout/range/algorithm/bozo_sort.hpp>
#include <sprout/range/algorithm/clamp_range.hpp>
#include <sprout/range/algorithm/clamp_range_copy.hpp>
#include <sprout/range/algorithm/copy.hpp>
#include <sprout/range/algorithm/copy_backward.hpp>
#include <sprout/range/algorithm/copy_if.hpp>
#include <sprout/range/algorithm/copy_until.hpp>
#include <sprout/range/algorithm/copy_while.hpp>
#include <sprout/range/algorithm/fill.hpp>
#include <sprout/range/algorithm/generate.hpp>
#include <sprout/range/algorithm/inplace_merge.hpp>
#include <sprout/range/algorithm/make_heap.hpp>
#include <sprout/range/algorithm/merge.hpp>
#include <sprout/range/algorithm/move.hpp>
#include <sprout/range/algorithm/move_backward.hpp>
#include <sprout/range/algorithm/next_permutation.hpp>
#include <sprout/range/algorithm/nth_element.hpp>
#include <sprout/range/algorithm/partial_sort.hpp>
#include <sprout/range/algorithm/partial_sort_copy.hpp>
#include <sprout/range/algorithm/partition.hpp>
#include <sprout/range/algorithm/partition_copy.hpp>
#include <sprout/range/algorithm/pop_heap.hpp>
#include <sprout/range/algorithm/prev_permutation.hpp>
#include <sprout/range/algorithm/push_heap.hpp>
#include <sprout/range/algorithm/random_shuffle.hpp>
#include <sprout/range/algorithm/random_swap.hpp>
#include <sprout/range/algorithm/remove.hpp>
#include <sprout/range/algorithm/remove_copy.hpp>
#include <sprout/range/algorithm/remove_copy_if.hpp>
#include <sprout/range/algorithm/remove_if.hpp>
#include <sprout/range/algorithm/replace.hpp>
#include <sprout/range/algorithm/replace_copy.hpp>
#include <sprout/range/algorithm/replace_copy_if.hpp>
#include <sprout/range/algorithm/replace_if.hpp>
#include <sprout/range/algorithm/reverse.hpp>
#include <sprout/range/algorithm/reverse_copy.hpp>
#include <sprout/range/algorithm/rotate.hpp>
#include <sprout/range/algorithm/rotate_copy.hpp>
#include <sprout/range/algorithm/sample.hpp>
#include <sprout/range/algorithm/set_difference.hpp>
#include <sprout/range/algorithm/set_intersection.hpp>
#include <sprout/range/algorithm/set_symmetric_difference.hpp>
#include <sprout/range/algorithm/set_union.hpp>
#include <sprout/range/algorithm/shuffle.hpp>
#include <sprout/range/algorithm/sort.hpp>
#include <sprout/range/algorithm/sort_heap.hpp>
#include <sprout/range/algorithm/stable_partition.hpp>
#include <sprout/range/algorithm/stable_partition_copy.hpp>
#include <sprout/range/algorithm/stable_sort.hpp>
#include <sprout/range/algorithm/swap_element_copy.hpp>
#include <sprout/range/algorithm/swap_ranges.hpp>
#include <sprout/range/algorithm/transform.hpp>
#include <sprout/range/algorithm/unique.hpp>
#include <sprout/range/algorithm/unique_copy.hpp>
#include <sprout/range/algorithm/string/to_lower_copy.hpp>
#include <sprout/range/algorithm/string/to_upper_copy.hpp>
#include <sprout/range/numeric/adjacent_difference.hpp>
#include <sprout/range/numeric/dft/amplitude_spectrum.hpp>
#include <sprout/range/numeric/dft/dft.hpp>
#include <sprout/range/numeric/dft/idft.hpp>
#include <sprout/range/numeric/dft/phase_spectrum.hpp>
#include <sprout/range/numeric/dft/spectrum.hpp>
#include <sprout/range/numeric/partial_sum.hpp>
#endif // #ifndef TESTSPR_HEADER_ALL_HPP