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

[ox/std] Make HashMap::expand move new Pair Vector instead of copy

Browse Source
This commit is contained in:
Gary Talent 2022-01-27 01:47:35 -06:00
parent 81f2865fcc
commit ff76d2f453
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -213,17 +213,17 @@ 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() {
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];
access(r, k) = access(m_pairs, k); access(r, k) = access(m_pairs, k);
} }
m_pairs = r; m_pairs = std::move(r);
} }
template<typename K, typename T> template<typename K, typename T>
uint64_t HashMap<K, T>::hash(K k, int len) noexcept { uint64_t HashMap<K, T>::hash(K k, int len) noexcept {
uint64_t sum = 1; uint64_t sum = 1;
for (int i = 0; i < len && k[i]; i++) { for (int i = 0; i < len && k[i]; ++i) {
sum += ((sum + k[i]) * 7) * sum; sum += ((sum + k[i]) * 7) * sum;
} }
return sum; return sum;