dl_unordered_map2.h

浏览该文件的文档.

#pragma once
 
#include <unordered_map>
 
#include "dl_type.h"
 
namespace dl
{
template <typename K, typename V>
class UnorderedMap2
{
public:
    using K2 = const std::array<K, 2>&;
    V* Get(K2 xy)
    {
        auto iter = _data.find(xy[1]);
        if (iter == _data.end())
            return nullptr;
 
        auto iter1 = iter->second.find(xy[0]);
        if (iter1 == iter->second.end())
            return nullptr;
 
        return &iter1->second;
    }

    V& Add(K2 xy)
    {
        return _data[xy[1]][xy[0]];
    }

    bool Add(K2 xy, const V& v)
    {
        auto& iter = _data[xy[1]];
        auto iter1 = iter.insert({ xy[0], v });
        return iter1.second;
    }

    bool Delete(K2 xy)
    {
        auto iter = _data.find(xy[1]);
        if (iter == _data.end())
            return false;
 
        auto& container = iter->second;
        auto iter1 = container.find(xy[0]);
        if (iter1 == container.end())
            return false;
 
        container.erase(iter1);
        if (container.empty())
            _data.erase(iter);
        return true;
    }

    auto& GetContainer() { return _data; }

    bool IsEmpty() const
    {
        return _data.empty();
    }

    size_t GetYSize()
    {
        return _data.size();
    }

    std::size_t GetXSize(const K& y)
    {
        auto iter = _data.find(y);
        if (iter == _data.end())
            return 0;
        return iter->second.size();
    }

    std::unordered_map<K, V>* GetContainerY(const K& y)
    {
        auto iter = _data.find(y);
        if (iter == _data.end())
            return nullptr;
        return &iter->second;
    }
private:
    std::unordered_map<K, std::unordered_map<K, V>> _data;
};
}