/*============================================================================= Copyright (c) 2011-2016 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_OPERATION_FIT_INSERT_N_HPP #define SPROUT_OPERATION_FIT_INSERT_N_HPP #include #include #include #include #include #include #include namespace sprout { namespace fit { namespace results { // // insert_n // template struct insert_n { public: typedef sprout::sub_array< typename sprout::container_traits< typename sprout::fixed::results::insert_n::type >::internal_type > type; }; } // namespace results // // insert_n // template inline SPROUT_CONSTEXPR typename sprout::fit::results::insert_n::type insert_n( Container const& cont, typename sprout::container_traits::const_iterator pos, T const& v, Values const&... values ) { return sprout::sub_copy( sprout::get_internal(sprout::fixed::insert_n(cont, pos, v, values...)), sprout::internal_begin_offset(cont), sprout::internal_end_offset(cont) + (1 + sizeof...(Values)) * N ); } template inline SPROUT_CONSTEXPR typename sprout::fit::results::insert_n::type insert_n( Container const& cont, typename sprout::container_traits::difference_type pos, T const& v, Values const&... values ) { return sprout::sub_copy( sprout::get_internal(sprout::fixed::insert_n(cont, pos, v, values...)), sprout::internal_begin_offset(cont), sprout::internal_end_offset(cont) + (1 + sizeof...(Values)) * N ); } } // namespace fit } // namespace sprout #endif // #ifndef SPROUT_OPERATION_FIT_INSERT_N_HPP