@adobe/data 0.2.1 → 0.2.3

package/dist/cache/managed-array.js

@@ -0,0 +1,160 @@
+function createManagedConstantArray(value) {
+    return {
+        constant: true,
+        get(_index) {
+            return value;
+        },
+        set(_index, _value) { },
+        move(_from, _to) { },
+        slice(_from, _length) {
+            return [value];
+        },
+        ensureCapacity(_capacity) { },
+        toJSON(_length) {
+            return value;
+        },
+        fromJSON(data) {
+            if (data !== value) {
+                throw new Error(`Cannot set constant array to ${data}`);
+            }
+        },
+    };
+}
+function createManagedBasicArray() {
+    const array = [];
+    return {
+        constant: false,
+        native: array,
+        get: (index) => array[index],
+        set: (index, value) => (array[index] = value),
+        move: (from, to) => (array[to] = array[from]),
+        ensureCapacity: (_capacity) => { },
+        slice: (from, length) => array.slice(from, from + length),
+        toJSON(length) {
+            return array.slice(0, length);
+        },
+        fromJSON(data) {
+            if (!Array.isArray(data)) {
+                throw new Error(`Cannot set array to ${data}`);
+            }
+            array.length = 0;
+            array.push(...data);
+        },
+    };
+}
+function binaryEncode(subarray) {
+    return btoa(String.fromCharCode(...new Uint8Array(subarray.buffer, subarray.byteOffset, subarray.byteLength)));
+}
+function binaryDecode(data, length, ctor) {
+    const binaryString = atob(data);
+    const byteArray = new Uint8Array(binaryString.length);
+    for (let i = 0; i < binaryString.length; i++) {
+        byteArray[i] = binaryString.charCodeAt(i);
+    }
+    return new ctor(byteArray.buffer, byteArray.byteOffset, length);
+}
+function createManagedTypedArray(ctor, allocator) {
+    let capacity = 16;
+    let array = allocator.allocate(ctor, capacity);
+    //  when the main wasm memory is resized, we need to refresh the array.
+    allocator.needsRefresh(() => {
+        array = allocator.refresh(array);
+    });
+    const grow = (newCapacity) => {
+        if (newCapacity && newCapacity > capacity) {
+            array = allocator.refresh(array);
+            const oldArray = array;
+            const growthFactor = 2;
+            capacity = Math.max(newCapacity, capacity * growthFactor);
+            const newArray = allocator.allocate(ctor, capacity);
+            newArray.set(array);
+            array = newArray;
+            allocator.release(oldArray);
+        }
+    };
+    const result = {
+        constant: false,
+        get native() {
+            return array;
+        },
+        get(index) {
+            return array[index];
+        },
+        set(index, value) {
+            // if (index >= capacity) {
+            //   grow();
+            // }
+            array[index] = value;
+        },
+        move(from, to) {
+            array[to] = array[from];
+        },
+        slice(start, end) {
+            return [...array.subarray(start, end)];
+        },
+        ensureCapacity(newCapacity) {
+            grow(newCapacity);
+        },
+        toJSON(length, allowEncoding = true) {
+            const subarray = array.subarray(0, length);
+            if (!allowEncoding) {
+                return Array.from(subarray);
+            }
+            const jsonString = JSON.stringify(Array.from(subarray));
+            const binaryString = binaryEncode(subarray);
+            return binaryString.length < jsonString.length
+                ? binaryString
+                : Array.from(subarray);
+        },
+        fromJSON(data, length) {
+            if (typeof data === "string") {
+                const decodedArray = binaryDecode(data, length, ctor);
+                if (decodedArray.length > capacity) {
+                    grow(decodedArray.length);
+                }
+                array.set(decodedArray);
+            }
+            else {
+                if (!Array.isArray(data)) {
+                    throw new Error(`Cannot set array to ${data}`);
+                }
+                if (data.length > capacity) {
+                    grow(data.length);
+                }
+                array.set(data);
+            }
+        },
+    };
+    return result;
+}
+export function createManagedArray(s, allocator) {
+    if (s.const !== undefined) {
+        return createManagedConstantArray(s.const);
+    }
+    if (s.type === "number") {
+        if (s.precision === 1) {
+            return createManagedTypedArray(Float32Array, allocator);
+        }
+        // default to double precision float
+        return createManagedTypedArray(Float64Array, allocator);
+    }
+    if (s.type === "integer" &&
+        s.minimum !== undefined) {
+        if (s.minimum >= 0) {
+            if (s.maximum) {
+                // unsigned integers
+                if (s.maximum <= 0xff) {
+                    return createManagedTypedArray(Uint8Array, allocator);
+                }
+                if (s.maximum <= 0xffff) {
+                    return createManagedTypedArray(Uint16Array, allocator);
+                }
+                if (s.maximum <= 0xffffffff) {
+                    return createManagedTypedArray(Uint32Array, allocator);
+                }
+            }
+        }
+    }
+    return createManagedBasicArray();
+}
+//# sourceMappingURL=managed-array.js.map

