Struct Graph 

pub struct Graph {
    pub schema_version: u32,
    pub built_at_head: Option<String>,
    pub defs: Vec<Def>,
    pub edges: Vec<Edge>,
    pub stats: Stats,
    pub names: Vec<GraphName>,
    pub units: Vec<GraphUnit>,
}

Represents Graph.

Fields

schema_version: u32

The schema version value.

built_at_head: Option<String>

The built at head value.

defs: Vec<Def>

The defs value.

edges: Vec<Edge>

The edges value.

stats: Stats

The stats value.

names: Vec<GraphName>

Appended LAST, after stats, and omitted when empty: the house rule for every added field, and what keeps a graph built over a set that declares no name byte-identical to what it was.

units: Vec<GraphUnit>

The repo’s .csproj projects, sorted by id – appended LAST, after names, and omitted entirely when the repo declares none. A tree with no .csproj therefore serializes exactly as it did before the project model existed.

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Graph

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Graph

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for Graph

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl Serialize for Graph

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 Graph