Struct Candidate 

pub struct Candidate { /* private fields */ }

A candidate file that might match a query.

Created by index planning or filesystem walk, then processed through the candidate pipeline for depth, filesize, and metadata constraints. The normalized string path is computed lazily on first access.

Fields are accessible via accessor methods to guarantee that the lazy rel_str cache remains consistent with rel_path.

Implementations

impl Candidate

pub const fn new(rel_path: PathBuf, abs_path: PathBuf) -> Self

pub fn rel_path(&self) -> &Path

pub fn abs_path(&self) -> &Path

pub fn rel_str(&self) -> &str

Normalized relative path string (forward slashes), computed lazily.

pub fn display_path( &self, display: PathDisplay, path_separator: Option<u8>, ) -> String

pub fn within_depth(&self, max_depth: Option<usize>) -> bool

Check depth constraint against a filter’s max depth.

pub fn within_filesize(&self, max_filesize: Option<u64>) -> bool

Check filesize constraint against a filter’s max filesize.

pub fn matches(&self, filter: &CandidateFilter) -> bool

Check all configured filter rules: depth, filesize, and path-based rules.

Trait Implementations

impl Clone for Candidate

fn clone(&self) -> Candidate

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Candidate

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

Formats the value using the given formatter.

impl PartialEq for Candidate

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 Candidate