@haneullabs/utils 0.1.0 → 0.3.2

package/CHANGELOG.md

@@ -1,4 +1,16 @@
-# @haneullabs/utils
+# @mysten/utils
+
+## 0.3.1
+
+### Patch Changes
+
+- 99d1e00: Add default export condition
+
+## 0.3.0
+
+### Minor Changes
+
+- 339d1e0: Add mitt
 
 ## 0.2.0
 

package/dist/b58.d.mts

@@ -0,0 +1,6 @@
+//#region src/b58.d.ts
+declare const toBase58: (buffer: Uint8Array) => string;
+declare const fromBase58: (str: string) => Uint8Array<ArrayBuffer>;
+//#endregion
+export { fromBase58, toBase58 };
+//# sourceMappingURL=b58.d.mts.map

package/dist/b58.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"b58.d.mts","names":[],"sources":["../src/b58.ts"],"mappings":";cAKa,QAAA,GAAY,MAAA,EAAQ,UAAA;AAAA,cACpB,UAAA,GAAc,GAAA,aAAsC,UAAA,CAAW,WAAA"}

package/dist/{esm/b58.js → b58.mjs}

@@ -1,8 +1,9 @@
 import { base58 } from "@scure/base";
+
+//#region src/b58.ts
 const toBase58 = (buffer) => base58.encode(buffer);
 const fromBase58 = (str) => base58.decode(str);
-export {
-  fromBase58,
-  toBase58
-};
-//# sourceMappingURL=b58.js.map
+
+//#endregion
+export { fromBase58, toBase58 };
+//# sourceMappingURL=b58.mjs.map

package/dist/b58.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"b58.mjs","names":[],"sources":["../src/b58.ts"],"sourcesContent":["// Copyright (c) Mysten Labs, Inc.\n// SPDX-License-Identifier: Apache-2.0\n\nimport { base58 } from '@scure/base';\n\nexport const toBase58 = (buffer: Uint8Array) => base58.encode(buffer);\nexport const fromBase58 = (str: string) => base58.decode(str) as Uint8Array<ArrayBuffer>;\n"],"mappings":";;;AAKA,MAAa,YAAY,WAAuB,OAAO,OAAO,OAAO;AACrE,MAAa,cAAc,QAAgB,OAAO,OAAO,IAAI"}

package/dist/b64.d.mts

@@ -0,0 +1,6 @@
+//#region src/b64.d.ts
+declare function fromBase64(base64String: string): Uint8Array<ArrayBuffer>;
+declare function toBase64(bytes: Uint8Array): string;
+//#endregion
+export { fromBase64, toBase64 };
+//# sourceMappingURL=b64.d.mts.map

package/dist/b64.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"b64.d.mts","names":[],"sources":["../src/b64.ts"],"mappings":";iBAGgB,UAAA,CAAW,YAAA,WAAuB,UAAA,CAAW,WAAA;AAAA,iBAK7C,QAAA,CAAS,KAAA,EAAO,UAAA"}

package/dist/b64.mjs

@@ -0,0 +1,18 @@
+//#region src/b64.ts
+function fromBase64(base64String) {
+	return Uint8Array.from(atob(base64String), (char) => char.charCodeAt(0));
+}
+const CHUNK_SIZE = 8192;
+function toBase64(bytes) {
+	if (bytes.length < CHUNK_SIZE) return btoa(String.fromCharCode(...bytes));
+	let output = "";
+	for (var i = 0; i < bytes.length; i += CHUNK_SIZE) {
+		const chunk = bytes.slice(i, i + CHUNK_SIZE);
+		output += String.fromCharCode(...chunk);
+	}
+	return btoa(output);
+}
+
+//#endregion
+export { fromBase64, toBase64 };
+//# sourceMappingURL=b64.mjs.map

package/dist/b64.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"b64.mjs","names":[],"sources":["../src/b64.ts"],"sourcesContent":["// Copyright (c) Mysten Labs, Inc.\n// SPDX-License-Identifier: Apache-2.0\n\nexport function fromBase64(base64String: string): Uint8Array<ArrayBuffer> {\n\treturn Uint8Array.from(atob(base64String), (char) => char.charCodeAt(0));\n}\n\nconst CHUNK_SIZE = 8192;\nexport function toBase64(bytes: Uint8Array): string {\n\t// Special-case the simple case for speed's sake.\n\tif (bytes.length < CHUNK_SIZE) {\n\t\treturn btoa(String.fromCharCode(...bytes));\n\t}\n\n\tlet output = '';\n\tfor (var i = 0; i < bytes.length; i += CHUNK_SIZE) {\n\t\tconst chunk = bytes.slice(i, i + CHUNK_SIZE);\n\t\toutput += String.fromCharCode(...chunk);\n\t}\n\n\treturn btoa(output);\n}\n"],"mappings":";AAGA,SAAgB,WAAW,cAA+C;AACzE,QAAO,WAAW,KAAK,KAAK,aAAa,GAAG,SAAS,KAAK,WAAW,EAAE,CAAC;;AAGzE,MAAM,aAAa;AACnB,SAAgB,SAAS,OAA2B;AAEnD,KAAI,MAAM,SAAS,WAClB,QAAO,KAAK,OAAO,aAAa,GAAG,MAAM,CAAC;CAG3C,IAAI,SAAS;AACb,MAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,YAAY;EAClD,MAAM,QAAQ,MAAM,MAAM,GAAG,IAAI,WAAW;AAC5C,YAAU,OAAO,aAAa,GAAG,MAAM;;AAGxC,QAAO,KAAK,OAAO"}

package/dist/chunk.d.mts

@@ -0,0 +1,5 @@
+//#region src/chunk.d.ts
+declare function chunk<T>(array: readonly T[], size: number): T[][];
+//#endregion
+export { chunk };
+//# sourceMappingURL=chunk.d.mts.map

package/dist/chunk.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"chunk.d.mts","names":[],"sources":["../src/chunk.ts"],"mappings":";iBAGgB,KAAA,GAAA,CAAS,KAAA,WAAgB,CAAA,IAAK,IAAA,WAAe,CAAA"}

package/dist/chunk.mjs

@@ -0,0 +1,10 @@
+//#region src/chunk.ts
+function chunk(array, size) {
+	return Array.from({ length: Math.ceil(array.length / size) }, (_, i) => {
+		return array.slice(i * size, (i + 1) * size);
+	});
+}
+
+//#endregion
+export { chunk };
+//# sourceMappingURL=chunk.mjs.map

package/dist/chunk.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"chunk.mjs","names":[],"sources":["../src/chunk.ts"],"sourcesContent":["// Copyright (c) Mysten Labs, Inc.\n// SPDX-License-Identifier: Apache-2.0\n\nexport function chunk<T>(array: readonly T[], size: number): T[][] {\n\treturn Array.from({ length: Math.ceil(array.length / size) }, (_, i) => {\n\t\treturn array.slice(i * size, (i + 1) * size);\n\t});\n}\n"],"mappings":";AAGA,SAAgB,MAAS,OAAqB,MAAqB;AAClE,QAAO,MAAM,KAAK,EAAE,QAAQ,KAAK,KAAK,MAAM,SAAS,KAAK,EAAE,GAAG,GAAG,MAAM;AACvE,SAAO,MAAM,MAAM,IAAI,OAAO,IAAI,KAAK,KAAK;GAC3C"}

package/dist/dataloader.d.mts

