@getaster/data 0.0.0-stage → 0.1.0-preview.1

package/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/NOTICE

@@ -0,0 +1,10 @@
+Aster UI
+Copyright 2026 Aster UI contributors
+
+Aster UI source and the separately supplied OData mock WebAssembly binary are
+licensed under the Apache License, Version 2.0. Third-party components retain
+their respective licenses. The binary's attribution inventory and license texts
+are supplied in packages/mock/wasm/; packages include those notices when shipped.
+
+Geist and IBM Plex Mono fonts retain their SIL Open Font License notices.
+ECharts is an optional separately loaded third-party runtime.

package/README.md

@@ -1,3 +1,7 @@
-# Temporary Holding Version
+# @getaster/data
 
-This version is a temporary placeholder for this package. An operational version to replace this has been submitted for review and is awaiting a staged release.
+Aster UI data.
+
+Documentation: https://ui.getaster.now/docs/guide/library.html
+
+Licensed under Apache-2.0. See LICENSE and NOTICE.

package/dist/authentication.d.ts

@@ -0,0 +1,42 @@
+import { type ReadonlySignal } from "@preact/signals-core";
+import type { ODataRequest, ODataResponse, Transport } from "./transport.ts";
+export type AuthenticationFailure = "cancelled" | "timeout" | "failed" | "identity-changed" | "retry-limit" | "replay-blocked" | "disposed";
+/** Recovery failed without settling the original operation successfully. */
+export declare class AuthenticationError extends Error {
+    readonly reason: AuthenticationFailure;
+    constructor(reason: AuthenticationFailure, options?: ErrorOptions);
+}
+export interface AuthenticationChallenge {
+    readonly request: ODataRequest;
+    readonly response: ODataResponse;
+}
+export interface AuthenticationRecovery extends AuthenticationChallenge {
+    /** Abort UI/SDK work when recovery times out, loses all waiters or is disposed. */
+    readonly signal: AbortSignal;
+    /** Stable account and tenant identity before the challenged operation. */
+    readonly identity: string | undefined;
+}
+export interface AuthenticationOptions {
+    /** Stable account/tenant key; undefined is allowed before initial login. */
+    readonly identity: () => string | undefined;
+    /** Resolves only after credentials are ready. Throw on cancellation or failure. */
+    readonly recover: (context: AuthenticationRecovery) => Promise<void>;
+    /** Defaults to HTTP 401. Restrict custom detection to trusted API responses. */
+    readonly challenge?: (context: AuthenticationChallenge) => boolean;
+    /** GET only by default. Opt in writes only with a server non-application guarantee or idempotency. */
+    readonly replay?: (context: AuthenticationChallenge) => boolean;
+    /** Rebuild credential headers on every send, including retries. */
+    readonly credentials?: () => Readonly<Record<string, string>> | Promise<Readonly<Record<string, string>>>;
+    /** Total recovery deadline, including interaction. Defaults to five minutes. */
+    readonly timeoutMs?: number;
+}
+/** One authentication context shared by explicitly wrapped service transports. */
+export declare class Authentication {
+    #private;
+    readonly recovering: ReadonlySignal<boolean>;
+    constructor(options: AuthenticationOptions);
+    /** Wrap only transports that belong to this identity/credential context. */
+    wrap(transport: Transport): Transport;
+    /** Cancels waiting and in-flight wrapped requests; late recovery cannot resume them. */
+    dispose(): void;
+}

package/dist/authentication.js

