organicmaps/harfbuzz
13
Fork 0
mirror of https://github.com/harfbuzz/harfbuzz.git synced 2025-04-05 13:35:06 +00:00
Code Issues 1 Projects Releases Wiki Activity Actions 9

[map] Fix set()

Browse source 
This was broken in 2133aa2407.

We have to keep probing over tombstones.
This commit is contained in:
Behdad Esfahbod 2023-05-23 10:49:41 -06:00
parent 4056315c86
commit 12b0680e60
1 changed files with 4 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

7
src/hb-map.hh
View file

@ -207,6 +207,7 @@ struct hb_hashmap_t
if (unlikely ((occupancy + occupancy / 2) >= mask && !resize ())) return false;
hash &= 0x3FFFFFFF; // We only store lower 30bit of hash
unsigned int tombstone = (unsigned int) -1;
unsigned int i = hash % prime;
unsigned step = 0;
while (items[i].is_used ())
@ -214,12 +215,12 @@ struct hb_hashmap_t
if ((hb_is_same (K, hb_codepoint_t) || items[i].hash == hash) &&
items[i] == key)
break;
if (items[i].is_tombstone ())
break;
if (tombstone == (unsigned) -1 && items[i].is_tombstone ())
tombstone = i;
i = (i + ++step) & mask;
}
item_t &item = items[i];
item_t &item = items[tombstone == (unsigned) -1 ? i : tombstone];
if (item.is_used ())
{