@@ -0,0 +1,139 @@
+//#region src/dataloader.d.ts
+/**
+ * DataLoader - A generic utility for batching and caching data fetches.
+ *
+ * Vendored from: https://github.com/graphql/dataloader
+ * Commit: a10773043d41a56bde4219c155fcf5633e6c9bcb
+ * License: MIT
+ * Copyright (c) GraphQL Contributors
+ */
+/**
+ * A `DataLoader` creates a public API for loading data from a particular
+ * data back-end with unique keys such as the `id` column of a SQL table or
+ * document name in a MongoDB database, given a batch loading function.
+ *
+ * Each `DataLoader` instance contains a unique memoized cache. Use caution when
+ * used in long-lived applications or those which serve many users with
+ * different access permissions and consider creating a new instance per
+ * web request.
+ */
+declare class DataLoader<K, V, C = K> {
+  constructor(batchLoadFn: DataLoader.BatchLoadFn<K, V>, options?: DataLoader.Options<K, V, C>);
+  _batchLoadFn: DataLoader.BatchLoadFn<K, V>;
+  _maxBatchSize: number;
+  _batchScheduleFn: (cb: () => void) => void;
+  _cacheKeyFn: (key: K) => C;
+  _cacheMap: DataLoader.CacheMap<C, Promise<V>> | null;
+  _batch: Batch<K, V> | null;
+  /**
+   * Loads a key, returning a `Promise` for the value represented by that key.
+   */
+  load(key: K): Promise<V>;
+  /**
+   * Loads multiple keys, promising an array of values:
+   *
+   *     var [ a, b ] = await myLoader.loadMany([ 'a', 'b' ]);
+   *
+   * This is similar to the more verbose:
+   *
+   *     var [ a, b ] = await Promise.all([
+   *       myLoader.load('a'),
+   *       myLoader.load('b')
+   *     ]);
+   *
+   * However it is different in the case where any load fails. Where
+   * Promise.all() would reject, loadMany() always resolves, however each result
+   * is either a value or an Error instance.
+   *
+   *     var [ a, b, c ] = await myLoader.loadMany([ 'a', 'b', 'badkey' ]);
+   *     // c instanceof Error
+   *
+   */
+  loadMany(keys: ReadonlyArray<K>): Promise<Array<V | Error>>;
+  /**
+   * Clears the value at `key` from the cache, if it exists. Returns itself for
+   * method chaining.
+   */
+  clear(key: K): this;
+  /**
+   * Clears the entire cache. To be used when some event results in unknown
+   * invalidations across this particular `DataLoader`. Returns itself for
+   * method chaining.
+   */
+  clearAll(): this;
+  /**
+   * Adds the provided key and value to the cache. If the key already
+   * exists, no change is made. Returns itself for method chaining.
+   *
+   * To prime the cache with an error at a key, provide an Error instance.
+   */
+  prime(key: K, value: V | Promise<V> | Error): this;
+  /**
+   * The name given to this `DataLoader` instance. Useful for APM tools.
+   *
+   * Is `null` if not set in the constructor.
+   */
+  name: string | null;
+}
+type Batch<K, V> = {
+  hasDispatched: boolean;
+  keys: Array<K>;
+  callbacks: Array<{
+    resolve: (value: V) => void;
+    reject: (error: Error) => void;
+  }>;
+  cacheHits?: Array<() => void>;
+};
+declare namespace DataLoader {
+  type CacheMap<K, V> = {
+    get(key: K): V | void;
+    set(key: K, value: V): any;
+    delete(key: K): any;
+    clear(): any;
+  };
+  type BatchLoadFn<K, V> = (keys: ReadonlyArray<K>) => PromiseLike<ArrayLike<V | Error>>;
+  type Options<K, V, C = K> = {
+    /**
+     * Default `true`. Set to `false` to disable batching, invoking
+     * `batchLoadFn` with a single load key. This is equivalent to setting
+     * `maxBatchSize` to `1`.
+     */
+    batch?: boolean;
+    /**
+     * Default `Infinity`. Limits the number of items that get passed in to the
+     * `batchLoadFn`. May be set to `1` to disable batching.
+     */
+    maxBatchSize?: number;
+    /**
+     * Default see https://github.com/graphql/dataloader#batch-scheduling.
+     * A function to schedule the later execution of a batch. The function is
+     * expected to call the provided callback in the immediate future.
+     */
+    batchScheduleFn?: (callback: () => void) => void;
+    /**
+     * Default `true`. Set to `false` to disable memoization caching, creating a
+     * new Promise and new key in the `batchLoadFn` for every load of the same
+     * key. This is equivalent to setting `cacheMap` to `null`.
+     */
+    cache?: boolean;
+    /**
+     * Default `key => key`. Produces cache key for a given load key. Useful
+     * when keys are objects and two objects should be considered equivalent.
+     */
+    cacheKeyFn?: (key: K) => C;
+    /**
+     * Default `new Map()`. Instance of `Map` (or an object with a similar API)
+     * to be used as cache. May be set to `null` to disable caching.
+     */
+    cacheMap?: CacheMap<C, Promise<V>> | null;
+    /**
+     * The name given to this `DataLoader` instance. Useful for APM tools.
+     *
+     * Is `null` if not set in the constructor.
+     */
+    name?: string | null;
+  };
+}
+//#endregion
+export { DataLoader };
+//# sourceMappingURL=dataloader.d.mts.map

package/dist/dataloader.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dataloader.d.mts","names":[],"sources":["../src/dataloader.ts"],"mappings":";;AAsBA;;;;;;;;;;;;;;;;;cAAa,UAAA,WAAqB,CAAA;cACrB,WAAA,EAAa,UAAA,CAAW,WAAA,CAAY,CAAA,EAAG,CAAA,GAAI,OAAA,GAAU,UAAA,CAAW,OAAA,CAAQ,CAAA,EAAG,CAAA,EAAG,CAAA;EAiB1F,YAAA,EAAc,UAAA,CAAW,WAAA,CAAY,CAAA,EAAG,CAAA;EACxC,aAAA;EACA,gBAAA,GAAmB,EAAA;EACnB,WAAA,GAAc,GAAA,EAAK,CAAA,KAAM,CAAA;EACzB,SAAA,EAAW,UAAA,CAAW,QAAA,CAAS,CAAA,EAAG,OAAA,CAAQ,CAAA;EAC1C,MAAA,EAAQ,KAAA,CAAM,CAAA,EAAG,CAAA;EAKH;;;EAAd,IAAA,CAAK,GAAA,EAAK,CAAA,GAAI,OAAA,CAAQ,CAAA;EA4D8B;;;;;;;;;;;;;;;;;;;;EAApD,QAAA,CAAS,IAAA,EAAM,aAAA,CAAc,CAAA,IAAK,OAAA,CAAQ,KAAA,CAAM,CAAA,GAAI,KAAA;EAvFa;;;;EAyGjE,KAAA,CAAM,GAAA,EAAK,CAAA;EAzG4C;;;;;EAuHvD,QAAA,CAAA;EArGA;;;;;;EAmHA,KAAA,CAAM,GAAA,EAAK,CAAA,EAAG,KAAA,EAAO,CAAA,GAAI,OAAA,CAAQ,CAAA,IAAK,KAAA;EAhHtC;;;;;EA6IA,IAAA;AAAA;AAAA,KAuDI,KAAA;EACJ,aAAA;EACA,IAAA,EAAM,KAAA,CAAM,CAAA;EACZ,SAAA,EAAW,KAAA;IACV,OAAA,GAAU,KAAA,EAAO,CAAA;IACjB,MAAA,GAAS,KAAA,EAAO,KAAA;EAAA;EAEjB,SAAA,GAAY,KAAA;AAAA;AAAA,kBAuNY,UAAA;EAAA,KAEZ,QAAA;IACX,GAAA,CAAI,GAAA,EAAK,CAAA,GAAI,CAAA;IACb,GAAA,CAAI,GAAA,EAAK,CAAA,EAAG,KAAA,EAAO,CAAA;IACnB,MAAA,CAAO,GAAA,EAAK,CAAA;IACZ,KAAA;EAAA;EAAA,KAKW,WAAA,UAAqB,IAAA,EAAM,aAAA,CAAc,CAAA,MAAO,WAAA,CAAY,SAAA,CAAU,CAAA,GAAI,KAAA;EAAA,KAI1E,OAAA,WAAkB,CAAA;IA7VxB;;;;;IAmWL,KAAA;IAvUwB;;;;IA6UxB,YAAA;IAhTG;;AACJ;;;IAsTC,eAAA,IAAmB,QAAA;IA9Pd;;;;;IAqQL,KAAA;IAhQgB;;;;IAsQhB,UAAA,IAAc,GAAA,EAAK,CAAA,KAAM,CAAA;IA3QpB;;;;IAiRL,QAAA,GAAW,QAAA,CAAS,CAAA,EAAG,OAAA,CAAQ,CAAA;IA/Qd;;;;;IAsRjB,IAAA;EAAA;AAAA"}

package/dist/dataloader.mjs