package/dist/cache/managed-array.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"managed-array.js","sourceRoot":"","sources":["../../src/cache/managed-array.ts"],"names":[],"mappings":"AAiDA,SAAS,0BAA0B,CAAI,KAAQ;IAC7C,OAAO;QACL,QAAQ,EAAE,IAAI;QACd,GAAG,CAAC,MAAc;YAChB,OAAO,KAAK,CAAC;QACf,CAAC;QACD,GAAG,CAAC,MAAc,EAAE,MAAS,IAAU,CAAC;QACxC,IAAI,CAAC,KAAa,EAAE,GAAW,IAAU,CAAC;QAC1C,KAAK,CAAC,KAAa,EAAE,OAAe;YAClC,OAAO,CAAC,KAAK,CAAC,CAAC;QACjB,CAAC;QACD,cAAc,CAAC,SAAiB,IAAI,CAAC;QACrC,MAAM,CAAC,OAAe;YACpB,OAAO,KAAa,CAAC;QACvB,CAAC;QACD,QAAQ,CAAC,IAAU;YACjB,IAAI,IAAI,KAAK,KAAK,EAAE,CAAC;gBACnB,MAAM,IAAI,KAAK,CAAC,gCAAgC,IAAI,EAAE,CAAC,CAAC;YAC1D,CAAC;QACH,CAAC;KACF,CAAC;AACJ,CAAC;AAED,SAAS,uBAAuB;IAC9B,MAAM,KAAK,GAAQ,EAAE,CAAC;IACtB,OAAO;QACL,QAAQ,EAAE,KAAK;QACf,MAAM,EAAE,KAAK;QACb,GAAG,EAAE,CAAC,KAAa,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC;QACpC,GAAG,EAAE,CAAC,KAAa,EAAE,KAAQ,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;QACxD,IAAI,EAAE,CAAC,IAAY,EAAE,EAAU,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QAC7D,cAAc,EAAE,CAAC,SAAiB,EAAE,EAAE,GAAG,CAAC;QAC1C,KAAK,EAAE,CAAC,IAAY,EAAE,MAAc,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,GAAG,MAAM,CAAC;QACzE,MAAM,CAAC,MAAc;YACnB,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAS,CAAC;QACxC,CAAC;QACD,QAAQ,CAAC,IAAU;YACjB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;gBACzB,MAAM,IAAI,KAAK,CAAC,uBAAuB,IAAI,EAAE,CAAC,CAAC;YACjD,CAAC;YACD,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;YACjB,KAAK,CAAC,IAAI,CAAC,GAAG,IAAW,CAAC,CAAC;QAC7B,CAAC;KACF,CAAC;AACJ,CAAC;AAED,SAAS,YAAY,CAAC,QAAoB;IACxC,OAAO,IAAI,CACT,MAAM,CAAC,YAAY,CACjB,GAAG,IAAI,UAAU,CACf,QAAQ,CAAC,MAAM,EACf,QAAQ,CAAC,UAAU,EACnB,QAAQ,CAAC,UAAU,CACpB,CACF,CACF,CAAC;AACJ,CAAC;AAED,SAAS,YAAY,CACnB,IAAY,EACZ,MAAc,EACd,IAA2B;IAE3B,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;IAChC,MAAM,SAAS,GAAG,IAAI,UAAU,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;IACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7C,SAAS,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC;IACD,OAAO,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;AAClE,CAAC;AAED,SAAS,uBAAuB,CAC9B,IAA2B,EAC3B,SAA0B;IAE1B,IAAI,QAAQ,GAAG,EAAE,CAAC;IAClB,IAAI,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAC/C,uEAAuE;IACvE,SAAS,CAAC,YAAY,CAAC,GAAG,EAAE;QAC1B,KAAK,GAAG,SAAS,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,MAAM,IAAI,GAAG,CAAC,WAAoB,EAAE,EAAE;QACpC,IAAI,WAAW,IAAI,WAAW,GAAG,QAAQ,EAAE,CAAC;YAC1C,KAAK,GAAG,SAAS,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACjC,MAAM,QAAQ,GAAG,KAAK,CAAC;YACvB,MAAM,YAAY,GAAG,CAAC,CAAC;YACvB,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,QAAQ,GAAG,YAAY,CAAC,CAAC;YAC1D,MAAM,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YACpD,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACpB,KAAK,GAAG,QAAQ,CAAC;YACjB,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC,CAAC;IACF,MAAM,MAAM,GAAG;QACb,QAAQ,EAAE,KAAK;QACf,IAAI,MAAM;YACR,OAAO,KAAK,CAAC;QACf,CAAC;QACD,GAAG,CAAC,KAAa;YACf,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC;QACtB,CAAC;QACD,GAAG,CAAC,KAAa,EAAE,KAAa;YAC9B,2BAA2B;YAC3B,YAAY;YACZ,IAAI;YACJ,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;QACvB,CAAC;QACD,IAAI,CAAC,IAAY,EAAE,EAAU;YAC3B,KAAK,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QAC1B,CAAC;QACD,KAAK,CAAC,KAAa,EAAE,GAAW;YAC9B,OAAO,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;QACzC,CAAC;QACD,cAAc,CAAC,WAAmB;YAChC,IAAI,CAAC,WAAW,CAAC,CAAC;QACpB,CAAC;QACD,MAAM,CAAC,MAAc,EAAE,aAAa,GAAG,IAAI;YACzC,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YAC3C,IAAI,CAAC,aAAa,EAAE,CAAC;gBACnB,OAAO,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC9B,CAAC;YACD,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YACxD,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;YAC5C,OAAO,YAAY,CAAC,MAAM,GAAG,UAAU,CAAC,MAAM;gBAC5C,CAAC,CAAC,YAAY;gBACd,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC3B,CAAC;QACD,QAAQ,CAAC,IAAU,EAAE,MAAc;YACjC,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;gBAC7B,MAAM,YAAY,GAAG,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;gBACtD,IAAI,YAAY,CAAC,MAAM,GAAG,QAAQ,EAAE,CAAC;oBACnC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;gBAC5B,CAAC;gBACD,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;YAC1B,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;oBACzB,MAAM,IAAI,KAAK,CAAC,uBAAuB,IAAI,EAAE,CAAC,CAAC;gBACjD,CAAC;gBACD,IAAI,IAAI,CAAC,MAAM,GAAG,QAAQ,EAAE,CAAC;oBAC3B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACpB,CAAC;gBACD,KAAK,CAAC,GAAG,CAAC,IAAgB,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;KACF,CAAC;IACF,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,UAAU,kBAAkB,CAChC,CAAI,EACJ,SAA0B;IAE1B,IAAI,CAAC,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QAC1B,OAAO,0BAA0B,CAAC,CAAC,CAAC,KAAK,CAAgC,CAAC;IAC5E,CAAC;IACD,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QACxB,IAAI,CAAC,CAAC,SAAS,KAAK,CAAC,EAAE,CAAC;YACtB,OAAO,uBAAuB,CAAC,YAAY,EAAE,SAAS,CAErD,CAAC;QACJ,CAAC;QACD,oCAAoC;QACpC,OAAO,uBAAuB,CAAC,YAAY,EAAE,SAAS,CAErD,CAAC;IACJ,CAAC;IACD,IACE,CAAC,CAAC,IAAI,KAAK,SAAS;QACpB,CAAC,CAAC,OAAO,KAAK,SAAS,EACvB,CAAC;QACD,IAAI,CAAC,CAAC,OAAO,IAAI,CAAC,EAAE,CAAC;YACnB,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;gBACd,oBAAoB;gBACpB,IAAI,CAAC,CAAC,OAAO,IAAI,IAAI,EAAE,CAAC;oBACtB,OAAO,uBAAuB,CAAC,UAAU,EAAE,SAAS,CAEnD,CAAC;gBACJ,CAAC;gBACD,IAAI,CAAC,CAAC,OAAO,IAAI,MAAM,EAAE,CAAC;oBACxB,OAAO,uBAAuB,CAAC,WAAW,EAAE,SAAS,CAEpD,CAAC;gBACJ,CAAC;gBACD,IAAI,CAAC,CAAC,OAAO,IAAI,UAAU,EAAE,CAAC;oBAC5B,OAAO,uBAAuB,CAAC,WAAW,EAAE,SAAS,CAEpD,CAAC;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,uBAAuB,EAAE,CAAC;AACnC,CAAC"}

