aontu 0.62.0 → 0.64.0

package/src/val/AbnfFuncVal.ts

@@ -0,0 +1,181 @@
+/* Copyright (c) 2026 Richard Rodger, MIT License */
+
+// The grammar pair, ADR-033. Twin of go/abnf.go.
+
+import type { Val, ValSpec } from '../type'
+import { DONE } from '../type'
+import { AontuContext } from '../ctx'
+import { FuncBaseVal } from './FuncBaseVal'
+import { StringVal } from './StringVal'
+import { MapVal } from './MapVal'
+import { ListVal } from './ListVal'
+import { ConjunctVal } from './ConjunctVal'
+import { makeNilErr } from '../err'
+import { compileGrammar, parseWith } from '../grammar'
+
+
+class AbnfFuncVal extends FuncBaseVal {
+  isAbnfFunc = true
+
+  constructor(spec: ValSpec, ctx?: AontuContext) {
+    super(spec, ctx)
+  }
+
+  funcname() {
+    return 'abnf'
+  }
+
+  resolve(ctx: AontuContext, args: Val[]): Val {
+    const a: any = args[0]
+
+    // Not an arity check: the arity and signature gates run first, so
+    // what reaches here is a nil argument, which both pass over.
+    if ('string' !== typeof a?.peg) {
+      return this.place(makeNilErr(ctx, 'abnf_grammar', this, undefined,
+        'abnf'))
+    }
+
+    const [, why] = compileGrammar(a.peg)
+    if (undefined !== why) {
+      return this.place(makeNilErr(ctx, 'abnf_grammar', this, undefined,
+        'abnf', { reason: why }))
+    }
+
+    return this.place(new StringVal({ peg: a.peg }, ctx))
+  }
+}
+
+
+// A tree node is just the map {rule, src, kids}, so it needs no case of
+// its own. Keys are sorted so both ports build the same member order.
+function astVal(node: any, ctx: AontuContext): Val {
+  if ('string' === typeof node) {
+    return new StringVal({ peg: node }, ctx)
+  }
+
+  if (Array.isArray(node)) {
+    return new ListVal({
+      peg: node.map(
+        (e: any, i: number) => astVal(e, ctx.descend(String(i)))),
+    }, ctx)
+  }
+
+  const peg: Record<string, Val> = {}
+  for (const k of Object.keys(node).sort()) {
+    peg[k] = astVal(node[k], ctx.descend(k))
+  }
+  return new MapVal({ peg }, ctx)
+}
+
+
+class ParseFuncVal extends FuncBaseVal {
+  isParseFunc = true
+
+  constructor(spec: ValSpec, ctx?: AontuContext) {
+    super(spec, ctx)
+  }
+
+  funcname() {
+    return 'parse'
+  }
+
+
+  // Meets its peer instead of resolving, so it must see the peer
+  // before the base drives to resolve().
+  unify(peer: Val, ctx: AontuContext): Val {
+    if (1 !== this.peg.length) {
+      return super.unify(peer, ctx)
+    }
+
+    this.driveStagedArgs(ctx, 1)
+
+    const g: any = this.peg[0]
+    if ('string' !== typeof g?.peg) {
+      return this.residuate(peer, ctx)
+    }
+
+    // A settled constraint is stable, as a residual constraint atom is.
+    // Without this a `type()` holding one never resolves.
+    this.dc = DONE
+
+    const p: any = peer
+    if (true !== p?.isString || 'string' !== typeof p?.peg) {
+      return this.hold(peer, ctx)
+    }
+
+    const [grammar, why] = compileGrammar(g.peg)
+    if (undefined !== why) {
+      return makeNilErr(ctx, 'abnf_grammar', this, peer, 'parse',
+        { reason: why })
+    }
+    if ('' === p.peg) {
+      return makeNilErr(ctx, 'parse_failed', this, peer, 'parse',
+        { reason: 'the empty string parses under no grammar' })
+    }
+    const [, err] = parseWith(grammar, p.peg, ctx)
+    if (undefined !== err) {
+      return makeNilErr(ctx, 'parse_failed', this, peer, 'parse',
+        { reason: err })
+    }
+
+    return peer
+  }
+
+
+  // The stable twin of residuate: no `notdone()`, because a settled
+  // constraint stays done while it waits for a value.
+  hold(peer: Val, ctx: AontuContext): Val {
+    if (peer.isTop || peer.id === this.id) {
+      // Cloned, or a driver meeting it twice reports `unify_cycle`.
+      const out: Val = this.clone(ctx)
+      out.dc = DONE
+      return out
+    }
+
+    if (peer.isFunc
+      && (peer as any).funcname() === this.funcname()
+      && peer.path.join('.') === this.path.join('.')
+      && peer.canon === this.canon) {
+      return this
+    }
+
+    return new ConjunctVal({ peg: [this, peer] }, ctx)
+  }
+
+
+  resolve(ctx: AontuContext, args: Val[]): Val {
+    const g: any = args[0]
+    const v: any = args[1]
+
+    // Not an arity check: see the abnf twin above.
+    if ('string' !== typeof g?.peg || 'string' !== typeof v?.peg) {
+      return this.place(makeNilErr(ctx, 'parse_arg', this, undefined, 'parse'))
+    }
+
+    const [grammar, why] = compileGrammar(g.peg)
+    if (undefined !== why) {
+      return this.place(makeNilErr(ctx, 'abnf_grammar', this, undefined,
+        'parse', { reason: why }))
+    }
+
+    // The host answers an empty tree for empty input.
+    if ('' === v.peg) {
+      return this.place(makeNilErr(ctx, 'parse_failed', this, undefined,
+        'parse', { reason: 'the empty string parses under no grammar' }))
+    }
+
+    const [node, err] = parseWith(grammar, v.peg, ctx)
+    if (undefined !== err) {
+      return this.place(makeNilErr(ctx, 'parse_failed', this, undefined,
+        'parse', { reason: err }))
+    }
+
+    return this.place(astVal(node, ctx))
+  }
+} /* node:coverage ignore next 6 */
+
+
+export {
+  AbnfFuncVal,
+  ParseFuncVal,
+}