@@ -0,0 +1,236 @@
+//#region src/dataloader.ts
+/**
+* DataLoader - A generic utility for batching and caching data fetches.
+*
+* Vendored from: https://github.com/graphql/dataloader
+* Commit: a10773043d41a56bde4219c155fcf5633e6c9bcb
+* License: MIT
+* Copyright (c) GraphQL Contributors
+*/
+/**
+* A `DataLoader` creates a public API for loading data from a particular
+* data back-end with unique keys such as the `id` column of a SQL table or
+* document name in a MongoDB database, given a batch loading function.
+*
+* Each `DataLoader` instance contains a unique memoized cache. Use caution when
+* used in long-lived applications or those which serve many users with
+* different access permissions and consider creating a new instance per
+* web request.
+*/
+var DataLoader = class {
+	constructor(batchLoadFn, options) {
+		if (typeof batchLoadFn !== "function") throw new TypeError(`DataLoader must be constructed with a function which accepts Array<key> and returns Promise<Array<value>>, but got: ${batchLoadFn}.`);
+		this._batchLoadFn = batchLoadFn;
+		this._maxBatchSize = getValidMaxBatchSize(options);
+		this._batchScheduleFn = getValidBatchScheduleFn(options);
+		this._cacheKeyFn = getValidCacheKeyFn(options);
+		this._cacheMap = getValidCacheMap(options);
+		this._batch = null;
+		this.name = getValidName(options);
+	}
+	/**
+	* Loads a key, returning a `Promise` for the value represented by that key.
+	*/
+	load(key) {
+		if (key === null || key === void 0) throw new TypeError(`The loader.load() function must be called with a value, but got: ${String(key)}.`);
+		const batch = getCurrentBatch(this);
+		const cacheMap = this._cacheMap;
+		let cacheKey;
+		if (cacheMap) {
+			cacheKey = this._cacheKeyFn(key);
+			const cachedPromise = cacheMap.get(cacheKey);
+			if (cachedPromise) {
+				const cacheHits = batch.cacheHits || (batch.cacheHits = []);
+				return new Promise((resolve) => {
+					cacheHits.push(() => {
+						resolve(cachedPromise);
+					});
+				});
+			}
+		}
+		batch.keys.push(key);
+		const promise = new Promise((resolve, reject) => {
+			batch.callbacks.push({
+				resolve,
+				reject
+			});
+		});
+		if (cacheMap) cacheMap.set(cacheKey, promise);
+		return promise;
+	}
+	/**
+	* Loads multiple keys, promising an array of values:
+	*
+	*     var [ a, b ] = await myLoader.loadMany([ 'a', 'b' ]);
+	*
+	* This is similar to the more verbose:
+	*
+	*     var [ a, b ] = await Promise.all([
+	*       myLoader.load('a'),
+	*       myLoader.load('b')
+	*     ]);
+	*
+	* However it is different in the case where any load fails. Where
+	* Promise.all() would reject, loadMany() always resolves, however each result
+	* is either a value or an Error instance.
+	*
+	*     var [ a, b, c ] = await myLoader.loadMany([ 'a', 'b', 'badkey' ]);
+	*     // c instanceof Error
+	*
+	*/
+	loadMany(keys) {
+		if (!isArrayLike(keys)) throw new TypeError(`The loader.loadMany() function must be called with Array<key>, but got: ${keys}.`);
+		const loadPromises = [];
+		for (let i = 0; i < keys.length; i++) loadPromises.push(this.load(keys[i]).catch((error) => error));
+		return Promise.all(loadPromises);
+	}
+	/**
+	* Clears the value at `key` from the cache, if it exists. Returns itself for
+	* method chaining.
+	*/
+	clear(key) {
+		const cacheMap = this._cacheMap;
+		if (cacheMap) {
+			const cacheKey = this._cacheKeyFn(key);
+			cacheMap.delete(cacheKey);
+		}
+		return this;
+	}
+	/**
+	* Clears the entire cache. To be used when some event results in unknown
+	* invalidations across this particular `DataLoader`. Returns itself for
+	* method chaining.
+	*/
+	clearAll() {
+		const cacheMap = this._cacheMap;
+		if (cacheMap) cacheMap.clear();
+		return this;
+	}
+	/**
+	* Adds the provided key and value to the cache. If the key already
+	* exists, no change is made. Returns itself for method chaining.
+	*
+	* To prime the cache with an error at a key, provide an Error instance.
+	*/
+	prime(key, value) {
+		const cacheMap = this._cacheMap;
+		if (cacheMap) {
+			const cacheKey = this._cacheKeyFn(key);
+			if (cacheMap.get(cacheKey) === void 0) {
+				let promise;
+				if (value instanceof Error) {
+					promise = Promise.reject(value);
+					promise.catch(() => {});
+				} else promise = Promise.resolve(value);
+				cacheMap.set(cacheKey, promise);
+			}
+		}
+		return this;
+	}
+};
+const enqueuePostPromiseJob = typeof process === "object" && typeof process.nextTick === "function" ? function(fn) {
+	if (!resolvedPromise) resolvedPromise = Promise.resolve();
+	resolvedPromise.then(() => {
+		process.nextTick(fn);
+	});
+} : typeof setImmediate === "function" ? function(fn) {
+	setImmediate(fn);
+} : function(fn) {
+	setTimeout(fn);
+};
+let resolvedPromise;
+function getCurrentBatch(loader) {
+	const existingBatch = loader._batch;
+	if (existingBatch !== null && !existingBatch.hasDispatched && existingBatch.keys.length < loader._maxBatchSize) return existingBatch;
+	const newBatch = {
+		hasDispatched: false,
+		keys: [],
+		callbacks: []
+	};
+	loader._batch = newBatch;
+	loader._batchScheduleFn(() => {
+		dispatchBatch(loader, newBatch);
+	});
+	return newBatch;
+}
+function dispatchBatch(loader, batch) {
+	batch.hasDispatched = true;
+	if (batch.keys.length === 0) {
+		resolveCacheHits(batch);
+		return;
+	}
+	let batchPromise;
+	try {
+		batchPromise = loader._batchLoadFn(batch.keys);
+	} catch (e) {
+		return failedDispatch(loader, batch, /* @__PURE__ */ new TypeError(`DataLoader must be constructed with a function which accepts Array<key> and returns Promise<Array<value>>, but the function errored synchronously: ${String(e)}.`));
+	}
+	if (!batchPromise || typeof batchPromise.then !== "function") return failedDispatch(loader, batch, /* @__PURE__ */ new TypeError(`DataLoader must be constructed with a function which accepts Array<key> and returns Promise<Array<value>>, but the function did not return a Promise: ${String(batchPromise)}.`));
+	Promise.resolve(batchPromise).then((values) => {
+		if (!isArrayLike(values)) throw new TypeError(`DataLoader must be constructed with a function which accepts Array<key> and returns Promise<Array<value>>, but the function did not return a Promise of an Array: ${String(values)}.`);
+		if (values.length !== batch.keys.length) throw new TypeError(`DataLoader must be constructed with a function which accepts Array<key> and returns Promise<Array<value>>, but the function did not return a Promise of an Array of the same length as the Array of keys.\n\nKeys:\n${String(batch.keys)}\n\nValues:\n${String(values)}`);
+		resolveCacheHits(batch);
+		for (let i = 0; i < batch.callbacks.length; i++) {
+			const value = values[i];
+			if (value instanceof Error) batch.callbacks[i].reject(value);
+			else batch.callbacks[i].resolve(value);
+		}
+	}).catch((error) => {
+		failedDispatch(loader, batch, error);
+	});
+}
+function failedDispatch(loader, batch, error) {
+	resolveCacheHits(batch);
+	for (let i = 0; i < batch.keys.length; i++) {
+		loader.clear(batch.keys[i]);
+		batch.callbacks[i].reject(error);
+	}
+}
+function resolveCacheHits(batch) {
+	if (batch.cacheHits) for (let i = 0; i < batch.cacheHits.length; i++) batch.cacheHits[i]();
+}
+function getValidMaxBatchSize(options) {
+	if (!(!options || options.batch !== false)) return 1;
+	const maxBatchSize = options && options.maxBatchSize;
+	if (maxBatchSize === void 0) return Infinity;
+	if (typeof maxBatchSize !== "number" || maxBatchSize < 1) throw new TypeError(`maxBatchSize must be a positive number: ${maxBatchSize}`);
+	return maxBatchSize;
+}
+function getValidBatchScheduleFn(options) {
+	const batchScheduleFn = options && options.batchScheduleFn;
+	if (batchScheduleFn === void 0) return enqueuePostPromiseJob;
+	if (typeof batchScheduleFn !== "function") throw new TypeError(`batchScheduleFn must be a function: ${batchScheduleFn}`);
+	return batchScheduleFn;
+}
+function getValidCacheKeyFn(options) {
+	const cacheKeyFn = options && options.cacheKeyFn;
+	if (cacheKeyFn === void 0) return (key) => key;
+	if (typeof cacheKeyFn !== "function") throw new TypeError(`cacheKeyFn must be a function: ${cacheKeyFn}`);
+	return cacheKeyFn;
+}
+function getValidCacheMap(options) {
+	if (!(!options || options.cache !== false)) return null;
+	const cacheMap = options && options.cacheMap;
+	if (cacheMap === void 0) return /* @__PURE__ */ new Map();
+	if (cacheMap !== null) {
+		const missingFunctions = [
+			"get",
+			"set",
+			"delete",
+			"clear"
+		].filter((fnName) => cacheMap && typeof cacheMap[fnName] !== "function");
+		if (missingFunctions.length !== 0) throw new TypeError("Custom cacheMap missing methods: " + missingFunctions.join(", "));
+	}
+	return cacheMap;
+}
+function getValidName(options) {
+	if (options && options.name) return options.name;
+	return null;
+}
+function isArrayLike(x) {
+	return typeof x === "object" && x !== null && "length" in x && typeof x.length === "number" && (x.length === 0 || x.length > 0 && Object.prototype.hasOwnProperty.call(x, x.length - 1));
+}
+
+//#endregion
+export { DataLoader };
+//# sourceMappingURL=dataloader.mjs.map

