Struct RawGraph 

pub struct RawGraph<'a> { /* private fields */ }

A mutable intermediate dependency graph of all the types in a Spec, backed by a sparse StableDiGraph.

This graph is constructed directly from a Spec, and represents type relationships as they exist in the spec. Transformation methods rewrite this graph in place.

After applying all transformations, call cook to turn this graph into a CookedGraph that’s ready for code generation.

Implementations

impl<'a> RawGraph<'a>

pub fn new(arena: &'a Arena, spec: &'a Spec<'a>) -> Self

Builds a raw type graph from the given spec.

pub fn inline_tagged_variants(&mut self) -> &mut Self

Inlines struct variants that are variants of multiple tagged unions with different tags, or that inherit their tagged union’s own fields.

In OpenAPI’s model of tagged unions, the tag always references a field that’s defined on each variant struct. This model works well for Python and TypeScript, but not Rust; Serde doesn’t allow variant structs to declare fields with the same name as the tag. The Rust generator excludes tag fields when generating structs, but this introduces a new problem: a struct can’t appear as a variant of multiple unions with different tags ¹.

This transformation finds and inlines these structs, so that the Rust generator can safely omit their tag fields.

---

1. If struct A has fields foo and bar, A is a variant of tagged unions C and D, C’s tag is foo, and D’s tag is bar… only foo should be excluded when A is used in C, and only bar should be excluded when A is used in D; but this can’t be modeled in Serde without splitting A into two distinct types. ↩

pub fn inline_untagged_variants(&mut self) -> &mut Self

Inlines struct variants of untagged unions where the union declares own properties, but the struct doesn’t inherit them via allOf.

pub fn collapse_trivial_inlines(&mut self) -> &mut Self

Simplifies trivial allOf compositions.

Drops inheritance edges from Any, and collapses inline structs and unions with a single parent and without own fields or variants, to that parent. Trivial named schemas are preserved, so that user code can refer to them by name.

This transformation simplifies OpenAPI 3.1 $ref schemas with adjacent keywords. A schema like { "$ref": "...", "description": "..." } is sugar for an inline allOf schema with two subschemas: a reference and an inline with just a description. The latter doesn’t contribute any type constraints, so the inline allOf is redundant.

pub fn cook(&self) -> CookedGraph<'a>

Builds an immutable CookedGraph from this mutable raw graph.

Trait Implementations

impl<'a> Debug for RawGraph<'a>

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

Formats the value using the given formatter.