Struct Entry 

pub struct Entry<K, V>
where
    K: Eq + Hash,
{ /* private fields */ }

A container representing a single cached item.

Entry holds the mapping between a Key and its associated value, along with optional TTL (Time To Live) metadata to handle expiration.

Generic Constraints

• K: The raw key type, which must implement Eq and Hash.
• V: The type of the value being stored.

Implementations

impl<K, V> Entry<K, V>

where K: Eq + Hash,

pub fn new(key: K, value: V, expired_at: Option<Instant>) -> Self

Creates a new cache entry with a specified expiration.

Parameters

• key: The raw key to be wrapped in a Key.
• value: The data to store.
• expired_at: An Instant in the future when the entry expires, or None for no limit.

pub fn key(&self) -> &Key<K>

Returns a reference to the entry’s Key.

pub fn value(&self) -> &V

Returns a reference to the stored value.

pub fn is_expired(&self) -> bool

Checks if the entry has passed its expiration deadline.

Returns true if expired_at is a time in the past relative to Instant::now. If no expiration was set, this always returns false.

Examples

use std::time::{Duration, Instant};
use omega_cache::core::entry::Entry;
// Entry that expired 1 second ago
let past = Instant::now() - Duration::from_secs(1);
let entry = Entry::new("key", "value", Some(past));
assert!(entry.is_expired());

Trait Implementations

impl<K, V: Debug> Debug for Entry<K, V>

where K: Eq + Hash + Debug,

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

Formats the value using the given formatter.