Assemble a C++ ``_MultiQuery`` from per-route ``_SearchQuery`` objects.
(
self, ctx: QueryContext, queries: list[_SearchQuery]
)
| 168 | return [Doc._from_tuple(t) if t is not None else None for t in tuples] |
| 169 | |
| 170 | def _build_multi_query( |
| 171 | self, ctx: QueryContext, queries: list[_SearchQuery] |
| 172 | ) -> _MultiQuery: |
| 173 | """Assemble a C++ ``_MultiQuery`` from per-route ``_SearchQuery`` objects.""" |
| 174 | multi_query = _MultiQuery() |
| 175 | multi_query.queries = [_SubQuery.from_search_query(query) for query in queries] |
| 176 | # num_candidates controls per-sub-query candidate count for reranking pool. |
| 177 | # It must NOT be limited to the final output topk; use at least the C++ |
| 178 | # SubQuery default of 10 to ensure sufficient candidates for reranking. |
| 179 | _DEFAULT_NUM_CANDIDATES = 10 |
| 180 | for sub in multi_query.queries: |
| 181 | sub.num_candidates = max(ctx.topk, _DEFAULT_NUM_CANDIDATES) |
| 182 | multi_query.topk = ctx.topk |
| 183 | if ctx.filter: |
| 184 | multi_query.filter = ctx.filter |
| 185 | multi_query.include_vector = ctx.include_vector |
| 186 | if ctx.output_fields is not None: |
| 187 | multi_query.output_fields = ctx.output_fields |
| 188 | # Set rerank strategy via the C++ variant-based API. |
| 189 | reranker = ctx.reranker |
| 190 | if isinstance(reranker, RrfReRanker): |
| 191 | multi_query.set_rerank_rrf(reranker.rank_constant) |
| 192 | elif isinstance(reranker, WeightedReRanker): |
| 193 | multi_query.set_rerank_weighted(reranker.weights) |
| 194 | elif isinstance(reranker, CallbackReRanker): |
| 195 | multi_query.set_rerank_callback(reranker._callback) |
| 196 | return multi_query |
| 197 | |
| 198 | def _execute_python_pipeline( |
| 199 | self, vectors: list[_SearchQuery], collection: _Collection |
no outgoing calls
no test coverage detected