Struct CachedMatcher 

pub struct CachedMatcher<M: ComponentMatcher> { /* private fields */ }

A wrapper that caches match results for performance.

The cache uses component IDs to generate cache keys and stores match scores for quick lookup. This is particularly effective when the same component pairs are compared multiple times.

Example

use sbom_tools::matching::{CachedMatcher, FuzzyMatcher, FuzzyMatchConfig, CacheConfig};

let matcher = FuzzyMatcher::new(FuzzyMatchConfig::balanced());
let cached = CachedMatcher::new(matcher);
// Or with custom config:
let cached = CachedMatcher::with_config(matcher, CacheConfig::large());

Implementations

impl<M: ComponentMatcher> CachedMatcher<M>

pub fn new(inner: M) -> Self

Create a new cached matcher wrapping the given matcher.

pub fn with_config(inner: M, config: CacheConfig) -> Self

Create a cached matcher with custom configuration.

pub const fn inner(&self) -> &M

Get a reference to the inner matcher.

pub fn cache_stats(&self) -> CacheStats

Get cache statistics.

pub fn clear_cache(&self)

Clear the cache.

Trait Implementations

impl<M: ComponentMatcher> ComponentMatcher for CachedMatcher<M>

fn match_score(&self, a: &Component, b: &Component) -> f64

Compute a match score between two components.

fn match_detailed(&self, a: &Component, b: &Component) -> MatchResult

Compute a detailed match result between two components.

fn explain_match(&self, a: &Component, b: &Component) -> MatchExplanation

Generate a human-readable explanation of why two components matched or didn’t.

fn name(&self) -> &'static str

Get the name of this matcher for logging/debugging.

fn threshold(&self) -> f64

Get the minimum threshold this matcher uses for fuzzy matching.

fn find_best_match<'a>( &self, target: &Component, candidates: &'a [&Component], threshold: f64, ) -> Option<(&'a Component, f64)>

Find the best matching component from a list of candidates.