@adobe/data 0.2.0 → 0.2.2

package/dist/cache/expiring-data-cache.js

@@ -0,0 +1,49 @@
+/*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.*/
+/**
+ * Creates a new expiring data cache with the specified underlying cache.
+ */
+export function createExpiringDataCache(baseCache, getTime = () => Date.now()) {
+    const cache = baseCache;
+    return {
+        async match(key) {
+            const entry = await cache.match(key);
+            if (!entry) {
+                return undefined;
+            }
+            if (entry.expiration != null && entry.expiration <= getTime()) {
+                await cache.delete(key);
+                return undefined;
+            }
+            return entry.value;
+        },
+        async put(key, value, options) {
+            const { maximumDuration: maxDuration } = options || {};
+            const expiration = (maxDuration !== undefined) && maxDuration >= 0 ? getTime() + maxDuration : null;
+            await cache.put(key, { value, expiration });
+        },
+        async delete(key) {
+            await cache.delete(key);
+        },
+    };
+}
+//# sourceMappingURL=expiring-data-cache.js.map

package/dist/cache/expiring-data-cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"expiring-data-cache.js","sourceRoot":"","sources":["../../src/cache/expiring-data-cache.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;WAoBW;AAUX;;GAEG;AACH,MAAM,UAAU,uBAAuB,CACrC,SAAkC,EAClC,OAAO,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE;IAE1B,MAAM,KAAK,GAAG,SAA6D,CAAC;IAC5E,OAAO;QACL,KAAK,CAAC,KAAK,CAAC,GAAM;YAChB,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACrC,IAAI,CAAC,KAAK,EAAE,CAAC;gBACX,OAAO,SAAS,CAAC;YACnB,CAAC;YACD,IAAI,KAAK,CAAC,UAAU,IAAI,IAAI,IAAI,KAAK,CAAC,UAAU,IAAI,OAAO,EAAE,EAAE,CAAC;gBAC9D,MAAM,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACxB,OAAO,SAAS,CAAC;YACnB,CAAC;YACD,OAAO,KAAK,CAAC,KAAK,CAAC;QACrB,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,GAAM,EAAE,KAAQ,EAAE,OAAO;YACjC,MAAM,EAAE,eAAe,EAAE,WAAW,EAAE,GAAG,OAAO,IAAI,EAAE,CAAC;YACvD,MAAM,UAAU,GACd,CAAC,WAAW,KAAK,SAAS,CAAC,IAAI,WAAW,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC;YACnF,MAAM,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,CAAC;QAC9C,CAAC;QACD,KAAK,CAAC,MAAM,CAAC,GAAM;YACjB,MAAM,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC1B,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/cache/expiring-data-cache.test.d.ts

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

package/dist/cache/expiring-data-cache.test.js

@@ -0,0 +1,62 @@
+/*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 { createExpiringDataCache } from "./expiring-data-cache.js"; // Adjust the import path as necessary
+import { describe, expect, it } from "vitest";
+import { createDataCache } from "./data-cache.js";
+import { getManagedPersistentCache } from "./get-persistent-cache.js";
+describe("ExpiringDataCache", () => {
+    it("should store and retrieve an item before it expires", async () => {
+        const time = Date.now();
+        let timePassed = 0;
+        const getTime = () => time + timePassed;
+        const cache = createExpiringDataCache(createDataCache(await getManagedPersistentCache("expiring-data-cache-test", {
+            maximumMemoryEntries: 10,
+            maximumStorageEntries: 100,
+        })), getTime);
+        cache.put("key1", "value1", { maximumDuration: 1000 }); // Expires in 1000ms
+        expect(await cache.match("key1")).toBe("value1");
+        timePassed = 500;
+        expect(await cache.match("key1")).toBe("value1");
+        timePassed = 999;
+        expect(await cache.match("key1")).toBe("value1");
+        timePassed = 1000;
+        expect(await cache.match("key1")).toBeUndefined();
+        timePassed = 1001;
+        expect(await cache.match("key1")).toBeUndefined();
+        timePassed = 2000;
+        expect(await cache.match("key1")).toBeUndefined();
+    });
+    it("should immediately expire items when maximumDuration is 0", async () => {
+        const time = Date.now();
+        let timePassed = 0;
+        const getTime = () => time + timePassed;
+        const cache = createExpiringDataCache(createDataCache(await getManagedPersistentCache("expiring-data-cache-test", {
+            maximumMemoryEntries: 10,
+            maximumStorageEntries: 100,
+        })), getTime);
+        cache.put("key1", "value1", { maximumDuration: 0 }); // Expires immediately
+        expect(await cache.match("key1")).toBeUndefined();
+        timePassed = 1000;
+        expect(await cache.match("key1")).toBeUndefined();
+    });
+});
+//# sourceMappingURL=expiring-data-cache.test.js.map

package/dist/cache/expiring-data-cache.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"expiring-data-cache.test.js","sourceRoot":"","sources":["../../src/cache/expiring-data-cache.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;WAoBW;AACX,OAAO,EAAE,uBAAuB,EAAE,MAAM,0BAA0B,CAAC,CAAC,sCAAsC;AAC1G,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAClD,OAAO,EAAE,yBAAyB,EAAE,MAAM,2BAA2B,CAAC;AAEtE,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;IACjC,EAAE,CAAC,qDAAqD,EAAE,KAAK,IAAI,EAAE;QACnE,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACxB,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,MAAM,OAAO,GAAG,GAAG,EAAE,CAAC,IAAI,GAAG,UAAU,CAAC;QACxC,MAAM,KAAK,GAAG,uBAAuB,CACnC,eAAe,CACb,MAAM,yBAAyB,CAAC,0BAA0B,EAAE;YAC1D,oBAAoB,EAAE,EAAE;YACxB,qBAAqB,EAAE,GAAG;SAC3B,CAAC,CACH,EACD,OAAO,CACR,CAAC;QAEF,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,eAAe,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,oBAAoB;QAC5E,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAEjD,UAAU,GAAG,GAAG,CAAC;QACjB,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAEjD,UAAU,GAAG,GAAG,CAAC;QACjB,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAEjD,UAAU,GAAG,IAAI,CAAC;QAClB,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;QAElD,UAAU,GAAG,IAAI,CAAC;QAClB,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;QAElD,UAAU,GAAG,IAAI,CAAC;QAClB,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2DAA2D,EAAE,KAAK,IAAI,EAAE;QACzE,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACxB,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,MAAM,OAAO,GAAG,GAAG,EAAE,CAAC,IAAI,GAAG,UAAU,CAAC;QACxC,MAAM,KAAK,GAAG,uBAAuB,CACnC,eAAe,CACb,MAAM,yBAAyB,CAAC,0BAA0B,EAAE;YAC1D,oBAAoB,EAAE,EAAE;YACxB,qBAAqB,EAAE,GAAG;SAC3B,CAAC,CACH,EACD,OAAO,CACR,CAAC;QAEF,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,eAAe,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,sBAAsB;QAC3E,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;QAElD,UAAU,GAAG,IAAI,CAAC;QAClB,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;IACpD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

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

@@ -0,0 +1,7 @@
+import { type AsyncCache } from "./async-cache.js";
+/**
+ * Provides a combined cache interface.
+ * Writes to both caches.
+ * Prefers to read from the faster cache first before falling back to slower.
+ */
+export declare function createFallbackAsyncCache(fasterSmaller: AsyncCache<Request, Response>, slowerLarger: AsyncCache<Request, Response>): AsyncCache<Request, Response>;

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

@@ -0,0 +1,22 @@
+/**
+ * Provides a combined cache interface.
+ * Writes to both caches.
+ * Prefers to read from the faster cache first before falling back to slower.
+ */
+export function createFallbackAsyncCache(fasterSmaller, slowerLarger) {
+    return {
+        async put(key, value) {
+            await Promise.all([
+                fasterSmaller.put(key, value),
+                slowerLarger.put(key, value),
+            ]);
+        },
+        async match(key) {
+            return ((await fasterSmaller.match(key)) ?? (await slowerLarger.match(key)));
+        },
+        async delete(key) {
+            await Promise.all([fasterSmaller.delete(key), slowerLarger.delete(key)]);
+        },
+    };
+}
+//# sourceMappingURL=fallback-async-cache.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"fallback-async-cache.js","sourceRoot":"","sources":["../../src/cache/fallback-async-cache.ts"],"names":[],"mappings":"AAuBA;;;;GAIG;AACH,MAAM,UAAU,wBAAwB,CACtC,aAA4C,EAC5C,YAA2C;IAE3C,OAAO;QACL,KAAK,CAAC,GAAG,CAAC,GAAY,EAAE,KAAe;YACrC,MAAM,OAAO,CAAC,GAAG,CAAC;gBAChB,aAAa,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC;gBAC7B,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC;aAC7B,CAAC,CAAC;QACL,CAAC;QACD,KAAK,CAAC,KAAK,CAAC,GAAY;YACtB,OAAO,CACL,CAAC,MAAM,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,YAAY,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CACpE,CAAC;QACJ,CAAC;QACD,KAAK,CAAC,MAAM,CAAC,GAAY;YACvB,MAAM,OAAO,CAAC,GAAG,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,YAAY,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3E,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/cache/functions/async-data-function.d.ts

@@ -0,0 +1 @@
+export type AsyncDataFunction<InputArgs extends Array<unknown>, Output> = (...args: InputArgs) => Promise<Output>;

package/dist/cache/functions/async-data-function.js

@@ -0,0 +1,23 @@
+/*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 {};
+//# sourceMappingURL=async-data-function.js.map

package/dist/cache/functions/async-data-function.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"async-data-function.js","sourceRoot":"","sources":["../../../src/cache/functions/async-data-function.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;WAoBW"}

package/dist/cache/functions/bind-functions.d.ts

@@ -0,0 +1,6 @@
+/**
+ * Binds all functions to the object containing them.
+ * @param obj
+ * @returns
+ */
+export declare function bindFunctions<T extends object>(obj: T): void;

package/dist/cache/functions/bind-functions.js

@@ -0,0 +1,33 @@
+/*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.*/
+/**
+ * Binds all functions to the object containing them.
+ * @param obj
+ * @returns
+ */
+export function bindFunctions(obj) {
+    for (const key in obj) {
+        // eslint-disable-next-line @typescript-eslint/no-explicit-any -- need to bind functions
+        obj[key] = obj[key].bind(obj);
+    }
+}
+//# sourceMappingURL=bind-functions.js.map

package/dist/cache/functions/bind-functions.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bind-functions.js","sourceRoot":"","sources":["../../../src/cache/functions/bind-functions.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;WAoBW;AACX;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAmB,GAAM;IAEpD,KAAK,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;QACtB,wFAAwF;QACxF,GAAG,CAAC,GAAG,CAAC,GAAI,GAAG,CAAC,GAAG,CAAiB,CAAC,IAAI,CAAC,GAAG,CAAQ,CAAC;IACxD,CAAC;AACH,CAAC"}

package/dist/cache/functions/functions.test.d.ts

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

package/dist/cache/functions/functions.test.js

@@ -0,0 +1,79 @@
+/*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 { memoize } from "./memoize.js";
+import { preventParallelExecution } from "./prevent-parallel-execution.js";
+import { describe, expect, it } from "vitest";
+describe("Function", () => {
+    describe("prevent parallel execution", () => {
+        it("should block parallel execution and return same promise", async () => {
+            let addCallCount = 0;
+            async function add(a, b) {
+                addCallCount++;
+                return new Promise((resolve) => {
+                    setTimeout(() => {
+                        resolve(a + b);
+                    }, 100);
+                });
+            }
+            async function testAddBlocksParallelExecution(addFn) {
+                addCallCount = 0;
+                const promises = [addFn(1, 2), addFn(1, 2), addFn(1, 2)];
+                const results = await Promise.all(promises);
+                expect(results).toEqual([3, 3, 3]);
+            }
+            const addFn = preventParallelExecution(add);
+            await testAddBlocksParallelExecution(addFn);
+            // after all have completed... then another can execute
+            addCallCount = 0;
+            expect(await addFn(1, 2)).toEqual(3);
+            expect(addCallCount).toEqual(1);
+        });
+    });
+    describe("memoize", () => {
+        it("should block parallel execution and return same promise", async () => {
+            let addCallCount = 0;
+            async function add(a, b) {
+                addCallCount++;
+                return new Promise((resolve) => {
+                    setTimeout(() => {
+                        resolve(a + b);
+                    }, 100);
+                });
+            }
+            async function testAddBlocksParallelExecution(addFn) {
+                addCallCount = 0;
+                const promises = [addFn(1, 2), addFn(1, 2), addFn(1, 2)];
+                const results = await Promise.all(promises);
+                expect(results).toEqual([3, 3, 3]);
+            }
+            //  now memoize the addFn and verify that it is cached.
+            const addFn = memoize("addFn-v1", add);
+            await testAddBlocksParallelExecution(addFn);
+            // after all have completed... then another can execute
+            addCallCount = 0;
+            expect(await addFn(1, 2)).toEqual(3);
+            // with memoize, the count should be 0 because we get a cached result.
+            expect(addCallCount).toEqual(0);
+        });
+    });
+});
+//# sourceMappingURL=functions.test.js.map

package/dist/cache/functions/functions.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"functions.test.js","sourceRoot":"","sources":["../../../src/cache/functions/functions.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;WAoBW;AACX,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACvC,OAAO,EAAE,wBAAwB,EAAE,MAAM,iCAAiC,CAAC;AAC3E,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAC;AAE9C,QAAQ,CAAC,UAAU,EAAE,GAAG,EAAE;IACxB,QAAQ,CAAC,4BAA4B,EAAE,GAAG,EAAE;QAC1C,EAAE,CAAC,yDAAyD,EAAE,KAAK,IAAI,EAAE;YACvE,IAAI,YAAY,GAAG,CAAC,CAAC;YACrB,KAAK,UAAU,GAAG,CAAC,CAAS,EAAE,CAAS;gBACrC,YAAY,EAAE,CAAC;gBACf,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;oBAC7B,UAAU,CAAC,GAAG,EAAE;wBACd,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACjB,CAAC,EAAE,GAAG,CAAC,CAAC;gBACV,CAAC,CAAC,CAAC;YACL,CAAC;YAED,KAAK,UAAU,8BAA8B,CAAC,KAAiB;gBAC7D,YAAY,GAAG,CAAC,CAAC;gBACjB,MAAM,QAAQ,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACzD,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAC5C,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACrC,CAAC;YAED,MAAM,KAAK,GAAG,wBAAwB,CAAC,GAAG,CAAC,CAAC;YAC5C,MAAM,8BAA8B,CAAC,KAAK,CAAC,CAAC;YAC5C,uDAAuD;YACvD,YAAY,GAAG,CAAC,CAAC;YACjB,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;QACvB,EAAE,CAAC,yDAAyD,EAAE,KAAK,IAAI,EAAE;YACvE,IAAI,YAAY,GAAG,CAAC,CAAC;YACrB,KAAK,UAAU,GAAG,CAAC,CAAS,EAAE,CAAS;gBACrC,YAAY,EAAE,CAAC;gBACf,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;oBAC7B,UAAU,CAAC,GAAG,EAAE;wBACd,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACjB,CAAC,EAAE,GAAG,CAAC,CAAC;gBACV,CAAC,CAAC,CAAC;YACL,CAAC;YAED,KAAK,UAAU,8BAA8B,CAAC,KAAiB;gBAC7D,YAAY,GAAG,CAAC,CAAC;gBACjB,MAAM,QAAQ,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACzD,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAC5C,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACrC,CAAC;YAED,uDAAuD;YACvD,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC;YACvC,MAAM,8BAA8B,CAAC,KAAK,CAAC,CAAC;YAC5C,uDAAuD;YACvD,YAAY,GAAG,CAAC,CAAC;YACjB,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACrC,sEAAsE;YACtE,MAAM,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/cache/functions/get-cached.d.ts

@@ -0,0 +1,11 @@
+/**
+ * Gets a cached value for an object using a factory function.
+ * If the value hasn't been cached yet, the factory function will be called to create it.
+ * The cache is stored on the object itself using a WeakMap, allowing for garbage collection
+ * when the object is no longer referenced.
+ *
+ * @param context The object to cache the value on
+ * @param factory A function that creates the value to be cached
+ * @returns The cached value or a newly created value from the factory
+ */
+export declare function getCached<A extends object, B>(context: A, factory: (obj: A) => B): B;

package/dist/cache/functions/get-cached.js

@@ -0,0 +1,49 @@
+/*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.*/
+// Create a WeakMap to store cached values for each object
+const cache = new WeakMap();
+/**
+ * Gets a cached value for an object using a factory function.
+ * If the value hasn't been cached yet, the factory function will be called to create it.
+ * The cache is stored on the object itself using a WeakMap, allowing for garbage collection
+ * when the object is no longer referenced.
+ *
+ * @param context The object to cache the value on
+ * @param factory A function that creates the value to be cached
+ * @returns The cached value or a newly created value from the factory
+ */
+export function getCached(context, factory) {
+    // Get or create the factory map for this object
+    let factoryMap = cache.get(context);
+    if (!factoryMap) {
+        factoryMap = new Map();
+        cache.set(context, factoryMap);
+    }
+    // Get or create the cached value for this factory
+    let value = factoryMap.get(factory);
+    if (value === undefined) {
+        value = factory(context);
+        factoryMap.set(factory, value);
+    }
+    return value;
+}
+//# sourceMappingURL=get-cached.js.map

package/dist/cache/functions/get-cached.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-cached.js","sourceRoot":"","sources":["../../../src/cache/functions/get-cached.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;WAoBW;AAEX,0DAA0D;AAC1D,MAAM,KAAK,GAAG,IAAI,OAAO,EAAkC,CAAC;AAE5D;;;;;;;;;GASG;AACH,MAAM,UAAU,SAAS,CACrB,OAAU,EACV,OAAsB;IAEtB,gDAAgD;IAChD,IAAI,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAiC,CAAC;IACpE,IAAI,CAAC,UAAU,EAAE,CAAC;QACd,UAAU,GAAG,IAAI,GAAG,EAAE,CAAC;QACvB,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;IACnC,CAAC;IAED,kDAAkD;IAClD,IAAI,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACpC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACtB,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;QACzB,UAAU,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IACnC,CAAC;IAED,OAAO,KAAK,CAAC;AACjB,CAAC"}

package/dist/cache/functions/get-cached.test.d.ts

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

package/dist/cache/functions/get-cached.test.js

@@ -0,0 +1,96 @@
+/*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 { getCached } from "./get-cached.js";
+import { describe, expect, it } from "vitest";
+describe("getCached", () => {
+    it("should cache values on objects", () => {
+        const obj = { id: 1 };
+        let factoryCallCount = 0;
+        const factory = (o) => {
+            factoryCallCount++;
+            return { computed: o.id * 2 };
+        };
+        // First call should invoke factory
+        const result1 = getCached(obj, factory);
+        expect(result1).toEqual({ computed: 2 });
+        expect(factoryCallCount).toBe(1);
+        // Second call should use cached value
+        const result2 = getCached(obj, factory);
+        expect(result2).toEqual({ computed: 2 });
+        expect(factoryCallCount).toBe(1);
+    });
+    it("should cache different values for different objects", () => {
+        const obj1 = { id: 1 };
+        const obj2 = { id: 2 };
+        let factoryCallCount = 0;
+        const factory = (o) => {
+            factoryCallCount++;
+            return { computed: o.id * 2 };
+        };
+        // Call for first object
+        const result1 = getCached(obj1, factory);
+        expect(result1).toEqual({ computed: 2 });
+        expect(factoryCallCount).toBe(1);
+        // Call for second object should invoke factory again
+        const result2 = getCached(obj2, factory);
+        expect(result2).toEqual({ computed: 4 });
+        expect(factoryCallCount).toBe(2);
+    });
+    it("should cache different values for different factories on same object", () => {
+        const obj = { id: 1 };
+        let factory1CallCount = 0;
+        let factory2CallCount = 0;
+        const factory1 = (o) => {
+            factory1CallCount++;
+            return { computed: o.id * 2 };
+        };
+        const factory2 = (o) => {
+            factory2CallCount++;
+            return { computed: o.id * 3 };
+        };
+        // Call first factory
+        const result1 = getCached(obj, factory1);
+        expect(result1).toEqual({ computed: 2 });
+        expect(factory1CallCount).toBe(1);
+        expect(factory2CallCount).toBe(0);
+        // Call second factory
+        const result2 = getCached(obj, factory2);
+        expect(result2).toEqual({ computed: 3 });
+        expect(factory1CallCount).toBe(1);
+        expect(factory2CallCount).toBe(1);
+    });
+    it("should handle primitive values", () => {
+        const obj = { id: 1 };
+        let factoryCallCount = 0;
+        const factory = (o) => {
+            factoryCallCount++;
+            return o.id * 2;
+        };
+        const result1 = getCached(obj, factory);
+        expect(result1).toBe(2);
+        expect(factoryCallCount).toBe(1);
+        const result2 = getCached(obj, factory);
+        expect(result2).toBe(2);
+        expect(factoryCallCount).toBe(1);
+    });
+});
+//# sourceMappingURL=get-cached.test.js.map

package/dist/cache/functions/get-cached.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-cached.test.js","sourceRoot":"","sources":["../../../src/cache/functions/get-cached.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;WAoBW;AAEX,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAC5C,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAC;AAE9C,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;IACvB,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;QACtC,MAAM,GAAG,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;QACtB,IAAI,gBAAgB,GAAG,CAAC,CAAC;QAEzB,MAAM,OAAO,GAAG,CAAC,CAAa,EAAE,EAAE;YAC9B,gBAAgB,EAAE,CAAC;YACnB,OAAO,EAAE,QAAQ,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;QAClC,CAAC,CAAC;QAEF,mCAAmC;QACnC,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QACxC,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;QACzC,MAAM,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAEjC,sCAAsC;QACtC,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QACxC,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;QACzC,MAAM,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qDAAqD,EAAE,GAAG,EAAE;QAC3D,MAAM,IAAI,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;QACvB,IAAI,gBAAgB,GAAG,CAAC,CAAC;QAEzB,MAAM,OAAO,GAAG,CAAC,CAAc,EAAE,EAAE;YAC/B,gBAAgB,EAAE,CAAC;YACnB,OAAO,EAAE,QAAQ,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;QAClC,CAAC,CAAC;QAEF,wBAAwB;QACxB,MAAM,OAAO,GAAG,SAAS,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACzC,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;QACzC,MAAM,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAEjC,qDAAqD;QACrD,MAAM,OAAO,GAAG,SAAS,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACzC,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;QACzC,MAAM,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sEAAsE,EAAE,GAAG,EAAE;QAC5E,MAAM,GAAG,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;QACtB,IAAI,iBAAiB,GAAG,CAAC,CAAC;QAC1B,IAAI,iBAAiB,GAAG,CAAC,CAAC;QAE1B,MAAM,QAAQ,GAAG,CAAC,CAAa,EAAE,EAAE;YAC/B,iBAAiB,EAAE,CAAC;YACpB,OAAO,EAAE,QAAQ,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;QAClC,CAAC,CAAC;QAEF,MAAM,QAAQ,GAAG,CAAC,CAAa,EAAE,EAAE;YAC/B,iBAAiB,EAAE,CAAC;YACpB,OAAO,EAAE,QAAQ,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;QAClC,CAAC,CAAC;QAEF,qBAAqB;QACrB,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QACzC,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;QACzC,MAAM,CAAC,iBAAiB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,CAAC,iBAAiB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAElC,sBAAsB;QACtB,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QACzC,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;QACzC,MAAM,CAAC,iBAAiB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,CAAC,iBAAiB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;QACtC,MAAM,GAAG,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;QACtB,IAAI,gBAAgB,GAAG,CAAC,CAAC;QAEzB,MAAM,OAAO,GAAG,CAAC,CAAa,EAAE,EAAE;YAC9B,gBAAgB,EAAE,CAAC;YACnB,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACpB,CAAC,CAAC;QAEF,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QACxC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAEjC,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QACxC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;AACP,CAAC,CAAC,CAAC"}

package/dist/cache/functions/hashing/blob-to-hash.d.ts

@@ -0,0 +1,4 @@
+/**
+ * Converts a Blob to a hash using the blob content and type using SHA-256.
+ */
+export declare function blobToHash(blob: Blob): Promise<string>;

package/dist/cache/functions/hashing/blob-to-hash.js

@@ -0,0 +1,44 @@
+/*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 { bufferToHash } from "./buffer-to-hash.js";
+/**
+ * Converts a Blob to a hash using the blob content and type using SHA-256.
+ */
+export async function blobToHash(blob) {
+    const { type } = blob;
+    //  create a single buffer to hold both the type and the blob
+    const typeByteLength = type.length * 2;
+    const buffer = new ArrayBuffer(typeByteLength + blob.size);
+    //  write the type into the first part of the buffer
+    const charView = new Uint16Array(buffer, 0, type.length);
+    for (let i = 0, strLen = type.length; i < strLen; i++) {
+        charView[i] = type.charCodeAt(i);
+    }
+    //  write the blob into the second part of the buffer
+    const byteView = new Uint8Array(buffer);
+    const blobArrayBuffer = await blob.arrayBuffer();
+    byteView.set(new Uint8Array(blobArrayBuffer), typeByteLength);
+    //  finally create the hash off the combined buffer
+    const hash = await bufferToHash(buffer);
+    return hash;
+}
+//# sourceMappingURL=blob-to-hash.js.map

package/dist/cache/functions/hashing/blob-to-hash.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"blob-to-hash.js","sourceRoot":"","sources":["../../../../src/cache/functions/hashing/blob-to-hash.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;WAoBW;AACX,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAEnD;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAAC,IAAU;IACzC,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;IACtB,6DAA6D;IAC7D,MAAM,cAAc,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IACvC,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,cAAc,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;IAE3D,oDAAoD;IACpD,MAAM,QAAQ,GAAG,IAAI,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtD,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC;IACD,qDAAqD;IACrD,MAAM,QAAQ,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;IACxC,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,WAAW,EAAE,CAAC;IACjD,QAAQ,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC,eAAe,CAAC,EAAE,cAAc,CAAC,CAAC;IAE9D,mDAAmD;IACnD,MAAM,IAAI,GAAG,MAAM,YAAY,CAAC,MAAM,CAAC,CAAC;IACxC,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/cache/functions/hashing/buffer-to-hash.d.ts

@@ -0,0 +1,4 @@
+/**
+ * Converts an ArrayBuffer to a hash using SHA-256.
+ */
+export declare function bufferToHash(buffer: ArrayBuffer): Promise<string>;

package/dist/cache/functions/hashing/buffer-to-hash.js

@@ -0,0 +1,33 @@
+/*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.*/
+function arrayBufferToHex(buffer) {
+    return [...new Uint8Array(buffer)]
+        .map((x) => x.toString(16).padStart(2, "0"))
+        .join("");
+}
+/**
+ * Converts an ArrayBuffer to a hash using SHA-256.
+ */
+export async function bufferToHash(buffer) {
+    return arrayBufferToHex(await crypto.subtle.digest("SHA-256", buffer));
+}
+//# sourceMappingURL=buffer-to-hash.js.map

package/dist/cache/functions/hashing/buffer-to-hash.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"buffer-to-hash.js","sourceRoot":"","sources":["../../../../src/cache/functions/hashing/buffer-to-hash.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;WAoBW;AACX,SAAS,gBAAgB,CAAC,MAAmB;IAC3C,OAAO,CAAC,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;SAC/B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;SAC3C,IAAI,CAAC,EAAE,CAAC,CAAC;AACd,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,YAAY,CAAC,MAAmB;IACpD,OAAO,gBAAgB,CAAC,MAAM,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC;AACzE,CAAC"}

package/dist/cache/functions/hashing/hashing.test.d.ts

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