Enum TemporalGranularity 

pub enum TemporalGranularity {
    Day,
    Week,
    Month,
    Quarter,
    Year,
}

Temporal granularity of a memory: an orthogonal dimension to MemoryScope that describes the time horizon a memory is meant to be valid over.

This is additive and optional — memories written before this dimension existed (and any caller that does not set it) simply carry None, which preserves the pre-existing behavior exactly. The dimension is intentionally NOT used as a hard recall filter that flips the recalled subset every hour/day, because the recalled memories are spliced into the LLM prompt prefix and a churning subset would shred prompt prefix-cache hit rates. Instead it is a stable ranking / ordering signal: coarser-grained memories (year/quarter) are low-frequency and cache-friendly and sort earlier (toward the stable prefix); finer-grained memories (day/week) change more often and sort later (toward the volatile suffix). See issue #61.

Passive recall ordering must remain stable across calls, so it is never hard-filtered by granularity. This does not apply to an explicit filters.granularity query or purge request, where hard filtering is the caller’s stated intent.

Variants

Day

Finest granularity. Highest churn, fastest to go stale (debugging notes, today’s working context). Least prefix-cache friendly → ranks last.

Week

Sprint-level / weekly priorities and progress.

Month

Monthly decisions and phase summaries.

Quarter

Quarter-level direction, large refactor plans.

Year

Coarsest granularity. Lowest churn, longest-lived (long-term goals, system evolution). Most prefix-cache friendly → ranks first.

Implementations

impl TemporalGranularity

pub fn as_str(self) -> &'static str

pub fn parse(value: &str) -> Option<TemporalGranularity>

Parse a case-insensitive granularity token. Returns None for unknown values so callers can decide whether to error or fall back to the default.

pub fn cache_stability_rank(granularity: Option<TemporalGranularity>) -> u8

Cache-stability rank: lower number = coarser = more prefix-cache friendly and should be ordered earlier (toward the stable prompt prefix). Higher number = finer = higher churn and should be ordered later (toward the volatile suffix).

Memories with no granularity set are treated as the most stable (rank 0) so existing/unclassified memories keep their current placement and never get demoted below classified ones purely for lacking the new dimension.

pub fn is_high_churn(granularity: Option<TemporalGranularity>) -> bool

Whether this granularity is “high churn” per the issue’s Prefix Cache Friendly constraint: day/week memories change often enough that they must never land in a caller’s stable prefix segment. None and month/quarter/year are low-churn / prefix-eligible; week/day are high-churn / suffix-only. Derived from Self::cache_stability_rank so callers cannot disagree with the ordering tie-break about which side of the coarse/fine line a granularity falls on.

Trait Implementations

impl Clone for TemporalGranularity

fn clone(&self) -> TemporalGranularity

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for TemporalGranularity

impl Debug for TemporalGranularity

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for TemporalGranularity

fn deserialize<__D>( __deserializer: __D, ) -> Result<TemporalGranularity, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for TemporalGranularity

impl Hash for TemporalGranularity

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Ord for TemporalGranularity

fn cmp(&self, other: &TemporalGranularity) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

fn clamp_to<R>(self, range: R) -> Self

where Self: Sized, R: ClampBounds<Self>,

🔬This is a nightly-only experimental API. (clamp_to)

Restrict a value to a certain range.

impl PartialEq for TemporalGranularity

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

Equality operator ==.

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

Inequality operator !=.

impl PartialOrd for TemporalGranularity

fn partial_cmp(&self, other: &TemporalGranularity) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Serialize for TemporalGranularity

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for TemporalGranularity