pub struct OperatorGraph {
pub class: String,
pub layer: String,
pub weight: u32,
pub height: u8,
pub shape: String,
pub anchors: Vec<AnchorWeight>,
}Expand description
Grammar position of this operator’s return — a deterministic function of
the frozen catalog, never of the payload. Carried on the wire so any
graph consumer (Obsidian, PCVC, a queue) renders the result as-is instead
of re-deriving the grammar. “Node vs rel vs property” is class; the
common/uncommon split is shape.
Fields§
§class: StringCatalog class (NODE / REL / TAG / PROP / ENTITY / …).
layer: StringCatalog layer (ENTITY / RESIDUAL / DEEP_TAG / HOST / TRANSFORM / …).
weight: u32Category weight: max declaring count across this operator’s tokens.
height: u8Height: this operator’s own wave on the ladder (unwaved → 0).
shape: Stringcommon when weight ≥ 2, uncommon at 1, isolated at 0.
anchors: Vec<AnchorWeight>Declared anchors with their weights/heights, catalog order.
Implementations§
Source§impl OperatorGraph
impl OperatorGraph
Sourcepub fn from_spec(spec: &OperatorSpec) -> Self
pub fn from_spec(spec: &OperatorSpec) -> Self
Grammar block for one catalog row; all numbers come from the static token statistics over the frozen catalog.