From c819ce193ba7c4b9c2b8b9dcdbe90869189d9021 Mon Sep 17 00:00:00 2001 From: "google-labs-jules[bot]" <161369871+google-labs-jules[bot]@users.noreply.github.com> Date: Sat, 13 Jun 2026 12:35:41 +0000 Subject: [PATCH] =?UTF-8?q?=E2=9A=A1=20Bolt:=20Optimize=20reranking=20batc?= =?UTF-8?q?h=5Frank=20loop?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit - Extracted mapped_scores index lookup to a precomputed rank_map dictionary. - Reduced time complexity from O(N^2) to O(N) when generating RerankingResult objects. Co-authored-by: bashandbone <89049923+bashandbone@users.noreply.github.com> --- src/codeweaver/providers/reranking/providers/base.py | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) diff --git a/src/codeweaver/providers/reranking/providers/base.py b/src/codeweaver/providers/reranking/providers/base.py index 28e7a93b2..c20d13633 100644 --- a/src/codeweaver/providers/reranking/providers/base.py +++ b/src/codeweaver/providers/reranking/providers/base.py @@ -91,10 +91,12 @@ def default_reranking_output_transformer( mapped_scores = sorted( ((i, score) for i, score in enumerate(results)), key=lambda x: x[1], reverse=True ) + # ⚡ Bolt: Pre-computed hash map for O(1) rank lookups, reducing algorithm from O(N^2) to O(N) + rank_map = {idx: j + 1 for j, (idx, _) in enumerate(mapped_scores)} processed_results.extend( RerankingResult( original_index=i, - batch_rank=next((j + 1 for j, (idx, _) in enumerate(mapped_scores) if idx == i), -1), + batch_rank=rank_map.get(i, -1), score=score, chunk=chunk, )