package/dist/cache/managed-async-cache.browser.test.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/cache/managed-async-cache.browser.test.js

@@ -0,0 +1,50 @@
+/*MIT License
+
+© Copyright 2025 Adobe. All rights reserved.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.*/
+import { createManagedAsyncCache } from "./managed-async-cache.js";
+import { createMemoryAsyncCache } from "./memory-async-cache.js";
+import { describe, expect, it } from "vitest";
+describe("ManagedAsyncCache", () => {
+    it("should retain new data but evict old data", async () => {
+        const optimum = 4;
+        const maximumEntries = optimum * 2;
+        const cache = createManagedAsyncCache(createMemoryAsyncCache(), optimum);
+        const count = 100;
+        for (let i = 0; i < count; i++) {
+            await cache.put(new Request(`key:${i}`), new Response(`value:${i}`));
+        }
+        // make sure we don't exceed maximum keys
+        const keyCount = await cache.getKeyCountForTesting();
+        //  should not store more than maximum keys
+        expect(keyCount <= maximumEntries).toBe(true);
+        // make the last N requests still available.
+        for (let k = 0; k < optimum; k++) {
+            const i = count - 1 - k;
+            const value = await cache.match(new Request(`key:${i}`));
+            expect(value instanceof Response).toBe(true);
+        }
+        //  old keys should return undefined
+        expect(await cache.match(new Request(`key:0`))).toBe(undefined);
+        expect(await cache.match(new Request(`key:1`))).toBe(undefined);
+        expect(await cache.match(new Request(`key:2`))).toBe(undefined);
+    });
+});
+//# sourceMappingURL=managed-async-cache.browser.test.js.map