package/dist/dataloader.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"dataloader.mjs","names":[],"sources":["../src/dataloader.ts"],"sourcesContent":["// Copyright (c) Mysten Labs, Inc.\n// SPDX-License-Identifier: Apache-2.0\n\n/**\n * DataLoader - A generic utility for batching and caching data fetches.\n *\n * Vendored from: https://github.com/graphql/dataloader\n * Commit: a10773043d41a56bde4219c155fcf5633e6c9bcb\n * License: MIT\n * Copyright (c) GraphQL Contributors\n */\n\n/**\n * A `DataLoader` creates a public API for loading data from a particular\n * data back-end with unique keys such as the `id` column of a SQL table or\n * document name in a MongoDB database, given a batch loading function.\n *\n * Each `DataLoader` instance contains a unique memoized cache. Use caution when\n * used in long-lived applications or those which serve many users with\n * different access permissions and consider creating a new instance per\n * web request.\n */\nexport class DataLoader<K, V, C = K> {\n\tconstructor(batchLoadFn: DataLoader.BatchLoadFn<K, V>, options?: DataLoader.Options<K, V, C>) {\n\t\tif (typeof batchLoadFn !== 'function') {\n\t\t\tthrow new TypeError(\n\t\t\t\t'DataLoader must be constructed with a function which accepts ' +\n\t\t\t\t\t`Array<key> and returns Promise<Array<value>>, but got: ${batchLoadFn}.`,\n\t\t\t);\n\t\t}\n\t\tthis._batchLoadFn = batchLoadFn;\n\t\tthis._maxBatchSize = getValidMaxBatchSize(options);\n\t\tthis._batchScheduleFn = getValidBatchScheduleFn(options);\n\t\tthis._cacheKeyFn = getValidCacheKeyFn(options);\n\t\tthis._cacheMap = getValidCacheMap(options);\n\t\tthis._batch = null;\n\t\tthis.name = getValidName(options);\n\t}\n\n\t// Private\n\t_batchLoadFn: DataLoader.BatchLoadFn<K, V>;\n\t_maxBatchSize: number;\n\t_batchScheduleFn: (cb: () => void) => void;\n\t_cacheKeyFn: (key: K) => C;\n\t_cacheMap: DataLoader.CacheMap<C, Promise<V>> | null;\n\t_batch: Batch<K, V> | null;\n\n\t/**\n\t * Loads a key, returning a `Promise` for the value represented by that key.\n\t */\n\tload(key: K): Promise<V> {\n\t\tif (key === null || key === undefined) {\n\t\t\tthrow new TypeError(\n\t\t\t\t`The loader.load() function must be called with a value, but got: ${String(key)}.`,\n\t\t\t);\n\t\t}\n\n\t\tconst batch = getCurrentBatch(this);\n\t\tconst cacheMap = this._cacheMap;\n\t\tlet cacheKey: C;\n\n\t\t// If caching and there is a cache-hit, return cached Promise.\n\t\tif (cacheMap) {\n\t\t\tcacheKey = this._cacheKeyFn(key);\n\t\t\tconst cachedPromise = cacheMap.get(cacheKey);\n\t\t\tif (cachedPromise) {\n\t\t\t\tconst cacheHits = batch.cacheHits || (batch.cacheHits = []);\n\t\t\t\treturn new Promise((resolve) => {\n\t\t\t\t\tcacheHits.push(() => {\n\t\t\t\t\t\tresolve(cachedPromise);\n\t\t\t\t\t});\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\n\t\t// Otherwise, produce a new Promise for this key, and enqueue it to be\n\t\t// dispatched along with the current batch.\n\t\tbatch.keys.push(key);\n\t\tconst promise = new Promise<V>((resolve, reject) => {\n\t\t\tbatch.callbacks.push({ resolve, reject });\n\t\t});\n\n\t\t// If caching, cache this promise.\n\t\tif (cacheMap) {\n\t\t\tcacheMap.set(cacheKey!, promise);\n\t\t}\n\n\t\treturn promise;\n\t}\n\n\t/**\n\t * Loads multiple keys, promising an array of values:\n\t *\n\t *     var [ a, b ] = await myLoader.loadMany([ 'a', 'b' ]);\n\t *\n\t * This is similar to the more verbose:\n\t *\n\t *     var [ a, b ] = await Promise.all([\n\t *       myLoader.load('a'),\n\t *       myLoader.load('b')\n\t *     ]);\n\t *\n\t * However it is different in the case where any load fails. Where\n\t * Promise.all() would reject, loadMany() always resolves, however each result\n\t * is either a value or an Error instance.\n\t *\n\t *     var [ a, b, c ] = await myLoader.loadMany([ 'a', 'b', 'badkey' ]);\n\t *     // c instanceof Error\n\t *\n\t */\n\tloadMany(keys: ReadonlyArray<K>): Promise<Array<V | Error>> {\n\t\tif (!isArrayLike(keys)) {\n\t\t\tthrow new TypeError(\n\t\t\t\t`The loader.loadMany() function must be called with Array<key>, but got: ${keys}.`,\n\t\t\t);\n\t\t}\n\t\t// Support ArrayLike by using only minimal property access\n\t\tconst loadPromises = [];\n\t\tfor (let i = 0; i < keys.length; i++) {\n\t\t\tloadPromises.push(this.load(keys[i]).catch((error) => error));\n\t\t}\n\t\treturn Promise.all(loadPromises);\n\t}\n\n\t/**\n\t * Clears the value at `key` from the cache, if it exists. Returns itself for\n\t * method chaining.\n\t */\n\tclear(key: K): this {\n\t\tconst cacheMap = this._cacheMap;\n\t\tif (cacheMap) {\n\t\t\tconst cacheKey = this._cacheKeyFn(key);\n\t\t\tcacheMap.delete(cacheKey);\n\t\t}\n\t\treturn this;\n\t}\n\n\t/**\n\t * Clears the entire cache. To be used when some event results in unknown\n\t * invalidations across this particular `DataLoader`. Returns itself for\n\t * method chaining.\n\t */\n\tclearAll(): this {\n\t\tconst cacheMap = this._cacheMap;\n\t\tif (cacheMap) {\n\t\t\tcacheMap.clear();\n\t\t}\n\t\treturn this;\n\t}\n\n\t/**\n\t * Adds the provided key and value to the cache. If the key already\n\t * exists, no change is made. Returns itself for method chaining.\n\t *\n\t * To prime the cache with an error at a key, provide an Error instance.\n\t */\n\tprime(key: K, value: V | Promise<V> | Error): this {\n\t\tconst cacheMap = this._cacheMap;\n\t\tif (cacheMap) {\n\t\t\tconst cacheKey = this._cacheKeyFn(key);\n\n\t\t\t// Only add the key if it does not already exist.\n\t\t\tif (cacheMap.get(cacheKey) === undefined) {\n\t\t\t\t// Cache a rejected promise if the value is an Error, in order to match\n\t\t\t\t// the behavior of load(key).\n\t\t\t\tlet promise;\n\t\t\t\tif (value instanceof Error) {\n\t\t\t\t\tpromise = Promise.reject(value);\n\t\t\t\t\t// Since this is a case where an Error is intentionally being primed\n\t\t\t\t\t// for a given key, we want to disable unhandled promise rejection.\n\t\t\t\t\tpromise.catch(() => {});\n\t\t\t\t} else {\n\t\t\t\t\tpromise = Promise.resolve(value);\n\t\t\t\t}\n\t\t\t\tcacheMap.set(cacheKey, promise);\n\t\t\t}\n\t\t}\n\t\treturn this;\n\t}\n\n\t/**\n\t * The name given to this `DataLoader` instance. Useful for APM tools.\n\t *\n\t * Is `null` if not set in the constructor.\n\t */\n\tname: string | null;\n}\n\n// Private: Enqueue a Job to be executed after all \"PromiseJobs\" Jobs.\n//\n// ES6 JavaScript uses the concepts Job and JobQueue to schedule work to occur\n// after the current execution context has completed:\n// http://www.ecma-international.org/ecma-262/6.0/#sec-jobs-and-job-queues\n//\n// Node.js uses the `process.nextTick` mechanism to implement the concept of a\n// Job, maintaining a global FIFO JobQueue for all Jobs, which is flushed after\n// the current call stack ends.\n//\n// When calling `then` on a Promise, it enqueues a Job on a specific\n// \"PromiseJobs\" JobQueue which is flushed in Node as a single Job on the\n// global JobQueue.\n//\n// DataLoader batches all loads which occur in a single frame of execution, but\n// should include in the batch all loads which occur during the flushing of the\n// \"PromiseJobs\" JobQueue after that same execution frame.\n//\n// In order to avoid the DataLoader dispatch Job occuring before \"PromiseJobs\",\n// A Promise Job is created with the sole purpose of enqueuing a global Job,\n// ensuring that it always occurs after \"PromiseJobs\" ends.\n//\n// Node.js's job queue is unique. Browsers do not have an equivalent mechanism\n// for enqueuing a job to be performed after promise microtasks and before the\n// next macrotask. For browser environments, a macrotask is used (via\n// setImmediate or setTimeout) at a potential performance penalty.\nconst enqueuePostPromiseJob: (fn: () => void) => void =\n\t// @ts-ignore\n\ttypeof process === 'object' && typeof process.nextTick === 'function'\n\t\t? function (fn) {\n\t\t\t\tif (!resolvedPromise) {\n\t\t\t\t\tresolvedPromise = Promise.resolve();\n\t\t\t\t}\n\t\t\t\tresolvedPromise.then(() => {\n\t\t\t\t\t// @ts-ignore\n\t\t\t\t\tprocess.nextTick(fn);\n\t\t\t\t});\n\t\t\t}\n\t\t: // @ts-ignore\n\t\t\ttypeof setImmediate === 'function'\n\t\t\t? function (fn) {\n\t\t\t\t\t// @ts-ignore\n\t\t\t\t\tsetImmediate(fn);\n\t\t\t\t}\n\t\t\t: function (fn) {\n\t\t\t\t\tsetTimeout(fn);\n\t\t\t\t};\n\n// Private: cached resolved Promise instance\nlet resolvedPromise: Promise<void> | undefined;\n\n// Private: Describes a batch of requests\ntype Batch<K, V> = {\n\thasDispatched: boolean;\n\tkeys: Array<K>;\n\tcallbacks: Array<{\n\t\tresolve: (value: V) => void;\n\t\treject: (error: Error) => void;\n\t}>;\n\tcacheHits?: Array<() => void>;\n};\n\n// Private: Either returns the current batch, or creates and schedules a\n// dispatch of a new batch for the given loader.\nfunction getCurrentBatch<K, V>(loader: DataLoader<K, V, any>): Batch<K, V> {\n\t// If there is an existing batch which has not yet dispatched and is within\n\t// the limit of the batch size, then return it.\n\tconst existingBatch = loader._batch;\n\tif (\n\t\texistingBatch !== null &&\n\t\t!existingBatch.hasDispatched &&\n\t\texistingBatch.keys.length < loader._maxBatchSize\n\t) {\n\t\treturn existingBatch;\n\t}\n\n\t// Otherwise, create a new batch for this loader.\n\tconst newBatch = { hasDispatched: false, keys: [], callbacks: [] };\n\n\t// Store it on the loader so it may be reused.\n\tloader._batch = newBatch;\n\n\t// Then schedule a task to dispatch this batch of requests.\n\tloader._batchScheduleFn(() => {\n\t\tdispatchBatch(loader, newBatch);\n\t});\n\n\treturn newBatch;\n}\n\nfunction dispatchBatch<K, V>(loader: DataLoader<K, V, any>, batch: Batch<K, V>) {\n\t// Mark this batch as having been dispatched.\n\tbatch.hasDispatched = true;\n\n\t// If there's nothing to load, resolve any cache hits and return early.\n\tif (batch.keys.length === 0) {\n\t\tresolveCacheHits(batch);\n\t\treturn;\n\t}\n\n\t// Call the provided batchLoadFn for this loader with the batch's keys and\n\t// with the loader as the `this` context.\n\tlet batchPromise;\n\ttry {\n\t\tbatchPromise = loader._batchLoadFn(batch.keys);\n\t} catch (e) {\n\t\treturn failedDispatch(\n\t\t\tloader,\n\t\t\tbatch,\n\t\t\tnew TypeError(\n\t\t\t\t'DataLoader must be constructed with a function which accepts ' +\n\t\t\t\t\t'Array<key> and returns Promise<Array<value>>, but the function ' +\n\t\t\t\t\t`errored synchronously: ${String(e)}.`,\n\t\t\t),\n\t\t);\n\t}\n\n\t// Assert the expected response from batchLoadFn\n\tif (!batchPromise || typeof batchPromise.then !== 'function') {\n\t\treturn failedDispatch(\n\t\t\tloader,\n\t\t\tbatch,\n\t\t\tnew TypeError(\n\t\t\t\t'DataLoader must be constructed with a function which accepts ' +\n\t\t\t\t\t'Array<key> and returns Promise<Array<value>>, but the function did ' +\n\t\t\t\t\t`not return a Promise: ${String(batchPromise)}.`,\n\t\t\t),\n\t\t);\n\t}\n\n\t// Await the resolution of the call to batchLoadFn.\n\tPromise.resolve(batchPromise)\n\t\t.then((values) => {\n\t\t\t// Assert the expected resolution from batchLoadFn.\n\t\t\tif (!isArrayLike(values)) {\n\t\t\t\tthrow new TypeError(\n\t\t\t\t\t'DataLoader must be constructed with a function which accepts ' +\n\t\t\t\t\t\t'Array<key> and returns Promise<Array<value>>, but the function did ' +\n\t\t\t\t\t\t`not return a Promise of an Array: ${String(values)}.`,\n\t\t\t\t);\n\t\t\t}\n\t\t\tif (values.length !== batch.keys.length) {\n\t\t\t\tthrow new TypeError(\n\t\t\t\t\t'DataLoader must be constructed with a function which accepts ' +\n\t\t\t\t\t\t'Array<key> and returns Promise<Array<value>>, but the function did ' +\n\t\t\t\t\t\t'not return a Promise of an Array of the same length as the Array ' +\n\t\t\t\t\t\t'of keys.' +\n\t\t\t\t\t\t`\\n\\nKeys:\\n${String(batch.keys)}` +\n\t\t\t\t\t\t`\\n\\nValues:\\n${String(values)}`,\n\t\t\t\t);\n\t\t\t}\n\n\t\t\t// Resolve all cache hits in the same micro-task as freshly loaded values.\n\t\t\tresolveCacheHits(batch);\n\n\t\t\t// Step through values, resolving or rejecting each Promise in the batch.\n\t\t\tfor (let i = 0; i < batch.callbacks.length; i++) {\n\t\t\t\tconst value = values[i];\n\t\t\t\tif (value instanceof Error) {\n\t\t\t\t\tbatch.callbacks[i].reject(value);\n\t\t\t\t} else {\n\t\t\t\t\tbatch.callbacks[i].resolve(value);\n\t\t\t\t}\n\t\t\t}\n\t\t})\n\t\t.catch((error: unknown) => {\n\t\t\tfailedDispatch(loader, batch, error as Error);\n\t\t});\n}\n\n// Private: do not cache individual loads if the entire batch dispatch fails,\n// but still reject each request so they do not hang.\nfunction failedDispatch<K, V>(loader: DataLoader<K, V, any>, batch: Batch<K, V>, error: Error) {\n\t// Cache hits are resolved, even though the batch failed.\n\tresolveCacheHits(batch);\n\tfor (let i = 0; i < batch.keys.length; i++) {\n\t\tloader.clear(batch.keys[i]);\n\t\tbatch.callbacks[i].reject(error);\n\t}\n}\n\n// Private: Resolves the Promises for any cache hits in this batch.\nfunction resolveCacheHits(batch: Batch<any, any>) {\n\tif (batch.cacheHits) {\n\t\tfor (let i = 0; i < batch.cacheHits.length; i++) {\n\t\t\tbatch.cacheHits[i]();\n\t\t}\n\t}\n}\n\n// Private: given the DataLoader's options, produce a valid max batch size.\nfunction getValidMaxBatchSize<K, V, C>(options?: DataLoader.Options<K, V, C>): number {\n\tconst shouldBatch = !options || options.batch !== false;\n\tif (!shouldBatch) {\n\t\treturn 1;\n\t}\n\tconst maxBatchSize = options && options.maxBatchSize;\n\tif (maxBatchSize === undefined) {\n\t\treturn Infinity;\n\t}\n\tif (typeof maxBatchSize !== 'number' || maxBatchSize < 1) {\n\t\tthrow new TypeError(`maxBatchSize must be a positive number: ${maxBatchSize}`);\n\t}\n\treturn maxBatchSize;\n}\n\n// Private\nfunction getValidBatchScheduleFn<K, V, C>(\n\toptions?: DataLoader.Options<K, V, C>,\n): (cb: () => void) => void {\n\tconst batchScheduleFn = options && options.batchScheduleFn;\n\tif (batchScheduleFn === undefined) {\n\t\treturn enqueuePostPromiseJob;\n\t}\n\tif (typeof batchScheduleFn !== 'function') {\n\t\tthrow new TypeError(`batchScheduleFn must be a function: ${batchScheduleFn}`);\n\t}\n\treturn batchScheduleFn;\n}\n\n// Private: given the DataLoader's options, produce a cache key function.\nfunction getValidCacheKeyFn<K, V, C>(options?: DataLoader.Options<K, V, C>): (key: K) => C {\n\tconst cacheKeyFn = options && options.cacheKeyFn;\n\tif (cacheKeyFn === undefined) {\n\t\treturn (key: K) => key as unknown as C;\n\t}\n\tif (typeof cacheKeyFn !== 'function') {\n\t\tthrow new TypeError(`cacheKeyFn must be a function: ${cacheKeyFn}`);\n\t}\n\treturn cacheKeyFn;\n}\n\n// Private: given the DataLoader's options, produce a CacheMap to be used.\nfunction getValidCacheMap<K, V, C>(\n\toptions?: DataLoader.Options<K, V, C>,\n): DataLoader.CacheMap<C, Promise<V>> | null {\n\tconst shouldCache = !options || options.cache !== false;\n\tif (!shouldCache) {\n\t\treturn null;\n\t}\n\tconst cacheMap = options && options.cacheMap;\n\tif (cacheMap === undefined) {\n\t\treturn new Map();\n\t}\n\tif (cacheMap !== null) {\n\t\tconst cacheFunctions = ['get', 'set', 'delete', 'clear'] as const;\n\t\tconst missingFunctions = cacheFunctions.filter(\n\t\t\t(fnName) => cacheMap && typeof cacheMap[fnName] !== 'function',\n\t\t);\n\t\tif (missingFunctions.length !== 0) {\n\t\t\tthrow new TypeError('Custom cacheMap missing methods: ' + missingFunctions.join(', '));\n\t\t}\n\t}\n\treturn cacheMap;\n}\n\nfunction getValidName<K, V, C>(options?: DataLoader.Options<K, V, C>): string | null {\n\tif (options && options.name) {\n\t\treturn options.name;\n\t}\n\n\treturn null;\n}\n\nfunction isArrayLike(x: unknown): x is ArrayLike<unknown> {\n\treturn (\n\t\ttypeof x === 'object' &&\n\t\tx !== null &&\n\t\t'length' in x &&\n\t\ttypeof x.length === 'number' &&\n\t\t(x.length === 0 || (x.length > 0 && Object.prototype.hasOwnProperty.call(x, x.length - 1)))\n\t);\n}\n\nexport declare namespace DataLoader {\n\t// If a custom cache is provided, it must be of this type (a subset of ES6 Map).\n\texport type CacheMap<K, V> = {\n\t\tget(key: K): V | void;\n\t\tset(key: K, value: V): any;\n\t\tdelete(key: K): any;\n\t\tclear(): any;\n\t};\n\n\t// A Function, which when given an Array of keys, returns a Promise of an Array\n\t// of values or Errors.\n\texport type BatchLoadFn<K, V> = (keys: ReadonlyArray<K>) => PromiseLike<ArrayLike<V | Error>>;\n\n\t// Optionally turn off batching or caching or provide a cache key function or a\n\t// custom cache instance.\n\texport type Options<K, V, C = K> = {\n\t\t/**\n\t\t * Default `true`. Set to `false` to disable batching, invoking\n\t\t * `batchLoadFn` with a single load key. This is equivalent to setting\n\t\t * `maxBatchSize` to `1`.\n\t\t */\n\t\tbatch?: boolean;\n\n\t\t/**\n\t\t * Default `Infinity`. Limits the number of items that get passed in to the\n\t\t * `batchLoadFn`. May be set to `1` to disable batching.\n\t\t */\n\t\tmaxBatchSize?: number;\n\n\t\t/**\n\t\t * Default see https://github.com/graphql/dataloader#batch-scheduling.\n\t\t * A function to schedule the later execution of a batch. The function is\n\t\t * expected to call the provided callback in the immediate future.\n\t\t */\n\t\tbatchScheduleFn?: (callback: () => void) => void;\n\n\t\t/**\n\t\t * Default `true`. Set to `false` to disable memoization caching, creating a\n\t\t * new Promise and new key in the `batchLoadFn` for every load of the same\n\t\t * key. This is equivalent to setting `cacheMap` to `null`.\n\t\t */\n\t\tcache?: boolean;\n\n\t\t/**\n\t\t * Default `key => key`. Produces cache key for a given load key. Useful\n\t\t * when keys are objects and two objects should be considered equivalent.\n\t\t */\n\t\tcacheKeyFn?: (key: K) => C;\n\n\t\t/**\n\t\t * Default `new Map()`. Instance of `Map` (or an object with a similar API)\n\t\t * to be used as cache. May be set to `null` to disable caching.\n\t\t */\n\t\tcacheMap?: CacheMap<C, Promise<V>> | null;\n\n\t\t/**\n\t\t * The name given to this `DataLoader` instance. Useful for APM tools.\n\t\t *\n\t\t * Is `null` if not set in the constructor.\n\t\t */\n\t\tname?: string | null;\n\t};\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;AAsBA,IAAa,aAAb,MAAqC;CACpC,YAAY,aAA2C,SAAuC;AAC7F,MAAI,OAAO,gBAAgB,WAC1B,OAAM,IAAI,UACT,uHAC2D,YAAY,GACvE;AAEF,OAAK,eAAe;AACpB,OAAK,gBAAgB,qBAAqB,QAAQ;AAClD,OAAK,mBAAmB,wBAAwB,QAAQ;AACxD,OAAK,cAAc,mBAAmB,QAAQ;AAC9C,OAAK,YAAY,iBAAiB,QAAQ;AAC1C,OAAK,SAAS;AACd,OAAK,OAAO,aAAa,QAAQ;;;;;CAclC,KAAK,KAAoB;AACxB,MAAI,QAAQ,QAAQ,QAAQ,OAC3B,OAAM,IAAI,UACT,oEAAoE,OAAO,IAAI,CAAC,GAChF;EAGF,MAAM,QAAQ,gBAAgB,KAAK;EACnC,MAAM,WAAW,KAAK;EACtB,IAAI;AAGJ,MAAI,UAAU;AACb,cAAW,KAAK,YAAY,IAAI;GAChC,MAAM,gBAAgB,SAAS,IAAI,SAAS;AAC5C,OAAI,eAAe;IAClB,MAAM,YAAY,MAAM,cAAc,MAAM,YAAY,EAAE;AAC1D,WAAO,IAAI,SAAS,YAAY;AAC/B,eAAU,WAAW;AACpB,cAAQ,cAAc;OACrB;MACD;;;AAMJ,QAAM,KAAK,KAAK,IAAI;EACpB,MAAM,UAAU,IAAI,SAAY,SAAS,WAAW;AACnD,SAAM,UAAU,KAAK;IAAE;IAAS;IAAQ,CAAC;IACxC;AAGF,MAAI,SACH,UAAS,IAAI,UAAW,QAAQ;AAGjC,SAAO;;;;;;;;;;;;;;;;;;;;;;CAuBR,SAAS,MAAmD;AAC3D,MAAI,CAAC,YAAY,KAAK,CACrB,OAAM,IAAI,UACT,2EAA2E,KAAK,GAChF;EAGF,MAAM,eAAe,EAAE;AACvB,OAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,IAChC,cAAa,KAAK,KAAK,KAAK,KAAK,GAAG,CAAC,OAAO,UAAU,MAAM,CAAC;AAE9D,SAAO,QAAQ,IAAI,aAAa;;;;;;CAOjC,MAAM,KAAc;EACnB,MAAM,WAAW,KAAK;AACtB,MAAI,UAAU;GACb,MAAM,WAAW,KAAK,YAAY,IAAI;AACtC,YAAS,OAAO,SAAS;;AAE1B,SAAO;;;;;;;CAQR,WAAiB;EAChB,MAAM,WAAW,KAAK;AACtB,MAAI,SACH,UAAS,OAAO;AAEjB,SAAO;;;;;;;;CASR,MAAM,KAAQ,OAAqC;EAClD,MAAM,WAAW,KAAK;AACtB,MAAI,UAAU;GACb,MAAM,WAAW,KAAK,YAAY,IAAI;AAGtC,OAAI,SAAS,IAAI,SAAS,KAAK,QAAW;IAGzC,IAAI;AACJ,QAAI,iBAAiB,OAAO;AAC3B,eAAU,QAAQ,OAAO,MAAM;AAG/B,aAAQ,YAAY,GAAG;UAEvB,WAAU,QAAQ,QAAQ,MAAM;AAEjC,aAAS,IAAI,UAAU,QAAQ;;;AAGjC,SAAO;;;AAqCT,MAAM,wBAEL,OAAO,YAAY,YAAY,OAAO,QAAQ,aAAa,aACxD,SAAU,IAAI;AACd,KAAI,CAAC,gBACJ,mBAAkB,QAAQ,SAAS;AAEpC,iBAAgB,WAAW;AAE1B,UAAQ,SAAS,GAAG;GACnB;IAGH,OAAO,iBAAiB,aACtB,SAAU,IAAI;AAEd,cAAa,GAAG;IAEhB,SAAU,IAAI;AACd,YAAW,GAAG;;AAInB,IAAI;AAeJ,SAAS,gBAAsB,QAA4C;CAG1E,MAAM,gBAAgB,OAAO;AAC7B,KACC,kBAAkB,QAClB,CAAC,cAAc,iBACf,cAAc,KAAK,SAAS,OAAO,cAEnC,QAAO;CAIR,MAAM,WAAW;EAAE,eAAe;EAAO,MAAM,EAAE;EAAE,WAAW,EAAE;EAAE;AAGlE,QAAO,SAAS;AAGhB,QAAO,uBAAuB;AAC7B,gBAAc,QAAQ,SAAS;GAC9B;AAEF,QAAO;;AAGR,SAAS,cAAoB,QAA+B,OAAoB;AAE/E,OAAM,gBAAgB;AAGtB,KAAI,MAAM,KAAK,WAAW,GAAG;AAC5B,mBAAiB,MAAM;AACvB;;CAKD,IAAI;AACJ,KAAI;AACH,iBAAe,OAAO,aAAa,MAAM,KAAK;UACtC,GAAG;AACX,SAAO,eACN,QACA,uBACA,IAAI,UACH,sJAE2B,OAAO,EAAE,CAAC,GACrC,CACD;;AAIF,KAAI,CAAC,gBAAgB,OAAO,aAAa,SAAS,WACjD,QAAO,eACN,QACA,uBACA,IAAI,UACH,yJAE0B,OAAO,aAAa,CAAC,GAC/C,CACD;AAIF,SAAQ,QAAQ,aAAa,CAC3B,MAAM,WAAW;AAEjB,MAAI,CAAC,YAAY,OAAO,CACvB,OAAM,IAAI,UACT,qKAEsC,OAAO,OAAO,CAAC,GACrD;AAEF,MAAI,OAAO,WAAW,MAAM,KAAK,OAChC,OAAM,IAAI,UACT,uNAIe,OAAO,MAAM,KAAK,gBAChB,OAAO,OAAO,GAC/B;AAIF,mBAAiB,MAAM;AAGvB,OAAK,IAAI,IAAI,GAAG,IAAI,MAAM,UAAU,QAAQ,KAAK;GAChD,MAAM,QAAQ,OAAO;AACrB,OAAI,iBAAiB,MACpB,OAAM,UAAU,GAAG,OAAO,MAAM;OAEhC,OAAM,UAAU,GAAG,QAAQ,MAAM;;GAGlC,CACD,OAAO,UAAmB;AAC1B,iBAAe,QAAQ,OAAO,MAAe;GAC5C;;AAKJ,SAAS,eAAqB,QAA+B,OAAoB,OAAc;AAE9F,kBAAiB,MAAM;AACvB,MAAK,IAAI,IAAI,GAAG,IAAI,MAAM,KAAK,QAAQ,KAAK;AAC3C,SAAO,MAAM,MAAM,KAAK,GAAG;AAC3B,QAAM,UAAU,GAAG,OAAO,MAAM;;;AAKlC,SAAS,iBAAiB,OAAwB;AACjD,KAAI,MAAM,UACT,MAAK,IAAI,IAAI,GAAG,IAAI,MAAM,UAAU,QAAQ,IAC3C,OAAM,UAAU,IAAI;;AAMvB,SAAS,qBAA8B,SAA+C;AAErF,KAAI,EADgB,CAAC,WAAW,QAAQ,UAAU,OAEjD,QAAO;CAER,MAAM,eAAe,WAAW,QAAQ;AACxC,KAAI,iBAAiB,OACpB,QAAO;AAER,KAAI,OAAO,iBAAiB,YAAY,eAAe,EACtD,OAAM,IAAI,UAAU,2CAA2C,eAAe;AAE/E,QAAO;;AAIR,SAAS,wBACR,SAC2B;CAC3B,MAAM,kBAAkB,WAAW,QAAQ;AAC3C,KAAI,oBAAoB,OACvB,QAAO;AAER,KAAI,OAAO,oBAAoB,WAC9B,OAAM,IAAI,UAAU,uCAAuC,kBAAkB;AAE9E,QAAO;;AAIR,SAAS,mBAA4B,SAAsD;CAC1F,MAAM,aAAa,WAAW,QAAQ;AACtC,KAAI,eAAe,OAClB,SAAQ,QAAW;AAEpB,KAAI,OAAO,eAAe,WACzB,OAAM,IAAI,UAAU,kCAAkC,aAAa;AAEpE,QAAO;;AAIR,SAAS,iBACR,SAC4C;AAE5C,KAAI,EADgB,CAAC,WAAW,QAAQ,UAAU,OAEjD,QAAO;CAER,MAAM,WAAW,WAAW,QAAQ;AACpC,KAAI,aAAa,OAChB,wBAAO,IAAI,KAAK;AAEjB,KAAI,aAAa,MAAM;EAEtB,MAAM,mBADiB;GAAC;GAAO;GAAO;GAAU;GAAQ,CAChB,QACtC,WAAW,YAAY,OAAO,SAAS,YAAY,WACpD;AACD,MAAI,iBAAiB,WAAW,EAC/B,OAAM,IAAI,UAAU,sCAAsC,iBAAiB,KAAK,KAAK,CAAC;;AAGxF,QAAO;;AAGR,SAAS,aAAsB,SAAsD;AACpF,KAAI,WAAW,QAAQ,KACtB,QAAO,QAAQ;AAGhB,QAAO;;AAGR,SAAS,YAAY,GAAqC;AACzD,QACC,OAAO,MAAM,YACb,MAAM,QACN,YAAY,KACZ,OAAO,EAAE,WAAW,aACnB,EAAE,WAAW,KAAM,EAAE,SAAS,KAAK,OAAO,UAAU,eAAe,KAAK,GAAG,EAAE,SAAS,EAAE"}

