text: /*=============================================================================
    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_LIBS_ALGORITHM_TEST_INPLACE_MERGE_CPP
  #define SPROUT_LIBS_ALGORITHM_TEST_INPLACE_MERGE_CPP
  
  #include <sprout/algorithm/inplace_merge.hpp>
  #include <sprout/array.hpp>
  #include <sprout/sub_array.hpp>
  #include <sprout/container.hpp>
  #include <testspr/tools.hpp>
  
  namespace testspr {
  	static void algorithm_inplace_merge_test() {
  		using namespace sprout;
  		{
  			SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 3, 5, 7, 9, 2, 4, 6, 8, 10}};
  
  			// merge
  			{
  				SPROUT_STATIC_CONSTEXPR auto merged = sprout::inplace_merge(
  					arr1,
  					sprout::begin(arr1) + 5
  					);
  				TESTSPR_BOTH_ASSERT(testspr::equal(
  					merged,
  					array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}}
  					));
  			}
  			{
  				SPROUT_STATIC_CONSTEXPR auto merged = sprout::fit::inplace_merge(
  					arr1,
  					sprout::begin(arr1) + 5
  					);
  				TESTSPR_BOTH_ASSERT(testspr::equal(
  					merged,
  					array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}}
  					));
  			}
  			// merge
  			// from sub range
  			{
  				SPROUT_STATIC_CONSTEXPR auto merged = sprout::inplace_merge(
  					sprout::sub(arr1, 2, 8),
  					sprout::begin(arr1) + 5
  					);
  				TESTSPR_BOTH_ASSERT(testspr::equal(
  					merged,
  					array<int, 6>{{2, 4, 5, 6, 7, 9}}
  					));
  				TESTSPR_BOTH_ASSERT(testspr::equal(
  					sprout::get_internal(merged),
  					array<int, 10>{{1, 3, 2, 4, 5, 6, 7, 9, 8, 10}}
  					));
  			}
  			{
  				SPROUT_STATIC_CONSTEXPR auto merged = sprout::fit::inplace_merge(
  					sprout::sub(arr1, 2, 8),
  					sprout::begin(arr1) + 5
  					);
  				TESTSPR_BOTH_ASSERT(testspr::equal(
  					merged,
  					array<int, 6>{{2, 4, 5, 6, 7, 9}}
  					));
  				TESTSPR_BOTH_ASSERT(testspr::equal(
  					sprout::get_internal(merged),
  					array<int, 10>{{1, 3, 2, 4, 5, 6, 7, 9, 8, 10}}
  					));
  			}
  		}
  		{
  			SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 3, 5, 7, 9, 2, 4, 6, 8, 10}};
  
  			// merge
  			{
  				SPROUT_STATIC_CONSTEXPR auto merged = sprout::inplace_merge(
  					arr1,
  					sprout::begin(arr1) + 5,
  					testspr::less<int>()
  					);
  				TESTSPR_BOTH_ASSERT(testspr::equal(
  					merged,
  					array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}}
  					));
  			}
  			{
  				SPROUT_STATIC_CONSTEXPR auto merged = sprout::fit::inplace_merge(
  					arr1,
  					sprout::begin(arr1) + 5,
  					testspr::less<int>()
  					);
  				TESTSPR_BOTH_ASSERT(testspr::equal(
  					merged,
  					array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}}
  					));
  			}
  			// merge
  			// from sub range
  			{
  				SPROUT_STATIC_CONSTEXPR auto merged = sprout::inplace_merge(
  					sprout::sub(arr1, 2, 8),
  					sprout::begin(arr1) + 5,
  					testspr::less<int>()
  					);
  				TESTSPR_BOTH_ASSERT(testspr::equal(
  					merged,
  					array<int, 6>{{2, 4, 5, 6, 7, 9}}
  					));
  				TESTSPR_BOTH_ASSERT(testspr::equal(
  					sprout::get_internal(merged),
  					array<int, 10>{{1, 3, 2, 4, 5, 6, 7, 9, 8, 10}}
  					));
  			}
  			{
  				SPROUT_STATIC_CONSTEXPR auto merged = sprout::fit::inplace_merge(
  					sprout::sub(arr1, 2, 8),
  					sprout::begin(arr1) + 5,
  					testspr::less<int>()
  					);
  				TESTSPR_BOTH_ASSERT(testspr::equal(
  					merged,
  					array<int, 6>{{2, 4, 5, 6, 7, 9}}
  					));
  				TESTSPR_BOTH_ASSERT(testspr::equal(
  					sprout::get_internal(merged),
  					array<int, 10>{{1, 3, 2, 4, 5, 6, 7, 9, 8, 10}}
  					));
  			}
  		}
  	}
  }	// namespace testspr
  
  #ifndef TESTSPR_CPP_INCLUDE
  #	define TESTSPR_TEST_FUNCTION testspr::algorithm_inplace_merge_test
  #	include <testspr/include_main.hpp>
  #endif
  
  #endif	// #ifndef SPROUT_LIBS_ALGORITHM_TEST_INPLACE_MERGE_CPP
  