trilean 1.13.5 → 1.13.7

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (125) hide show
  1. package/dist/builtin-functions.cjs +1 -2
  2. package/dist/builtin-functions.d.cts +1 -3
  3. package/dist/builtin-functions.d.ts +1 -3
  4. package/dist/builtin-functions.js +1 -2
  5. package/dist/complex-division.cjs +1 -2
  6. package/dist/complex-division.d.cts +1 -3
  7. package/dist/complex-division.d.ts +1 -3
  8. package/dist/complex-division.js +1 -2
  9. package/dist/complex.cjs +1 -2
  10. package/dist/complex.d.cts +1 -3
  11. package/dist/complex.d.ts +1 -3
  12. package/dist/complex.js +1 -2
  13. package/dist/{computed-value-CbRF0Izc.d.cts → computed-value-CaFJ1YkU.d.ts} +0 -2
  14. package/dist/computed-value.cjs +1 -2
  15. package/dist/computed-value.d.cts +48 -2
  16. package/dist/computed-value.d.ts +1 -1
  17. package/dist/computed-value.js +1 -2
  18. package/dist/derived-aggregates.cjs +1 -2
  19. package/dist/derived-aggregates.d.cts +2 -4
  20. package/dist/derived-aggregates.d.ts +2 -4
  21. package/dist/derived-aggregates.js +1 -2
  22. package/dist/derived-connectives.cjs +1 -2
  23. package/dist/derived-connectives.d.cts +2 -4
  24. package/dist/derived-connectives.d.ts +2 -4
  25. package/dist/derived-connectives.js +1 -2
  26. package/dist/derived-patterns.cjs +1 -2
  27. package/dist/derived-patterns.d.cts +1 -3
  28. package/dist/derived-patterns.d.ts +1 -3
  29. package/dist/derived-patterns.js +1 -2
  30. package/dist/derived-values.cjs +1 -2
  31. package/dist/derived-values.d.cts +1 -3
  32. package/dist/derived-values.d.ts +1 -3
  33. package/dist/derived-values.js +1 -2
  34. package/dist/{dist-Dn-LI_AV.js → dist-ed78Tuwe.js} +2 -4
  35. package/dist/{dist-DO_3oafK.cjs → dist-ySX7cb5d.cjs} +2 -4
  36. package/dist/duration-order.cjs +1 -2
  37. package/dist/duration-order.d.cts +1 -3
  38. package/dist/duration-order.d.ts +1 -3
  39. package/dist/duration-order.js +1 -2
  40. package/dist/evaluate-document.cjs +4 -5
  41. package/dist/evaluate-document.d.cts +2 -4
  42. package/dist/evaluate-document.d.ts +2 -4
  43. package/dist/evaluate-document.js +4 -5
  44. package/dist/evaluation.cjs +1 -2
  45. package/dist/evaluation.d.cts +1 -3
  46. package/dist/evaluation.d.ts +1 -3
  47. package/dist/evaluation.js +1 -2
  48. package/dist/evaluator-budget.cjs +1 -2
  49. package/dist/evaluator-budget.d.cts +1 -3
  50. package/dist/evaluator-budget.d.ts +1 -3
  51. package/dist/evaluator-budget.js +1 -2
  52. package/dist/evaluator-collection.cjs +1 -2
  53. package/dist/evaluator-collection.d.cts +5 -7
  54. package/dist/evaluator-collection.d.ts +5 -7
  55. package/dist/evaluator-collection.js +1 -2
  56. package/dist/evaluator-compiled.cjs +3 -4
  57. package/dist/evaluator-compiled.d.cts +3 -5
  58. package/dist/evaluator-compiled.d.ts +3 -5
  59. package/dist/evaluator-compiled.js +3 -4
  60. package/dist/evaluator-effect.cjs +1 -2
  61. package/dist/evaluator-effect.d.cts +0 -2
  62. package/dist/evaluator-effect.d.ts +0 -2
  63. package/dist/evaluator-effect.js +1 -2
  64. package/dist/evaluator-factory.cjs +2 -3
  65. package/dist/evaluator-factory.d.cts +5 -7
  66. package/dist/evaluator-factory.d.ts +5 -7
  67. package/dist/evaluator-factory.js +2 -3
  68. package/dist/evaluator-indeterminacy-helpers.cjs +2 -3
  69. package/dist/evaluator-indeterminacy-helpers.d.cts +2 -4
  70. package/dist/evaluator-indeterminacy-helpers.d.ts +2 -4
  71. package/dist/evaluator-indeterminacy-helpers.js +2 -3
  72. package/dist/evaluator-literals.cjs +1 -2
  73. package/dist/evaluator-literals.d.cts +2 -4
  74. package/dist/evaluator-literals.d.ts +2 -4
  75. package/dist/evaluator-literals.js +1 -2
  76. package/dist/evaluator-operations.cjs +2 -3
  77. package/dist/evaluator-operations.d.cts +4 -6
  78. package/dist/evaluator-operations.d.ts +4 -6
  79. package/dist/evaluator-operations.js +2 -3
  80. package/dist/evaluator-test-helpers.cjs +2 -3
  81. package/dist/evaluator-test-helpers.d.cts +1 -3
  82. package/dist/evaluator-test-helpers.d.ts +1 -3
  83. package/dist/evaluator-test-helpers.js +2 -3
  84. package/dist/evaluator.cjs +2 -3
  85. package/dist/evaluator.d.cts +4 -6
  86. package/dist/evaluator.d.ts +4 -6
  87. package/dist/evaluator.js +2 -3
  88. package/dist/functions.cjs +1 -2
  89. package/dist/functions.d.cts +2 -4
  90. package/dist/functions.d.ts +2 -4
  91. package/dist/functions.js +1 -2
  92. package/dist/{index.CZzC1gGg-C3tq-f5f.cjs → index.CZzC1gGg-CQphWYWn.cjs} +23 -40
  93. package/dist/{index.CZzC1gGg-DVgiC1Nq.js → index.CZzC1gGg-D3-vRdPe.js} +14 -27
  94. package/dist/index.cjs +10 -10
  95. package/dist/index.d.cts +13 -13
  96. package/dist/index.d.ts +13 -13
  97. package/dist/index.js +10 -10
  98. package/dist/input-resolvers.cjs +1 -2
  99. package/dist/input-resolvers.d.cts +2 -4
  100. package/dist/input-resolvers.d.ts +2 -4
  101. package/dist/input-resolvers.js +1 -2
  102. package/dist/integer-power.cjs +1 -2
  103. package/dist/integer-power.d.cts +1 -3
  104. package/dist/integer-power.d.ts +1 -3
  105. package/dist/integer-power.js +1 -2
  106. package/dist/{json-value-B1Hjjjri.d.cts → json-value-ZLMaKP0n.d.ts} +0 -2
  107. package/dist/json-value.cjs +1 -2
  108. package/dist/json-value.d.cts +8 -2
  109. package/dist/json-value.d.ts +1 -1
  110. package/dist/json-value.js +1 -2
  111. package/dist/plain-record.cjs +1 -2
  112. package/dist/plain-record.d.cts +1 -3
  113. package/dist/plain-record.d.ts +1 -3
  114. package/dist/plain-record.js +1 -2
  115. package/dist/resolvers.d.cts +3 -5
  116. package/dist/resolvers.d.ts +3 -5
  117. package/dist/tree.cjs +1 -2
  118. package/dist/tree.d.cts +2 -4
  119. package/dist/tree.d.ts +2 -4
  120. package/dist/tree.js +1 -2
  121. package/dist-cli/trilean.mjs +24 -47
  122. package/package.json +4 -4
  123. package/schemas/trilean.schema.json +1 -1
  124. package/dist/computed-value-CbRF0Izc.d.ts +0 -51
  125. package/dist/json-value-B1Hjjjri.d.ts +0 -11
@@ -1,5 +1,5 @@
1
1
  import "expect-type";
2
- //#region ../../node_modules/.pnpm/vitest@5.1.0_@types+node@26.6.5_@vitest+coverage-v8@5.0.4_vite@8.2.2_@types+node@26.6.5_4fc92309849883ad11a836cad05c50d8/node_modules/vitest/dist/chunks/tinyrainbow.Do8I1XRG.js
2
+ // ../../node_modules/.pnpm/vitest@5.1.0_@types+node@26.6.5_@vitest+coverage-v8@5.0.4_vite@8.2.2_@types+node@26.6.5_4fc92309849883ad11a836cad05c50d8/node_modules/vitest/dist/chunks/tinyrainbow.Do8I1XRG.js
3
3
  var d$1 = (e) => String(e);
4
4
  d$1.open = d$1.close = "";
5
5
  var i$1 = () => d$1;
@@ -83,8 +83,7 @@ function h$1({ force: e } = {}) {
83
83
  return y$1(e || C$1());
84
84
  }
85
85
  var $ = h$1();
