map.hpp

浏览该文件的文档.

#ifndef NEFORCE_CORE_CONTAINER_MAP_HPP__
#define NEFORCE_CORE_CONTAINER_MAP_HPP__

 
#include "NeForce/core/container/rb_tree.hpp"
NEFORCE_BEGIN_NAMESPACE__


template <typename Key, typename T, typename Compare = less<Key>,
          typename Alloc = allocator<rb_tree_node<pair<const Key, T>>>>
class map : public icollector<map<Key, T, Compare, Alloc>> {
    static_assert(is_allocator_v<Alloc>, "Alloc type is not a standard allocator type.");
    static_assert(is_same_v<rb_tree_node<pair<const Key, T>>, typename Alloc::value_type>, "allocator type mismatch.");
    static_assert(is_object_v<T>, "map only contains object types.");
 
public:
    using key_type = Key;                  
    using data_type = T;                   
    using mapped_type = T;                 
    using value_type = pair<const Key, T>; 
    using key_compare = Compare;           

    struct value_compare {
    private:
        Compare comp_; 
        friend class map;
 
    public:
        explicit value_compare(Compare comp) :
        comp_(comp) {}

        bool operator()(const value_type& lhs, const value_type& rhs) const noexcept {
            return comp_(lhs.first, rhs.first);
        }
    };
 
private:
    using base_type =
            rb_tree<Key, pair<const Key, T>, select1st<pair<const Key, T>>, Compare, Alloc>; 
 
public:
    using size_type = typename base_type::size_type;                           
    using difference_type = typename base_type::difference_type;               
    using pointer = typename base_type::pointer;                               
    using const_pointer = typename base_type::const_pointer;                   
    using reference = typename base_type::reference;                           
    using const_reference = typename base_type::const_reference;               
    using iterator = typename base_type::iterator;                             
    using const_iterator = typename base_type::const_iterator;                 
    using reverse_iterator = typename base_type::reverse_iterator;             
    using const_reverse_iterator = typename base_type::const_reverse_iterator; 
    using allocator_type = typename base_type::allocator_type;                 
 
private:
    base_type tree_; 
 
public:
    map() :
    tree_(Compare()) {}

    explicit map(const key_compare& comp) :
    tree_(comp) {}

    map(const map& other) :
    tree_(other.tree_) {}

    map& operator=(const map& other) {
        if (_NEFORCE addressof(other) == this) {
            return *this;
        }
        tree_ = other.tree_;
        return *this;
    }

    map(map&& other) noexcept(is_nothrow_move_constructible_v<base_type>) :
    tree_(_NEFORCE move(other.tree_)) {}

    map& operator=(map&& other) noexcept(is_nothrow_move_assignable_v<base_type>) {
        if (_NEFORCE addressof(other) == this) {
            return *this;
        }
        tree_ = _NEFORCE move(other.tree_);
        return *this;
    }

    template <typename Iterator>
    map(Iterator first, Iterator last) :
    tree_(Compare()) {
        tree_.insert_unique(first, last);
    }

    template <typename Iterator>
    map(Iterator first, Iterator last, const key_compare& comp) :
    tree_(comp) {
        tree_.insert_unique(first, last);
    }

    map(std::initializer_list<value_type> ilist) :
    map(ilist.begin(), ilist.end()) {}

    map(std::initializer_list<value_type> ilist, const key_compare& comp) :
    map(ilist.begin(), ilist.end(), comp) {}

    map& operator=(std::initializer_list<value_type> ilist) {
        clear();
        insert(ilist.begin(), ilist.end());
        return *this;
    }

    ~map() = default;

    NEFORCE_NODISCARD iterator begin() noexcept { return tree_.begin(); }

    NEFORCE_NODISCARD iterator end() noexcept { return tree_.end(); }

    NEFORCE_NODISCARD const_iterator begin() const noexcept { return tree_.cbegin(); }

    NEFORCE_NODISCARD const_iterator end() const noexcept { return tree_.cend(); }

    NEFORCE_NODISCARD const_iterator cbegin() const noexcept { return tree_.cbegin(); }

    NEFORCE_NODISCARD const_iterator cend() const noexcept { return tree_.cend(); }

    NEFORCE_NODISCARD reverse_iterator rbegin() noexcept { return tree_.rbegin(); }

    NEFORCE_NODISCARD reverse_iterator rend() noexcept { return tree_.rend(); }

    NEFORCE_NODISCARD const_reverse_iterator rbegin() const noexcept { return tree_.rbegin(); }

    NEFORCE_NODISCARD const_reverse_iterator rend() const noexcept { return tree_.rend(); }

    NEFORCE_NODISCARD const_reverse_iterator crbegin() const noexcept { return tree_.crbegin(); }

    NEFORCE_NODISCARD const_reverse_iterator crend() const noexcept { return tree_.crend(); }

    NEFORCE_NODISCARD size_type size() const noexcept { return tree_.size(); }

    NEFORCE_NODISCARD size_type max_size() const noexcept { return tree_.max_size(); }

    NEFORCE_NODISCARD bool empty() const noexcept { return tree_.empty(); }

    NEFORCE_NODISCARD key_compare key_comp() const noexcept { return tree_.key_compare(); }

    NEFORCE_NODISCARD value_compare value_comp() const noexcept { return value_compare(tree_.key_compare()); }

