mikemccand commented on PR #15779: URL: https://github.com/apache/lucene/pull/15779#issuecomment-3991819476
Oooh I see, I think that should work? You discard the old hash map (`ids[]`) immediately (replace with 2X larger one), so surge is just 2X not 3X the prior array. You should also be able to iterate via the `byte[]` blocks? They are just concatenated `byte[]` with prefix 1 or 2 byte `vInt`. Then the access would be entirely sequential --> CPU, caches, RAM happier? Maybe even single pass is OK even mixed with random-writes into new hash? But, I still think a zero-hash impl should work too! (Using the opto that stuffs some of the hash bits into `ids` I linked above). -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected] --------------------------------------------------------------------- To unsubscribe, e-mail: [email protected] For additional commands, e-mail: [email protected]