package/dist/cache/managed-async-cache.browser.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"managed-async-cache.browser.test.js","sourceRoot":"","sources":["../../src/cache/managed-async-cache.browser.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;WAoBW;AACX,OAAO,EAAE,uBAAuB,EAAE,MAAM,0BAA0B,CAAC;AACnE,OAAO,EAAE,sBAAsB,EAAE,MAAM,yBAAyB,CAAC;AACjE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAC;AAE9C,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;IACjC,EAAE,CAAC,2CAA2C,EAAE,KAAK,IAAI,EAAE;QACzD,MAAM,OAAO,GAAG,CAAC,CAAC;QAClB,MAAM,cAAc,GAAG,OAAO,GAAG,CAAC,CAAC;QACnC,MAAM,KAAK,GAAG,uBAAuB,CAAC,sBAAsB,EAAE,EAAE,OAAO,CAAC,CAAC;QACzE,MAAM,KAAK,GAAG,GAAG,CAAC;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,KAAK,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,IAAI,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC;QACvE,CAAC;QAED,yCAAyC;QACzC,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,qBAAqB,EAAE,CAAC;QACrD,2CAA2C;QAC3C,MAAM,CAAC,QAAQ,IAAI,cAAc,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAE9C,4CAA4C;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,MAAM,CAAC,GAAG,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;YACxB,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,KAAK,CAAC,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;YACzD,MAAM,CAAC,KAAK,YAAY,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/C,CAAC;QAED,oCAAoC;QACpC,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAChE,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAChE,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/cache/managed-async-cache.d.ts

@@ -0,0 +1,4 @@
+import type { AsyncCache, AsyncCacheWithKeys } from "./async-cache.js";
+export declare function createManagedAsyncCache(cache: AsyncCacheWithKeys<Request, Response>, optimumEntries: number): AsyncCache<Request, Response> & {
+    getKeyCountForTesting(): Promise<number>;
+};

package/dist/cache/managed-async-cache.js

@@ -0,0 +1,45 @@
+const CREATED_HEADER = "ManagedAsyncCache.Created";
+export function createManagedAsyncCache(cache, optimumEntries) {
+    const maximumEntries = optimumEntries * 2;
+    let putCount = 0;
+    const maybeManageCacheOnPut = async () => {
+        if (putCount++ % optimumEntries === 0) {
+            let keys = [...(await cache.keys())];
+            if (keys.length >= maximumEntries) {
+                // sort by created. ISO date strings are comparable by date
+                keys = keys.sort((a, b) => {
+                    const aheader = a.headers.get(CREATED_HEADER);
+                    const bheader = b.headers.get(CREATED_HEADER);
+                    if (!aheader || !bheader) {
+                        return 0;
+                    }
+                    return aheader.localeCompare(bheader);
+                });
+                while (keys.length > optimumEntries) {
+                    const key = keys.shift();
+                    if (key) {
+                        await cache.delete(key);
+                    }
+                }
+            }
+        }
+    };
+    return {
+        async put(key, value) {
+            // add a created header as metadata to the request
+            key.headers.set(CREATED_HEADER, new Date().toISOString());
+            await cache.put(key, value);
+            await maybeManageCacheOnPut();
+        },
+        async match(key) {
+            return cache.match(key);
+        },
+        async delete(key) {
+            await cache.delete(key);
+        },
+        async getKeyCountForTesting() {
+            return (await cache.keys()).length;
+        },
+    };
+}
+//# sourceMappingURL=managed-async-cache.js.map

package/dist/cache/managed-async-cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"managed-async-cache.js","sourceRoot":"","sources":["../../src/cache/managed-async-cache.ts"],"names":[],"mappings":"AAuBA,MAAM,cAAc,GAAG,2BAA2B,CAAC;AAEnD,MAAM,UAAU,uBAAuB,CACrC,KAA4C,EAC5C,cAAsB;IAItB,MAAM,cAAc,GAAG,cAAc,GAAG,CAAC,CAAC;IAC1C,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,MAAM,qBAAqB,GAAG,KAAK,IAAI,EAAE;QACvC,IAAI,QAAQ,EAAE,GAAG,cAAc,KAAK,CAAC,EAAE,CAAC;YACtC,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACrC,IAAI,IAAI,CAAC,MAAM,IAAI,cAAc,EAAE,CAAC;gBAClC,2DAA2D;gBAC3D,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;oBACxB,MAAM,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;oBAC9C,MAAM,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;oBAC9C,IAAI,CAAC,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;wBACzB,OAAO,CAAC,CAAC;oBACX,CAAC;oBACD,OAAO,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;gBACxC,CAAC,CAAC,CAAC;gBACH,OAAO,IAAI,CAAC,MAAM,GAAG,cAAc,EAAE,CAAC;oBACpC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;oBACzB,IAAI,GAAG,EAAE,CAAC;wBACR,MAAM,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;oBAC1B,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IAEF,OAAO;QACL,KAAK,CAAC,GAAG,CAAC,GAAY,EAAE,KAAe;YACrC,kDAAkD;YAClD,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,cAAc,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC;YAC1D,MAAM,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAC5B,MAAM,qBAAqB,EAAE,CAAC;QAChC,CAAC;QAED,KAAK,CAAC,KAAK,CAAC,GAAY;YACtB,OAAO,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC1B,CAAC;QAED,KAAK,CAAC,MAAM,CAAC,GAAY;YACvB,MAAM,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC1B,CAAC;QAED,KAAK,CAAC,qBAAqB;YACzB,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;QACrC,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/cache/memory-allocator.d.ts

@@ -0,0 +1,23 @@
+import { TypedArray, TypedArrayConstructor } from "../internal/typed-array/index.js";
+import { Observe } from "../observe/types.js";
+export interface MemoryAllocator {
+    /**
+     * An observable event source that notifies when the memory needs to be refreshed.
+     */
+    needsRefresh: Observe<void>;
+    /**
+     * Allocate a new typed array of the specified size.
+     */
+    allocate<T extends TypedArrayConstructor>(typedArray: T, sizeInElements: number): InstanceType<T>;
+    /**
+     * Refresh the given typed array to ensure that it is not detached.
+     * If it is detached a new typed array is created and returned.
+     */
+    refresh<T extends TypedArrayConstructor>(typedArray: InstanceType<T>): InstanceType<T>;
+    /**
+     * Release the memory associated with the given buffer.
+     */
+    release(buffer: TypedArray): void;
+}
+export declare function createSimpleMemoryAllocator(): MemoryAllocator;
+export declare function createWasmMemoryAllocator(memory: WebAssembly.Memory): MemoryAllocator;

package/dist/cache/memory-allocator.js

@@ -0,0 +1,94 @@
+import { createObservableEvent } from "../observe/create-observable-event.js";
+export function createSimpleMemoryAllocator() {
+    return {
+        needsRefresh: () => () => { },
+        allocate(typedArray, sizeInElements) {
+            const sizeInBytes = sizeInElements * typedArray.BYTES_PER_ELEMENT;
+            return new typedArray(new ArrayBuffer(sizeInBytes), 0, sizeInElements);
+        },
+        refresh(typedArray) {
+            return typedArray;
+        },
+        release(_buffer) {
+            return;
+        },
+    };
+}
+const PAGE_SIZE = 64 * 1024; // 64 KB
+export function createWasmMemoryAllocator(memory) {
+    const freeList = [{ offset: 0, size: memory.buffer.byteLength }];
+    const [needsRefresh, notifyNeedsRefresh] = createObservableEvent();
+    const mergeFreeBlocks = () => {
+        // Sort the free list by offset
+        freeList.sort((a, b) => a.offset - b.offset);
+        let i = 0;
+        while (i < freeList.length - 1) {
+            const current = freeList[i];
+            const next = freeList[i + 1];
+            // Check if current block is adjacent to the next
+            if (current.offset + current.size === next.offset) {
+                // Merge the blocks
+                current.size += next.size;
+                // Remove the next block
+                freeList.splice(i + 1, 1);
+            }
+            else {
+                i++;
+            }
+        }
+    };
+    const growMemory = (sizeInBytes) => {
+        const currentSize = memory.buffer.byteLength;
+        const neededPages = Math.ceil(sizeInBytes / PAGE_SIZE); // Each WebAssembly page is 65536 bytes
+        memory.grow(neededPages);
+        freeList.push({
+            offset: currentSize,
+            size: memory.buffer.byteLength - currentSize,
+        });
+        mergeFreeBlocks();
+        notifyNeedsRefresh();
+        return freeList.length - 1;
+    };
+    const allocate = (typedArray, sizeInElements) => {
+        const ALIGNMENT = 16;
+        const sizeInBytes = Math.ceil((sizeInElements * typedArray.BYTES_PER_ELEMENT) / ALIGNMENT) *
+            ALIGNMENT;
+        let index = freeList.findIndex((block) => block.size >= sizeInBytes);
+        if (index === -1) {
+            index = growMemory(sizeInBytes);
+        }
+        const block = freeList[index];
+        freeList.splice(index, 1); // Remove the block from the free list
+        const remainingSize = block.size - sizeInBytes;
+        if (remainingSize > 0) {
+            freeList.push({
+                offset: block.offset + sizeInBytes,
+                size: remainingSize,
+            });
+        }
+        return new typedArray(memory.buffer, block.offset, sizeInElements);
+    };
+    const refresh = (array) => {
+        if (memory.buffer.byteLength !== array.byteLength) {
+            return new array.constructor(memory.buffer, array.byteOffset, array.length);
+        }
+        return array;
+    };
+    const release = (memory) => {
+        if (memory.byteOffset !== undefined) {
+            const newFreeBlock = {
+                offset: memory.byteOffset,
+                size: memory.byteLength,
+            };
+            freeList.push(newFreeBlock);
+            mergeFreeBlocks();
+        }
+    };
+    return {
+        needsRefresh,
+        allocate,
+        refresh,
+        release,
+    };
+}
+//# sourceMappingURL=memory-allocator.js.map

package/dist/cache/memory-allocator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-allocator.js","sourceRoot":"","sources":["../../src/cache/memory-allocator.ts"],"names":[],"mappings":"AAsBA,OAAO,EAAE,qBAAqB,EAAE,MAAM,uCAAuC,CAAC;AA4B9E,MAAM,UAAU,2BAA2B;IACzC,OAAO;QACL,YAAY,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;QAC7B,QAAQ,CACN,UAAa,EACb,cAAsB;YAEtB,MAAM,WAAW,GAAG,cAAc,GAAG,UAAU,CAAC,iBAAiB,CAAC;YAClE,OAAO,IAAI,UAAU,CACnB,IAAI,WAAW,CAAC,WAAW,CAAC,EAC5B,CAAC,EACD,cAAc,CACI,CAAC;QACvB,CAAC;QACD,OAAO,CAAkC,UAA2B;YAClE,OAAO,UAAU,CAAC;QACpB,CAAC;QACD,OAAO,CAAC,OAAmB;YACzB,OAAO;QACT,CAAC;KACF,CAAC;AACJ,CAAC;AAED,MAAM,SAAS,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,QAAQ;AAErC,MAAM,UAAU,yBAAyB,CACvC,MAA0B;IAE1B,MAAM,QAAQ,GAAG,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC;IAEjE,MAAM,CAAC,YAAY,EAAE,kBAAkB,CAAC,GAAG,qBAAqB,EAAQ,CAAC;IAEzE,MAAM,eAAe,GAAG,GAAS,EAAE;QACjC,+BAA+B;QAC/B,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;QAE7C,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC/B,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC7B,iDAAiD;YACjD,IAAI,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC,IAAI,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;gBAClD,mBAAmB;gBACnB,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC;gBAC1B,wBAAwB;gBACxB,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5B,CAAC;iBAAM,CAAC;gBACN,CAAC,EAAE,CAAC;YACN,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IAEF,MAAM,UAAU,GAAG,CAAC,WAAmB,EAAU,EAAE;QACjD,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC;QAC7C,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,GAAG,SAAS,CAAC,CAAC,CAAC,uCAAuC;QAC/F,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACzB,QAAQ,CAAC,IAAI,CAAC;YACZ,MAAM,EAAE,WAAW;YACnB,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,UAAU,GAAG,WAAW;SAC7C,CAAC,CAAC;QACH,eAAe,EAAE,CAAC;QAClB,kBAAkB,EAAE,CAAC;QACrB,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;IAC7B,CAAC,CAAC;IAEF,MAAM,QAAQ,GAAG,CACf,UAAiC,EACjC,cAAsB,EACL,EAAE;QACnB,MAAM,SAAS,GAAG,EAAE,CAAC;QACrB,MAAM,WAAW,GACf,IAAI,CAAC,IAAI,CAAC,CAAC,cAAc,GAAG,UAAU,CAAC,iBAAiB,CAAC,GAAG,SAAS,CAAC;YACtE,SAAS,CAAC;QACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,IAAI,WAAW,CAAC,CAAC;QACrE,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;YACjB,KAAK,GAAG,UAAU,CAAC,WAAW,CAAC,CAAC;QAClC,CAAC;QAED,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC9B,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,sCAAsC;QACjE,MAAM,aAAa,GAAG,KAAK,CAAC,IAAI,GAAG,WAAW,CAAC;QAC/C,IAAI,aAAa,GAAG,CAAC,EAAE,CAAC;YACtB,QAAQ,CAAC,IAAI,CAAC;gBACZ,MAAM,EAAE,KAAK,CAAC,MAAM,GAAG,WAAW;gBAClC,IAAI,EAAE,aAAa;aACpB,CAAC,CAAC;QACL,CAAC;QAED,OAAO,IAAI,UAAU,CACnB,MAAM,CAAC,MAAM,EACb,KAAK,CAAC,MAAM,EACZ,cAAc,CACI,CAAC;IACvB,CAAC,CAAC;IAEF,MAAM,OAAO,GAAG,CACd,KAAsB,EACL,EAAE;QACnB,IAAI,MAAM,CAAC,MAAM,CAAC,UAAU,KAAK,KAAK,CAAC,UAAU,EAAE,CAAC;YAClD,OAAO,IAAK,KAAK,CAAC,WAAmB,CACnC,MAAM,CAAC,MAAM,EACb,KAAK,CAAC,UAAU,EAChB,KAAK,CAAC,MAAM,CACb,CAAC;QACJ,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC,CAAC;IAEF,MAAM,OAAO,GAAG,CAAC,MAAkB,EAAQ,EAAE;QAC3C,IAAI,MAAM,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;YACpC,MAAM,YAAY,GAAG;gBACnB,MAAM,EAAE,MAAM,CAAC,UAAU;gBACzB,IAAI,EAAE,MAAM,CAAC,UAAU;aACxB,CAAC;YACF,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAC5B,eAAe,EAAE,CAAC;QACpB,CAAC;IACH,CAAC,CAAC;IAEF,OAAO;QACL,YAAY;QACZ,QAAQ;QACR,OAAO;QACP,OAAO;KACR,CAAC;AACJ,CAAC"}

package/dist/cache/memory-async-cache.d.ts

@@ -0,0 +1,6 @@
+import type { AsyncCacheWithKeys } from "./async-cache.js";
+/**
+ * This should never be used directly as it will never free cache entries making it leak memory.
+ * It should only ever be used as a base cache inside of a ManagedAsyncCache.
+ */
+export declare function createMemoryAsyncCache(): AsyncCacheWithKeys<Request, Response>;

package/dist/cache/memory-async-cache.js

@@ -0,0 +1,23 @@
+/**
+ * This should never be used directly as it will never free cache entries making it leak memory.
+ * It should only ever be used as a base cache inside of a ManagedAsyncCache.
+ */
+export function createMemoryAsyncCache() {
+    const cache = new Map();
+    return {
+        put(key, value) {
+            cache.set(key.url, [key, value.clone()]);
+            return Promise.resolve();
+        },
+        match(key) {
+            return Promise.resolve(cache.get(key.url)?.[1]?.clone());
+        },
+        async delete(key) {
+            await Promise.resolve(cache.delete(key.url));
+        },
+        keys() {
+            return Promise.resolve([...cache.values()].map((value) => value[0]));
+        },
+    };
+}
+//# sourceMappingURL=memory-async-cache.js.map

package/dist/cache/memory-async-cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-async-cache.js","sourceRoot":"","sources":["../../src/cache/memory-async-cache.ts"],"names":[],"mappings":"AAuBA;;;GAGG;AACH,MAAM,UAAU,sBAAsB;IAIpC,MAAM,KAAK,GAAG,IAAI,GAAG,EAA+B,CAAC;IACrD,OAAO;QACL,GAAG,CAAC,GAAY,EAAE,KAAe;YAC/B,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACzC,OAAO,OAAO,CAAC,OAAO,EAAE,CAAC;QAC3B,CAAC;QAED,KAAK,CAAC,GAAY;YAChB,OAAO,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;QAC3D,CAAC;QAED,KAAK,CAAC,MAAM,CAAC,GAAY;YACvB,MAAM,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,CAAC;QAED,IAAI;YACF,OAAO,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvE,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/core/data.d.ts

@@ -0,0 +1,22 @@
+/**
+ * Data is readonly JSON.
+ * This type forms the foundation for all of our internal state models and interfaces to external APIs.
+ * It is easy to serialize/deserialize/compare/hash/cache and validate (with JSON-Schema).
+ * These traits make it an ideal foundation for building a robust state engine which cannot enter into invalid states.
+ * It also allows us to strongly define contracts between our application and external services.
+ * Validation of input arguments and output results allows strict enforcement of agreed upon contracts.
+ */
+export type Data = string | number | boolean | null | undefined | ReadonlyArray<Data> | {
+    readonly [K in string]?: Data;
+};
+/**
+ * Compares two Data objects for deep equality.
+ * Ordering of keys matters.
+ * If order is not important then use normalize first.
+ */
+export declare function equals(a?: unknown, b?: unknown): boolean;
+/**
+ * Returns a new normalized object of the same type by
+ * recursively sorting any contained objects keys alphabetically.
+ */
+export declare function normalize<D>(d: D): D;

package/dist/core/data.js

@@ -0,0 +1,52 @@
+/*MIT License
+
+© Copyright 2025 Adobe. All rights reserved.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.*/
+/**
+ * Compares two Data objects for deep equality.
+ * Ordering of keys matters.
+ * If order is not important then use normalize first.
+ */
+export function equals(a, b) {
+    if (a === b) {
+        return true;
+    }
+    if (!a || !b) {
+        return false;
+    }
+    return JSON.stringify(a) === JSON.stringify(b);
+}
+/**
+ * Returns a new normalized object of the same type by
+ * recursively sorting any contained objects keys alphabetically.
+ */
+export function normalize(d) {
+    //  we could structured clone but let's explicitly shed any keys with undefined values.
+    return JSON.parse(JSON.stringify(d), (_key, value) => {
+        if (value && !Array.isArray(value) && typeof value === "object") {
+            return Object.fromEntries(Object.entries(value).sort(([a], [b]) => 
+            //  not using String.localeCompare
+            //  we want this consistent no matter locale
+            a < b ? -1 : a > b ? 1 : 0));
+        }
+        return value;
+    });
+}
+//# sourceMappingURL=data.js.map

package/dist/core/data.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"data.js","sourceRoot":"","sources":["../../src/core/data.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;WAoBW;AAmBX;;;;GAIG;AACH,MAAM,UAAU,MAAM,CAAC,CAAW,EAAE,CAAW;IAC7C,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;QACb,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;AACjD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,SAAS,CAAI,CAAI;IAC/B,uFAAuF;IACvF,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,IAAY,EAAE,KAAc,EAAE,EAAE;QACpE,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YAChE,OAAO,MAAM,CAAC,WAAW,CACvB,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE;YACtC,kCAAkC;YAClC,4CAA4C;YAC5C,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAC3B,CACF,CAAC;QACJ,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/core/data.test.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/core/data.test.js

@@ -0,0 +1,48 @@
+/*MIT License
+
+© Copyright 2025 Adobe. All rights reserved.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.*/
+import { normalize } from "./data.js";
+import { describe, expect, it } from "vitest";
+describe("Data.normalize", () => {
+    it("should sort object keys alphabetically", () => {
+        expect(normalize({ b: 1, a: 2, c: null })).toEqual({
+            a: 2,
+            b: 1,
+            c: null,
+        });
+        expect(normalize([{ A: [], b: 1, a: 2 }])).toEqual([{ a: 2, A: [], b: 1 }]);
+        expect(normalize([[{ b: 1, a: 2 }]])).toEqual([[{ a: 2, b: 1 }]]);
+        expect(normalize({ z: [[{ b: 1, a: 2 }]], q: 10 })).toEqual({
+            q: 10,
+            z: [[{ a: 2, b: 1 }]],
+        });
+    });
+    it("should remove undefined values", () => {
+        expect(normalize({ b: 1, a: 2, value: undefined })).toEqual({
+            a: 2,
+            b: 1,
+        });
+        expect(normalize([{ b: 1, a: 2, value: undefined }])).toEqual([
+            { a: 2, b: 1 },
+        ]);
+    });
+});
+//# sourceMappingURL=data.test.js.map

package/dist/core/data.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"data.test.js","sourceRoot":"","sources":["../../src/core/data.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;WAoBW;AACX,OAAO,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AACtC,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAC;AAE9C,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;IAC9B,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;YACjD,CAAC,EAAE,CAAC;YACJ,CAAC,EAAE,CAAC;YACJ,CAAC,EAAE,IAAI;SACR,CAAC,CAAC;QACH,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5E,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAClE,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;YAC1D,CAAC,EAAE,EAAE;YACL,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SACtB,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;YAC1D,CAAC,EAAE,CAAC;YACJ,CAAC,EAAE,CAAC;SACL,CAAC,CAAC;QACH,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;YAC5D,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;SACf,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/core/functions/array-equals.d.ts

@@ -0,0 +1 @@
+export declare function arrayEquals(a: unknown[], b: unknown[]): boolean;

package/dist/core/functions/array-equals.js

@@ -0,0 +1,34 @@
+/*MIT License
+
+© Copyright 2025 Adobe. All rights reserved.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.*/
+export function arrayEquals(a, b) {
+    const length = a.length;
+    if (length !== b.length) {
+        return false;
+    }
+    for (let i = 0; i < length; i++) {
+        if (a[i] !== b[i]) {
+            return false;
+        }
+    }
+    return true;
+}
+//# sourceMappingURL=array-equals.js.map

package/dist/core/functions/array-equals.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-equals.js","sourceRoot":"","sources":["../../../src/core/functions/array-equals.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;WAoBW;AAEX,MAAM,UAAU,WAAW,CAAC,CAAY,EAAE,CAAY;IACpD,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;IACxB,IAAI,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QACxB,OAAO,KAAK,CAAC;IACf,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAClB,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}