pub struct DependencyCompletenessControl;Expand description
Verifies that ALL dependencies (direct AND transitive) meet L3 verification (Dependencies L4).
Requires:
- Every dependency (regardless of
is_direct) hasVerified+signer_identity+transparency_log_uri - At least one transitive dependency exists (otherwise the check is trivially satisfied and the control returns NotApplicable — a project with only direct deps should use L3)
This is the strictest dependency verification level. It ensures the entire dependency tree — not just direct dependencies — is fully provenance-verified.
Registry scoping: Only evaluates dependencies from registries that support the full trust chain (L3). Dependencies from non-L3 registries are excluded.
Trait Implementations§
Source§impl Control for DependencyCompletenessControl
impl Control for DependencyCompletenessControl
Source§fn description(&self) -> &'static str
fn description(&self) -> &'static str
Human-readable description for SARIF rule output.
Source§fn evaluate(&self, evidence: &EvidenceBundle) -> Vec<ControlFinding>
fn evaluate(&self, evidence: &EvidenceBundle) -> Vec<ControlFinding>
Evaluates the evidence bundle and returns one finding per subject.
Source§fn tsc_criteria(&self) -> &'static [&'static str]
fn tsc_criteria(&self) -> &'static [&'static str]
SOC2 Trust Services Criteria this control maps to (e.g., &[“CC6.1”, “CC8.1”]).
Returns empty slice for controls not mapped to SOC2.
Auto Trait Implementations§
impl Freeze for DependencyCompletenessControl
impl RefUnwindSafe for DependencyCompletenessControl
impl Send for DependencyCompletenessControl
impl Sync for DependencyCompletenessControl
impl Unpin for DependencyCompletenessControl
impl UnsafeUnpin for DependencyCompletenessControl
impl UnwindSafe for DependencyCompletenessControl
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more