@adobe/data 0.2.1 → 0.2.2

package/src/cache/fallback-async-cache.ts

@@ -1,49 +0,0 @@
-/*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 { 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 function createFallbackAsyncCache(
-  fasterSmaller: AsyncCache<Request, Response>,
-  slowerLarger: AsyncCache<Request, Response>
-): AsyncCache<Request, Response> {
-  return {
-    async put(key: Request, value: Response): Promise<void> {
-      await Promise.all([
-        fasterSmaller.put(key, value),
-        slowerLarger.put(key, value),
-      ]);
-    },
-    async match(key: Request): Promise<Response | undefined> {
-      return (
-        (await fasterSmaller.match(key)) ?? (await slowerLarger.match(key))
-      );
-    },
-    async delete(key: Request): Promise<void> {
-      await Promise.all([fasterSmaller.delete(key), slowerLarger.delete(key)]);
-    },
-  };
-}

package/src/cache/functions/async-data-function.ts

@@ -1,25 +0,0 @@
-/*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 type AsyncDataFunction<InputArgs extends Array<unknown>, Output> = (
-  ...args: InputArgs
-) => Promise<Output>;

package/src/cache/functions/functions.test.ts

@@ -1,84 +0,0 @@
-/*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: number, b: number): Promise<number> {
-        addCallCount++;
-        return new Promise((resolve) => {
-          setTimeout(() => {
-            resolve(a + b);
-          }, 100);
-        });
-      }
-
-      async function testAddBlocksParallelExecution(addFn: typeof add) {
-        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: number, b: number): Promise<number> {
-        addCallCount++;
-        return new Promise((resolve) => {
-          setTimeout(() => {
-            resolve(a + b);
-          }, 100);
-        });
-      }
-
-      async function testAddBlocksParallelExecution(addFn: typeof add) {
-        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);
-    });
-  });
-});

package/src/cache/functions/get-cached.test.ts

@@ -1,113 +0,0 @@
-/*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: typeof obj) => {
-            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: typeof obj1) => {
-            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: typeof obj) => {
-            factory1CallCount++;
-            return { computed: o.id * 2 };
-        };
-
-        const factory2 = (o: typeof obj) => {
-            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: typeof obj) => {
-            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);
-    });
-}); 

package/src/cache/functions/get-cached.ts

@@ -1,55 +0,0 @@
-/*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<object, Map<Function, unknown>>();
-
-/**
- * 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<A extends object, B>(
-    context: A,
-    factory: (obj: A) => B
-): B {
-    // Get or create the factory map for this object
-    let factoryMap = cache.get(context) as Map<Function, B> | undefined;
-    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;
-} 

package/src/cache/functions/hashing/blob-to-hash.ts

@@ -1,46 +0,0 @@
-/*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: Blob): Promise<string> {
-  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;
-}

package/src/cache/functions/hashing/buffer-to-hash.ts

@@ -1,33 +0,0 @@
-/*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: ArrayBuffer): string {
-  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: ArrayBuffer): Promise<string> {
-  return arrayBufferToHex(await crypto.subtle.digest("SHA-256", buffer));
-}

package/src/cache/functions/hashing/hashing.test.ts

@@ -1,95 +0,0 @@
-/*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 { blobToHash } from "./blob-to-hash.js";
-import { jsonToHash } from "./json-to-hash.js";
-import { describe, expect, it } from "vitest";
-
-describe("test hashing", () => {
-  it("blobToHash should avoid collisions based on content and type", async () => {
-    const blobs = [
-      new Blob([
-        new Uint8Array([
-          45, 255, 128, 0, 1, 33, 33, 85, 129, 250, 245, 12, 33, 89, 7,
-        ]),
-      ]),
-      new Blob([
-        new Uint8Array([
-          45, 255, 128, 0, 1, 33, 33, 85, 129, 250, 245, 12, 33, 89, 8,
-        ]),
-      ]),
-      new Blob(["long text sample here"]),
-      new Blob(["long text sample here."]),
-      new Blob(["a"]),
-      new Blob(["b"]),
-      new Blob(["a"], { type: "octet/binary" }),
-      new Blob(["a"], { type: "text/plain" }),
-      //    empty blobs should work
-      new Blob([""]),
-      new Blob([""], { type: "octet/binary" }),
-      new Blob([""], { type: "text/plain" }),
-    ];
-    const hashPromises = blobs.map((blob) => blobToHash(blob));
-    const hashes = await Promise.all(hashPromises);
-    const unique = new Set(hashes);
-    const collisions = hashes.length - unique.size;
-    expect(collisions).toBe(0);
-  });
-  it("blobToHash should generate consistent hashes", async () => {
-    const blobs = [
-      new Blob(["long text sample here"], { type: "text/plain" }),
-      new Blob(["long text sample here"], { type: "text/plain" }),
-      new Blob(["long text sample here"], { type: "text/plain" }),
-    ];
-    const hashPromises = blobs.map((blob) => blobToHash(blob));
-    const hashes = await Promise.all(hashPromises);
-    const unique = new Set(hashes);
-    expect(unique.size).toBe(1);
-  });
-  it("jsonToHash should avoid collisions", async () => {
-    const values = [
-      "foo",
-      { a: 1 },
-      {},
-      [],
-      { a: 2 },
-      null,
-      "",
-      { alpha: "bravo" },
-    ];
-    const hashPromises = values.map((value) => jsonToHash(value));
-    const hashes = await Promise.all(hashPromises);
-    const unique = new Set(hashes);
-    const collisions = hashes.length - unique.size;
-    expect(collisions).toBe(0);
-  });
-  it("jsonToHash should generate consistent hashes", async () => {
-    const values = [
-      { a: 1, b: 2, foo: "bar" },
-      { a: 1, b: 2, foo: "bar" },
-      { a: 1, b: 2, foo: "bar" },
-    ];
-    const hashPromises = values.map((value) => jsonToHash(value));
-    const hashes = await Promise.all(hashPromises);
-    const unique = new Set(hashes);
-    expect(unique.size).toBe(1);
-  });
-});

package/src/cache/functions/hashing/index.ts

@@ -1,26 +0,0 @@
-/*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 * from "./blob-to-hash.js";
-export * from "./buffer-to-hash.js";
-export * from "./json-to-hash.js";
-export * from "./string-to-hash.js";

package/src/cache/functions/hashing/json-to-hash.ts

@@ -1,29 +0,0 @@
-/*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 { stringToHash } from "./string-to-hash.js";
-
-/**
- * Converts a JSON object to a hash using SHA-256.
- */
-export async function jsonToHash(value: unknown): Promise<string> {
-  return stringToHash(JSON.stringify(value));
-}

package/src/cache/functions/hashing/string-to-hash.ts

@@ -1,38 +0,0 @@
-/*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";
-
-function stringToArrayBuffer(value: string): ArrayBuffer {
-  const buf = new ArrayBuffer(value.length * 2);
-  const view = new Uint16Array(buf);
-  for (let i = 0, strLen = value.length; i < strLen; i++) {
-    view[i] = value.charCodeAt(i);
-  }
-  return buf;
-}
-
-/**
- * Converts a string to a hash using SHA-256.
- */
-export async function stringToHash(value: string): Promise<string> {
-  return bufferToHash(stringToArrayBuffer(value));
-}

package/src/cache/functions/index.ts

@@ -1,27 +0,0 @@
-/*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 * from "./hashing/index.js";
-export * from "./memoize.js";
-export * from "./prevent-parallel-execution.js";
-export * from "./async-data-function.js";
-export * from "./get-cached.js";