Struct CallGraphCacheKey 

pub struct CallGraphCacheKey { /* private fields */ }

Cache key for call graph analysis combining path, parameters, and file mtimes.

Implementations

impl CallGraphCacheKey

pub fn from_entries( root: &Path, entries: &[WalkEntry], git_ref: Option<&str>, follow_depth: u32, match_mode: &SymbolMatchMode, impl_only: bool, ast_recursion_limit: Option<usize>, ) -> Self

Build a CallGraphCacheKey from walk entries and analysis parameters. Files are sorted by path for deterministic hashing. Directories are filtered out; only file entries contribute to the key.

Trait Implementations

impl Clone for CallGraphCacheKey

fn clone(&self) -> CallGraphCacheKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CallGraphCacheKey

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

Formats the value using the given formatter.

impl Eq for CallGraphCacheKey

impl Hash for CallGraphCacheKey

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 CallGraphCacheKey

fn eq(&self, other: &CallGraphCacheKey) -> 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 StructuralPartialEq for CallGraphCacheKey