deque.hpp

Go to the documentation of this file.

 
/*
 * This file is part of Algorithms library toolkit.
 * Copyright (C) 2017 Jan Travnicek (jan.travnicek@fit.cvut.cz)
 
 * Algorithms library toolkit is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 
 * Algorithms library toolkit is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 
 * You should have received a copy of the GNU General Public License
 * along with Algorithms library toolkit.  If not, see <http://www.gnu.org/licenses/>.
 */
 
#pragma once
 
#include <deque>
 
#include <ext/ostream>
 
#include <extensions/range.hpp>
 
namespace ext {
 
template < class T, class Alloc = std::allocator < T > >
class deque : public std::deque < T, Alloc > {
public:
    using std::deque < T, Alloc >::deque; // NOLINT(modernize-use-equals-default)
 
    using std::deque < T, Alloc >::operator =;
#ifndef __clang__
 
    deque ( ) = default;
 
    deque ( const deque & other ) = default;
 
    deque ( deque && other ) = default;
 
    deque & operator = ( deque && other ) = default;
 
    deque & operator = ( const deque & other ) = default;
#endif
 
    template < class Iterator >
    explicit deque ( const ext::iterator_range < Iterator > & range ) : deque ( range.begin ( ), range.end ( ) ) {
    }
 
    auto begin ( ) & {
        return std::deque < T, Alloc >::begin ( );
    }
 
    auto begin ( ) const & {
        return std::deque < T, Alloc >::begin ( );
    }
 
    auto begin ( ) && {
        return make_move_iterator ( this->begin ( ) );
    }
 
    auto end ( ) & {
        return std::deque < T, Alloc >::end ( );
    }
 
    auto end ( ) const & {
        return std::deque < T, Alloc >::end ( );
    }
 
    auto end ( ) && {
        return make_move_iterator ( this->end ( ) );
    }
 
    auto range ( ) & {
        auto endIter = end ( );
        auto beginIter = begin ( );
        return ext::iterator_range < decltype ( endIter ) > ( beginIter, endIter );
    }
 
    auto range ( ) const & {
        auto endIter = end ( );
        auto beginIter = begin ( );
        return ext::iterator_range < decltype ( endIter ) > ( beginIter, endIter );
    }
 
    auto range ( ) && {
        auto endIter = std::move ( * this ).end ( );
        auto beginIter = std::move ( * this ).begin ( );
        return ext::iterator_range < decltype ( endIter ) > ( beginIter, endIter );
    }
};
 
template < class T, class ... Ts >
ext::ostream & operator <<( ext::ostream & out, const ext::deque < T, Ts ... > & list ) {
    out << "[";
 
    bool first = true;
 
    for ( const T & item : list ) {
        if ( !first ) out << ", ";
 
        first = false;
        out << item;
    }
 
    out << "]";
    return out;
}
 
} /* namespace ext */