@photivra/engine 1.5.0 → 2.1.0

package/dist/composition/plan-consumer.d.ts

@@ -25,7 +25,7 @@ export interface ProductionPlanConsumerManifest {
         modelVersion?: string;
     }[];
     blockers: readonly ProductionImageFormationBlocker[];
-    /** Same immutable executed RAW and output results; consumers cannot re-render a different source. */
+    /** The same immutable RAW and output results that ran. A consumer cannot re-render from a different source. */
     environmentCaptureResult?: ProductionImageFormationPlan["environmentCaptureResult"];
     processedOutputResult?: ProductionImageFormationPlan["processedOutputResult"];
     physicalSceneToSensorResult: ProductionImageFormationPlan["physicalSceneToSensorResult"];
@@ -42,12 +42,11 @@ export interface ProductionPlanConsumerManifest {
     consumerMayReduceCommittedTemporalSampleCount: false;
 }
 /**
- * Creates a deterministic renderer/reference consumption view over one
- * finalized semantic production plan.
+ * Creates a deterministic view of one finished production plan, for a renderer
+ * or a reference consumer.
  *
- * The consumer role changes execution responsibility only. It does not alter
- * scientific stage/effect identity, temporal sample count, seeds, or physical
- * results.
+ * The consumer role only changes who is responsible for executing. It does not
+ * change the scientific stages or effects, the number of time samples, the
+ * seeds or any physical result.
  */
 export declare function createProductionPlanConsumerManifest(input: CreateProductionPlanConsumerManifestInput): ProductionPlanConsumerManifest;
-//# sourceMappingURL=plan-consumer.d.ts.map

package/dist/composition/plan-consumer.js

@@ -1,14 +1,15 @@
 // SPDX-License-Identifier: Apache-2.0
 /**
- * Module boundary and integration notes.
- * Creates a deterministic renderer/reference consumption view over one finalized semantic production
- * plan. The consumer role changes execution responsibility only. It does not alter scientific
- * stage/effect identity, temporal sample count, seeds, or physical results.
- * @see docs/PRODUCTION_COMPOSITION.md for equations, coordinate/unit conventions, blockers and support
- * limits.
+ * A deterministic view of one finished production plan, for a renderer or a reference consumer.
+ *
+ * The consumer role only changes who is responsible for executing. It does not change the scientific
+ * stages or effects, the number of time samples, the seeds or any physical result.
+ * @see docs/PRODUCTION_COMPOSITION.md for the equations, units, coordinate conventions, known
+ * blockers and support limits.
  */
 import { InvalidConfigurationError } from "../core/configuration-error.js";
 import { PRODUCTION_IMAGE_FORMATION_PLAN_VERSION } from "./image-formation-plan.js";
