vector.hpp

// Copyright (C) 2013, Ennio Barbaro.
//
// Use, modification, and distribution is subject to 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)
//
// See http://sbabbi.github.io/tinympl for documentation.
//
// You are welcome to contact the author at:
//  enniobarbaro@gmail.com
//

#ifndef TINYMPL_VECTOR_HPP
#define TINYMPL_VECTOR_HPP

#include <tinympl/algorithm.hpp>
#include <tinympl/sequence.hpp>

namespace tinympl {

template<class ... Args>
struct vector
{
    enum
    {
        size = sizeof ... (Args) 
    };

    enum
    {
        empty = (size == 0) 
    };

    template<std::size_t i>
    struct at
    {
        static_assert(i < size,"Index i is out of range");
        typedef typename variadic::at<i,Args...>::type type;
    };

    template<class T>
    struct push_back
    {
        typedef vector<Args...,T> type;
    };

    template<class T>
    struct push_front
    {
        typedef vector<T,Args...> type;
    };

    struct pop_back
    {
        typedef typename variadic::erase<size-1,size,tinympl::vector,Args...>::type type;
    };

    struct pop_front
    {
        typedef typename variadic::erase<0,1,tinympl::vector,Args...>::type type;
    };

    template<std::size_t first,std::size_t last>
    struct erase : tinympl::erase<first,last,vector<Args...>,tinympl::vector> {};

    template<std::size_t i,class ... Ts>
    struct insert : tinympl::insert<i,
        sequence<Ts...>,
        vector<Args...>,
        tinympl::vector> {};

    struct front
    {
        typedef typename variadic::at<0,Args...>::type type;
    };

    struct back
    {
        typedef typename variadic::at<size-1,Args...>::type type;
    };
};

template<class ... Args> struct as_sequence<vector<Args...> >
{
    typedef sequence<Args...> type;
    template<class ... Ts> using rebind = vector<Ts...>;
};

}

#endif // TINYMPL_VECTOR_HPP