container inverter

#include <iostream>
#include <iomanip>
#include <deque>
#include <list>
#include <string>
#include <algorithm>
#include <iterator>
#include <utility>

#include <cstdlib>
#include <cassert>

template< typename type >
struct reversed_container
{

    reversed_container(type && _container)
        : container_(std::forward< type >(_container))
    { ; }

    auto
    begin()
    {
        return std::rbegin(container_);
    }

    auto
    end()
    {
        return std::rend(container_);
    }

private :

    type container_;

};

template< typename type >
reversed_container< type > // type is `type` or `type const` or `type &` or `type const &`
reverse(type && _container)
{
    return std::forward< type >(_container);
}

using namespace std::string_literals;

int
main()
{
    std::deque< int > ref_{1, 2, 3, 4, 5};
    for (int & i : reverse(ref_)) {
        std::cout << i << std::endl;
    }
    std::cout << std::endl;

    std::list< double > const cref_{0.1, 0.2, 0.3, 0.4, 0.5};
    for (double const & d : reverse(cref_)) {
        std::cout << d << std::endl;
    }
    std::cout << std::endl;

    for (typename std::string::value_type & ch : reverse("abcdef"s)) {
        std::cout << std::move(ch) << std::endl;
    }
    return EXIT_SUCCESS;
}