Struct Rerank 

pub struct Rerank;

Ordering documents by relevance to a query.

Trait Implementations

impl Clone for Rerank

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for Rerank

impl Debug for Rerank

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'id> Decoder<'id, Rerank> for RerankDecoder

type Event = RerankReply

The wire’s typed event, produced by this decoder’s classifier.

fn classify(&self, frame: WireFrame) -> WireEvent<Self::Event>

Decode and classify one frame. A JSON wire MUST delegate to a classifier in crate::providers::internal::wire, so the decode-then-validate policy is not re-derived per provider.

fn decode( &mut self, event: Self::Event, out: Out<'id, RerankOp>, ) -> Result<Flow, ProviderError>

Write one Known event into the reply. An error ends the reply with it.

fn eof(&mut self, out: Out<'id, Op>) -> Result<Flow, ProviderError>

The frames ran out without an end. A decoder that already saw the provider’s end, in a form the provider sends before its last frame, ends the reply here; otherwise the reply is truncated.

impl<'id> Decoder<'id, Rerank> for RerankDecoder

type Event = Result<RerankApiResponse, String>

The ordering, or the error envelope Voyage can answer a 200 with.

fn classify(&self, frame: WireFrame) -> WireEvent<Self::Event>

Decode and classify one frame. A JSON wire MUST delegate to a classifier in crate::providers::internal::wire, so the decode-then-validate policy is not re-derived per provider.

fn decode( &mut self, reply: Self::Event, out: Out<'id, RerankOp>, ) -> Result<Flow, ProviderError>

Write one Known event into the reply. An error ends the reply with it.

fn eof(&mut self, out: Out<'id, Op>) -> Result<Flow, ProviderError>

The frames ran out without an end. A decoder that already saw the provider’s end, in a form the provider sends before its last frame, ends the reply here; otherwise the reply is truncated.

impl Eq for Rerank

impl Operation for Rerank

type Request = RerankRequest

The normalized request this operation accepts.

type Event = !

One decoded step of a reply.

type End = RerankResponse

What the provider sends when it ends the reply. A fold needs one to produce a response, so a reply that stopped early has none.

type Response = RerankResponse

The normalized response the events and the end fold into.

type Fold = Traced<Rerank, Whole<Rerank>>

One reply’s state: it absorbs the events the consumer sees, then folds them with the end into the response.

type Emit = Free

Who builds the events: Free for events a decoder writes itself, Assembled for the completion events only the writer’s part handles build.

fn fold(request: &Self::Request, call: &mut Call<'_>) -> Self::Fold

The state for one reply to request, before its first frame. The call says who answers and in which mode; an operation that records telemetry opens its span here and hands it to Call::instrument.

fn prepare( request: Self::Request, wire: &Descriptor<'_>, ) -> Result<Self::Request, ProviderError>

Shape request for the wire wire describes, or reject a request no provider of this operation can answer. The driver calls it before the request is encoded, so a rejected request reaches no wire or transport. Passes every request through by default.

impl PartialEq for Rerank

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for Rerank