Struct Recall 

pub struct Recall {
    pub schema: &'static str,
    pub generation: i64,
    pub decay: Decay,
    pub reproducible: bool,
    pub results: Vec<Recalled>,
    pub live: u64,
    pub superseded: u64,
}

A ranked recall, with the state it was computed against.

Fields

schema: &'static str

Stable schema tag (RECALL_SCHEMA).

generation: i64

The generation this recall was computed at — the newest record’s id. Reported because every age is relative to it.

decay: Decay

The decay mode used.

reproducible: bool

Whether that mode guarantees reproducible recall (Decay::is_reproducible). Surfaced so a consumer that is depending on reproducibility does not have to infer it from the mode token.

results: Vec<Recalled>

The ranked records, best score first, ties broken by newest generation.

live: u64

Live records in the whole store, ignoring the options.

superseded: u64

Superseded records in the whole store. None of them is in results: supersession drops a record out of recall immediately and regardless of age, because the test is a recorded pointer and not a clock.

Trait Implementations

impl Clone for Recall

fn clone(&self) -> Recall

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Recall

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

Formats the value using the given formatter.

impl Deserialize<'static> for Recall

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

where __D: Deserializer<'static>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for Recall

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for Recall

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 Recall