map.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 <map>
#include <utility>
 
#include <ext/ostream>
#include <ext/pair>
 
#include <extensions/range.hpp>
 
namespace ext {
 
template < typename T, typename R, typename Cmp = std::less < >, typename Alloc = std::allocator < std::pair < const T, R > > >
class map : public std::map < T, R, Cmp, Alloc > {
public:
    using std::map< T, R, Cmp, Alloc >::map; // NOLINT(modernize-use-equals-default)
 
    using std::map< T, R, Cmp, Alloc >::operator =;
#ifndef __clang__
 
    map ( ) = default;
 
    map ( const map & other ) = default;
 
    map ( map && other ) = default;
 
    map & operator = ( map && other ) = default;
 
    map & operator = ( const map & other ) = default;
#endif
    template < class Iterator >
    explicit map ( const ext::iterator_range < Iterator > & range ) : map ( range.begin ( ), range.end ( ) ) {
    }
 
    using iterator = typename std::map<T, R, Cmp, Alloc>::iterator;
 
    using std::map< T, R, Cmp, Alloc >::insert;
 
    std::pair < iterator, bool > insert ( const T & key, const R & value ) {
        return insert ( std::make_pair ( key, value ) );
    }
 
    std::pair < iterator, bool > insert ( const T & key, R && value ) {
        return insert ( std::make_pair ( key, std::move ( value ) ) );
    }
 
    std::pair < iterator, bool > insert ( T && key, const R & value ) {
        return insert ( std::make_pair ( std::move ( key ), value ) );
    }
 
    std::pair < iterator, bool > insert ( T && key, R && value ) {
        return insert ( std::make_pair ( std::move ( key ), std::move ( value ) ) );
    }
 
    using std::map< T, R, Cmp, Alloc >::at;
 
    R & at ( const T & key, R & defaultValue ) {
        auto value = this->find ( key );
        if ( value == end ( ) )
            return defaultValue;
        else
            return value->second;
    }
 
    const R & at ( const T & key, const R & defaultValue ) const {
        auto value = this->find ( key );
        if ( value == end ( ) )
            return defaultValue;
        else
            return value->second;
    }
 
    auto begin ( ) & {
        return std::map < T, R, Cmp, Alloc >::begin ( );
    }
 
    auto begin ( ) const & {
        return std::map < T, R, Cmp, Alloc >::begin ( );
    }
 
    auto begin ( ) && {
        return make_map_move_iterator < T, R > ( this->begin ( ) );
    }
 
    auto end ( ) & {
        return std::map < T, R, Cmp, Alloc >::end ( );
    }
 
    auto end ( ) const & {
        return std::map < T, R, Cmp, Alloc >::end ( );
    }
 
    auto end ( ) && {
        return make_map_move_iterator < T, R > ( 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 K >
    auto equal_range ( K && key ) const & {
        auto res = std::map < T, R, Cmp, Alloc >::equal_range ( std::forward < K > ( key ) );
        return ext::iterator_range < decltype ( res.first ) > ( res.first, res.second );
    }
 
    template < class K >
    auto equal_range ( K && key ) & {
        auto res = std::map < T, R, Cmp, Alloc >::equal_range ( std::forward < K > ( key ) );
        return ext::iterator_range < decltype ( res.first ) > ( res.first, res.second );
    }
 
    template < class K >
    auto equal_range ( K && key ) && {
        auto res = std::map < T, R, Cmp, Alloc >::equal_range ( std::forward < K > ( key ) );
        return ext::make_iterator_range ( make_map_move_iterator < T, R > ( res.first ), make_map_move_iterator < T, R > ( res.second ) );
    }
 
    using std::map < T, R, Cmp, Alloc >::erase;
 
    template < class K >
    size_t erase ( const K & key ) {
        auto iter = this->find ( key );
        erase ( iter );
        return 1;
    }
 
    using std::map < T, R, Cmp, Alloc >::operator [];
 
    template < class K >
    R & operator [ ] ( K && key ) {
        auto iter = this->find ( key );
        if ( iter == end ( ) ) {
            return this->operator [ ] ( T ( std::forward < K > ( key ) ) );
        } else {
            return iter->second;
        }
    }
};
 
template< class T, class R, class ... Ts >
ext::ostream& operator<<(ext::ostream& out, const ext::map<T, R, Ts ... >& map) {
    out << "{";
 
    bool first = true;
    for(const std::pair<const T, R>& item : map) {
        if(!first) out << ", ";
        first = false;
        out << "(" << item.first << ", " << item.second << ")";
    }
 
    out << "}";
    return out;
}
 
} /* namespace ext */