Enum ScriptedReranker 

pub enum ScriptedReranker {
    Fifo {
        results: Mutex<Vec<Result<Vec<RerankResult>, ProviderError>>>,
        calls: Mutex<Vec<(String, usize, usize)>>,
    },
    Match {
        resolver: Box<dyn Fn(&str, &[String], usize) -> Result<Vec<RerankResult>, ProviderError> + Send + Sync>,
        calls: Mutex<Vec<(String, usize, usize)>>,
    },
}

Scripted reranker, parity-shaped with ScriptedNliClassifier:

• ScriptedReranker::new (FIFO): each call pops the next scripted result set in order. When the script is exhausted the reranker returns Ok(vec![]) (the legitimate “provider found nothing” shape) so the fail-closed contract of the rerank stage is exercisable without an explicit error — mirroring a real provider that responded with zero results rather than a transport failure.
• ScriptedReranker::matching (Match): each call dispatches to the supplied closure. Use when survivor ordering is not deterministic (HashMap order) and the test keys scores on the document text, or to honour the top_k argument for truncation assertions.

Both modes record every (query, document_count, top_k) triple so tests can assert on the exact calls the use case made.

Variants

Fifo

Fields

results: Mutex<Vec<Result<Vec<RerankResult>, ProviderError>>>

calls: Mutex<Vec<(String, usize, usize)>>

Match

Fields

resolver: Box<dyn Fn(&str, &[String], usize) -> Result<Vec<RerankResult>, ProviderError> + Send + Sync>

calls: Mutex<Vec<(String, usize, usize)>>

Implementations

impl ScriptedReranker

pub fn new(results: Vec<Result<Vec<RerankResult>, ProviderError>>) -> Self

pub fn matching<F>(resolver: F) -> Self

where F: Fn(&str, &[String], usize) -> Result<Vec<RerankResult>, ProviderError> + Send + Sync + 'static,

pub fn calls(&self) -> Vec<(String, usize, usize)>

Recorded (query, document_count, top_k) triples in invocation order.

Trait Implementations

impl RerankProvider for ScriptedReranker

async fn rerank( &self, query: &str, documents: &[String], top_k: usize, ) -> Result<Vec<RerankResult>, ProviderError>

Re-score documents against query and return the top-top_k hits ordered by descending relevance score. Each hit preserves the original document index so the caller can map back to its source fact.