package/dist/hex.d.mts

@@ -0,0 +1,6 @@
+//#region src/hex.d.ts
+declare function fromHex(hexStr: string): Uint8Array<ArrayBuffer>;
+declare function toHex(bytes: Uint8Array): string;
+//#endregion
+export { fromHex, toHex };
+//# sourceMappingURL=hex.d.mts.map

package/dist/hex.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hex.d.mts","names":[],"sources":["../src/hex.ts"],"mappings":";iBAGgB,OAAA,CAAQ,MAAA,WAAiB,UAAA,CAAW,WAAA;AAAA,iBAYpC,KAAA,CAAM,KAAA,EAAO,UAAA"}

package/dist/hex.mjs

@@ -0,0 +1,15 @@
+//#region src/hex.ts
+function fromHex(hexStr) {
+	const normalized = hexStr.startsWith("0x") ? hexStr.slice(2) : hexStr;
+	const padded = normalized.length % 2 === 0 ? normalized : `0${normalized}`;
+	const intArr = padded.match(/[0-9a-fA-F]{2}/g)?.map((byte) => parseInt(byte, 16)) ?? [];
+	if (intArr.length !== padded.length / 2) throw new Error(`Invalid hex string ${hexStr}`);
+	return Uint8Array.from(intArr);
+}
+function toHex(bytes) {
+	return bytes.reduce((str, byte) => str + byte.toString(16).padStart(2, "0"), "");
+}
+
+//#endregion
+export { fromHex, toHex };
+//# sourceMappingURL=hex.mjs.map

