You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@lucene.apache.org by ho...@apache.org on 2026/10/20 19:02:04 UTC
(lucene) branch main updated: Move changelog entry from 11.0.0 to 10.6.0 (#16739)
This is an automated email from the ASF dual-hosted git repository.
HoustonPutman pushed a commit to branch main
in repository https://gitbox.apache.org/repos/asf/lucene.git
The following commit(s) were added to refs/heads/main by this push:
new 26b775887c8 Move changelog entry from 11.0.0 to 10.6.0 (#16739)
26b775887c8 is described below
commit 26b775887c82daa0f37d7d241a7e6dc9d8c9186b
Author: Houston Putman <ho...@apache.org>
AuthorDate: Tue Oct 20 12:01:46 2026 -0700
Move changelog entry from 11.0.0 to 10.6.0 (#16739)
---
lucene/CHANGES.txt | 10 +++++-----
1 file changed, 5 insertions(+), 5 deletions(-)
diff --git a/lucene/CHANGES.txt b/lucene/CHANGES.txt
index 3e84d045980..610c4534ffa 100644
--- a/lucene/CHANGES.txt
+++ b/lucene/CHANGES.txt
@@ -261,11 +261,6 @@ Optimizations
Bug Fixes
---------------------
-* GITHUB#16739: IncrementalHnswGraphMerger now picks the base graph for a merge by comparing live
- vector counts. It previously compared a candidate's live count against the current base's total
- node count, so a graph with deletions could be kept as the base over a larger deletion-free graph,
- depending on the order in which readers were added. (Lantao Jin)
-
* GITHUB#16657: Fix hashCode/equals contract violation in LRUQueryCache's QueryCacheKey and account a
cached query's RAM once per distinct query. (Sagar Upadhyaya)
@@ -775,6 +770,11 @@ Bug Fixes
e.g. a dense cached filter on a segment with deletions, which made DenseConjunctionBulkScorer
rescan the run for every 4096-doc window since 10.5.0 (Costin Leau)
+* GITHUB#16739: IncrementalHnswGraphMerger now picks the base graph for a merge by comparing live
+ vector counts. It previously compared a candidate's live count against the current base's total
+ node count, so a graph with deletions could be kept as the base over a larger deletion-free graph,
+ depending on the order in which readers were added. (Lantao Jin)
+
Build
---------------------