Struct RerankUsage 

#[non_exhaustive]
pub struct RerankUsage {
    pub total_tokens: Option<u64>,
    pub search_units: Option<u64>,
    pub cost: Option<f64>,
    pub extra: Extra,
}

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.

total_tokens: Option<u64>

search_units: Option<u64>

cost: Option<f64>

extra: Extra

Implementations

impl RerankUsage

pub fn builder() -> WireRerankUsageBuilder

Trait Implementations

impl Clone for RerankUsage

fn clone(&self) -> RerankUsage

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RerankUsage

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for RerankUsage

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for RerankUsage

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for RerankUsage

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for RerankUsage