Struct PromotionPolicy 

pub struct PromotionPolicy {
    pub min_importance: f64,
    pub min_access_count: u64,
}

Policy deciding which short-term entries consolidate into long-term memory.

An entry qualifies when either condition holds: importance is at least min_importance, or it has been accessed at least min_access_count times.

Fields

min_importance: f64

Importance floor for immediate promotion.

min_access_count: u64

Re-access threshold for promotion of merely-useful memories.

Implementations

impl PromotionPolicy

pub fn new() -> Self

Creates the default policy (importance ≥ 0.8 or ≥ 3 accesses).

pub fn with_min_importance(self, min_importance: f64) -> Self

Sets the importance floor.

pub fn with_min_access_count(self, min_access_count: u64) -> Self

Sets the re-access threshold.

pub fn qualifies(&self, stored: &StoredMemory) -> bool

Pure predicate over a stored entry.

Trait Implementations

impl Clone for PromotionPolicy

fn clone(&self) -> PromotionPolicy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for PromotionPolicy

impl Debug for PromotionPolicy

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

Formats the value using the given formatter.

impl Default for PromotionPolicy

fn default() -> Self

Returns the “default value” for a type.

impl PartialEq for PromotionPolicy

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for PromotionPolicy