package/dist/hex.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"hex.mjs","names":[],"sources":["../src/hex.ts"],"sourcesContent":["// Copyright (c) Mysten Labs, Inc.\n// SPDX-License-Identifier: Apache-2.0\n\nexport function fromHex(hexStr: string): Uint8Array<ArrayBuffer> {\n\tconst normalized = hexStr.startsWith('0x') ? hexStr.slice(2) : hexStr;\n\tconst padded = normalized.length % 2 === 0 ? normalized : `0${normalized}`;\n\tconst intArr = padded.match(/[0-9a-fA-F]{2}/g)?.map((byte) => parseInt(byte, 16)) ?? [];\n\n\tif (intArr.length !== padded.length / 2) {\n\t\tthrow new Error(`Invalid hex string ${hexStr}`);\n\t}\n\n\treturn Uint8Array.from(intArr);\n}\n\nexport function toHex(bytes: Uint8Array): string {\n\treturn bytes.reduce((str, byte) => str + byte.toString(16).padStart(2, '0'), '');\n}\n"],"mappings":";AAGA,SAAgB,QAAQ,QAAyC;CAChE,MAAM,aAAa,OAAO,WAAW,KAAK,GAAG,OAAO,MAAM,EAAE,GAAG;CAC/D,MAAM,SAAS,WAAW,SAAS,MAAM,IAAI,aAAa,IAAI;CAC9D,MAAM,SAAS,OAAO,MAAM,kBAAkB,EAAE,KAAK,SAAS,SAAS,MAAM,GAAG,CAAC,IAAI,EAAE;AAEvF,KAAI,OAAO,WAAW,OAAO,SAAS,EACrC,OAAM,IAAI,MAAM,sBAAsB,SAAS;AAGhD,QAAO,WAAW,KAAK,OAAO;;AAG/B,SAAgB,MAAM,OAA2B;AAChD,QAAO,MAAM,QAAQ,KAAK,SAAS,MAAM,KAAK,SAAS,GAAG,CAAC,SAAS,GAAG,IAAI,EAAE,GAAG"}

