map.h

Go to the documentation of this file.

 
#pragma once
 
 
#include <promeki/config.h>
#if PROMEKI_ENABLE_CORE
#include <map>
#include <initializer_list>
#include <promeki/namespace.h>
#include <promeki/sharedptr.h>
#include <promeki/list.h>
 
PROMEKI_NAMESPACE_BEGIN
 
template <typename K, typename V> class Map {
                PROMEKI_SHARED_FINAL(Map)
        public:
                using Ptr = SharedPtr<Map>;
 
                using Data = std::map<K, V>;
 
                using Iterator = typename Data::iterator;
 
                using ConstIterator = typename Data::const_iterator;
 
                using RevIterator = typename Data::reverse_iterator;
 
                using ConstRevIterator = typename Data::const_reverse_iterator;
 
                Map() = default;
 
                Map(const Map &other) : d(other.d) {}
 
                Map(Map &&other) noexcept : d(std::move(other.d)) {}
 
                Map(std::initializer_list<std::pair<const K, V>> initList) : d(initList) {}
 
                ~Map() = default;
 
                Map &operator=(const Map &other) {
                        d = other.d;
                        return *this;
                }
 
                Map &operator=(Map &&other) noexcept {
                        d = std::move(other.d);
                        return *this;
                }
 
                // -- Iterators --
 
                Iterator begin() noexcept { return d.begin(); }
 
                ConstIterator begin() const noexcept { return d.cbegin(); }
 
                ConstIterator cbegin() const noexcept { return d.cbegin(); }
 
                ConstIterator constBegin() const noexcept { return d.cbegin(); }
 
                Iterator end() noexcept { return d.end(); }
 
                ConstIterator end() const noexcept { return d.cend(); }
 
                ConstIterator cend() const noexcept { return d.cend(); }
 
                ConstIterator constEnd() const noexcept { return d.cend(); }
 
                RevIterator rbegin() noexcept { return d.rbegin(); }
 
                RevIterator revBegin() noexcept { return d.rbegin(); }
 
                ConstRevIterator crbegin() const noexcept { return d.crbegin(); }
 
                ConstRevIterator constRevBegin() const noexcept { return d.crbegin(); }
 
                RevIterator rend() noexcept { return d.rend(); }
 
                RevIterator revEnd() noexcept { return d.rend(); }
 
                ConstRevIterator crend() const noexcept { return d.crend(); }
 
                ConstRevIterator constRevEnd() const noexcept { return d.crend(); }
 
                // -- Capacity --
 
                bool isEmpty() const noexcept { return d.empty(); }
 
                size_t size() const noexcept { return d.size(); }
 
                // -- Lookup --
 
                V &operator[](const K &key) { return d[key]; }
 
                const V &operator[](const K &key) const { return d.at(key); }
 
                V value(const K &key, const V &defaultValue = V{}) const {
                        auto it = d.find(key);
                        if (it != d.end()) return it->second;
                        return defaultValue;
                }
 
                bool contains(const K &key) const { return d.find(key) != d.end(); }
 
                Iterator find(const K &key) { return d.find(key); }
 
                ConstIterator find(const K &key) const { return d.find(key); }
 
                // -- Modifiers --
 
                void insert(const K &key, const V &val) {
                        d.insert_or_assign(key, val);
                        return;
                }
 
                void insert(const K &key, V &&val) {
                        d.insert_or_assign(key, std::move(val));
                        return;
                }
 
                bool insertNew(const K &key, const V &val) { return d.emplace(key, val).second; }
 
                template <typename... ArgsT> std::pair<Iterator, bool> tryEmplace(const K &key, ArgsT &&...args) {
                        return d.try_emplace(key, std::forward<ArgsT>(args)...);
                }
 
                bool remove(const K &key) { return d.erase(key) > 0; }
 
                Iterator remove(Iterator pos) { return d.erase(pos); }
 
                void clear() noexcept {
                        d.clear();
                        return;
                }
 
                void swap(Map &other) noexcept {
                        d.swap(other.d);
                        return;
                }
 
                // -- Convenience --
 
                List<K> keys() const {
                        List<K> ret;
                        ret.reserve(d.size());
                        for (const auto &[k, v] : d) ret.pushToBack(k);
                        return ret;
                }
 
                List<V> values() const {
                        List<V> ret;
                        ret.reserve(d.size());
                        for (const auto &[k, v] : d) ret.pushToBack(v);
                        return ret;
                }
 
                template <typename Func> void forEach(Func &&func) const {
                        for (const auto &[k, v] : d) func(k, v);
                        return;
                }
 
                // -- Comparison --
 
                friend bool operator==(const Map &lhs, const Map &rhs) { return lhs.d == rhs.d; }
 
                friend bool operator!=(const Map &lhs, const Map &rhs) { return lhs.d != rhs.d; }
 
        private:
                Data d;
};
 
PROMEKI_NAMESPACE_END
 
#endif // PROMEKI_ENABLE_CORE