foxts 0.0.0 → 1.0.5

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2024 Sukka
+
+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.

package/README.md

@@ -0,0 +1,24 @@
+# foxts
+
+Opinionated collection of common JavaScript / TypeScript utils by [@SukkaW](https://github.com/SukkaW).
+
+- Dual Bundle
+- Tree-shakable ESM/CJS
+- Fully typed
+
+## License
+
+[MIT](./LICENSE)
+
+----
+
+**foxts** © [Sukka](https://github.com/SukkaW), Released under the [MIT](./LICENSE) License.
+Authored and maintained by Sukka with help from contributors ([list](https://github.com/SukkaW/foxts/graphs/contributors)).
+
+> [Personal Website](https://skk.moe) · [Blog](https://blog.skk.moe) · GitHub [@SukkaW](https://github.com/SukkaW) · Telegram Channel [@SukkaChannel](https://t.me/SukkaChannel) · Mastodon [@sukka@acg.mn](https://acg.mn/@sukka) · Twitter [@isukkaw](https://twitter.com/isukkaw) · Keybase [@sukka](https://keybase.io/sukka)
+
+<p align="center">
+  <a href="https://github.com/sponsors/SukkaW/">
+    <img src="https://sponsor.cdn.skk.moe/sponsors.svg"/>
+  </a>
+</p>

package/append-set-elements-to-array/index.cjs

@@ -0,0 +1 @@
+"use strict";var e=require("../identity/index.cjs");function r(e,r,t){let n;const i=r.values();for(;!(n=i.next()).done;)e.push(t(n.value));return e}exports.appendSetElementsToArray=function(t,n,i=e.identity){if(!Array.isArray(n))return r(t,n,i);for(let e=0,u=n.length;e<u;e++)r(t,n[e],i);return t};

package/append-set-elements-to-array/index.d.ts

@@ -0,0 +1,3 @@
+declare function appendSetElementsToArray<T>(dest: T[], source: Set<T> | Array<Set<T>>, transformer?: (item: T) => T): T[];
+
+export { appendSetElementsToArray };

package/append-set-elements-to-array/index.mjs

@@ -0,0 +1 @@
+import{identity as e}from"../identity/index.mjs";function r(e,r,t){let n;const o=r.values();for(;!(n=o.next()).done;)e.push(t(n.value));return e}function t(n,o,i=e){if(!Array.isArray(o))return r(n,o,i);for(let e=0,t=o.length;e<t;e++)r(n,o[e],i);return n}export{t as appendSetElementsToArray};

package/async-write-to-stream/index.cjs

@@ -0,0 +1 @@
+"use strict";var e=require("node:events");exports.asyncWriteToStream=function(r,n){return r.write(n)?null:e.once(r,"drain")};

package/async-write-to-stream/index.d.ts

@@ -0,0 +1,18 @@
+import { Writable } from 'node:stream';
+
+/**
+ * A small utility function for writing chunk to a stream, and only return promise when needed (stream backpressure)
+ *
+ * ```ts
+ * const writeStream = fs.createWriteStream(outputFile);
+ * for (const line of source) {
+ *   const p = asyncWriteToStream(writeStream, line + '\n');
+ *   if (p) {
+ *     // eslint-disable-next-line no-await-in-loop -- stream backpressure
+ *     await p;
+ *   }
+ * }
+ */
+declare function asyncWriteToStream<T>(stream: Writable, chunk: T): Promise<unknown> | null;
+
+export { asyncWriteToStream };

package/async-write-to-stream/index.mjs

@@ -0,0 +1 @@
+import{once as r}from"node:events";function e(e,n){return e.write(n)?null:r(e,"drain")}export{e as asyncWriteToStream};

package/bitwise/index.cjs

@@ -0,0 +1 @@
+"use strict";const t=t=>t>>16&65535,e=t=>65535&t,r=t=>t>>20&1023,s=t=>t>>10&1023,o=t=>1023&t;exports.bitCount=function(t){return t-=t>>1&0x55555555,((t=(0x33333333&t)+(t>>2&0x33333333))+(t>>4)&0xf0f0f0f)*0x1010101>>24},exports.deleteBit=(t,e)=>t&~e,exports.getBit=(t,e)=>!!(t&e),exports.missingBit=(t,e)=>!(t&e),exports.packThreeBits=(t,e,r)=>t<<20|e<<10|r,exports.packTwoBits=(t,e)=>t<<16|e,exports.setBit=(t,e)=>t|e,exports.unpackThreeBits=function(t,e=Array.from([,,,].keys())){return e[0]=r(t),e[1]=s(t),e[2]=o(t),e},exports.unpackThreeBitsFirst=r,exports.unpackThreeBitsSecond=s,exports.unpackThreeBitsThird=o,exports.unpackTwoBits=function(r,s=Array.from([,,].keys())){return s[0]=t(r),s[1]=e(r),s},exports.unpackTwoBitsFirst=t,exports.unpackTwoBitsSecond=e;

package/bitwise/index.d.ts

@@ -0,0 +1,30 @@
+declare function bitCount(n: number): number;
+declare const getBit: (n: number, mask: number) => boolean;
+declare const missingBit: (n: number, mask: number) => boolean;
+declare const setBit: (n: number, mask: number) => number;
+declare const deleteBit: (n: number, mask: number) => number;
+/** Packs two 16-bit integers (0~65535) into one 32-bit integer */
+declare const packTwoBits: (a: number, b: number) => number;
+declare const unpackTwoBitsFirst: (value: number) => number;
+declare const unpackTwoBitsSecond: (value: number) => number;
+/**
+ * Unpacks two 16-bit integers (0~65535) from one 32-bit integer
+ *
+ * @param value - The 32-bit integer to unpack
+ * @param arr - An optional array to store the unpacked values, useful if you are trying to re-use arrays
+ */
+declare function unpackTwoBits(value: number, arr?: [a: number, b: number]): [a: number, b: number];
+/** Packs three 10-bit integers (0~1023) into one 32-bit integer */
+declare const packThreeBits: (a: number, b: number, c: number) => number;
+declare const unpackThreeBitsFirst: (value: number) => number;
+declare const unpackThreeBitsSecond: (value: number) => number;
+declare const unpackThreeBitsThird: (value: number) => number;
+/**
+ * Unpacks three 10-bit integers (0~1023) from one 32-bit integer
+ *
+ * @param value - The 32-bit integer to unpack
+ * @param arr - An optional array to store the unpacked values, useful if you are trying to re-use arrays
+ */
+declare function unpackThreeBits(value: number, arr?: [a: number, b: number, c: number]): [a: number, b: number, c: number];
+
+export { bitCount, deleteBit, getBit, missingBit, packThreeBits, packTwoBits, setBit, unpackThreeBits, unpackThreeBitsFirst, unpackThreeBitsSecond, unpackThreeBitsThird, unpackTwoBits, unpackTwoBitsFirst, unpackTwoBitsSecond };

package/bitwise/index.mjs

@@ -0,0 +1 @@
+function t(t){return t-=t>>1&0x55555555,((t=(0x33333333&t)+(t>>2&0x33333333))+(t>>4)&0xf0f0f0f)*0x1010101>>24}const e=(t,e)=>!!(t&e),i=(t,e)=>!(t&e),n=(t,e)=>t|e,r=(t,e)=>t&~e,s=(t,e)=>t<<16|e,c=t=>t>>16&65535,o=t=>65535&t;function u(t,e=Array.from([,,].keys())){return e[0]=c(t),e[1]=o(t),e}const B=(t,e,i)=>t<<20|e<<10|i,a=t=>t>>20&1023,k=t=>t>>10&1023,p=t=>1023&t;function T(t,e=Array.from([,,,].keys())){return e[0]=a(t),e[1]=k(t),e[2]=p(t),e}export{t as bitCount,r as deleteBit,e as getBit,i as missingBit,B as packThreeBits,s as packTwoBits,n as setBit,T as unpackThreeBits,a as unpackThreeBitsFirst,k as unpackThreeBitsSecond,p as unpackThreeBitsThird,u as unpackTwoBits,c as unpackTwoBitsFirst,o as unpackTwoBitsSecond};

package/fast-string-array-join/index.cjs

@@ -0,0 +1 @@
+"use strict";exports.fastStringArrayJoin=function(t,r){const n=t.length;if(0===n)return"";let e=t[0];for(let i=1;i<n;i++)e+=r,e+=t[i];return e};

package/fast-string-array-join/index.d.ts

@@ -0,0 +1,6 @@
+/**
+ * A 65% faster join than the native `Array.prototype.join` for string arrays and string separator.
+ */
+declare function fastStringArrayJoin(arr: string[], sep: string): string;
+
+export { fastStringArrayJoin };

package/fast-string-array-join/index.mjs

@@ -0,0 +1 @@
+function t(t,r){const n=t.length;if(0===n)return"";let e=t[0];for(let o=1;o<n;o++)e+=r,e+=t[o];return e}export{t as fastStringArrayJoin};

package/fnv1a/index.cjs

@@ -0,0 +1 @@
+"use strict";exports.fnv1a=function(t){let e=0x811c9dc5;for(let r=0,c=t.length;r<c;r++)e^=t.charCodeAt(r),e+=(e<<1)+(e<<4)+(e<<7)+(e<<8)+(e<<24);return e>>>0};

package/fnv1a/index.d.ts

@@ -0,0 +1,3 @@
+declare function fnv1a(s: string): number;
+
+export { fnv1a };

package/fnv1a/index.mjs

@@ -0,0 +1 @@
+function t(t){let e=0x811c9dc5;for(let n=0,r=t.length;n<r;n++)e^=t.charCodeAt(n),e+=(e<<1)+(e<<4)+(e<<7)+(e<<8)+(e<<24);return e>>>0}export{t as fnv1a};

package/fnv1a52/index.cjs

@@ -0,0 +1 @@
+"use strict";exports.fnv1a52=function(t){const e=t.length;let n=0,r=0,o=8997,c=0,s=33826,f=0,u=40164,x=0,a=52210;for(;n<e;)o^=t.charCodeAt(n++),r=435*o,c=435*s,f=435*u,x=435*a,f+=o<<8,x+=s<<8,c+=r>>>16,o=65535&r,f+=c>>>16,s=65535&c,a=x+(f>>>16)&65535,u=65535&f;return(15&a)*0x1000000000000+0x100000000*u+65536*s+(o^a>>4)};

package/fnv1a52/index.d.ts

@@ -0,0 +1,12 @@
+/**
+ * FNV-1a Hash implementation
+ * @author Travis Webb (tjwebb) <me@traviswebb.com>
+ *
+ * Ported from https://github.com/tjwebb/fnv-plus/blob/master/index.js
+ *
+ * Simplified, optimized and add modified for 52 bit, which provides a larger hash space
+ * and still making use of Javascript's 53-bit integer space.
+ */
+declare function fnv1a52(str: string): number;
+
+export { fnv1a52 };

package/fnv1a52/index.mjs

@@ -0,0 +1 @@
+function t(t){const n=t.length;let e=0,o=0,r=8997,c=0,f=33826,x=0,a=40164,h=0,l=52210;for(;e<n;)r^=t.charCodeAt(e++),o=435*r,c=435*f,x=435*a,h=435*l,x+=r<<8,h+=f<<8,c+=o>>>16,r=65535&o,x+=c>>>16,f=65535&c,l=h+(x>>>16)&65535,a=65535&x;return(15&l)*0x1000000000000+0x100000000*a+65536*f+(r^l>>4)}export{t as fnv1a52};

package/guard/index.cjs

@@ -0,0 +1 @@
+"use strict";function r(r){switch(r){case null:return r=>null!==r;case void 0:return r=>void 0!==r;case!1:return r=>!1!==r;case"nullish":return r=>null!=r;case"falsy":return r=>!!r;default:throw TypeError("Invalid argument")}}function t(r){switch(r){case null:return r=>null===r;case void 0:return r=>void 0===r;case!1:return r=>!1===r;case"nullish":return r=>null==r;case"falsy":return r=>!r;case"truthy":return r=>!!r;default:throw TypeError("Invalid argument")}}const e=t("truthy"),s=t("falsy"),n=r(null),u=r("nullish");exports.is=t,exports.isFalsy=s,exports.isNonNull=n,exports.isNonNullish=u,exports.isTruthy=e,exports.not=r;

package/guard/index.d.ts

@@ -0,0 +1,17 @@
+declare function not(arg: null): <T>(i: T | null) => i is T;
+declare function not(arg: undefined): <T>(i: T | undefined) => i is T;
+declare function not(arg: false): <T>(i: T | false) => i is T;
+declare function not(arg: 'nullish'): <T>(i: T | null | undefined) => i is T;
+declare function not(arg: 'falsy'): <T>(i: T | 0 | '' | false | null | undefined) => i is T;
+declare function is(arg: null): (i: unknown) => i is null;
+declare function is(arg: undefined): (i: unknown) => i is undefined;
+declare function is(arg: false): (i: unknown) => i is false;
+declare function is(arg: 'nullish'): (i: unknown) => i is null | undefined;
+declare function is(arg: 'falsy'): (i: unknown) => i is 0 | '' | false | null | undefined;
+declare function is(arg: 'truthy'): <T>(i: T | 0 | '' | false | null | undefined) => i is T;
+declare const isTruthy: <T>(i: T | 0 | "" | false | null | undefined) => i is T;
+declare const isFalsy: (i: unknown) => i is 0 | "" | false | null | undefined;
+declare const isNonNull: <T>(i: T | null) => i is T;
+declare const isNonNullish: <T>(i: T | null | undefined) => i is T;
+
+export { is, isFalsy, isNonNull, isNonNullish, isTruthy, not };

package/guard/index.mjs

@@ -0,0 +1 @@
+function r(r){switch(r){case null:return r=>null!==r;case void 0:return r=>void 0!==r;case!1:return r=>!1!==r;case"nullish":return r=>null!=r;case"falsy":return r=>!!r;default:throw TypeError("Invalid argument")}}function n(r){switch(r){case null:return r=>null===r;case void 0:return r=>void 0===r;case!1:return r=>!1===r;case"nullish":return r=>null==r;case"falsy":return r=>!r;case"truthy":return r=>!!r;default:throw TypeError("Invalid argument")}}const l=n("truthy"),u=n("falsy"),e=r(null),t=r("nullish");export{n as is,u as isFalsy,e as isNonNull,t as isNonNullish,l as isTruthy,r as not};

package/headers-to-object/index.cjs

@@ -0,0 +1 @@
+"use strict";exports.headersToObject=function(e){const r={};return new Headers(e).forEach((e,t)=>{r[t]=e}),r};

package/headers-to-object/index.d.ts

@@ -0,0 +1,5 @@
+import { HeadersInitLike } from '../merge-headers/index.js';
+
+declare function headersToObject(headers: HeadersInitLike | Headers): Record<string, string>;
+
+export { headersToObject };

package/headers-to-object/index.mjs

@@ -0,0 +1 @@
+function e(e){const r={};return new Headers(e).forEach((e,n)=>{r[n]=e}),r}export{e as headersToObject};

package/identity/index.cjs

@@ -0,0 +1 @@
+"use strict";exports.identity=function(t){return t};

package/identity/index.d.ts

@@ -0,0 +1,3 @@
+declare function identity<T = any, R = T>(item: T): R;
+
+export { identity };

package/identity/index.mjs

@@ -0,0 +1 @@
+function t(t){return t}export{t as identity};

package/is-probably-ip/index.cjs

@@ -0,0 +1 @@
+"use strict";exports.isProbablyIpv4=function(t){if(t.length<7||t.length>15)return!1;let e=0;for(let r=0;r<t.length;r+=1){const n=t.charCodeAt(r);if(46===n)e+=1;else if(n<48||n>57)return!1}return 3===e&&46!==t.charCodeAt(0)&&46!==t.charCodeAt(t.length-1)},exports.isProbablyIpv6=function(t){if(t.length<3)return!1;let e="["===t[0]?1:0,r=t.length;if("]"===t[r-1]&&(r-=1),r-e>39)return!1;let n=!1;for(;e<r;e+=1){const r=t.charCodeAt(e);if(58===r)n=!0;else if(!(r>=48&&r<=57||r>=97&&r<=102||r>=65&&r<=90))return!1}return n};

package/is-probably-ip/index.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Check if a hostname is an IP. You should be aware that this only works
+ * because `hostname` is already garanteed to be a valid hostname!
+ */
+declare function isProbablyIpv4(hostname: string): boolean;
+declare function isProbablyIpv6(hostname: string): boolean;
+
+export { isProbablyIpv4, isProbablyIpv6 };

package/is-probably-ip/index.mjs

@@ -0,0 +1 @@
+function e(e){if(e.length<7||e.length>15)return!1;let t=0;for(let r=0;r<e.length;r+=1){const n=e.charCodeAt(r);if(46===n)t+=1;else if(n<48||n>57)return!1}return 3===t&&46!==e.charCodeAt(0)&&46!==e.charCodeAt(e.length-1)}function t(e){if(e.length<3)return!1;let t="["===e[0]?1:0,r=e.length;if("]"===e[r-1]&&(r-=1),r-t>39)return!1;let n=!1;for(;t<r;t+=1){const r=e.charCodeAt(t);if(58===r)n=!0;else if(!(r>=48&&r<=57||r>=97&&r<=102||r>=65&&r<=90))return!1}return n}export{e as isProbablyIpv4,t as isProbablyIpv6};

package/merge-headers/index.cjs

@@ -0,0 +1 @@
+"use strict";exports.mergeHeaders=function(e,r){const s=new Headers(e);return new Headers(r).forEach((e,r)=>{s.set(r,e)}),s};

package/merge-headers/index.d.ts

@@ -0,0 +1,4 @@
+type HeadersInitLike = string[][] | Record<string, string | readonly string[]> | Headers;
+declare function mergeHeaders(dest: HeadersInitLike, source: HeadersInitLike): Headers;
+
+export { type HeadersInitLike, mergeHeaders };

package/merge-headers/index.mjs

@@ -0,0 +1 @@
+function e(e,r){const n=new Headers(e);return new Headers(r).forEach((e,r)=>{n.set(r,e)}),n}export{e as mergeHeaders};

package/noop/index.cjs

@@ -0,0 +1 @@
+"use strict";exports.noop=function(){};

package/noop/index.d.ts

@@ -0,0 +1,3 @@
+declare function noop(): void;
+
+export { noop };

package/noop/index.mjs

@@ -0,0 +1 @@
+function o(){}export{o as noop};

package/package.json

@@ -1,15 +1,159 @@
 {
   "name": "foxts",
-  "version": "0.0.0",
-  "description": "",
-  "scripts": {},
-  "main": "",
-  "keywords": [],
-  "author": "",
+  "version": "1.0.5",
+  "description": "Opinionated collection of common TypeScript utils by @SukkaW",
+  "repository": {
+    "url": "https://github.com/SukkaW/foxts"
+  },
+  "main": "index.js",
+  "sideEffects": false,
+  "keywords": [
+    "sukka",
+    "sukkaw",
+    "utils"
+  ],
+  "author": "SukkaW <https://skk.moe>",
   "license": "MIT",
-  "packageManager": "pnpm@9.14.4+sha512.c8180b3fbe4e4bca02c94234717896b5529740a6cbadf19fa78254270403ea2f27d4e1d46a08a0f56c89b63dc8ebfd3ee53326da720273794e6200fcf0d184ab",
-  "dependencies": {
-    "@henrygd/queue": "^1.0.7",
-    "async-retry": "^1.3.3"
+  "typeVersions": {
+    ">=4.8": {
+      "*": [
+        "*"
+      ]
+    },
+    "*": {
+      "*": [
+        "ts_version_4.8_and_above_is_required.d.ts"
+      ]
+    }
+  },
+  "exports": {
+    "./package.json": "./package.json",
+    "./sizes.json": "./sizes.json",
+    "./append-set-elements-to-array": {
+      "types": "./append-set-elements-to-array/index.d.ts",
+      "import": {
+        "types": "./append-set-elements-to-array/index.d.ts",
+        "default": "./append-set-elements-to-array/index.mjs"
+      },
+      "require": "./append-set-elements-to-array/index.cjs",
+      "default": "./append-set-elements-to-array/index.cjs"
+    },
+    "./bitwise": {
+      "types": "./bitwise/index.d.ts",
+      "import": {
+        "types": "./bitwise/index.d.ts",
+        "default": "./bitwise/index.mjs"
+      },
+      "require": "./bitwise/index.cjs",
+      "default": "./bitwise/index.cjs"
+    },
+    "./async-write-to-stream": {
+      "types": "./async-write-to-stream/index.d.ts",
+      "import": {
+        "types": "./async-write-to-stream/index.d.ts",
+        "default": "./async-write-to-stream/index.mjs"
+      },
+      "require": "./async-write-to-stream/index.cjs",
+      "default": "./async-write-to-stream/index.cjs"
+    },
+    "./fnv1a": {
+      "types": "./fnv1a/index.d.ts",
+      "import": {
+        "types": "./fnv1a/index.d.ts",
+        "default": "./fnv1a/index.mjs"
+      },
+      "require": "./fnv1a/index.cjs",
+      "default": "./fnv1a/index.cjs"
+    },
+    "./fast-string-array-join": {
+      "types": "./fast-string-array-join/index.d.ts",
+      "import": {
+        "types": "./fast-string-array-join/index.d.ts",
+        "default": "./fast-string-array-join/index.mjs"
+      },
+      "require": "./fast-string-array-join/index.cjs",
+      "default": "./fast-string-array-join/index.cjs"
+    },
+    "./fnv1a52": {
+      "types": "./fnv1a52/index.d.ts",
+      "import": {
+        "types": "./fnv1a52/index.d.ts",
+        "default": "./fnv1a52/index.mjs"
+      },
+      "require": "./fnv1a52/index.cjs",
+      "default": "./fnv1a52/index.cjs"
+    },
+    "./guard": {
+      "types": "./guard/index.d.ts",
+      "import": {
+        "types": "./guard/index.d.ts",
+        "default": "./guard/index.mjs"
+      },
+      "require": "./guard/index.cjs",
+      "default": "./guard/index.cjs"
+    },
+    "./headers-to-object": {
+      "types": "./headers-to-object/index.d.ts",
+      "import": {
+        "types": "./headers-to-object/index.d.ts",
+        "default": "./headers-to-object/index.mjs"
+      },
+      "require": "./headers-to-object/index.cjs",
+      "default": "./headers-to-object/index.cjs"
+    },
+    "./identity": {
+      "types": "./identity/index.d.ts",
+      "import": {
+        "types": "./identity/index.d.ts",
+        "default": "./identity/index.mjs"
+      },
+      "require": "./identity/index.cjs",
+      "default": "./identity/index.cjs"
+    },
+    "./is-probably-ip": {
+      "types": "./is-probably-ip/index.d.ts",
+      "import": {
+        "types": "./is-probably-ip/index.d.ts",
+        "default": "./is-probably-ip/index.mjs"
+      },
+      "require": "./is-probably-ip/index.cjs",
+      "default": "./is-probably-ip/index.cjs"
+    },
+    "./noop": {
+      "types": "./noop/index.d.ts",
+      "import": {
+        "types": "./noop/index.d.ts",
+        "default": "./noop/index.mjs"
+      },
+      "require": "./noop/index.cjs",
+      "default": "./noop/index.cjs"
+    },
+    "./simple-string-hash": {
+      "types": "./simple-string-hash/index.d.ts",
+      "import": {
+        "types": "./simple-string-hash/index.d.ts",
+        "default": "./simple-string-hash/index.mjs"
+      },
+      "require": "./simple-string-hash/index.cjs",
+      "default": "./simple-string-hash/index.cjs"
+    },
+    "./wait": {
+      "types": "./wait/index.d.ts",
+      "import": {
+        "types": "./wait/index.d.ts",
+        "default": "./wait/index.mjs"
+      },
+      "require": "./wait/index.cjs",
+      "default": "./wait/index.cjs"
+    },
+    "./merge-headers": {
+      "types": "./merge-headers/index.d.ts",
+      "import": {
+        "types": "./merge-headers/index.d.ts",
+        "default": "./merge-headers/index.mjs"
+      },
+      "require": "./merge-headers/index.cjs",
+      "default": "./merge-headers/index.cjs"
+    }
   }
-}
+}

package/simple-string-hash/index.cjs

@@ -0,0 +1 @@
+"use strict";var t=require("../fnv1a52/index.cjs");exports.simpleStringHash=function(n){return t.fnv1a52(n).toString(36)+n.length.toString(36)};

package/simple-string-hash/index.d.ts

@@ -0,0 +1,3 @@
+declare function simpleStringHash(payload: string): string;
+
+export { simpleStringHash };

package/simple-string-hash/index.mjs

@@ -0,0 +1 @@
+import{fnv1a52 as t}from"../fnv1a52/index.mjs";function n(n){return t(n).toString(36)+n.length.toString(36)}export{n as simpleStringHash};

package/wait/index.cjs

@@ -0,0 +1 @@
+"use strict";exports.wait=function(t){return new Promise(e=>{setTimeout(e,t)})};

package/wait/index.d.ts

@@ -0,0 +1,3 @@
+declare function wait(ms: number): Promise<void>;
+
+export { wait };

package/wait/index.mjs

@@ -0,0 +1 @@
+function e(e){return new Promise(t=>{setTimeout(t,e)})}export{e as wait};