package/dist/index.d.mts

@@ -0,0 +1,9 @@
+import { fromBase58, toBase58 } from "./b58.mjs";
+import { fromBase64, toBase64 } from "./b64.mjs";
+import { fromHex, toHex } from "./hex.mjs";
+import { Simplify, UnionToIntersection } from "./types.mjs";
+import { chunk } from "./chunk.mjs";
+import { PromiseWithResolvers, promiseWithResolvers } from "./with-resolver.mjs";
+import { DataLoader } from "./dataloader.mjs";
+import { Emitter, EventHandlerMap, Handler, WildcardHandler, mitt } from "./mitt.mjs";
+export { DataLoader, type Emitter, type EventHandlerMap, type Handler, type PromiseWithResolvers, type Simplify, type UnionToIntersection, type WildcardHandler, chunk, fromBase58, fromBase64, fromHex, mitt, promiseWithResolvers, toBase58, toBase64, toHex };

package/dist/index.mjs

@@ -0,0 +1,9 @@
+import { fromBase58, toBase58 } from "./b58.mjs";
+import { fromBase64, toBase64 } from "./b64.mjs";
+import { fromHex, toHex } from "./hex.mjs";
+import { chunk } from "./chunk.mjs";
+import { promiseWithResolvers } from "./with-resolver.mjs";
+import { DataLoader } from "./dataloader.mjs";
+import mitt from "./mitt.mjs";
+
+export { DataLoader, chunk, fromBase58, fromBase64, fromHex, mitt, promiseWithResolvers, toBase58, toBase64, toHex };