86
- //#endregion
87
- //#region ../../node_modules/.pnpm/vitest@5.1.0_@types+node@26.6.5_@vitest+coverage-v8@5.0.4_vite@8.2.2_@types+node@26.6.5_4fc92309849883ad11a836cad05c50d8/node_modules/vitest/dist/chunks/index.D0heQG4v.js
86
+ // ../../node_modules/.pnpm/vitest@5.1.0_@types+node@26.6.5_@vitest+coverage-v8@5.0.4_vite@8.2.2_@types+node@26.6.5_4fc92309849883ad11a836cad05c50d8/node_modules/vitest/dist/chunks/index.D0heQG4v.js
88
87
  function _mergeNamespaces(n, m) {
89
88
  m.forEach(function(e) {
90
89
  e && typeof e !== "string" && !Array.isArray(e) && Object.keys(e).forEach(function(k) {
@@ -1246,8 +1245,7 @@ const plugins = {
1246
1245
  ReactTestComponent: plugin$6,
1247
1246
  Error: ErrorPlugin
1248
1247
  };
1249
- //#endregion
1250
- //#region ../../node_modules/.pnpm/vitest@5.1.0_@types+node@26.6.5_@vitest+coverage-v8@5.0.4_vite@8.2.2_@types+node@26.6.5_4fc92309849883ad11a836cad05c50d8/node_modules/vitest/dist/chunks/display.BlTmubjj.js
1248
+ // ../../node_modules/.pnpm/vitest@5.1.0_@types+node@26.6.5_@vitest+coverage-v8@5.0.4_vite@8.2.2_@types+node@26.6.5_4fc92309849883ad11a836cad05c50d8/node_modules/vitest/dist/chunks/display.BlTmubjj.js
1251
1249
  const { AsymmetricMatcher: AsymmetricMatcher$3, DOMCollection: DOMCollection$2, DOMElement: DOMElement$2, Immutable: Immutable$2, ReactElement: ReactElement$2, ReactTestComponent: ReactTestComponent$2 } = plugins;
1252
1250
  const PLUGINS$2 = [
1253
1251
  ReactTestComponent$2,
@@ -1709,8 +1707,7 @@ function normalizeString(path, allowAboveRoot) {
1709
1707
  const isAbsolute = function(p) {
1710
1708
  return _IS_ABSOLUTE_RE.test(p);
1711
1709
  };
1712
- //#endregion
1713
- //#region ../../node_modules/.pnpm/vitest@5.1.0_@types+node@26.6.5_@vitest+coverage-v8@5.0.4_vite@8.2.2_@types+node@26.6.5_4fc92309849883ad11a836cad05c50d8/node_modules/vitest/dist/chunks/source-map.DakdQc29.js
1710
+ // ../../node_modules/.pnpm/vitest@5.1.0_@types+node@26.6.5_@vitest+coverage-v8@5.0.4_vite@8.2.2_@types+node@26.6.5_4fc92309849883ad11a836cad05c50d8/node_modules/vitest/dist/chunks/source-map.DakdQc29.js
1714
1711
  var build = {};
1715
1712
  var hasRequiredBuild;
1716
1713
  function requireBuild() {
@@ -2503,8 +2500,7 @@ function getOriginalPosition(map, needle) {
2503
2500
  if (result.column == null) return null;
2504
2501
  return result;
2505
2502
  }
2506
- //#endregion
2507
- //#region ../../node_modules/.pnpm/vitest@5.1.0_@types+node@26.6.5_@vitest+coverage-v8@5.0.4_vite@8.2.2_@types+node@26.6.5_4fc92309849883ad11a836cad05c50d8/node_modules/vitest/dist/task-utils.js
2503
+ // ../../node_modules/.pnpm/vitest@5.1.0_@types+node@26.6.5_@vitest+coverage-v8@5.0.4_vite@8.2.2_@types+node@26.6.5_4fc92309849883ad11a836cad05c50d8/node_modules/vitest/dist/task-utils.js
2508
2504
  /* @__NO_SIDE_EFFECTS__ */
2509
2505
  function getNames(task) {
2510
2506
  const names = [task.name];
@@ -2520,8 +2516,7 @@ function getNames(task) {
2520
2516
  function createTaskName(names, separator = " > ") {
2521
2517
  return names.filter((name) => name !== void 0).join(separator);
2522
2518
  }
2523
- //#endregion
2524
- //#region ../../node_modules/.pnpm/vitest@5.1.0_@types+node@26.6.5_@vitest+coverage-v8@5.0.4_vite@8.2.2_@types+node@26.6.5_4fc92309849883ad11a836cad05c50d8/node_modules/vitest/dist/chunks/run.CjdgFZiW.js
2519
+ // ../../node_modules/.pnpm/vitest@5.1.0_@types+node@26.6.5_@vitest+coverage-v8@5.0.4_vite@8.2.2_@types+node@26.6.5_4fc92309849883ad11a836cad05c50d8/node_modules/vitest/dist/chunks/run.CjdgFZiW.js
2525
2520
  /**
2526
2521
  * Diff Match and Patch
2527
2522
  * Copyright 2018 The diff-match-patch Authors.
@@ -5105,8 +5100,7 @@ async function finishSendTasksUpdate(runner) {
5105
5100
  sendTasksUpdate(runner);
5106
5101
  await Promise.all(pendingTasksUpdates);
5107
5102
  }
5108
- //#endregion
5109
- //#region ../../node_modules/.pnpm/vitest@5.1.0_@types+node@26.6.5_@vitest+coverage-v8@5.0.4_vite@8.2.2_@types+node@26.6.5_4fc92309849883ad11a836cad05c50d8/node_modules/vitest/dist/chunks/utils.DYj33du9.js
5103
+ // ../../node_modules/.pnpm/vitest@5.1.0_@types+node@26.6.5_@vitest+coverage-v8@5.0.4_vite@8.2.2_@types+node@26.6.5_4fc92309849883ad11a836cad05c50d8/node_modules/vitest/dist/chunks/utils.DYj33du9.js
5110
5104
  const NAME_WORKER_STATE = "__vitest_worker__";
5111
5105
  function getWorkerState() {
5112
5106
  const workerState = globalThis[NAME_WORKER_STATE];
@@ -5131,8 +5125,7 @@ function resetModules(modules, resetMocks = false) {
5131
5125
  node.importers.clear();
5132
5126
  });
5133
5127
  }
5134
- //#endregion
5135
- //#region ../../node_modules/.pnpm/vitest@5.1.0_@types+node@26.6.5_@vitest+coverage-v8@5.0.4_vite@8.2.2_@types+node@26.6.5_4fc92309849883ad11a836cad05c50d8/node_modules/vitest/dist/chunks/spy.DDMXghXv.js
5128
+ // ../../node_modules/.pnpm/vitest@5.1.0_@types+node@26.6.5_@vitest+coverage-v8@5.0.4_vite@8.2.2_@types+node@26.6.5_4fc92309849883ad11a836cad05c50d8/node_modules/vitest/dist/chunks/spy.DDMXghXv.js
5136
5129
  function isMockFunction(fn) {
5137
5130
  return typeof fn === "function" && "_isMockFunction" in fn && fn._isMockFunction === true;
5138
5131
  }
@@ -5572,8 +5565,7 @@ function resetAllMocks() {
5572
5565
  function throwConstructorError(shorthand) {
5573
5566
  throw new TypeError(`Cannot use \`${shorthand}\` when called with \`new\`. Use \`mockImplementation\` with a \`class\` keyword instead. See https://vitest.dev/api/mock#class-support for more information.`);
5574
5567
  }
5575
- //#endregion
5576
- //#region ../../node_modules/.pnpm/chai@6.3.0/node_modules/chai/index.js
5568
+ // ../../node_modules/.pnpm/chai@6.3.0/node_modules/chai/index.js
5577
5569
  var __defProp = Object.defineProperty;
5578
5570
  var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, {
5579
5571
  enumerable: true,
@@ -8586,8 +8578,7 @@ function use(fn) {
8586
8578
  return exports;
8587
8579
  }
8588
8580
  __name(use, "use");
8589
- //#endregion
8590
- //#region ../../node_modules/.pnpm/vitest@5.1.0_@types+node@26.6.5_@vitest+coverage-v8@5.0.4_vite@8.2.2_@types+node@26.6.5_4fc92309849883ad11a836cad05c50d8/node_modules/vitest/dist/chunks/plugins.DPQHVT0p.js
8581
+ // ../../node_modules/.pnpm/vitest@5.1.0_@types+node@26.6.5_@vitest+coverage-v8@5.0.4_vite@8.2.2_@types+node@26.6.5_4fc92309849883ad11a836cad05c50d8/node_modules/vitest/dist/chunks/plugins.DPQHVT0p.js
8591
8582
  const serialize$1 = (val, config, indentation, depth, refs, printer) => {
8592
8583
  const name = val.getMockName();
8593
8584
  const nameString = name === "vi.fn()" ? "" : ` ${name}`;
@@ -8619,8 +8610,7 @@ function addSerializer(plugin) {
8619
8610
  function getSerializers() {
8620
8611
  return PLUGINS;
8621
8612
  }
8622
- //#endregion
8623
- //#region ../../node_modules/.pnpm/vitest@5.1.0_@types+node@26.6.5_@vitest+coverage-v8@5.0.4_vite@8.2.2_@types+node@26.6.5_4fc92309849883ad11a836cad05c50d8/node_modules/vitest/dist/chunks/offset.Dy-5Fdfn.js
8613
+ // ../../node_modules/.pnpm/vitest@5.1.0_@types+node@26.6.5_@vitest+coverage-v8@5.0.4_vite@8.2.2_@types+node@26.6.5_4fc92309849883ad11a836cad05c50d8/node_modules/vitest/dist/chunks/offset.Dy-5Fdfn.js
8624
8614
  const lineSplitRE = /\r?\n/;
8625
8615
  function positionToOffset(source, lineNumber, columnNumber) {
8626
8616
  const lines = source.split(lineSplitRE);
@@ -8643,8 +8633,7 @@ function offsetToLineNumber(source, offset) {
8643
8633
  }
8644
8634
  return line + 1;
8645
8635
  }
8646
- //#endregion
8647
- //#region ../../node_modules/.pnpm/vitest@5.1.0_@types+node@26.6.5_@vitest+coverage-v8@5.0.4_vite@8.2.2_@types+node@26.6.5_4fc92309849883ad11a836cad05c50d8/node_modules/vitest/dist/chunks/rawSnapshot.DqSiqIEx.js
8636
+ // ../../node_modules/.pnpm/vitest@5.1.0_@types+node@26.6.5_@vitest+coverage-v8@5.0.4_vite@8.2.2_@types+node@26.6.5_4fc92309849883ad11a836cad05c50d8/node_modules/vitest/dist/chunks/rawSnapshot.DqSiqIEx.js
8648
8637
  var naturalCompare$1 = { exports: {} };
8649
8638
  var hasRequiredNaturalCompare;
8650
8639
  function requireNaturalCompare() {
@@ -8811,7 +8800,7 @@ function memo(fn) {
8811
8800
  };
8812
8801
  }
8813
8802
  async function saveInlineSnapshots(environment, snapshots) {
8814
- const MagicString = (await import("./dist-Dn-LI_AV.js")).default;
8803
+ const MagicString = (await import("./dist-ed78Tuwe.js")).default;
8815
8804
  const files = new Set(snapshots.map((i) => i.file));
8816
8805
  await Promise.all(Array.from(files).map(async (file) => {
8817
8806
  const snaps = snapshots.filter((i) => i.file === file);
@@ -8949,8 +8938,7 @@ const { runtime: h, version: g } = p();
8949
8938
  globalThis.performance.now.bind(globalThis.performance);
8950
8939
  globalThis.process?.hrtime?.bigint.bind(globalThis.process?.hrtime);
8951
8940
  globalThis.Bun?.nanoseconds;
8952
- //#endregion
8953
- //#region ../../node_modules/.pnpm/vitest@5.1.0_@types+node@26.6.5_@vitest+coverage-v8@5.0.4_vite@8.2.2_@types+node@26.6.5_4fc92309849883ad11a836cad05c50d8/node_modules/vitest/dist/chunks/index.CZzC1gGg.js
8941
+ // ../../node_modules/.pnpm/vitest@5.1.0_@types+node@26.6.5_@vitest+coverage-v8@5.0.4_vite@8.2.2_@types+node@26.6.5_4fc92309849883ad11a836cad05c50d8/node_modules/vitest/dist/chunks/index.CZzC1gGg.js
8954
8942
  function isSameStackPosition(x, y) {
8955
8943
  return x.file === y.file && x.column === y.column && x.line === y.line;
8956
8944
  }
@@ -14879,5 +14867,4 @@ Object.defineProperty(globalThis, GLOBAL_EXPECT, {
14879
14867
  configurable: true
14880
14868
  });
14881
14869
  globalThis.performance ? globalThis.performance.now.bind(globalThis.performance) : Date.now;
14882
- //#endregion
14883
14870
  export { globalExpect as t };
package/dist/index.cjs CHANGED
@@ -1,19 +1,19 @@
1
1
  Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
2
+ const require_json_value = require("./json-value.cjs");
3
+ const require_evaluation = require("./evaluation.cjs");
2
4
  const require_computed_value = require("./computed-value.cjs");
3
- const require_complex = require("./complex.cjs");
5
+ const require_functions = require("./functions.cjs");
4
6
  const require_builtin_functions = require("./builtin-functions.cjs");
5
- const require_derived_aggregates = require("./derived-aggregates.cjs");
7
+ const require_input_resolvers = require("./input-resolvers.cjs");
8
+ const require_evaluate_document = require("./evaluate-document.cjs");
9
+ const require_evaluator_factory = require("./evaluator-factory.cjs");
10
+ const require_evaluator_budget = require("./evaluator-budget.cjs");
6
11
  const require_derived_connectives = require("./derived-connectives.cjs");
7
- const require_derived_patterns = require("./derived-patterns.cjs");
12
+ const require_derived_aggregates = require("./derived-aggregates.cjs");
8
13
  const require_derived_values = require("./derived-values.cjs");
9
- const require_evaluation = require("./evaluation.cjs");
10
- const require_evaluator_budget = require("./evaluator-budget.cjs");
11
- const require_json_value = require("./json-value.cjs");
14
+ const require_derived_patterns = require("./derived-patterns.cjs");
15
+ const require_complex = require("./complex.cjs");
12
16
  const require_tree = require("./tree.cjs");
13
- const require_functions = require("./functions.cjs");
14
- const require_evaluator_factory = require("./evaluator-factory.cjs");
15
- const require_input_resolvers = require("./input-resolvers.cjs");
16
- const require_evaluate_document = require("./evaluate-document.cjs");
17
17
  exports.AccumulatorNodeSchema = require_tree.AccumulatorNodeSchema;
18
18
  exports.AllOfNodeSchema = require_tree.AllOfNodeSchema;
19
19
  exports.AndNodeSchema = require_tree.AndNodeSchema;
package/dist/index.d.cts CHANGED
@@ -1,18 +1,18 @@
1
- import { a as Unit, c as combineUnitsForMultiply, i as DurationUnitSchema, l as unitsEqual, n as ComputedValueSchema, o as UnitSchema, r as DurationUnit, s as combineUnitsForDivide, t as ComputedValue } from "./computed-value-CbRF0Izc.cjs";
1
+ import { JsonValue, JsonValueSchema } from "./json-value.cjs";
2
+ import { Evaluation, IndeterminateReason, IndeterminateReasonSchema, definite, firstIndeterminate, indeterminate } from "./evaluation.cjs";
3
+ import { ComputedValue, ComputedValueSchema, DurationUnit, DurationUnitSchema, Unit, UnitSchema, combineUnitsForDivide, combineUnitsForMultiply, unitsEqual } from "./computed-value.cjs";
4
+ import { Absence, EvaluationContext, Resolution, Resolvers, SyncResolvers, TreeResolution } from "./resolvers.cjs";
2
5
  import { FunctionFailure, FunctionRegistry, emptyFunctionRegistry } from "./functions.cjs";
3
6
  import { builtinFunctions } from "./builtin-functions.cjs";
4
- import { n as JsonValueSchema, t as JsonValue } from "./json-value-B1Hjjjri.cjs";
5
- import { AccumulatorNode, AccumulatorNodeSchema, AllOfNode, AllOfNodeSchema, AndNode, AndNodeSchema, AnyOfNode, AnyOfNodeSchema, ArithmeticNode, ArithmeticNodeSchema, ArithmeticOperator, ArithmeticOperatorSchema, BooleanLiteralNode, BooleanLiteralNodeSchema, CallNode, CallNodeSchema, CompareNode, CompareNodeSchema, ComparisonOperator, ComparisonOperatorSchema, ComplexLiteralNode, ComplexLiteralNodeSchema, ComplexPolarLiteralNode, ComplexPolarLiteralNodeSchema, ComplexRectangularLiteralNode, ComplexRectangularLiteralNodeSchema, ConditionalCase, ConditionalCaseSchema, ConditionalNode, ConditionalNodeSchema, DelegateNode, DelegateNodeSchema, DurationLiteralNode, DurationLiteralNodeSchema, EveryNode, EveryNodeSchema, ExistsNode, ExistsNodeSchema, ExpressionNode, ExpressionNodeSchema, FoldCombiner, FoldCombinerSchema, FoldNode, FoldNodeSchema, HitPolicy, HitPolicySchema, InstantLiteralNode, InstantLiteralNodeSchema, LookupNode, LookupNodeSchema, MemberOfNode, MemberOfNodeSchema, MembershipOperator, MembershipOperatorSchema, NegateNode, NegateNodeSchema, NotNode, NotNodeSchema, NumberLiteralNode, NumberLiteralNodeSchema, OrNode, OrNodeSchema, PredicateNode, PredicateNodeSchema, ReferenceNode, ReferenceNodeSchema, SomeNode, SomeNodeSchema, TextCompareNode, TextCompareNodeSchema, TextComparisonOperator, TextComparisonOperatorSchema, TextLiteralNode, TextLiteralNodeSchema, TreeReferenceNode, TreeReferenceNodeSchema } from "./tree.cjs";
6
- import { complexFromPolar, complexLiteralFromPolar, complexMagnitude, complexPhase } from "./complex.cjs";
7
- import { average, count, presenceOf, sum } from "./derived-aggregates.cjs";
8
- import { and, iff, implies, nand, none, nor, not, or, xor } from "./derived-connectives.cjs";
9
- import { hierarchicalGlobPattern, prefixPattern, wildcardPattern } from "./derived-patterns.cjs";
10
- import { coalesce } from "./derived-values.cjs";
11
- import { Evaluation, IndeterminateReason, IndeterminateReasonSchema, definite, firstIndeterminate, indeterminate } from "./evaluation.cjs";
7
+ import { InputItem, InputsParseResult, createInputResolvers, parseInputs } from "./input-resolvers.cjs";
12
8
  import { DocumentEvaluation, EvaluateDocumentOptions, TreeKind, evaluateDocument } from "./evaluate-document.cjs";
13
- import { DEFAULT_MAX_EVALUATION_NODES, DEFAULT_MAX_NESTING_DEPTH } from "./evaluator-budget.cjs";
14
- import { Absence, EvaluationContext, Resolution, Resolvers, SyncResolvers, TreeResolution } from "./resolvers.cjs";
15
- import { CompiledPredicate } from "./evaluator-compiled.cjs";
16
9
  import { EvaluatorOptions, createEvaluator, createSyncEvaluator, evaluatePredicate, evaluateValue } from "./evaluator-factory.cjs";
17
- import { InputItem, InputsParseResult, createInputResolvers, parseInputs } from "./input-resolvers.cjs";
10
+ import { CompiledPredicate } from "./evaluator-compiled.cjs";
11
+ import { DEFAULT_MAX_EVALUATION_NODES, DEFAULT_MAX_NESTING_DEPTH } from "./evaluator-budget.cjs";
12
+ import { and, iff, implies, nand, none, nor, not, or, xor } from "./derived-connectives.cjs";
13
+ import { average, count, presenceOf, sum } from "./derived-aggregates.cjs";
14
+ import { coalesce } from "./derived-values.cjs";
15
+ import { hierarchicalGlobPattern, prefixPattern, wildcardPattern } from "./derived-patterns.cjs";
16
+ import { complexFromPolar, complexLiteralFromPolar, complexMagnitude, complexPhase } from "./complex.cjs";
17
+ import { AccumulatorNode, AccumulatorNodeSchema, AllOfNode, AllOfNodeSchema, AndNode, AndNodeSchema, AnyOfNode, AnyOfNodeSchema, ArithmeticNode, ArithmeticNodeSchema, ArithmeticOperator, ArithmeticOperatorSchema, BooleanLiteralNode, BooleanLiteralNodeSchema, CallNode, CallNodeSchema, CompareNode, CompareNodeSchema, ComparisonOperator, ComparisonOperatorSchema, ComplexLiteralNode, ComplexLiteralNodeSchema, ComplexPolarLiteralNode, ComplexPolarLiteralNodeSchema, ComplexRectangularLiteralNode, ComplexRectangularLiteralNodeSchema, ConditionalCase, ConditionalCaseSchema, ConditionalNode, ConditionalNodeSchema, DelegateNode, DelegateNodeSchema, DurationLiteralNode, DurationLiteralNodeSchema, EveryNode, EveryNodeSchema, ExistsNode, ExistsNodeSchema, ExpressionNode, ExpressionNodeSchema, FoldCombiner, FoldCombinerSchema, FoldNode, FoldNodeSchema, HitPolicy, HitPolicySchema, InstantLiteralNode, InstantLiteralNodeSchema, LookupNode, LookupNodeSchema, MemberOfNode, MemberOfNodeSchema, MembershipOperator, MembershipOperatorSchema, NegateNode, NegateNodeSchema, NotNode, NotNodeSchema, NumberLiteralNode, NumberLiteralNodeSchema, OrNode, OrNodeSchema, PredicateNode, PredicateNodeSchema, ReferenceNode, ReferenceNodeSchema, SomeNode, SomeNodeSchema, TextCompareNode, TextCompareNodeSchema, TextComparisonOperator, TextComparisonOperatorSchema, TextLiteralNode, TextLiteralNodeSchema, TreeReferenceNode, TreeReferenceNodeSchema } from "./tree.cjs";
18
18
  export { type Absence, type AccumulatorNode, AccumulatorNodeSchema, type AllOfNode, AllOfNodeSchema, type AndNode, AndNodeSchema, type AnyOfNode, AnyOfNodeSchema, type ArithmeticNode, ArithmeticNodeSchema, type ArithmeticOperator, ArithmeticOperatorSchema, type BooleanLiteralNode, BooleanLiteralNodeSchema, type CallNode, CallNodeSchema, type CompareNode, CompareNodeSchema, type ComparisonOperator, ComparisonOperatorSchema, type CompiledPredicate, type ComplexLiteralNode, ComplexLiteralNodeSchema, type ComplexPolarLiteralNode, ComplexPolarLiteralNodeSchema, type ComplexRectangularLiteralNode, ComplexRectangularLiteralNodeSchema, type ComputedValue, ComputedValueSchema, type ConditionalCase, ConditionalCaseSchema, type ConditionalNode, ConditionalNodeSchema, DEFAULT_MAX_EVALUATION_NODES, DEFAULT_MAX_NESTING_DEPTH, type DelegateNode, DelegateNodeSchema, type DocumentEvaluation, type DurationLiteralNode, DurationLiteralNodeSchema, type DurationUnit, DurationUnitSchema, type EvaluateDocumentOptions, type Evaluation, type EvaluationContext, type EvaluatorOptions, type EveryNode, EveryNodeSchema, type ExistsNode, ExistsNodeSchema, type ExpressionNode, ExpressionNodeSchema, type FoldCombiner, FoldCombinerSchema, type FoldNode, FoldNodeSchema, type FunctionFailure, type FunctionRegistry, type HitPolicy, HitPolicySchema, type IndeterminateReason, IndeterminateReasonSchema, type InputItem, type InputsParseResult, type InstantLiteralNode, InstantLiteralNodeSchema, type JsonValue, JsonValueSchema, type LookupNode, LookupNodeSchema, type MemberOfNode, MemberOfNodeSchema, type MembershipOperator, MembershipOperatorSchema, type NegateNode, NegateNodeSchema, type NotNode, NotNodeSchema, type NumberLiteralNode, NumberLiteralNodeSchema, type OrNode, OrNodeSchema, type PredicateNode, PredicateNodeSchema, type ReferenceNode, ReferenceNodeSchema, type Resolution, type Resolvers, type SomeNode, SomeNodeSchema, type SyncResolvers, type TextCompareNode, TextCompareNodeSchema, type TextComparisonOperator, TextComparisonOperatorSchema, type TextLiteralNode, TextLiteralNodeSchema, type TreeKind, type TreeReferenceNode, TreeReferenceNodeSchema, type TreeResolution, type Unit, UnitSchema, and, average, builtinFunctions, coalesce, combineUnitsForDivide, combineUnitsForMultiply, complexFromPolar, complexLiteralFromPolar, complexMagnitude, complexPhase, count, createEvaluator, createInputResolvers, createSyncEvaluator, definite, emptyFunctionRegistry, evaluateDocument, evaluatePredicate, evaluateValue, firstIndeterminate, hierarchicalGlobPattern, iff, implies, indeterminate, nand, none, nor, not, or, parseInputs, prefixPattern, presenceOf, sum, unitsEqual, wildcardPattern, xor };
package/dist/index.d.ts CHANGED
@@ -1,18 +1,18 @@
1
- import { a as Unit, c as combineUnitsForMultiply, i as DurationUnitSchema, l as unitsEqual, n as ComputedValueSchema, o as UnitSchema, r as DurationUnit, s as combineUnitsForDivide, t as ComputedValue } from "./computed-value-CbRF0Izc.js";
1
+ import { n as JsonValueSchema, t as JsonValue } from "./json-value-ZLMaKP0n.js";
2
+ import { Evaluation, IndeterminateReason, IndeterminateReasonSchema, definite, firstIndeterminate, indeterminate } from "./evaluation.js";
3
+ import { a as Unit, c as combineUnitsForMultiply, i as DurationUnitSchema, l as unitsEqual, n as ComputedValueSchema, o as UnitSchema, r as DurationUnit, s as combineUnitsForDivide, t as ComputedValue } from "./computed-value-CaFJ1YkU.js";
4
+ import { Absence, EvaluationContext, Resolution, Resolvers, SyncResolvers, TreeResolution } from "./resolvers.js";
2
5
  import { FunctionFailure, FunctionRegistry, emptyFunctionRegistry } from "./functions.js";
3
6
  import { builtinFunctions } from "./builtin-functions.js";
4
- import { n as JsonValueSchema, t as JsonValue } from "./json-value-B1Hjjjri.js";
5
- import { AccumulatorNode, AccumulatorNodeSchema, AllOfNode, AllOfNodeSchema, AndNode, AndNodeSchema, AnyOfNode, AnyOfNodeSchema, ArithmeticNode, ArithmeticNodeSchema, ArithmeticOperator, ArithmeticOperatorSchema, BooleanLiteralNode, BooleanLiteralNodeSchema, CallNode, CallNodeSchema, CompareNode, CompareNodeSchema, ComparisonOperator, ComparisonOperatorSchema, ComplexLiteralNode, ComplexLiteralNodeSchema, ComplexPolarLiteralNode, ComplexPolarLiteralNodeSchema, ComplexRectangularLiteralNode, ComplexRectangularLiteralNodeSchema, ConditionalCase, ConditionalCaseSchema, ConditionalNode, ConditionalNodeSchema, DelegateNode, DelegateNodeSchema, DurationLiteralNode, DurationLiteralNodeSchema, EveryNode, EveryNodeSchema, ExistsNode, ExistsNodeSchema, ExpressionNode, ExpressionNodeSchema, FoldCombiner, FoldCombinerSchema, FoldNode, FoldNodeSchema, HitPolicy, HitPolicySchema, InstantLiteralNode, InstantLiteralNodeSchema, LookupNode, LookupNodeSchema, MemberOfNode, MemberOfNodeSchema, MembershipOperator, MembershipOperatorSchema, NegateNode, NegateNodeSchema, NotNode, NotNodeSchema, NumberLiteralNode, NumberLiteralNodeSchema, OrNode, OrNodeSchema, PredicateNode, PredicateNodeSchema, ReferenceNode, ReferenceNodeSchema, SomeNode, SomeNodeSchema, TextCompareNode, TextCompareNodeSchema, TextComparisonOperator, TextComparisonOperatorSchema, TextLiteralNode, TextLiteralNodeSchema, TreeReferenceNode, TreeReferenceNodeSchema } from "./tree.js";
6
- import { complexFromPolar, complexLiteralFromPolar, complexMagnitude, complexPhase } from "./complex.js";
7
- import { average, count, presenceOf, sum } from "./derived-aggregates.js";
8
- import { and, iff, implies, nand, none, nor, not, or, xor } from "./derived-connectives.js";
9
- import { hierarchicalGlobPattern, prefixPattern, wildcardPattern } from "./derived-patterns.js";
10
- import { coalesce } from "./derived-values.js";
11
- import { Evaluation, IndeterminateReason, IndeterminateReasonSchema, definite, firstIndeterminate, indeterminate } from "./evaluation.js";
7
+ import { InputItem, InputsParseResult, createInputResolvers, parseInputs } from "./input-resolvers.js";
12
8
  import { DocumentEvaluation, EvaluateDocumentOptions, TreeKind, evaluateDocument } from "./evaluate-document.js";
13
- import { DEFAULT_MAX_EVALUATION_NODES, DEFAULT_MAX_NESTING_DEPTH } from "./evaluator-budget.js";
14
- import { Absence, EvaluationContext, Resolution, Resolvers, SyncResolvers, TreeResolution } from "./resolvers.js";
15
- import { CompiledPredicate } from "./evaluator-compiled.js";
16
9
  import { EvaluatorOptions, createEvaluator, createSyncEvaluator, evaluatePredicate, evaluateValue } from "./evaluator-factory.js";
17
- import { InputItem, InputsParseResult, createInputResolvers, parseInputs } from "./input-resolvers.js";
10
+ import { CompiledPredicate } from "./evaluator-compiled.js";
11
+ import { DEFAULT_MAX_EVALUATION_NODES, DEFAULT_MAX_NESTING_DEPTH } from "./evaluator-budget.js";
12
+ import { and, iff, implies, nand, none, nor, not, or, xor } from "./derived-connectives.js";
13
+ import { average, count, presenceOf, sum } from "./derived-aggregates.js";
14
+ import { coalesce } from "./derived-values.js";
15
+ import { hierarchicalGlobPattern, prefixPattern, wildcardPattern } from "./derived-patterns.js";
16
+ import { complexFromPolar, complexLiteralFromPolar, complexMagnitude, complexPhase } from "./complex.js";
17
+ import { AccumulatorNode, AccumulatorNodeSchema, AllOfNode, AllOfNodeSchema, AndNode, AndNodeSchema, AnyOfNode, AnyOfNodeSchema, ArithmeticNode, ArithmeticNodeSchema, ArithmeticOperator, ArithmeticOperatorSchema, BooleanLiteralNode, BooleanLiteralNodeSchema, CallNode, CallNodeSchema, CompareNode, CompareNodeSchema, ComparisonOperator, ComparisonOperatorSchema, ComplexLiteralNode, ComplexLiteralNodeSchema, ComplexPolarLiteralNode, ComplexPolarLiteralNodeSchema, ComplexRectangularLiteralNode, ComplexRectangularLiteralNodeSchema, ConditionalCase, ConditionalCaseSchema, ConditionalNode, ConditionalNodeSchema, DelegateNode, DelegateNodeSchema, DurationLiteralNode, DurationLiteralNodeSchema, EveryNode, EveryNodeSchema, ExistsNode, ExistsNodeSchema, ExpressionNode, ExpressionNodeSchema, FoldCombiner, FoldCombinerSchema, FoldNode, FoldNodeSchema, HitPolicy, HitPolicySchema, InstantLiteralNode, InstantLiteralNodeSchema, LookupNode, LookupNodeSchema, MemberOfNode, MemberOfNodeSchema, MembershipOperator, MembershipOperatorSchema, NegateNode, NegateNodeSchema, NotNode, NotNodeSchema, NumberLiteralNode, NumberLiteralNodeSchema, OrNode, OrNodeSchema, PredicateNode, PredicateNodeSchema, ReferenceNode, ReferenceNodeSchema, SomeNode, SomeNodeSchema, TextCompareNode, TextCompareNodeSchema, TextComparisonOperator, TextComparisonOperatorSchema, TextLiteralNode, TextLiteralNodeSchema, TreeReferenceNode, TreeReferenceNodeSchema } from "./tree.js";
18
18
  export { type Absence, type AccumulatorNode, AccumulatorNodeSchema, type AllOfNode, AllOfNodeSchema, type AndNode, AndNodeSchema, type AnyOfNode, AnyOfNodeSchema, type ArithmeticNode, ArithmeticNodeSchema, type ArithmeticOperator, ArithmeticOperatorSchema, type BooleanLiteralNode, BooleanLiteralNodeSchema, type CallNode, CallNodeSchema, type CompareNode, CompareNodeSchema, type ComparisonOperator, ComparisonOperatorSchema, type CompiledPredicate, type ComplexLiteralNode, ComplexLiteralNodeSchema, type ComplexPolarLiteralNode, ComplexPolarLiteralNodeSchema, type ComplexRectangularLiteralNode, ComplexRectangularLiteralNodeSchema, type ComputedValue, ComputedValueSchema, type ConditionalCase, ConditionalCaseSchema, type ConditionalNode, ConditionalNodeSchema, DEFAULT_MAX_EVALUATION_NODES, DEFAULT_MAX_NESTING_DEPTH, type DelegateNode, DelegateNodeSchema, type DocumentEvaluation, type DurationLiteralNode, DurationLiteralNodeSchema, type DurationUnit, DurationUnitSchema, type EvaluateDocumentOptions, type Evaluation, type EvaluationContext, type EvaluatorOptions, type EveryNode, EveryNodeSchema, type ExistsNode, ExistsNodeSchema, type ExpressionNode, ExpressionNodeSchema, type FoldCombiner, FoldCombinerSchema, type FoldNode, FoldNodeSchema, type FunctionFailure, type FunctionRegistry, type HitPolicy, HitPolicySchema, type IndeterminateReason, IndeterminateReasonSchema, type InputItem, type InputsParseResult, type InstantLiteralNode, InstantLiteralNodeSchema, type JsonValue, JsonValueSchema, type LookupNode, LookupNodeSchema, type MemberOfNode, MemberOfNodeSchema, type MembershipOperator, MembershipOperatorSchema, type NegateNode, NegateNodeSchema, type NotNode, NotNodeSchema, type NumberLiteralNode, NumberLiteralNodeSchema, type OrNode, OrNodeSchema, type PredicateNode, PredicateNodeSchema, type ReferenceNode, ReferenceNodeSchema, type Resolution, type Resolvers, type SomeNode, SomeNodeSchema, type SyncResolvers, type TextCompareNode, TextCompareNodeSchema, type TextComparisonOperator, TextComparisonOperatorSchema, type TextLiteralNode, TextLiteralNodeSchema, type TreeKind, type TreeReferenceNode, TreeReferenceNodeSchema, type TreeResolution, type Unit, UnitSchema, and, average, builtinFunctions, coalesce, combineUnitsForDivide, combineUnitsForMultiply, complexFromPolar, complexLiteralFromPolar, complexMagnitude, complexPhase, count, createEvaluator, createInputResolvers, createSyncEvaluator, definite, emptyFunctionRegistry, evaluateDocument, evaluatePredicate, evaluateValue, firstIndeterminate, hierarchicalGlobPattern, iff, implies, indeterminate, nand, none, nor, not, or, parseInputs, prefixPattern, presenceOf, sum, unitsEqual, wildcardPattern, xor };
package/dist/index.js CHANGED
@@ -1,16 +1,16 @@
1
+ import { JsonValueSchema } from "./json-value.js";
2
+ import { IndeterminateReasonSchema, definite, firstIndeterminate, indeterminate } from "./evaluation.js";
1
3
  import { ComputedValueSchema, DurationUnitSchema, UnitSchema, combineUnitsForDivide, combineUnitsForMultiply, unitsEqual } from "./computed-value.js";
2
- import { complexFromPolar, complexLiteralFromPolar, complexMagnitude, complexPhase } from "./complex.js";
4
+ import { emptyFunctionRegistry } from "./functions.js";
3
5
  import { builtinFunctions } from "./builtin-functions.js";
4
- import { average, count, presenceOf, sum } from "./derived-aggregates.js";
6
+ import { createInputResolvers, parseInputs } from "./input-resolvers.js";
7
+ import { evaluateDocument } from "./evaluate-document.js";
8
+ import { createEvaluator, createSyncEvaluator, evaluatePredicate, evaluateValue } from "./evaluator-factory.js";
9
+ import { DEFAULT_MAX_EVALUATION_NODES, DEFAULT_MAX_NESTING_DEPTH } from "./evaluator-budget.js";
5
10
  import { and, iff, implies, nand, none, nor, not, or, xor } from "./derived-connectives.js";
6
- import { hierarchicalGlobPattern, prefixPattern, wildcardPattern } from "./derived-patterns.js";
11
+ import { average, count, presenceOf, sum } from "./derived-aggregates.js";
7
12
  import { coalesce } from "./derived-values.js";
8
- import { IndeterminateReasonSchema, definite, firstIndeterminate, indeterminate } from "./evaluation.js";
9
- import { DEFAULT_MAX_EVALUATION_NODES, DEFAULT_MAX_NESTING_DEPTH } from "./evaluator-budget.js";
10
- import { JsonValueSchema } from "./json-value.js";
13
+ import { hierarchicalGlobPattern, prefixPattern, wildcardPattern } from "./derived-patterns.js";
14
+ import { complexFromPolar, complexLiteralFromPolar, complexMagnitude, complexPhase } from "./complex.js";
11
15
  import { AccumulatorNodeSchema, AllOfNodeSchema, AndNodeSchema, AnyOfNodeSchema, ArithmeticNodeSchema, ArithmeticOperatorSchema, BooleanLiteralNodeSchema, CallNodeSchema, CompareNodeSchema, ComparisonOperatorSchema, ComplexLiteralNodeSchema, ComplexPolarLiteralNodeSchema, ComplexRectangularLiteralNodeSchema, ConditionalCaseSchema, ConditionalNodeSchema, DelegateNodeSchema, DurationLiteralNodeSchema, EveryNodeSchema, ExistsNodeSchema, ExpressionNodeSchema, FoldCombinerSchema, FoldNodeSchema, HitPolicySchema, InstantLiteralNodeSchema, LookupNodeSchema, MemberOfNodeSchema, MembershipOperatorSchema, NegateNodeSchema, NotNodeSchema, NumberLiteralNodeSchema, OrNodeSchema, PredicateNodeSchema, ReferenceNodeSchema, SomeNodeSchema, TextCompareNodeSchema, TextComparisonOperatorSchema, TextLiteralNodeSchema, TreeReferenceNodeSchema } from "./tree.js";
12
- import { emptyFunctionRegistry } from "./functions.js";
13
- import { createEvaluator, createSyncEvaluator, evaluatePredicate, evaluateValue } from "./evaluator-factory.js";
14
- import { createInputResolvers, parseInputs } from "./input-resolvers.js";
15
- import { evaluateDocument } from "./evaluate-document.js";
16
16
  export { AccumulatorNodeSchema, AllOfNodeSchema, AndNodeSchema, AnyOfNodeSchema, ArithmeticNodeSchema, ArithmeticOperatorSchema, BooleanLiteralNodeSchema, CallNodeSchema, CompareNodeSchema, ComparisonOperatorSchema, ComplexLiteralNodeSchema, ComplexPolarLiteralNodeSchema, ComplexRectangularLiteralNodeSchema, ComputedValueSchema, ConditionalCaseSchema, ConditionalNodeSchema, DEFAULT_MAX_EVALUATION_NODES, DEFAULT_MAX_NESTING_DEPTH, DelegateNodeSchema, DurationLiteralNodeSchema, DurationUnitSchema, EveryNodeSchema, ExistsNodeSchema, ExpressionNodeSchema, FoldCombinerSchema, FoldNodeSchema, HitPolicySchema, IndeterminateReasonSchema, InstantLiteralNodeSchema, JsonValueSchema, LookupNodeSchema, MemberOfNodeSchema, MembershipOperatorSchema, NegateNodeSchema, NotNodeSchema, NumberLiteralNodeSchema, OrNodeSchema, PredicateNodeSchema, ReferenceNodeSchema, SomeNodeSchema, TextCompareNodeSchema, TextComparisonOperatorSchema, TextLiteralNodeSchema, TreeReferenceNodeSchema, UnitSchema, and, average, builtinFunctions, coalesce, combineUnitsForDivide, combineUnitsForMultiply, complexFromPolar, complexLiteralFromPolar, complexMagnitude, complexPhase, count, createEvaluator, createInputResolvers, createSyncEvaluator, definite, emptyFunctionRegistry, evaluateDocument, evaluatePredicate, evaluateValue, firstIndeterminate, hierarchicalGlobPattern, iff, implies, indeterminate, nand, none, nor, not, or, parseInputs, prefixPattern, presenceOf, sum, unitsEqual, wildcardPattern, xor };
@@ -1,7 +1,7 @@
1
1
  Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
2
2
  const require_computed_value = require("./computed-value.cjs");
3
3
  const require_plain_record = require("./plain-record.cjs");
4
- //#region src/input-resolvers.ts
4
+ // src/input-resolvers.ts
5
5
  /** A plain JSON number, string or boolean is the unit-less value of that kind; anything else must already be a complete `ComputedValue` (the only way to supply units, durations, instants or complex values). Both routes end in `ComputedValueSchema`, so a number that is not finite (`1e999` parses to `Infinity`) is refused whichever way it was written, and a field the schema does not define is dropped rather than carried along. */
6
6
  function toComputedValue(raw) {
7
7
  const candidate = typeof raw === "number" ? {
@@ -105,6 +105,5 @@ function createInputResolvers(inputs, collections = /* @__PURE__ */ new Map()) {
105
105
  }
106
106
  };
107
107
  }
108
- //#endregion
109
108
  exports.createInputResolvers = createInputResolvers;
110
109
  exports.parseInputs = parseInputs;
@@ -1,6 +1,5 @@
1
- import { t as ComputedValue } from "./computed-value-CbRF0Izc.cjs";
1
+ import { ComputedValue } from "./computed-value.cjs";
2
2
  import { SyncResolvers } from "./resolvers.cjs";
3
- //#region src/input-resolvers.d.ts
4
3
  /** One element of a list input: the named values a `reference` resolves against while a `fold`, `some` or `every` is evaluating that element. */
5
4
  export type InputItem = ReadonlyMap<string, ComputedValue>;
6
5
  export type InputsParseResult = {
@@ -20,5 +19,4 @@ export declare function parseInputs(raw: unknown): InputsParseResult;
20
19
  /**
21
20
  * Synchronous resolvers over named inputs and lists of items. A `reference` whose key is a string resolves to the value of that name: against the top-level inputs outside a `fold`, `some` or `every`, and against the current item alone inside one, since descending into a collection replaces the evaluation context with the item (an item does not see the top-level inputs, so a value an item needs is written into the item). Every other key, and every `lookup`, is `not-found`. `resolveCollection` returns the items the inputs hold under the collection's name, each wrapped so that only the wrapper this module created is read as an item (a list built by the embedder works the same as a parsed one), and throws for a collection the inputs do not hold: an empty list would silently change what a `fold`, `some` or `every` means, and a missing list is a mistake in the tree or the inputs, not an empty collection. `delegate` and `treeReference` nodes are left unresolved, so they are `wrong-type` like any node whose optional resolver is absent.
22
21
  */
23
- export declare function createInputResolvers(inputs: ReadonlyMap<string, ComputedValue>, collections?: ReadonlyMap<string, readonly InputItem[]>): SyncResolvers;
24
- //#endregion
22
+ export declare function createInputResolvers(inputs: ReadonlyMap<string, ComputedValue>, collections?: ReadonlyMap<string, readonly InputItem[]>): SyncResolvers;
@@ -1,6 +1,5 @@
1
- import { t as ComputedValue } from "./computed-value-CbRF0Izc.js";
1
+ import { t as ComputedValue } from "./computed-value-CaFJ1YkU.js";
2
2
  import { SyncResolvers } from "./resolvers.js";
3
- //#region src/input-resolvers.d.ts
4
3
  /** One element of a list input: the named values a `reference` resolves against while a `fold`, `some` or `every` is evaluating that element. */
5
4
  export type InputItem = ReadonlyMap<string, ComputedValue>;
6
5
  export type InputsParseResult = {
@@ -20,5 +19,4 @@ export declare function parseInputs(raw: unknown): InputsParseResult;
20
19
  /**
21
20
  * Synchronous resolvers over named inputs and lists of items. A `reference` whose key is a string resolves to the value of that name: against the top-level inputs outside a `fold`, `some` or `every`, and against the current item alone inside one, since descending into a collection replaces the evaluation context with the item (an item does not see the top-level inputs, so a value an item needs is written into the item). Every other key, and every `lookup`, is `not-found`. `resolveCollection` returns the items the inputs hold under the collection's name, each wrapped so that only the wrapper this module created is read as an item (a list built by the embedder works the same as a parsed one), and throws for a collection the inputs do not hold: an empty list would silently change what a `fold`, `some` or `every` means, and a missing list is a mistake in the tree or the inputs, not an empty collection. `delegate` and `treeReference` nodes are left unresolved, so they are `wrong-type` like any node whose optional resolver is absent.
22
21
  */
23
- export declare function createInputResolvers(inputs: ReadonlyMap<string, ComputedValue>, collections?: ReadonlyMap<string, readonly InputItem[]>): SyncResolvers;
24
- //#endregion
22
+ export declare function createInputResolvers(inputs: ReadonlyMap<string, ComputedValue>, collections?: ReadonlyMap<string, readonly InputItem[]>): SyncResolvers;
@@ -1,6 +1,6 @@
1
1
  import { ComputedValueSchema } from "./computed-value.js";
2
2
  import { isPlainRecord } from "./plain-record.js";
3
- //#region src/input-resolvers.ts
3
+ // src/input-resolvers.ts
4
4
  /** A plain JSON number, string or boolean is the unit-less value of that kind; anything else must already be a complete `ComputedValue` (the only way to supply units, durations, instants or complex values). Both routes end in `ComputedValueSchema`, so a number that is not finite (`1e999` parses to `Infinity`) is refused whichever way it was written, and a field the schema does not define is dropped rather than carried along. */
5
5
  function toComputedValue(raw) {
6
6
  const candidate = typeof raw === "number" ? {
@@ -104,5 +104,4 @@ function createInputResolvers(inputs, collections = /* @__PURE__ */ new Map()) {
104
104
  }
105
105
  };
106
106
  }
107
- //#endregion
108
107
  export { createInputResolvers, parseInputs };
@@ -1,5 +1,5 @@
1
1
  Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
2
- //#region src/integer-power.ts
2
+ // src/integer-power.ts
3
3
  /**
4
4
  * `base` raised to a non-negative integer `exponent` by exponentiation by squaring: one squaring and at most one product per bit of the exponent, so the number of `multiply` calls grows with the logarithm of the exponent where repeated multiplication grows with the exponent itself (an exponent of 1e9 is a few dozen products rather than a billion). `identity` is the value of exponent zero and the start of the product; `multiply` must be associative, which squaring relies on. With a rounding `multiply` the grouping matters: squaring compounds a rounding error through each successive square, so its error grows in proportion to the exponent, and for large exponents the result is many times less accurate than a plain loop's, in exchange for work that does not grow with the exponent.
5
5
  *
@@ -16,5 +16,4 @@ function powerByRepeatedSquaring({ base, exponent, identity, multiply }) {
16
16
  }
17
17
  return result;
18
18
  }
19
- //#endregion
20
19
  exports.powerByRepeatedSquaring = powerByRepeatedSquaring;
@@ -1,4 +1,3 @@
1
- //#region src/integer-power.d.ts
2
1
  /**
3
2
  * `base` raised to a non-negative integer `exponent` by exponentiation by squaring: one squaring and at most one product per bit of the exponent, so the number of `multiply` calls grows with the logarithm of the exponent where repeated multiplication grows with the exponent itself (an exponent of 1e9 is a few dozen products rather than a billion). `identity` is the value of exponent zero and the start of the product; `multiply` must be associative, which squaring relies on. With a rounding `multiply` the grouping matters: squaring compounds a rounding error through each successive square, so its error grows in proportion to the exponent, and for large exponents the result is many times less accurate than a plain loop's, in exchange for work that does not grow with the exponent.
4
3
  *
@@ -9,5 +8,4 @@ export declare function powerByRepeatedSquaring<T>({ base, exponent, identity, m
9
8
  exponent: number;
10
9
  identity: T;
11
10
  multiply: (left: T, right: T) => T;
12
- }): T;
13
- //#endregion
11
+ }): T;
@@ -1,4 +1,3 @@
1
- //#region src/integer-power.d.ts
2
1
  /**
3
2
  * `base` raised to a non-negative integer `exponent` by exponentiation by squaring: one squaring and at most one product per bit of the exponent, so the number of `multiply` calls grows with the logarithm of the exponent where repeated multiplication grows with the exponent itself (an exponent of 1e9 is a few dozen products rather than a billion). `identity` is the value of exponent zero and the start of the product; `multiply` must be associative, which squaring relies on. With a rounding `multiply` the grouping matters: squaring compounds a rounding error through each successive square, so its error grows in proportion to the exponent, and for large exponents the result is many times less accurate than a plain loop's, in exchange for work that does not grow with the exponent.
4
3
  *
@@ -9,5 +8,4 @@ export declare function powerByRepeatedSquaring<T>({ base, exponent, identity, m
9
8
  exponent: number;
10
9
  identity: T;
11
10
  multiply: (left: T, right: T) => T;
12
- }): T;
13
- //#endregion
11
+ }): T;
@@ -1,4 +1,4 @@
1
- //#region src/integer-power.ts
1
+ // src/integer-power.ts
2
2
  /**
3
3
  * `base` raised to a non-negative integer `exponent` by exponentiation by squaring: one squaring and at most one product per bit of the exponent, so the number of `multiply` calls grows with the logarithm of the exponent where repeated multiplication grows with the exponent itself (an exponent of 1e9 is a few dozen products rather than a billion). `identity` is the value of exponent zero and the start of the product; `multiply` must be associative, which squaring relies on. With a rounding `multiply` the grouping matters: squaring compounds a rounding error through each successive square, so its error grows in proportion to the exponent, and for large exponents the result is many times less accurate than a plain loop's, in exchange for work that does not grow with the exponent.
4
4
  *
@@ -15,5 +15,4 @@ function powerByRepeatedSquaring({ base, exponent, identity, multiply }) {
15
15
  }
16
16
  return result;
17
17
  }
18
- //#endregion
19
18
  export { powerByRepeatedSquaring };
@@ -1,5 +1,4 @@
1
1
  import { z } from "zod";
2
- //#region src/json-value.d.ts
3
2
  /**
4
3
  * A JSON value with no further meaning imposed by this schema -- used for every opaque payload (reference keys, table identifiers, collection references, delegation payloads). "Opaque" means "uninterpreted by this package", not "untyped" -- every one of these must still be plain, serialisable JSON.
5
4
  */
@@ -7,5 +6,4 @@ type JsonValue = string | number | boolean | null | JsonValue[] | {
7
6
  [key: string]: JsonValue;
8
7
  };
9
8
  declare const JsonValueSchema: z.ZodType<JsonValue>;
10
- //#endregion
11
9
  export { JsonValueSchema as n, JsonValue as t };
@@ -1,6 +1,6 @@
1
1
  Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
2
2
  let zod = require("zod");
3
- //#region src/json-value.ts
3
+ // src/json-value.ts
4
4
  const JsonValueSchema = zod.z.lazy(() => zod.z.union([
5
5
  zod.z.string(),
6
6
  zod.z.number(),
@@ -9,5 +9,4 @@ const JsonValueSchema = zod.z.lazy(() => zod.z.union([
9
9
  zod.z.array(JsonValueSchema),
10
10
  zod.z.record(zod.z.string(), JsonValueSchema)
11
11
  ]));
12
- //#endregion
13
12
  exports.JsonValueSchema = JsonValueSchema;
@@ -1,2 +1,8 @@
1
- import { n as JsonValueSchema, t as JsonValue } from "./json-value-B1Hjjjri.cjs";
2
- export { JsonValue, JsonValueSchema };
1
+ import { z } from "zod";
2
+ /**
3
+ * A JSON value with no further meaning imposed by this schema -- used for every opaque payload (reference keys, table identifiers, collection references, delegation payloads). "Opaque" means "uninterpreted by this package", not "untyped" -- every one of these must still be plain, serialisable JSON.
4
+ */
5
+ export type JsonValue = string | number | boolean | null | JsonValue[] | {
6
+ [key: string]: JsonValue;
7
+ };
8
+ export declare const JsonValueSchema: z.ZodType<JsonValue>;
@@ -1,2 +1,2 @@
1
- import { n as JsonValueSchema, t as JsonValue } from "./json-value-B1Hjjjri.js";
1
+ import { n as JsonValueSchema, t as JsonValue } from "./json-value-ZLMaKP0n.js";
2
2
  export { JsonValue, JsonValueSchema };
@@ -1,5 +1,5 @@
1
1
  import { z } from "zod";
2
- //#region src/json-value.ts
2
+ // src/json-value.ts
3
3
  const JsonValueSchema = z.lazy(() => z.union([
4
4
  z.string(),
5
5
  z.number(),
@@ -8,5 +8,4 @@ const JsonValueSchema = z.lazy(() => z.union([
8
8
  z.array(JsonValueSchema),
9
9
  z.record(z.string(), JsonValueSchema)
10
10
  ]));
11
- //#endregion
12
11
  export { JsonValueSchema };
@@ -1,8 +1,7 @@
1
1
  Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
2
- //#region src/plain-record.ts
2
+ // src/plain-record.ts
3
3
  /** Narrows `unknown` to a plain JSON-style object: not `null`, not an array. The guard parsed JSON is checked with before its fields are read, in place of an `as Record<string, unknown>` assertion. */
4
4
  function isPlainRecord(value) {
5
5
  return typeof value === "object" && value !== null && !Array.isArray(value);
6
6
  }
7
- //#endregion
8
7
  exports.isPlainRecord = isPlainRecord;
@@ -1,4 +1,2 @@
1
- //#region src/plain-record.d.ts
2
1
  /** Narrows `unknown` to a plain JSON-style object: not `null`, not an array. The guard parsed JSON is checked with before its fields are read, in place of an `as Record<string, unknown>` assertion. */
3
- export declare function isPlainRecord(value: unknown): value is Record<string, unknown>;
4
- //#endregion
2
+ export declare function isPlainRecord(value: unknown): value is Record<string, unknown>;
@@ -1,4 +1,2 @@
1
- //#region src/plain-record.d.ts
2
1
  /** Narrows `unknown` to a plain JSON-style object: not `null`, not an array. The guard parsed JSON is checked with before its fields are read, in place of an `as Record<string, unknown>` assertion. */
3
- export declare function isPlainRecord(value: unknown): value is Record<string, unknown>;
4
- //#endregion
2
+ export declare function isPlainRecord(value: unknown): value is Record<string, unknown>;
@@ -1,7 +1,6 @@
1
- //#region src/plain-record.ts
1
+ // src/plain-record.ts
2
2
  /** Narrows `unknown` to a plain JSON-style object: not `null`, not an array. The guard parsed JSON is checked with before its fields are read, in place of an `as Record<string, unknown>` assertion. */
3
3
  function isPlainRecord(value) {
4
4
  return typeof value === "object" && value !== null && !Array.isArray(value);
5
5
  }
6
- //#endregion
7
6
  export { isPlainRecord };
@@ -1,6 +1,5 @@
1
- import { t as ComputedValue } from "./computed-value-CbRF0Izc.cjs";
2
- import { t as JsonValue } from "./json-value-B1Hjjjri.cjs";
3
- //#region src/resolvers.d.ts
1
+ import { ComputedValue } from "./computed-value.cjs";
2
+ import { JsonValue } from "./json-value.cjs";
4
3
  /**
5
4
  * An opaque, purely in-process value supplied by the caller, never itself part of the serialised tree and never required to be JSON-serialisable. Descending into a `fold` or a quantifier replaces the context for the sub-node's evaluation with the single resolved item.
6
5
  */
@@ -52,5 +51,4 @@ export interface SyncResolvers {
52
51
  resolveTree?: (key: JsonValue, context: EvaluationContext) => TreeResolution;
53
52
  }
54
53
  /** What the shared node rules accept: either flavour of resolvers, since they only ever hand each result to `wait`. */
55
- export type EvaluatorResolvers = Resolvers | SyncResolvers;
56
- //#endregion
54
+ export type EvaluatorResolvers = Resolvers | SyncResolvers;
@@ -1,6 +1,5 @@
1
- import { t as ComputedValue } from "./computed-value-CbRF0Izc.js";
2
- import { t as JsonValue } from "./json-value-B1Hjjjri.js";
3
- //#region src/resolvers.d.ts
1
+ import { t as ComputedValue } from "./computed-value-CaFJ1YkU.js";
2
+ import { t as JsonValue } from "./json-value-ZLMaKP0n.js";
4
3
  /**
5
4
  * An opaque, purely in-process value supplied by the caller, never itself part of the serialised tree and never required to be JSON-serialisable. Descending into a `fold` or a quantifier replaces the context for the sub-node's evaluation with the single resolved item.
6
5
  */
@@ -52,5 +51,4 @@ export interface SyncResolvers {
52
51
  resolveTree?: (key: JsonValue, context: EvaluationContext) => TreeResolution;
53
52
  }
54
53
  /** What the shared node rules accept: either flavour of resolvers, since they only ever hand each result to `wait`. */
55
- export type EvaluatorResolvers = Resolvers | SyncResolvers;
56
- //#endregion
54
+ export type EvaluatorResolvers = Resolvers | SyncResolvers;
package/dist/tree.cjs CHANGED
@@ -2,7 +2,7 @@ Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
2
2
  const require_computed_value = require("./computed-value.cjs");
3
3
  const require_json_value = require("./json-value.cjs");
4
4
  let zod = require("zod");
5
- //#region src/tree.ts
5
+ // src/tree.ts
6
6
  const ComparisonOperatorSchema = zod.z.enum([
7
7
  "gt",
8
8
  "gte",
@@ -292,7 +292,6 @@ const CoreExpressionNodeSchema = zod.z.discriminatedUnion("kind", [
292
292
  TreeReferenceNodeSchema
293
293
  ]);
294
294
  const ExpressionNodeSchema = zod.z.union([CoreExpressionNodeSchema, ComplexLiteralNodeSchema]);
295
- //#endregion
296
295
  exports.AccumulatorNodeSchema = AccumulatorNodeSchema;
297
296
  exports.AllOfNodeSchema = AllOfNodeSchema;
298
297
  exports.AndNodeSchema = AndNodeSchema;
package/dist/tree.d.cts CHANGED
@@ -1,6 +1,5 @@
1
- import { t as JsonValue } from "./json-value-B1Hjjjri.cjs";
1
+ import { JsonValue } from "./json-value.cjs";
2
2
  import { z } from "zod";
3
- //#region src/tree.d.ts
4
3
  export declare const ComparisonOperatorSchema: z.ZodEnum<{
5
4
  gt: "gt";
6
5
  gte: "gte";
@@ -444,5 +443,4 @@ export declare const ExpressionNodeSchema: z.ZodUnion<readonly [z.ZodDiscriminat
444
443
  phase: z.ZodNumber;
445
444
  unit: z.ZodOptional<z.ZodRecord<z.ZodString, z.ZodNumber>>;
446
445
  }, z.core.$strict>]>]>;
447
- export type ExpressionNode = z.infer<typeof ExpressionNodeSchema>;
448
- //#endregion
446
+ export type ExpressionNode = z.infer<typeof ExpressionNodeSchema>;
package/dist/tree.d.ts CHANGED
@@ -1,6 +1,5 @@
1
- import { t as JsonValue } from "./json-value-B1Hjjjri.js";
1
+ import { t as JsonValue } from "./json-value-ZLMaKP0n.js";
2
2
  import { z } from "zod";
3
- //#region src/tree.d.ts
4
3
  export declare const ComparisonOperatorSchema: z.ZodEnum<{
5
4
  gt: "gt";
6
5
  gte: "gte";
@@ -444,5 +443,4 @@ export declare const ExpressionNodeSchema: z.ZodUnion<readonly [z.ZodDiscriminat
444
443
  phase: z.ZodNumber;
445
444
  unit: z.ZodOptional<z.ZodRecord<z.ZodString, z.ZodNumber>>;
446
445
  }, z.core.$strict>]>]>;
447
- export type ExpressionNode = z.infer<typeof ExpressionNodeSchema>;
448
- //#endregion
446
+ export type ExpressionNode = z.infer<typeof ExpressionNodeSchema>;
package/dist/tree.js CHANGED
@@ -1,7 +1,7 @@
1
1
  import { DurationUnitSchema, UnitSchema } from "./computed-value.js";
2
2
  import { JsonValueSchema } from "./json-value.js";
3
3
  import { z } from "zod";
4
- //#region src/tree.ts
4
+ // src/tree.ts
5
5
  const ComparisonOperatorSchema = z.enum([
6
6
  "gt",
7
7
  "gte",
@@ -291,5 +291,4 @@ const CoreExpressionNodeSchema = z.discriminatedUnion("kind", [
291
291
  TreeReferenceNodeSchema
292
292
  ]);
293
293
  const ExpressionNodeSchema = z.union([CoreExpressionNodeSchema, ComplexLiteralNodeSchema]);
294
- //#endregion
295
294
  export { AccumulatorNodeSchema, AllOfNodeSchema, AndNodeSchema, AnyOfNodeSchema, ArithmeticNodeSchema, ArithmeticOperatorSchema, BooleanLiteralNodeSchema, CallNodeSchema, CompareNodeSchema, ComparisonOperatorSchema, ComplexLiteralNodeSchema, ComplexPolarLiteralNodeSchema, ComplexRectangularLiteralNodeSchema, ConditionalCaseSchema, ConditionalNodeSchema, DelegateNodeSchema, DurationLiteralNodeSchema, EveryNodeSchema, ExistsNodeSchema, ExpressionNodeSchema, FoldCombinerSchema, FoldNodeSchema, HitPolicySchema, InstantLiteralNodeSchema, LookupNodeSchema, MemberOfNodeSchema, MembershipOperatorSchema, NegateNodeSchema, NotNodeSchema, NumberLiteralNodeSchema, OrNodeSchema, PredicateNodeSchema, ReferenceNodeSchema, SomeNodeSchema, TextCompareNodeSchema, TextComparisonOperatorSchema, TextLiteralNodeSchema, TreeReferenceNodeSchema };