rest.hpp

Go to the documentation of this file.

/*
Copyright© 2014 Akihiro Nishimura

This software is released under the MIT License.
http://opensource.org/licenses/mit-license.php
*/

#ifndef SIG_UTIL_REST_HPP
#define SIG_UTIL_REST_HPP

#include "../helper/helper_modules.hpp"
#include "../helper/container_helper.hpp"
#include "../modify/sort.hpp"


namespace sig
{

template <class T1, class T2,
    class TC = typename std::common_type<T1, T2>::type,
    class C = std::vector<TC>
>
C seqn(T1 st, T2 d, uint n)
{
    C result = impl::container_traits<C>::make(n);

    for (uint i = 0; i<n; ++i) impl::container_traits<C>::add_element(result, static_cast<TC>(st) + i * static_cast<TC>(d));

    return result;
}

#if SIG_GCC_GT4_8_0 || SIG_CLANG_GT_3_4 || !(SIG_MSVC_VER <= 120)


template <class F, class C,
    typename std::enable_if<impl::container_traits<typename impl::remove_const_reference<C>::type>::exist>::type*& = enabler
>
auto sort(F&& binary_op, C&& data)
{
    auto result = std::forward<C>(data);

    sort(result, std::forward<F>(binary_op));

    return result;
}
/*
template <class F, class C, typename std::enable_if<!impl::has_random_access_iter<C>::value, void>::type*& = enabler>
auto sort(F&& binary_op, C const& data
){
    C result = data;

    //result.sort(binary_op);

    return result;
}
*/
#endif

}
#endif