package/dist/mitt.d.mts

@@ -0,0 +1,32 @@
+//#region src/mitt.d.ts
+/**
+ * Mitt - Tiny (~200b) functional event emitter / pubsub.
+ *
+ * Vendored from: https://github.com/developit/mitt
+ * License: MIT
+ * Copyright (c) 2021 Jason Miller
+ */
+type EventType = string | symbol;
+type Handler<T = unknown> = (event: T) => void;
+type WildcardHandler<T = Record<string, unknown>> = (type: keyof T, event: T[keyof T]) => void;
+type EventHandlerList<T = unknown> = Array<Handler<T>>;
+type WildCardEventHandlerList<T = Record<string, unknown>> = Array<WildcardHandler<T>>;
+type EventHandlerMap<Events extends Record<EventType, unknown>> = Map<keyof Events | '*', EventHandlerList<Events[keyof Events]> | WildCardEventHandlerList<Events>>;
+interface Emitter<Events extends Record<EventType, unknown>> {
+  all: EventHandlerMap<Events>;
+  on<Key extends keyof Events>(type: Key, handler: Handler<Events[Key]>): void;
+  on(type: '*', handler: WildcardHandler<Events>): void;
+  off<Key extends keyof Events>(type: Key, handler?: Handler<Events[Key]>): void;
+  off(type: '*', handler: WildcardHandler<Events>): void;
+  emit<Key extends keyof Events>(type: Key, event: Events[Key]): void;
+  emit<Key extends keyof Events>(type: undefined extends Events[Key] ? Key : never): void;
+}
+/**
+ * Mitt: Tiny (~200b) functional event emitter / pubsub.
+ * @name mitt
+ * @returns {Mitt}
+ */
+declare function mitt<Events extends Record<EventType, unknown>>(all?: EventHandlerMap<Events>): Emitter<Events>;
+//#endregion
+export { Emitter, EventHandlerMap, Handler, WildcardHandler, mitt };
+//# sourceMappingURL=mitt.d.mts.map

package/dist/mitt.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mitt.d.mts","names":[],"sources":["../src/mitt.ts"],"mappings":";;AAWA;;;;;AAIA;KAJY,SAAA;AAAA,KAIA,OAAA,iBAAwB,KAAA,EAAO,CAAA;AAAA,KAC/B,eAAA,KAAoB,MAAA,sBAC/B,IAAA,QAAY,CAAA,EACZ,KAAA,EAAO,CAAA,OAAQ,CAAA;AAAA,KAIJ,gBAAA,gBAAgC,KAAA,CAAM,OAAA,CAAQ,CAAA;AAAA,KAC9C,wBAAA,KAA6B,MAAA,qBAA2B,KAAA,CAAM,eAAA,CAAgB,CAAA;AAAA,KAG9E,eAAA,gBAA+B,MAAA,CAAO,SAAA,cAAuB,GAAA,OAClE,MAAA,QACN,gBAAA,CAAiB,MAAA,OAAa,MAAA,KAAW,wBAAA,CAAyB,MAAA;AAAA,UAGlD,OAAA,gBAAuB,MAAA,CAAO,SAAA;EAC9C,GAAA,EAAK,eAAA,CAAgB,MAAA;EAErB,EAAA,mBAAqB,MAAA,EAAQ,IAAA,EAAM,GAAA,EAAK,OAAA,EAAS,OAAA,CAAQ,MAAA,CAAO,GAAA;EAChE,EAAA,CAAG,IAAA,OAAW,OAAA,EAAS,eAAA,CAAgB,MAAA;EAEvC,GAAA,mBAAsB,MAAA,EAAQ,IAAA,EAAM,GAAA,EAAK,OAAA,GAAU,OAAA,CAAQ,MAAA,CAAO,GAAA;EAClE,GAAA,CAAI,IAAA,OAAW,OAAA,EAAS,eAAA,CAAgB,MAAA;EAExC,IAAA,mBAAuB,MAAA,EAAQ,IAAA,EAAM,GAAA,EAAK,KAAA,EAAO,MAAA,CAAO,GAAA;EACxD,IAAA,mBAAuB,MAAA,EAAQ,IAAA,oBAAwB,MAAA,CAAO,GAAA,IAAO,GAAA;AAAA;;;;;;iBAQ9C,IAAA,gBAAoB,MAAA,CAAO,SAAA,WAAA,CAClD,GAAA,GAAM,eAAA,CAAgB,MAAA,IACpB,OAAA,CAAQ,MAAA"}