smultimap.hpp

이 파일의 문서화 페이지로 가기

 
#pragma once
 
#include <unordered_map>
#include "core/common.hpp"
 
namespace by {
    template <typename K, typename V> class smultimap {
        BY(ME(smultimap))
 
    public:
        struct wrap;
        class iterator;
        typedef std::unordered_multimap<K, wrap> stlMap;
 
        struct wrap {
            wrap() = default;
            wrap(V&& newValue);
            wrap(const wrap& rhs);
            wrap(wrap&& rhs);
 
        public:
            wrap& operator=(const wrap&);
            wrap& operator=(wrap&&);
 
        public:
            void clear();
 
        public:
            const K* key = nullptr;
            V value;
            wrap* prev = this;
            wrap* next = this;
        };
 
        class iterator {
            BY(ME(iterator))
            typedef smultimap<K, V> owner;
 
        public:
            iterator(const smultimap* owner, const wrap* pair, nbool isReversed);
            iterator(const smultimap* owner, const wrap* pair, nbool isReversed, const K& key);
            iterator(const smultimap* owner, const wrap* pair, nbool isReversed, const K* key);
            friend owner;
 
        public:
            V& operator*();
            V* operator->();
 
            iterator& operator++();
            iterator operator++(int);
            iterator& operator--();
            iterator operator--(int);
            iterator operator+(ncnt step);
 
            bool isEnd() const;
 
            const K* getKey() const;
            const V* getVal() const BY_CONST_FUNC(getVal())
            V* getVal();
 
            bool operator!=(const iterator& rhs) const;
            bool operator==(const iterator& rhs) const;
 
        private:
            iterator& _step(ncnt step, nbool isReversed);
            static const K& _getDummyKey();
 
        private:
            const owner* _owner;
            const wrap* _wrap;
            nbool _isReversed;
            K _key;
        };
 
    public:
        smultimap() = default;
 
    public:
        ncnt size() const;
 
        iterator begin() const;
        iterator end() const;
        iterator begin(const K& key) const;
        iterator begin(const K* key) const BY_SIDE_FUNC(key, begin(*key), begin());
 
        iterator rbegin() const;
        iterator rend() const;
        iterator rbegin(const K& key) const;
        iterator rbegin(const K* key) const BY_SIDE_FUNC(key, rbegin(*key), rbegin());
 
        void insert(const K& key, V&& val);
 
        void erase(const K& key);
        void erase(const K* it) BY_SIDE_FUNC(erase);
        void erase(const iterator& it);
        void erase(const iterator* it) BY_SIDE_FUNC(erase);
        void erase(const iterator& from, const iterator& to);
        void erase(const iterator* from, const iterator& to) BY_SIDE_FUNC(from, erase(*from, to), void());
        void erase(const iterator& from, const iterator* to) BY_SIDE_FUNC(to, erase(from, *to), void());
        void erase(const iterator* from, const iterator* to) BY_SIDE_FUNC(from&& to, erase(*from, *to), void());
 
        iterator find(const K& key) const;
 
        void clear();
 
    private:
        typename stlMap::iterator _erase(const typename stlMap::iterator& e);
        void _erase(const iterator& e);
        void _link(wrap& newTail);
        void _unlink(wrap& toDelete);
        iterator _begin(const K& key, nbool isReversed) const;
 
    private:
        stlMap _map;
        wrap _end;
    };
} // namespace by