I know I've looked it up before, but for whatever reason I can't explain how open address hashmaps work; how does it know to check the next bucket on read after

I know I've looked it up before, but for whatever reason I can't explain how open address hashmaps work; how does it know to check the next bucket on read after a collision on insert? I know it's a dumb question, and that I've researched it before. Strange. (I recall Python first reporting the open address hashing hash randomization disclosure vuln that resulted in the PYTHONHASHSEED env var, and then dict becoming an odict OrderedHashMap by default.) /? The only fix for DOS attacks against hashtables is to fix the collision resolution method. https://www.google.com/search?q=The+only+fix+for+DOS+attacks+against+hashtables+is+to+fix+the+collision+resolution+method https://www.google.com/search?q=The+only+fix+for+DOS+attacks... "Defending Hash Tables from Subterfuge with Depth Charge" (2024) https://dl.acm.org/doi/fullHtml/10.1145/3631461.3631550 https://dl.acm.org/doi/fullHtml/10.1145/3631461.3631550 "Defending hash tables from algorithmic complexity attacks with resource burning" (2024) https://www.sciencedirect.com/science/article/abs/pii/S0304397524003797 https://www.sciencedirect.com/science/article/abs/pii/S03043... Hash collision: https://en.wikipedia.org/wiki/Hash_collision https://en.wikipedia.org/wiki/Hash_collision