Struct TypeGraph 

pub struct TypeGraph {
    pub namespace: String,
    pub root_elements: Vec<RootElement>,
    pub types: IndexMap<String, TypeDef>,
}

The complete intermediate representation of a single XSD schema.

Example

use mx20022_codegen::{xsd, ir};

let schema = xsd::parse_str(r#"<xs:schema
    xmlns:xs="http://www.w3.org/2001/XMLSchema"
    targetNamespace="urn:example">
  <xs:element name="Root" type="RootType"/>
  <xs:complexType name="RootType">
    <xs:sequence>
      <xs:element name="Id" type="xs:string"/>
    </xs:sequence>
  </xs:complexType>
</xs:schema>"#).unwrap();

let graph = ir::lower::lower(&schema).unwrap();
assert_eq!(graph.root_elements.len(), 1);

Fields

namespace: String

The targetNamespace from the XSD schema element.

root_elements: Vec<RootElement>

Top-level document element declarations (e.g. <xs:element name="AppHdr" …/>).

types: IndexMap<String, TypeDef>

All type definitions keyed by their XSD/Rust name, in insertion order.

Trait Implementations

impl Clone for TypeGraph

fn clone(&self) -> TypeGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TypeGraph

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

Formats the value using the given formatter.

impl PartialEq for TypeGraph

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