Struct RangeMatcher 

pub struct RangeMatcher<T> { /* private fields */ }

Numeric range matcher for finding keys within a specified range.

This matcher is useful for numeric keys like IDs, scores, timestamps, or any other ordered numeric data.

Examples

use simple_cacher::*;
use std::time::Duration;

let mut cache = SimpleCacher::new(Duration::from_secs(300));
cache.insert(85, "Good score".to_string());
cache.insert(92, "Excellent score".to_string());
cache.insert(67, "Average score".to_string());
cache.insert(45, "Poor score".to_string());

let high_score_matcher = RangeMatcher::new(80, 100);
let high_scores = cache.get_all_by_matcher(&high_score_matcher);
assert_eq!(high_scores.len(), 2); // 85 and 92

Implementations

impl<T> RangeMatcher<T>

pub fn new(min: T, max: T) -> Self

Creates a new inclusive range matcher.

Arguments

• min - Minimum value (inclusive)
• max - Maximum value (inclusive)

pub fn exclusive(min: T, max: T) -> Self

Creates a new exclusive range matcher.

Arguments

• min - Minimum value (exclusive)
• max - Maximum value (exclusive)

Trait Implementations

impl<T> Matcher<T> for RangeMatcher<T>

where T: PartialOrd,

fn matches(&self, key: &T) -> bool

Returns true if the given key matches this matcher’s criteria.