    template <typename... Args>
    pair<iterator, bool> emplace(Args&&... args) {
        return tree_.emplace_unique(_NEFORCE forward<Args>(args)...);
    }

    pair<iterator, bool> insert(const value_type& value) { return tree_.insert_unique(value); }

    pair<iterator, bool> insert(value_type&& value) { return tree_.emplace_unique(_NEFORCE move(value)); }

    template <typename... Args>
    iterator emplace_hint(iterator position, Args&&... args) {
        return tree_.emplace_unique_hint(position, _NEFORCE forward<Args>(args)...);
    }

    iterator insert(iterator position, const value_type& value) { return tree_.insert_unique(position, value); }

    iterator insert(iterator position, value_type&& value) {
        return tree_.insert_unique(position, _NEFORCE move(value));
    }

    template <typename Iterator>
    void insert(Iterator first, Iterator last) {
        tree_.insert_unique(first, last);
    }

    void erase(iterator position) noexcept(noexcept(tree_.erase(position))) { tree_.erase(position); }

    size_type erase(const key_type& key) noexcept(noexcept(tree_.erase(key))) { return tree_.erase(key); }

    void erase(iterator first, iterator last) noexcept(noexcept(tree_.erase(first, last))) { tree_.erase(first, last); }

    void clear() noexcept(noexcept(tree_.clear())) { tree_.clear(); }

    NEFORCE_NODISCARD iterator find(const key_type& key) { return tree_.find(key); }

    NEFORCE_NODISCARD const_iterator find(const key_type& key) const { return tree_.find(key); }

    NEFORCE_NODISCARD size_type count(const key_type& key) const { return tree_.count(key); }

    NEFORCE_NODISCARD iterator lower_bound(const key_type& key) { return tree_.lower_bound(key); }

    NEFORCE_NODISCARD const_iterator lower_bound(const key_type& key) const { return tree_.lower_bound(key); }

    NEFORCE_NODISCARD iterator upper_bound(const key_type& key) { return tree_.upper_bound(key); }

    NEFORCE_NODISCARD const_iterator upper_bound(const key_type& key) const { return tree_.upper_bound(key); }

    NEFORCE_NODISCARD pair<iterator, iterator> equal_range(const key_type& key) { return tree_.equal_range(key); }

    NEFORCE_NODISCARD pair<const_iterator, const_iterator> equal_range(const key_type& key) const {
        return tree_.equal_range(key);
    }

    NEFORCE_NODISCARD mapped_type& operator[](const key_type& key) {
        iterator iter = tree_.lower_bound(key);
        if (iter == end() || key_comp()(key, iter->first)) {
            iter = tree_.emplace_unique_hint(iter, key, initialize<T>());
        }
        return iter->second;
    }

    NEFORCE_NODISCARD mapped_type& operator[](key_type&& key) {
        iterator iter = tree_.lower_bound(key);
        if (iter == end() || key_comp()(key, iter->first)) {
            iter = tree_.emplace_unique_hint(iter, _NEFORCE move(key), initialize<T>());
        }
        return iter->second;
    }

    NEFORCE_NODISCARD const mapped_type& at(const key_type& key) const {
        const_iterator iter = tree_.lower_bound(key);
        if (iter == end() && key_comp()(iter->first, key)) {
            NEFORCE_THROW_EXCEPTION(value_exception("the value of this key does not exists."));
        }
        return iter->second;
    }

    NEFORCE_NODISCARD mapped_type& at(const key_type& key) {
        iterator iter = tree_.lower_bound(key);
        if (iter == end() && key_comp()(iter->first, key)) {
            NEFORCE_THROW_EXCEPTION(value_exception("the value of this key does not exists."));
        }
        return iter->second;
    }

    void swap(map& other) noexcept(noexcept(tree_.swap(other.tree_))) { tree_.swap(other.tree_); }

    NEFORCE_NODISCARD bool equal_to(const map& rhs) const noexcept(noexcept(tree_ == rhs.tree_)) {
        return tree_ == rhs.tree_;
    }

    NEFORCE_NODISCARD bool less_than(const map& rhs) const noexcept(noexcept(tree_ < rhs.tree_)) {
        return tree_ < rhs.tree_;
    }
};
 
#ifdef NEFORCE_STANDARD_17
template <typename Iterator, typename Compare,
          typename Alloc = allocator<pair<const iter_map_key_t<Iterator>, iter_map_value_t<Iterator>>>>
map(Iterator, Iterator, Compare = Compare(), Alloc = Alloc())
        -> map<iter_map_key_t<Iterator>, iter_map_value_t<Iterator>, Compare, Alloc>;
 
template <typename Key, typename T, typename Compare = less<Key>, typename Alloc = allocator<pair<const Key, T>>>
map(std::initializer_list<pair<Key, T>>, Compare = Compare(), Alloc = Alloc()) -> map<Key, T, Compare, Alloc>;
 
template <typename Iterator, typename Alloc>
map(Iterator, Iterator, Alloc)
        -> map<iter_map_key_t<Iterator>, iter_map_value_t<Iterator>, less<iter_map_key_t<Iterator>>, Alloc>;
 
template <typename Key, typename T, typename Alloc>
map(std::initializer_list<pair<Key, T>>, Alloc) -> map<Key, T, less<Key>, Alloc>;
#endif
 // Container
 
NEFORCE_END_NAMESPACE__
#endif // NEFORCE_CORE_CONTAINER_MAP_HPP__