Struct AifNode 

pub struct AifNode {
    pub node_id: String,
    pub text: String,
    pub node_type: String,
    pub scheme: Option<String>,
}

A single AIF node. The type field discriminates:

• "I" — information / claim (premise or conclusion literal).
• "RA" — rule application (scheme instance).
• "CA" — conflict / attack (critical question).
• "MA" — mutual attack / preference (unused in v0.2.0).

Fields

node_id: String

Node identifier — unique within the document.

text: String

Human-readable text. For I-nodes this is literal.to_string(); for RA-nodes the scheme’s canonical name; for CA-nodes the instantiated critical-question text.

node_type: String

Node type: “I” | “RA” | “CA” | “MA”.

scheme: Option<String>

Scheme name — present on RA-nodes, absent (None → omitted) on others.

Trait Implementations

impl Clone for AifNode

fn clone(&self) -> AifNode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for AifNode

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for AifNode

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for AifNode

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

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for AifNode

impl StructuralPartialEq for AifNode