package/src/val/AbsentVal.ts

@@ -0,0 +1,54 @@
+/* Copyright (c) 2026 Richard Rodger, MIT License */
+
+
+import type {
+  Val,
+  ValSpec,
+} from '../type'
+
+import {
+  DONE,
+} from '../type'
+
+import {
+  AontuContext,
+} from '../ctx'
+
+import { FeatureVal } from './FeatureVal'
+
+
+// Top with one difference (ADR-034): absence is GENERABLE, and
+// generates nothing, so a bag drops it at a required key too.
+class AbsentVal extends FeatureVal {
+  isAbsent = true
+
+  constructor(
+    spec: ValSpec,
+    ctx?: AontuContext
+  ) {
+    super(spec, ctx)
+    this.dc = DONE
+    this.mark.type = false
+    this.mark.hide = false
+  }
+
+  // The unit of the meet, called for EITHER operand so `&` commutes.
+  // Nothing here meets an absence with TOP, so there is no top arm;
+  // Go has one because it MEETS an op's result where this port places
+  // it. edge-plus-list-absent guards the day that changes.
+  unify(peer: Val, _ctx: AontuContext): Val {
+    return peer
+  }
+
+  get canon() { return 'maybe()' }
+
+  gen(_ctx?: AontuContext) {
+    return undefined
+  }
+
+} /* node:coverage ignore next 6 */
+
+
+export {
+  AbsentVal,
+}

package/src/val/AggFuncVal.ts

@@ -1,47 +1,5 @@
 /* Copyright (c) 2025 Richard Rodger, MIT License */
 
