arethesis 0.2.0 → 0.2.1
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.
- package/CHANGELOG.md +34 -0
- package/README.md +3 -2
- package/dist/arethesis.js +2 -222
- package/dist/binding/data-binder.d.ts +8 -0
- package/dist/binding/data-binder.d.ts.map +1 -1
- package/dist/binding/data-binder.js +605 -0
- package/dist/binding/data-binder.js.map +1 -0
- package/dist/binding/types.d.ts +20 -0
- package/dist/binding/types.d.ts.map +1 -1
- package/dist/binding/validation-engine.js +160 -0
- package/dist/binding/validation-engine.js.map +1 -0
- package/dist/cdn/arethesis.min.js +2 -0
- package/dist/cdn/arethesis.min.js.map +1 -0
- package/dist/cdn/chunks/CdTL-MEv.min.js +3 -0
- package/dist/cdn/chunks/CdTL-MEv.min.js.map +1 -0
- package/dist/cdn/components.min.js +81 -0
- package/dist/cdn/components.min.js.map +1 -0
- package/dist/collab/index.d.ts +22 -0
- package/dist/collab/index.d.ts.map +1 -0
- package/dist/collab/index.js +23 -0
- package/dist/collab/index.js.map +1 -0
- package/dist/components/component.d.ts +17 -0
- package/dist/components/component.d.ts.map +1 -1
- package/dist/components/component.js +765 -0
- package/dist/components/component.js.map +1 -0
- package/dist/components/decorators.js +27 -0
- package/dist/components/decorators.js.map +1 -0
- package/dist/components/form-associated.d.ts +55 -0
- package/dist/components/form-associated.d.ts.map +1 -0
- package/dist/components/form-associated.js +180 -0
- package/dist/components/form-associated.js.map +1 -0
- package/dist/components/runtime.d.ts +2 -0
- package/dist/components/runtime.d.ts.map +1 -1
- package/dist/components/runtime.js +18 -0
- package/dist/components/runtime.js.map +1 -0
- package/dist/components/template-loader.js +90 -0
- package/dist/components/template-loader.js.map +1 -0
- package/dist/components.js +2 -2810
- package/dist/core/arethesis.d.ts +13 -9
- package/dist/core/arethesis.d.ts.map +1 -1
- package/dist/core/arethesis.js +249 -0
- package/dist/core/arethesis.js.map +1 -0
- package/dist/core/hooks.d.ts +19 -0
- package/dist/core/hooks.d.ts.map +1 -0
- package/dist/core/hooks.js +23 -0
- package/dist/core/hooks.js.map +1 -0
- package/dist/core/index.d.ts +57 -0
- package/dist/core/index.d.ts.map +1 -0
- package/dist/core/index.js +25 -0
- package/dist/data/list-view-registry.js +300 -0
- package/dist/data/list-view-registry.js.map +1 -0
- package/dist/data/object-store.js +280 -0
- package/dist/data/object-store.js.map +1 -0
- package/dist/data/optimistic-updates.js +168 -0
- package/dist/data/optimistic-updates.js.map +1 -0
- package/dist/data/persistence-manager.js +233 -0
- package/dist/data/persistence-manager.js.map +1 -0
- package/dist/defaults.d.ts +1 -0
- package/dist/defaults.d.ts.map +1 -0
- package/dist/defaults.js +17 -0
- package/dist/defaults.js.map +1 -0
- package/dist/http/auth-manager.js +260 -0
- package/dist/http/auth-manager.js.map +1 -0
- package/dist/http/http-client.d.ts +7 -0
- package/dist/http/http-client.d.ts.map +1 -1
- package/dist/http/http-client.js +501 -0
- package/dist/http/http-client.js.map +1 -0
- package/dist/http/http-error.js +53 -0
- package/dist/http/http-error.js.map +1 -0
- package/dist/http/mapping.js +64 -0
- package/dist/http/mapping.js.map +1 -0
- package/dist/index.d.ts +3 -58
- package/dist/index.d.ts.map +1 -1
- package/dist/index.js +55 -0
- package/dist/kit/calendar.d.ts +43 -0
- package/dist/kit/calendar.d.ts.map +1 -0
- package/dist/kit/calendar.js +423 -0
- package/dist/kit/calendar.js.map +1 -0
- package/dist/kit/cell-editor.js +191 -0
- package/dist/kit/cell-editor.js.map +1 -0
- package/dist/kit/chart.d.ts +2 -0
- package/dist/kit/chart.d.ts.map +1 -1
- package/dist/kit/chart.js +541 -0
- package/dist/kit/chart.js.map +1 -0
- package/dist/kit/combobox.d.ts +57 -0
- package/dist/kit/combobox.d.ts.map +1 -0
- package/dist/kit/combobox.js +379 -0
- package/dist/kit/combobox.js.map +1 -0
- package/dist/kit/command-palette.d.ts +2 -0
- package/dist/kit/command-palette.d.ts.map +1 -1
- package/dist/kit/command-palette.js +315 -0
- package/dist/kit/command-palette.js.map +1 -0
- package/dist/kit/data-table.d.ts +11 -0
- package/dist/kit/data-table.d.ts.map +1 -1
- package/dist/kit/data-table.js +373 -0
- package/dist/kit/data-table.js.map +1 -0
- package/dist/kit/dialog.d.ts +31 -0
- package/dist/kit/dialog.d.ts.map +1 -0
- package/dist/kit/dialog.js +157 -0
- package/dist/kit/dialog.js.map +1 -0
- package/dist/kit/elements/calendar.d.ts +3 -0
- package/dist/kit/elements/calendar.d.ts.map +1 -0
- package/dist/kit/elements/calendar.js +11 -0
- package/dist/kit/elements/calendar.js.map +1 -0
- package/dist/kit/elements/chart.d.ts +3 -0
- package/dist/kit/elements/chart.d.ts.map +1 -0
- package/dist/kit/elements/chart.js +11 -0
- package/dist/kit/elements/chart.js.map +1 -0
- package/dist/kit/elements/combobox.d.ts +3 -0
- package/dist/kit/elements/combobox.d.ts.map +1 -0
- package/dist/kit/elements/combobox.js +11 -0
- package/dist/kit/elements/combobox.js.map +1 -0
- package/dist/kit/elements/command-palette.d.ts +3 -0
- package/dist/kit/elements/command-palette.d.ts.map +1 -0
- package/dist/kit/elements/command-palette.js +11 -0
- package/dist/kit/elements/command-palette.js.map +1 -0
- package/dist/kit/elements/data-table.d.ts +3 -0
- package/dist/kit/elements/data-table.d.ts.map +1 -0
- package/dist/kit/elements/data-table.js +11 -0
- package/dist/kit/elements/data-table.js.map +1 -0
- package/dist/kit/elements/dialog.d.ts +4 -0
- package/dist/kit/elements/dialog.d.ts.map +1 -0
- package/dist/kit/elements/dialog.js +11 -0
- package/dist/kit/elements/dialog.js.map +1 -0
- package/dist/kit/elements/flex-view.d.ts +3 -0
- package/dist/kit/elements/flex-view.d.ts.map +1 -0
- package/dist/kit/elements/flex-view.js +11 -0
- package/dist/kit/elements/flex-view.js.map +1 -0
- package/dist/kit/elements/form.d.ts +3 -0
- package/dist/kit/elements/form.d.ts.map +1 -0
- package/dist/kit/elements/form.js +11 -0
- package/dist/kit/elements/form.js.map +1 -0
- package/dist/kit/elements/kanban.d.ts +3 -0
- package/dist/kit/elements/kanban.d.ts.map +1 -0
- package/dist/kit/elements/kanban.js +11 -0
- package/dist/kit/elements/kanban.js.map +1 -0
- package/dist/kit/elements/list.d.ts +3 -0
- package/dist/kit/elements/list.d.ts.map +1 -0
- package/dist/kit/elements/list.js +11 -0
- package/dist/kit/elements/list.js.map +1 -0
- package/dist/kit/elements/markdown-editor.d.ts +3 -0
- package/dist/kit/elements/markdown-editor.d.ts.map +1 -0
- package/dist/kit/elements/markdown-editor.js +11 -0
- package/dist/kit/elements/markdown-editor.js.map +1 -0
- package/dist/kit/elements/presence.d.ts +3 -0
- package/dist/kit/elements/presence.d.ts.map +1 -0
- package/dist/kit/elements/presence.js +11 -0
- package/dist/kit/elements/presence.js.map +1 -0
- package/dist/kit/elements/sheet.d.ts +3 -0
- package/dist/kit/elements/sheet.d.ts.map +1 -0
- package/dist/kit/elements/sheet.js +11 -0
- package/dist/kit/elements/sheet.js.map +1 -0
- package/dist/kit/elements/tabs.d.ts +3 -0
- package/dist/kit/elements/tabs.d.ts.map +1 -0
- package/dist/kit/elements/tabs.js +11 -0
- package/dist/kit/elements/tabs.js.map +1 -0
- package/dist/kit/elements/toast.d.ts +4 -0
- package/dist/kit/elements/toast.d.ts.map +1 -0
- package/dist/kit/elements/toast.js +11 -0
- package/dist/kit/elements/toast.js.map +1 -0
- package/dist/kit/elements/tree.d.ts +3 -0
- package/dist/kit/elements/tree.d.ts.map +1 -0
- package/dist/kit/elements/tree.js +11 -0
- package/dist/kit/elements/tree.js.map +1 -0
- package/dist/kit/flex-view.d.ts +2 -0
- package/dist/kit/flex-view.d.ts.map +1 -1
- package/dist/kit/flex-view.js +346 -0
- package/dist/kit/flex-view.js.map +1 -0
- package/dist/kit/form.d.ts +2 -0
- package/dist/kit/form.d.ts.map +1 -1
- package/dist/kit/form.js +211 -0
- package/dist/kit/form.js.map +1 -0
- package/dist/kit/index.d.ts +15 -15
- package/dist/kit/index.d.ts.map +1 -1
- package/dist/kit/index.js +40 -0
- package/dist/kit/internal/modal.d.ts +26 -0
- package/dist/kit/internal/modal.d.ts.map +1 -0
- package/dist/kit/internal/modal.js +59 -0
- package/dist/kit/internal/modal.js.map +1 -0
- package/dist/kit/kanban.d.ts +73 -0
- package/dist/kit/kanban.d.ts.map +1 -0
- package/dist/kit/kanban.js +404 -0
- package/dist/kit/kanban.js.map +1 -0
- package/dist/kit/list.d.ts +4 -0
- package/dist/kit/list.d.ts.map +1 -1
- package/dist/kit/list.js +106 -0
- package/dist/kit/list.js.map +1 -0
- package/dist/kit/markdown/highlight.js +106 -0
- package/dist/kit/markdown/highlight.js.map +1 -0
- package/dist/kit/markdown/render.js +260 -0
- package/dist/kit/markdown/render.js.map +1 -0
- package/dist/kit/markdown-editor.d.ts +2 -0
- package/dist/kit/markdown-editor.d.ts.map +1 -1
- package/dist/kit/markdown-editor.js +797 -0
- package/dist/kit/markdown-editor.js.map +1 -0
- package/dist/kit/presence.d.ts +36 -0
- package/dist/kit/presence.d.ts.map +1 -0
- package/dist/kit/presence.js +262 -0
- package/dist/kit/presence.js.map +1 -0
- package/dist/kit/sheet/formula.js +364 -0
- package/dist/kit/sheet/formula.js.map +1 -0
- package/dist/kit/sheet/model.js +136 -0
- package/dist/kit/sheet/model.js.map +1 -0
- package/dist/kit/sheet/sheet.d.ts +2 -0
- package/dist/kit/sheet/sheet.d.ts.map +1 -1
- package/dist/kit/sheet/sheet.js +676 -0
- package/dist/kit/sheet/sheet.js.map +1 -0
- package/dist/kit/tabs.d.ts +17 -0
- package/dist/kit/tabs.d.ts.map +1 -0
- package/dist/kit/tabs.js +192 -0
- package/dist/kit/tabs.js.map +1 -0
- package/dist/kit/theme-boot.generated.js +8 -0
- package/dist/kit/theme-boot.generated.js.map +1 -0
- package/dist/kit/theme.js +89 -0
- package/dist/kit/theme.js.map +1 -0
- package/dist/kit/toast.d.ts +46 -0
- package/dist/kit/toast.d.ts.map +1 -0
- package/dist/kit/toast.js +154 -0
- package/dist/kit/toast.js.map +1 -0
- package/dist/kit/tree.d.ts +41 -0
- package/dist/kit/tree.d.ts.map +1 -0
- package/dist/kit/tree.js +422 -0
- package/dist/kit/tree.js.map +1 -0
- package/dist/mixins/context-menu.d.ts.map +1 -1
- package/dist/mixins/context-menu.js +183 -0
- package/dist/mixins/context-menu.js.map +1 -0
- package/dist/mixins/draggable.d.ts.map +1 -1
- package/dist/mixins/draggable.js +140 -0
- package/dist/mixins/draggable.js.map +1 -0
- package/dist/mixins/dropdown.d.ts.map +1 -1
- package/dist/mixins/dropdown.js +216 -0
- package/dist/mixins/dropdown.js.map +1 -0
- package/dist/mixins/editable.d.ts.map +1 -1
- package/dist/mixins/editable.js +175 -0
- package/dist/mixins/editable.js.map +1 -0
- package/dist/mixins/grid-navigation.d.ts.map +1 -1
- package/dist/mixins/grid-navigation.js +194 -0
- package/dist/mixins/grid-navigation.js.map +1 -0
- package/dist/mixins/index.d.ts +6 -2
- package/dist/mixins/index.d.ts.map +1 -1
- package/dist/mixins/index.js +38 -0
- package/dist/mixins/index.js.map +1 -0
- package/dist/mixins/infinite-scroll.d.ts.map +1 -1
- package/dist/mixins/infinite-scroll.js +83 -0
- package/dist/mixins/infinite-scroll.js.map +1 -0
- package/dist/mixins/listbox.d.ts.map +1 -1
- package/dist/mixins/listbox.js +208 -0
- package/dist/mixins/listbox.js.map +1 -0
- package/dist/mixins/popup.d.ts +36 -0
- package/dist/mixins/popup.d.ts.map +1 -0
- package/dist/mixins/popup.js +113 -0
- package/dist/mixins/popup.js.map +1 -0
- package/dist/mixins/registry.d.ts +6 -0
- package/dist/mixins/registry.d.ts.map +1 -1
- package/dist/mixins/registry.js +167 -0
- package/dist/mixins/registry.js.map +1 -0
- package/dist/mixins/resizable.d.ts.map +1 -1
- package/dist/mixins/resizable.js +128 -0
- package/dist/mixins/resizable.js.map +1 -0
- package/dist/mixins/sortable.d.ts.map +1 -1
- package/dist/mixins/sortable.js +511 -0
- package/dist/mixins/sortable.js.map +1 -0
- package/dist/mixins/tooltip.d.ts.map +1 -1
- package/dist/mixins/tooltip.js +80 -0
- package/dist/mixins/tooltip.js.map +1 -0
- package/dist/mixins/utils.js +105 -0
- package/dist/mixins/utils.js.map +1 -0
- package/dist/plugins/async-validators.js +118 -0
- package/dist/plugins/async-validators.js.map +1 -0
- package/dist/plugins/builtins.d.ts +1 -1
- package/dist/plugins/builtins.d.ts.map +1 -1
- package/dist/plugins/builtins.js +20 -0
- package/dist/plugins/builtins.js.map +1 -0
- package/dist/plugins/date-utils.js +128 -0
- package/dist/plugins/date-utils.js.map +1 -0
- package/dist/plugins/plugin-manager.d.ts.map +1 -1
- package/dist/plugins/plugin-manager.js +99 -0
- package/dist/plugins/plugin-manager.js.map +1 -0
- package/dist/plugins/rich-text.js +365 -0
- package/dist/plugins/rich-text.js.map +1 -0
- package/dist/realtime/azure-pubsub-manager.js +273 -0
- package/dist/realtime/azure-pubsub-manager.js.map +1 -0
- package/dist/realtime/collab/anchors.js +19 -0
- package/dist/realtime/collab/anchors.js.map +1 -0
- package/dist/realtime/collab/collab-session.js +396 -0
- package/dist/realtime/collab/collab-session.js.map +1 -0
- package/dist/realtime/collab/cursor-overlay.js +187 -0
- package/dist/realtime/collab/cursor-overlay.js.map +1 -0
- package/dist/realtime/collab/textarea-adapter.js +125 -0
- package/dist/realtime/collab/textarea-adapter.js.map +1 -0
- package/dist/realtime/collab/undo-manager.js +148 -0
- package/dist/realtime/collab/undo-manager.js.map +1 -0
- package/dist/realtime/index.d.ts +11 -0
- package/dist/realtime/index.d.ts.map +1 -0
- package/dist/realtime/index.js +22 -0
- package/dist/realtime/index.js.map +1 -0
- package/dist/realtime/ot/client.js +74 -0
- package/dist/realtime/ot/client.js.map +1 -0
- package/dist/realtime/ot/server.js +292 -0
- package/dist/realtime/ot/server.js.map +1 -0
- package/dist/realtime/ot/text-operation.js +282 -0
- package/dist/realtime/ot/text-operation.js.map +1 -0
- package/dist/realtime/reconnect.js +58 -0
- package/dist/realtime/reconnect.js.map +1 -0
- package/dist/realtime/sse-manager.js +172 -0
- package/dist/realtime/sse-manager.js.map +1 -0
- package/dist/realtime/websocket-manager.js +180 -0
- package/dist/realtime/websocket-manager.js.map +1 -0
- package/dist/theme.css +178 -0
- package/dist/utils/backoff.js +30 -0
- package/dist/utils/backoff.js.map +1 -0
- package/dist/utils/dates.js +67 -0
- package/dist/utils/dates.js.map +1 -0
- package/dist/utils/dom.js +30 -0
- package/dist/utils/dom.js.map +1 -0
- package/dist/utils/emitter.js +40 -0
- package/dist/utils/emitter.js.map +1 -0
- package/dist/utils/fuzzy.d.ts +2 -0
- package/dist/utils/fuzzy.d.ts.map +1 -1
- package/dist/utils/fuzzy.js +95 -0
- package/dist/utils/fuzzy.js.map +1 -0
- package/dist/utils/path.js +99 -0
- package/dist/utils/path.js.map +1 -0
- package/dist/utils/sanitize.js +161 -0
- package/dist/utils/sanitize.js.map +1 -0
- package/dist/utils/url.js +44 -0
- package/dist/utils/url.js.map +1 -0
- package/dist/utils/virtual-window.d.ts +25 -0
- package/dist/utils/virtual-window.d.ts.map +1 -0
- package/dist/utils/virtual-window.js +19 -0
- package/dist/utils/virtual-window.js.map +1 -0
- package/dist/version.d.ts +1 -1
- package/dist/version.js +6 -0
- package/dist/version.js.map +1 -0
- package/package.json +61 -11
- package/dist/arethesis.js.map +0 -1
- package/dist/components.js.map +0 -1
- package/dist/fuzzy-Dnlbxdby.js +0 -5752
- package/dist/fuzzy-Dnlbxdby.js.map +0 -1
|
@@ -0,0 +1,364 @@
|
|
|
1
|
+
// src/kit/sheet/formula.ts
|
|
2
|
+
var FormulaError = class {
|
|
3
|
+
code;
|
|
4
|
+
constructor(code) {
|
|
5
|
+
this.code = code;
|
|
6
|
+
}
|
|
7
|
+
toString() {
|
|
8
|
+
return this.code;
|
|
9
|
+
}
|
|
10
|
+
};
|
|
11
|
+
/** 0-based column index of a column name: A → 0, Z → 25, AA → 26. */
|
|
12
|
+
function colIndex(name) {
|
|
13
|
+
let n = 0;
|
|
14
|
+
for (const ch of name.toUpperCase()) n = n * 26 + (ch.charCodeAt(0) - 64);
|
|
15
|
+
return n - 1;
|
|
16
|
+
}
|
|
17
|
+
/** Column name of a 0-based index. */
|
|
18
|
+
function colName(index) {
|
|
19
|
+
let n = index + 1;
|
|
20
|
+
let s = "";
|
|
21
|
+
while (n > 0) {
|
|
22
|
+
const r = (n - 1) % 26;
|
|
23
|
+
s = String.fromCharCode(65 + r) + s;
|
|
24
|
+
n = Math.floor((n - 1) / 26);
|
|
25
|
+
}
|
|
26
|
+
return s;
|
|
27
|
+
}
|
|
28
|
+
var address = (row, col) => `${colName(col)}${row + 1}`;
|
|
29
|
+
/** Parse "B7" into 0-based `{ row, col }`, or null. */
|
|
30
|
+
function parseAddress(addr) {
|
|
31
|
+
const m = /^\$?([A-Z]{1,3})\$?(\d+)$/i.exec(addr);
|
|
32
|
+
if (!m || Number(m[2]) < 1) return null;
|
|
33
|
+
return {
|
|
34
|
+
row: Number(m[2]) - 1,
|
|
35
|
+
col: colIndex(m[1])
|
|
36
|
+
};
|
|
37
|
+
}
|
|
38
|
+
var TOKEN = /\s*(?:(\d+\.?\d*(?:e[+-]?\d+)?|\.\d+)|"((?:[^"]|"")*)"|(\$?[A-Z]{1,3}\$?\d+)(?![A-Z(\d])|([A-Z_][A-Z0-9_.]*)|(<=|>=|<>|[-+*/^&=<>])|([(),:]))/iy;
|
|
39
|
+
function tokenize(src) {
|
|
40
|
+
const tokens = [];
|
|
41
|
+
TOKEN.lastIndex = 0;
|
|
42
|
+
let pos = 0;
|
|
43
|
+
while (pos < src.length) {
|
|
44
|
+
if (/^\s*$/.test(src.slice(pos))) break;
|
|
45
|
+
TOKEN.lastIndex = pos;
|
|
46
|
+
const m = TOKEN.exec(src);
|
|
47
|
+
if (!m) throw new FormulaError("#ERROR!");
|
|
48
|
+
pos = TOKEN.lastIndex;
|
|
49
|
+
if (m[1] !== void 0) tokens.push({
|
|
50
|
+
t: "num",
|
|
51
|
+
v: Number(m[1])
|
|
52
|
+
});
|
|
53
|
+
else if (m[2] !== void 0) tokens.push({
|
|
54
|
+
t: "str",
|
|
55
|
+
v: m[2].replace(/""/g, "\"")
|
|
56
|
+
});
|
|
57
|
+
else if (m[3] !== void 0) tokens.push({
|
|
58
|
+
t: "ref",
|
|
59
|
+
v: m[3].toUpperCase()
|
|
60
|
+
});
|
|
61
|
+
else if (m[4] !== void 0) {
|
|
62
|
+
const name = m[4].toUpperCase();
|
|
63
|
+
if (name === "TRUE" || name === "FALSE") tokens.push({
|
|
64
|
+
t: "bool",
|
|
65
|
+
v: name === "TRUE"
|
|
66
|
+
});
|
|
67
|
+
else tokens.push({
|
|
68
|
+
t: "name",
|
|
69
|
+
v: name
|
|
70
|
+
});
|
|
71
|
+
} else if (m[5] !== void 0) tokens.push({
|
|
72
|
+
t: "op",
|
|
73
|
+
v: m[5]
|
|
74
|
+
});
|
|
75
|
+
else tokens.push({ t: m[6] });
|
|
76
|
+
}
|
|
77
|
+
return tokens;
|
|
78
|
+
}
|
|
79
|
+
var BINARY = {
|
|
80
|
+
"=": 1,
|
|
81
|
+
"<>": 1,
|
|
82
|
+
"<": 1,
|
|
83
|
+
">": 1,
|
|
84
|
+
"<=": 1,
|
|
85
|
+
">=": 1,
|
|
86
|
+
"&": 2,
|
|
87
|
+
"+": 3,
|
|
88
|
+
"-": 3,
|
|
89
|
+
"*": 4,
|
|
90
|
+
"/": 4,
|
|
91
|
+
"^": 6
|
|
92
|
+
};
|
|
93
|
+
/** Parse a formula (without the leading `=`). Throws a FormulaError on bad syntax. */
|
|
94
|
+
function parse(src) {
|
|
95
|
+
const tokens = tokenize(src);
|
|
96
|
+
let i = 0;
|
|
97
|
+
const peek = () => tokens[i];
|
|
98
|
+
const next = () => tokens[i++];
|
|
99
|
+
const expect = (t) => {
|
|
100
|
+
const tok = next();
|
|
101
|
+
if (!tok || tok.t !== t) throw new FormulaError("#ERROR!");
|
|
102
|
+
};
|
|
103
|
+
function primary() {
|
|
104
|
+
const tok = next();
|
|
105
|
+
if (!tok) throw new FormulaError("#ERROR!");
|
|
106
|
+
switch (tok.t) {
|
|
107
|
+
case "num": return {
|
|
108
|
+
k: "num",
|
|
109
|
+
v: tok.v
|
|
110
|
+
};
|
|
111
|
+
case "str": return {
|
|
112
|
+
k: "str",
|
|
113
|
+
v: tok.v
|
|
114
|
+
};
|
|
115
|
+
case "bool": return {
|
|
116
|
+
k: "bool",
|
|
117
|
+
v: tok.v
|
|
118
|
+
};
|
|
119
|
+
case "ref":
|
|
120
|
+
if (peek()?.t === ":") {
|
|
121
|
+
next();
|
|
122
|
+
const to = next();
|
|
123
|
+
if (!to || to.t !== "ref") throw new FormulaError("#ERROR!");
|
|
124
|
+
return {
|
|
125
|
+
k: "range",
|
|
126
|
+
from: tok.v,
|
|
127
|
+
to: to.v
|
|
128
|
+
};
|
|
129
|
+
}
|
|
130
|
+
return {
|
|
131
|
+
k: "ref",
|
|
132
|
+
ref: tok.v
|
|
133
|
+
};
|
|
134
|
+
case "name": {
|
|
135
|
+
expect("(");
|
|
136
|
+
const args = [];
|
|
137
|
+
if (peek()?.t !== ")") {
|
|
138
|
+
args.push(expression(0));
|
|
139
|
+
while (peek()?.t === ",") {
|
|
140
|
+
next();
|
|
141
|
+
args.push(expression(0));
|
|
142
|
+
}
|
|
143
|
+
}
|
|
144
|
+
expect(")");
|
|
145
|
+
return {
|
|
146
|
+
k: "call",
|
|
147
|
+
name: tok.v,
|
|
148
|
+
args
|
|
149
|
+
};
|
|
150
|
+
}
|
|
151
|
+
case "op":
|
|
152
|
+
if (tok.v === "-" || tok.v === "+") return {
|
|
153
|
+
k: "unary",
|
|
154
|
+
op: tok.v,
|
|
155
|
+
arg: expression(5)
|
|
156
|
+
};
|
|
157
|
+
throw new FormulaError("#ERROR!");
|
|
158
|
+
case "(": {
|
|
159
|
+
const e = expression(0);
|
|
160
|
+
expect(")");
|
|
161
|
+
return e;
|
|
162
|
+
}
|
|
163
|
+
default: throw new FormulaError("#ERROR!");
|
|
164
|
+
}
|
|
165
|
+
}
|
|
166
|
+
/** Precedence climbing; `^` is right-associative. */
|
|
167
|
+
function expression(min) {
|
|
168
|
+
let left = primary();
|
|
169
|
+
for (;;) {
|
|
170
|
+
const tok = peek();
|
|
171
|
+
if (!tok || tok.t !== "op" || BINARY[tok.v] === void 0 || BINARY[tok.v] < min) break;
|
|
172
|
+
next();
|
|
173
|
+
const prec = BINARY[tok.v];
|
|
174
|
+
const right = expression(tok.v === "^" ? prec : prec + 1);
|
|
175
|
+
left = {
|
|
176
|
+
k: "bin",
|
|
177
|
+
op: tok.v,
|
|
178
|
+
l: left,
|
|
179
|
+
r: right
|
|
180
|
+
};
|
|
181
|
+
}
|
|
182
|
+
return left;
|
|
183
|
+
}
|
|
184
|
+
const tree = expression(0);
|
|
185
|
+
if (i !== tokens.length) throw new FormulaError("#ERROR!");
|
|
186
|
+
return tree;
|
|
187
|
+
}
|
|
188
|
+
/** Every cell a formula reads (ranges expanded). */
|
|
189
|
+
function references(node, limits) {
|
|
190
|
+
const out = [];
|
|
191
|
+
const walk = (n) => {
|
|
192
|
+
switch (n.k) {
|
|
193
|
+
case "ref":
|
|
194
|
+
out.push(n.ref.replace(/\$/g, ""));
|
|
195
|
+
break;
|
|
196
|
+
case "range":
|
|
197
|
+
out.push(...expandRange(n.from, n.to, limits));
|
|
198
|
+
break;
|
|
199
|
+
case "unary":
|
|
200
|
+
walk(n.arg);
|
|
201
|
+
break;
|
|
202
|
+
case "bin":
|
|
203
|
+
walk(n.l);
|
|
204
|
+
walk(n.r);
|
|
205
|
+
break;
|
|
206
|
+
case "call": n.args.forEach(walk);
|
|
207
|
+
}
|
|
208
|
+
};
|
|
209
|
+
walk(node);
|
|
210
|
+
return out;
|
|
211
|
+
}
|
|
212
|
+
function expandRange(from, to, limits) {
|
|
213
|
+
const a = parseAddress(from);
|
|
214
|
+
const b = parseAddress(to);
|
|
215
|
+
if (!a || !b) return [];
|
|
216
|
+
const cells = [];
|
|
217
|
+
const maxRow = Math.min(Math.max(a.row, b.row), (limits?.rows ?? Infinity) - 1);
|
|
218
|
+
const maxCol = Math.min(Math.max(a.col, b.col), (limits?.cols ?? Infinity) - 1);
|
|
219
|
+
for (let r = Math.min(a.row, b.row); r <= maxRow; r++) for (let c = Math.min(a.col, b.col); c <= maxCol; c++) cells.push(address(r, c));
|
|
220
|
+
return cells;
|
|
221
|
+
}
|
|
222
|
+
var isError = (v) => v instanceof FormulaError;
|
|
223
|
+
function toNumber(v) {
|
|
224
|
+
if (isError(v)) return v;
|
|
225
|
+
if (typeof v === "number") return v;
|
|
226
|
+
if (typeof v === "boolean") return v ? 1 : 0;
|
|
227
|
+
if (v === "") return 0;
|
|
228
|
+
const n = Number(v);
|
|
229
|
+
return Number.isFinite(n) ? n : new FormulaError("#VALUE!");
|
|
230
|
+
}
|
|
231
|
+
var toText = (v) => typeof v === "boolean" ? v ? "TRUE" : "FALSE" : String(v);
|
|
232
|
+
var FUNCTIONS = {
|
|
233
|
+
SUM: (args) => aggregate(args, (ns) => ns.reduce((a, b) => a + b, 0)),
|
|
234
|
+
AVERAGE: (args) => aggregate(args, (ns) => ns.length ? ns.reduce((a, b) => a + b, 0) / ns.length : new FormulaError("#DIV/0!")),
|
|
235
|
+
MIN: (args) => aggregate(args, (ns) => ns.length ? Math.min(...ns) : 0),
|
|
236
|
+
MAX: (args) => aggregate(args, (ns) => ns.length ? Math.max(...ns) : 0),
|
|
237
|
+
COUNT: (args) => args.flat().filter((v) => typeof v === "number").length,
|
|
238
|
+
ABS: ([v]) => {
|
|
239
|
+
const n = toNumber(single(v));
|
|
240
|
+
return isError(n) ? n : Math.abs(n);
|
|
241
|
+
},
|
|
242
|
+
ROUND: ([v, digits]) => {
|
|
243
|
+
const n = toNumber(single(v));
|
|
244
|
+
const d = digits === void 0 ? 0 : toNumber(single(digits));
|
|
245
|
+
if (isError(n)) return n;
|
|
246
|
+
if (isError(d)) return d;
|
|
247
|
+
const f = 10 ** Math.trunc(d);
|
|
248
|
+
return Math.round(n * f) / f;
|
|
249
|
+
},
|
|
250
|
+
IF: ([cond, a, b]) => {
|
|
251
|
+
const c = single(cond);
|
|
252
|
+
if (isError(c)) return c;
|
|
253
|
+
return single((typeof c === "string" ? c !== "" : Boolean(c)) ? a ?? true : b ?? false);
|
|
254
|
+
},
|
|
255
|
+
CONCAT: (args) => {
|
|
256
|
+
const flat = args.flat();
|
|
257
|
+
return flat.find(isError) ?? flat.map(toText).join("");
|
|
258
|
+
}
|
|
259
|
+
};
|
|
260
|
+
FUNCTIONS.AVG = FUNCTIONS.AVERAGE;
|
|
261
|
+
function single(v) {
|
|
262
|
+
if (v === void 0) return "";
|
|
263
|
+
return Array.isArray(v) ? new FormulaError("#VALUE!") : v;
|
|
264
|
+
}
|
|
265
|
+
/** Numbers from the arguments; text and blanks inside ranges are skipped, errors propagate. */
|
|
266
|
+
function aggregate(args, fn) {
|
|
267
|
+
const ns = [];
|
|
268
|
+
for (const arg of args) if (Array.isArray(arg)) for (const v of arg) {
|
|
269
|
+
if (isError(v)) return v;
|
|
270
|
+
if (typeof v === "number") ns.push(v);
|
|
271
|
+
}
|
|
272
|
+
else {
|
|
273
|
+
const n = toNumber(arg);
|
|
274
|
+
if (isError(n)) return n;
|
|
275
|
+
ns.push(n);
|
|
276
|
+
}
|
|
277
|
+
return fn(ns);
|
|
278
|
+
}
|
|
279
|
+
function evaluate(node, ctx) {
|
|
280
|
+
const ref = (r) => {
|
|
281
|
+
const pos = parseAddress(r);
|
|
282
|
+
if (!pos || pos.row >= ctx.rows || pos.col >= ctx.cols) return new FormulaError("#REF!");
|
|
283
|
+
return ctx.get(r.replace(/\$/g, ""));
|
|
284
|
+
};
|
|
285
|
+
const arg = (n) => {
|
|
286
|
+
if (n.k !== "range") return evaluate(n, ctx);
|
|
287
|
+
for (const end of [n.from, n.to]) {
|
|
288
|
+
const pos = parseAddress(end);
|
|
289
|
+
if (!pos || pos.row >= ctx.rows || pos.col >= ctx.cols) return new FormulaError("#REF!");
|
|
290
|
+
}
|
|
291
|
+
return expandRange(n.from, n.to).map(ref);
|
|
292
|
+
};
|
|
293
|
+
switch (node.k) {
|
|
294
|
+
case "num": return node.v;
|
|
295
|
+
case "str": return node.v;
|
|
296
|
+
case "bool": return node.v;
|
|
297
|
+
case "ref": return ref(node.ref);
|
|
298
|
+
case "range": return new FormulaError("#VALUE!");
|
|
299
|
+
case "unary": {
|
|
300
|
+
const n = toNumber(evaluate(node.arg, ctx));
|
|
301
|
+
return isError(n) ? n : node.op === "-" ? -n : n;
|
|
302
|
+
}
|
|
303
|
+
case "call": {
|
|
304
|
+
const fn = FUNCTIONS[node.name];
|
|
305
|
+
if (!fn) return new FormulaError("#NAME?");
|
|
306
|
+
return fn(node.args.map(arg));
|
|
307
|
+
}
|
|
308
|
+
case "bin": {
|
|
309
|
+
const l = evaluate(node.l, ctx);
|
|
310
|
+
const r = evaluate(node.r, ctx);
|
|
311
|
+
if (isError(l)) return l;
|
|
312
|
+
if (isError(r)) return r;
|
|
313
|
+
if (node.op === "&") return toText(l) + toText(r);
|
|
314
|
+
if ([
|
|
315
|
+
"=",
|
|
316
|
+
"<>",
|
|
317
|
+
"<",
|
|
318
|
+
">",
|
|
319
|
+
"<=",
|
|
320
|
+
">="
|
|
321
|
+
].includes(node.op)) {
|
|
322
|
+
const both = typeof l === "number" && typeof r === "number";
|
|
323
|
+
const a = both ? l : toText(l).toLowerCase();
|
|
324
|
+
const b = both ? r : toText(r).toLowerCase();
|
|
325
|
+
switch (node.op) {
|
|
326
|
+
case "=": return a === b;
|
|
327
|
+
case "<>": return a !== b;
|
|
328
|
+
case "<": return a < b;
|
|
329
|
+
case ">": return a > b;
|
|
330
|
+
case "<=": return a <= b;
|
|
331
|
+
default: return a >= b;
|
|
332
|
+
}
|
|
333
|
+
}
|
|
334
|
+
const a = toNumber(l);
|
|
335
|
+
const b = toNumber(r);
|
|
336
|
+
if (isError(a)) return a;
|
|
337
|
+
if (isError(b)) return b;
|
|
338
|
+
switch (node.op) {
|
|
339
|
+
case "+": return a + b;
|
|
340
|
+
case "-": return a - b;
|
|
341
|
+
case "*": return a * b;
|
|
342
|
+
case "/": return b === 0 ? new FormulaError("#DIV/0!") : a / b;
|
|
343
|
+
default: return a ** b;
|
|
344
|
+
}
|
|
345
|
+
}
|
|
346
|
+
}
|
|
347
|
+
}
|
|
348
|
+
/**
|
|
349
|
+
* Shift a formula's relative references by `dRow`/`dCol` (for fill and
|
|
350
|
+
* paste). `$`-anchored parts stay; references pushed off the sheet become `#REF!`.
|
|
351
|
+
*/
|
|
352
|
+
function shiftFormula(raw, dRow, dCol) {
|
|
353
|
+
if (!raw.startsWith("=")) return raw;
|
|
354
|
+
return raw.replace(/"(?:[^"]|"")*"|(\$?)([A-Z]{1,3})(\$?)(\d+)(?![A-Z(\d])/gi, (match, colAbs, col, rowAbs, row) => {
|
|
355
|
+
if (col === void 0) return match;
|
|
356
|
+
const c = colAbs ? colIndex(col) : colIndex(col) + dCol;
|
|
357
|
+
const r = rowAbs ? Number(row) - 1 : Number(row) - 1 + dRow;
|
|
358
|
+
if (c < 0 || r < 0) return "#REF!";
|
|
359
|
+
return `${colAbs}${colName(c)}${rowAbs}${r + 1}`;
|
|
360
|
+
});
|
|
361
|
+
}
|
|
362
|
+
export { FormulaError, address, colIndex, colName, evaluate, expandRange, parse, parseAddress, references, shiftFormula, tokenize };
|
|
363
|
+
|
|
364
|
+
//# sourceMappingURL=formula.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"formula.js","names":[],"sources":["../../../src/kit/sheet/formula.ts"],"sourcesContent":["/**\n * Spreadsheet formulas: addresses, a tokenizer and parser for `=` expressions,\n * and an evaluator.\n *\n * Supported: numbers, \"strings\", TRUE/FALSE; `+ - * / ^ &` and comparisons\n * (`= <> < > <= >=`); references (`A1`, `$A$1`) and ranges (`A1:B9`); and the\n * functions SUM, AVERAGE (AVG), MIN, MAX, COUNT, IF, ROUND, ABS, CONCAT.\n * Errors are values, as in other spreadsheets: `#REF!`, `#DIV/0!`,\n * `#VALUE!`, `#NAME?`, `#CYCLE!` and `#ERROR!` (unparseable).\n *\n * @module kit/sheet/formula\n */\n\nexport type ErrorCode = '#REF!' | '#DIV/0!' | '#VALUE!' | '#NAME?' | '#CYCLE!' | '#ERROR!';\n\nexport class FormulaError {\n constructor(readonly code: ErrorCode) {}\n toString(): string {\n return this.code;\n }\n}\n\nexport type CellValue = number | string | boolean | FormulaError;\n\n// ── Addresses ──────────────────────────────────────────────────────────────\n\n/** 0-based column index of a column name: A → 0, Z → 25, AA → 26. */\nexport function colIndex(name: string): number {\n let n = 0;\n for (const ch of name.toUpperCase()) n = n * 26 + (ch.charCodeAt(0) - 64);\n return n - 1;\n}\n\n/** Column name of a 0-based index. */\nexport function colName(index: number): string {\n let n = index + 1;\n let s = '';\n while (n > 0) {\n const r = (n - 1) % 26;\n s = String.fromCharCode(65 + r) + s;\n n = Math.floor((n - 1) / 26);\n }\n return s;\n}\n\nexport const address = (row: number, col: number): string => `${colName(col)}${row + 1}`;\n\n/** Parse \"B7\" into 0-based `{ row, col }`, or null. */\nexport function parseAddress(addr: string): { row: number; col: number } | null {\n const m = /^\\$?([A-Z]{1,3})\\$?(\\d+)$/i.exec(addr);\n if (!m || Number(m[2]) < 1) return null;\n return { row: Number(m[2]) - 1, col: colIndex(m[1]) };\n}\n\n// ── Tokens ─────────────────────────────────────────────────────────────────\n\ntype Token =\n | { t: 'num'; v: number }\n | { t: 'str'; v: string }\n | { t: 'bool'; v: boolean }\n | { t: 'ref'; v: string }\n | { t: 'name'; v: string }\n | { t: 'op'; v: string }\n | { t: '(' | ')' | ',' | ':' };\n\nconst TOKEN = /\\s*(?:(\\d+\\.?\\d*(?:e[+-]?\\d+)?|\\.\\d+)|\"((?:[^\"]|\"\")*)\"|(\\$?[A-Z]{1,3}\\$?\\d+)(?![A-Z(\\d])|([A-Z_][A-Z0-9_.]*)|(<=|>=|<>|[-+*/^&=<>])|([(),:]))/iy;\n\nexport function tokenize(src: string): Token[] {\n const tokens: Token[] = [];\n TOKEN.lastIndex = 0;\n let pos = 0;\n while (pos < src.length) {\n if (/^\\s*$/.test(src.slice(pos))) break;\n TOKEN.lastIndex = pos;\n const m = TOKEN.exec(src);\n if (!m) throw new FormulaError('#ERROR!');\n pos = TOKEN.lastIndex;\n if (m[1] !== undefined) tokens.push({ t: 'num', v: Number(m[1]) });\n else if (m[2] !== undefined) tokens.push({ t: 'str', v: m[2].replace(/\"\"/g, '\"') });\n else if (m[3] !== undefined) tokens.push({ t: 'ref', v: m[3].toUpperCase() });\n else if (m[4] !== undefined) {\n const name = m[4].toUpperCase();\n if (name === 'TRUE' || name === 'FALSE') tokens.push({ t: 'bool', v: name === 'TRUE' });\n else tokens.push({ t: 'name', v: name });\n } else if (m[5] !== undefined) tokens.push({ t: 'op', v: m[5] });\n else tokens.push({ t: m[6] as '(' | ')' | ',' | ':' });\n }\n return tokens;\n}\n\n// ── Parser ─────────────────────────────────────────────────────────────────\n\nexport type Node =\n | { k: 'num'; v: number }\n | { k: 'str'; v: string }\n | { k: 'bool'; v: boolean }\n | { k: 'ref'; ref: string }\n | { k: 'range'; from: string; to: string }\n | { k: 'unary'; op: string; arg: Node }\n | { k: 'bin'; op: string; l: Node; r: Node }\n | { k: 'call'; name: string; args: Node[] };\n\nconst BINARY: Record<string, number> = { '=': 1, '<>': 1, '<': 1, '>': 1, '<=': 1, '>=': 1, '&': 2, '+': 3, '-': 3, '*': 4, '/': 4, '^': 6 };\n\n/** Parse a formula (without the leading `=`). Throws a FormulaError on bad syntax. */\nexport function parse(src: string): Node {\n const tokens = tokenize(src);\n let i = 0;\n const peek = () => tokens[i];\n const next = () => tokens[i++];\n const expect = (t: string) => {\n const tok = next();\n if (!tok || tok.t !== t) throw new FormulaError('#ERROR!');\n };\n\n function primary(): Node {\n const tok = next();\n if (!tok) throw new FormulaError('#ERROR!');\n switch (tok.t) {\n case 'num': return { k: 'num', v: tok.v };\n case 'str': return { k: 'str', v: tok.v };\n case 'bool': return { k: 'bool', v: tok.v };\n case 'ref': {\n if (peek()?.t === ':') {\n next();\n const to = next();\n if (!to || to.t !== 'ref') throw new FormulaError('#ERROR!');\n return { k: 'range', from: tok.v, to: to.v };\n }\n return { k: 'ref', ref: tok.v };\n }\n case 'name': {\n expect('(');\n const args: Node[] = [];\n if (peek()?.t !== ')') {\n args.push(expression(0));\n while (peek()?.t === ',') {\n next();\n args.push(expression(0));\n }\n }\n expect(')');\n return { k: 'call', name: tok.v, args };\n }\n case 'op':\n if (tok.v === '-' || tok.v === '+') return { k: 'unary', op: tok.v, arg: expression(5) };\n throw new FormulaError('#ERROR!');\n case '(': {\n const e = expression(0);\n expect(')');\n return e;\n }\n default:\n throw new FormulaError('#ERROR!');\n }\n }\n\n /** Precedence climbing; `^` is right-associative. */\n function expression(min: number): Node {\n let left = primary();\n for (;;) {\n const tok = peek();\n if (!tok || tok.t !== 'op' || BINARY[tok.v] === undefined || BINARY[tok.v] < min) break;\n next();\n const prec = BINARY[tok.v];\n const right = expression(tok.v === '^' ? prec : prec + 1);\n left = { k: 'bin', op: tok.v, l: left, r: right };\n }\n return left;\n }\n\n const tree = expression(0);\n if (i !== tokens.length) throw new FormulaError('#ERROR!');\n return tree;\n}\n\n/** Every cell a formula reads (ranges expanded). */\nexport function references(node: Node, limits?: { rows: number; cols: number }): string[] {\n const out: string[] = [];\n const walk = (n: Node): void => {\n switch (n.k) {\n case 'ref': out.push(n.ref.replace(/\\$/g, '')); break;\n case 'range': out.push(...expandRange(n.from, n.to, limits)); break;\n case 'unary': walk(n.arg); break;\n case 'bin': walk(n.l); walk(n.r); break;\n case 'call': n.args.forEach(walk); break;\n }\n };\n walk(node);\n return out;\n}\n\nexport function expandRange(from: string, to: string, limits?: { rows: number; cols: number }): string[] {\n const a = parseAddress(from);\n const b = parseAddress(to);\n if (!a || !b) return [];\n const cells: string[] = [];\n const maxRow = Math.min(Math.max(a.row, b.row), (limits?.rows ?? Infinity) - 1);\n const maxCol = Math.min(Math.max(a.col, b.col), (limits?.cols ?? Infinity) - 1);\n for (let r = Math.min(a.row, b.row); r <= maxRow; r++) {\n for (let c = Math.min(a.col, b.col); c <= maxCol; c++) cells.push(address(r, c));\n }\n return cells;\n}\n\n// ── Evaluation ─────────────────────────────────────────────────────────────\n\nconst isError = (v: unknown): v is FormulaError => v instanceof FormulaError;\n\nfunction toNumber(v: CellValue): number | FormulaError {\n if (isError(v)) return v;\n if (typeof v === 'number') return v;\n if (typeof v === 'boolean') return v ? 1 : 0;\n if (v === '') return 0;\n const n = Number(v);\n return Number.isFinite(n) ? n : new FormulaError('#VALUE!');\n}\n\nconst toText = (v: CellValue): string => (typeof v === 'boolean' ? (v ? 'TRUE' : 'FALSE') : String(v));\n\nexport interface EvalContext {\n /** The value of a cell (already computed). */\n get(ref: string): CellValue;\n rows: number;\n cols: number;\n}\n\ntype Arg = CellValue | CellValue[];\n\nconst FUNCTIONS: Record<string, (args: Arg[]) => CellValue> = {\n SUM: args => aggregate(args, ns => ns.reduce((a, b) => a + b, 0)),\n AVERAGE: args => aggregate(args, ns => (ns.length ? ns.reduce((a, b) => a + b, 0) / ns.length : new FormulaError('#DIV/0!'))),\n MIN: args => aggregate(args, ns => (ns.length ? Math.min(...ns) : 0)),\n MAX: args => aggregate(args, ns => (ns.length ? Math.max(...ns) : 0)),\n COUNT: args => args.flat().filter(v => typeof v === 'number').length,\n ABS: ([v]) => {\n const n = toNumber(single(v));\n return isError(n) ? n : Math.abs(n);\n },\n ROUND: ([v, digits]) => {\n const n = toNumber(single(v));\n const d = digits === undefined ? 0 : toNumber(single(digits));\n if (isError(n)) return n;\n if (isError(d)) return d;\n const f = 10 ** Math.trunc(d);\n return Math.round(n * f) / f;\n },\n IF: ([cond, a, b]) => {\n const c = single(cond);\n if (isError(c)) return c;\n const truthy = typeof c === 'string' ? c !== '' : Boolean(c);\n return single(truthy ? (a ?? true) : (b ?? false));\n },\n CONCAT: args => {\n const flat = args.flat();\n const err = flat.find(isError);\n return err ?? flat.map(toText).join('');\n },\n};\nFUNCTIONS.AVG = FUNCTIONS.AVERAGE;\n\nfunction single(v: Arg | undefined): CellValue {\n if (v === undefined) return '';\n return Array.isArray(v) ? new FormulaError('#VALUE!') : v;\n}\n\n/** Numbers from the arguments; text and blanks inside ranges are skipped, errors propagate. */\nfunction aggregate(args: Arg[], fn: (ns: number[]) => number | FormulaError): CellValue {\n const ns: number[] = [];\n for (const arg of args) {\n if (Array.isArray(arg)) {\n for (const v of arg) {\n if (isError(v)) return v;\n if (typeof v === 'number') ns.push(v);\n }\n } else {\n const n = toNumber(arg);\n if (isError(n)) return n;\n ns.push(n);\n }\n }\n return fn(ns);\n}\n\nexport function evaluate(node: Node, ctx: EvalContext): CellValue {\n const ref = (r: string): CellValue => {\n const pos = parseAddress(r);\n if (!pos || pos.row >= ctx.rows || pos.col >= ctx.cols) return new FormulaError('#REF!');\n return ctx.get(r.replace(/\\$/g, ''));\n };\n const arg = (n: Node): Arg => {\n if (n.k !== 'range') return evaluate(n, ctx);\n for (const end of [n.from, n.to]) {\n const pos = parseAddress(end);\n if (!pos || pos.row >= ctx.rows || pos.col >= ctx.cols) return new FormulaError('#REF!');\n }\n return expandRange(n.from, n.to).map(ref);\n };\n switch (node.k) {\n case 'num': return node.v;\n case 'str': return node.v;\n case 'bool': return node.v;\n case 'ref': return ref(node.ref);\n case 'range': return new FormulaError('#VALUE!');\n case 'unary': {\n const n = toNumber(evaluate(node.arg, ctx));\n return isError(n) ? n : node.op === '-' ? -n : n;\n }\n case 'call': {\n const fn = FUNCTIONS[node.name];\n if (!fn) return new FormulaError('#NAME?');\n return fn(node.args.map(arg));\n }\n case 'bin': {\n const l = evaluate(node.l, ctx);\n const r = evaluate(node.r, ctx);\n if (isError(l)) return l;\n if (isError(r)) return r;\n if (node.op === '&') return toText(l) + toText(r);\n if (['=', '<>', '<', '>', '<=', '>='].includes(node.op)) {\n const both = typeof l === 'number' && typeof r === 'number';\n const a = both ? l : toText(l).toLowerCase();\n const b = both ? r : toText(r).toLowerCase();\n switch (node.op) {\n case '=': return a === b;\n case '<>': return a !== b;\n case '<': return a < b;\n case '>': return a > b;\n case '<=': return a <= b;\n default: return a >= b;\n }\n }\n const a = toNumber(l);\n const b = toNumber(r);\n if (isError(a)) return a;\n if (isError(b)) return b;\n switch (node.op) {\n case '+': return a + b;\n case '-': return a - b;\n case '*': return a * b;\n case '/': return b === 0 ? new FormulaError('#DIV/0!') : a / b;\n default: return a ** b;\n }\n }\n }\n}\n\n/**\n * Shift a formula's relative references by `dRow`/`dCol` (for fill and\n * paste). `$`-anchored parts stay; references pushed off the sheet become `#REF!`.\n */\nexport function shiftFormula(raw: string, dRow: number, dCol: number): string {\n if (!raw.startsWith('=')) return raw;\n // Leave string literals alone.\n return raw.replace(/\"(?:[^\"]|\"\")*\"|(\\$?)([A-Z]{1,3})(\\$?)(\\d+)(?![A-Z(\\d])/gi, (match, colAbs: string, col: string, rowAbs: string, row: string) => {\n if (col === undefined) return match;\n const c = colAbs ? colIndex(col) : colIndex(col) + dCol;\n const r = rowAbs ? Number(row) - 1 : Number(row) - 1 + dRow;\n if (c < 0 || r < 0) return '#REF!';\n return `${colAbs}${colName(c)}${rowAbs}${r + 1}`;\n });\n}\n"],"mappings":";AAeA,IAAa,eAAb,MAA0B;CACH;CAArB,YAAY,MAA0B;EAAjB,KAAA,OAAA;CAAkB;CACvC,WAAmB;EACjB,OAAO,KAAK;CACd;AACF;;AAOA,SAAgB,SAAS,MAAsB;CAC7C,IAAI,IAAI;CACR,KAAK,MAAM,MAAM,KAAK,YAAY,GAAG,IAAI,IAAI,MAAM,GAAG,WAAW,CAAC,IAAI;CACtE,OAAO,IAAI;AACb;;AAGA,SAAgB,QAAQ,OAAuB;CAC7C,IAAI,IAAI,QAAQ;CAChB,IAAI,IAAI;CACR,OAAO,IAAI,GAAG;EACZ,MAAM,KAAK,IAAI,KAAK;EACpB,IAAI,OAAO,aAAa,KAAK,CAAC,IAAI;EAClC,IAAI,KAAK,OAAO,IAAI,KAAK,EAAE;CAC7B;CACA,OAAO;AACT;AAEA,IAAa,WAAW,KAAa,QAAwB,GAAG,QAAQ,GAAG,IAAI,MAAM;;AAGrF,SAAgB,aAAa,MAAmD;CAC9E,MAAM,IAAI,6BAA6B,KAAK,IAAI;CAChD,IAAI,CAAC,KAAK,OAAO,EAAE,EAAE,IAAI,GAAG,OAAO;CACnC,OAAO;EAAE,KAAK,OAAO,EAAE,EAAE,IAAI;EAAG,KAAK,SAAS,EAAE,EAAE;CAAE;AACtD;AAaA,IAAM,QAAQ;AAEd,SAAgB,SAAS,KAAsB;CAC7C,MAAM,SAAkB,CAAC;CACzB,MAAM,YAAY;CAClB,IAAI,MAAM;CACV,OAAO,MAAM,IAAI,QAAQ;EACvB,IAAI,QAAQ,KAAK,IAAI,MAAM,GAAG,CAAC,GAAG;EAClC,MAAM,YAAY;EAClB,MAAM,IAAI,MAAM,KAAK,GAAG;EACxB,IAAI,CAAC,GAAG,MAAM,IAAI,aAAa,SAAS;EACxC,MAAM,MAAM;EACZ,IAAI,EAAE,OAAO,KAAA,GAAW,OAAO,KAAK;GAAE,GAAG;GAAO,GAAG,OAAO,EAAE,EAAE;EAAE,CAAC;OAC5D,IAAI,EAAE,OAAO,KAAA,GAAW,OAAO,KAAK;GAAE,GAAG;GAAO,GAAG,EAAE,EAAE,CAAC,QAAQ,OAAO,IAAG;EAAE,CAAC;OAC7E,IAAI,EAAE,OAAO,KAAA,GAAW,OAAO,KAAK;GAAE,GAAG;GAAO,GAAG,EAAE,EAAE,CAAC,YAAY;EAAE,CAAC;OACvE,IAAI,EAAE,OAAO,KAAA,GAAW;GAC3B,MAAM,OAAO,EAAE,EAAE,CAAC,YAAY;GAC9B,IAAI,SAAS,UAAU,SAAS,SAAS,OAAO,KAAK;IAAE,GAAG;IAAQ,GAAG,SAAS;GAAO,CAAC;QACjF,OAAO,KAAK;IAAE,GAAG;IAAQ,GAAG;GAAK,CAAC;EACzC,OAAO,IAAI,EAAE,OAAO,KAAA,GAAW,OAAO,KAAK;GAAE,GAAG;GAAM,GAAG,EAAE;EAAG,CAAC;OAC1D,OAAO,KAAK,EAAE,GAAG,EAAE,GAA4B,CAAC;CACvD;CACA,OAAO;AACT;AAcA,IAAM,SAAiC;CAAE,KAAK;CAAG,MAAM;CAAG,KAAK;CAAG,KAAK;CAAG,MAAM;CAAG,MAAM;CAAG,KAAK;CAAG,KAAK;CAAG,KAAK;CAAG,KAAK;CAAG,KAAK;CAAG,KAAK;AAAE;;AAG3I,SAAgB,MAAM,KAAmB;CACvC,MAAM,SAAS,SAAS,GAAG;CAC3B,IAAI,IAAI;CACR,MAAM,aAAa,OAAO;CAC1B,MAAM,aAAa,OAAO;CAC1B,MAAM,UAAU,MAAc;EAC5B,MAAM,MAAM,KAAK;EACjB,IAAI,CAAC,OAAO,IAAI,MAAM,GAAG,MAAM,IAAI,aAAa,SAAS;CAC3D;CAEA,SAAS,UAAgB;EACvB,MAAM,MAAM,KAAK;EACjB,IAAI,CAAC,KAAK,MAAM,IAAI,aAAa,SAAS;EAC1C,QAAQ,IAAI,GAAZ;GACE,KAAK,OAAO,OAAO;IAAE,GAAG;IAAO,GAAG,IAAI;GAAE;GACxC,KAAK,OAAO,OAAO;IAAE,GAAG;IAAO,GAAG,IAAI;GAAE;GACxC,KAAK,QAAQ,OAAO;IAAE,GAAG;IAAQ,GAAG,IAAI;GAAE;GAC1C,KAAK;IACH,IAAI,KAAK,CAAC,EAAE,MAAM,KAAK;KACrB,KAAK;KACL,MAAM,KAAK,KAAK;KAChB,IAAI,CAAC,MAAM,GAAG,MAAM,OAAO,MAAM,IAAI,aAAa,SAAS;KAC3D,OAAO;MAAE,GAAG;MAAS,MAAM,IAAI;MAAG,IAAI,GAAG;KAAE;IAC7C;IACA,OAAO;KAAE,GAAG;KAAO,KAAK,IAAI;IAAE;GAEhC,KAAK,QAAQ;IACX,OAAO,GAAG;IACV,MAAM,OAAe,CAAC;IACtB,IAAI,KAAK,CAAC,EAAE,MAAM,KAAK;KACrB,KAAK,KAAK,WAAW,CAAC,CAAC;KACvB,OAAO,KAAK,CAAC,EAAE,MAAM,KAAK;MACxB,KAAK;MACL,KAAK,KAAK,WAAW,CAAC,CAAC;KACzB;IACF;IACA,OAAO,GAAG;IACV,OAAO;KAAE,GAAG;KAAQ,MAAM,IAAI;KAAG;IAAK;GACxC;GACA,KAAK;IACH,IAAI,IAAI,MAAM,OAAO,IAAI,MAAM,KAAK,OAAO;KAAE,GAAG;KAAS,IAAI,IAAI;KAAG,KAAK,WAAW,CAAC;IAAE;IACvF,MAAM,IAAI,aAAa,SAAS;GAClC,KAAK,KAAK;IACR,MAAM,IAAI,WAAW,CAAC;IACtB,OAAO,GAAG;IACV,OAAO;GACT;GACA,SACE,MAAM,IAAI,aAAa,SAAS;EACpC;CACF;;CAGA,SAAS,WAAW,KAAmB;EACrC,IAAI,OAAO,QAAQ;EACnB,SAAS;GACP,MAAM,MAAM,KAAK;GACjB,IAAI,CAAC,OAAO,IAAI,MAAM,QAAQ,OAAO,IAAI,OAAO,KAAA,KAAa,OAAO,IAAI,KAAK,KAAK;GAClF,KAAK;GACL,MAAM,OAAO,OAAO,IAAI;GACxB,MAAM,QAAQ,WAAW,IAAI,MAAM,MAAM,OAAO,OAAO,CAAC;GACxD,OAAO;IAAE,GAAG;IAAO,IAAI,IAAI;IAAG,GAAG;IAAM,GAAG;GAAM;EAClD;EACA,OAAO;CACT;CAEA,MAAM,OAAO,WAAW,CAAC;CACzB,IAAI,MAAM,OAAO,QAAQ,MAAM,IAAI,aAAa,SAAS;CACzD,OAAO;AACT;;AAGA,SAAgB,WAAW,MAAY,QAAmD;CACxF,MAAM,MAAgB,CAAC;CACvB,MAAM,QAAQ,MAAkB;EAC9B,QAAQ,EAAE,GAAV;GACE,KAAK;IAAO,IAAI,KAAK,EAAE,IAAI,QAAQ,OAAO,EAAE,CAAC;IAAG;GAChD,KAAK;IAAS,IAAI,KAAK,GAAG,YAAY,EAAE,MAAM,EAAE,IAAI,MAAM,CAAC;IAAG;GAC9D,KAAK;IAAS,KAAK,EAAE,GAAG;IAAG;GAC3B,KAAK;IAAO,KAAK,EAAE,CAAC;IAAG,KAAK,EAAE,CAAC;IAAG;GAClC,KAAK,QAAQ,EAAE,KAAK,QAAQ,IAAI;EAClC;CACF;CACA,KAAK,IAAI;CACT,OAAO;AACT;AAEA,SAAgB,YAAY,MAAc,IAAY,QAAmD;CACvG,MAAM,IAAI,aAAa,IAAI;CAC3B,MAAM,IAAI,aAAa,EAAE;CACzB,IAAI,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC;CACtB,MAAM,QAAkB,CAAC;CACzB,MAAM,SAAS,KAAK,IAAI,KAAK,IAAI,EAAE,KAAK,EAAE,GAAG,IAAI,QAAQ,QAAQ,YAAY,CAAC;CAC9E,MAAM,SAAS,KAAK,IAAI,KAAK,IAAI,EAAE,KAAK,EAAE,GAAG,IAAI,QAAQ,QAAQ,YAAY,CAAC;CAC9E,KAAK,IAAI,IAAI,KAAK,IAAI,EAAE,KAAK,EAAE,GAAG,GAAG,KAAK,QAAQ,KAChD,KAAK,IAAI,IAAI,KAAK,IAAI,EAAE,KAAK,EAAE,GAAG,GAAG,KAAK,QAAQ,KAAK,MAAM,KAAK,QAAQ,GAAG,CAAC,CAAC;CAEjF,OAAO;AACT;AAIA,IAAM,WAAW,MAAkC,aAAa;AAEhE,SAAS,SAAS,GAAqC;CACrD,IAAI,QAAQ,CAAC,GAAG,OAAO;CACvB,IAAI,OAAO,MAAM,UAAU,OAAO;CAClC,IAAI,OAAO,MAAM,WAAW,OAAO,IAAI,IAAI;CAC3C,IAAI,MAAM,IAAI,OAAO;CACrB,MAAM,IAAI,OAAO,CAAC;CAClB,OAAO,OAAO,SAAS,CAAC,IAAI,IAAI,IAAI,aAAa,SAAS;AAC5D;AAEA,IAAM,UAAU,MAA0B,OAAO,MAAM,YAAa,IAAI,SAAS,UAAW,OAAO,CAAC;AAWpG,IAAM,YAAwD;CAC5D,MAAK,SAAQ,UAAU,OAAM,OAAM,GAAG,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,CAAC;CAChE,UAAS,SAAQ,UAAU,OAAM,OAAO,GAAG,SAAS,GAAG,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,GAAG,SAAS,IAAI,aAAa,SAAS,CAAE;CAC5H,MAAK,SAAQ,UAAU,OAAM,OAAO,GAAG,SAAS,KAAK,IAAI,GAAG,EAAE,IAAI,CAAE;CACpE,MAAK,SAAQ,UAAU,OAAM,OAAO,GAAG,SAAS,KAAK,IAAI,GAAG,EAAE,IAAI,CAAE;CACpE,QAAO,SAAQ,KAAK,KAAK,CAAC,CAAC,QAAO,MAAK,OAAO,MAAM,QAAQ,CAAC,CAAC;CAC9D,MAAM,CAAC,OAAO;EACZ,MAAM,IAAI,SAAS,OAAO,CAAC,CAAC;EAC5B,OAAO,QAAQ,CAAC,IAAI,IAAI,KAAK,IAAI,CAAC;CACpC;CACA,QAAQ,CAAC,GAAG,YAAY;EACtB,MAAM,IAAI,SAAS,OAAO,CAAC,CAAC;EAC5B,MAAM,IAAI,WAAW,KAAA,IAAY,IAAI,SAAS,OAAO,MAAM,CAAC;EAC5D,IAAI,QAAQ,CAAC,GAAG,OAAO;EACvB,IAAI,QAAQ,CAAC,GAAG,OAAO;EACvB,MAAM,IAAI,MAAM,KAAK,MAAM,CAAC;EAC5B,OAAO,KAAK,MAAM,IAAI,CAAC,IAAI;CAC7B;CACA,KAAK,CAAC,MAAM,GAAG,OAAO;EACpB,MAAM,IAAI,OAAO,IAAI;EACrB,IAAI,QAAQ,CAAC,GAAG,OAAO;EAEvB,OAAO,QADQ,OAAO,MAAM,WAAW,MAAM,KAAK,QAAQ,CAAC,KACnC,KAAK,OAAS,KAAK,KAAM;CACnD;CACA,SAAQ,SAAQ;EACd,MAAM,OAAO,KAAK,KAAK;EAEvB,OADY,KAAK,KAAK,OACf,KAAO,KAAK,IAAI,MAAM,CAAC,CAAC,KAAK,EAAE;CACxC;AACF;AACA,UAAU,MAAM,UAAU;AAE1B,SAAS,OAAO,GAA+B;CAC7C,IAAI,MAAM,KAAA,GAAW,OAAO;CAC5B,OAAO,MAAM,QAAQ,CAAC,IAAI,IAAI,aAAa,SAAS,IAAI;AAC1D;;AAGA,SAAS,UAAU,MAAa,IAAwD;CACtF,MAAM,KAAe,CAAC;CACtB,KAAK,MAAM,OAAO,MAChB,IAAI,MAAM,QAAQ,GAAG,GACnB,KAAK,MAAM,KAAK,KAAK;EACnB,IAAI,QAAQ,CAAC,GAAG,OAAO;EACvB,IAAI,OAAO,MAAM,UAAU,GAAG,KAAK,CAAC;CACtC;MACK;EACL,MAAM,IAAI,SAAS,GAAG;EACtB,IAAI,QAAQ,CAAC,GAAG,OAAO;EACvB,GAAG,KAAK,CAAC;CACX;CAEF,OAAO,GAAG,EAAE;AACd;AAEA,SAAgB,SAAS,MAAY,KAA6B;CAChE,MAAM,OAAO,MAAyB;EACpC,MAAM,MAAM,aAAa,CAAC;EAC1B,IAAI,CAAC,OAAO,IAAI,OAAO,IAAI,QAAQ,IAAI,OAAO,IAAI,MAAM,OAAO,IAAI,aAAa,OAAO;EACvF,OAAO,IAAI,IAAI,EAAE,QAAQ,OAAO,EAAE,CAAC;CACrC;CACA,MAAM,OAAO,MAAiB;EAC5B,IAAI,EAAE,MAAM,SAAS,OAAO,SAAS,GAAG,GAAG;EAC3C,KAAK,MAAM,OAAO,CAAC,EAAE,MAAM,EAAE,EAAE,GAAG;GAChC,MAAM,MAAM,aAAa,GAAG;GAC5B,IAAI,CAAC,OAAO,IAAI,OAAO,IAAI,QAAQ,IAAI,OAAO,IAAI,MAAM,OAAO,IAAI,aAAa,OAAO;EACzF;EACA,OAAO,YAAY,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC,IAAI,GAAG;CAC1C;CACA,QAAQ,KAAK,GAAb;EACE,KAAK,OAAO,OAAO,KAAK;EACxB,KAAK,OAAO,OAAO,KAAK;EACxB,KAAK,QAAQ,OAAO,KAAK;EACzB,KAAK,OAAO,OAAO,IAAI,KAAK,GAAG;EAC/B,KAAK,SAAS,OAAO,IAAI,aAAa,SAAS;EAC/C,KAAK,SAAS;GACZ,MAAM,IAAI,SAAS,SAAS,KAAK,KAAK,GAAG,CAAC;GAC1C,OAAO,QAAQ,CAAC,IAAI,IAAI,KAAK,OAAO,MAAM,CAAC,IAAI;EACjD;EACA,KAAK,QAAQ;GACX,MAAM,KAAK,UAAU,KAAK;GAC1B,IAAI,CAAC,IAAI,OAAO,IAAI,aAAa,QAAQ;GACzC,OAAO,GAAG,KAAK,KAAK,IAAI,GAAG,CAAC;EAC9B;EACA,KAAK,OAAO;GACV,MAAM,IAAI,SAAS,KAAK,GAAG,GAAG;GAC9B,MAAM,IAAI,SAAS,KAAK,GAAG,GAAG;GAC9B,IAAI,QAAQ,CAAC,GAAG,OAAO;GACvB,IAAI,QAAQ,CAAC,GAAG,OAAO;GACvB,IAAI,KAAK,OAAO,KAAK,OAAO,OAAO,CAAC,IAAI,OAAO,CAAC;GAChD,IAAI;IAAC;IAAK;IAAM;IAAK;IAAK;IAAM;GAAI,CAAC,CAAC,SAAS,KAAK,EAAE,GAAG;IACvD,MAAM,OAAO,OAAO,MAAM,YAAY,OAAO,MAAM;IACnD,MAAM,IAAI,OAAO,IAAI,OAAO,CAAC,CAAC,CAAC,YAAY;IAC3C,MAAM,IAAI,OAAO,IAAI,OAAO,CAAC,CAAC,CAAC,YAAY;IAC3C,QAAQ,KAAK,IAAb;KACE,KAAK,KAAK,OAAO,MAAM;KACvB,KAAK,MAAM,OAAO,MAAM;KACxB,KAAK,KAAK,OAAO,IAAI;KACrB,KAAK,KAAK,OAAO,IAAI;KACrB,KAAK,MAAM,OAAO,KAAK;KACvB,SAAS,OAAO,KAAK;IACvB;GACF;GACA,MAAM,IAAI,SAAS,CAAC;GACpB,MAAM,IAAI,SAAS,CAAC;GACpB,IAAI,QAAQ,CAAC,GAAG,OAAO;GACvB,IAAI,QAAQ,CAAC,GAAG,OAAO;GACvB,QAAQ,KAAK,IAAb;IACE,KAAK,KAAK,OAAO,IAAI;IACrB,KAAK,KAAK,OAAO,IAAI;IACrB,KAAK,KAAK,OAAO,IAAI;IACrB,KAAK,KAAK,OAAO,MAAM,IAAI,IAAI,aAAa,SAAS,IAAI,IAAI;IAC7D,SAAS,OAAO,KAAK;GACvB;EACF;CACF;AACF;;;;;AAMA,SAAgB,aAAa,KAAa,MAAc,MAAsB;CAC5E,IAAI,CAAC,IAAI,WAAW,GAAG,GAAG,OAAO;CAEjC,OAAO,IAAI,QAAQ,6DAA6D,OAAO,QAAgB,KAAa,QAAgB,QAAgB;EAClJ,IAAI,QAAQ,KAAA,GAAW,OAAO;EAC9B,MAAM,IAAI,SAAS,SAAS,GAAG,IAAI,SAAS,GAAG,IAAI;EACnD,MAAM,IAAI,SAAS,OAAO,GAAG,IAAI,IAAI,OAAO,GAAG,IAAI,IAAI;EACvD,IAAI,IAAI,KAAK,IAAI,GAAG,OAAO;EAC3B,OAAO,GAAG,SAAS,QAAQ,CAAC,IAAI,SAAS,IAAI;CAC/C,CAAC;AACH"}
|
|
@@ -0,0 +1,136 @@
|
|
|
1
|
+
import { FormulaError, evaluate, parse, references } from "./formula.js";
|
|
2
|
+
// src/kit/sheet/model.ts
|
|
3
|
+
/**
|
|
4
|
+
* SheetModel: cell contents, computed values, and the dependency graph
|
|
5
|
+
* between them.
|
|
6
|
+
*
|
|
7
|
+
* Setting cells recalculates only what depends on them, in topological
|
|
8
|
+
* order. Cells in a reference cycle (and everything that reads them) get
|
|
9
|
+
* `#CYCLE!` instead of looping.
|
|
10
|
+
*
|
|
11
|
+
* @module kit/sheet/model
|
|
12
|
+
*/
|
|
13
|
+
var SheetModel = class {
|
|
14
|
+
rows;
|
|
15
|
+
cols;
|
|
16
|
+
raw = /* @__PURE__ */ new Map();
|
|
17
|
+
values = /* @__PURE__ */ new Map();
|
|
18
|
+
asts = /* @__PURE__ */ new Map();
|
|
19
|
+
/** cell → the cells it reads */
|
|
20
|
+
deps = /* @__PURE__ */ new Map();
|
|
21
|
+
/** cell → the cells that read it */
|
|
22
|
+
readers = /* @__PURE__ */ new Map();
|
|
23
|
+
constructor(rows, cols) {
|
|
24
|
+
this.rows = rows;
|
|
25
|
+
this.cols = cols;
|
|
26
|
+
}
|
|
27
|
+
/** What was typed into a cell ('' if empty). */
|
|
28
|
+
getRaw(addr) {
|
|
29
|
+
return this.raw.get(addr) ?? "";
|
|
30
|
+
}
|
|
31
|
+
/** A cell's computed value ('' if empty). */
|
|
32
|
+
getValue(addr) {
|
|
33
|
+
return this.values.get(addr) ?? "";
|
|
34
|
+
}
|
|
35
|
+
/** Every non-empty cell's raw content. */
|
|
36
|
+
entries() {
|
|
37
|
+
return [...this.raw.entries()];
|
|
38
|
+
}
|
|
39
|
+
/** Set cells (raw content; '' clears). Returns every cell whose value changed. */
|
|
40
|
+
set(changes) {
|
|
41
|
+
const touched = /* @__PURE__ */ new Set();
|
|
42
|
+
for (const [addr, value] of Object.entries(changes)) {
|
|
43
|
+
if (value === "") this.raw.delete(addr);
|
|
44
|
+
else this.raw.set(addr, value);
|
|
45
|
+
this.asts.delete(addr);
|
|
46
|
+
this.link(addr);
|
|
47
|
+
touched.add(addr);
|
|
48
|
+
}
|
|
49
|
+
return this.recalculate(touched);
|
|
50
|
+
}
|
|
51
|
+
parsed(addr) {
|
|
52
|
+
const raw = this.getRaw(addr);
|
|
53
|
+
if (!raw.startsWith("=")) return null;
|
|
54
|
+
let ast = this.asts.get(addr);
|
|
55
|
+
if (!ast) {
|
|
56
|
+
try {
|
|
57
|
+
ast = raw.includes("#REF!") ? new FormulaError("#REF!") : parse(raw.slice(1));
|
|
58
|
+
} catch (e) {
|
|
59
|
+
ast = e instanceof FormulaError ? e : new FormulaError("#ERROR!");
|
|
60
|
+
}
|
|
61
|
+
this.asts.set(addr, ast);
|
|
62
|
+
}
|
|
63
|
+
return ast;
|
|
64
|
+
}
|
|
65
|
+
/** Update the graph edges for a cell. */
|
|
66
|
+
link(addr) {
|
|
67
|
+
for (const dep of this.deps.get(addr) ?? []) this.readers.get(dep)?.delete(addr);
|
|
68
|
+
const ast = this.parsed(addr);
|
|
69
|
+
const refs = ast && !(ast instanceof FormulaError) ? new Set(references(ast, this)) : /* @__PURE__ */ new Set();
|
|
70
|
+
this.deps.set(addr, refs);
|
|
71
|
+
for (const dep of refs) {
|
|
72
|
+
if (!this.readers.has(dep)) this.readers.set(dep, /* @__PURE__ */ new Set());
|
|
73
|
+
this.readers.get(dep).add(addr);
|
|
74
|
+
}
|
|
75
|
+
}
|
|
76
|
+
recalculate(start) {
|
|
77
|
+
const affected = /* @__PURE__ */ new Set();
|
|
78
|
+
const queue = [...start];
|
|
79
|
+
while (queue.length) {
|
|
80
|
+
const cell = queue.pop();
|
|
81
|
+
if (affected.has(cell)) continue;
|
|
82
|
+
affected.add(cell);
|
|
83
|
+
for (const r of this.readers.get(cell) ?? []) queue.push(r);
|
|
84
|
+
}
|
|
85
|
+
const pending = /* @__PURE__ */ new Map();
|
|
86
|
+
for (const cell of affected) {
|
|
87
|
+
let n = 0;
|
|
88
|
+
for (const dep of this.deps.get(cell) ?? []) if (affected.has(dep)) n++;
|
|
89
|
+
pending.set(cell, n);
|
|
90
|
+
}
|
|
91
|
+
const ready = [...affected].filter((c) => pending.get(c) === 0);
|
|
92
|
+
const changed = /* @__PURE__ */ new Set();
|
|
93
|
+
const done = /* @__PURE__ */ new Set();
|
|
94
|
+
while (ready.length) {
|
|
95
|
+
const cell = ready.pop();
|
|
96
|
+
done.add(cell);
|
|
97
|
+
if (this.compute(cell)) changed.add(cell);
|
|
98
|
+
for (const r of this.readers.get(cell) ?? []) {
|
|
99
|
+
if (!affected.has(r)) continue;
|
|
100
|
+
const left = pending.get(r) - 1;
|
|
101
|
+
pending.set(r, left);
|
|
102
|
+
if (left === 0) ready.push(r);
|
|
103
|
+
}
|
|
104
|
+
}
|
|
105
|
+
for (const cell of affected) {
|
|
106
|
+
if (done.has(cell)) continue;
|
|
107
|
+
const before = this.values.get(cell);
|
|
108
|
+
const error = new FormulaError("#CYCLE!");
|
|
109
|
+
this.values.set(cell, error);
|
|
110
|
+
if (!(before instanceof FormulaError && before.code === "#CYCLE!")) changed.add(cell);
|
|
111
|
+
}
|
|
112
|
+
return changed;
|
|
113
|
+
}
|
|
114
|
+
/** Compute one cell; returns whether its value changed. */
|
|
115
|
+
compute(addr) {
|
|
116
|
+
const before = this.values.get(addr);
|
|
117
|
+
let value;
|
|
118
|
+
const ast = this.parsed(addr);
|
|
119
|
+
if (ast === null) {
|
|
120
|
+
const raw = this.getRaw(addr);
|
|
121
|
+
const n = raw.trim() === "" ? NaN : Number(raw.replace(/,/g, ""));
|
|
122
|
+
value = raw === "" ? "" : Number.isFinite(n) ? n : raw.toUpperCase() === "TRUE" ? true : raw.toUpperCase() === "FALSE" ? false : raw;
|
|
123
|
+
} else if (ast instanceof FormulaError) value = ast;
|
|
124
|
+
else value = evaluate(ast, {
|
|
125
|
+
get: (ref) => this.getValue(ref),
|
|
126
|
+
rows: this.rows,
|
|
127
|
+
cols: this.cols
|
|
128
|
+
});
|
|
129
|
+
if (value === "") this.values.delete(addr);
|
|
130
|
+
else this.values.set(addr, value);
|
|
131
|
+
return !(before instanceof FormulaError && value instanceof FormulaError ? before.code === value.code : before === value || before === void 0 && value === "");
|
|
132
|
+
}
|
|
133
|
+
};
|
|
134
|
+
export { SheetModel };
|
|
135
|
+
|
|
136
|
+
//# sourceMappingURL=model.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"model.js","names":[],"sources":["../../../src/kit/sheet/model.ts"],"sourcesContent":["/**\n * SheetModel: cell contents, computed values, and the dependency graph\n * between them.\n *\n * Setting cells recalculates only what depends on them, in topological\n * order. Cells in a reference cycle (and everything that reads them) get\n * `#CYCLE!` instead of looping.\n *\n * @module kit/sheet/model\n */\n\nimport { evaluate, FormulaError, parse, references, type CellValue, type Node } from './formula';\n\nexport class SheetModel {\n private raw = new Map<string, string>();\n private values = new Map<string, CellValue>();\n private asts = new Map<string, Node | FormulaError>();\n /** cell → the cells it reads */\n private deps = new Map<string, Set<string>>();\n /** cell → the cells that read it */\n private readers = new Map<string, Set<string>>();\n\n constructor(readonly rows: number, readonly cols: number) {}\n\n /** What was typed into a cell ('' if empty). */\n getRaw(addr: string): string {\n return this.raw.get(addr) ?? '';\n }\n\n /** A cell's computed value ('' if empty). */\n getValue(addr: string): CellValue {\n return this.values.get(addr) ?? '';\n }\n\n /** Every non-empty cell's raw content. */\n entries(): Array<[string, string]> {\n return [...this.raw.entries()];\n }\n\n /** Set cells (raw content; '' clears). Returns every cell whose value changed. */\n set(changes: Record<string, string>): Set<string> {\n const touched = new Set<string>();\n for (const [addr, value] of Object.entries(changes)) {\n if (value === '') this.raw.delete(addr);\n else this.raw.set(addr, value);\n this.asts.delete(addr);\n this.link(addr);\n touched.add(addr);\n }\n return this.recalculate(touched);\n }\n\n private parsed(addr: string): Node | FormulaError | null {\n const raw = this.getRaw(addr);\n if (!raw.startsWith('=')) return null;\n let ast = this.asts.get(addr);\n if (!ast) {\n try {\n ast = raw.includes('#REF!') ? new FormulaError('#REF!') : parse(raw.slice(1));\n } catch (e) {\n ast = e instanceof FormulaError ? e : new FormulaError('#ERROR!');\n }\n this.asts.set(addr, ast);\n }\n return ast;\n }\n\n /** Update the graph edges for a cell. */\n private link(addr: string): void {\n for (const dep of this.deps.get(addr) ?? []) this.readers.get(dep)?.delete(addr);\n const ast = this.parsed(addr);\n const refs = ast && !(ast instanceof FormulaError) ? new Set(references(ast, this)) : new Set<string>();\n this.deps.set(addr, refs);\n for (const dep of refs) {\n if (!this.readers.has(dep)) this.readers.set(dep, new Set());\n this.readers.get(dep)!.add(addr);\n }\n }\n\n private recalculate(start: Set<string>): Set<string> {\n // Everything downstream of the changed cells.\n const affected = new Set<string>();\n const queue = [...start];\n while (queue.length) {\n const cell = queue.pop()!;\n if (affected.has(cell)) continue;\n affected.add(cell);\n for (const r of this.readers.get(cell) ?? []) queue.push(r);\n }\n // Kahn's algorithm over the affected subgraph.\n const pending = new Map<string, number>();\n for (const cell of affected) {\n let n = 0;\n for (const dep of this.deps.get(cell) ?? []) if (affected.has(dep)) n++;\n pending.set(cell, n);\n }\n const ready = [...affected].filter(c => pending.get(c) === 0);\n const changed = new Set<string>();\n const done = new Set<string>();\n while (ready.length) {\n const cell = ready.pop()!;\n done.add(cell);\n if (this.compute(cell)) changed.add(cell);\n for (const r of this.readers.get(cell) ?? []) {\n if (!affected.has(r)) continue;\n const left = pending.get(r)! - 1;\n pending.set(r, left);\n if (left === 0) ready.push(r);\n }\n }\n // Whatever is left is in a cycle, or reads one.\n for (const cell of affected) {\n if (done.has(cell)) continue;\n const before = this.values.get(cell);\n const error = new FormulaError('#CYCLE!');\n this.values.set(cell, error);\n if (!(before instanceof FormulaError && before.code === '#CYCLE!')) changed.add(cell);\n }\n return changed;\n }\n\n /** Compute one cell; returns whether its value changed. */\n private compute(addr: string): boolean {\n const before = this.values.get(addr);\n let value: CellValue;\n const ast = this.parsed(addr);\n if (ast === null) {\n const raw = this.getRaw(addr);\n const n = raw.trim() === '' ? NaN : Number(raw.replace(/,/g, ''));\n value = raw === '' ? '' : Number.isFinite(n) ? n : raw.toUpperCase() === 'TRUE' ? true : raw.toUpperCase() === 'FALSE' ? false : raw;\n } else if (ast instanceof FormulaError) {\n value = ast;\n } else {\n value = evaluate(ast, { get: ref => this.getValue(ref), rows: this.rows, cols: this.cols });\n }\n if (value === '') this.values.delete(addr);\n else this.values.set(addr, value);\n const same = before instanceof FormulaError && value instanceof FormulaError ? before.code === value.code : before === value || (before === undefined && value === '');\n return !same;\n }\n}\n"],"mappings":";;;;;;;;;;;;AAaA,IAAa,aAAb,MAAwB;CASD;CAAuB;CAR5C,sBAAc,IAAI,IAAoB;CACtC,yBAAiB,IAAI,IAAuB;CAC5C,uBAAe,IAAI,IAAiC;;CAEpD,uBAAe,IAAI,IAAyB;;CAE5C,0BAAkB,IAAI,IAAyB;CAE/C,YAAY,MAAuB,MAAuB;EAArC,KAAA,OAAA;EAAuB,KAAA,OAAA;CAAe;;CAG3D,OAAO,MAAsB;EAC3B,OAAO,KAAK,IAAI,IAAI,IAAI,KAAK;CAC/B;;CAGA,SAAS,MAAyB;EAChC,OAAO,KAAK,OAAO,IAAI,IAAI,KAAK;CAClC;;CAGA,UAAmC;EACjC,OAAO,CAAC,GAAG,KAAK,IAAI,QAAQ,CAAC;CAC/B;;CAGA,IAAI,SAA8C;EAChD,MAAM,0BAAU,IAAI,IAAY;EAChC,KAAK,MAAM,CAAC,MAAM,UAAU,OAAO,QAAQ,OAAO,GAAG;GACnD,IAAI,UAAU,IAAI,KAAK,IAAI,OAAO,IAAI;QACjC,KAAK,IAAI,IAAI,MAAM,KAAK;GAC7B,KAAK,KAAK,OAAO,IAAI;GACrB,KAAK,KAAK,IAAI;GACd,QAAQ,IAAI,IAAI;EAClB;EACA,OAAO,KAAK,YAAY,OAAO;CACjC;CAEA,OAAe,MAA0C;EACvD,MAAM,MAAM,KAAK,OAAO,IAAI;EAC5B,IAAI,CAAC,IAAI,WAAW,GAAG,GAAG,OAAO;EACjC,IAAI,MAAM,KAAK,KAAK,IAAI,IAAI;EAC5B,IAAI,CAAC,KAAK;GACR,IAAI;IACF,MAAM,IAAI,SAAS,OAAO,IAAI,IAAI,aAAa,OAAO,IAAI,MAAM,IAAI,MAAM,CAAC,CAAC;GAC9E,SAAS,GAAG;IACV,MAAM,aAAa,eAAe,IAAI,IAAI,aAAa,SAAS;GAClE;GACA,KAAK,KAAK,IAAI,MAAM,GAAG;EACzB;EACA,OAAO;CACT;;CAGA,KAAa,MAAoB;EAC/B,KAAK,MAAM,OAAO,KAAK,KAAK,IAAI,IAAI,KAAK,CAAC,GAAG,KAAK,QAAQ,IAAI,GAAG,CAAC,EAAE,OAAO,IAAI;EAC/E,MAAM,MAAM,KAAK,OAAO,IAAI;EAC5B,MAAM,OAAO,OAAO,EAAE,eAAe,gBAAgB,IAAI,IAAI,WAAW,KAAK,IAAI,CAAC,oBAAI,IAAI,IAAY;EACtG,KAAK,KAAK,IAAI,MAAM,IAAI;EACxB,KAAK,MAAM,OAAO,MAAM;GACtB,IAAI,CAAC,KAAK,QAAQ,IAAI,GAAG,GAAG,KAAK,QAAQ,IAAI,qBAAK,IAAI,IAAI,CAAC;GAC3D,KAAK,QAAQ,IAAI,GAAG,CAAC,CAAE,IAAI,IAAI;EACjC;CACF;CAEA,YAAoB,OAAiC;EAEnD,MAAM,2BAAW,IAAI,IAAY;EACjC,MAAM,QAAQ,CAAC,GAAG,KAAK;EACvB,OAAO,MAAM,QAAQ;GACnB,MAAM,OAAO,MAAM,IAAI;GACvB,IAAI,SAAS,IAAI,IAAI,GAAG;GACxB,SAAS,IAAI,IAAI;GACjB,KAAK,MAAM,KAAK,KAAK,QAAQ,IAAI,IAAI,KAAK,CAAC,GAAG,MAAM,KAAK,CAAC;EAC5D;EAEA,MAAM,0BAAU,IAAI,IAAoB;EACxC,KAAK,MAAM,QAAQ,UAAU;GAC3B,IAAI,IAAI;GACR,KAAK,MAAM,OAAO,KAAK,KAAK,IAAI,IAAI,KAAK,CAAC,GAAG,IAAI,SAAS,IAAI,GAAG,GAAG;GACpE,QAAQ,IAAI,MAAM,CAAC;EACrB;EACA,MAAM,QAAQ,CAAC,GAAG,QAAQ,CAAC,CAAC,QAAO,MAAK,QAAQ,IAAI,CAAC,MAAM,CAAC;EAC5D,MAAM,0BAAU,IAAI,IAAY;EAChC,MAAM,uBAAO,IAAI,IAAY;EAC7B,OAAO,MAAM,QAAQ;GACnB,MAAM,OAAO,MAAM,IAAI;GACvB,KAAK,IAAI,IAAI;GACb,IAAI,KAAK,QAAQ,IAAI,GAAG,QAAQ,IAAI,IAAI;GACxC,KAAK,MAAM,KAAK,KAAK,QAAQ,IAAI,IAAI,KAAK,CAAC,GAAG;IAC5C,IAAI,CAAC,SAAS,IAAI,CAAC,GAAG;IACtB,MAAM,OAAO,QAAQ,IAAI,CAAC,IAAK;IAC/B,QAAQ,IAAI,GAAG,IAAI;IACnB,IAAI,SAAS,GAAG,MAAM,KAAK,CAAC;GAC9B;EACF;EAEA,KAAK,MAAM,QAAQ,UAAU;GAC3B,IAAI,KAAK,IAAI,IAAI,GAAG;GACpB,MAAM,SAAS,KAAK,OAAO,IAAI,IAAI;GACnC,MAAM,QAAQ,IAAI,aAAa,SAAS;GACxC,KAAK,OAAO,IAAI,MAAM,KAAK;GAC3B,IAAI,EAAE,kBAAkB,gBAAgB,OAAO,SAAS,YAAY,QAAQ,IAAI,IAAI;EACtF;EACA,OAAO;CACT;;CAGA,QAAgB,MAAuB;EACrC,MAAM,SAAS,KAAK,OAAO,IAAI,IAAI;EACnC,IAAI;EACJ,MAAM,MAAM,KAAK,OAAO,IAAI;EAC5B,IAAI,QAAQ,MAAM;GAChB,MAAM,MAAM,KAAK,OAAO,IAAI;GAC5B,MAAM,IAAI,IAAI,KAAK,MAAM,KAAK,MAAM,OAAO,IAAI,QAAQ,MAAM,EAAE,CAAC;GAChE,QAAQ,QAAQ,KAAK,KAAK,OAAO,SAAS,CAAC,IAAI,IAAI,IAAI,YAAY,MAAM,SAAS,OAAO,IAAI,YAAY,MAAM,UAAU,QAAQ;EACnI,OAAO,IAAI,eAAe,cACxB,QAAQ;OAER,QAAQ,SAAS,KAAK;GAAE,MAAK,QAAO,KAAK,SAAS,GAAG;GAAG,MAAM,KAAK;GAAM,MAAM,KAAK;EAAK,CAAC;EAE5F,IAAI,UAAU,IAAI,KAAK,OAAO,OAAO,IAAI;OACpC,KAAK,OAAO,IAAI,MAAM,KAAK;EAEhC,OAAO,EADM,kBAAkB,gBAAgB,iBAAiB,eAAe,OAAO,SAAS,MAAM,OAAO,WAAW,SAAU,WAAW,KAAA,KAAa,UAAU;CAErK;AACF"}
|
|
@@ -42,4 +42,6 @@ export declare class Sheet extends Component {
|
|
|
42
42
|
/** Render now (normally batched to the next frame). */
|
|
43
43
|
redraw(): void;
|
|
44
44
|
}
|
|
45
|
+
/** Define `<a-sheet>` (idempotent). `import 'arethesis/components/sheet'` calls this. */
|
|
46
|
+
export declare function defineSheet(): void;
|
|
45
47
|
//# sourceMappingURL=sheet.d.ts.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"sheet.d.ts","sourceRoot":"","sources":["../../../src/kit/sheet/sheet.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AAKvD,OAAO,EAA8D,KAAK,SAAS,EAAE,MAAM,WAAW,CAAC;AACvG,OAAO,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AAErC,MAAM,WAAW,WAAW;IAC1B,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,4DAA4D;IAC5D,KAAK,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC/B,8CAA8C;IAC9C,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,4CAA4C;IAC5C,YAAY,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,KAAK,MAAM,CAAC;IACvD,4CAA4C;IAC5C,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAChC,kDAAkD;IAClD,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,OAAO,CAAC;CACtC;AAmBD,qBAAa,KAAM,SAAQ,SAAS;;IAoBlC,SAAS,CAAC,MAAM,EAAE,WAAW,GAAG,IAAI;IAUpC,oEAAoE;IACpE,IAAI,KAAK,IAAI,UAAU,CAEtB;IAED,IAAI,MAAM,IAAI,MAAM,CAEnB;IAED,yDAAyD;IACzD,IAAI,SAAS,IAAI,MAAM,CAKtB;IAED,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,SAAS;IAIjC;;;;OAIG;IACH,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAE;QAAE,MAAM,CAAC,EAAE,OAAO,CAAC;QAAC,EAAE,CAAC,EAAE,MAAM,CAAA;KAAO,GAAG,IAAI;IAmBhG,0DAA0D;IAC1D,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,UAAQ,GAAG,IAAI;IA6B1C,IAAI,IAAI,OAAO;IASf,IAAI,IAAI,OAAO;cAWI,WAAW,IAAI,IAAI;cAMnB,cAAc,IAAI,IAAI;IAmDzC,uDAAuD;IACvD,MAAM,IAAI,IAAI;CA2Wf"}
|
|
1
|
+
{"version":3,"file":"sheet.d.ts","sourceRoot":"","sources":["../../../src/kit/sheet/sheet.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AAKvD,OAAO,EAA8D,KAAK,SAAS,EAAE,MAAM,WAAW,CAAC;AACvG,OAAO,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AAErC,MAAM,WAAW,WAAW;IAC1B,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,4DAA4D;IAC5D,KAAK,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC/B,8CAA8C;IAC9C,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,4CAA4C;IAC5C,YAAY,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,KAAK,MAAM,CAAC;IACvD,4CAA4C;IAC5C,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAChC,kDAAkD;IAClD,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,OAAO,CAAC;CACtC;AAmBD,qBAAa,KAAM,SAAQ,SAAS;;IAoBlC,SAAS,CAAC,MAAM,EAAE,WAAW,GAAG,IAAI;IAUpC,oEAAoE;IACpE,IAAI,KAAK,IAAI,UAAU,CAEtB;IAED,IAAI,MAAM,IAAI,MAAM,CAEnB;IAED,yDAAyD;IACzD,IAAI,SAAS,IAAI,MAAM,CAKtB;IAED,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,SAAS;IAIjC;;;;OAIG;IACH,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAE;QAAE,MAAM,CAAC,EAAE,OAAO,CAAC;QAAC,EAAE,CAAC,EAAE,MAAM,CAAA;KAAO,GAAG,IAAI;IAmBhG,0DAA0D;IAC1D,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,UAAQ,GAAG,IAAI;IA6B1C,IAAI,IAAI,OAAO;IASf,IAAI,IAAI,OAAO;cAWI,WAAW,IAAI,IAAI;cAMnB,cAAc,IAAI,IAAI;IAmDzC,uDAAuD;IACvD,MAAM,IAAI,IAAI;CA2Wf;AAED,yFAAyF;AACzF,wBAAgB,WAAW,IAAI,IAAI,CAElC"}
|