@mark1russell7/coeval 0.3.0 → 0.3.2

package/build/index.d.ts

@@ -348,10 +348,14 @@ type Alias = {
 };
 /** One entry of the world: a kind, a namespace, or an alias. */
 type WorldEntry = Kind | Namespace | Alias;
-/** A world holds the kinds and the defaults that answer the questions. */
+/**
+ * A world holds the kinds and the defaults that answer the questions. `fallback` is the kind of each first key that
+ * the world does not have. A world with a fallback is open: each path that starts with an unknown key names a kind.
+ */
 interface World {
   readonly kinds: Readonly<Record<string, WorldEntry>>;
   readonly defaults: Readonly<Record<string, string>>;
+  readonly fallback?: Kind;
 }
 /** The result of a lookup of a type in the world. */
 type Lookup = {
@@ -388,7 +392,8 @@ export declare function isNamespace(entry: WorldEntry | undefined): entry is Nam
 /**
  * This function finds the kind that a type names. It walks the path from the root of the world, one key at a
  * time. An alias on the way is followed until a kind answers (collapse). A cycle of aliases stops the lookup. In a
- * namespace with a fallback, a key that the namespace does not have gets the fallback kind.
+ * namespace with a fallback, a key that the namespace does not have gets the fallback kind. In an open world, a first
+ * key that the world does not have gets the fallback kind of the world.
  *
  * @param world - The world.
  * @param type - The reference to the type.
@@ -904,12 +909,21 @@ interface Runtime {
    * This function drives several steps at the same time. When one waits, the others go on.
    *
    * @param list - One function for each item. Each function starts the steps of its item.
-   * @param options - The most items that run at the same time. The default is each item.
+   * @param options - The most items that run at the same time, and the stop at the first failure.
    * @returns The steps that give each result, in the order of the list.
    */
-  all(list: readonly (() => Steps)[], options?: {
-    readonly concurrency?: number;
-  }): Generator<Promise<unknown>, readonly Result[], unknown>;
+  all(list: readonly (() => Steps)[], options?: AllOptions): Generator<Promise<unknown>, readonly Result[], unknown>;
+}
+/**
+ * The options of a drive of parts at the same time.
+ *
+ * - `concurrency`: the most parts that run at the same time. The default is each part.
+ * - `failFast`: `true` stops at the first part that fails. The parts that did not start do not start, the parts that
+ *   run stop at their wait, and the results come at once. Each part without a result gives `#ABORT`.
+ */
+interface AllOptions {
+  readonly concurrency?: number;
+  readonly failFast?: boolean;
 }
 /** Compiled code: the evaluation of a document in a context. */
 type Code = (ctx: Context, rt: Runtime) => Result;
@@ -944,6 +958,14 @@ interface CompileInput {
   /** The keys from the root document to this document. */
   readonly place: readonly Key[];
   readonly machine: Machine;
+  /**
+   * This function gives the value of the document with an item in the place of each part. The containers on the way
+   * to a part are new. The data around the parts stays the same objects.
+   *
+   * @param items - One item for each part, in the order of `parts`, for example the results of the parts.
+   * @returns The value with the items.
+   */
+  fill(items: readonly unknown[]): unknown;
 }
 /**
  * A sealed part. An evaluator can read the binding name of a part and evaluate it. It cannot read the value of the
@@ -998,6 +1020,14 @@ interface EvalInput {
    * @returns The payload, or the error `#CAP!`.
    */
   effect(kind: Cap, payload: unknown): Result;
