aontu 0.44.0 → 0.46.0

package/src/val/MoveFuncVal.ts

@@ -13,7 +13,6 @@ import {
 import { makeNilErr } from '../err'
 
 import { NilVal } from '../val/NilVal'
-import { PathVal } from '../val/PathVal'
 
 import {
   walk
@@ -27,60 +26,6 @@ import { PrefFuncVal } from './PrefFuncVal'
 
 
 
-// Navigate the tree using a PathVal's resolved path and hide the source.
-function hideAtPath(root: Val, pv: PathVal) {
-  // Compute the refpath the same way PathVal.find does
-  const parts: string[] = []
-  for (const part of pv.peg) {
-    if ('string' === typeof part) parts.push(part)
-  }
-
-  let refpath: string[]
-  if (pv.absolute) {
-    refpath = parts
-  }
-  else {
-    refpath = pv.path.slice(0, -1).concat(parts)
-  }
-
-  // Walk to the source, handling conjuncts/disjuncts
-  let node: any = root
-  for (let i = 0; i < refpath.length; i++) {
-    const part = refpath[i]
-    if (node?.isMap || node?.isList) {
-      node = node.peg[part]
-    }
-    else if (node?.isConjunct || node?.isDisjunct) {
-      // Search junction terms for the key
-      let found = null
-      const stack = [...node.peg]
-      while (stack.length > 0) {
-        const term = stack.pop()
-        if (term?.isConjunct || term?.isDisjunct) {
-          stack.push(...term.peg)
-        }
-        else if ((term?.isMap || term?.isList) && term.peg[part] != null) {
-          found = term.peg[part]
-          break
-        }
-      }
-      node = found
-    }
-    else {
-      return
-    }
-    if (node == null) return
-  }
-
-  // Mark the source value hidden
-  node.mark.hide = true
-  walk(node, (_key: string | number | undefined, val: Val) => {
-    val.mark.hide = true
-    return val
-  })
-}
-
-
 class MoveFuncVal extends FuncBaseVal {
   isMoveFunc = true
 
@@ -105,40 +50,30 @@ class MoveFuncVal extends FuncBaseVal {
   }
 
   resolve(ctx: AontuContext, args: Val[]) {
-    let arg = args[0] ?? makeNilErr(ctx, 'arg', this)
-    if (arg.isNil) return arg
+    let out = args[0] ?? makeNilErr(ctx, 'arg', this)
 
-    let src: Val
+    const orig = out
 
-    if (arg instanceof PathVal) {
-      // Get clone for the destination
-      src = arg.find(ctx) as Val
-      if (src == null || src.isNil) return makeNilErr(ctx, 'arg', this)
+    if (!orig.isNil) {
+      const src = orig.clone(ctx)
 
-      // Hide the source in the tree by navigating to it
-      hideAtPath(ctx.root as Val, arg)
-    }
-    else {
-      src = arg.clone(ctx)
+      if (src.isRef) {
+        src.mark._hide_found = true
+      }
 
-      // Hide the original
-      arg.mark.hide = true
-      walk(arg, (_key: string | number | undefined, val: Val) => {
+      walk(orig, (_key: string | number | undefined, val: Val) => {
         val.mark.hide = true
         return val
       })
+
+      // out = new CopyFuncVal({ peg: [src] }, ctx)
+      out = new PrefFuncVal({ peg: [src] }, ctx)
+      // out = src
     }
 
-    // Clear marks on the clone (like copy)
-    src.mark.type = false
-    src.mark.hide = false
-    walk(src, (_key: string | number | undefined, val: Val) => {
-      val.mark.type = false
-      val.mark.hide = false
-      return val
-    })
+    // console.log('MOVE-resolve', orig, out)
 
-    return new PrefFuncVal({ peg: [src] }, ctx)
+    return out
   }
 }
 

package/src/val/PathFuncVal.ts

@@ -6,10 +6,6 @@ import type {
   ValSpec,
 } from '../type'
 
-import {
-  DONE,
-} from '../type'
-
 import {
   AontuContext,
 } from '../ctx'
@@ -17,7 +13,7 @@ import {
 import { makeNilErr } from '../err'
 
 import { NilVal } from '../val/NilVal'
-import { PathVal } from '../val/PathVal'
+import { RefVal } from '../val/RefVal'
 import { FuncBaseVal } from './FuncBaseVal'
 
 
@@ -49,26 +45,12 @@ class PathFuncVal extends FuncBaseVal {
     let arg = args[0]
 
     if (0 === this.prepared) {
-      if (arg instanceof PathVal) {
-        // PathVal from dotted arg — resolve via find().
-        const found = arg.find(ctx)
-        if (found != null && !found.isNil) {
-          arg = found
-        }
-        else {
-          arg.dc = DONE
-        }
-      }
-      else if (arg.isScalar && arg.peg != null && arg.peg !== ''
-        && ('string' === typeof arg.peg || arg.isNumber)) {
-        // String or number arg like path("foo") or path(0.2) — create a path value
-        arg = this.place(new PathVal({ peg: [arg], absolute: false })) as PathVal
-        arg.dc = DONE
+      if (arg.isScalar) {
+        arg = this.place(new RefVal({ peg: [arg], absolute: false }))
       }
-      else if (arg.isNil || (arg.isScalar && (arg.peg === '' || arg.peg == null))) {
+      else if (!arg.isRef) {
         arg = makeNilErr(ctx, 'invalid-arg', this)
       }
-      // else: already resolved by preprocessing — pass through
     }
 
     args[0] = arg
@@ -82,13 +64,6 @@ class PathFuncVal extends FuncBaseVal {
   resolve(ctx: AontuContext, args: Val[]) {
     let out = args[0] ?? makeNilErr(ctx, 'arg', this)
 
-    if (out instanceof PathVal) {
-      const found = out.find(ctx)
-      if (found != null && !found.isNil) {
-        out = found
-      }
-    }
-
     return out
   }
 

package/src/val/PrefVal.ts

@@ -22,7 +22,6 @@ import {
 
 import { top } from './top'
 
-import { ConjunctVal } from './ConjunctVal'
 import { FeatureVal } from './FeatureVal'
 
 
@@ -65,13 +64,10 @@ class PrefVal extends FeatureVal {
     if (!this.peg.done) {
       const resolved = unite(te ? ctx.clone({ explain: ec(te, 'RES') }) : ctx,
         this.peg, top(), 'pref/resolve')
+      // console.log('PREF-RESOLVED', this.peg.canon, '->', resolved)
       this.peg = resolved
       this.superpeg = this.peg.superior()
     }
-    else if (this.superpeg.isTop && !this.peg.isTop) {
-      // Stale superpeg from pre-resolved PathVal — recalculate
-      this.superpeg = this.peg.superior()
-    }
 
     if (peer instanceof PrefVal) {
       why += 'pref-'
@@ -110,20 +106,11 @@ class PrefVal extends FeatureVal {
     else if (!peer.isTop) {
       why += 'super-'
 
-      // If peg is unresolved (e.g. deferred ref), don't decide yet —
-      // preserve both sides so a later pass can resolve.
-      if (!this.peg.done) {
-        out = new ConjunctVal({ peg: [this, peer] }, ctx)
-        done = false
-        why += 'defer'
-      }
-      else {
-        out = unite(te ? ctx.clone({ explain: ec(te, 'SUPER') }) : ctx,
-          this.superpeg, peer, 'pref-super/' + this.id)
-        if (out.same(this.superpeg)) {
-          out = this.peg
-          why += 'same'
-        }
+      out = unite(te ? ctx.clone({ explain: ec(te, 'SUPER') }) : ctx,
+        this.superpeg, peer, 'pref-super/' + this.id)
+      if (out.same(this.superpeg)) {
+        out = this.peg
+        why += 'same'
       }
 
       // }

package/src/val/{RefVal.ts.old → RefVal.ts}

@@ -1,6 +1,8 @@
 /* Copyright (c) 2021-2025 Richard Rodger, MIT License */
 
 
+import Util from 'node:util'
+
 import {
   walk,
   explainOpen,
@@ -14,7 +16,6 @@ import type {
   ValSpec,
 } from '../type'
 
-
 import {
   DONE,
 } from '../type'
@@ -136,23 +137,10 @@ class RefVal extends FeatureVal {
   unify(peer: Val, ctx: AontuContext): Val {
     peer = peer ?? top()
 
-    // TEMPORARY: nerf RefVals to verify spread-first resolution
-    return makeNilErr(ctx, 'ref_test_block', this, peer)
-
     const te = ctx.explain && explainOpen(ctx, ctx.explain, 'Ref', this, peer)
     let out: Val = this
     let why = 'id'
 
-    // Defer ref resolution on first pass and while spreads remain
-    if (0 === ctx.cc || 0 < ctx.sc) {
-      if (!peer.isTop && this.id !== peer.id) {
-        out = new ConjunctVal({ peg: [this, peer] }, ctx)
-      }
-      out.dc = DONE === out.dc ? DONE : this.dc + 1
-      explainClose(te, out)
-      return out
-    }
-
     if (this.id !== peer.id) {
 
       // TODO: not resolved when all Vals in path are done is an error
@@ -371,30 +359,31 @@ class RefVal extends FeatureVal {
           if (this.mark.type || this.mark.hide) {
             out.mark.type = this.mark.type
             out.mark.hide = this.mark.hide
+
+            // walk(out, (_key: string | number | undefined, val: Val) => {
+            //   val.mark.type = this.mark.type
+            //   val.mark.hide = this.mark.hide
+            //   return val
+            // })
           }
 
           if (this.mark._hide_found) {
             out.mark.hide = true
           }
 
-          // Cache clone+walk results per (ref, target) per iteration.
-          const cacheKey = this.id + '|' + out.id
-          const cache = ctx._refCloneCache
-          const cached = cache?.get(cacheKey)
-          if (cached !== undefined) {
-            out = cached
-          }
-          else {
-            out = out.clone(ctx)
+          // console.log('FOUND-B', out)
 
-            walk(out, (_key: string | number | undefined, val: Val) => {
-              val.mark.type = false
-              val.mark.hide = false
-              return val
-            })
+          out = out.clone(ctx)
 
-            cache?.set(cacheKey, out)
-          }
+          // if (this.mark.type || this.mark.hide) {
+          walk(out, (_key: string | number | undefined, val: Val) => {
+            val.mark.type = false
+            val.mark.hide = false
+            return val
+          })
+          //}
+
+          // onsole.log('FOUND-C', out)
         }
       }
     }

package/src/val/Val.ts

@@ -69,11 +69,10 @@ abstract class Val {
   declare isList: boolean
   declare isScalar: boolean
   declare isScalarKind: boolean
-  declare isPath: boolean
+  declare isRef: boolean
   declare isPref: boolean
   declare isVar: boolean
   declare isBag: boolean
-  declare isSpread: boolean
   declare isNumber: boolean
   declare isInteger: boolean
   declare isString: boolean
@@ -151,10 +150,8 @@ abstract class Val {
 
     if (Array.isArray(this.peg)) {
       let spread = (this.peg as any)[SPREAD]
-      if (this.peg.includes(undefined)) {
-        this.peg = this.peg.filter(n => undefined !== n)
-      }
-      ;(this.peg as any)[SPREAD] = spread
+      this.peg = this.peg.filter(n => undefined !== n)
+        ; (this.peg as any)[SPREAD] = spread
     }
 
     // spec.path takes precedence over ctx.path: lets callers (notably
@@ -242,7 +239,7 @@ abstract class Val {
   get isPathDependent(): boolean {
     if (this._isPathDependent !== undefined) return this._isPathDependent
     let dep =
-      this.isPath || this.isKeyFunc || this.isPathFunc ||
+      this.isRef || this.isKeyFunc || this.isPathFunc ||
       this.isMoveFunc || this.isSuperFunc
     if (!dep) {
       const peg = this.peg
@@ -258,6 +255,10 @@ abstract class Val {
           if (c && c.isVal && c.isPathDependent) { dep = true; break }
         }
       }
+      if (!dep) {
+        const spreadCj = (this as any).spread?.cj as Val | undefined
+        if (spreadCj && spreadCj.isPathDependent) dep = true
+      }
     }
     this._isPathDependent = dep
     return dep
@@ -366,11 +367,10 @@ Object.assign(Val.prototype, {
   isList: false,
   isScalar: false,
   isScalarKind: false,
-  isPath: false,
+  isRef: false,
   isPref: false,
   isVar: false,
   isBag: false,
-  isSpread: false,
   isNumber: false,
   isInteger: false,
   isString: false,

package/src/val/VarVal.ts

@@ -62,7 +62,7 @@ class VarVal extends FeatureVal {
     if (this.peg.isVal) {
       // $.a.b.c - convert path to absolute
       // if (this.peg instanceof RefVal) {
-      if (this.peg.isPath) {
+      if (this.peg.isRef) {
         this.peg.absolute = true
         nameVal = this.peg
       }
@@ -76,7 +76,7 @@ class VarVal extends FeatureVal {
     }
 
     // if (!(nameVal instanceof RefVal) && DONE === nameVal.dc) {
-    if (!(nameVal.isPath) && DONE === nameVal.dc) {
+    if (!(nameVal.isRef) && DONE === nameVal.dc) {
       if (nameVal instanceof StringVal) {
         let found = ctx.vars[nameVal.peg]
         if (undefined === found) {

package/README.md

@@ -1,18 +0,0 @@
-<a name="top"></a>
-
-# Aontu: JSON Structure unifier
-
-[![npm version](https://img.shields.io/npm/v/aontu.svg)](https://npmjs.com/package/aontu)
-[![build](https://github.com/rjrodger/aontu/actions/workflows/build.yml/badge.svg)](https://github.com/rjrodger/aontu/actions/workflows/build.yml)
-[![Coverage Status](https://coveralls.io/repos/github/rjrodger/aontu/badge.svg?branch=main)](https://coveralls.io/github/rjrodger/aontu?branch=main)
-[![Known Vulnerabilities](https://snyk.io/test/github/rjrodger/aontu/badge.svg)](https://snyk.io/test/github/rjrodger/aontu)
-[![DeepScan grade](https://deepscan.io/api/teams/5016/projects/26218/branches/831193/badge/grade.svg)](https://deepscan.io/dashboard#view=project&tid=5016&pid=26218&bid=831193)
-[![Maintainability](https://api.codeclimate.com/v1/badges/2ee16ebd2281bc837d9b/maintainability)](https://codeclimate.com/github/rjrodger/aontu/maintainability)
-
-| ![Voxgig](https://www.voxgig.com/res/img/vgt01r.png) | This open source module is sponsored and supported by [Voxgig](https://www.voxgig.com). |
-|---|---|
-
-
-This unifier is heavily inspired by [Cue Lang](https://cuelang.org/)
-and may be regarded as a purpose-specific dialect.
-

package/dist/val/PathVal.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"PathVal.js","sourceRoot":"","sources":["../../src/val/PathVal.ts"],"names":[],"mappings":";AAAA,oDAAoD;;;AAQpD,kCAEgB;AAEhB,wCAEmB;AAGnB,oCAAgC;AAEhC,gCAAmC;AAEnC,+BAEc;AAEd,2CAAuC;AACvC,6CAAyC;AACzC,2CAAuC;AACvC,qCAAiC;AACjC,+CAA2C;AAC3C,+CAA2C;AAC3C,6CAAyC;AAGzC,MAAM,OAAQ,SAAQ,uBAAU;IAS9B,YACE,IAIC,EACD,GAAkB;QAElB,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QAhBlB,WAAM,GAAG,IAAI,CAAA;QACb,cAAS,GAAG,IAAI,CAAA;QAChB,QAAG,GAAG,KAAK,CAAA;QAEX,aAAQ,GAAY,KAAK,CAAA;QACzB,WAAM,GAAY,KAAK,CAAA;QACvB,cAAS,GAAoB,SAAS,CAAA;QAWpC,IAAI,CAAC,GAAG,GAAG,EAAE,CAAA;QAEb,IAAI,CAAC,QAAQ,GAAG,IAAI,KAAK,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,kBAAkB;YAChE,IAAI,KAAK,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAA;QAEvC,IAAI,CAAC,MAAM,GAAG,IAAI,KAAK,IAAI,CAAC,MAAM,CAAA;QAElC,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;YAC5C,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAA;QAC3B,CAAC;IACH,CAAC;IAGD,MAAM,CAAC,IAAS;QACd,IAAI,OAAO,CAAA;QAEX,IAAI,QAAQ,KAAK,OAAO,IAAI,EAAE,CAAC;YAC7B,OAAO,GAAG,IAAI,CAAA;YACd,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QACxB,CAAC;aAEI,IAAI,IAAI,YAAY,qBAAS,EAAE,CAAC;YACnC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAA;YAClB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QACxB,CAAC;aAEI,IAAI,IAAI,YAAY,uBAAU,EAAE,CAAC;YACpC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAA;YAClB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QACxB,CAAC;aAEI,IAAI,IAAI,YAAY,qBAAS,EAAE,CAAC;YACnC,IAAI,QAAQ,GAAa,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;YAC5C,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAA;QAC5B,CAAC;aAEI,IAAI,IAAI,YAAY,eAAM,EAAE,CAAC;YAChC,OAAO,GAAG,IAAI,CAAA;YACd,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QACxB,CAAC;aAEI,IAAI,IAAI,YAAY,OAAO,EAAE,CAAC;YACjC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAA;YACtB,CAAC;YAED,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBAChB,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;oBAChB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;gBACpB,CAAC;YACH,CAAC;iBACI,CAAC;gBACJ,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;oBAChB,IAAI,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC;wBAC1B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAA;oBACpB,CAAC;yBAEI,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC;wBAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;oBACpB,CAAC;gBACH,CAAC;YACH,CAAC;YAED,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAA;QAC5B,CAAC;IACH,CAAC;IAGD,KAAK,CAAC,IAAS,EAAE,GAAiB;QAChC,IAAI,GAAG,IAAI,IAAI,IAAA,SAAG,GAAE,CAAA;QAEpB,sEAAsE;QACtE,IAAI,IAAI,CAAC,IAAI;YAAE,OAAO,IAAI,CAAA;QAE1B,IAAI,GAAG,GAAQ,IAAI,CAAA;QACnB,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;QAE5B,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;YAClC,GAAG,GAAG,IAAA,aAAK,EAAC,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,CAAA;QACvC,CAAC;aACI,IAAI,KAAK,EAAE,KAAK,EAAE,CAAC;YACtB,GAAG,GAAG,KAAK,CAAA;QACb,CAAC;aACI,CAAC;YACJ,uDAAuD;YACvD,IAAI,CAAC,EAAE,GAAG,WAAI,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,WAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAA;QACjD,CAAC;QAED,OAAO,GAAG,CAAA;IACZ,CAAC;IAGD,IAAI,CAAC,GAAiB;QACpB,IAAI,GAAG,GAAoB,SAAS,CAAA;QAEpC,wDAAwD;QACxD,2EAA2E;QAC3E,IAAI,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAA;QACtD,IAAI,YAAY,EAAE,CAAC;YACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;oBACjC,YAAY,GAAG,KAAK,CAAA;oBACpB,MAAK;gBACP,CAAC;YACH,CAAC;QACH,CAAC;QACD,+EAA+E;QAC/E,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACnE,IAAI,QAAQ,GAAG,IAAI,CAAA;YACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,IAAI,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAAC,QAAQ,GAAG,KAAK,CAAC;oBAAC,MAAK;gBAAC,CAAC;YACrD,CAAC;YACD,YAAY,GAAG,QAAQ,CAAA;QACzB,CAAC;QAED,IAAI,OAAO,GAAa,EAAE,CAAA;QAC1B,IAAI,EAAE,GAAG,CAAC,CAAA;QACV,mBAAmB;QAEnB,IAAI,YAAY,EAAE,CAAC;YACjB,wDAAwD;YACxD,GAAG,GAAG,IAAA,gBAAU,EAAC,GAAG,EAAE,YAAY,EAAE,IAAI,CAAC,CAAA;QAC3C,CAAC;aACI,CAAC;YAEJ,IAAI,KAAK,GAAa,EAAE,CAAA;YAExB,IAAI,KAAK,GAAa,EAAE,CAAA;YAExB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;gBAC5C,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;gBACvB,IAAI,IAAI,YAAY,eAAM,EAAE,CAAC;oBAC3B,IAAI,MAAM,GAAI,IAAe,CAAC,GAAG,CAAA;oBACjC,IAAI,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAA;oBAExC,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;wBACnB,IAAI,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;4BAC/B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;wBAClB,CAAC;6BACI,CAAC;4BACJ,sCAAsC;4BACtC,OAAM;wBACR,CAAC;oBACH,CAAC;oBAED,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;wBACpB,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;4BACb,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;wBAClB,CAAC;6BACI,CAAC;4BACJ,sCAAsC;4BACtC,OAAM;wBACR,CAAC;oBACH,CAAC;yBACI,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;wBAC3B,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;4BACb,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;wBAClB,CAAC;6BACI,CAAC;4BACJ,sCAAsC;4BACtC,OAAM;wBACR,CAAC;oBACH,CAAC;yBACI,IAAI,CAAC,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;wBAC5B,IAAI,GAAI,IAAe,CAAC,KAAK,CAAC,IAAA,SAAG,GAAE,EAAE,GAAG,CAAC,CAAA;wBACzC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;4BACf,0CAA0C;4BAC1C,OAAM;wBACR,CAAC;6BACI,CAAC;4BACJ,IAAI,GAAG,EAAE,GAAG,IAAI,CAAC,GAAG,CAAA;wBACtB,CAAC;oBACH,CAAC;gBACH,CAAC;qBACI,CAAC;oBACJ,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBAClB,CAAC;YACH,CAAC;YAED,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClB,OAAO,GAAG,KAAK,CAAA;YACjB,CAAC;iBACI,CAAC;gBACJ,4BAA4B;gBAC5B,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CACvB,CAAC,EACD,CACE,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC1B,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBAC7B,CAAC,CAAC,CAAC,WAAW;iBACnB,CACF,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;YACjB,CAAC;YAED,IAAI,GAAG,GAAG,GAAG,CAAA;YACb,OAAO,GAAG,OAAO;iBACd,MAAM,CAAC,CAAC,CAAC,CAAW,EAAE,CAAS,EAAE,EAAE,CAClC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;YAE9D,IAAI,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC1B,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;gBACzC,IAAI,EAAE,GAAG,IAAI,qBAAS,CAAC,EAAE,GAAG,EAAE,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,GAAG,CAAC,CAAA;gBAE5D,qBAAqB;gBACrB,EAAE,CAAC,EAAE,GAAG,WAAI,CAAA;gBACZ,EAAE,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;gBAEnB,OAAO,EAAE,CAAA;YACX,CAAC;YAED,IAAI,IAAI,GAAe,GAAG,CAAC,IAAW,CAAA;YAEtC,IAAI,MAAM,GAAG,KAAK,CAAA;YAElB,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBACjB,OAAO,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;oBACjC,IAAI,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAA;oBACtB,sCAAsC;oBAEtC,oEAAoE;oBAEpE,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;wBACf,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;oBACvB,CAAC;yBACI,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;wBACrB,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;oBACvB,CAAC;yBACI,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;wBAC5C,qDAAqD;wBACrD,6CAA6C;wBAC7C,wDAAwD;wBACxD,MAAM,OAAO,GAAU,EAAE,CAAA;wBACzB,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAA;wBAC3B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;4BACxB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAG,CAAA;4BACzB,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;gCACvC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAA;4BACzB,CAAC;iCACI,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gCACvB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;4BACxB,CAAC;iCACI,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;gCAC/D,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAA;4BAC9B,CAAC;wBACH,CAAC;wBACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;4BACzB,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;wBACnB,CAAC;6BACI,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;4BAC5B,IAAI,GAAG,IAAI,CAAC,UAAU;gCACpB,CAAC,CAAC,IAAI,yBAAW,CAAC,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC;gCACnC,CAAC,CAAC,IAAI,yBAAW,CAAC,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC,CAAA;wBACvC,CAAC;6BACI,CAAC;4BACJ,IAAI,GAAG,IAAI,CAAA;wBACb,CAAC;oBACH,CAAC;yBACI,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;wBACnB,MAAM,GAAG,IAAI,CAAA;wBACb,MAAM;oBACR,CAAC;yBACI,CAAC;wBACJ,MAAM;oBACR,CAAC;oBAED,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;wBACjB,MAAM,GAAG,IAAI,CAAA;wBACb,MAAK;oBACP,CAAC;gBAEH,CAAC;YACH,CAAC;YAED,sEAAsE;YAGtE,IAAI,MAAM,EAAE,CAAC;gBACX,GAAG,GAAG,IAAA,gBAAU,EAAC,GAAG,EAAE,SAAS,EAAE,IAAI,CAAC,CAAA;YACxC,CAAC;iBACI,IAAI,EAAE,KAAK,OAAO,CAAC,MAAM,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBAC/C,GAAG,GAAG,IAAI,CAAA;gBAEV,uDAAuD;gBACvD,IAAI,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC,0CAA0C;oBAE3D,8BAA8B;oBAE9B,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;wBACrC,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAA;wBAC9B,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAA;oBAChC,CAAC;oBAED,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;wBAC1B,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;oBACtB,CAAC;oBAED,4DAA4D;oBAC5D,MAAM,QAAQ,GAAG,IAAI,CAAC,EAAE,GAAG,GAAG,GAAG,GAAG,CAAC,EAAE,CAAA;oBACvC,MAAM,KAAK,GAAG,GAAG,CAAC,cAAc,CAAA;oBAChC,MAAM,MAAM,GAAG,KAAK,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAA;oBACnC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;wBACzB,GAAG,GAAG,MAAM,CAAA;oBACd,CAAC;yBACI,CAAC;wBACJ,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;wBACpB,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAA;wBACrB,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAA;wBAErB,IAAA,cAAI,EAAC,GAAG,EAAE,CAAC,IAAiC,EAAE,GAAQ,EAAE,EAAE;4BACxD,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAA;4BACrB,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAA;4BACrB,OAAO,GAAG,CAAA;wBACZ,CAAC,CAAC,CAAA;wBAEF,KAAK,EAAE,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAA;oBAC3B,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,kJAAkJ;QAElJ,OAAO,GAAG,CAAA;IACZ,CAAC;IAID,IAAI,CAAC,IAAS;QACZ,OAAO,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG,CAAA;IACrD,CAAC;IAGD,KAAK,CAAC,GAAiB,EAAE,IAAc;QACrC,IAAI,GAAG,GAAI,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE;YAC1B,GAAG,EAAE,IAAI,CAAC,GAAG;YACb,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC;SAChB,CAAa,CAAA;QACd,OAAO,GAAG,CAAA;IACZ,CAAC;IAGD,IAAI,KAAK;QACP,IAAI,GAAG,GACL,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1B,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAChC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACvC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;iBAC5B,IAAI,CAAC,GAAG,CAAC,CAAA;QACd,OAAO,GAAG,CAAA;IACZ,CAAC;IAGD,GAAG,CAAC,GAAiB;QACnB,IAAI,GAAG,GAAG,IAAA,gBAAU,EAClB,GAAG,EACH,KAAK,EACL,IAAI,EACJ,SAAS,CACV,CAAA;QAED,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACpB,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAA;QAC5B,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAA;QAC5B,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAA;QAE5B,OAAO,SAAS,CAAA;IAClB,CAAC;IAGD,UAAU;QACR,OAAO;YACL,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE;YAC/B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE;SAC5B,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IAClC,CAAC;CAEF;AAIC,0BAAO"}

package/dist/val/SpreadVal.d.ts

@@ -1,20 +0,0 @@
-import type { Val, ValSpec } from '../type';
-import { AontuContext } from '../ctx';
-import { FeatureVal } from './FeatureVal';
-import { MapVal } from './MapVal';
-import { ListVal } from './ListVal';
-declare class SpreadVal extends FeatureVal {
-    isSpread: boolean;
-    isGenable: boolean;
-    cjo: number;
-    constructor(spec: ValSpec, ctx?: AontuContext);
-    unify(peer: Val, ctx: AontuContext): Val;
-    applyToMap(map: MapVal, ctx: AontuContext, te: any): Val;
-    applyToList(list: ListVal, ctx: AontuContext, te: any): Val;
-    clone(ctx: AontuContext, spec?: ValSpec): Val;
-    spreadClone(ctx: AontuContext): Val;
-    get canon(): string;
-    gen(_ctx: AontuContext): undefined;
-    inspection(): string;
-}
-export { SpreadVal, };

package/dist/val/SpreadVal.js

@@ -1,194 +0,0 @@
-"use strict";
-/* Copyright (c) 2025 Richard Rodger, MIT License */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.SpreadVal = void 0;
-const type_1 = require("../type");
-const unify_1 = require("../unify");
-const utility_1 = require("../utility");
-const top_1 = require("./top");
-const FeatureVal_1 = require("./FeatureVal");
-const ConjunctVal_1 = require("./ConjunctVal");
-const MapVal_1 = require("./MapVal");
-const ListVal_1 = require("./ListVal");
-class SpreadVal extends FeatureVal_1.FeatureVal {
-    constructor(spec, ctx) {
-        super(spec, ctx);
-        this.isSpread = true;
-        this.isGenable = true;
-        this.cjo = 110000; // Sorts after MapVal/ListVal in ConjunctVal norm
-    }
-    unify(peer, ctx) {
-        peer = peer ?? (0, top_1.top)();
-        const te = ctx.explain && (0, utility_1.explainOpen)(ctx, ctx.explain, 'Spread', this, peer);
-        let out;
-        if (peer.isTop) {
-            // Self-unify: spread is a constraint, not a value that converges.
-            // Mark done to prevent fixpoint cycling.
-            out = this;
-            out.dc = type_1.DONE;
-        }
-        else if (peer.isSpread) {
-            // SpreadVal + SpreadVal: unify the two constraints
-            const merged = (0, unify_1.unite)(te ? ctx.clone({ explain: (0, utility_1.ec)(te, 'SPR') }) : ctx, this.peg, peer.peg, 'spread-merge');
-            out = new SpreadVal({ peg: merged }, ctx);
-            out.dc = merged.done ? type_1.DONE : this.dc + 1;
-        }
-        else if (peer.isMap) {
-            // SpreadVal + MapVal: apply spread to each map key
-            out = this.applyToMap(peer, ctx, te);
-        }
-        else if (peer.isList) {
-            // SpreadVal + ListVal: apply spread to each list element
-            out = this.applyToList(peer, ctx, te);
-        }
-        else if (peer.isConjunct) {
-            // SpreadVal + ConjunctVal: unify with the conjunct.
-            // The conjunct fold will place us last (high cjo).
-            out = peer.unify(this, te ? ctx.clone({ explain: (0, utility_1.ec)(te, 'SCJ') }) : ctx);
-        }
-        else {
-            // SpreadVal + other: defer by wrapping in ConjunctVal
-            out = new ConjunctVal_1.ConjunctVal({ peg: [peer, this] }, ctx);
-            out.dc = this.dc + 1;
-        }
-        // Track unresolved spread count.
-        // cc=0: increment for spreads that don't vanish.
-        // cc>0: decrement when a spread vanishes.
-        if (0 === ctx.cc) {
-            if (out.isSpread && !out.done) {
-                ctx.sc++;
-            }
-        }
-        else if (ctx.sc > 0) {
-            if (!(out.isSpread && !out.done)) {
-                ctx.sc--;
-            }
-        }
-        ctx.explain && (0, utility_1.explainClose)(te, out);
-        return out;
-    }
-    // Apply this spread constraint to each key in a MapVal.
-    // Uses unite() per key with the correct descended context.
-    applyToMap(map, ctx, te) {
-        const spread = this.peg;
-        const mapKeys = Object.keys(map.peg);
-        // If map has no keys, preserve the spread for future merges.
-        // Mark as DONE to prevent fixpoint cycling.
-        if (mapKeys.length === 0) {
-            const out = new ConjunctVal_1.ConjunctVal({ peg: [map, this] }, ctx);
-            out.dc = type_1.DONE;
-            return out;
-        }
-        const out = new MapVal_1.MapVal({ peg: {} }, ctx);
-        out.closed = map.closed;
-        out.optionalKeys = 0 < map.optionalKeys.length
-            ? [...map.optionalKeys] : map.optionalKeys;
-        out.site = map.site;
-        let done = true;
-        for (const key of mapKeys) {
-            const child = map.peg[key];
-            const keyctx = ctx.descend(key);
-            // Clone the spread for this key's context, then resolve any
-            // path-dependent functions (key(), path(), etc.) by unifying
-            // with TOP. This ensures the spread values are concrete before
-            // being merged as peer keys into the child map.
-            let key_spread = spread.spreadClone(keyctx);
-            if (!key_spread.done) {
-                key_spread = (0, unify_1.unite)(keyctx, key_spread, (0, top_1.top)(), 'spread-resolve');
-            }
-            // Clear type marks on the spread constraint root and its
-            // direct children — type() constrains but should not mark
-            // children as type-invisible.
-            key_spread.mark.type = false;
-            key_spread.mark.hide = false;
-            if (key_spread.isMap) {
-                for (const k in key_spread.peg) {
-                    if (key_spread.peg[k]?.isVal) {
-                        key_spread.peg[k].mark.type = false;
-                    }
-                }
-            }
-            (0, utility_1.propagateMarks)(map, child);
-            out.peg[key] =
-                undefined === child ? key_spread :
-                    child.isNil ? child :
-                        key_spread.isNil ? key_spread :
-                            key_spread.isTop && child.done ? child :
-                                child.isTop && key_spread.done ? key_spread :
-                                    (0, unify_1.unite)(te ? keyctx.clone({ explain: (0, utility_1.ec)(te, 'SK:' + key) }) : keyctx, child, key_spread, 'spread-apply');
-            done = done && (type_1.DONE === out.peg[key].dc);
-        }
-        out.dc = done ? type_1.DONE : map.dc + 1;
-        (0, utility_1.propagateMarks)(map, out);
-        // NOTE: do not propagate type/hide marks from the spread constraint
-        // to the output — a type spread constrains children but doesn't
-        // make them type-invisible.
-        return out;
-    }
-    // Apply this spread constraint to each element in a ListVal.
-    applyToList(list, ctx, te) {
-        const spread = this.peg;
-        const listKeys = Object.keys(list.peg);
-        if (listKeys.length === 0) {
-            const out = new ConjunctVal_1.ConjunctVal({ peg: [list, this] }, ctx);
-            out.dc = type_1.DONE;
-            return out;
-        }
-        const out = new ListVal_1.ListVal({ peg: [] }, ctx);
-        out.closed = list.closed;
-        out.optionalKeys = 0 < list.optionalKeys.length
-            ? [...list.optionalKeys] : list.optionalKeys;
-        out.site = list.site;
-        let done = true;
-        for (const key of listKeys) {
-            const child = list.peg[key];
-            const keyctx = ctx.descend(key);
-            const key_spread = spread.spreadClone(keyctx);
-            (0, utility_1.propagateMarks)(list, child);
-            out.peg[key] =
-                undefined === child ? key_spread :
-                    child.isNil ? child :
-                        key_spread.isNil ? key_spread :
-                            key_spread.isTop && child.done ? child :
-                                child.isTop && key_spread.done ? key_spread :
-                                    (0, unify_1.unite)(te ? keyctx.clone({ explain: (0, utility_1.ec)(te, 'SL:' + key) }) : keyctx, child, key_spread, 'spread-apply-list');
-            done = done && (type_1.DONE === out.peg[key]?.dc);
-        }
-        out.dc = done ? type_1.DONE : list.dc + 1;
-        (0, utility_1.propagateMarks)(list, out);
-        return out;
-    }
-    clone(ctx, spec) {
-        const out = new SpreadVal({
-            peg: this.peg.clone(ctx, spec),
-            ...(spec || {}),
-        }, ctx);
-        out.dc = this.done ? type_1.DONE : out.dc;
-        out.site = this.site;
-        return out;
-    }
-    spreadClone(ctx) {
-        if (!this.isPathDependent)
-            return this;
-        return this.clone(ctx);
-    }
-    get canon() {
-        // Use {&:...} for map spreads, [&:...] for list spreads, {&:X} for scalars
-        const pc = this.peg.canon;
-        if (this.peg.isMap)
-            return '{&:' + pc.slice(1, -1) + '}'; // {&:k:v,...}
-        if (this.peg.isList)
-            return '[&:' + pc.slice(1, -1) + ']'; // [&:v,...]
-        return '{&:' + pc + '}';
-    }
-    gen(_ctx) {
-        // Unresolved spread (never applied to a map/list) generates
-        // as undefined — the spread is a constraint, not a value.
-        return undefined;
-    }
-    inspection() {
-        return 'spread';
-    }
-}
-exports.SpreadVal = SpreadVal;
-//# sourceMappingURL=SpreadVal.js.map