+import { requireInputObject, requireInputKeys } from "../core/record-validation.js";
 export const PRODUCTION_PLAN_CONSUMER_MANIFEST_VERSION = "0.2.0";
 function requireConsumerKind(value) {
     if (value !== "interactive-optimized" &&
@@ -18,6 +19,7 @@ function requireConsumerKind(value) {
     return value;
 }
 function requirePlan(plan) {
+    requireInputObject(plan, "plan input");
     if (plan.version !==
         PRODUCTION_IMAGE_FORMATION_PLAN_VERSION) {
         throw new InvalidConfigurationError('plan.version must be "' +
@@ -31,14 +33,15 @@ function requirePlan(plan) {
     }
 }
 /**
- * Creates a deterministic renderer/reference consumption view over one
- * finalized semantic production plan.
+ * Creates a deterministic view of one finished production plan, for a renderer
+ * or a reference consumer.
  *
- * The consumer role changes execution responsibility only. It does not alter
- * scientific stage/effect identity, temporal sample count, seeds, or physical
- * results.
+ * The consumer role only changes who is responsible for executing. It does not
+ * change the scientific stages or effects, the number of time samples, the
+ * seeds or any physical result.
  */
 export function createProductionPlanConsumerManifest(input) {
+    requireInputKeys(input, "createProductionPlanConsumerManifest", ["plan", "consumerKind"]);
     requirePlan(input.plan);
     const consumerKind = requireConsumerKind(input.consumerKind);
     const activeOrModeledStages = input.plan.stagePlan

package/dist/composition/plan-consumer.js.map

@@ -1 +1 @@
-{"version":3,"file":"plan-consumer.js","sourceRoot":"","sources":["../../src/composition/plan-consumer.ts"],"names":[],"mappings":"AAAA,sCAAsC;AAEtC;;;;;;;GAOG;AAEH,OAAO,EAAE,yBAAyB,EAAE,MAAM,gCAAgC,CAAC;AAK3E,OAAO,EACL,uCAAuC,EAIxC,MAAM,2BAA2B,CAAC;AAEnC,MAAM,CAAC,MAAM,yCAAyC,GACpD,OAAgB,CAAC;AA0DnB,SAAS,mBAAmB,CAC1B,KAAc;IAEd,IACE,KAAK,KAAK,uBAAuB;QACjC,KAAK,KAAK,WAAW,EACrB,CAAC;QACD,MAAM,IAAI,yBAAyB,CACjC,0BAA0B,CAC3B,CAAC;IACJ,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,WAAW,CAClB,IAAkC;IAElC,IACE,IAAI,CAAC,OAAO;QACZ,uCAAuC,EACvC,CAAC;QACD,MAAM,IAAI,yBAAyB,CACjC,wBAAwB;YACtB,uCAAuC;YACvC,IAAI,CACP,CAAC;IACJ,CAAC;IACD,IACE,OAAO,IAAI,CAAC,WAAW,EAAE,KAAK;QAC5B,QAAQ;QACV,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EACnC,CAAC;QACD,MAAM,IAAI,yBAAyB,CACjC,mCAAmC,CACpC,CAAC;IACJ,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,oCAAoC,CAClD,KAC2C;IAE3C,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACxB,MAAM,YAAY,GAChB,mBAAmB,CACjB,KAAK,CAAC,YAAY,CACnB,CAAC;IAEJ,MAAM,qBAAqB,GACzB,KAAK,CAAC,IAAI,CAAC,SAAS;SACjB,MAAM,CACL,CAAC,KAAK,EAAE,EAAE,CACR,KAAK,CAAC,KAAK;QACT,QAAQ;QACV,KAAK,CAAC,KAAK;YACT,cAAc,CACnB;SACA,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACf,OAAO,EAAE,KAAK,CAAC,OAAO;QACtB,KAAK,EAAE,KAAK,CAAC,KAEK;QAClB,GAAG,CAAC,KAAK,CAAC,OAAO;YACjB,SAAS;YACP,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC;gBACE,OAAO,EACL,KAAK,CAAC,OAAO;aAChB,CAAC;QACN,GAAG,CAAC,KAAK,CAAC,YAAY;YACtB,SAAS;YACP,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC;gBACE,YAAY,EACV,KAAK,CAAC,YAAY;aACrB,CAAC;QACN,GAAG,CAAC,KAAK,CAAC,cAAc;YACxB,SAAS;YACP,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC;gBACE,cAAc,EACZ,KAAK,CAAC,cAAc;aACvB,CAAC;KACP,CAAC,CAAC,CAAC;IAER,MAAM,sBAAsB,GAC1B,KAAK,CAAC,IAAI,CAAC,UAAU;SAClB,MAAM,CACL,CAAC,MAAM,EAAE,EAAE,CACT,MAAM,CAAC,KAAK;QACV,QAAQ;QACV,MAAM,CAAC,KAAK;YACV,cAAc,CACnB;SACA,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QAChB,QAAQ,EAAE,MAAM,CAAC,QAAQ;QACzB,KAAK,EAAE,MAAM,CAAC,KAEI;QAClB,GAAG,CAAC,MAAM,CAAC,OAAO;YAClB,SAAS;YACP,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC;gBACE,OAAO,EACL,MAAM,CAAC,OAAO;aACjB,CAAC;QACN,GAAG,CAAC,MAAM,CAAC,YAAY;YACvB,SAAS;YACP,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC;gBACE,YAAY,EACV,MAAM,CAAC,YAAY;aACtB,CAAC;KACP,CAAC,CAAC,CAAC;IAER,OAAO;QACL,OAAO,EACL,yCAAyC;QAC3C,YAAY;QACZ,WAAW,EACT,uCAAuC;QACzC,eAAe,EACb,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK;QAC9B,UAAU,EACR,KAAK,CAAC,IAAI,CAAC,MAAM;QACnB,qBAAqB;QACrB,sBAAsB;QACtB,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,wBAAwB,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,wBAAwB,EAAE,KAAK,CAAC,IAAI,CAAC,wBAAwB,EAAE,CAAC;QAC/H,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,qBAAqB,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,qBAAqB,EAAE,KAAK,CAAC,IAAI,CAAC,qBAAqB,EAAE,CAAC;QACtH,QAAQ,EACN,KAAK,CAAC,IAAI,CAAC,QAAQ;QACrB,2BAA2B,EACzB,KAAK,CAAC,IAAI;aACP,2BAA2B;QAChC,qBAAqB,EACnB,KAAK,CAAC,IAAI,CAAC,qBAAqB;QAClC,mBAAmB,EACjB,KAAK,CAAC,IAAI,CAAC,mBAAmB;QAChC,UAAU,EAAE;YACV,iBAAiB,EACf,KAAK,CAAC,IAAI,CAAC,UAAU;iBAClB,iBAAiB;YACtB,sBAAsB,EAAE,KAAK;YAC7B,4CAA4C,EAC1C,KAAK;SACR;QACD,4CAA4C,EAC1C,IAAI;QACN,iCAAiC,EAC/B,KAAK;QACP,sCAAsC,EACpC,KAAK;QACP,6CAA6C,EAC3C,KAAK;KACR,CAAC;AACJ,CAAC"}
+{"version":3,"file":"plan-consumer.js","sourceRoot":"","sources":["../../src/composition/plan-consumer.ts"],"names":[],"mappings":"AAAA,sCAAsC;AAEtC;;;;;;;GAOG;AAEH,OAAO,EAAE,yBAAyB,EAAE,MAAM,gCAAgC,CAAC;AAK3E,OAAO,EACL,uCAAuC,EAIxC,MAAM,2BAA2B,CAAC;AACnC,OAAO,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAEpF,MAAM,CAAC,MAAM,yCAAyC,GACpD,OAAgB,CAAC;AA0DnB,SAAS,mBAAmB,CAC1B,KAAc;IAEd,IACE,KAAK,KAAK,uBAAuB;QACjC,KAAK,KAAK,WAAW,EACrB,CAAC;QACD,MAAM,IAAI,yBAAyB,CACjC,0BAA0B,CAC3B,CAAC;IACJ,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,WAAW,CAClB,IAAkC;IAElC,kBAAkB,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;IACvC,IACE,IAAI,CAAC,OAAO;QACZ,uCAAuC,EACvC,CAAC;QACD,MAAM,IAAI,yBAAyB,CACjC,wBAAwB;YACtB,uCAAuC;YACvC,IAAI,CACP,CAAC;IACJ,CAAC;IACD,IACE,OAAO,IAAI,CAAC,WAAW,EAAE,KAAK;QAC5B,QAAQ;QACV,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EACnC,CAAC;QACD,MAAM,IAAI,yBAAyB,CACjC,mCAAmC,CACpC,CAAC;IACJ,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,oCAAoC,CAClD,KAC2C;IAE3C,gBAAgB,CAAC,KAAK,EAAE,sCAAsC,EAAE,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC;IAC1F,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACxB,MAAM,YAAY,GAChB,mBAAmB,CACjB,KAAK,CAAC,YAAY,CACnB,CAAC;IAEJ,MAAM,qBAAqB,GACzB,KAAK,CAAC,IAAI,CAAC,SAAS;SACjB,MAAM,CACL,CAAC,KAAK,EAAE,EAAE,CACR,KAAK,CAAC,KAAK;QACT,QAAQ;QACV,KAAK,CAAC,KAAK;YACT,cAAc,CACnB;SACA,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACf,OAAO,EAAE,KAAK,CAAC,OAAO;QACtB,KAAK,EAAE,KAAK,CAAC,KAEK;QAClB,GAAG,CAAC,KAAK,CAAC,OAAO;YACjB,SAAS;YACP,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC;gBACE,OAAO,EACL,KAAK,CAAC,OAAO;aAChB,CAAC;QACN,GAAG,CAAC,KAAK,CAAC,YAAY;YACtB,SAAS;YACP,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC;gBACE,YAAY,EACV,KAAK,CAAC,YAAY;aACrB,CAAC;QACN,GAAG,CAAC,KAAK,CAAC,cAAc;YACxB,SAAS;YACP,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC;gBACE,cAAc,EACZ,KAAK,CAAC,cAAc;aACvB,CAAC;KACP,CAAC,CAAC,CAAC;IAER,MAAM,sBAAsB,GAC1B,KAAK,CAAC,IAAI,CAAC,UAAU;SAClB,MAAM,CACL,CAAC,MAAM,EAAE,EAAE,CACT,MAAM,CAAC,KAAK;QACV,QAAQ;QACV,MAAM,CAAC,KAAK;YACV,cAAc,CACnB;SACA,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QAChB,QAAQ,EAAE,MAAM,CAAC,QAAQ;QACzB,KAAK,EAAE,MAAM,CAAC,KAEI;QAClB,GAAG,CAAC,MAAM,CAAC,OAAO;YAClB,SAAS;YACP,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC;gBACE,OAAO,EACL,MAAM,CAAC,OAAO;aACjB,CAAC;QACN,GAAG,CAAC,MAAM,CAAC,YAAY;YACvB,SAAS;YACP,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC;gBACE,YAAY,EACV,MAAM,CAAC,YAAY;aACtB,CAAC;KACP,CAAC,CAAC,CAAC;IAER,OAAO;QACL,OAAO,EACL,yCAAyC;QAC3C,YAAY;QACZ,WAAW,EACT,uCAAuC;QACzC,eAAe,EACb,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK;QAC9B,UAAU,EACR,KAAK,CAAC,IAAI,CAAC,MAAM;QACnB,qBAAqB;QACrB,sBAAsB;QACtB,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,wBAAwB,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,wBAAwB,EAAE,KAAK,CAAC,IAAI,CAAC,wBAAwB,EAAE,CAAC;QAC/H,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,qBAAqB,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,qBAAqB,EAAE,KAAK,CAAC,IAAI,CAAC,qBAAqB,EAAE,CAAC;QACtH,QAAQ,EACN,KAAK,CAAC,IAAI,CAAC,QAAQ;QACrB,2BAA2B,EACzB,KAAK,CAAC,IAAI;aACP,2BAA2B;QAChC,qBAAqB,EACnB,KAAK,CAAC,IAAI,CAAC,qBAAqB;QAClC,mBAAmB,EACjB,KAAK,CAAC,IAAI,CAAC,mBAAmB;QAChC,UAAU,EAAE;YACV,iBAAiB,EACf,KAAK,CAAC,IAAI,CAAC,UAAU;iBAClB,iBAAiB;YACtB,sBAAsB,EAAE,KAAK;YAC7B,4CAA4C,EAC1C,KAAK;SACR;QACD,4CAA4C,EAC1C,IAAI;QACN,iCAAiC,EAC/B,KAAK;QACP,sCAAsC,EACpC,KAAK;QACP,6CAA6C,EAC3C,KAAK;KACR,CAAC;AACJ,CAAC","sourcesContent":["// SPDX-License-Identifier: Apache-2.0\n\n/**\n * A deterministic view of one finished production plan, for a renderer or a reference consumer.\n *\n * The consumer role only changes who is responsible for executing. It does not change the scientific\n * stages or effects, the number of time samples, the seeds or any physical result.\n * @see docs/PRODUCTION_COMPOSITION.md for the equations, units, coordinate conventions, known\n * blockers and support limits.\n */\n\nimport { InvalidConfigurationError } from \"../core/configuration-error.js\";\nimport type {\n  ImageFormationEffectId,\n  ImageFormationStageId\n} from \"../core/image-formation.js\";\nimport {\n  PRODUCTION_IMAGE_FORMATION_PLAN_VERSION,\n  type ProductionImageFormationBlocker,\n  type ProductionImageFormationPlan,\n  type RendererConsumerKind\n} from \"./image-formation-plan.js\";\nimport { requireInputObject, requireInputKeys } from \"../core/record-validation.js\";\n\nexport const PRODUCTION_PLAN_CONSUMER_MANIFEST_VERSION =\n  \"0.2.0\" as const;\n\nexport interface CreateProductionPlanConsumerManifestInput {\n  plan: ProductionImageFormationPlan;\n  consumerKind: RendererConsumerKind;\n}\n\nexport interface ProductionPlanConsumerManifest {\n  version:\n    typeof PRODUCTION_PLAN_CONSUMER_MANIFEST_VERSION;\n  consumerKind: RendererConsumerKind;\n  planVersion:\n    typeof PRODUCTION_IMAGE_FORMATION_PLAN_VERSION;\n  planFingerprint: string;\n  planStatus:\n    ProductionImageFormationPlan[\"status\"];\n  activeOrModeledStages:\n    readonly {\n      stageId: ImageFormationStageId;\n      state: \"active\" | \"modeled-zero\";\n      modelId?: string;\n      modelVersion?: string;\n      resultIdentity?: string;\n    }[];\n  activeOrModeledEffects:\n    readonly {\n      effectId: ImageFormationEffectId;\n      state: \"active\" | \"modeled-zero\";\n      modelId?: string;\n      modelVersion?: string;\n    }[];\n  blockers:\n    readonly ProductionImageFormationBlocker[];\n  /** The same immutable RAW and output results that ran. A consumer cannot re-render from a different source. */\n  environmentCaptureResult?: ProductionImageFormationPlan[\"environmentCaptureResult\"];\n  processedOutputResult?: ProductionImageFormationPlan[\"processedOutputResult\"];\n  physicalSceneToSensorResult:\n    ProductionImageFormationPlan[\"physicalSceneToSensorResult\"];\n  temporalCaptureResult:\n    ProductionImageFormationPlan[\"temporalCaptureResult\"];\n  scientificAssurance:\n    ProductionImageFormationPlan[\"scientificAssurance\"];\n  stochastic: {\n    captureSeedUint32: number;\n    consumerMayReplaceSeed: false;\n    backendRandomnessMayRedefineScientificResult:\n      false;\n  };\n  scientificSemanticsSharedAcrossConsumerKinds:\n    true;\n  consumerMayChangeScientificInputs:\n    false;\n  consumerMayReorderImageFormationStages:\n    false;\n  consumerMayReduceCommittedTemporalSampleCount:\n    false;\n}\n\nfunction requireConsumerKind(\n  value: unknown\n): RendererConsumerKind {\n  if (\n    value !== \"interactive-optimized\" &&\n    value !== \"reference\"\n  ) {\n    throw new InvalidConfigurationError(\n      \"consumerKind is invalid.\"\n    );\n  }\n  return value;\n}\n\nfunction requirePlan(\n  plan: ProductionImageFormationPlan\n): void {\n  requireInputObject(plan, \"plan input\");\n  if (\n    plan.version !==\n    PRODUCTION_IMAGE_FORMATION_PLAN_VERSION\n  ) {\n    throw new InvalidConfigurationError(\n      'plan.version must be \"' +\n        PRODUCTION_IMAGE_FORMATION_PLAN_VERSION +\n        '\".'\n    );\n  }\n  if (\n    typeof plan.fingerprint?.value !==\n      \"string\" ||\n    plan.fingerprint.value.length === 0\n  ) {\n    throw new InvalidConfigurationError(\n      \"plan fingerprint must be present.\"\n    );\n  }\n}\n\n/**\n * Creates a deterministic view of one finished production plan, for a renderer\n * or a reference consumer.\n *\n * The consumer role only changes who is responsible for executing. It does not\n * change the scientific stages or effects, the number of time samples, the\n * seeds or any physical result.\n */\nexport function createProductionPlanConsumerManifest(\n  input:\n    CreateProductionPlanConsumerManifestInput\n): ProductionPlanConsumerManifest {\n  requireInputKeys(input, \"createProductionPlanConsumerManifest\", [\"plan\", \"consumerKind\"]);\n  requirePlan(input.plan);\n  const consumerKind =\n    requireConsumerKind(\n      input.consumerKind\n    );\n\n  const activeOrModeledStages =\n    input.plan.stagePlan\n      .filter(\n        (stage) =>\n          stage.state ===\n            \"active\" ||\n          stage.state ===\n            \"modeled-zero\"\n      )\n      .map((stage) => ({\n        stageId: stage.stageId,\n        state: stage.state as\n          | \"active\"\n          | \"modeled-zero\",\n        ...(stage.modelId ===\n        undefined\n          ? {}\n          : {\n              modelId:\n                stage.modelId\n            }),\n        ...(stage.modelVersion ===\n        undefined\n          ? {}\n          : {\n              modelVersion:\n                stage.modelVersion\n            }),\n        ...(stage.resultIdentity ===\n        undefined\n          ? {}\n          : {\n              resultIdentity:\n                stage.resultIdentity\n            })\n      }));\n\n  const activeOrModeledEffects =\n    input.plan.effectPlan\n      .filter(\n        (effect) =>\n          effect.state ===\n            \"active\" ||\n          effect.state ===\n            \"modeled-zero\"\n      )\n      .map((effect) => ({\n        effectId: effect.effectId,\n        state: effect.state as\n          | \"active\"\n          | \"modeled-zero\",\n        ...(effect.modelId ===\n        undefined\n          ? {}\n          : {\n              modelId:\n                effect.modelId\n            }),\n        ...(effect.modelVersion ===\n        undefined\n          ? {}\n          : {\n              modelVersion:\n                effect.modelVersion\n            })\n      }));\n\n  return {\n    version:\n      PRODUCTION_PLAN_CONSUMER_MANIFEST_VERSION,\n    consumerKind,\n    planVersion:\n      PRODUCTION_IMAGE_FORMATION_PLAN_VERSION,\n    planFingerprint:\n      input.plan.fingerprint.value,\n    planStatus:\n      input.plan.status,\n    activeOrModeledStages,\n    activeOrModeledEffects,\n    ...(input.plan.environmentCaptureResult === undefined ? {} : { environmentCaptureResult: input.plan.environmentCaptureResult }),\n    ...(input.plan.processedOutputResult === undefined ? {} : { processedOutputResult: input.plan.processedOutputResult }),\n    blockers:\n      input.plan.blockers,\n    physicalSceneToSensorResult:\n      input.plan\n        .physicalSceneToSensorResult,\n    temporalCaptureResult:\n      input.plan.temporalCaptureResult,\n    scientificAssurance:\n      input.plan.scientificAssurance,\n    stochastic: {\n      captureSeedUint32:\n        input.plan.stochastic\n          .captureSeedUint32,\n      consumerMayReplaceSeed: false,\n      backendRandomnessMayRedefineScientificResult:\n        false\n    },\n    scientificSemanticsSharedAcrossConsumerKinds:\n      true,\n    consumerMayChangeScientificInputs:\n      false,\n    consumerMayReorderImageFormationStages:\n      false,\n    consumerMayReduceCommittedTemporalSampleCount:\n      false\n  };\n}\n"]}

package/dist/core/calculation-result.d.ts

@@ -22,8 +22,8 @@ export type UncertaintySource = "measurement" | "model-approximation" | "calibra
 /**
  * Optional confidence metadata for a quantified uncertainty estimate.
  *
- * A confidence level is only meaningful when the basis can be stated. It must
- * not be used as a generic subjective confidence score.
+ * Give a confidence level only when you can state its basis. Do not use it as a
+ * general, subjective confidence score.
  */
 export interface UncertaintyConfidence {
     /** Confidence/coverage level as a fraction in the interval (0, 1]. */
@@ -61,8 +61,8 @@ export interface RelativeUncertaintyEstimate extends UncertaintyEstimateBase {
 }
 export type UncertaintyEstimate = AbsoluteUncertaintyEstimate | RelativeUncertaintyEstimate;
 /**
- * Documented parameter range over which a model/calibration is considered
- * valid. This is model applicability metadata, not a statistical interval.
+ * The documented parameter range in which a model or calibration is valid.
+ * It says where the model applies. It is not a statistical interval.
  */
 export interface CalculationValidRange {
     /** JSON-style input/model parameter path, e.g. input.focusDistanceM. */
@@ -76,10 +76,10 @@ export interface CalculationValidRange {
 /**
  * Optional quality metadata for a calculation result.
  *
- * Components remain separate by default. Callers must not add, combine in
- * quadrature, or otherwise collapse uncertainty components unless a
- * scientifically justified composition method explicitly documents
- * independence/correlation assumptions.
+ * Uncertainty components stay separate. Do not add them, combine them in
+ * quadrature (root-sum-of-squares) or merge them in any other way, unless you use
+ * a scientifically justified method that documents its independence and
+ * correlation assumptions.
  */
 export interface CalculationQuality {
     uncertainty?: readonly UncertaintyEstimate[];
@@ -89,15 +89,19 @@ export interface CalculationQuality {
 /**
  * Standard result envelope for public scientific calculations.
  *
- * Deterministic analytical results remain lightweight: quality is omitted when
- * there is no defensible uncertainty/accuracy metadata to report.
+ * Deterministic analytical results stay lightweight. They omit `quality` when
+ * there is no defensible uncertainty or accuracy metadata to report.
+ *
+ * Read-only from 2.0.0: the envelope, `provenance` and `quality` are frozen deeply and `value`
+ * at its top level. Copy a value before changing it. Typed arrays inside a value stay mutable.
+ * See docs/API_STYLE.md "Read-only results".
  *
  * @typeParam T Serializable value returned by the calculation.
  */
 export interface CalculationResult<T> {
-    value: T;
-    provenance: CalculationProvenance;
-    quality?: CalculationQuality;
+    readonly value: T;
+    readonly provenance: CalculationProvenance;
+    readonly quality?: CalculationQuality;
 }
 /**
  * Validates result-quality metadata before it enters a public result envelope.
@@ -105,6 +109,10 @@ export interface CalculationResult<T> {
  * @param quality Optional calculation quality metadata.
  */
 export declare function validateCalculationQuality(quality: CalculationQuality | undefined): void;
+/** Internal: exact answer of containsNonFiniteNumber, using the memo-free pre-scan when it decides. */
+export declare function calculationValueContainsNonFiniteNumber(value: unknown): boolean;
+/** Internal: the exact visited-set scan, exposed for equivalence tests only. */
+export declare function calculationValueContainsNonFiniteNumberExact(value: unknown): boolean;
 /**
  * Creates a deterministic calculated-result envelope.
  */
@@ -122,4 +130,3 @@ export declare function estimatedResult<T>(value: T, model: string, modelVersion
  */
 export declare function calibratedResult<T>(value: T, model: string, modelVersion: string, assumptions: readonly string[], quality: CalculationQuality): CalculationResult<T>;
 export {};
-//# sourceMappingURL=calculation-result.d.ts.map

package/dist/core/calculation-result.js

@@ -1,11 +1,14 @@
 // SPDX-License-Identifier: Apache-2.0
 /**
- * Module boundary and integration notes.
- * Validates result-quality metadata before it enters a public result envelope.
- * Creates a deterministic calculated-result envelope.
+ * The standard result envelope that every public calculation returns.
+ *
+ * An envelope pairs a value with provenance (how it was produced) and, when it can be
+ * stated, quality metadata (uncertainty and validity range). This module defines those
+ * types, validates quality metadata, and provides one constructor per provenance kind.
  * @see docs/API_STYLE.md for equations, coordinate/unit conventions, blockers and support limits.
  */
 import { InvalidScientificResultError } from "./validation.js";
+import { rejectUnknownFields, requireInputObject } from "./record-validation.js";
 const UNCERTAINTY_SOURCES = new Set([
     "measurement",
     "model-approximation",
@@ -25,6 +28,8 @@ function validateConfidence(confidence, path) {
     if (confidence === undefined) {
         return;
     }
+    requireInputObject(confidence, `Calculation quality field ${path}`);
+    rejectUnknownFields(confidence, ["level", "basis"], `calculationQuality.${path}`);
     if (!Number.isFinite(confidence.level) ||
         confidence.level <= 0 ||
         confidence.level > 1) {
@@ -32,8 +37,15 @@ function validateConfidence(confidence, path) {
     }
     requireNonEmptyString(`${path}.basis`, confidence.basis);
 }
+const UNCERTAINTY_BASE_KEYS = ["kind", "quantityPath", "source", "confidence", "note"];
+const ABSOLUTE_UNCERTAINTY_KEYS = [...UNCERTAINTY_BASE_KEYS, "plusMinus", "unit"];
+const RELATIVE_UNCERTAINTY_KEYS = [...UNCERTAINTY_BASE_KEYS, "fraction"];
 function validateUncertaintyEstimate(estimate, index) {
     const path = `uncertainty[${index}]`;
+    requireInputObject(estimate, `Calculation quality field ${path}`);
+    if (estimate.kind === "absolute" || estimate.kind === "relative") {
+        rejectUnknownFields(estimate, estimate.kind === "absolute" ? ABSOLUTE_UNCERTAINTY_KEYS : RELATIVE_UNCERTAINTY_KEYS, `calculationQuality.${path}`);
+    }
     requireNonEmptyString(`${path}.quantityPath`, estimate.quantityPath);
     if (!UNCERTAINTY_SOURCES.has(estimate.source)) {
         throw new InvalidScientificResultError(`Calculation quality field ${path}.source is invalid.`);
@@ -55,6 +67,8 @@ function validateUncertaintyEstimate(estimate, index) {
 }
 function validateValidRange(range, index) {
     const path = `validRanges[${index}]`;
+    requireInputObject(range, `Calculation quality field ${path}`);
+    rejectUnknownFields(range, ["parameterPath", "unit", "minimum", "maximum", "note"], `calculationQuality.${path}`);
     requireNonEmptyString(`${path}.parameterPath`, range.parameterPath);
     requireNonEmptyString(`${path}.unit`, range.unit);
     if (range.minimum === undefined && range.maximum === undefined) {
@@ -84,6 +98,8 @@ export function validateCalculationQuality(quality) {
     if (quality === undefined) {
         return;
     }
+    requireInputObject(quality, "validateCalculationQuality input");
+    rejectUnknownFields(quality, ["uncertainty", "validRanges", "notes"], "calculationQuality");
     if (quality.uncertainty !== undefined) {
         if (quality.uncertainty.length === 0) {
             throw new InvalidScientificResultError("Calculation quality uncertainty must be omitted rather than empty.");
@@ -134,17 +150,199 @@ function assertFiniteNumbers(value, path, seen) {
         assertFiniteNumbers(entry, `${path}.${key}`, seen);
     }
 }
+/**
+ * Fast check for a non-finite number anywhere in a value tree. It builds no path strings.
+ *
+ * It walks the tree exactly as assertFiniteNumbers does: own enumerable string keys in
+ * Object.keys order (as Object.entries), array indices that are present (as forEach), and
+ * each object once. The slower diagnostic walk runs only when this finds a non-finite
+ * number, so the thrown error type and path message are unchanged.
+ */
+function containsNonFiniteNumber(value, seen) {
+    if (typeof value === "number") {
+        return !Number.isFinite(value);
+    }
+    if (typeof value !== "object" || value === null || seen.has(value)) {
+        return false;
+    }
+    seen.add(value);
+    if (Array.isArray(value)) {
+        for (let index = 0; index < value.length; index++) {
+            if (index in value && containsNonFiniteNumber(value[index], seen)) {
+                return true;
+            }
+        }
+        return false;
+    }
+    const record = value;
+    const keys = Object.keys(record);
+    for (let index = 0; index < keys.length; index++) {
+        if (containsNonFiniteNumber(record[keys[index]], seen)) {
+            return true;
+        }
+    }
+    return false;
+}
+/** Object visits allowed to the memo-free pre-scan before it defers to the exact visited-set scan. */
+const FAST_FINITE_SCAN_MAX_OBJECT_VISITS = 1 << 16;
+/** Nesting allowed to the memo-free pre-scan; a cycle or very deep tree defers to the exact scan. */
+const FAST_FINITE_SCAN_MAX_DEPTH = 64;
+const FAST_SCAN_FINITE = 0, FAST_SCAN_NON_FINITE = 1, FAST_SCAN_UNDECIDED = 2;
+/** Remaining object visits of the active pre-scan; saved and restored around nested scans. */
+let fastFiniteScanBudget = 0;
+/**
+ * Faster pre-scan that skips the visited-object WeakSet (a 2.0 performance change).
+ *
+ * It walks the tree like containsNonFiniteNumber (own enumerable string keys in Object.keys
+ * order, present array indices). Without a WeakSet it may visit a shared node more than once.
+ * So it gives up and returns UNDECIDED after FAST_FINITE_SCAN_MAX_OBJECT_VISITS objects or
+ * FAST_FINITE_SCAN_MAX_DEPTH levels of nesting. Any cycle hits the depth limit.
+ *
+ * Revisiting cannot change the answer, because the set of reachable numbers is the same
+ * either way. A non-finite number it finds is reachable, and a finished scan has seen every
+ * reachable number. So any decided answer equals the exact scan's answer. UNDECIDED falls
+ * back to the exact scan.
+ */
+function scanNonFiniteWithoutMemo(value, depth) {
+    if (typeof value === "number") {
+        return Number.isFinite(value) ? FAST_SCAN_FINITE : FAST_SCAN_NON_FINITE;
+    }
+    if (typeof value !== "object" || value === null) {
+        return FAST_SCAN_FINITE;
+    }
+    if (depth >= FAST_FINITE_SCAN_MAX_DEPTH || --fastFiniteScanBudget < 0) {
+        return FAST_SCAN_UNDECIDED;
+    }
+    if (Array.isArray(value)) {
+        for (let index = 0; index < value.length; index++) {
+            if (index in value) {
+                const entry = value[index];
+                if (typeof entry === "number") {
+                    if (!Number.isFinite(entry))
+                        return FAST_SCAN_NON_FINITE;
+                }
+                else if (typeof entry === "object" && entry !== null) {
+                    const result = scanNonFiniteWithoutMemo(entry, depth + 1);
+                    if (result !== FAST_SCAN_FINITE)
+                        return result;
+                }
+            }
+        }
+        return FAST_SCAN_FINITE;
+    }
+    const record = value;
+    const keys = Object.keys(record);
+    for (let index = 0; index < keys.length; index++) {
+        const entry = record[keys[index]];
+        if (typeof entry === "number") {
+            if (!Number.isFinite(entry))
+                return FAST_SCAN_NON_FINITE;
+        }
+        else if (typeof entry === "object" && entry !== null) {
+            const result = scanNonFiniteWithoutMemo(entry, depth + 1);
+            if (result !== FAST_SCAN_FINITE)
+                return result;
+        }
+    }
+    return FAST_SCAN_FINITE;
+}
+/** Internal: exact answer of containsNonFiniteNumber, using the memo-free pre-scan when it decides. */
+export function calculationValueContainsNonFiniteNumber(value) {
+    const saved = fastFiniteScanBudget;
+    fastFiniteScanBudget = FAST_FINITE_SCAN_MAX_OBJECT_VISITS;
+    let result;
+    try {
+        result = scanNonFiniteWithoutMemo(value, 0);
+    }
+    finally {
+        fastFiniteScanBudget = saved;
+    }
+    return result === FAST_SCAN_UNDECIDED ? containsNonFiniteNumber(value, new WeakSet()) : result === FAST_SCAN_NON_FINITE;
+}
+/** Internal: the exact visited-set scan, exposed for equivalence tests only. */
+export function calculationValueContainsNonFiniteNumberExact(value) {
+    return containsNonFiniteNumber(value, new WeakSet());
+}
 function assertFiniteCalculationValue(value) {
-    assertFiniteNumbers(value, "value", new WeakSet());
+    if (calculationValueContainsNonFiniteNumber(value)) {
+        assertFiniteNumbers(value, "value", new WeakSet());
+    }
+}
+function validateProvenanceIdentity(provenance) {
+    for (const field of ["model", "modelVersion"]) {
+        const entry = provenance[field];
+        if (typeof entry !== "string" || entry.trim().length === 0) {
+            throw new InvalidScientificResultError(`Calculation provenance ${field} must be a non-empty string.`);
+        }
+    }
+}
+/**
+ * Estimated and calibrated results must carry quality metadata. The TypeScript
+ * signature alone cannot stop a JavaScript caller from leaving it out, so check at runtime.
+ */
+function requireQuality(quality, kind) {
+    if (quality === undefined || quality === null) {
+        throw new InvalidScientificResultError(`A ${kind} result requires calculation quality metadata.`);
+    }
+    return quality;
 }
+/** True for a plain record (prototype Object.prototype or null) or an array: the nodes a result freezes. */
+function isFreezableResultNode(node) {
+    if (node === null || typeof node !== "object") {
+        return false;
+    }
+    if (Array.isArray(node)) {
+        return true;
+    }
+    const prototype = Object.getPrototypeOf(node);
+    return prototype === Object.prototype || prototype === null;
+}
+/**
+ * Deep-freezes the plain records and arrays of provenance or quality metadata in place. A node
+ * that is already frozen is not walked again, which also ends any cycle.
+ */
+function freezeMetadataTree(node) {
+    if (!isFreezableResultNode(node) || Object.isFrozen(node)) {
+        return;
+    }
+    Object.freeze(node);
+    for (const entry of Object.values(node)) {
+        freezeMetadataTree(entry);
+    }
+}
+/**
+ * Read-only result envelopes (from 2.0.0). The envelope, its provenance (with assumptions) and
+ * its quality metadata are frozen deeply. `value` is frozen at its top level only:
+ *
+ * - Every public calculation builds at least one envelope, many per call on hot paths. A generic
+ *   deep walk of `value` made a small scalar call about 3× slower; this shallow freeze costs
+ *   about 1.4× (measured, docs/API_STYLE.md "Read-only results").
+ * - A deep freeze would also freeze any caller-owned object that a value holds by reference.
+ *   test/result-envelope-freeze.test.ts checks that a calculation leaves its input as it was.
+ * - Typed arrays, DataViews and ArrayBuffers cannot be frozen and stay mutable. Class
+ *   instances, Maps and Sets are not frozen.
+ * - Domains that own their data still deep-freeze it (captures, RAW attachments, presets and
+ *   export metadata use freezeOwnedData), so those values are read-only all the way down.
+ */
 function createResult(value, provenance, quality) {
+    validateProvenanceIdentity(provenance);
     assertFiniteCalculationValue(value);
     validateCalculationQuality(quality);
-    return {
-        value,
-        provenance,
-        ...(quality === undefined ? {} : { quality })
-    };
+    if (isFreezableResultNode(value)) {
+        Object.freeze(value);
+    }
+    // Provenance holds only strings and the assumptions array of strings, so freezing those two
+    // objects freezes it completely. This avoids a generic walk on every result (a measured hot
+    // path; see docs/API_STYLE.md "Read-only results").
+    Object.freeze(provenance);
+    const assumptions = provenance.assumptions;
+    if (assumptions !== undefined && !Object.isFrozen(assumptions)) {
+        Object.freeze(assumptions);
+    }
+    if (quality !== undefined) {
+        freezeMetadataTree(quality);
+    }
+    return Object.freeze(quality === undefined ? { value, provenance } : { value, provenance, quality });
 }
 /**
  * Creates a deterministic calculated-result envelope.
@@ -177,7 +375,7 @@ export function estimatedResult(value, model, modelVersion, assumptions, quality
         model,
         modelVersion,
         assumptions
-    }, quality);
+    }, requireQuality(quality, "estimated"));
 }
 /**
  * Creates a calibrated-result envelope with explicit quality metadata.
@@ -188,6 +386,6 @@ export function calibratedResult(value, model, modelVersion, assumptions, qualit
         model,
         modelVersion,
         assumptions
-    }, quality);
+    }, requireQuality(quality, "calibrated"));
 }
 //# sourceMappingURL=calculation-result.js.map

package/dist/core/calculation-result.js.map

@@ -1 +1 @@
-{"version":3,"file":"calculation-result.js","sourceRoot":"","sources":["../../src/core/calculation-result.ts"],"names":[],"mappings":"AAAA,sCAAsC;AAEtC;;;;;GAKG;AAEH,OAAO,EAAE,4BAA4B,EAAE,MAAM,iBAAiB,CAAC;AA2H/D,MAAM,mBAAmB,GAAG,IAAI,GAAG,CAAoB;IACrD,aAAa;IACb,qBAAqB;IACrB,aAAa;CACd,CAAC,CAAC;AAEH,SAAS,qBAAqB,CAAC,IAAY,EAAE,KAAc;IACzD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3D,MAAM,IAAI,4BAA4B,CACpC,6BAA6B,IAAI,qBAAqB,CACvD,CAAC;IACJ,CAAC;AACH,CAAC;AAED,SAAS,wBAAwB,CAAC,IAAY,EAAE,KAAa;IAC3D,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACzC,MAAM,IAAI,4BAA4B,CACpC,6BAA6B,IAAI,oDAAoD,CACtF,CAAC;IACJ,CAAC;AACH,CAAC;AAED,SAAS,kBAAkB,CACzB,UAA6C,EAC7C,IAAY;IAEZ,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC7B,OAAO;IACT,CAAC;IAED,IACE,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,KAAK,CAAC;QAClC,UAAU,CAAC,KAAK,IAAI,CAAC;QACrB,UAAU,CAAC,KAAK,GAAG,CAAC,EACpB,CAAC;QACD,MAAM,IAAI,4BAA4B,CACpC,6BAA6B,IAAI,2BAA2B,CAC7D,CAAC;IACJ,CAAC;IACD,qBAAqB,CAAC,GAAG,IAAI,QAAQ,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC;AAC3D,CAAC;AAED,SAAS,2BAA2B,CAClC,QAA6B,EAC7B,KAAa;IAEb,MAAM,IAAI,GAAG,eAAe,KAAK,GAAG,CAAC;IACrC,qBAAqB,CAAC,GAAG,IAAI,eAAe,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC;IACrE,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,QAAQ,CAAC,MAA2B,CAAC,EAAE,CAAC;QACnE,MAAM,IAAI,4BAA4B,CACpC,6BAA6B,IAAI,qBAAqB,CACvD,CAAC;IACJ,CAAC;IACD,kBAAkB,CAAC,QAAQ,CAAC,UAAU,EAAE,GAAG,IAAI,aAAa,CAAC,CAAC;IAE9D,IAAI,QAAQ,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAChC,qBAAqB,CAAC,GAAG,IAAI,OAAO,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;IACvD,CAAC;IAED,IAAI,QAAQ,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QACjC,wBAAwB,CAAC,GAAG,IAAI,YAAY,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC;QAClE,qBAAqB,CAAC,GAAG,IAAI,OAAO,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;QACrD,OAAO;IACT,CAAC;IAED,IAAI,QAAQ,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QACjC,wBAAwB,CAAC,GAAG,IAAI,WAAW,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAChE,OAAO;IACT,CAAC;IAED,MAAM,IAAI,4BAA4B,CACpC,6BAA6B,IAAI,mBAAmB,CACrD,CAAC;AACJ,CAAC;AAED,SAAS,kBAAkB,CACzB,KAA4B,EAC5B,KAAa;IAEb,MAAM,IAAI,GAAG,eAAe,KAAK,GAAG,CAAC;IACrC,qBAAqB,CAAC,GAAG,IAAI,gBAAgB,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC;IACpE,qBAAqB,CAAC,GAAG,IAAI,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;IAElD,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;QAC/D,MAAM,IAAI,4BAA4B,CACpC,6BAA6B,IAAI,mCAAmC,CACrE,CAAC;IACJ,CAAC;IAED,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;QACnE,MAAM,IAAI,4BAA4B,CACpC,6BAA6B,IAAI,0BAA0B,CAC5D,CAAC;IACJ,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;QACnE,MAAM,IAAI,4BAA4B,CACpC,6BAA6B,IAAI,0BAA0B,CAC5D,CAAC;IACJ,CAAC;IACD,IACE,KAAK,CAAC,OAAO,KAAK,SAAS;QAC3B,KAAK,CAAC,OAAO,KAAK,SAAS;QAC3B,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC,OAAO,EAC7B,CAAC;QACD,MAAM,IAAI,4BAA4B,CACpC,6BAA6B,IAAI,mCAAmC,CACrE,CAAC;IACJ,CAAC;IACD,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC7B,qBAAqB,CAAC,GAAG,IAAI,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;IACpD,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,0BAA0B,CACxC,OAAuC;IAEvC,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;QAC1B,OAAO;IACT,CAAC;IAED,IAAI,OAAO,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;QACtC,IAAI,OAAO,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrC,MAAM,IAAI,4BAA4B,CACpC,oEAAoE,CACrE,CAAC;QACJ,CAAC;QACD,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,2BAA2B,CAAC,CAAC;IAC3D,CAAC;IAED,IAAI,OAAO,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;QACtC,IAAI,OAAO,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrC,MAAM,IAAI,4BAA4B,CACpC,oEAAoE,CACrE,CAAC;QACJ,CAAC;QACD,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC;IAClD,CAAC;IAED,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QAChC,IAAI,OAAO,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC/B,MAAM,IAAI,4BAA4B,CACpC,8DAA8D,CAC/D,CAAC;QACJ,CAAC;QACD,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;YACpC,qBAAqB,CAAC,SAAS,KAAK,GAAG,EAAE,IAAI,CAAC,CAAC;QACjD,CAAC,CAAC,CAAC;IACL,CAAC;IAED,IACE,OAAO,CAAC,WAAW,KAAK,SAAS;QACjC,OAAO,CAAC,WAAW,KAAK,SAAS;QACjC,OAAO,CAAC,KAAK,KAAK,SAAS,EAC3B,CAAC;QACD,MAAM,IAAI,4BAA4B,CACpC,sEAAsE,CACvE,CAAC;IACJ,CAAC;AACH,CAAC;AAED,SAAS,mBAAmB,CAC1B,KAAc,EACd,IAAY,EACZ,IAAqB;IAErB,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,4BAA4B,CACpC,+CAA+C,IAAI,GAAG,CACvD,CAAC;QACJ,CAAC;QACD,OAAO;IACT,CAAC;IAED,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QAChD,OAAO;IACT,CAAC;IAED,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QACpB,OAAO;IACT,CAAC;IACD,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAEhB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;YAC7B,mBAAmB,CAAC,KAAK,EAAE,GAAG,IAAI,IAAI,KAAK,GAAG,EAAE,IAAI,CAAC,CAAC;QACxD,CAAC,CAAC,CAAC;QACH,OAAO;IACT,CAAC;IAED,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACjD,mBAAmB,CAAC,KAAK,EAAE,GAAG,IAAI,IAAI,GAAG,EAAE,EAAE,IAAI,CAAC,CAAC;IACrD,CAAC;AACH,CAAC;AAED,SAAS,4BAA4B,CAAC,KAAc;IAClD,mBAAmB,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,OAAO,EAAU,CAAC,CAAC;AAC7D,CAAC;AAED,SAAS,YAAY,CACnB,KAAQ,EACR,UAAiC,EACjC,OAA4B;IAE5B,4BAA4B,CAAC,KAAK,CAAC,CAAC;IACpC,0BAA0B,CAAC,OAAO,CAAC,CAAC;IAEpC,OAAO;QACL,KAAK;QACL,UAAU;QACV,GAAG,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC;KAC9C,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAC9B,KAAQ,EACR,KAAa,EACb,YAAoB,EACpB,WAA+B,EAC/B,OAA4B;IAE5B,OAAO,YAAY,CACjB,KAAK,EACL;QACE,IAAI,EAAE,YAAY;QAClB,KAAK;QACL,YAAY;QACZ,GAAG,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC;KACtD,EACD,OAAO,CACR,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CACjC,KAAQ,EACR,KAAa,EACb,YAAoB,EACpB,WAA8B,EAC9B,OAA4B;IAE5B,OAAO,YAAY,CACjB,KAAK,EACL;QACE,IAAI,EAAE,eAAe;QACrB,KAAK;QACL,YAAY;QACZ,WAAW;KACZ,EACD,OAAO,CACR,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAC7B,KAAQ,EACR,KAAa,EACb,YAAoB,EACpB,WAA8B,EAC9B,OAA2B;IAE3B,OAAO,YAAY,CACjB,KAAK,EACL;QACE,IAAI,EAAE,WAAW;QACjB,KAAK;QACL,YAAY;QACZ,WAAW;KACZ,EACD,OAAO,CACR,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAC9B,KAAQ,EACR,KAAa,EACb,YAAoB,EACpB,WAA8B,EAC9B,OAA2B;IAE3B,OAAO,YAAY,CACjB,KAAK,EACL;QACE,IAAI,EAAE,YAAY;QAClB,KAAK;QACL,YAAY;QACZ,WAAW;KACZ,EACD,OAAO,CACR,CAAC;AACJ,CAAC"}
+{"version":3,"file":"calculation-result.js","sourceRoot":"","sources":["../../src/core/calculation-result.ts"],"names":[],"mappings":"AAAA,sCAAsC;AAEtC;;;;;;;GAOG;AAEH,OAAO,EAAE,4BAA4B,EAAE,MAAM,iBAAiB,CAAC;AAC/D,OAAO,EAAE,mBAAmB,EAAE,kBAAkB,EAAE,MAAM,wBAAwB,CAAC;AA+HjF,MAAM,mBAAmB,GAAG,IAAI,GAAG,CAAoB;IACrD,aAAa;IACb,qBAAqB;IACrB,aAAa;CACd,CAAC,CAAC;AAEH,SAAS,qBAAqB,CAAC,IAAY,EAAE,KAAc;IACzD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3D,MAAM,IAAI,4BAA4B,CACpC,6BAA6B,IAAI,qBAAqB,CACvD,CAAC;IACJ,CAAC;AACH,CAAC;AAED,SAAS,wBAAwB,CAAC,IAAY,EAAE,KAAa;IAC3D,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACzC,MAAM,IAAI,4BAA4B,CACpC,6BAA6B,IAAI,oDAAoD,CACtF,CAAC;IACJ,CAAC;AACH,CAAC;AAED,SAAS,kBAAkB,CACzB,UAA6C,EAC7C,IAAY;IAEZ,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC7B,OAAO;IACT,CAAC;IACD,kBAAkB,CAAC,UAAU,EAAE,6BAA6B,IAAI,EAAE,CAAC,CAAC;IACpE,mBAAmB,CAAC,UAAU,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,sBAAsB,IAAI,EAAE,CAAC,CAAC;IAElF,IACE,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,KAAK,CAAC;QAClC,UAAU,CAAC,KAAK,IAAI,CAAC;QACrB,UAAU,CAAC,KAAK,GAAG,CAAC,EACpB,CAAC;QACD,MAAM,IAAI,4BAA4B,CACpC,6BAA6B,IAAI,2BAA2B,CAC7D,CAAC;IACJ,CAAC;IACD,qBAAqB,CAAC,GAAG,IAAI,QAAQ,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC;AAC3D,CAAC;AAED,MAAM,qBAAqB,GAAG,CAAC,MAAM,EAAE,cAAc,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,CAAU,CAAC;AAChG,MAAM,yBAAyB,GAAsB,CAAC,GAAG,qBAAqB,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC;AACrG,MAAM,yBAAyB,GAAsB,CAAC,GAAG,qBAAqB,EAAE,UAAU,CAAC,CAAC;AAE5F,SAAS,2BAA2B,CAClC,QAA6B,EAC7B,KAAa;IAEb,MAAM,IAAI,GAAG,eAAe,KAAK,GAAG,CAAC;IACrC,kBAAkB,CAAC,QAAQ,EAAE,6BAA6B,IAAI,EAAE,CAAC,CAAC;IAClE,IAAI,QAAQ,CAAC,IAAI,KAAK,UAAU,IAAI,QAAQ,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QACjE,mBAAmB,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,yBAAyB,CAAC,CAAC,CAAC,yBAAyB,EAChH,sBAAsB,IAAI,EAAE,CAAC,CAAC;IAClC,CAAC;IACD,qBAAqB,CAAC,GAAG,IAAI,eAAe,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC;IACrE,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,QAAQ,CAAC,MAA2B,CAAC,EAAE,CAAC;QACnE,MAAM,IAAI,4BAA4B,CACpC,6BAA6B,IAAI,qBAAqB,CACvD,CAAC;IACJ,CAAC;IACD,kBAAkB,CAAC,QAAQ,CAAC,UAAU,EAAE,GAAG,IAAI,aAAa,CAAC,CAAC;IAE9D,IAAI,QAAQ,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAChC,qBAAqB,CAAC,GAAG,IAAI,OAAO,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;IACvD,CAAC;IAED,IAAI,QAAQ,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QACjC,wBAAwB,CAAC,GAAG,IAAI,YAAY,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC;QAClE,qBAAqB,CAAC,GAAG,IAAI,OAAO,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;QACrD,OAAO;IACT,CAAC;IAED,IAAI,QAAQ,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QACjC,wBAAwB,CAAC,GAAG,IAAI,WAAW,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAChE,OAAO;IACT,CAAC;IAED,MAAM,IAAI,4BAA4B,CACpC,6BAA6B,IAAI,mBAAmB,CACrD,CAAC;AACJ,CAAC;AAED,SAAS,kBAAkB,CACzB,KAA4B,EAC5B,KAAa;IAEb,MAAM,IAAI,GAAG,eAAe,KAAK,GAAG,CAAC;IACrC,kBAAkB,CAAC,KAAK,EAAE,6BAA6B,IAAI,EAAE,CAAC,CAAC;IAC/D,mBAAmB,CAAC,KAAK,EAAE,CAAC,eAAe,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,sBAAsB,IAAI,EAAE,CAAC,CAAC;IAClH,qBAAqB,CAAC,GAAG,IAAI,gBAAgB,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC;IACpE,qBAAqB,CAAC,GAAG,IAAI,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;IAElD,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;QAC/D,MAAM,IAAI,4BAA4B,CACpC,6BAA6B,IAAI,mCAAmC,CACrE,CAAC;IACJ,CAAC;IAED,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;QACnE,MAAM,IAAI,4BAA4B,CACpC,6BAA6B,IAAI,0BAA0B,CAC5D,CAAC;IACJ,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;QACnE,MAAM,IAAI,4BAA4B,CACpC,6BAA6B,IAAI,0BAA0B,CAC5D,CAAC;IACJ,CAAC;IACD,IACE,KAAK,CAAC,OAAO,KAAK,SAAS;QAC3B,KAAK,CAAC,OAAO,KAAK,SAAS;QAC3B,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC,OAAO,EAC7B,CAAC;QACD,MAAM,IAAI,4BAA4B,CACpC,6BAA6B,IAAI,mCAAmC,CACrE,CAAC;IACJ,CAAC;IACD,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC7B,qBAAqB,CAAC,GAAG,IAAI,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;IACpD,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,0BAA0B,CACxC,OAAuC;IAEvC,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;QAC1B,OAAO;IACT,CAAC;IACD,kBAAkB,CAAC,OAAO,EAAE,kCAAkC,CAAC,CAAC;IAChE,mBAAmB,CAAC,OAAO,EAAE,CAAC,aAAa,EAAE,aAAa,EAAE,OAAO,CAAC,EAAE,oBAAoB,CAAC,CAAC;IAE5F,IAAI,OAAO,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;QACtC,IAAI,OAAO,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrC,MAAM,IAAI,4BAA4B,CACpC,oEAAoE,CACrE,CAAC;QACJ,CAAC;QACD,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,2BAA2B,CAAC,CAAC;IAC3D,CAAC;IAED,IAAI,OAAO,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;QACtC,IAAI,OAAO,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrC,MAAM,IAAI,4BAA4B,CACpC,oEAAoE,CACrE,CAAC;QACJ,CAAC;QACD,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC;IAClD,CAAC;IAED,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QAChC,IAAI,OAAO,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC/B,MAAM,IAAI,4BAA4B,CACpC,8DAA8D,CAC/D,CAAC;QACJ,CAAC;QACD,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;YACpC,qBAAqB,CAAC,SAAS,KAAK,GAAG,EAAE,IAAI,CAAC,CAAC;QACjD,CAAC,CAAC,CAAC;IACL,CAAC;IAED,IACE,OAAO,CAAC,WAAW,KAAK,SAAS;QACjC,OAAO,CAAC,WAAW,KAAK,SAAS;QACjC,OAAO,CAAC,KAAK,KAAK,SAAS,EAC3B,CAAC;QACD,MAAM,IAAI,4BAA4B,CACpC,sEAAsE,CACvE,CAAC;IACJ,CAAC;AACH,CAAC;AAED,SAAS,mBAAmB,CAC1B,KAAc,EACd,IAAY,EACZ,IAAqB;IAErB,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,4BAA4B,CACpC,+CAA+C,IAAI,GAAG,CACvD,CAAC;QACJ,CAAC;QACD,OAAO;IACT,CAAC;IAED,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QAChD,OAAO;IACT,CAAC;IAED,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QACpB,OAAO;IACT,CAAC;IACD,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAEhB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;YAC7B,mBAAmB,CAAC,KAAK,EAAE,GAAG,IAAI,IAAI,KAAK,GAAG,EAAE,IAAI,CAAC,CAAC;QACxD,CAAC,CAAC,CAAC;QACH,OAAO;IACT,CAAC;IAED,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACjD,mBAAmB,CAAC,KAAK,EAAE,GAAG,IAAI,IAAI,GAAG,EAAE,EAAE,IAAI,CAAC,CAAC;IACrD,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,uBAAuB,CAAC,KAAc,EAAE,IAAqB;IACpE,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9B,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC;IACD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QACnE,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAChB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;YAClD,IAAI,KAAK,IAAI,KAAK,IAAI,uBAAuB,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;gBAClE,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,MAAM,MAAM,GAAG,KAAgC,CAAC;IAChD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACjC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;QACjD,IAAI,uBAAuB,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAE,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;YACxD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,sGAAsG;AACtG,MAAM,kCAAkC,GAAG,CAAC,IAAI,EAAE,CAAC;AACnD,qGAAqG;AACrG,MAAM,0BAA0B,GAAG,EAAE,CAAC;AACtC,MAAM,gBAAgB,GAAG,CAAC,EAAE,oBAAoB,GAAG,CAAC,EAAE,mBAAmB,GAAG,CAAC,CAAC;AAC9E,8FAA8F;AAC9F,IAAI,oBAAoB,GAAG,CAAC,CAAC;AAE7B;;;;;;;;;;;;GAYG;AACH,SAAS,wBAAwB,CAAC,KAAc,EAAE,KAAa;IAC7D,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9B,OAAO,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,oBAAoB,CAAC;IAC1E,CAAC;IACD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QAChD,OAAO,gBAAgB,CAAC;IAC1B,CAAC;IACD,IAAI,KAAK,IAAI,0BAA0B,IAAI,EAAE,oBAAoB,GAAG,CAAC,EAAE,CAAC;QACtE,OAAO,mBAAmB,CAAC;IAC7B,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;YAClD,IAAI,KAAK,IAAI,KAAK,EAAE,CAAC;gBACnB,MAAM,KAAK,GAAY,KAAK,CAAC,KAAK,CAAC,CAAC;gBACpC,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;oBAC9B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;wBAAE,OAAO,oBAAoB,CAAC;gBAC3D,CAAC;qBAAM,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;oBACvD,MAAM,MAAM,GAAG,wBAAwB,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;oBAC1D,IAAI,MAAM,KAAK,gBAAgB;wBAAE,OAAO,MAAM,CAAC;gBACjD,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,gBAAgB,CAAC;IAC1B,CAAC;IACD,MAAM,MAAM,GAAG,KAAgC,CAAC;IAChD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACjC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;QACjD,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAE,CAAC,CAAC;QACnC,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC9B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;gBAAE,OAAO,oBAAoB,CAAC;QAC3D,CAAC;aAAM,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;YACvD,MAAM,MAAM,GAAG,wBAAwB,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YAC1D,IAAI,MAAM,KAAK,gBAAgB;gBAAE,OAAO,MAAM,CAAC;QACjD,CAAC;IACH,CAAC;IACD,OAAO,gBAAgB,CAAC;AAC1B,CAAC;AAED,uGAAuG;AACvG,MAAM,UAAU,uCAAuC,CAAC,KAAc;IACpE,MAAM,KAAK,GAAG,oBAAoB,CAAC;IACnC,oBAAoB,GAAG,kCAAkC,CAAC;IAC1D,IAAI,MAAc,CAAC;IACnB,IAAI,CAAC;QACH,MAAM,GAAG,wBAAwB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAC9C,CAAC;YAAS,CAAC;QACT,oBAAoB,GAAG,KAAK,CAAC;IAC/B,CAAC;IACD,OAAO,MAAM,KAAK,mBAAmB,CAAC,CAAC,CAAC,uBAAuB,CAAC,KAAK,EAAE,IAAI,OAAO,EAAU,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,oBAAoB,CAAC;AAClI,CAAC;AAED,gFAAgF;AAChF,MAAM,UAAU,4CAA4C,CAAC,KAAc;IACzE,OAAO,uBAAuB,CAAC,KAAK,EAAE,IAAI,OAAO,EAAU,CAAC,CAAC;AAC/D,CAAC;AAED,SAAS,4BAA4B,CAAC,KAAc;IAClD,IAAI,uCAAuC,CAAC,KAAK,CAAC,EAAE,CAAC;QACnD,mBAAmB,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,OAAO,EAAU,CAAC,CAAC;IAC7D,CAAC;AACH,CAAC;AAED,SAAS,0BAA0B,CAAC,UAAiC;IACnE,KAAK,MAAM,KAAK,IAAI,CAAC,OAAO,EAAE,cAAc,CAAU,EAAE,CAAC;QACvD,MAAM,KAAK,GAAY,UAAU,CAAC,KAAK,CAAC,CAAC;QACzC,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3D,MAAM,IAAI,4BAA4B,CACpC,0BAA0B,KAAK,8BAA8B,CAC9D,CAAC;QACJ,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,cAAc,CACrB,OAAuC,EACvC,IAAgC;IAEhC,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;QAC9C,MAAM,IAAI,4BAA4B,CACpC,KAAK,IAAI,gDAAgD,CAC1D,CAAC;IACJ,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,4GAA4G;AAC5G,SAAS,qBAAqB,CAAC,IAAa;IAC1C,IAAI,IAAI,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC9C,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QACxB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,MAAM,SAAS,GAAY,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;IACvD,OAAO,SAAS,KAAK,MAAM,CAAC,SAAS,IAAI,SAAS,KAAK,IAAI,CAAC;AAC9D,CAAC;AAED;;;GAGG;AACH,SAAS,kBAAkB,CAAC,IAAa;IACvC,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1D,OAAO;IACT,CAAC;IACD,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACpB,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;QACxC,kBAAkB,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,SAAS,YAAY,CACnB,KAAQ,EACR,UAAiC,EACjC,OAA4B;IAE5B,0BAA0B,CAAC,UAAU,CAAC,CAAC;IACvC,4BAA4B,CAAC,KAAK,CAAC,CAAC;IACpC,0BAA0B,CAAC,OAAO,CAAC,CAAC;IAEpC,IAAI,qBAAqB,CAAC,KAAK,CAAC,EAAE,CAAC;QACjC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACvB,CAAC;IACD,4FAA4F;IAC5F,4FAA4F;IAC5F,oDAAoD;IACpD,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;IAC1B,MAAM,WAAW,GAAG,UAAU,CAAC,WAAW,CAAC;IAC3C,IAAI,WAAW,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;QAC/D,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;IAC7B,CAAC;IACD,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;QAC1B,kBAAkB,CAAC,OAAO,CAAC,CAAC;IAC9B,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC;AACvG,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAC9B,KAAQ,EACR,KAAa,EACb,YAAoB,EACpB,WAA+B,EAC/B,OAA4B;IAE5B,OAAO,YAAY,CACjB,KAAK,EACL;QACE,IAAI,EAAE,YAAY;QAClB,KAAK;QACL,YAAY;QACZ,GAAG,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC;KACtD,EACD,OAAO,CACR,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CACjC,KAAQ,EACR,KAAa,EACb,YAAoB,EACpB,WAA8B,EAC9B,OAA4B;IAE5B,OAAO,YAAY,CACjB,KAAK,EACL;QACE,IAAI,EAAE,eAAe;QACrB,KAAK;QACL,YAAY;QACZ,WAAW;KACZ,EACD,OAAO,CACR,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAC7B,KAAQ,EACR,KAAa,EACb,YAAoB,EACpB,WAA8B,EAC9B,OAA2B;IAE3B,OAAO,YAAY,CACjB,KAAK,EACL;QACE,IAAI,EAAE,WAAW;QACjB,KAAK;QACL,YAAY;QACZ,WAAW;KACZ,EACD,cAAc,CAAC,OAAO,EAAE,WAAW,CAAC,CACrC,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAC9B,KAAQ,EACR,KAAa,EACb,YAAoB,EACpB,WAA8B,EAC9B,OAA2B;IAE3B,OAAO,YAAY,CACjB,KAAK,EACL;QACE,IAAI,EAAE,YAAY;QAClB,KAAK;QACL,YAAY;QACZ,WAAW;KACZ,EACD,cAAc,CAAC,OAAO,EAAE,YAAY,CAAC,CACtC,CAAC;AACJ,CAAC","sourcesContent":["// SPDX-License-Identifier: Apache-2.0\n\n/**\n * The standard result envelope that every public calculation returns.\n *\n * An envelope pairs a value with provenance (how it was produced) and, when it can be\n * stated, quality metadata (uncertainty and validity range). This module defines those\n * types, validates quality metadata, and provides one constructor per provenance kind.\n * @see docs/API_STYLE.md for equations, coordinate/unit conventions, blockers and support limits.\n */\n\nimport { InvalidScientificResultError } from \"./validation.js\";\nimport { rejectUnknownFields, requireInputObject } from \"./record-validation.js\";\n\n/**\n * Scientific provenance labels used throughout the public API.\n */\nexport type ProvenanceKind =\n  | \"calculated\"\n  | \"calibrated\"\n  | \"estimated\"\n  | \"approximation\";\n\n/**\n * Metadata describing how a numerical result was produced.\n */\nexport interface CalculationProvenance {\n  /** Classification of the result's scientific origin. */\n  kind: ProvenanceKind;\n  /** Stable identifier for the model or equation set. */\n  model: string;\n  /** Version of the model, independent of the package version. */\n  modelVersion: string;\n  /** Concise assumptions that materially affect interpretation. */\n  assumptions?: readonly string[];\n}\n\n/**\n * Source category for a quantified uncertainty estimate.\n */\nexport type UncertaintySource =\n  | \"measurement\"\n  | \"model-approximation\"\n  | \"calibration\";\n\n/**\n * Optional confidence metadata for a quantified uncertainty estimate.\n *\n * Give a confidence level only when you can state its basis. Do not use it as a\n * general, subjective confidence score.\n */\nexport interface UncertaintyConfidence {\n  /** Confidence/coverage level as a fraction in the interval (0, 1]. */\n  level: number;\n  /** Concise description of the statistical/empirical basis. */\n  basis: string;\n}\n\ninterface UncertaintyEstimateBase {\n  /** JSON-style path to the affected result quantity, e.g. value.distanceM. */\n  quantityPath: string;\n  /** Physical/statistical origin of this uncertainty component. */\n  source: UncertaintySource;\n  /** Optional confidence/coverage metadata when scientifically meaningful. */\n  confidence?: UncertaintyConfidence;\n  /** Concise interpretation note, if needed. */\n  note?: string;\n}\n\n/**\n * Absolute symmetric uncertainty around a result quantity.\n */\nexport interface AbsoluteUncertaintyEstimate extends UncertaintyEstimateBase {\n  kind: \"absolute\";\n  /** Symmetric ± magnitude in the explicitly named unit. */\n  plusMinus: number;\n  /** Explicit unit such as mm, m, px, or \"1\" for dimensionless values. */\n  unit: string;\n}\n\n/**\n * Relative symmetric uncertainty around a result quantity.\n */\nexport interface RelativeUncertaintyEstimate extends UncertaintyEstimateBase {\n  kind: \"relative\";\n  /** Symmetric ± fractional magnitude; 0.05 means ±5%. */\n  fraction: number;\n}\n\nexport type UncertaintyEstimate =\n  | AbsoluteUncertaintyEstimate\n  | RelativeUncertaintyEstimate;\n\n/**\n * The documented parameter range in which a model or calibration is valid.\n * It says where the model applies. It is not a statistical interval.\n */\nexport interface CalculationValidRange {\n  /** JSON-style input/model parameter path, e.g. input.focusDistanceM. */\n  parameterPath: string;\n  /** Explicit unit such as m, mm, ISO, or \"1\" for dimensionless values. */\n  unit: string;\n  minimum?: number;\n  maximum?: number;\n  note?: string;\n}\n\n/**\n * Optional quality metadata for a calculation result.\n *\n * Uncertainty components stay separate. Do not add them, combine them in\n * quadrature (root-sum-of-squares) or merge them in any other way, unless you use\n * a scientifically justified method that documents its independence and\n * correlation assumptions.\n */\nexport interface CalculationQuality {\n  uncertainty?: readonly UncertaintyEstimate[];\n  validRanges?: readonly CalculationValidRange[];\n  notes?: readonly string[];\n}\n\n/**\n * Standard result envelope for public scientific calculations.\n *\n * Deterministic analytical results stay lightweight. They omit `quality` when\n * there is no defensible uncertainty or accuracy metadata to report.\n *\n * Read-only from 2.0.0: the envelope, `provenance` and `quality` are frozen deeply and `value`\n * at its top level. Copy a value before changing it. Typed arrays inside a value stay mutable.\n * See docs/API_STYLE.md \"Read-only results\".\n *\n * @typeParam T Serializable value returned by the calculation.\n */\nexport interface CalculationResult<T> {\n  readonly value: T;\n  readonly provenance: CalculationProvenance;\n  readonly quality?: CalculationQuality;\n}\n\nconst UNCERTAINTY_SOURCES = new Set<UncertaintySource>([\n  \"measurement\",\n  \"model-approximation\",\n  \"calibration\"\n]);\n\nfunction requireNonEmptyString(path: string, value: unknown): void {\n  if (typeof value !== \"string\" || value.trim().length === 0) {\n    throw new InvalidScientificResultError(\n      `Calculation quality field ${path} must not be empty.`\n    );\n  }\n}\n\nfunction requireNonNegativeFinite(path: string, value: number): void {\n  if (!Number.isFinite(value) || value < 0) {\n    throw new InvalidScientificResultError(\n      `Calculation quality field ${path} must be finite and greater than or equal to zero.`\n    );\n  }\n}\n\nfunction validateConfidence(\n  confidence: UncertaintyConfidence | undefined,\n  path: string\n): void {\n  if (confidence === undefined) {\n    return;\n  }\n  requireInputObject(confidence, `Calculation quality field ${path}`);\n  rejectUnknownFields(confidence, [\"level\", \"basis\"], `calculationQuality.${path}`);\n\n  if (\n    !Number.isFinite(confidence.level) ||\n    confidence.level <= 0 ||\n    confidence.level > 1\n  ) {\n    throw new InvalidScientificResultError(\n      `Calculation quality field ${path}.level must be in (0, 1].`\n    );\n  }\n  requireNonEmptyString(`${path}.basis`, confidence.basis);\n}\n\nconst UNCERTAINTY_BASE_KEYS = [\"kind\", \"quantityPath\", \"source\", \"confidence\", \"note\"] as const;\nconst ABSOLUTE_UNCERTAINTY_KEYS: readonly string[] = [...UNCERTAINTY_BASE_KEYS, \"plusMinus\", \"unit\"];\nconst RELATIVE_UNCERTAINTY_KEYS: readonly string[] = [...UNCERTAINTY_BASE_KEYS, \"fraction\"];\n\nfunction validateUncertaintyEstimate(\n  estimate: UncertaintyEstimate,\n  index: number\n): void {\n  const path = `uncertainty[${index}]`;\n  requireInputObject(estimate, `Calculation quality field ${path}`);\n  if (estimate.kind === \"absolute\" || estimate.kind === \"relative\") {\n    rejectUnknownFields(estimate, estimate.kind === \"absolute\" ? ABSOLUTE_UNCERTAINTY_KEYS : RELATIVE_UNCERTAINTY_KEYS,\n      `calculationQuality.${path}`);\n  }\n  requireNonEmptyString(`${path}.quantityPath`, estimate.quantityPath);\n  if (!UNCERTAINTY_SOURCES.has(estimate.source as UncertaintySource)) {\n    throw new InvalidScientificResultError(\n      `Calculation quality field ${path}.source is invalid.`\n    );\n  }\n  validateConfidence(estimate.confidence, `${path}.confidence`);\n\n  if (estimate.note !== undefined) {\n    requireNonEmptyString(`${path}.note`, estimate.note);\n  }\n\n  if (estimate.kind === \"absolute\") {\n    requireNonNegativeFinite(`${path}.plusMinus`, estimate.plusMinus);\n    requireNonEmptyString(`${path}.unit`, estimate.unit);\n    return;\n  }\n\n  if (estimate.kind === \"relative\") {\n    requireNonNegativeFinite(`${path}.fraction`, estimate.fraction);\n    return;\n  }\n\n  throw new InvalidScientificResultError(\n    `Calculation quality field ${path}.kind is invalid.`\n  );\n}\n\nfunction validateValidRange(\n  range: CalculationValidRange,\n  index: number\n): void {\n  const path = `validRanges[${index}]`;\n  requireInputObject(range, `Calculation quality field ${path}`);\n  rejectUnknownFields(range, [\"parameterPath\", \"unit\", \"minimum\", \"maximum\", \"note\"], `calculationQuality.${path}`);\n  requireNonEmptyString(`${path}.parameterPath`, range.parameterPath);\n  requireNonEmptyString(`${path}.unit`, range.unit);\n\n  if (range.minimum === undefined && range.maximum === undefined) {\n    throw new InvalidScientificResultError(\n      `Calculation quality field ${path} must include minimum or maximum.`\n    );\n  }\n\n  if (range.minimum !== undefined && !Number.isFinite(range.minimum)) {\n    throw new InvalidScientificResultError(\n      `Calculation quality field ${path}.minimum must be finite.`\n    );\n  }\n  if (range.maximum !== undefined && !Number.isFinite(range.maximum)) {\n    throw new InvalidScientificResultError(\n      `Calculation quality field ${path}.maximum must be finite.`\n    );\n  }\n  if (\n    range.minimum !== undefined &&\n    range.maximum !== undefined &&\n    range.minimum > range.maximum\n  ) {\n    throw new InvalidScientificResultError(\n      `Calculation quality field ${path} minimum must not exceed maximum.`\n    );\n  }\n  if (range.note !== undefined) {\n    requireNonEmptyString(`${path}.note`, range.note);\n  }\n}\n\n/**\n * Validates result-quality metadata before it enters a public result envelope.\n *\n * @param quality Optional calculation quality metadata.\n */\nexport function validateCalculationQuality(\n  quality: CalculationQuality | undefined\n): void {\n  if (quality === undefined) {\n    return;\n  }\n  requireInputObject(quality, \"validateCalculationQuality input\");\n  rejectUnknownFields(quality, [\"uncertainty\", \"validRanges\", \"notes\"], \"calculationQuality\");\n\n  if (quality.uncertainty !== undefined) {\n    if (quality.uncertainty.length === 0) {\n      throw new InvalidScientificResultError(\n        \"Calculation quality uncertainty must be omitted rather than empty.\"\n      );\n    }\n    quality.uncertainty.forEach(validateUncertaintyEstimate);\n  }\n\n  if (quality.validRanges !== undefined) {\n    if (quality.validRanges.length === 0) {\n      throw new InvalidScientificResultError(\n        \"Calculation quality validRanges must be omitted rather than empty.\"\n      );\n    }\n    quality.validRanges.forEach(validateValidRange);\n  }\n\n  if (quality.notes !== undefined) {\n    if (quality.notes.length === 0) {\n      throw new InvalidScientificResultError(\n        \"Calculation quality notes must be omitted rather than empty.\"\n      );\n    }\n    quality.notes.forEach((note, index) => {\n      requireNonEmptyString(`notes[${index}]`, note);\n    });\n  }\n\n  if (\n    quality.uncertainty === undefined &&\n    quality.validRanges === undefined &&\n    quality.notes === undefined\n  ) {\n    throw new InvalidScientificResultError(\n      \"Calculation quality must contain uncertainty, validRanges, or notes.\"\n    );\n  }\n}\n\nfunction assertFiniteNumbers(\n  value: unknown,\n  path: string,\n  seen: WeakSet<object>\n): void {\n  if (typeof value === \"number\") {\n    if (!Number.isFinite(value)) {\n      throw new InvalidScientificResultError(\n        `Calculation produced a non-finite number at ${path}.`\n      );\n    }\n    return;\n  }\n\n  if (typeof value !== \"object\" || value === null) {\n    return;\n  }\n\n  if (seen.has(value)) {\n    return;\n  }\n  seen.add(value);\n\n  if (Array.isArray(value)) {\n    value.forEach((entry, index) => {\n      assertFiniteNumbers(entry, `${path}[${index}]`, seen);\n    });\n    return;\n  }\n\n  for (const [key, entry] of Object.entries(value)) {\n    assertFiniteNumbers(entry, `${path}.${key}`, seen);\n  }\n}\n\n/**\n * Fast check for a non-finite number anywhere in a value tree. It builds no path strings.\n *\n * It walks the tree exactly as assertFiniteNumbers does: own enumerable string keys in\n * Object.keys order (as Object.entries), array indices that are present (as forEach), and\n * each object once. The slower diagnostic walk runs only when this finds a non-finite\n * number, so the thrown error type and path message are unchanged.\n */\nfunction containsNonFiniteNumber(value: unknown, seen: WeakSet<object>): boolean {\n  if (typeof value === \"number\") {\n    return !Number.isFinite(value);\n  }\n  if (typeof value !== \"object\" || value === null || seen.has(value)) {\n    return false;\n  }\n  seen.add(value);\n  if (Array.isArray(value)) {\n    for (let index = 0; index < value.length; index++) {\n      if (index in value && containsNonFiniteNumber(value[index], seen)) {\n        return true;\n      }\n    }\n    return false;\n  }\n  const record = value as Record<string, unknown>;\n  const keys = Object.keys(record);\n  for (let index = 0; index < keys.length; index++) {\n    if (containsNonFiniteNumber(record[keys[index]!], seen)) {\n      return true;\n    }\n  }\n  return false;\n}\n\n/** Object visits allowed to the memo-free pre-scan before it defers to the exact visited-set scan. */\nconst FAST_FINITE_SCAN_MAX_OBJECT_VISITS = 1 << 16;\n/** Nesting allowed to the memo-free pre-scan; a cycle or very deep tree defers to the exact scan. */\nconst FAST_FINITE_SCAN_MAX_DEPTH = 64;\nconst FAST_SCAN_FINITE = 0, FAST_SCAN_NON_FINITE = 1, FAST_SCAN_UNDECIDED = 2;\n/** Remaining object visits of the active pre-scan; saved and restored around nested scans. */\nlet fastFiniteScanBudget = 0;\n\n/**\n * Faster pre-scan that skips the visited-object WeakSet (a 2.0 performance change).\n *\n * It walks the tree like containsNonFiniteNumber (own enumerable string keys in Object.keys\n * order, present array indices). Without a WeakSet it may visit a shared node more than once.\n * So it gives up and returns UNDECIDED after FAST_FINITE_SCAN_MAX_OBJECT_VISITS objects or\n * FAST_FINITE_SCAN_MAX_DEPTH levels of nesting. Any cycle hits the depth limit.\n *\n * Revisiting cannot change the answer, because the set of reachable numbers is the same\n * either way. A non-finite number it finds is reachable, and a finished scan has seen every\n * reachable number. So any decided answer equals the exact scan's answer. UNDECIDED falls\n * back to the exact scan.\n */\nfunction scanNonFiniteWithoutMemo(value: unknown, depth: number): number {\n  if (typeof value === \"number\") {\n    return Number.isFinite(value) ? FAST_SCAN_FINITE : FAST_SCAN_NON_FINITE;\n  }\n  if (typeof value !== \"object\" || value === null) {\n    return FAST_SCAN_FINITE;\n  }\n  if (depth >= FAST_FINITE_SCAN_MAX_DEPTH || --fastFiniteScanBudget < 0) {\n    return FAST_SCAN_UNDECIDED;\n  }\n  if (Array.isArray(value)) {\n    for (let index = 0; index < value.length; index++) {\n      if (index in value) {\n        const entry: unknown = value[index];\n        if (typeof entry === \"number\") {\n          if (!Number.isFinite(entry)) return FAST_SCAN_NON_FINITE;\n        } else if (typeof entry === \"object\" && entry !== null) {\n          const result = scanNonFiniteWithoutMemo(entry, depth + 1);\n          if (result !== FAST_SCAN_FINITE) return result;\n        }\n      }\n    }\n    return FAST_SCAN_FINITE;\n  }\n  const record = value as Record<string, unknown>;\n  const keys = Object.keys(record);\n  for (let index = 0; index < keys.length; index++) {\n    const entry = record[keys[index]!];\n    if (typeof entry === \"number\") {\n      if (!Number.isFinite(entry)) return FAST_SCAN_NON_FINITE;\n    } else if (typeof entry === \"object\" && entry !== null) {\n      const result = scanNonFiniteWithoutMemo(entry, depth + 1);\n      if (result !== FAST_SCAN_FINITE) return result;\n    }\n  }\n  return FAST_SCAN_FINITE;\n}\n\n/** Internal: exact answer of containsNonFiniteNumber, using the memo-free pre-scan when it decides. */\nexport function calculationValueContainsNonFiniteNumber(value: unknown): boolean {\n  const saved = fastFiniteScanBudget;\n  fastFiniteScanBudget = FAST_FINITE_SCAN_MAX_OBJECT_VISITS;\n  let result: number;\n  try {\n    result = scanNonFiniteWithoutMemo(value, 0);\n  } finally {\n    fastFiniteScanBudget = saved;\n  }\n  return result === FAST_SCAN_UNDECIDED ? containsNonFiniteNumber(value, new WeakSet<object>()) : result === FAST_SCAN_NON_FINITE;\n}\n\n/** Internal: the exact visited-set scan, exposed for equivalence tests only. */\nexport function calculationValueContainsNonFiniteNumberExact(value: unknown): boolean {\n  return containsNonFiniteNumber(value, new WeakSet<object>());\n}\n\nfunction assertFiniteCalculationValue(value: unknown): void {\n  if (calculationValueContainsNonFiniteNumber(value)) {\n    assertFiniteNumbers(value, \"value\", new WeakSet<object>());\n  }\n}\n\nfunction validateProvenanceIdentity(provenance: CalculationProvenance): void {\n  for (const field of [\"model\", \"modelVersion\"] as const) {\n    const entry: unknown = provenance[field];\n    if (typeof entry !== \"string\" || entry.trim().length === 0) {\n      throw new InvalidScientificResultError(\n        `Calculation provenance ${field} must be a non-empty string.`\n      );\n    }\n  }\n}\n\n/**\n * Estimated and calibrated results must carry quality metadata. The TypeScript\n * signature alone cannot stop a JavaScript caller from leaving it out, so check at runtime.\n */\nfunction requireQuality(\n  quality: CalculationQuality | undefined,\n  kind: \"estimated\" | \"calibrated\"\n): CalculationQuality {\n  if (quality === undefined || quality === null) {\n    throw new InvalidScientificResultError(\n      `A ${kind} result requires calculation quality metadata.`\n    );\n  }\n  return quality;\n}\n\n/** True for a plain record (prototype Object.prototype or null) or an array: the nodes a result freezes. */\nfunction isFreezableResultNode(node: unknown): node is object {\n  if (node === null || typeof node !== \"object\") {\n    return false;\n  }\n  if (Array.isArray(node)) {\n    return true;\n  }\n  const prototype: unknown = Object.getPrototypeOf(node);\n  return prototype === Object.prototype || prototype === null;\n}\n\n/**\n * Deep-freezes the plain records and arrays of provenance or quality metadata in place. A node\n * that is already frozen is not walked again, which also ends any cycle.\n */\nfunction freezeMetadataTree(node: unknown): void {\n  if (!isFreezableResultNode(node) || Object.isFrozen(node)) {\n    return;\n  }\n  Object.freeze(node);\n  for (const entry of Object.values(node)) {\n    freezeMetadataTree(entry);\n  }\n}\n\n/**\n * Read-only result envelopes (from 2.0.0). The envelope, its provenance (with assumptions) and\n * its quality metadata are frozen deeply. `value` is frozen at its top level only:\n *\n * - Every public calculation builds at least one envelope, many per call on hot paths. A generic\n *   deep walk of `value` made a small scalar call about 3× slower; this shallow freeze costs\n *   about 1.4× (measured, docs/API_STYLE.md \"Read-only results\").\n * - A deep freeze would also freeze any caller-owned object that a value holds by reference.\n *   test/result-envelope-freeze.test.ts checks that a calculation leaves its input as it was.\n * - Typed arrays, DataViews and ArrayBuffers cannot be frozen and stay mutable. Class\n *   instances, Maps and Sets are not frozen.\n * - Domains that own their data still deep-freeze it (captures, RAW attachments, presets and\n *   export metadata use freezeOwnedData), so those values are read-only all the way down.\n */\nfunction createResult<T>(\n  value: T,\n  provenance: CalculationProvenance,\n  quality?: CalculationQuality\n): CalculationResult<T> {\n  validateProvenanceIdentity(provenance);\n  assertFiniteCalculationValue(value);\n  validateCalculationQuality(quality);\n\n  if (isFreezableResultNode(value)) {\n    Object.freeze(value);\n  }\n  // Provenance holds only strings and the assumptions array of strings, so freezing those two\n  // objects freezes it completely. This avoids a generic walk on every result (a measured hot\n  // path; see docs/API_STYLE.md \"Read-only results\").\n  Object.freeze(provenance);\n  const assumptions = provenance.assumptions;\n  if (assumptions !== undefined && !Object.isFrozen(assumptions)) {\n    Object.freeze(assumptions);\n  }\n  if (quality !== undefined) {\n    freezeMetadataTree(quality);\n  }\n  return Object.freeze(quality === undefined ? { value, provenance } : { value, provenance, quality });\n}\n\n/**\n * Creates a deterministic calculated-result envelope.\n */\nexport function calculatedResult<T>(\n  value: T,\n  model: string,\n  modelVersion: string,\n  assumptions?: readonly string[],\n  quality?: CalculationQuality\n): CalculationResult<T> {\n  return createResult(\n    value,\n    {\n      kind: \"calculated\",\n      model,\n      modelVersion,\n      ...(assumptions === undefined ? {} : { assumptions })\n    },\n    quality\n  );\n}\n\n/**\n * Creates an approximation-result envelope.\n */\nexport function approximationResult<T>(\n  value: T,\n  model: string,\n  modelVersion: string,\n  assumptions: readonly string[],\n  quality?: CalculationQuality\n): CalculationResult<T> {\n  return createResult(\n    value,\n    {\n      kind: \"approximation\",\n      model,\n      modelVersion,\n      assumptions\n    },\n    quality\n  );\n}\n\n/**\n * Creates an estimated-result envelope with explicit quality metadata.\n */\nexport function estimatedResult<T>(\n  value: T,\n  model: string,\n  modelVersion: string,\n  assumptions: readonly string[],\n  quality: CalculationQuality\n): CalculationResult<T> {\n  return createResult(\n    value,\n    {\n      kind: \"estimated\",\n      model,\n      modelVersion,\n      assumptions\n    },\n    requireQuality(quality, \"estimated\")\n  );\n}\n\n/**\n * Creates a calibrated-result envelope with explicit quality metadata.\n */\nexport function calibratedResult<T>(\n  value: T,\n  model: string,\n  modelVersion: string,\n  assumptions: readonly string[],\n  quality: CalculationQuality\n): CalculationResult<T> {\n  return createResult(\n    value,\n    {\n      kind: \"calibrated\",\n      model,\n      modelVersion,\n      assumptions\n    },\n    requireQuality(quality, \"calibrated\")\n  );\n}\n"]}

package/dist/core/canonical-json.d.ts

@@ -5,14 +5,19 @@ export interface CanonicalJsonPolicy {
     unsupportedValueMessage: string;
 }
 /**
- * Serializes a parsed, acyclic plain-data tree with sorted enumerable object
- * keys, original array order and finite JSON numbers. JSON escaping and negative
- * zero representation follow JSON.stringify. The source is never mutated.
+ * Serializes a parsed, acyclic tree of plain data to JSON text.
  *
- * Undefined object properties follow the explicit domain policy; undefined array
- * entries and unsupported scalar types always fail. Callers own dense-array,
- * plain-record and cycle validation. This is serialization mechanics, not a
- * general input parser, cryptographic hash or standardized canonical-JSON claim.
+ * Object keys (enumerable) are sorted. Arrays keep their order. Numbers must be finite.
+ * String escaping and negative zero follow JSON.stringify. The input is never changed.
+ *
+ * The domain policy decides what happens to undefined object properties. These always
+ * fail with the policy's unsupported-value message:
+ * - undefined array entries and array holes;
+ * - non-plain objects (Map, Set, Date, typed arrays, class instances, or any prototype
+ *   other than Object.prototype or null);
+ * - unsupported scalar types.
+ *
+ * The caller must rule out cycles first. This is serialization only. It is not a general
+ * input parser, a cryptographic hash or an implementation of a canonical-JSON standard.
  */
 export declare function stringifyCanonicalJson(value: unknown, policy: CanonicalJsonPolicy): string;
-//# sourceMappingURL=canonical-json.d.ts.map