Skip to main content

SemanticCacheLayer

Struct SemanticCacheLayer 

Source
pub struct SemanticCacheLayer {
    pub config: CacheConfig,
    pub entries: Vec<CacheEntry>,
    pub next_id: usize,
    pub total_hits: u64,
    pub total_misses: u64,
    pub total_insertions: u64,
}
Expand description

A vector-similarity-based cache.

See the module-level documentation for a usage example.

Fields§

§config: CacheConfig

Runtime configuration.

§entries: Vec<CacheEntry>

The stored entries.

§next_id: usize

Monotonically increasing counter used to assign stable entry IDs.

§total_hits: u64

Total cache hits since creation.

§total_misses: u64

Total cache misses since creation.

§total_insertions: u64

Total entries ever inserted.

Implementations§

Source§

impl SemanticCacheLayer

Source

pub fn new(config: CacheConfig) -> Self

Create a new cache with the given configuration.

Source

pub fn cosine_similarity(a: &[f64], b: &[f64]) -> f64

Compute the cosine similarity between two f64 slices.

Returns 0.0 if the vectors have different lengths, if either vector is all-zeros, or if the denominator underflows to zero.

Source

pub fn lookup(&mut self, query_embedding: &[f64], now: u64) -> CacheLookupResult

Look up the cache for a semantically similar previous query.

Scans all non-expired entries and finds the one with the highest cosine similarity to query_embedding. If that similarity is ≥ config.similarity_threshold the entry’s hit_count and last_accessed fields are updated and a CacheLookupResult::Hit is returned; otherwise CacheLookupResult::Miss is returned.

The global total_hits / total_misses counters are always updated.

§Arguments
  • query_embedding — embedding vector for the incoming query.
  • now — current timestamp in milliseconds (caller-supplied for testability).
Source

pub fn insert(&mut self, key: CacheKey, result: String, now: u64)

Insert a new entry into the cache.

If the cache has reached config.max_entries, one entry is evicted first according to config.eviction_policy. The config.ttl_ms value is applied to the new entry’s ttl_ms field.

§Arguments
  • key — the query key (text + embedding).
  • result — the result to cache.
  • now — current timestamp in milliseconds.
Source

pub fn evict_one(&mut self, now: u64)

Evict a single entry according to the configured CacheEvictionPolicy.

  • LRU — remove the entry with the smallest last_accessed timestamp.
  • LFU — remove the entry with the smallest hit_count.
  • TTLFirst — among entries that have a ttl_ms, remove the one that will expire soonest (inserted_at + ttl_ms is smallest); if no entry has a TTL, fall back to LRU.

Does nothing if the cache is empty.

Source

pub fn evict_expired(&mut self, now: u64) -> usize

Remove all expired entries from the cache.

Returns the number of entries that were removed.

Source

pub fn invalidate_by_text(&mut self, text: &str) -> usize

Remove all entries whose key.query_text exactly matches text.

Returns the number of entries removed.

Source

pub fn clear(&mut self)

Remove all entries from the cache (statistics are preserved).

Source

pub fn entry_count(&self) -> usize

Return the current number of entries in the cache.

Source

pub fn stats(&self) -> ScCacheStats

Return aggregate statistics for this cache instance.

Trait Implementations§

Source§

impl Debug for SemanticCacheLayer

Source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Allocation for T
where T: RefUnwindSafe + Send + Sync,

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<'a, T, E> AsTaggedExplicit<'a, E> for T
where T: 'a,

Source§

fn explicit(self, class: Class, tag: u32) -> TaggedParser<'a, Explicit, Self, E>

Source§

impl<'a, T, E> AsTaggedImplicit<'a, E> for T
where T: 'a,

Source§

fn implicit( self, class: Class, constructed: bool, tag: u32, ) -> TaggedParser<'a, Implicit, Self, E>

Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<T> WithSubscriber for T

Source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more