xenia/kakoune
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

compare against 0 instead of -1 in hash map code

Browse Source
This commit is contained in:
Maxime Coste 2024-02-28 12:34:51 +11:00
parent e52f83bd50
commit 57b794ede3
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
src/hash_map.hh
View File

@ -74,7 +74,7 @@ struct HashIndex
auto target_slot = compute_slot(entry.hash); auto target_slot = compute_slot(entry.hash);
for (auto slot = target_slot; slot < m_entries.size(); ++slot) for (auto slot = target_slot; slot < m_entries.size(); ++slot)
{ {
if (m_entries[slot].index == -1) if (m_entries[slot].index < 0)
{ {
m_entries[slot] = entry; m_entries[slot] = entry;
return; return;
@ -104,7 +104,7 @@ struct HashIndex
// Recompact following entries // Recompact following entries
for (auto next = slot+1; next < m_entries.size(); ++next) for (auto next = slot+1; next < m_entries.size(); ++next)
{ {
if (m_entries[next].index == -1 or if (m_entries[next].index < 0 or
compute_slot(m_entries[next].hash) == next) compute_slot(m_entries[next].hash) == next)
break; break;
kak_assert(compute_slot(m_entries[next].hash) < next); kak_assert(compute_slot(m_entries[next].hash) < next);
@ -224,7 +224,7 @@ struct HashMap
for (auto slot = m_index.compute_slot(hash); slot < m_index.size(); ++slot) for (auto slot = m_index.compute_slot(hash); slot < m_index.size(); ++slot)
{ {
auto& entry = m_index[slot]; auto& entry = m_index[slot];
if (entry.index == -1) if (entry.index < 0)
return -1; return -1;
if (entry.hash == hash and item_key(m_items[entry.index]) == key) if (entry.hash == hash and item_key(m_items[entry.index]) == key)
return entry.index; return entry.index;