rajat315315 opened a new issue, #16353: URL: https://github.com/apache/lucene/issues/16353
### Description Right now, if we need to convert N nodes of `leafBlockStartValues` to a BKD tree index, we need to do `O(NlogN)` steps which involves calculating the number of leftHalf again and again for each insertion. https://github.com/apache/lucene/blob/8fe701c0873de37b95fabd4a0feafa2e16f30097/lucene/codecs/src/java/org/apache/lucene/codecs/simpletext/SimpleTextBKDWriter.java#L553 This can be optimized into an `O(N)` function for which I am trying to raise a PR for reviewers to comment on.. -- 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]
