benwtrent commented on issue #11419:
URL: https://github.com/apache/lucene/issues/11419#issuecomment-1413927792
Doing some minor digging into this. From what I can tell there are two
things that use the heap logic:
- candidate tracking (max_heap)
- Nearest neighbor tracking (min_heap)
A radixheap COULD work for the nearest neighbor tracking as it is monotonic.
But some initial testing shows that our candidate tracking isn't monotonic. We
will pop candidates and add candidates and their changes will not be monotonic.
Once we start removing items from the `min_heap`, it is only for smaller items,
or when we are removing to get the top_k.
--
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: issues-unsubscr...@lucene.apache.org
For queries about this service, please contact Infrastructure at:
us...@infra.apache.org
---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscr...@lucene.apache.org
For additional commands, e-mail: issues-h...@lucene.apache.org