-// AGGREGATION, PROJECTION AND THE STRING FOLD: `sum(d)`, `least(d)`,
-// `greatest(d)`, `pick(d, k)` and `join(d, sep?)`.
-//
-// The review's finding I: "No aggregation. `length()` counts but
-// nothing sums: an invoice total, a fleet-wide resource budget, a quota
-// roll-up -- all inexpressible." Use case 10 had to write totals by
-// hand and spot-check them with `must()`, which is a model asserting
-// what it should be able to COMPUTE.
-//
-//   total:   sum($.lines)                 # an invoice total
-//   cheapest: least($.quotes)             # ... and the extremes
-//   peak:    greatest($.hourly)
-//
-// A FOLD OVER A FINITE, SETTLED BAG IS AS TOTAL AS `each`. There is no
-// recursion here and no user-supplied step: the bag is the one the
-// model already holds, the operation is fixed, and the walk visits each
-// child exactly once. That is the whole reason these are built-ins
-// rather than a `fold` combinator -- a fold takes a function, and a
-// language with no user functions has none to take.
-//
-// THE NAMES ARE `least` AND `greatest`, NOT `min` AND `max`, because
-// those two are already the constraint atoms for a LOWER and UPPER
-// BOUND (`min(3)` means "at least 3"). An aggregate over a bag and a
-// bound on a value are different things and must not share a spelling;
-// least and greatest are the lattice's own words for the extremes of a
-// set, which is exactly what these compute.
-//
-// `sum` FOLDS WITH `add`, so the number tower's whole law comes with it
-// (arith.ts): the exact ladder, R5 contagion, the refusal to mix a
-// binary float with an exact leaf, and the refusal to store a result
-// that will not fit. A bag of integers sums to an integer; one integer
-// float among them makes the total a float; `0d` operands keep it
-// exact. And `sum([])` is `0` -- addition has an identity, which is
-// what makes the empty case answerable.
-//
-// `least`/`greatest` have NO identity to answer an empty bag with: the
-// least element of nothing is not a value, it is a question with no
-// answer, so an empty bag is a located `aggregate_empty` rather than an
-// invented zero or infinity. They compare with the tower's EXACT
-// comparator (numcmp), so an integer and a bigdecimal in one bag order
-// correctly rather than through binary64, and the winner is returned
-// with its own kind intact.
 
 import type {
   Val,
@@ -59,6 +17,7 @@ import { StringVal } from './StringVal'
 import { FuncBaseVal } from './FuncBaseVal'
 import { arith } from './arith'
 import { cmpNumeric } from './numcmp'
+import { cmpCodePoint } from '../keyorder'
 import { memberVals } from './members'
 import { plusText } from './PlusOpVal'
 
@@ -66,12 +25,6 @@ import { plusText } from './PlusOpVal'
 type AggOp = 'sum' | 'least' | 'greatest'
 
 
-// The children of a bag, in the order the aggregate sees them: source
-// order for a list, sorted-key order for a map -- `each`'s order, and
-// for the same reason (a map has no order of its own, so the language
-// picks one and states it).
-// The members of the bag a fold reads: what generation would emit
-// (./members.ts, BUGS.md §79), in the one map-key order (BUGS.md §62).
 function bagChildren(data: any, ctx: AontuContext): Val[] | undefined {
   return memberVals(data, ctx)
 }
@@ -80,9 +33,6 @@ function bagChildren(data: any, ctx: AontuContext): Val[] | undefined {
 class AggFuncVal extends FuncBaseVal {
   isAggFunc = true
 
-  // THE STAGING RULE (G8 phase 0). A total over a bag that is still
-  // being merged into is a total of the wrong bag -- the same reason
-  // `filter` and `each` wait.
   staged = true
 
   op: AggOp
@@ -97,21 +47,11 @@ class AggFuncVal extends FuncBaseVal {
   }
 
 
-  // NO `make` OVERRIDE, matching the other STAGED funcs (pack, each,
-  // filter, match): a staged call returns `residuate` before `unify`
-  // ever reaches the rebuild branch, so an override there would be
-  // unreachable code pretending to be a contract. The base's `make`
-  // raises `func:<name>` if that ever stops being true, which is the
-  // loud answer rather than a value that silently lost its operation.
-
   funcname() {
     return this.op
   }
 
 
-  // The base does not drive the argument: `unify` drives it by hand,
-  // because a staged func must advance what it is waiting on every
-  // pass rather than only on the pass it fires.
   prepare(_ctx: AontuContext, _args: Val[]) {
     return null
   }
@@ -137,9 +77,6 @@ class AggFuncVal extends FuncBaseVal {
     }
 
     if ('sum' === this.op) {
-      // Zero is addition's identity, so an empty bag has an answer and
-      // it is an integer -- the narrowest kind, which the first real
-      // operand then widens under R5 exactly as `add(0, x)` would.
       let total: Val = new IntegerVal({ peg: 0 })
       for (const child of children) {
         total = arith(ctx, 'add', this, total, child, this.op)
@@ -192,28 +129,6 @@ function unpref(v: any): any {
 }
 
 
-// PROJECTION: `pick(d, k)` -- one element per child of `d`, being that
-// child's `k`.
-//
-// The other half of the review's finding I: "`_.field` is unspellable,
-// `filter` cannot see into lists, `unique()`-by-field is reserved but
-// absent -- so 'no two services share a port' and 'unique event ids'
-// cannot be said." Without it the aggregates above cannot reach the
-// case that motivated them, because `sum` needs a bag of NUMBERS and a
-// model holds a bag of RECORDS:
-//
-//   total: sum(pick($.lines, amountCents))
-//
-// IT IS NOT `each` WITH A CLEVER TEMPLATE. `each(d, _ & t)` MEETS each
-// child with `t`, and a meet cannot select: `each($.lines, _ & _.amount)`
-// asks for a child that is simultaneously the whole record and one of
-// its fields, which is why every spelling of it answers `no_path`.
-// Selection is a different operation and gets its own verb.
-//
-// A CHILD MISSING THE KEY IS AN ERROR, not a silently shorter list.
-// Skipping would make `sum(pick(...))` quietly total the wrong set of
-// records -- the failure mode an aggregate exists to prevent -- so the
-// refusal names the child (`pick_key`).
 class PickFuncVal extends FuncBaseVal {
   isPickFunc = true
 
@@ -293,56 +208,159 @@ class PickFuncVal extends FuncBaseVal {
 }
 
 
+// `pick`'s rule, plus: the empty string is the member itself, which is
+// how a keyless descending sort is spelled.
+function projectorName(key: any): [string, boolean] {
+  if (null == key || null == key.peg) {
+    return ['', true]
+  }
+  if ('string' === typeof key.peg) {
+    return [key.peg, true]
+  }
+  if ('number' === typeof key.peg && key.isInteger) {
+    return [String(key.peg), true]
+  }
+  return ['', false]
+}
+
+
+function fieldOf(child: any, name: string): Val | undefined {
+  return true === child?.isMap ? child.peg[name] :
+    true === child?.isList ? child.peg[Number(name)] :
+      undefined
+}
+
+
+const SORT_DIRECTIONS: Record<string, number> = { asc: 1, desc: -1 }
+
+
+function directionOf(v: any): number | undefined {
+  if (null == v || null == v.peg) {
+    return 1
+  }
+  return 'string' === typeof v.peg ? SORT_DIRECTIONS[v.peg] : undefined
+}
+
+
+// Text by code point, numbers by the exact comparator, nothing else.
+function sortDomain(u: any): 'text' | 'number' | undefined {
+  if (true !== u?.isVal || true !== u.isScalar || true === u.isNull) {
+    return undefined
+  }
+  if ('string' === typeof u.peg) {
+    return 'text'
+  }
+  return 'boolean' === typeof u.peg ? undefined : 'number'
+}
+
+
+type SortRow = { idx: number, val: Val, key: any }
+
+
+class SortFuncVal extends FuncBaseVal {
+  isSortFunc = true
+
+  // The bag must settle before it is ordered, exactly as it must
+  // before it is projected.
+  staged = true
+
+  constructor(
+    spec: ValSpec,
+    ctx?: AontuContext
+  ) {
+    super(spec, ctx)
+  }
+
+
+  funcname() {
+    return 'sort'
+  }
+
+
+  // The base drives no argument: the DATA is driven by hand below, and
+  // the projector is a bare word the parser has already made a string.
+  prepare(_ctx: AontuContext, _args: Val[]) {
+    return null
+  }
+
+
+  unify(peer: Val, ctx: AontuContext): Val {
+    const ready = this.driveStagedArgs(ctx, 1)
+
+    if (!ready || !ctx.settle) {
+      return this.residuate(peer, ctx)
+    }
+
+    return super.unify(peer, ctx)
+  }
+
+
+  resolve(ctx: AontuContext, args: Val[]) {
+    const children = bagChildren(args?.[0], ctx)
+
+    if (undefined === children) {
+      return this.place(makeNilErr(ctx, 'aggregate_data', this, undefined,
+        'sort'))
+    }
+
+    const [name, nameok] = projectorName(args?.[1])
+
+    if (!nameok) {
+      return this.place(makeNilErr(ctx, 'invalid-arg', this, undefined,
+        'sort'))
+    }
+
+    const dir = directionOf(args?.[2])
+
+    if (undefined === dir) {
+      return this.place(makeNilErr(ctx, 'sort_dir', this, undefined, 'sort',
+        { dir: (args[2] as any).canon }))
+    }
+
+    const rows: SortRow[] = []
+    let domain: 'text' | 'number' | undefined = undefined
+
+    for (const child of children) {
+      const at: any = '' === name ? child : fieldOf(child, name)
+
+      if (null == at) {
+        return this.place(makeNilErr(ctx, 'sort_key', this, undefined, 'sort',
+          { key: name }))
+      }
+
+      const u = unpref(at)
+      const found = sortDomain(u)
+
+      if (undefined === found ||
+        (undefined !== domain && found !== domain)) {
+        return this.place(makeNilErr(ctx, 'sort_domain', this, undefined,
+          'sort', { member: u.canon }))
+      }
+
+      domain = found
+      rows.push({ idx: rows.length, val: child, key: u })
+    }
+
+    // The source index breaks every tie, so the order is TOTAL and
+    // neither port's sort algorithm can reorder equals.
+    rows.sort((a, b) => {
+      const c = 'text' === domain ?
+        cmpCodePoint(a.key.peg as string, b.key.peg as string) :
+        cmpNumeric(a.key, b.key)
+      return 0 === c ? a.idx - b.idx : dir * c
+    })
+
+    const peg: Val[] = rows.map(
+      (r, i) => r.val.clone(ctx.descend(String(i))))
+
+    return this.place(new ListVal({ peg }, ctx))
+  }
+}
+
 
-// THE FOLD TO A STRING: `join(coll, sep?)` -- G9 phase 2.
-//
-// The one primitive between a model and a generated file. A spread can
-// put a separator AFTER each element; putting one BETWEEN N elements is
-// a reduction over strings, and the language had none: `sum` is numeric,
-// `+` does not reduce a list, and indexed concatenation needs the arity
-// known in advance. So a generated SQL column list carried a trailing
-// comma and did not parse (use-cases/15-code-generation).
-//
-// IT FOLDS WITH `+` SEEDED WITH `""`, exactly as `sum` folds with `add`
-// seeded with `0`. That is not a figure of speech: the members are
-// rendered by `plusText`, which IS the function `+`'s string branch
-// calls, so the language keeps exactly one answer to "how does a number
-// become text" and the two cannot drift. `join(coll)` is therefore
-// concatenation and no `concat` is needed; `join(coll, "\n")` is lines
-// and no `lines` is needed. ONE BUILTIN, NOT A FAMILY.
-//
-// `split`/`words` is the inverse -- an input-PARSING operation with no
-// generation use -- and is deliberately absent.
-//
-// EMPTY IS `""`, concatenation's identity, the exact parallel of
-// `sum([]) == 0` and the opposite of `least([])`: a fold with an
-// identity can answer the empty bag, and one without has to refuse it.
-//
-// MEMBERS ARE VALIDATED BEFORE THE FOLD, which is the whole reason this
-// is not three lines. `+` with a string on the left RESIDUATES on a
-// container or a null rather than refusing (`"" + {b:1}` and `"x" +
-// null` both reach generation as `mapval_no_gen`), so folding blindly
-// would turn a bad member into a useless late error pointing at the
-// wrong thing. The three verdicts below are that check.
 type MemberVerdict = 'text' | 'never' | 'notyet'
 
 
-// Which of the three a value is.
-//
-// `text` -- `+` would take it, so the fold can.
-//
-// `never` -- a SETTLED value that will never become text: a map, a
-// list, a null. This is `join_member`, class `conflict`, and it names
-// the member rather than the call, because "one of these is not a
-// string" is only actionable if you are told which.
-//
-// `notyet` -- an unresolved kind, a top, a stable residue. NOT a join
-// failure at all: the call stays residual and generation reports
-// `mapval_no_gen`, class `incomplete`, exactly as docs/trust.md
-// requires ("a stable residue ... is ordinary incompleteness"). Getting
-// this split wrong in either direction is the defect that matters here:
-// refusing a residue makes `join` unusable inside a schema, and
-// deferring on a map makes a real error arrive as a shrug.
 function memberVerdict(v: any): MemberVerdict {
   const u = unpref(v)
   if (undefined !== plusText(u)) {
@@ -355,15 +373,6 @@ function memberVerdict(v: any): MemberVerdict {
 }
 
 
-// The separator is a STRING or it is nothing.
-//
-// A number would render perfectly well through `+`, and is still
-// refused: the separator is not a member of the fold, it is the
-// parameter naming the text between members, and `join(x, 5)` is far
-// likelier a mistake than an intent to separate with "5". `pick`'s key
-// argument draws the same line for the same reason. This is the
-// direction that can be loosened later without breaking a document;
-// the other direction cannot.
 function sepVerdict(v: any): MemberVerdict {
   const u = unpref(v)
   if (u?.isVal && u.isScalar) {
@@ -391,22 +400,6 @@ class JoinFuncVal extends FuncBaseVal {
   }
 
 
-  // A `make` OVERRIDE, WHERE ITS AggFuncVal SIBLINGS HAVE NONE, and the
-  // difference is worth stating because it is not arbitrary. `sum`,
-  // `pick` and the rest are staged and nothing more: they residuate
-  // before `unify` reaches the rebuild branch, so a `make` there would
-  // be unreachable code pretending to be a contract, and the base's
-  // `func:<name>` refusal is the loud answer if that ever changes.
-  //
-  // `join` is the first builtin that is BOTH staged AND defers its
-  // resolution (see `deferResolve`). A deferred call has settled
-  // arguments, so it does reach the rebuild branch, and without this it
-  // raised `func:join` on the first document with an unresolved member
-  // — where the Go port residuated and reported `mapval_no_gen`.
-  // Opposite answers on `join($.m, ",")` with `m: [string]`, caught by
-  // running both engines rather than by either test suite. `super` and
-  // bare `id`, the two other deferring calls, each carry the same
-  // override for the same reason.
   make(_ctx: AontuContext, spec: ValSpec): Val {
     return new JoinFuncVal(spec)
   }
@@ -426,10 +419,6 @@ class JoinFuncVal extends FuncBaseVal {
 
 
   unify(peer: Val, ctx: AontuContext): Val {
-    // BOTH arguments, unlike `pick`, which drives only its bag: `pick`'s
-    // key is a bare word the parser has already made a string, while a
-    // separator is an ordinary expression and `join($.rows, $.sep)` has
-    // to wait for it.
     const ready = this.driveStagedArgs(ctx, 2)
 
     if (!ready || !ctx.settle) {
@@ -440,10 +429,6 @@ class JoinFuncVal extends FuncBaseVal {
   }
 
 
-  // The `notyet` half of the verdict, taken before `resolve` runs: with
-  // arguments settled but a member still a kind, the call rides the
-  // ordinary args-not-done path and residuates, which is what makes an
-  // unresolved member ordinary incompleteness rather than a refusal.
   deferResolve(ctx: AontuContext, args?: Val[]): boolean {
     const children = bagChildren(args?.[0], ctx)
     if (undefined === children) {
@@ -467,28 +452,11 @@ class JoinFuncVal extends FuncBaseVal {
         'join'))
     }
 
-    // Arity is [1,2], so a second argument is present or the separator
-    // is the empty string -- which makes `join(coll)` concatenation.
-    // The separator's SHAPE is settled before resolve runs: the
-    // signature gate refuses every concrete non-string
-    // (docs/design/SIGNATURES.0.md; join(d: map|list, sep?: string)),
-    // and deferResolve holds the call while sepVerdict answers notyet
-    // -- so a present separator here is text.
     let sep = ''
     if (1 < args.length) {
       sep = unpref(args[1]).peg
     }
 
-    // NO NIL-MEMBER GUARD, WHERE `sum` HAS ONE, and the difference is
-    // the fold's shape rather than an oversight. `sum` folds with
-    // `arith`, which MINTS a nil part-way through — a non-numeric child
-    // or an overflow — so it has to stop and return it. `join` folds
-    // already-unified values, and a nil among a list's elements
-    // collapses the list before this call resolves: `join([least([])],
-    // ",")` reports `aggregate_empty` at the member's own path,
-    // `$.o.0`, and never reaches here. A guard was written, the
-    // ADR-002 gate found it unexecuted, and probing confirmed no
-    // spelling reaches it, so it is removed rather than excused.
     const parts: string[] = []
     for (const child of children) {
       const u: any = unpref(child)
@@ -500,16 +468,11 @@ class JoinFuncVal extends FuncBaseVal {
       parts.push(text)
     }
 
-    // Every part is already a string, so this IS the `+` fold seeded
-    // with `""` -- written as one concatenation because a loop of `+`
-    // over settled strings cannot differ from it, and because the Go
-    // twin's strings.Join must produce the same bytes.
     return this.place(new StringVal({ peg: parts.join(sep) }))
   }
 }
 
 
-// The three the registry names. Each is its operation and nothing else.
 class SumFuncVal extends AggFuncVal {
   constructor(spec: ValSpec, ctx?: AontuContext) { super(spec, ctx, 'sum') }
 }
@@ -522,13 +485,14 @@ class GreatestFuncVal extends AggFuncVal {
   constructor(spec: ValSpec, ctx?: AontuContext) {
     super(spec, ctx, 'greatest')
   }
-} /* node:coverage ignore next 10 */
+} /* node:coverage ignore next 11 */
 
 
 export {
   AggFuncVal,
   JoinFuncVal,
   PickFuncVal,
+  SortFuncVal,
   SumFuncVal,
   LeastFuncVal,
   GreatestFuncVal,