+  /**
+   * This function gives the value of the document with an item in the place of each part, for example the result of
+   * each part. The containers on the way to a part are new. The data around the parts stays the same objects.
+   *
+   * @param items - One item for each part, in the order of `parts`.
+   * @returns The value with the items.
+   */
+  fill(items: readonly unknown[]): unknown;
 }
 /** A part for a runner. Its evaluation can wait for the effects in it. */
 interface RunPart {
@@ -1037,15 +1067,22 @@ interface RunInput {
    */
   effect(kind: Cap, payload: unknown): Steps;
   /**
-   * This function evaluates parts at the same time. Take the results with `yield*`.
+   * This function evaluates parts at the same time. Take the results with `yield*`. A runner can give its own parts,
+   * for example a part with a different context: each part needs only the function `evaluate`.
    *
    * @param parts - The parts.
-   * @param options - The most parts that run at the same time.
+   * @param options - The most parts that run at the same time, and the stop at the first failure.
    * @returns The steps that give each result, in the order of the parts.
    */
-  all(parts: readonly RunPart[], options?: {
-    readonly concurrency?: number;
-  }): Generator<Promise<unknown>, readonly Result[], unknown>;
+  all(parts: readonly RunPart[], options?: AllOptions): Generator<Promise<unknown>, readonly Result[], unknown>;
+  /**
+   * This function gives the value of the document with an item in the place of each part, for example the result of
+   * each part. The containers on the way to a part are new. The data around the parts stays the same objects.
+   *
+   * @param items - One item for each part, in the order of `parts`.
+   * @returns The value with the items.
+   */
+  fill(items: readonly unknown[]): unknown;
 }
 /** An evaluator that is a function of its input. The kernel calls it for each evaluation. */
 type EvalFn = (input: EvalInput) => Result;
@@ -1600,5 +1637,5 @@ export declare function formulaEvaluators(profile?: FormulaProfile): Readonly<Re
  */
 export declare function formulaMachine(profile?: FormulaProfile, more?: Partial<Machine>): Machine;
 //#endregion
-export type { Alias, Answer, AskOptions, Cap, CheckOptions, Classification, Closure, Code, CompileInput, CompiledEvaluator, CompiledPart, CompiledRunner, Construct, Context, Part as ContextPart, DerefCode, DocVisit, Edge, Effect, Envelope, ErrorCode, EvalError, EvalFn, EvalInput, EvalOptions, Evaluator, ExtFn, Failed, FormulaProfile, Give, Header, Hop, HopBy, HostThing, Issue, Json, JsonRecord, KernelCode, Key, Kind, KindSource, LazyOp, Lookup, Machine, NamesSource, Namespace, Navigator, NearestOptions, OpFn, OrderProblem, Outcome, Part$1 as Part, PartInfo, Shape as PartShape, PartSlot, PartsSpec, Perform, Plan, PrepareOptions, RefUse, Resolution, ResolveCode, ResolveOptions, Result, Root, Run, RunCode, RunFn, RunInput, RunOptions, RunPart, Rung, Runner, Runtime, ScopeRule, Shape$1 as Shape, Side, Split, Step, StepSpec, Steps, StopSignal, Stored, Thing, TraceNode, TypeRef, Use, WalkInput, WalkOptions, WalkProblem, WalkResult, Walker, World, WorldEntry };
+export type { Alias, AllOptions, Answer, AskOptions, Cap, CheckOptions, Classification, Closure, Code, CompileInput, CompiledEvaluator, CompiledPart, CompiledRunner, Construct, Context, Part as ContextPart, DerefCode, DocVisit, Edge, Effect, Envelope, ErrorCode, EvalError, EvalFn, EvalInput, EvalOptions, Evaluator, ExtFn, Failed, FormulaProfile, Give, Header, Hop, HopBy, HostThing, Issue, Json, JsonRecord, KernelCode, Key, Kind, KindSource, LazyOp, Lookup, Machine, NamesSource, Namespace, Navigator, NearestOptions, OpFn, OrderProblem, Outcome, Part$1 as Part, PartInfo, Shape as PartShape, PartSlot, PartsSpec, Perform, Plan, PrepareOptions, RefUse, Resolution, ResolveCode, ResolveOptions, Result, Root, Run, RunCode, RunFn, RunInput, RunOptions, RunPart, Rung, Runner, Runtime, ScopeRule, Shape$1 as Shape, Side, Split, Step, StepSpec, Steps, StopSignal, Stored, Thing, TraceNode, TypeRef, Use, WalkInput, WalkOptions, WalkProblem, WalkResult, Walker, World, WorldEntry };
 //# sourceMappingURL=index.d.ts.map

package/build/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","names":["Shape","Part"],"sources":["../src/doc.ts","../src/errors.ts","../src/world.ts","../src/ladder.ts","../src/deref.ts","../src/classify.ts","../src/parts.ts","../src/evaluate.ts","../src/stdlib.ts","../src/order.ts","../src/context.ts","../src/static.ts","../src/formula.ts"],"mappings":";;KACY,mDAAmD;YAAmC,cAAA;;;KAGtF;YAAuC,cAAA;;;KAGvC;;;;;;;;;;;KAYA,4BAA4B;WAAmB;WAAsB,gBAAgB;;;;;;KAMrF;;WAED,MAAM;;WAEN,OAAO;;WAEP;;WAEA,MAAM,SAAS;;;qBAIb;;;;;;;;wBASG,SAAS,iBAAiB,SAAS;;;;;;;;wBAanC,MAAM,QAAQ,YAAY,cAAc;;;;;;;wBAUxC,MAAM,iBAAiB,SAAS;;;;;;;;wBAWhC,UAAU,iBAAiB,SAAS;;;;;;;wBAcpC,SAAS,MAAM,mBAAmB;;;;;;;wBAalC,SAAS,MAAM;;;;;;;;;wBAoBf,WAAW,iBAAiB,SAAS,aAAa;;UAOjD;WACN,UAAU;;WAEV,QAAQ,SAAS,eAAe;;;;;;;;;;wBAW3B,OAAO,gBAAgB,4BAA4B;;;;;;;;;wBAqBnD,MAAM,MAAM,SAAS,OAAO,MAAM;WAAmB;WAAwB,MAAM;IAAgC;;;;;;;wBAUnH,OAAO,eAAe,SAAS;;;;;;;wBAU/B,OAAO,KAAK,WAAW;;;;;;;wBAevB,SAAS,iBAAiB;;;;;;;;;;wBAuB1B,UAAU,YAAY;;;;KChO1B;;KAkBA,YAAY;;;;;;;UAQP;WACN,MAAM;WACN;WACA,iBAAiB;WACjB;;;KAIC,OAAO;WAA0B;WAAmB,OAAO;;WAAiB;WAAoB,OAAO;;;KAGvG;WAAoB;WAAoB,OAAO;;;;;;;;wBAQ3C,GAAG,GAAG,OAAO,IAAI,OAAO;;;;;;;;;wBAYxB,KAAK,MAAM,WAAW,gBAAgB;WAAiB,iBAAiB;WAAgB;IAAyB;;;;;;;;;wBAejH,OAAO,GAAG,QAAQ,OAAO,IAAI,gBAAgB,QAAQ,OAAO;;;;;qBAS/D,gBAAgB;WAClB,OAAO;;;;;;EAOhB,YAAY,OAAO;;;;;;;;wBAaL,gBAAgB;;;;;;;;;wBAYhB,OAAO,gBAAgB,cAAc;;;;;;;wBAgBrC,SAAS;;;;KClIb;;;;;;;;;;;;;KAcA;WACG;;WACA;WAAwB;;WACxB;WAAwB;WAAsB,OAAO;;WACrD;WAAuB;WAAsB,OAAO;;WAEpD;WACA,4BAA4B,SAAS,eAAe;WACpD;WACA;WACA,OAAO;;WAEP;WAAwB;;;KAG3B,YAAY;;;;;;;;;;KAWZ;WACG;;WACA,iBAAiB;;WACjB,iBAAiB;;WACjB,iBAAiB;WAAgB;;WACjC;;;;;;UAME;WACN,OAAO;;WAEP,uBAAuB;;WAEvB;;;UAIM;WACN,OAAO,SAAS;;WAEhB,QAAQ;;WAER,iBAAiB;;WAEjB,OAAO;;;;;WAKP;;WAEA;;;UAIM;WACN,OAAO,SAAS,eAAe;WAC/B,WAAW;;;KAIV;WAAmB;WAAsB,gBAAgB;;;KAGzD,aAAa,OAAO,YAAY;;UAG3B;WACN,OAAO,SAAS,eAAe;WAC/B,UAAU,SAAS;;;KAIlB;WACG;WAAmB,MAAM;WAAe,eAAe;WAAgB;;WACvE;WAAoB;WAAkE,eAAe;;;;;;;;wBAQpG,OAAO,OAAO,yBAAyB,SAAS;;;;;;;wBAUhD,QAAQ,OAAO,yBAAyB,SAAS;;;;;;;wBAUjD,YAAY,OAAO,yBAAyB,SAAS;;;;;;;;;;wBAkBrD,WAAW,OAAO,OAAO,MAAM,UAAU;;;;;;;;wBA+CzC,cAAc,SAAS,SAAS,eAAe,eAAe;;;;;;;;wBA2B9D,aAAa,cAAc,MAAM,OAAO;;;;;;;wBAaxC,cAAc;;;;qBCpOjB;;KAGD,eAAe;;KAGf;;;;;;;;;KAUA;;UAGK;WACN,MAAM;WACN,SAAS;;WAET;;WAEA;;WAEA,SAAS;;;UAIH;WACN;;WAEA;;WAEA,OAAO;;WAEP;WACA,gBAAgB;;;;;;UAOV;WACN,OAAO;WACP,MAAM,SAAS;;;UAIT;;WAEN;;;;;;;;;;wBAeK,OAAO,OAAO,OAAO,MAAM,UAAU;;;;;;;;wBAYrC,UAAU,OAAO,OAAO,MAAM,UAAU;;;;;;;;;;;;;;wBAiBxC,IAAI,OAAO,OAAO,KAAK,QAAQ,cAAc,UAAS,aAAkB;;;;;;;qBCjG3E;;;;;UAMI;YACL;;WAED;;;;;;;EAOT,MAAM,KAAK,MAAM;;;;;;EAMjB;;;;;;;;EAQA,SAAS,eAAe;aAAmB,OAAO;;;;KAIxC;;;;;;;wBAQI,YAAY,iBAAiB,SAAS;;qBAKzC;;KAGD,eAAe;;;;;KAMf,wBAAwB;;;;;;;;;;UAWnB;WACN,MAAM;WACN,OAAO,SAAS;WAChB,OAAO;WACP,OAAO;WACP,eAAe;;;KAId,aAAa,KAAK,UAAU,KAAK,QAAQ;;KAGzC;WAAwB;WAAmB,OAAO;;WAAqB;WAAoB;;;UAGtF;;WAEN,MAAM;;WAEN,MAAM;WACN,SAAS;;;;;;;;EAQlB,MAAM,OAAO,OAAO,KAAK,MAAM;;;KAIrB,UAAU,OAAO,cAAc;;;;;;;;;;UAW1B;WACN,OAAO;WACP,SAAS,SAAS,eAAe;WACjC,UAAU,SAAS,eAAe;WAClC;WACA,iBAAiB;WACjB,SAAS,mBAAmB;;;KAI3B;;UAGK;WACN,MAAM;WACN,OAAO;WACP,IAAI;;;KAIH;;KAGA;WACG;WAAmB,OAAO;WAAgB,eAAe;;WACzD;WAAoB,MAAM;WAAsB;WAAyB,eAAe;;;UAGtF;;WAEN;;;;;;;;;;;;wBA+BK,UAAU,KAAK,WAAW,OAAO,OAAO,KAAK;WAAiB,OAAO;WAAgB,IAAI;;;;;;;;wBAkCzF,MAAM,iBAAiB,SAAS;WAAsB,gBAAgB;;;;;;;;;;wBAgBtE,WAAW,OAAO,QAAQ;;;;;;;wBAe1B,QAAQ,QAAO,QAAQ,WAAgB;;;;;;;;;;;;;;;;;;;;;;;wBAqFvC,QAAQ,KAAK,WAAW,KAAK,SAAS,0BAA0B,UAAS,iBAAsB;;;;;;;wBA8F/F,aAAa,OAAO;;;;UCnanBA;WACN;WACA;WACA;;;UAIM;;WAEN;;WAEA;;WAEA;;;;;;;;;;;;wBAiBK,SAAS,iBAAiBA,WAAS,OAAO,OAAO;;;;;;;;wBAkBjD,IAAI,OAAO,MAAM,eAAe;;;;UC/C/B;;WAEN,eAAe;;WAEf;WACA,MAAM;WACN;;;KAUC;WAEG;;WAEA,gBAAgB;;WAEhB,MAAM;;;;;;;EAOf,KAAK,GAAG,kBAAkB;;WAEjB;WAAoB;WAAyB,aAAa;;;;;;;;;;wBAyBzD,WAAW,OAAO,mBAAmB,OAAO,OAAO;;;;;;;;;wBAwFnD,YAAY,eAAe,OAAO,kBAAkB;;;;;;;;;;;;wBCrHpD,YAAY,QAAO,SAAS,0BAA+B,gBAAe,OAAY,OAAM,QAAe;;;;;;;wBAU3G,QAAQ,MAAM;;;;;;;;;;wBAad,QAAQ,eAAe,OAAO,MAAM;;;;;;;;;wBAgBpC,OAAO,QAAQ,SAAS,MAAM,UAAU;;;;;;KAW5C,QAAQ,UAAU,kBAAkB;;UAG/B;WACN;;WAEA;;WAEA,eAAe;WACf;;WAEA;;WAEA;;WAEA,gBAAgB;;WAEhB,SAAS;;;KAIR,WAAW,QAAQ;;;;;UAMd;WACN,SAAS;;WAET;;;;;;;;;EAST,QAAQ,KAAK,SAAS,0BAA0B,UAAU,iBAAiB;;;;;;;;;;;EAW3E,OAAO,KAAK,SAAS,MAAM,KAAK,kBAAkB,gBAAgB,QAAQ;;;;;;;;;;;EAW1E,UAAU,KAAK,SAAS,MAAM,KAAK,kBAAkB,gBAAgB,QAAQ;;;;;;;;EAQ7E,IAAI,sBAAsB,UAAU;aAAqB;MAAyB,UAAU,2BAA2B;;;KAI7G,QAAQ,KAAK,SAAS,IAAI,YAAY;;KAGtC,WAAW,KAAK,SAAS,IAAI,YAAY;;UAGpC;;WAEN;;WAEA,eAAe;;WAEf;;WAEA,MAAM;;WAEN,KAAK;;;UAIC;;WAEN;;WAEA,mBAAmB;WACnB,KAAK;;WAEL;;WAEA,MAAM;;WAEN,gBAAgB;;WAEhB,gBAAgB;WAChB,SAAS;;;;;;UAOHC;;WAEN;;WAEA,eAAe;;WAEf;;;;;;;EAOT,SAAS,UAAU,UAAU;;;UAId;;WAEN;;WAEA,mBAAmB;WACnB,KAAK;;WAEL;;WAEA,MAAM;;WAEN,gBAAgBA;;WAEhB,SAAS;;WAET,gBAAgB;;;;;;;;EAQzB,QAAQ,0BAA0B,UAAU,iBAAiB;;;;;;;;;EAS7D,OAAO,MAAM,KAAK,mBAAmB;;;UAItB;;WAEN;;WAEA,eAAe;;WAEf;;;;;;;EAOT,SAAS,UAAU,UAAU;;;UAId;WACN;WACA,mBAAmB;WACnB,KAAK;;WAEL;WACA,MAAM;WACN,gBAAgB;WAChB,SAAS;WACT,gBAAgB;EACzB,QAAQ,0BAA0B,UAAU,iBAAiB;;;;;;;;;EAS7D,OAAO,MAAM,KAAK,mBAAmB;;;;;;;;EAQrC,IAAI,gBAAgB,WAAW;aAAqB;MAAyB,UAAU,2BAA2B;;;KAIxG,UAAU,OAAO,cAAc;;UAG1B;;;;;;;WAON,UAAU,OAAO,iBAAiB;;;KAIjC,YAAY,SAAS;;KAGrB,SAAS,OAAO,aAAa;;UAGxB;;;;;;;WAON,aAAa,OAAO,iBAAiB;;;;;;KAOpC,SAAS,QAAQ;;;;;;;UAQZ,gBAAgB;WACtB,YAAY,SAAS,eAAe;;WAEpC,UAAU,SAAS,eAAe;WAClC;WACA,WAAW,eAAe,OAAO,eAAe,OAAO,SAAS;;;UAI1D;WACN;;WAEA;;WAEA,KAAK;;WAEL;;WAEA,QAAQ;WACR,MAAM;;WAEN;;WAEA,OAAO,SAAS;;WAEhB,eAAe;;WAEf;;WAEA;;WAEA;WACA,QAAQ;WACR,mBAAmB;;WAEnB;;;UAIM;WACN,QAAQ;WACR,OAAO;WACP,kBAAkB;;WAElB;;;UA2CM;WACN;WACA;EACT,iBAAiB,eAAe,sBAAsB;aAAqB;;;;UAI5D;;WAEN,UAAU;;WAEV;;WAEA,SAAS;;;UAIH;;WAEN,UAAU;;;UAkPJ;;WAEN;;WAEA;;;UAIM;WACN,SAAS;;WAET;;WAEA,MAAM;;;;;;;;EAQf,SAAS,UAAU,SAAS,UAAU,cAAc;;;;;;;;EAQpD,IAAI,UAAU,SAAS,UAAU,aAAa,QAAQ;;;;;;;;;;;wBAgNxC,QAAQ,SAAS,SAAS,cAAc,UAAS,iBAAsB;;;;;;;;;wBAsCvE,QAAQ,SAAS,SAAS,UAAS,kBAAuB,iBAAiB;;;;;;;;;;;;;;wBAyC3E,SAAS,SAAS,SAAS,cAAc,UAAS,SAAyB,wBAAwB;;;;;;;;;;;;wBAkB7F,IAAI,SAAS,SAAS,cAAc,UAAS,SAAyB,UAAS,aAAkB,QAAQ;;;;;;;;wBAc/G,OAAO,OAAO,WAAW,eAAe,QAAQ;;;;;;;wBAqBhD,QAAQ,OAAO,qBAAqB;;;;;;;;wBAkBpC,SAAS,OAAO,qBAAqB;;;;;;;qBCxiCxC,WAAW;;qBA2GX,gBAAgB,SAAS,eAAe;;UAgFpC;;;;;;;;WAQN,WAAW,MAAM,OAAO,QAAQ;;WAEhC;;;;;;;;;;wBAeK,cAAc,UAAS,iBAAsB;;qBAoBhD,aAAa,SAAS,eAAe;;;;;qBAiBrC,aAAa,SAAS,eAAe;;qBAgDrC,aAAa;;qBAGb;;;;UCpTI;WACN;WACA;WACA;;;KAIC,iBAAiB,gBAAgB;;UAG5B;WACN;WACA;;WAEA;;;;;;;;wBASK,WAAW,gBAAgB,sBAAsB;;;;;;;wBAkBjD,UAAU,gBAAgB,sBAAsB;;;;;;;;wBAkBhD,YAAY,gBAAgB,sBAAsB;;;;;;;;;wBAmBlD,eAAe,gBAAgB,YAAY;;;;;;;;wBAiB3C,OAAO,gBAAgB;;;;qBC5F1B;;KAGD,eAAe;;UAGV;WACN,MAAM;WACN;;WAEA;;WAEA;;;qBAIE,oBAAoB;;;;;;;;;;;KA4CrB;;UAGK;WACN;WACA,OAAO;WACP;;;UAIM;WACN;WACA;WACA,MAAM;WACN;WACA,SAAS;WACT,MAAM,SAAS,OAAO,MAAM;;;qBAM1B,qBAAqB;;;;UC7EjB;;WAEN,gBAAgB;;WAEhB,aAAa;;WAEb,KAAK;;WAEL;;WAEA,OAAO;;WAEP,oBAAoB;;WAEpB;;WAEA,OAAO;;WAEP,OAAO;;;UAID;WACN,gBAAgB;WAChB,aAAa;WACb;WACA;;;UAIM;;WAEN;;WAEA;;;;;;WAMA,WAAW,SAAS;;;;;;;;;;;;wBA0Ef,KAAK,OAAO,OAAO,cAAc,QAAQ,OAAO,4BAA4B,UAAS;;UA4DpF;;WAEN,gBAAgB;;WAEhB,aAAa;;WAEb,eAAe;WACf;;WAEA;;;;;;;;;;;;wBAaK,OAAO,OAAO,OAAO,cAAc,UAAS,uBAA4B;;;;;;;;;;;wBA8CxE,QAAQ,OAAO,OAAO,cAAc,SAAS,KAAK,oBAAoB,UAAS;;UAW9E;WACN,MAAM;;WAEN,gBAAgB;WAChB;;;UAIM;;WAEN;;WAEA;;WAEA,gBAAgB;;;;;;;;;;;;;;;;;;;;wBAqBX,MAAM,SAAS,SAAS,cAAc,UAAS,wBAA6B;;;;KClShF,WAAW;;;;;KAMX,UAAU,sBAAsB,cAAc;;KAG9C,SAAS,MAAM,SAAS;;;;;;;;;;;;;;;;UAiBnB;WACN,MAAM,SAAS,eAAe,WAAW,iBAAiB;WAC1D,OAAO,SAAS,eAAe;WAC/B,MAAM,SAAS,eAAe;WAC9B,UAAU;WACV;WACA;WACA,QAAQ,OAAO;WACf,WAAW;WACX,SAAS,gBAAgB,eAAe;;;qBAItC;WACC,OAAgB;EAA5B,YAAY,OAAgB;;cAGxB;;KAGM,eAAe;YAAoD;aAAqB;;;;;;;;;wBAQpF,UAAU,iBAAiB,SAAS;;qBAKvC,SAAS,SAAS,eAAe;;wBAY9B,SAAS;;;;;;;wBA4BT,gBAAgB,SAAS,eAAe;;;;;;;;wBA6CxC,kBAAkB,UAAS,iBAAsB,SAAS,eAAe;;;;;;;;;wBA4PzE,eAAe,UAAS,gBAAqB,OAAM,QAAQ,WAAgB"}
+{"version":3,"file":"index.d.ts","names":["Shape","Part"],"sources":["../src/doc.ts","../src/errors.ts","../src/world.ts","../src/ladder.ts","../src/deref.ts","../src/classify.ts","../src/parts.ts","../src/evaluate.ts","../src/stdlib.ts","../src/order.ts","../src/context.ts","../src/static.ts","../src/formula.ts"],"mappings":";;KACY,mDAAmD;YAAmC,cAAA;;;KAGtF;YAAuC,cAAA;;;KAGvC;;;;;;;;;;;KAYA,4BAA4B;WAAmB;WAAsB,gBAAgB;;;;;;KAMrF;;WAED,MAAM;;WAEN,OAAO;;WAEP;;WAEA,MAAM,SAAS;;;qBAIb;;;;;;;;wBASG,SAAS,iBAAiB,SAAS;;;;;;;;wBAanC,MAAM,QAAQ,YAAY,cAAc;;;;;;;wBAUxC,MAAM,iBAAiB,SAAS;;;;;;;;wBAWhC,UAAU,iBAAiB,SAAS;;;;;;;wBAcpC,SAAS,MAAM,mBAAmB;;;;;;;wBAalC,SAAS,MAAM;;;;;;;;;wBAqBf,WAAW,iBAAiB,SAAS,aAAa;;UAUjD;WACN,UAAU;;WAEV,QAAQ,SAAS,eAAe;;;;;;;;;;wBAW3B,OAAO,gBAAgB,4BAA4B;;;;;;;;;wBAqBnD,MAAM,MAAM,SAAS,OAAO,MAAM;WAAmB;WAAwB,MAAM;IAAgC;;;;;;;wBAUnH,OAAO,eAAe,SAAS;;;;;;;wBAU/B,OAAO,KAAK,WAAW;;;;;;;wBAevB,SAAS,iBAAiB;;;;;;;;;;wBAuB1B,UAAU,YAAY;;;;KCpO1B;;KAkBA,YAAY;;;;;;;UAQP;WACN,MAAM;WACN;WACA,iBAAiB;WACjB;;;KAIC,OAAO;WAA0B;WAAmB,OAAO;;WAAiB;WAAoB,OAAO;;;KAGvG;WAAoB;WAAoB,OAAO;;;;;;;;wBAQ3C,GAAG,GAAG,OAAO,IAAI,OAAO;;;;;;;;;wBAYxB,KAAK,MAAM,WAAW,gBAAgB;WAAiB,iBAAiB;WAAgB;IAAyB;;;;;;;;;wBAejH,OAAO,GAAG,QAAQ,OAAO,IAAI,gBAAgB,QAAQ,OAAO;;;;;qBAS/D,gBAAgB;WAClB,OAAO;;;;;;EAOhB,YAAY,OAAO;;;;;;;;wBAaL,gBAAgB;;;;;;;;;wBAYhB,OAAO,gBAAgB,cAAc;;;;;;;wBAgBrC,SAAS;;;;KClIb;;;;;;;;;;;;;KAcA;WACG;;WACA;WAAwB;;WACxB;WAAwB;WAAsB,OAAO;;WACrD;WAAuB;WAAsB,OAAO;;WAEpD;WACA,4BAA4B,SAAS,eAAe;WACpD;WACA;WACA,OAAO;;WAEP;WAAwB;;;KAG3B,YAAY;;;;;;;;;;KAWZ;WACG;;WACA,iBAAiB;;WACjB,iBAAiB;;WACjB,iBAAiB;WAAgB;;WACjC;;;;;;UAME;WACN,OAAO;;WAEP,uBAAuB;;WAEvB;;;UAIM;WACN,OAAO,SAAS;;WAEhB,QAAQ;;WAER,iBAAiB;;WAEjB,OAAO;;;;;WAKP;;WAEA;;;UAIM;WACN,OAAO,SAAS,eAAe;WAC/B,WAAW;;;KAIV;WAAmB;WAAsB,gBAAgB;;;KAGzD,aAAa,OAAO,YAAY;;;;;UAM3B;WACN,OAAO,SAAS,eAAe;WAC/B,UAAU,SAAS;WACnB,WAAW;;;KAIV;WACG;WAAmB,MAAM;WAAe,eAAe;WAAgB;;WACvE;WAAoB;WAAkE,eAAe;;;;;;;;wBAQpG,OAAO,OAAO,yBAAyB,SAAS;;;;;;;wBAUhD,QAAQ,OAAO,yBAAyB,SAAS;;;;;;;wBAUjD,YAAY,OAAO,yBAAyB,SAAS;;;;;;;;;;;wBAmBrD,WAAW,OAAO,OAAO,MAAM,UAAU;;;;;;;;wBA+CzC,cAAc,SAAS,SAAS,eAAe,eAAe;;;;;;;;wBA2B9D,aAAa,cAAc,MAAM,OAAO;;;;;;;wBAaxC,cAAc;;;;qBCzOjB;;KAGD,eAAe;;KAGf;;;;;;;;;KAUA;;UAGK;WACN,MAAM;WACN,SAAS;;WAET;;WAEA;;WAEA,SAAS;;;UAIH;WACN;;WAEA;;WAEA,OAAO;;WAEP;WACA,gBAAgB;;;;;;UAOV;WACN,OAAO;WACP,MAAM,SAAS;;;UAIT;;WAEN;;;;;;;;;;wBAeK,OAAO,OAAO,OAAO,MAAM,UAAU;;;;;;;;wBAYrC,UAAU,OAAO,OAAO,MAAM,UAAU;;;;;;;;;;;;;;wBAiBxC,IAAI,OAAO,OAAO,KAAK,QAAQ,cAAc,UAAS,aAAkB;;;;;;;qBCjG3E;;;;;UAMI;YACL;;WAED;;;;;;;EAOT,MAAM,KAAK,MAAM;;;;;;EAMjB;;;;;;;;EAQA,SAAS,eAAe;aAAmB,OAAO;;;;KAIxC;;;;;;;wBAQI,YAAY,iBAAiB,SAAS;;qBAKzC;;KAGD,eAAe;;;;;KAMf,wBAAwB;;;;;;;;;;UAWnB;WACN,MAAM;WACN,OAAO,SAAS;WAChB,OAAO;WACP,OAAO;WACP,eAAe;;;KAId,aAAa,KAAK,UAAU,KAAK,QAAQ;;KAGzC;WAAwB;WAAmB,OAAO;;WAAqB;WAAoB;;;UAGtF;;WAEN,MAAM;;WAEN,MAAM;WACN,SAAS;;;;;;;;EAQlB,MAAM,OAAO,OAAO,KAAK,MAAM;;;KAIrB,UAAU,OAAO,cAAc;;;;;;;;;;UAW1B;WACN,OAAO;WACP,SAAS,SAAS,eAAe;WACjC,UAAU,SAAS,eAAe;WAClC;WACA,iBAAiB;WACjB,SAAS,mBAAmB;;;KAI3B;;UAGK;WACN,MAAM;WACN,OAAO;WACP,IAAI;;;KAIH;;KAGA;WACG;WAAmB,OAAO;WAAgB,eAAe;;WACzD;WAAoB,MAAM;WAAsB;WAAyB,eAAe;;;UAGtF;;WAEN;;;;;;;;;;;;wBA+BK,UAAU,KAAK,WAAW,OAAO,OAAO,KAAK;WAAiB,OAAO;WAAgB,IAAI;;;;;;;;wBAkCzF,MAAM,iBAAiB,SAAS;WAAsB,gBAAgB;;;;;;;;;;wBAgBtE,WAAW,OAAO,QAAQ;;;;;;;wBAe1B,QAAQ,QAAO,QAAQ,WAAgB;;;;;;;;;;;;;;;;;;;;;;;wBAqFvC,QAAQ,KAAK,WAAW,KAAK,SAAS,0BAA0B,UAAS,iBAAsB;;;;;;;wBA8F/F,aAAa,OAAO;;;;UCnanBA;WACN;WACA;WACA;;;UAIM;;WAEN;;WAEA;;WAEA;;;;;;;;;;;;wBAiBK,SAAS,iBAAiBA,WAAS,OAAO,OAAO;;;;;;;;wBAkBjD,IAAI,OAAO,MAAM,eAAe;;;;UC/C/B;;WAEN,eAAe;;WAEf;WACA,MAAM;WACN;;;KAUC;WAEG;;WAEA,gBAAgB;;WAEhB,MAAM;;;;;;;EAOf,KAAK,GAAG,kBAAkB;;WAEjB;WAAoB;WAAyB,aAAa;;;;;;;;;;wBA6BzD,WAAW,OAAO,mBAAmB,OAAO,OAAO;;;;;;;;;wBA0FnD,YAAY,eAAe,OAAO,kBAAkB;;;;;;;;;;;;wBC3HpD,YAAY,QAAO,SAAS,0BAA+B,gBAAe,OAAY,OAAM,QAAe;;;;;;;wBAU3G,QAAQ,MAAM;;;;;;;;;;wBAad,QAAQ,eAAe,OAAO,MAAM;;;;;;;;;wBAgBpC,OAAO,QAAQ,SAAS,MAAM,UAAU;;;;;;KAW5C,QAAQ,UAAU,kBAAkB;;UAG/B;WACN;;WAEA;;WAEA,eAAe;WACf;;WAEA;;WAEA;;WAEA,gBAAgB;;WAEhB,SAAS;;;KAIR,WAAW,QAAQ;;;;;UAMd;WACN,SAAS;;WAET;;;;;;;;;EAST,QAAQ,KAAK,SAAS,0BAA0B,UAAU,iBAAiB;;;;;;;;;;;EAW3E,OAAO,KAAK,SAAS,MAAM,KAAK,kBAAkB,gBAAgB,QAAQ;;;;;;;;;;;EAW1E,UAAU,KAAK,SAAS,MAAM,KAAK,kBAAkB,gBAAgB,QAAQ;;;;;;;;EAQ7E,IAAI,sBAAsB,UAAU,UAAU,aAAa,UAAU,2BAA2B;;;;;;;;;UAUjF;WACN;WACA;;;KAIC,QAAQ,KAAK,SAAS,IAAI,YAAY;;KAGtC,WAAW,KAAK,SAAS,IAAI,YAAY;;UAGpC;;WAEN;;WAEA,eAAe;;WAEf;;WAEA,MAAM;;WAEN,KAAK;;;UAIC;;WAEN;;WAEA,mBAAmB;WACnB,KAAK;;WAEL;;WAEA,MAAM;;WAEN,gBAAgB;;WAEhB,gBAAgB;WAChB,SAAS;;;;;;;;EAQlB,KAAK;;;;;;UAOUC;;WAEN;;WAEA,eAAe;;WAEf;;;;;;;EAOT,SAAS,UAAU,UAAU;;;UAId;;WAEN;;WAEA,mBAAmB;WACnB,KAAK;;WAEL;;WAEA,MAAM;;WAEN,gBAAgBA;;WAEhB,SAAS;;WAET,gBAAgB;;;;;;;;EAQzB,QAAQ,0BAA0B,UAAU,iBAAiB;;;;;;;;;EAS7D,OAAO,MAAM,KAAK,mBAAmB;;;;;;;;EAQrC,KAAK;;;UAIU;;WAEN;;WAEA,eAAe;;WAEf;;;;;;;EAOT,SAAS,UAAU,UAAU;;;UAId;WACN;WACA,mBAAmB;WACnB,KAAK;;WAEL;WACA,MAAM;WACN,gBAAgB;WAChB,SAAS;WACT,gBAAgB;EACzB,QAAQ,0BAA0B,UAAU,iBAAiB;;;;;;;;;EAS7D,OAAO,MAAM,KAAK,mBAAmB;;;;;;;;;EASrC,IAAI,gBAAgB,WAAW,UAAU,aAAa,UAAU,2BAA2B;;;;;;;;EAQ3F,KAAK;;;KAIK,UAAU,OAAO,cAAc;;UAG1B;;;;;;;WAON,UAAU,OAAO,iBAAiB;;;KAIjC,YAAY,SAAS;;KAGrB,SAAS,OAAO,aAAa;;UAGxB;;;;;;;WAON,aAAa,OAAO,iBAAiB;;;;;;KAOpC,SAAS,QAAQ;;;;;;;UAQZ,gBAAgB;WACtB,YAAY,SAAS,eAAe;;WAEpC,UAAU,SAAS,eAAe;WAClC;WACA,WAAW,eAAe,OAAO,eAAe,OAAO,SAAS;;;UAI1D;WACN;;WAEA;;WAEA,KAAK;;WAEL;;WAEA,QAAQ;WACR,MAAM;;WAEN;;WAEA,OAAO,SAAS;;WAEhB,eAAe;;WAEf;;WAEA;;WAEA;WACA,QAAQ;WACR,mBAAmB;;WAEnB;;;UAIM;WACN,QAAQ;WACR,OAAO;WACP,kBAAkB;;WAElB;;;UA2CM;WACN;WACA;EACT,iBAAiB,eAAe,sBAAsB;aAAqB;;;;UAI5D;;WAEN,UAAU;;WAEV;;WAEA,SAAS;;;UAIH;;WAEN,UAAU;;;UAkQJ;;WAEN;;WAEA;;;UAIM;WACN,SAAS;;WAET;;WAEA,MAAM;;;;;;;;EAQf,SAAS,UAAU,SAAS,UAAU,cAAc;;;;;;;;EAQpD,IAAI,UAAU,SAAS,UAAU,aAAa,QAAQ;;;;;;;;;;;wBAgPxC,QAAQ,SAAS,SAAS,cAAc,UAAS,iBAAsB;;;;;;;;;wBAsCvE,QAAQ,SAAS,SAAS,UAAS,kBAAuB,iBAAiB;;;;;;;;;;;;;;wBAyC3E,SAAS,SAAS,SAAS,cAAc,UAAS,SAAyB,wBAAwB;;;;;;;;;;;;wBAkB7F,IAAI,SAAS,SAAS,cAAc,UAAS,SAAyB,UAAS,aAAkB,QAAQ;;;;;;;;wBAc/G,OAAO,OAAO,WAAW,eAAe,QAAQ;;;;;;;wBAqBhD,QAAQ,OAAO,qBAAqB;;;;;;;;wBAkBpC,SAAS,OAAO,qBAAqB;;;;;;;qBC7nCxC,WAAW;;qBA2GX,gBAAgB,SAAS,eAAe;;UAgFpC;;;;;;;;WAQN,WAAW,MAAM,OAAO,QAAQ;;WAEhC;;;;;;;;;;wBAeK,cAAc,UAAS,iBAAsB;;qBAoBhD,aAAa,SAAS,eAAe;;;;;qBAiBrC,aAAa,SAAS,eAAe;;qBAgDrC,aAAa;;qBAGb;;;;UCpTI;WACN;WACA;WACA;;;KAIC,iBAAiB,gBAAgB;;UAG5B;WACN;WACA;;WAEA;;;;;;;;wBASK,WAAW,gBAAgB,sBAAsB;;;;;;;wBAkBjD,UAAU,gBAAgB,sBAAsB;;;;;;;;wBAkBhD,YAAY,gBAAgB,sBAAsB;;;;;;;;;wBAmBlD,eAAe,gBAAgB,YAAY;;;;;;;;wBAiB3C,OAAO,gBAAgB;;;;qBC5F1B;;KAGD,eAAe;;UAGV;WACN,MAAM;WACN;;WAEA;;WAEA;;;qBAIE,oBAAoB;;;;;;;;;;;KA4CrB;;UAGK;WACN;WACA,OAAO;WACP;;;UAIM;WACN;WACA;WACA,MAAM;WACN;WACA,SAAS;WACT,MAAM,SAAS,OAAO,MAAM;;;qBAM1B,qBAAqB;;;;UC7EjB;;WAEN,gBAAgB;;WAEhB,aAAa;;WAEb,KAAK;;WAEL;;WAEA,OAAO;;WAEP,oBAAoB;;WAEpB;;WAEA,OAAO;;WAEP,OAAO;;;UAID;WACN,gBAAgB;WAChB,aAAa;WACb;WACA;;;UAIM;;WAEN;;WAEA;;;;;;WAMA,WAAW,SAAS;;;;;;;;;;;;wBAmFf,KAAK,OAAO,OAAO,cAAc,QAAQ,OAAO,4BAA4B,UAAS;;UAgEpF;;WAEN,gBAAgB;;WAEhB,aAAa;;WAEb,eAAe;WACf;;WAEA;;;;;;;;;;;;wBAaK,OAAO,OAAO,OAAO,cAAc,UAAS,uBAA4B;;;;;;;;;;;wBA8CxE,QAAQ,OAAO,OAAO,cAAc,SAAS,KAAK,oBAAoB,UAAS;;UAW9E;WACN,MAAM;;WAEN,gBAAgB;WAChB;;;UAIM;;WAEN;;WAEA;;WAEA,gBAAgB;;;;;;;;;;;;;;;;;;;;wBAqBX,MAAM,SAAS,SAAS,cAAc,UAAS,wBAA6B;;;;KC/ShF,WAAW;;;;;KAMX,UAAU,sBAAsB,cAAc;;KAG9C,SAAS,MAAM,SAAS;;;;;;;;;;;;;;;;UAiBnB;WACN,MAAM,SAAS,eAAe,WAAW,iBAAiB;WAC1D,OAAO,SAAS,eAAe;WAC/B,MAAM,SAAS,eAAe;WAC9B,UAAU;WACV;WACA;WACA,QAAQ,OAAO;WACf,WAAW;WACX,SAAS,gBAAgB,eAAe;;;qBAItC;WACC,OAAgB;EAA5B,YAAY,OAAgB;;cAGxB;;KAGM,eAAe;YAAoD;aAAqB;;;;;;;;;wBAQpF,UAAU,iBAAiB,SAAS;;qBAKvC,SAAS,SAAS,eAAe;;wBAY9B,SAAS;;;;;;;wBAiCT,gBAAgB,SAAS,eAAe;;;;;;;;wBA6CxC,kBAAkB,UAAS,iBAAsB,SAAS,eAAe;;;;;;;;;wBA8PzE,eAAe,UAAS,gBAAqB,OAAM,QAAQ,WAAgB"}

package/build/index.js

@@ -70,6 +70,7 @@ function typePath(type) {
 * @returns The text, for example `git.push`.
 */
 function typeName(type) {
+	if (typeof type === "string") return type;
 	return typePath(type)?.join(".") ?? "(computed)";
 }
 function headerFits(value) {
@@ -88,9 +89,9 @@ function headerFits(value) {
 * @returns `true` when the value has the form of an envelope.
 */
 function isEnvelope(value) {
-	if (!isRecord(value) || !headerFits(value)) return false;
-	for (const key in value) if (Object.hasOwn(value, key) && !ENVELOPE_KEYS.includes(key)) return false;
-	return true;
+	if (typeof value !== "object" || value === null || Array.isArray(value)) return false;
+	for (const key in value) if (key !== "type" && key !== "value" && key !== "name" && key !== "own" && Object.hasOwn(value, key)) return false;
+	return isRecord(value) && headerFits(value);
 }
 /**
 * This function reads a stored document: an envelope that also has the keys of a store, for example `{ _id, type,
@@ -352,7 +353,8 @@ function entryAt(entries, key) {
 /**
 * This function finds the kind that a type names. It walks the path from the root of the world, one key at a
 * time. An alias on the way is followed until a kind answers (collapse). A cycle of aliases stops the lookup. In a
-* namespace with a fallback, a key that the namespace does not have gets the fallback kind.
+* namespace with a fallback, a key that the namespace does not have gets the fallback kind. In an open world, a first
+* key that the world does not have gets the fallback kind of the world.
 *
 * @param world - The world.
 * @param type - The reference to the type.
@@ -369,7 +371,7 @@ function lookupKind(world, type) {
 	let aliases = 0;
 	for (;;) {
 		let entries = world.kinds;
-		let fallback;
+		let fallback = world.fallback;
 		let entry;
 		let followed = false;
 		for (let index = 0; index < path.length; index += 1) {
@@ -1017,14 +1019,17 @@ var Bad = class {
 		this.at = at;
 	}
 };
+/** This function sets an own data property. Only the key `__proto__` needs `defineProperty`. */
 function setOwn$1(target, key, value) {
-	Object.defineProperty(target, key, {
+	if (key === "__proto__") Object.defineProperty(target, key, {
 		value,
 		enumerable: true,
 		writable: true,
 		configurable: true
 	});
+	else target[key] = value;
 }
+const NO_SLOTS = Object.freeze([]);
 function hasSlots(template) {
 	return template.t !== "data";
 }
@@ -1037,6 +1042,12 @@ function hasSlots(template) {
 * @returns The parts and a way to fill their places, or the reason why the value does not have the shape.
 */
 function splitParts(shape, value) {
+	if (shape === void 0 || shape.shape === "none") return {
+		ok: true,
+		parts: NO_SLOTS,
+		data: value,
+		fill: () => value
+	};
 	const parts = [];
 	const slot = (item, path, of) => {
 		parts.push({
@@ -1331,18 +1342,24 @@ var Session = class {
 	*all(list, options = {}) {
 		const results = new Array(list.length);
 		const limit = Math.max(1, options.concurrency ?? list.length);
+		const failFast = options.failFast === true;
+		let failed = false;
 		const active = [];
 		let next = 0;
+		const settle = (index, result) => {
+			results[index] = result;
+			if (failFast && !result.ok) failed = true;
+		};
 		const advance = (index, steps, input) => {
 			let step;
 			try {
 				step = input.threw ? steps.throw(input.error) : steps.next(input.value);
 			} catch (error) {
-				results[index] = thrown(error, "a part");
+				settle(index, thrown(error, "a part"));
 				return;
 			}
 			if (step.done === true) {
-				results[index] = step.value;
+				settle(index, step.value);
 				return;
 			}
 			const item = {
@@ -1362,7 +1379,7 @@ var Session = class {
 			active.push(item);
 		};
 		const start = () => {
-			while (active.length < limit && next < list.length) {
+			while (!failed && active.length < limit && next < list.length) {
 				const index = next;
 				next += 1;
 				const begin = list[index];
@@ -1370,19 +1387,25 @@ var Session = class {
 				try {
 					steps = begin();
 				} catch (error) {
-					results[index] = thrown(error, "a part");
+					settle(index, thrown(error, "a part"));
 					continue;
 				}
 				advance(index, steps, { threw: false });
 			}
 		};
 		start();
-		while (active.length > 0) {
+		while (active.length > 0 && !failed) {
 			const settled = yield Promise.race(active.map((item) => item.pending));
 			active.splice(active.indexOf(settled.item), 1);
 			advance(settled.item.index, settled.item.steps, settled);
 			start();
 		}
+		if (!failed) return results;
+		const stopped = fail("#ABORT", "The part stopped: a part before it failed, and the parts run with failFast.");
+		for (const item of active) try {
+			item.steps.return(stopped);
+		} catch {}
+		for (let index = 0; index < list.length; index += 1) if (results[index] === void 0) results[index] = stopped;
 		return results;
 	}
 	enter(meta, ctx) {
@@ -1538,32 +1561,73 @@ function finish(c, meta, code, run) {
 		run: tracedRun
 	};
 }
+/**
+* This function finds the evaluator of the verb `eval` without the record of the rungs, for a compilation without a
+* trace. It gives the same evaluator as `ask`: the own entry, then the kind, then the default of the world.
+*/
+function evaluatorOf(world, envelope, found) {
+	const own = envelope?.own;
+	const ownName = own !== void 0 && Object.hasOwn(own, "eval") ? own["eval"] : void 0;
+	if (ownName !== void 0) return {
+		name: ownName,
+		unknown: false
+	};
+	if (!found.ok) return { unknown: true };
+	const verbs = found.kind.verbs;
+	const name = Object.hasOwn(verbs, "eval") ? verbs["eval"] : Object.hasOwn(world.defaults, "eval") ? world.defaults["eval"] : void 0;
+	return name === void 0 ? { unknown: false } : {
+		name,
+		unknown: false
+	};
+}
+/** The meta of a node of a compilation without a trace. Only a trace reads the meta of a node. */
+const NO_META = Object.freeze({
+	path: [],
+	doc: {
+		type: "?",
+		value: null
+	},
+	declared: false,
+	answer: NO_ANSWER,
+	side: "derive"
+});
 function compileNode(c, value, place, declared, depth) {
 	const envelope = isEnvelope(value) ? value : void 0;
 	const doc = envelope ?? {
 		type: declared ?? "?",
 		value
 	};
-	const meta0 = {
+	const meta0 = c.traced ? {
 		path: place.map(String),
 		doc,
 		declared: envelope === void 0,
 		answer: NO_ANSWER,
 		side: "derive"
-	};
+	} : NO_META;
 	if (envelope === void 0 && declared === void 0) return failing(c, meta0, place, "#PART?", "The value has no envelope, and its position declares no type.");
 	if (depth > c.maxDepth) return failing(c, meta0, place, "#DEPTH!", `The nesting is deeper than ${c.maxDepth} documents.`);
-	const answer = ask(c.machine.world, envelope ?? {}, "eval", declared === void 0 ? {} : { declaredType: declared });
-	const found = lookupKind(c.machine.world, doc.type);
+	const world = c.machine.world;
+	const found = lookupKind(world, doc.type);
 	const kind = found.ok ? found.kind : void 0;
-	const meta = {
-		...meta0,
-		answer,
-		side: kind?.side ?? "derive"
-	};
+	let meta = meta0;
+	let name;
+	let unknown;
+	if (c.traced) {
+		const answer = ask(world, envelope ?? {}, "eval", declared === void 0 ? {} : { declaredType: declared });
+		meta = {
+			...meta0,
+			answer,
+			side: kind?.side ?? "derive"
+		};
+		name = answer.evaluator;
+		unknown = answer.error === "unknown-kind";
+	} else {
+		const quick = evaluatorOf(world, envelope, found);
+		name = quick.name;
+		unknown = quick.unknown;
+	}
 	const kindText = typeName(doc.type);
-	if (answer.error === "unknown-kind") return failing(c, meta, place, "#KIND?", `The world has no kind ${kindText}.`);
-	const name = answer.evaluator;
+	if (unknown) return failing(c, meta, place, "#KIND?", `The world has no kind ${kindText}.`);
 	const runners = c.machine.runners ?? {};
 	const runner = name !== void 0 && Object.hasOwn(runners, name) ? runners[name] : void 0;
 	const evaluator = name !== void 0 && Object.hasOwn(c.machine.evaluators, name) ? c.machine.evaluators[name] : void 0;
@@ -1574,12 +1638,18 @@ function compileNode(c, value, place, declared, depth) {
 		return failing(c, meta, place, "#VALUE!", `${split.reason}${at} The kind is ${kindText}.`);
 	}
 	const parts = split.parts.map((slot) => {
-		const compiled = compileNode(c, slot.item, [...place, ...slot.path], slot.of, depth + 1);
-		const header = isEnvelope(slot.item) && isRecord(slot.item) && typeof slot.item["name"] === "string" ? slot.item["name"] : void 0;
-		return {
+		const item = slot.item;
+		const compiled = compileNode(c, item, place.concat(slot.path), slot.of, depth + 1);
+		const header = typeof item?.name === "string" && isEnvelope(item) ? item.name : void 0;
+		return header === void 0 ? {
 			key: slot.key,
 			path: slot.path,
-			...header === void 0 ? {} : { name: header },
+			code: compiled.code,
+			run: compiled.run
+		} : {
+			key: slot.key,
+			path: slot.path,
+			name: header,
 			code: compiled.code,
 			run: compiled.run
 		};
@@ -1592,9 +1662,9 @@ function compileNode(c, value, place, declared, depth) {
 		data: split.data,
 		parts,
 		place,
-		machine: c.machine
+		machine: c.machine,
+		fill: (items) => split.parts.length === 0 ? doc.value : split.fill(items)
 	};
-	const who = `the evaluator ${name}`;
 	if (runner !== void 0) {
 		const inner = isCompiledRunner(runner) ? runner.compileRun(input) : interpretRun(runner, input, split.fill);
 		const run = function* (ctx, rt) {
@@ -1612,7 +1682,7 @@ function compileNode(c, value, place, declared, depth) {
 		try {
 			return placed(inner(ctx, rt), place);
 		} catch (error) {
-			return placed(thrown(error, who), place);
+			return placed(thrown(error, `the evaluator ${name}`), place);
 		}
 	};
 	return finish(c, meta, code, function* (ctx, rt) {
@@ -1640,7 +1710,8 @@ function interpret(fn, input, fill) {
 			context: ctx,
 			place,
 			resolve: (path, options) => rt.resolve(ctx, path, options),
-			effect: (effectKind, payload) => rt.effect(ctx, effectKind, payload, place)
+			effect: (effectKind, payload) => rt.effect(ctx, effectKind, payload, place),
+			fill: input.fill
 		});
 	};
 }
@@ -1666,7 +1737,8 @@ function interpretRun(fn, input, fill) {
 			place,
 			resolve: (path, options) => rt.resolve(ctx, path, options),
 			effect: (effectKind, payload) => rt.runEffect(ctx, effectKind, payload, place),
-			all: (list, options) => rt.all(list.map((part) => () => part.evaluate()), options)
+			all: (list, options) => rt.all(list.map((part) => () => part.evaluate()), options),
+			fill: input.fill
 		});
 	};
 }
@@ -1713,8 +1785,8 @@ function prepare(machine, doc, options = {}) {
 		machine,
 		traced: c.traced,
 		root: compiled,
-		evaluate(context = makeContext(), evalOptions = {}) {
-			const s = new Session(machine, false, c.traced, void 0, void 0, evalOptions.effects);
+		evaluate(context = makeContext(), evalOptions) {
+			const s = new Session(machine, false, c.traced, void 0, void 0, evalOptions?.effects);
 			return root.code(rootContext(machine, context), s);
 		},
 		run(context = makeContext(), runOptions = {}) {
@@ -2711,6 +2783,13 @@ function scopesOf(rules, value, slots) {
 		later
 	};
 }
+/** The names of a walk without names. A walk does not change a set at any time: it makes a new set to add names. */
+const NO_NAMES = /* @__PURE__ */ new Set();
+/** This function gives the options of a walk without the names of the host. */
+function withoutNames(options) {
+	const { names: _host, ...rest } = options;
+	return rest;
+}
 /**
 * This function visits each document of a document: the root and each part at each depth, by the contracts of the
 * kinds. A part of a kind that the world does not have is not visited. The walk uses no stack of the host for the
@@ -2722,14 +2801,15 @@ function scopesOf(rules, value, slots) {
 * @param options - The type of a bare root value, the names of the host, and a function for the problems.
 */
 function walk(world, doc, visit, options = {}) {
+	const names = options.names === void 0 || options.names.length === 0 ? NO_NAMES : new Set(options.names);
 	const stack = [{
 		value: doc,
 		place: [],
 		at: [],
 		declared: options.declaredType,
 		depth: 0,
-		names: new Set(options.names ?? []),
-		later: /* @__PURE__ */ new Set()
+		names,
+		later: NO_NAMES
 	}];
 	while (stack.length > 0) {
 		const item = stack.pop();
@@ -2749,15 +2829,21 @@ function walk(world, doc, visit, options = {}) {
 		};
 		const found = lookupKind(world, doc.type);
 		const kind = found.ok ? found.kind : void 0;
-		if (visit({
+		if (visit(kind === void 0 ? {
 			place: item.place,
 			at: item.at,
 			doc,
 			declared: envelope === void 0,
-			...kind === void 0 ? {} : {
-				kind,
-				typePath: found.ok ? found.path : []
-			},
+			depth: item.depth,
+			names: item.names,
+			later: item.later
+		} : {
+			place: item.place,
+			at: item.at,
+			doc,
+			declared: envelope === void 0,
+			kind,
+			typePath: found.ok ? found.path : [],
 			depth: item.depth,
 			names: item.names,
 			later: item.later
@@ -2803,7 +2889,6 @@ function walk(world, doc, visit, options = {}) {
 */
 function refsOf(world, doc, options = {}) {
 	const out = [];
-	const { names: _host, ...rest } = options;
 	walk(world, doc, (v) => {
 		if (!isRef(v.doc)) return void 0;
 		const path = v.doc.value;
@@ -2818,7 +2903,7 @@ function refsOf(world, doc, options = {}) {
 			free: !bound
 		});
 		return "skip";
-	}, rest);
+	}, options.names === void 0 ? options : withoutNames(options));
 	return out;
 }
 function setAt(value, path, next) {
@@ -3005,13 +3090,18 @@ function jsTruthy(value) {
 function strictTruthy(value) {
 	return typeof value === "boolean" ? value : void 0;
 }
+/**
+* This function sets an own data property. Only the key `__proto__` needs `defineProperty`: an assignment to it
+* changes the prototype. An assignment is faster for each other key of a new plain object.
+*/
 function setOwn(target, key, value) {
-	Object.defineProperty(target, key, {
+	if (key === "__proto__") Object.defineProperty(target, key, {
 		value,
 		enumerable: true,
 		writable: true,
 		configurable: true
 	});
+	else target[key] = value;
 }
 function compiled(compile) {
 	return { compile };
@@ -3194,16 +3284,18 @@ function formulaEvaluators(profile = {}) {
 			};
 		}),
 		"formula.record": compiled(({ value }) => {
-			const fields = Object.entries(partsOf(value));
+			const fields = partsOf(value);
+			const keys = Object.keys(fields);
+			const codes = keys.map((key) => fields[key].code);
 			return (ctx, rt) => {
 				const out = {};
-				for (const [key, part] of fields) {
-					const result = part.code(ctx, rt);
+				for (let index = 0; index < keys.length; index += 1) {
+					const result = codes[index](ctx, rt);
 					if (!result.ok) {
 						if (omit !== void 0 && omit(result.error)) continue;
 						return result;
 					}
-					setOwn(out, key, result.value);
+					setOwn(out, keys[index], result.value);
 				}
 				return ok(out);
 			};