Struct RerankInput 

#[non_exhaustive]
pub struct RerankInput {
    pub queries: Option<Vec<RerankQuery>>,
    pub sources: Option<Vec<RerankSource>>,
    pub reranking_configuration: Option<RerankingConfiguration>,
    pub next_token: Option<String>,
}

Fields (Non-exhaustive)

Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.

queries: Option<Vec<RerankQuery>>

An array of objects, each of which contains information about a query to submit to the reranker model.

sources: Option<Vec<RerankSource>>

An array of objects, each of which contains information about the sources to rerank.

reranking_configuration: Option<RerankingConfiguration>

Contains configurations for reranking.

next_token: Option<String>

If the total number of results was greater than could fit in a response, a token is returned in the nextToken field. You can enter that token in this field to return the next batch of results.

Implementations

impl RerankInput

pub fn queries(&self) -> &[RerankQuery]

An array of objects, each of which contains information about a query to submit to the reranker model.

If no value was sent for this field, a default will be set. If you want to determine if no value was sent, use .queries.is_none().

pub fn sources(&self) -> &[RerankSource]

An array of objects, each of which contains information about the sources to rerank.

If no value was sent for this field, a default will be set. If you want to determine if no value was sent, use .sources.is_none().

pub fn reranking_configuration(&self) -> Option<&RerankingConfiguration>

Contains configurations for reranking.

pub fn next_token(&self) -> Option<&str>

If the total number of results was greater than could fit in a response, a token is returned in the nextToken field. You can enter that token in this field to return the next batch of results.

impl RerankInput

pub fn builder() -> RerankInputBuilder

Creates a new builder-style object to manufacture RerankInput.

Trait Implementations

impl Clone for RerankInput

fn clone(&self) -> RerankInput

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RerankInput

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

Formats the value using the given formatter.

impl PartialEq for RerankInput

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for RerankInput