@@ -0,0 +1,121 @@
+import { signal } from "@preact/signals-core";
+/** Recovery failed without settling the original operation successfully. */
+export class AuthenticationError extends Error {
+    reason;
+    constructor(reason, options) {
+        super(`Authentication recovery: ${reason}`, options);
+        this.name = "AuthenticationError";
+        this.reason = reason;
+    }
+}
+/** One authentication context shared by explicitly wrapped service transports. */
+export class Authentication {
+    #options;
+    #timeout;
+    #lifetime = new AbortController();
+    #recovering = signal(false);
+    recovering = this.#recovering;
+    #recovery;
+    #generation = 0;
+    constructor(options) {
+        const timeout = options.timeoutMs ?? 300_000;
+        if (!Number.isSafeInteger(timeout) || timeout <= 0 || timeout > 2_147_483_647)
+            throw new RangeError("Authentication timeoutMs must be a positive timer integer");
+        this.#options = Object.freeze({ ...options });
+        this.#timeout = timeout;
+    }
+    /** Wrap only transports that belong to this identity/credential context. */
+    wrap(transport) {
+        return async (original) => {
+            const signal = original.signal ? AbortSignal.any([original.signal, this.#lifetime.signal]) : this.#lifetime.signal;
+            const request = Object.freeze({ ...original, ...(original.headers ? { headers: Object.freeze({ ...original.headers }) } : {}), signal });
+            const identity = this.#options.identity();
+            let retried = false;
+            for (;;) {
+                signal.throwIfAborted();
+                if (this.#recovery)
+                    await this.#join(this.#recovery, signal);
+                this.#checkIdentity(identity);
+                const generation = this.#generation;
+                const credentials = this.#options.credentials ? await interrupted(Promise.resolve().then(() => { signal.throwIfAborted(); return this.#options.credentials(); }), signal) : {};
+                signal.throwIfAborted();
+                this.#checkIdentity(identity);
+                // Credential lookup can yield while another request starts recovery.
+                if (this.#recovery || generation !== this.#generation)
+                    continue;
+                const headers = new Headers(request.headers);
+                for (const [key, value] of Object.entries(credentials))
+                    headers.set(key, value);
+                const response = await interrupted(Promise.resolve().then(() => { signal.throwIfAborted(); return transport({ ...request, headers: Object.fromEntries(headers) }); }), signal);
+                const challenge = { request, response };
+                if (!(this.#options.challenge?.(challenge) ?? response.status === 401))
+                    return response;
+                this.#checkIdentity(identity);
+                if (retried)
+                    throw new AuthenticationError("retry-limit");
+                if (!(this.#options.replay?.(challenge) ?? request.method === "GET"))
+                    throw new AuthenticationError("replay-blocked");
+                retried = true;
+                // A late response using old credentials shares the already completed recovery.
+                if (generation === this.#generation)
+                    await this.#join(this.#recovery ?? this.#start(challenge, identity), signal);
+            }
+        };
+    }
+    #checkIdentity(expected) {
+        if (expected !== undefined && this.#options.identity() !== expected)
+            throw new AuthenticationError("identity-changed");
+    }
+    #start(challenge, identity) {
+        const controller = new AbortController();
+        const timer = setTimeout(() => controller.abort(new AuthenticationError("timeout")), this.#timeout);
+        const recovery = {
+            controller, waiters: 0,
+            promise: Promise.resolve().then(async () => {
+                controller.signal.throwIfAborted();
+                await interrupted(Promise.resolve().then(() => this.#options.recover({ ...challenge, signal: controller.signal, identity })), controller.signal);
+                this.#checkIdentity(identity);
+                this.#generation++;
+            }).catch(error => {
+                throw error instanceof AuthenticationError ? error : new AuthenticationError("failed", { cause: error });
+            }).finally(() => {
+                clearTimeout(timer);
+                if (this.#recovery === recovery) {
+                    this.#recovery = undefined;
+                    this.#recovering.value = false;
+                }
+            }),
+        };
+        this.#recovery = recovery;
+        this.#recovering.value = true;
+        return recovery;
+    }
+    async #join(recovery, signal) {
+        recovery.waiters++;
+        try {
+            await interrupted(recovery.promise, signal);
+        }
+        finally {
+            if (--recovery.waiters === 0 && this.#recovery === recovery) {
+                this.#recovery = undefined;
+                recovery.controller.abort(new AuthenticationError("cancelled"));
+                this.#recovering.value = false;
+            }
+        }
+    }
+    /** Cancels waiting and in-flight wrapped requests; late recovery cannot resume them. */
+    dispose() {
+        this.#lifetime.abort(new AuthenticationError("disposed"));
+        this.#recovery?.controller.abort(new AuthenticationError("disposed"));
+    }
+}
+function interrupted(promise, signal) {
+    return new Promise((resolve, reject) => {
+        const abort = () => { signal.removeEventListener("abort", abort); reject(signal.reason); };
+        promise.then(value => { signal.removeEventListener("abort", abort); resolve(value); }, error => { signal.removeEventListener("abort", abort); reject(error); });
+        if (signal.aborted)
+            abort();
+        else
+            signal.addEventListener("abort", abort, { once: true });
+    });
+}

package/dist/changes/changeset.d.ts

@@ -0,0 +1,47 @@
+import type { Entity, EntityType, Value } from "../schema/model.ts";
+import type { KeyValues } from "../store/keys.ts";
+export interface FieldChange {
+    readonly from: Value;
+    readonly to: Value;
+}
+/** Changes to a record's owned collections, by navigation name: one per child record added, updated or removed. */
+export type OwnedChanges = Readonly<Record<string, readonly ChangeSet[]>>;
+/**
+ * What a save changed, as data: it can be stored, sent, inverted for undo and
+ * replayed over its old values. An update can carry its owned collections'
+ * changes, so one record's edit across nested editors is one change set.
+ */
+export type ChangeSet = {
+    readonly kind: "create";
+    readonly set: string;
+    readonly values: Entity;
+} | {
+    readonly kind: "update";
+    readonly set: string;
+    readonly key: KeyValues;
+    readonly changes: Readonly<Record<string, FieldChange>>;
+    readonly owned?: OwnedChanges;
+} | {
+    readonly kind: "delete";
+    readonly set: string;
+    readonly key: KeyValues;
+    readonly values: Entity;
+};
+/** Field changes from `baseline` to `current`; only fields present in `current` count. */
+export declare function diff(baseline: Entity, current: Entity): Record<string, FieldChange>;
+export declare function isEmpty(changes: Readonly<Record<string, FieldChange>>): boolean;
+export declare function apply(entity: Entity, changes: Readonly<Record<string, FieldChange>>): Entity;
+/**
+ * The change that undoes `change`. Undoing a create needs the created record's
+ * key; undoing a delete recreates it without its server-computed properties.
+ */
+export declare function invert(change: ChangeSet, type: EntityType, created?: KeyValues): ChangeSet;
+/** Two updates of one record as one: first `from`, last `to`; fields that end where they began drop out. */
+export declare function merge(a: Readonly<Record<string, FieldChange>>, b: Readonly<Record<string, FieldChange>>): Record<string, FieldChange>;
+/** The properties a client may send: computed ones are the server's. */
+export declare function writable(type: EntityType, values: Entity): Entity;
+/**
+ * What a create sends: the writable values that differ from what the server
+ * would store without them (the field's `$DefaultValue`, else null).
+ */
+export declare function creatable(type: EntityType, values: Entity): Entity;

package/dist/changes/changeset.js

@@ -0,0 +1,75 @@
+/** Field changes from `baseline` to `current`; only fields present in `current` count. */
+export function diff(baseline, current) {
+    const out = {};
+    for (const [name, to] of Object.entries(current)) {
+        const from = baseline[name] ?? null;
+        if (!Object.is(from, to))
+            out[name] = { from, to };
+    }
+    return out;
+}
+export function isEmpty(changes) {
+    return Object.keys(changes).length === 0;
+}
+export function apply(entity, changes) {
+    const out = { ...entity };
+    for (const [name, c] of Object.entries(changes))
+        out[name] = c.to;
+    return out;
+}
+/**
+ * The change that undoes `change`. Undoing a create needs the created record's
+ * key; undoing a delete recreates it without its server-computed properties.
+ */
+export function invert(change, type, created) {
+    switch (change.kind) {
+        case "create":
+            if (!created)
+                throw new Error("Undoing a create needs the created record's key");
+            return { kind: "delete", set: change.set, key: created, values: change.values };
+        case "update": {
+            const changes = {};
+            for (const [name, c] of Object.entries(change.changes))
+                changes[name] = { from: c.to, to: c.from };
+            if (change.owned)
+                throw new Error("Undoing owned changes needs each child's type and keys; undo them one by one");
+            return { kind: "update", set: change.set, key: change.key, changes };
+        }
+        case "delete":
+            return { kind: "create", set: change.set, values: writable(type, change.values) };
+    }
+}
+/** Two updates of one record as one: first `from`, last `to`; fields that end where they began drop out. */
+export function merge(a, b) {
+    const out = { ...a };
+    for (const [name, c] of Object.entries(b)) {
+        const first = out[name];
+        out[name] = first ? { from: first.from, to: c.to } : c;
+    }
+    for (const [name, c] of Object.entries(out))
+        if (Object.is(c.from, c.to))
+            delete out[name];
+    return out;
+}
+/** The properties a client may send: computed ones are the server's. */
+export function writable(type, values) {
+    const out = {};
+    for (const [name, v] of Object.entries(values)) {
+        const field = type.field(name);
+        if (field && !field.computed)
+            out[name] = v;
+    }
+    return out;
+}
+/**
+ * What a create sends: the writable values that differ from what the server
+ * would store without them (the field's `$DefaultValue`, else null).
+ */
+export function creatable(type, values) {
+    const out = {};
+    for (const [name, v] of Object.entries(writable(type, values))) {
+        if (!Object.is(v, type.field(name).defaultValue ?? null))
+            out[name] = v;
+    }
+    return out;
+}

package/dist/collection/aggregate.d.ts

@@ -0,0 +1,22 @@
+import { type ReadonlySignal } from "@preact/signals-core";
+import type { Criteria } from "../criteria/ast.ts";
+import type { Entity, Field, Value } from "../schema/model.ts";
+import type { Collection } from "./collection.ts";
+/**
+ * A value computed over every record of a collection. It is `undefined`
+ * until the collection is fully loaded, so a figure never shows a partial
+ * answer as if it were the whole one.
+ */
+export declare function aggregate<T>(collection: Collection, reduce: (items: readonly Entity[]) => T): ReadonlySignal<T | undefined>;
+/** Records matching `criteria`, evaluated locally with OData semantics. */
+export declare function countWhere(collection: Collection, criteria: Criteria): ReadonlySignal<number | undefined>;
+/** Records per value of `field`; null values are counted under `null`. */
+export declare function countBy(collection: Collection, field: string): ReadonlySignal<ReadonlyMap<Value, number> | undefined>;
+/**
+ * The sum of a numeric field, ignoring nulls. Decimal and Int64 sums are
+ * exact and returned as text, like the values themselves.
+ */
+export declare function sum(collection: Collection, field: string): ReadonlySignal<Value | undefined>;
+export declare function sumValues(values: readonly Value[], field: Field): Value;
+/** `a - b` for exact numeric text, keeping the larger scale. */
+export declare function subtractExact(a: Value, b: Value): string;

package/dist/collection/aggregate.js

@@ -0,0 +1,94 @@
+import { computed } from "@preact/signals-core";
+import { matches } from "../criteria/evaluate.js";
+/**
+ * A value computed over every record of a collection. It is `undefined`
+ * until the collection is fully loaded, so a figure never shows a partial
+ * answer as if it were the whole one.
+ */
+export function aggregate(collection, reduce) {
+    return computed(() => {
+        if (!collection.complete.value)
+            return undefined;
+        return reduce(collection.items.value);
+    });
+}
+/** Records matching `criteria`, evaluated locally with OData semantics. */
+export function countWhere(collection, criteria) {
+    const type = collection.type;
+    return aggregate(collection, (items) => items.filter((e) => matches(criteria, e, type)).length);
+}
+/** Records per value of `field`; null values are counted under `null`. */
+export function countBy(collection, field) {
+    requireField(collection, field);
+    return aggregate(collection, (items) => {
+        const out = new Map();
+        for (const e of items) {
+            const v = e[field] ?? null;
+            out.set(v, (out.get(v) ?? 0) + 1);
+        }
+        return out;
+    });
+}
+/**
+ * The sum of a numeric field, ignoring nulls. Decimal and Int64 sums are
+ * exact and returned as text, like the values themselves.
+ */
+export function sum(collection, field) {
+    const f = requireField(collection, field);
+    return aggregate(collection, (items) => sumValues(items.map((e) => e[field] ?? null), f));
+}
+export function sumValues(values, field) {
+    if (field.type === "Edm.Decimal" || field.type === "Edm.Int64") {
+        let total = 0n;
+        let scale = 0;
+        for (const v of values) {
+            if (v === null)
+                continue;
+            const d = parseExact(v);
+            [total, scale] = addScaled(total, scale, d.units, d.scale);
+        }
+        return formatExact(total, scale);
+    }
+    let total = 0;
+    for (const v of values)
+        if (typeof v === "number")
+            total += v;
+    return total;
+}
+/** `a - b` for exact numeric text, keeping the larger scale. */
+export function subtractExact(a, b) {
+    const x = parseExact(a);
+    const y = parseExact(b);
+    const [total, scale] = addScaled(x.units, x.scale, -y.units, y.scale);
+    return formatExact(total, scale);
+}
+function requireField(collection, name) {
+    const f = collection.type.field(name);
+    if (!f)
+        throw new Error(`${collection.type.name} has no field ${name}`);
+    return f;
+}
+function parseExact(v) {
+    const text = String(v);
+    const m = /^(-?)(\d+)(?:\.(\d+))?(?:[eE]([+-]?\d+))?$/.exec(text);
+    if (!m)
+        throw new Error(`${text} isn't an exact number`);
+    const frac = m[3] ?? "";
+    let units = BigInt(m[2] + frac);
+    let scale = frac.length - Number(m[4] ?? 0);
+    if (scale < 0) {
+        units *= 10n ** BigInt(-scale);
+        scale = 0;
+    }
+    return { units: m[1] ? -units : units, scale };
+}
+function addScaled(a, as, b, bs) {
+    const scale = Math.max(as, bs);
+    return [a * 10n ** BigInt(scale - as) + b * 10n ** BigInt(scale - bs), scale];
+}
+function formatExact(units, scale) {
+    const negative = units < 0n;
+    const digits = (negative ? -units : units).toString().padStart(scale + 1, "0");
+    const text = scale === 0 ? digits : `${digits.slice(0, -scale)}.${digits.slice(-scale)}`;
+    return negative ? `-${text}` : text;
+}