@unified-product-graph/core 0.11.3 → 0.11.4

package/dist/index.d.cts

@@ -19007,6 +19007,25 @@ interface UPGTreeChild {
      * when present and are silent when absent.
      */
     required?: boolean;
+    /**
+     * The node property `get_tree` sorts this slot's children by (ascending,
+     * nodes lacking it last). Ordering is a property of the DATA, not the viewer,
+     * so the server returns children pre-sorted rather than leaving every client
+     * to re-sort (UPG-663 sequence scalars: `phase_order`, `step_order`,
+     * `action_order`, `state_order`). Omitted -> children keep declared slot order.
+     */
+    order_by?: string;
+    /**
+     * Spine resolution for a DAG. When this slot reaches the SAME node redundantly
+     * with a path through a sibling type (e.g. `user_journey -> journey_step`
+     * directly AND `user_journey -> journey_phase -> journey_step`), name that
+     * sibling type here. A child also reachable as a grandchild through a
+     * `prefer_via`-typed child renders under that spine, NOT here -- collapsing the
+     * redundant path so the node is neither silently dropped (G5) nor
+     * double-counted (J1). A child not on the spine still renders here, so the
+     * direct path remains the fallback when the grouping layer is absent.
+     */
+    prefer_via?: string;
 }
 /** How a pattern decides what counts as a structural gap. */
 type UPGTreeGapPolicy = 'required-children-only' | 'all-optional';
@@ -19076,6 +19095,10 @@ interface UPGTreePatternEdge {
     /** The edge's classification (hierarchy, semantic, cross-domain, ...), or null. */
     kind: string | null;
     required: boolean;
+    /** Node scalar this slot's children are sorted by, when declared (J2). */
+    order_by?: string;
+    /** Sibling type whose path is the canonical spine for this child (J1), when declared. */
+    prefer_via?: string;
 }
 /** A pattern with its child map resolved to concrete edges (for introspection). */
 interface UPGTreePatternDetail extends UPGTreePattern {
@@ -21560,7 +21583,7 @@ declare function isCanonical(text: string): boolean;
  * it stamps the `upg_version` field of every `.upg` file written by the SDK.
  * The `check:version-lockstep` gate enforces this at release time.
  */
-declare const UPG_VERSION: "0.11.3";
+declare const UPG_VERSION: "0.11.4";
 /**
  * The `.upg` JSON document format version. Written to the `upg_version` field.
  * Evolves independently from `UPG_VERSION` (the catalogue version).

package/dist/index.d.ts

@@ -19007,6 +19007,25 @@ interface UPGTreeChild {
      * when present and are silent when absent.
      */
     required?: boolean;
+    /**
+     * The node property `get_tree` sorts this slot's children by (ascending,
+     * nodes lacking it last). Ordering is a property of the DATA, not the viewer,
+     * so the server returns children pre-sorted rather than leaving every client
+     * to re-sort (UPG-663 sequence scalars: `phase_order`, `step_order`,
+     * `action_order`, `state_order`). Omitted -> children keep declared slot order.
+     */
+    order_by?: string;
+    /**
+     * Spine resolution for a DAG. When this slot reaches the SAME node redundantly
+     * with a path through a sibling type (e.g. `user_journey -> journey_step`
+     * directly AND `user_journey -> journey_phase -> journey_step`), name that
+     * sibling type here. A child also reachable as a grandchild through a
+     * `prefer_via`-typed child renders under that spine, NOT here -- collapsing the
+     * redundant path so the node is neither silently dropped (G5) nor
+     * double-counted (J1). A child not on the spine still renders here, so the
+     * direct path remains the fallback when the grouping layer is absent.
+     */
+    prefer_via?: string;
 }
 /** How a pattern decides what counts as a structural gap. */
 type UPGTreeGapPolicy = 'required-children-only' | 'all-optional';
@@ -19076,6 +19095,10 @@ interface UPGTreePatternEdge {
     /** The edge's classification (hierarchy, semantic, cross-domain, ...), or null. */
     kind: string | null;
     required: boolean;
+    /** Node scalar this slot's children are sorted by, when declared (J2). */
+    order_by?: string;
+    /** Sibling type whose path is the canonical spine for this child (J1), when declared. */
+    prefer_via?: string;
 }
 /** A pattern with its child map resolved to concrete edges (for introspection). */
 interface UPGTreePatternDetail extends UPGTreePattern {
@@ -21560,7 +21583,7 @@ declare function isCanonical(text: string): boolean;
  * it stamps the `upg_version` field of every `.upg` file written by the SDK.
  * The `check:version-lockstep` gate enforces this at release time.
  */
-declare const UPG_VERSION: "0.11.3";
+declare const UPG_VERSION: "0.11.4";
 /**
  * The `.upg` JSON document format version. Written to the `upg_version` field.
  * Evolves independently from `UPG_VERSION` (the catalogue version).

package/dist/index.js

@@ -19940,8 +19940,8 @@ function buildTypeAliases() {
 var UPG_TYPE_ALIASES = buildTypeAliases();
 
 // src/presentation/tree-patterns.ts
-var req = (type) => ({ type, required: true });
-var opt = (type) => ({ type });
+var req = (type, order_by) => order_by ? { type, required: true, order_by } : { type, required: true };
+var opt = (type, order_by) => order_by ? { type, order_by } : { type };
 var UPG_TREE_PATTERNS = [
   {
     id: "ost",
@@ -20127,11 +20127,18 @@ var UPG_TREE_PATTERNS = [
     anchor_type: "user_journey",
     fallback_anchors: ["user_flow"],
     child_map: {
-      user_journey: [opt("journey_phase"), opt("journey_step")],
-      journey_phase: [opt("journey_step")],
-      journey_step: [opt("journey_action"), opt("screen")],
+      // The phase is the grouping layer: a step reachable through a phase
+      // renders under the phase, not twice (J1). `prefer_via` collapses the
+      // redundant direct path; a step in NO phase still renders here. Children
+      // are returned in `*_order` sequence (J2), not storage order.
+      user_journey: [
+        opt("journey_phase", "phase_order"),
+        { type: "journey_step", prefer_via: "journey_phase", order_by: "step_order" }
+      ],
+      journey_phase: [opt("journey_step", "step_order")],
+      journey_step: [opt("journey_action", "action_order"), opt("screen")],
       user_flow: [opt("screen")],
-      screen: [opt("screen_state")]
+      screen: [opt("screen_state", "state_order")]
     },
     natural_depth: 3
   },
@@ -20169,7 +20176,10 @@ function resolveTreePatternEdges(pattern) {
   for (const [parent, children] of Object.entries(pattern.child_map)) {
     for (const c of children) {
       const e = resolvePatternEdge(parent, c.type);
-      out.push({ parent, child: c.type, via: e?.via ?? null, kind: e?.kind ?? null, required: !!c.required });
+      const row = { parent, child: c.type, via: e?.via ?? null, kind: e?.kind ?? null, required: !!c.required };
+      if (c.order_by) row.order_by = c.order_by;
+      if (c.prefer_via) row.prefer_via = c.prefer_via;
+      out.push(row);
     }
   }
   return out;
@@ -28556,7 +28566,7 @@ function isCanonical(text) {
 }
 
 // src/index.ts
-var UPG_VERSION = "0.11.3";
+var UPG_VERSION = "0.11.4";
 var UPG_FORMAT_VERSION = "0.4.0";
 var MARKDOWN_FORMAT_VERSION = "0.1";
 var UPG_TYPES = getTypes();