Struct DeletePlan 

pub struct DeletePlan {
    pub decision: DeleteDecision,
    pub diagnostics: Vec<Diagnostic>,
    pub ops: Vec<GraphOp>,
}

A rules-driven plan for deleting graph elements.

Delete planning is atomic: if any explicitly requested element is missing or not deletable under the effective interaction policy, the plan is rejected and contains no ops. Edges that are removed as a consequence of deleting a node are treated as cascaded consistency edits rather than separate direct edge deletions.

Fields

decision: DeleteDecision

Decision.

diagnostics: Vec<Diagnostic>

Diagnostics explaining the decision.

ops: Vec<GraphOp>

Optional edits to apply if accepted.

Implementations

impl DeletePlan

pub fn is_accept(&self) -> bool

pub fn is_reject(&self) -> bool

pub fn diagnostics(&self) -> &[Diagnostic]

pub fn ops(&self) -> &[GraphOp]

pub fn into_ops(self) -> Vec<GraphOp>

pub fn accept() -> Self

Creates an accepted plan with no side effects.

pub fn from_ops(ops: impl IntoIterator<Item = GraphOp>) -> Self

Creates an accepted plan with planned delete ops.

pub fn reject(message: impl Into<String>) -> Self

Creates a rejected plan with a single graph-level error diagnostic.

pub fn reject_with_diagnostic(diagnostic: Diagnostic) -> Self

pub fn reject_with_diagnostics(diagnostics: Vec<Diagnostic>) -> Self

Trait Implementations

impl Clone for DeletePlan

fn clone(&self) -> DeletePlan

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DeletePlan

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for DeletePlan

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for DeletePlan

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.