drinkingtea/nostalgia
drinkingtea/nostalgia
2
0
Fork 0
Code Issues 5 Pull Requests Actions Releases 7 Activity

[ox/std] Add const accessor to HashMap

Browse Source
This commit is contained in:
Gary Talent 2021-04-01 01:42:38 -05:00
parent d952b68053
commit b486a4962e
1 changed files with 27 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

35
deps/ox/src/ox/std/hashmap.hpp vendored
View File

@ -24,8 +24,8 @@ class HashMap {
K key = {}; K key = {};
T value = {}; T value = {};
}; };
Vector<K> m_keys; mutable Vector<K> m_keys;
Vector<Pair*> m_pairs; mutable Vector<Pair*> m_pairs;
public: public:
explicit HashMap(std::size_t size = 100); explicit HashMap(std::size_t size = 100);
@ -38,6 +38,11 @@ class HashMap {
HashMap &operator=(HashMap &other); HashMap &operator=(HashMap &other);
/**
* K is assumed to be a null terminated string.
*/
const T &operator[](K key) const;
/** /**
* K is assumed to be a null terminated string. * K is assumed to be a null terminated string.
*/ */
@ -48,14 +53,14 @@ class HashMap {
*/ */
T &at(K key); T &at(K key);
bool contains(K key); bool contains(K key) const;
std::size_t size() const noexcept; std::size_t size() const noexcept;
const Vector<K> &keys() const noexcept; const Vector<K> &keys() const noexcept;
private: private:
void expand(); void expand() const;
/** /**
* K is assumed to be a null terminated string. * K is assumed to be a null terminated string.
@ -65,7 +70,7 @@ class HashMap {
/** /**
* K is assumed to be a null terminated string. * K is assumed to be a null terminated string.
*/ */
Pair *&access(Vector<Pair*> &pairs, K key); Pair *&access(Vector<Pair*> &pairs, K key) const;
}; };
@ -107,6 +112,20 @@ HashMap<K, T> &HashMap<K, T>::operator=(HashMap<K, T> &other) {
return *this; return *this;
} }
template<typename K, typename T>
const T &HashMap<K, T>::operator[](K k) const {
auto &p = access(m_pairs, k);
if (p == nullptr) {
if (m_pairs.size() * 0.7 < m_keys.size()) {
expand();
}
p = new Pair;
p->key = k;
m_keys.push_back(k);
}
return p->value;
}
template<typename K, typename T> template<typename K, typename T>
T &HashMap<K, T>::operator[](K k) { T &HashMap<K, T>::operator[](K k) {
auto &p = access(m_pairs, k); auto &p = access(m_pairs, k);
@ -127,7 +146,7 @@ T &HashMap<K, T>::at(K k) {
} }
template<typename K, typename T> template<typename K, typename T>
bool HashMap<K, T>::contains(K k) { bool HashMap<K, T>::contains(K k) const {
return access(m_pairs, k) != nullptr; return access(m_pairs, k) != nullptr;
} }
@ -142,7 +161,7 @@ const Vector<K> &HashMap<K, T>::keys() const noexcept {
} }
template<typename K, typename T> template<typename K, typename T>
void HashMap<K, T>::expand() { void HashMap<K, T>::expand() const {
Vector<Pair*> r; Vector<Pair*> r;
for (std::size_t i = 0; i < m_keys.size(); i++) { for (std::size_t i = 0; i < m_keys.size(); i++) {
auto k = m_keys[i]; auto k = m_keys[i];
@ -161,7 +180,7 @@ uint64_t HashMap<K, T>::hash(K k, int len) noexcept {
} }
template<typename K, typename T> template<typename K, typename T>
typename HashMap<K, T>::Pair *&HashMap<K, T>::access(Vector<Pair*> &pairs, K k) { typename HashMap<K, T>::Pair *&HashMap<K, T>::access(Vector<Pair*> &pairs, K k) const {
auto h = hash(k) % pairs.size(); auto h = hash(k) % pairs.size();
auto hashStr = reinterpret_cast<char*>(&h); auto hashStr = reinterpret_cast<char*>(&h);
while (1) { while (1) {