Struct DockerfileGraph 

pub struct DockerfileGraph {
    pub nodes: Vec<DockerfileNode>,
}

The full parsed + hashed graph — a linear chain (Dockerfile instructions execute strictly top-to-bottom; no branching), so “graph” here is a hash-linked list, the same shape a derivation’s input closure takes at each single-output layer.

Fields

nodes: Vec<DockerfileNode>

Implementations

impl DockerfileGraph

pub fn root_hash(&self) -> Option<&str>

Content hash of the final node — the graph’s overall identity, analogous to a derivation’s output path hash.

Trait Implementations

impl Clone for DockerfileGraph

fn clone(&self) -> DockerfileGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DockerfileGraph

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for DockerfileGraph

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for DockerfileGraph

impl PartialEq for DockerfileGraph

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

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for DockerfileGraph