72 lines
2.3 KiB
C++
72 lines
2.3 KiB
C++
#ifndef ARBUTILS_DICTIONARY_HPP
|
|
#define ARBUTILS_DICTIONARY_HPP
|
|
#include <cstdint>
|
|
#include <unordered_map>
|
|
#include "../Assert.hpp"
|
|
|
|
namespace ArbUt {
|
|
template <class KeyT, class ValueT> class Dictionary {
|
|
private:
|
|
std::unordered_map<KeyT, ValueT> _map;
|
|
|
|
using iterator = typename std::unordered_map<KeyT, ValueT>::iterator;
|
|
using const_iterator = typename std::unordered_map<KeyT, ValueT>::const_iterator;
|
|
|
|
public:
|
|
Dictionary() : _map() {}
|
|
explicit Dictionary(size_t capacity) : _map(capacity) {}
|
|
explicit Dictionary(const std::initializer_list<std::pair<const KeyT, ValueT>>& l) : _map(l) {}
|
|
|
|
inline void Clear() { _map.clear(); }
|
|
|
|
inline void Insert(const KeyT& key, const ValueT& value) {
|
|
[[maybe_unused]] const auto& v = _map.insert({key, value});
|
|
#ifndef NO_ASSERT
|
|
if (!v.second)
|
|
throw std::logic_error("Key already exists");
|
|
#endif
|
|
}
|
|
|
|
inline void Set(const KeyT& key, const ValueT& value) { _map[key] = value; }
|
|
|
|
[[nodiscard]] inline ValueT& Get(const KeyT& key) {
|
|
#ifndef NO_ASSERT
|
|
return _map.at(key);
|
|
#else
|
|
return _map[key];
|
|
#endif
|
|
}
|
|
|
|
[[nodiscard]] inline const ValueT& Get(const KeyT& key) const { return _map.at(key); }
|
|
|
|
inline bool TryGet(const KeyT& key, ValueT& out) const {
|
|
const auto& find = _map.find(key);
|
|
if (find == _map.end()) {
|
|
return false;
|
|
}
|
|
out = find->second;
|
|
return true;
|
|
}
|
|
|
|
inline void Remove(const KeyT& key) { _map.erase(key); }
|
|
|
|
[[nodiscard]] inline size_t Count() const { return _map.size(); }
|
|
|
|
inline bool Has(const KeyT& key) const noexcept { return _map.find(key) != _map.end(); }
|
|
|
|
inline ValueT& operator[](const KeyT& key) { return Get(key); }
|
|
inline const ValueT& operator[](const KeyT& key) const { return Get(key); }
|
|
|
|
iterator begin() { return _map.begin(); }
|
|
const_iterator begin() const { return _map.begin(); }
|
|
|
|
iterator end() { return _map.end(); }
|
|
const_iterator end() const { return _map.end(); }
|
|
|
|
const std::unordered_map<KeyT, ValueT>& GetStdMap() const { return _map; }
|
|
std::unordered_map<KeyT, ValueT>& GetStdMap() { return _map; }
|
|
};
|
|
}
|
|
|
|
#endif // ARBUTILS_DICTIONARY_HPP
|