Struct FilterCacheKey 

pub struct FilterCacheKey {
    pub file_guid: Arc<str>,
    pub gate_id: Arc<str>,
    pub parent_chain: Vec<Arc<str>>,
}

Cache key for filtered event indices

This key uniquely identifies a cached filter result based on:

• The file being filtered
• The gate being applied
• The parent gate chain (for hierarchical filtering)

Fields

file_guid: Arc<str>

File GUID

gate_id: Arc<str>

Gate ID

parent_chain: Vec<Arc<str>>

Parent gate chain (for hierarchical filtering) Stored as a sorted, deduplicated list for consistent hashing

Implementations

impl FilterCacheKey

pub fn new( file_guid: impl Into<Arc<str>>, gate_id: impl Into<Arc<str>>, parent_chain: Vec<impl Into<Arc<str>>>, ) -> Self

Create a new cache key

pub fn simple( file_guid: impl Into<Arc<str>>, gate_id: impl Into<Arc<str>>, ) -> Self

Create a simple key without parent chain

Trait Implementations

impl Clone for FilterCacheKey

fn clone(&self) -> FilterCacheKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for FilterCacheKey

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

Formats the value using the given formatter.

impl Hash for FilterCacheKey

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

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 PartialEq for FilterCacheKey

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for FilterCacheKey