tuple-ts 0.1.0 → 0.1.1

package/dist/hash.d.ts

@@ -0,0 +1,3 @@
+export declare function tupleHash(elements: readonly unknown[]): number;
+export declare function recordHash(record: Record<string, unknown>): number;
+//# sourceMappingURL=hash.d.ts.map

package/dist/hash.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash.d.ts","sourceRoot":"","sources":["../src/hash.ts"],"names":[],"mappings":"AA6GA,wBAAgB,SAAS,CAAC,QAAQ,EAAE,SAAS,OAAO,EAAE,GAAG,MAAM,CAE9D;AASD,wBAAgB,UAAU,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,MAAM,CAKlE"}

package/dist/hash.js

@@ -0,0 +1,107 @@
+const UINT32_BASE = 2n ** 32n;
+function murmurHash3Mix_32bit(keys, seed = 0) {
+    // The first (i.e., mixing) stage of the MurmurHash3 algorithm for 32-bit keys
+    let hash = seed;
+    let keyCount = 0;
+    for (const key of keys) {
+        keyCount++;
+        let k = Math.imul(key, 0xcc9e2d51);
+        k = (k << 15) | (k >>> 17); // ROTL32(k1, 15)
+        k = Math.imul(k, 0x1b873593);
+        hash ^= k;
+        hash = (hash << 13) | (hash >>> 19); // ROTL32(h1, 13);
+        hash = Math.imul(hash, 5) + 0xe6546b64;
+    }
+    hash ^= keyCount * 4; // number of input bytes
+    return hash >>> 0; // unsigned
+}
+function linearConguentialGenerator(seed = Date.now() >>> 0) {
+    let state = seed >>> 0; // Force to unsigned 32-bit
+    return () => {
+        // LCG constants from Numerical Recipes (good default)
+        state = (state * 1664525 + 1013904223) >>> 0;
+        return state;
+    };
+}
+const randomUint32 = linearConguentialGenerator();
+const tupleSeed = randomUint32();
+const recordSeed = randomUint32();
+const nullHash = randomUint32();
+const undefinedHash = randomUint32();
+const falseHash = randomUint32();
+const trueHash = randomUint32();
+const numberSeed = randomUint32();
+const bigIntSeed = randomUint32();
+const stringSeed = randomUint32();
+const registeredSymbolSeed = randomUint32();
+const objectHashMap = new WeakMap();
+function stableRandomHash(map, value) {
+    if (value === null)
+        return nullHash;
+    const hash = map.get(value);
+    if (hash !== undefined)
+        return hash;
+    const newHash = randomUint32();
+    map.set(value, newHash);
+    return newHash;
+}
+function* stringToUint32s(value) {
+    for (let i = 0; i < value.length; i += 2) {
+        const char1 = value.charCodeAt(i);
+        const char2 = value.charCodeAt(i + 1);
+        yield (char2 << 16) | char1;
+    }
+}
+function* numberToUint32s(value) {
+    const buffer = new ArrayBuffer(8); // 8 bytes = 64 bits
+    const view = new DataView(buffer);
+    view.setFloat64(0, value);
+    yield view.getUint32(0);
+    yield view.getUint32(4);
+}
+function* bigIntToUint32s(value) {
+    for (let n = value; n !== 0n; n /= UINT32_BASE) {
+        yield Number(((n % UINT32_BASE) + UINT32_BASE) % UINT32_BASE); // Safely non-negative
+    }
+}
+function valueHash(value) {
+    switch (typeof value) {
+        case "string":
+            return mixHashes(stringToUint32s(value), stringSeed);
+        case "number":
+            return mixHashes(numberToUint32s(value), numberSeed);
+        case "bigint":
+            return mixHashes(bigIntToUint32s(value), bigIntSeed);
+        case "boolean":
+            return value ? trueHash : falseHash;
+        case "symbol":
+            const k = Symbol.keyFor(value);
+            return k === undefined
+                ? stableRandomHash(objectHashMap, value)
+                : mixHashes(stringToUint32s(k), registeredSymbolSeed);
+        case "undefined":
+            return undefinedHash;
+        case "object":
+            return value === null ? nullHash : stableRandomHash(objectHashMap, value);
+        case "function":
+            return stableRandomHash(objectHashMap, value);
+    }
+}
+const mixHashes = murmurHash3Mix_32bit;
+function* valueHashes(values) {
+    for (const v of values) {
+        yield valueHash(v);
+    }
+}
+export function tupleHash(elements) {
+    return mixHashes(valueHashes(elements), tupleSeed);
+}
+function* keyAndValueHashes(record) {
+    for (const key of Object.keys(record).sort()) {
+        yield valueHash(key);
+        yield valueHash(record[key]);
+    }
+}
+export function recordHash(record) {
+    return mixHashes(keyAndValueHashes(record), recordSeed);
+}

package/dist/index.d.ts

@@ -0,0 +1,19 @@
+import InternCache from "./intern-cache";
+export { InternCache };
+export type Tuple<T extends readonly unknown[] = readonly unknown[]> = T;
+export type TupleType<T extends Tuple = Tuple> = {
+    (...t: T): T;
+    _cache: InternCache<number, T>;
+};
+export type KeyedRecordType<R extends Record<string, unknown> = Record<string, unknown>> = {
+    (r: R): R;
+    _cache: InternCache<number, R>;
+};
+export type RecordType<R extends Record<string, unknown> = Record<string, unknown>> = KeyedRecordType<R> & {
+    withKeys: <K extends readonly (keyof R)[]>(...keys: K) => KeyedRecordType<Pick<R, K[number]>>;
+};
+export declare function tupleType<T extends Tuple>(): TupleType<T>;
+export declare function recordType<T extends Record<string, unknown>>(): RecordType<T>;
+export declare const tuple: TupleType<readonly unknown[]>;
+export declare const record: RecordType<Record<string, unknown>>;
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,WAAW,MAAM,gBAAgB,CAAC;AACzC,OAAO,EAAE,WAAW,EAAE,CAAC;AAGvB,MAAM,MAAM,KAAK,CAAC,CAAC,SAAS,SAAS,OAAO,EAAE,GAAG,SAAS,OAAO,EAAE,IAAI,CAAC,CAAC;AAEzE,MAAM,MAAM,SAAS,CAAC,CAAC,SAAS,KAAK,GAAG,KAAK,IAAI;IAC/C,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACb,MAAM,EAAE,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;CAChC,CAAC;AAEF,MAAM,MAAM,eAAe,CACzB,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IACzD;IAAE,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IAAC,MAAM,EAAE,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,CAAA;CAAE,CAAC;AAElD,MAAM,MAAM,UAAU,CACpB,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IACzD,eAAe,CAAC,CAAC,CAAC,GAAG;IACvB,QAAQ,EAAE,CAAC,CAAC,SAAS,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,EACvC,GAAG,IAAI,EAAE,CAAC,KACP,eAAe,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;CAC1C,CAAC;AA4BF,wBAAgB,SAAS,CAAC,CAAC,SAAS,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,CAKzD;AAED,wBAAgB,UAAU,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,UAAU,CAAC,CAAC,CAAC,CAO7E;AAED,eAAO,MAAM,KAAK,+BAAc,CAAC;AACjC,eAAO,MAAM,MAAM,qCAAe,CAAC"}

package/dist/index.js

@@ -0,0 +1,54 @@
+import InternCache from "./intern-cache";
+export { InternCache };
+import * as hash from "./hash";
+function arrayEquivalent(a1, a2) {
+    if (a2.length !== a1.length)
+        return false;
+    for (let i = 0; i < a1.length; i++) {
+        if (!Object.is(a2[i], a1[i]))
+            return false;
+    }
+    return true;
+}
+function recordEquivalent(r1, r2) {
+    const r1Keys = Object.keys(r1);
+    const r2Keys = Object.keys(r2);
+    if (r2Keys.length !== r1Keys.length)
+        return false;
+    for (let i = 0; i < r1Keys.length; i++) {
+        const k = r1Keys[i];
+        if (!(k in r2))
+            return false;
+        if (!Object.is(r2[k], r1[k]))
+            return false;
+    }
+    return true;
+}
+export function tupleType() {
+    const _cache = new InternCache(hash.tupleHash, arrayEquivalent);
+    return Object.assign((...t) => Object.freeze(_cache.get(t)), {
+        _cache,
+    });
+}
+export function recordType() {
+    const _cache = new InternCache(hash.recordHash, recordEquivalent);
+    return Object.assign(({ ...r }) => Object.freeze(_cache.get(r)), {
+        _cache,
+        withKeys: (...keys) => recordTypeToKeyedRecordType(...keys),
+    });
+}
+export const tuple = tupleType();
+export const record = recordType();
+function recordToTuple(record, keys) {
+    return keys.map((k) => record[k]);
+}
+function recordTypeToKeyedRecordType(...keys) {
+    const _cache = new InternCache((r) => hash.tupleHash(recordToTuple(r, keys)), (r1, r2) => arrayEquivalent(recordToTuple(r1, keys), recordToTuple(r2, keys)));
+    return Object.assign((r) => {
+        const r_ = {};
+        for (const k of keys) {
+            r_[k] = r[k];
+        }
+        return Object.freeze(_cache.get(r_));
+    }, { _cache });
+}

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAOA,SAAS,cAAc,CAAC,IAAc,EAAE,IAAI,GAAG,CAAC;IAC9C,MAAM,EAAE,GAAG,UAAU,CAAC;IACtB,MAAM,EAAE,GAAG,UAAU,CAAC;IAEtB,IAAI,IAAI,GAAG,IAAI,CAAC;IAEhB,KAAK,IAAI,EAAE,IAAI,IAAI,EAAE,CAAC;QACpB,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACvB,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,iBAAiB;QAChD,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAEvB,IAAI,IAAI,EAAE,CAAC;QACX,IAAI,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,kBAAkB;QACvD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC;IACzC,CAAC;IAED,IAAI,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,wBAAwB;IAEjD,+BAA+B;IAC/B,IAAI,IAAI,IAAI,KAAK,EAAE,CAAC;IACpB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IACnC,IAAI,IAAI,IAAI,KAAK,EAAE,CAAC;IACpB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IACnC,IAAI,IAAI,IAAI,KAAK,EAAE,CAAC;IAEpB,OAAO,IAAI,KAAK,CAAC,CAAC,CAAC,WAAW;AAChC,CAAC;AAED,SAAS,0BAA0B,CAAC,OAAe,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC;IACjE,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,2BAA2B;IACnD,OAAO,GAAG,EAAE;QACV,sDAAsD;QACtD,KAAK,GAAG,CAAC,KAAK,GAAG,OAAO,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QAC7C,OAAO,KAAK,CAAC;IACf,CAAC,CAAC;AACJ,CAAC;AACD,MAAM,YAAY,GAAG,0BAA0B,EAAE,CAAC;AAElD,MAAM,SAAS,GAAG,YAAY,EAAE,CAAC;AACjC,MAAM,QAAQ,GAAG,YAAY,EAAE,CAAC;AAChC,MAAM,aAAa,GAAG,YAAY,EAAE,CAAC;AACrC,MAAM,SAAS,GAAG,YAAY,EAAE,CAAC;AACjC,MAAM,QAAQ,GAAG,YAAY,EAAE,CAAC;AAChC,MAAM,UAAU,GAAG,YAAY,EAAE,CAAC;AAClC,MAAM,UAAU,GAAG,YAAY,EAAE,CAAC;AAClC,MAAM,UAAU,GAAG,YAAY,EAAE,CAAC;AAClC,MAAM,oBAAoB,GAAG,YAAY,EAAE,CAAC;AAE5C,MAAM,aAAa,GAAG,IAAI,OAAO,EAAgB,CAAC;AAElD,SAAS,gBAAgB,CACvB,GAA0B,EAC1B,KAAsB;IAEtB,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,QAAQ,CAAC;IACpC,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,KAAe,CAAC,CAAC;IACtC,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IACpC,MAAM,OAAO,GAAG,YAAY,EAAE,CAAC;IAC/B,GAAG,CAAC,GAAG,CAAC,KAAe,EAAE,OAAO,CAAC,CAAC;IAClC,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,eAAe,CAAC,KAAa;IACpC,MAAM,OAAO,GAAG,EAAE,CAAC;IACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACzC,MAAM,KAAK,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,KAAK,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,OAAO,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC;IACtC,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,eAAe,CAAC,KAAa;IACpC,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,oBAAoB;IACvD,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC;IAClC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAC1B,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;AAChD,CAAC;AAED,SAAS,eAAe,CAAC,KAAa;IACpC,MAAM,IAAI,GAAG,EAAE,IAAI,GAAG,CAAC;IACvB,MAAM,OAAO,GAAG,EAAE,CAAC;IACnB,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;QACxC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,sBAAsB;IAC1E,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,cAAc,CAAC,KAAc;IACpC,QAAQ,OAAO,KAAK,EAAE,CAAC;QACrB,KAAK,QAAQ;YACX,OAAO,CAAC,UAAU,EAAE,GAAG,eAAe,CAAC,KAAe,CAAC,CAAC,CAAC;QAC3D,KAAK,QAAQ;YACX,OAAO,CAAC,UAAU,EAAE,GAAG,eAAe,CAAC,KAAe,CAAC,CAAC,CAAC;QAC3D,KAAK,QAAQ;YACX,OAAO,CAAC,UAAU,EAAE,GAAG,eAAe,CAAC,KAAe,CAAC,CAAC,CAAC;QAC3D,KAAK,SAAS;YACZ,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QACxC,KAAK,QAAQ;YACX,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,KAAe,CAAC,CAAC;YACzC,OAAO,CAAC,KAAK,SAAS;gBACpB,CAAC,CAAC,CAAC,gBAAgB,CAAC,aAAa,EAAE,KAAe,CAAC,CAAC;gBACpD,CAAC,CAAC,CAAC,oBAAoB,EAAE,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;QACpD,KAAK,WAAW;YACd,OAAO,CAAC,aAAa,CAAC,CAAC;QACzB,KAAK,QAAQ;YACX,OAAO,KAAK,KAAK,IAAI;gBACnB,CAAC,CAAC,CAAC,QAAQ,CAAC;gBACZ,CAAC,CAAC,CAAC,gBAAgB,CAAC,aAAa,EAAE,KAAe,CAAC,CAAC,CAAC;QACzD,KAAK,UAAU;YACb,OAAO,CAAC,gBAAgB,CAAC,aAAa,EAAE,KAAe,CAAC,CAAC,CAAC;IAC9D,CAAC;AACH,CAAC;AAED,SAAS,YAAY,CAAC,CAAQ,EAAE,IAAY;IAC1C,MAAM,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC,IAAI,EAAE,CAAC;IAC7C,OAAO,cAAc,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;AACvC,CAAC;AAED,MAAM,CAAC,MAAM,UAAU,GAAe,IAAI,GAAG,EAA6B,CAAC;AAC3E,MAAM,CAAC,MAAM,yBAAyB,GACpC,IAAI,oBAAoB,CAAC,uBAAuB,CAAC,CAAC;AAEpD,SAAS,iBAAiB,CACxB,KAAiB,EACjB,CAAI;IAEJ,MAAM,IAAI,GAAG,YAAY,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IACxC,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACjC,IAAI,QAAQ,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAC7C,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QACxB,IAAI,EAAE,IAAI,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC;YAAE,OAAO,EAAO,CAAC;IAC5C,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,SAAS,eAAe,CACtB,KAAiB,EACjB,oBAA+C,EAC/C,CAAI;IAEJ,MAAM,IAAI,GAAG,YAAY,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IACxC,IAAI,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC/B,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QACrC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAC5B,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,OAAO,CAAQ,CAAC,CAAC,CAAC;IACnC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACnB,oBAAoB,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;AACxD,CAAC;AAED,SAAS,uBAAuB,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAIlD;IACC,4CAA4C;IAC5C,gBAAgB,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;IACxD,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACjC,IAAI,QAAQ,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;IACvE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;IAC9E,IAAI,QAAQ,CAAC,IAAI,KAAK,CAAC;QAAE,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;AAC9C,CAAC;AAED,MAAM,UAAU,KAAK,CAAsB,GAAG,IAAO;IACnD,IAAI,CAAC,GAAG,iBAAiB,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IAC5C,IAAI,CAAC,KAAK,SAAS;QAAE,OAAO,CAAC,CAAC;IAC9B,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACxB,eAAe,CAAC,UAAU,EAAE,yBAAyB,EAAE,CAAC,CAAC,CAAC;IAC1D,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,QAAQ,CAAC,EAAsB,EAAE,EAAsB;IAC9D,IAAI,EAAE,CAAC,MAAM,KAAK,EAAE,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC,CAAC,qCAAqC;IACnF,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAE7B,CAAC;AACJ,MAAM,UAAU,4BAA4B,CAC1C,QAAuE;IAEvE,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAC/B,OAAO,GAAG,EAAE,CAAC,gBAAgB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;AACjD,CAAC"}

package/dist/intern-cache.d.ts

@@ -0,0 +1,11 @@
+export default class<H, T extends object> {
+    private readonly map;
+    private readonly hashFn;
+    private readonly identityFn;
+    private cleanupRegistry;
+    constructor(hashFn: (obj: T) => H, identityFn: (obj1: T, obj2: T) => boolean);
+    private remove;
+    get<U extends T>(obj: U): U;
+    get size(): number;
+}
+//# sourceMappingURL=intern-cache.d.ts.map

package/dist/intern-cache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"intern-cache.d.ts","sourceRoot":"","sources":["../src/intern-cache.ts"],"names":[],"mappings":"AAAA,MAAM,CAAC,OAAO,OAAQ,CAAC,EAAE,CAAC,SAAS,MAAM;IACvC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAsC;IAC1D,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAgB;IACvC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAgC;IAC3D,OAAO,CAAC,eAAe,CAAoD;gBAE/D,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,EAAE,UAAU,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,KAAK,OAAO;IAK5E,OAAO,CAAC,MAAM;IAQd,GAAG,CAAC,CAAC,SAAS,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC;IAqB3B,IAAI,IAAI,IAAI,MAAM,CAIjB;CACF"}

package/dist/intern-cache.js

@@ -0,0 +1,43 @@
+export default class {
+    constructor(hashFn, identityFn) {
+        this.map = new Map();
+        this.cleanupRegistry = new FinalizationRegistry(this.remove.bind(this));
+        this.hashFn = hashFn;
+        this.identityFn = identityFn;
+    }
+    remove([hash, ref]) {
+        const hashBucket = this.map.get(hash);
+        if (hashBucket === undefined)
+            throw new Error("Could not get tuple set");
+        if (!hashBucket.delete(ref))
+            throw new Error("Could not delete tuple WeakRef");
+        if (hashBucket.size === 0)
+            this.map.delete(hash);
+    }
+    get(obj) {
+        const hash = this.hashFn(obj);
+        let hashBucket = this.map.get(hash);
+        if (hashBucket !== undefined) {
+            for (const ref of hashBucket) {
+                const o = ref.deref();
+                if (o && this.identityFn(o, obj))
+                    return o;
+            }
+        }
+        else {
+            // This hash has no bucket. Create one.
+            hashBucket = new Set();
+            this.map.set(hash, hashBucket);
+        }
+        // Object is not in the cache. Add it and return it.
+        const ref = new WeakRef(obj);
+        hashBucket.add(ref);
+        this.cleanupRegistry.register(obj, [hash, ref]);
+        return obj;
+    }
+    get size() {
+        return [...this.map.entries()]
+            .map(([_, b]) => b.size)
+            .reduce((a, b) => a + b, 0);
+    }
+}

package/dist/record.spec.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=record.spec.d.ts.map

package/dist/record.spec.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"record.spec.d.ts","sourceRoot":"","sources":["../src/record.spec.ts"],"names":[],"mappings":""}

package/dist/record.spec.js

@@ -0,0 +1,39 @@
+import { record, recordType } from ".";
+describe("record", () => {
+    it("preserves keys and values", () => {
+        const a = record({ x: 1, y: 2 });
+        expect(a).toEqual({ x: 1, y: 2 });
+    });
+    it("returns the same object for shallow-equal input objects", () => {
+        const a = record({ x: 1, y: 2 });
+        const b = record({ x: 1, y: 2 });
+        expect(a).toBe(b);
+    });
+    it("returns different object if keys or values differ", () => {
+        const r = record({ x: 1, y: 2 });
+        expect(record({ x: 1, y: 3 })).not.toBe(r);
+        expect(record({ x: 1, y: 3 })).not.toBe(r);
+        expect(record({ x: 1, y: 2, z: 3 })).not.toBe(r);
+    });
+});
+describe("Keyed record type", () => {
+    const Person = recordType().withKeys("name", "age");
+    it("interns on only specified keys and values", () => {
+        const a = { name: "Bob", age: 42, sex: "male" };
+        const b = { name: "Bob", age: 42, occupation: "teacher" };
+        expect(Person(a)).toBe(Person(b));
+        expect(Person(a)).toEqual({ name: "Bob", age: 42 });
+    });
+    it("returns different object if keys or values differ", () => {
+        const r = Person({ name: "Tom", age: 42 });
+        expect({ x: 1, y: 3 }).not.toBe(r);
+        expect({ x: 1, y: 3 }).not.toBe(r);
+        expect({ x: 1, y: 2, z: 3 }).not.toBe(r);
+    });
+    it("respects inherited attributes", () => {
+        const proto = { name: "Bob" };
+        const a = Object.create(proto);
+        a.age = 42;
+        expect(Person(a)).toBe(Person({ name: "Bob", age: 42 }));
+    });
+});

package/dist/tuple.spec.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=tuple.spec.d.ts.map

package/dist/tuple.spec.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tuple.spec.d.ts","sourceRoot":"","sources":["../src/tuple.spec.ts"],"names":[],"mappings":""}

package/dist/tuple.spec.js

@@ -0,0 +1,61 @@
+import { tuple, tupleType } from ".";
+test("Empty tuples", () => {
+    const a = tuple();
+    const b = tuple();
+    expect(b).toBe(a);
+});
+test("Indexability", () => {
+    const a = {};
+    const t = tuple(42, "blah", a);
+    expect(t[0]).toBe(42);
+    expect(t[1]).toBe("blah");
+    expect(t[2]).toBe(a);
+});
+test("Iterability", () => {
+    const a = {};
+    const t = tuple(42, "blah", a);
+    expect(typeof t[Symbol.iterator]).toBe("function");
+    expect([...t]).toEqual([42, "blah", a]);
+});
+test("Basic interned equality (if same input, same object)", () => {
+    const a = {};
+    const f = () => { };
+    const t1 = tuple(a, f, 42, "hi", undefined, true, null, 7839278492n);
+    const t2 = tuple(a, f, 42, "hi", undefined, true, null, 7839278492n);
+    expect(t1).toBe(t2); // same object reference
+});
+test("Referential inequality (same structure, different references)", () => {
+    const t1 = tuple({}, 42);
+    const t2 = tuple({}, 42);
+    expect(t1).not.toBe(t2); // different objects
+});
+test("Different-length tuples are different tuples", () => {
+    const t1 = tuple(1, 2);
+    const t2 = tuple(1, 2, 3);
+    const t3 = tuple(1, 2, undefined);
+    expect(t1).not.toBe(t2);
+    expect(t1).not.toBe(t3);
+});
+test("Nestable", () => {
+    const t1 = tuple("a", tuple("b1", "b2"), "c");
+    const t2 = tuple("a", tuple("b1", "b2"), "c");
+    const t3 = tuple("a", tuple("b1", "b3"), "c");
+    expect(t2).toBe(t1);
+    expect(t3).not.toBe(t1);
+});
+test("NaN is equivalent to itself", () => {
+    expect(tuple(NaN)).toBe(tuple(NaN));
+});
+test("Positive and negative zero are distinct", () => {
+    expect(tuple(+0)).not.toBe(tuple(-0));
+});
+test("Tuple cache entry is cleared when tuple is garbage-collected", async () => {
+    const Point = tupleType();
+    Point(15, 42);
+    expect(Point._cache.size).toBe(1);
+    // Trigger garbage collection (requires node --expose-gc)
+    await new Promise((res) => setTimeout(res, 100));
+    global.gc();
+    await new Promise((res) => setTimeout(res, 100));
+    expect(Point._cache.size).toBe(0);
+});

package/package.json

@@ -1,7 +1,7 @@
 {
   "type": "module",
   "name": "tuple-ts",
-  "version": "0.1.0",
+  "version": "0.1.1",
   "description": "Python-like tuples for JavaScript/TypeScript",
   "main": "./dist/index.js",
   "types": "./dist/index.d.ts",
@@ -16,5 +16,6 @@
     "jest": "^30.0.0",
     "ts-jest": "^29.4.0",
     "typescript": "^5.8.3"
-  }
+  },
+  "files": ["./dist"]
 }

package/.nvmrc

@@ -1 +0,0 @@
-22

package/jest.config.js

@@ -1,5 +0,0 @@
-/** @type {import('ts-jest').JestConfigWithTsJest} */
-export default {
-  preset: 'ts-jest',
-  testEnvironment: 'node',
-};

package/src/hash.ts

@@ -1,126 +0,0 @@
-const UINT32_BASE = 2n ** 32n;
-
-function murmurHash3Mix_32bit(keys: Iterable<number>, seed = 0): number {
-  // The first (i.e., mixing) stage of the MurmurHash3 algorithm for 32-bit keys
-  let hash = seed;
-  let keyCount = 0;
-  for (const key of keys) {
-    keyCount++;
-    let k = Math.imul(key, 0xcc9e2d51);
-    k = (k << 15) | (k >>> 17); // ROTL32(k1, 15)
-    k = Math.imul(k, 0x1b873593);
-    hash ^= k;
-    hash = (hash << 13) | (hash >>> 19); // ROTL32(h1, 13);
-    hash = Math.imul(hash, 5) + 0xe6546b64;
-  }
-  hash ^= keyCount * 4; // number of input bytes
-  return hash >>> 0; // unsigned
-}
-
-function linearConguentialGenerator(seed: number = Date.now() >>> 0) {
-  let state = seed >>> 0; // Force to unsigned 32-bit
-  return () => {
-    // LCG constants from Numerical Recipes (good default)
-    state = (state * 1664525 + 1013904223) >>> 0;
-    return state;
-  };
-}
-
-const randomUint32 = linearConguentialGenerator();
-
-const tupleSeed = randomUint32();
-const recordSeed = randomUint32();
-const nullHash = randomUint32();
-const undefinedHash = randomUint32();
-const falseHash = randomUint32();
-const trueHash = randomUint32();
-const numberSeed = randomUint32();
-const bigIntSeed = randomUint32();
-const stringSeed = randomUint32();
-const registeredSymbolSeed = randomUint32();
-
-const objectHashMap = new WeakMap<object, number>();
-
-function stableRandomHash(
-  map: WeakMap<object | symbol, number>,
-  value: object | symbol
-): number {
-  if (value === null) return nullHash;
-  const hash = map.get(value);
-  if (hash !== undefined) return hash;
-  const newHash = randomUint32();
-  map.set(value, newHash);
-  return newHash;
-}
-
-function* stringToUint32s(value: string): Generator<number> {
-  for (let i = 0; i < value.length; i += 2) {
-    const char1 = value.charCodeAt(i);
-    const char2 = value.charCodeAt(i + 1);
-    yield (char2 << 16) | char1;
-  }
-}
-
-function* numberToUint32s(value: number): Generator<number> {
-  const buffer = new ArrayBuffer(8); // 8 bytes = 64 bits
-  const view = new DataView(buffer);
-  view.setFloat64(0, value);
-  yield view.getUint32(0);
-  yield view.getUint32(4);
-}
-
-function* bigIntToUint32s(value: bigint): Generator<number> {
-  for (let n = value; n !== 0n; n /= UINT32_BASE) {
-    yield Number(((n % UINT32_BASE) + UINT32_BASE) % UINT32_BASE); // Safely non-negative
-  }
-}
-
-function valueHash(value: unknown): number {
-  switch (typeof value) {
-    case "string":
-      return mixHashes(stringToUint32s(value), stringSeed);
-    case "number":
-      return mixHashes(numberToUint32s(value), numberSeed);
-    case "bigint":
-      return mixHashes(bigIntToUint32s(value), bigIntSeed);
-    case "boolean":
-      return value ? trueHash : falseHash;
-    case "symbol":
-      const k = Symbol.keyFor(value);
-      return k === undefined
-        ? stableRandomHash(objectHashMap, value)
-        : mixHashes(stringToUint32s(k), registeredSymbolSeed);
-    case "undefined":
-      return undefinedHash;
-    case "object":
-      return value === null ? nullHash : stableRandomHash(objectHashMap, value);
-    case "function":
-      return stableRandomHash(objectHashMap, value);
-  }
-}
-
-const mixHashes = murmurHash3Mix_32bit;
-
-function* valueHashes(values: Iterable<unknown>): Generator<number> {
-    for (const v of values) {
-        yield valueHash(v);
-    }
-}
-
-export function tupleHash(elements: readonly unknown[]): number {
-    return mixHashes(valueHashes(elements), tupleSeed);
-}
-
-function* keyAndValueHashes(record: Record<string, unknown>): Generator<number> {
-    for (const key of Object.keys(record).sort()) {
-        yield valueHash(key);
-        yield valueHash(record[key]);
-    }
-}
-
-export function recordHash(record: Record<string, unknown>): number {
-  return mixHashes(
-    keyAndValueHashes(record),
-    recordSeed
-  );
-}

package/src/index.ts

@@ -1,105 +0,0 @@
-import InternCache from "./intern-cache";
-export { InternCache };
-import * as hash from "./hash";
-
-export type Tuple<T extends readonly unknown[] = readonly unknown[]> = T;
-
-export type TupleType<T extends Tuple = Tuple> = {
-  (...t: T): T;
-  _cache: InternCache<number, T>;
-};
-
-export type KeyedRecordType<
-  R extends Record<string, unknown> = Record<string, unknown>
-> = { (r: R): R; _cache: InternCache<number, R> };
-
-export type RecordType<
-  R extends Record<string, unknown> = Record<string, unknown>
-> = KeyedRecordType<R> & {
-  withKeys: <K extends readonly (keyof R)[]>(
-    ...keys: K
-  ) => KeyedRecordType<Pick<R, K[number]>>;
-};
-
-function arrayEquivalent(
-  a1: readonly unknown[],
-  a2: readonly unknown[]
-): boolean {
-  if (a2.length !== a1.length) return false;
-  for (let i = 0; i < a1.length; i++) {
-    if (!Object.is(a2[i], a1[i])) return false;
-  }
-  return true;
-}
-
-function recordEquivalent(
-  r1: Record<string, unknown>,
-  r2: Record<string, unknown>
-): boolean {
-  const r1Keys = Object.keys(r1);
-  const r2Keys = Object.keys(r2);
-  if (r2Keys.length !== r1Keys.length) return false;
-  for (let i = 0; i < r1Keys.length; i++) {
-    const k = r1Keys[i];
-    if (!(k in r2)) return false;
-    if (!Object.is(r2[k], r1[k])) return false;
-  }
-  return true;
-}
-
-export function tupleType<T extends Tuple>(): TupleType<T> {
-  const _cache = new InternCache<number, T>(hash.tupleHash, arrayEquivalent);
-  return Object.assign((...t: T) => Object.freeze(_cache.get(t)), {
-    _cache,
-  });
-}
-
-export function recordType<T extends Record<string, unknown>>(): RecordType<T> {
-  const _cache = new InternCache<number, T>(hash.recordHash, recordEquivalent);
-  return Object.assign(({ ...r }: T): T => Object.freeze(_cache.get(r)), {
-    _cache,
-    withKeys: <K extends readonly (keyof T)[]>(...keys: K) =>
-      recordTypeToKeyedRecordType<T, K>(...keys),
-  });
-}
-
-export const tuple = tupleType();
-export const record = recordType();
-
-type RecordToTuple<
-  R extends Record<string, unknown>,
-  K extends readonly (keyof R)[]
-> = K extends readonly [
-  infer Head extends keyof R,
-  ...infer Tail extends readonly (keyof R)[]
-]
-  ? readonly [R[Head], ...RecordToTuple<R, Tail>]
-  : [];
-
-function recordToTuple<
-  R extends Record<string, unknown>,
-  K extends readonly (keyof R)[]
->(record: R, keys: K): RecordToTuple<R, K> {
-  return keys.map((k) => record[k]) as RecordToTuple<R, K>;
-}
-
-function recordTypeToKeyedRecordType<
-  R extends Record<string, unknown>,
-  K extends readonly (keyof R)[]
->(...keys: K): KeyedRecordType<Pick<R, K[number]>> {
-  const _cache = new InternCache<number, Pick<R, K[number]>>(
-    (r) => hash.tupleHash(recordToTuple(r, keys)),
-    (r1, r2) =>
-      arrayEquivalent(recordToTuple(r1, keys), recordToTuple(r2, keys))
-  );
-  return Object.assign(
-    (r: R): R => {
-      const r_: Partial<R> = {};
-      for (const k of keys) {
-        r_[k] = r[k];
-      }
-      return Object.freeze(_cache.get(r_ as R));
-    },
-    { _cache }
-  );
-}

package/src/intern-cache.ts

@@ -1,46 +0,0 @@
-export default class <H, T extends object> {
-  private readonly map: Map<H, Set<WeakRef<T>>> = new Map();
-  private readonly hashFn: (obj: T) => H;
-  private readonly identityFn: (obj1: T, obj2: T) => boolean;
-  private cleanupRegistry = new FinalizationRegistry(this.remove.bind(this));
-
-  constructor(hashFn: (obj: T) => H, identityFn: (obj1: T, obj2: T) => boolean) {
-    this.hashFn = hashFn;
-    this.identityFn = identityFn;
-  }
-
-  private remove([hash, ref]: [H, WeakRef<T>]): void {
-    const hashBucket = this.map.get(hash);
-    if (hashBucket === undefined) throw new Error("Could not get tuple set");
-    if (!hashBucket.delete(ref))
-      throw new Error("Could not delete tuple WeakRef");
-    if (hashBucket.size === 0) this.map.delete(hash);
-  }
-
-  get<U extends T>(obj: U): U {
-    const hash = this.hashFn(obj);
-    let hashBucket = this.map.get(hash);
-    if (hashBucket !== undefined) {
-      for (const ref of hashBucket) {
-        const o = ref.deref();
-        if (o && this.identityFn(o, obj)) return o as U;
-      }
-    } else {
-      // This hash has no bucket. Create one.
-      hashBucket = new Set();
-      this.map.set(hash, hashBucket);
-    }
-
-    // Object is not in the cache. Add it and return it.
-    const ref = new WeakRef<T>(obj);
-    hashBucket.add(ref);
-    this.cleanupRegistry.register(obj, [hash, ref]);
-    return obj;
-  }
-
-  get size(): number {
-    return [...this.map.entries()]
-      .map(([_, b]) => b.size)
-      .reduce((a, b) => a + b, 0);
-  }
-}

package/src/record.spec.ts

@@ -1,50 +0,0 @@
-import { record, recordType } from ".";
-
-describe("record", () => {
-  it("preserves keys and values", () => {
-    const a = record({ x: 1, y: 2 });
-    expect(a).toEqual({ x: 1, y: 2 });
-  });
-
-  it("returns the same object for shallow-equal input objects", () => {
-    const a = record({ x: 1, y: 2 });
-    const b = record({ x: 1, y: 2 });
-    expect(a).toBe(b);
-  });
-
-  it("returns different object if keys or values differ", () => {
-    const r = record({ x: 1, y: 2 });
-    expect(record({ x: 1, y: 3 })).not.toBe(r);
-    expect(record({ x: 1, y: 3 })).not.toBe(r);
-    expect(record({ x: 1, y: 2, z: 3 })).not.toBe(r);
-  });
-});
-
-describe("Keyed record type", () => {
-  const Person = recordType<{
-    name: string;
-    age: number;
-    height: number;
-  }>().withKeys("name", "age");
-
-  it("interns on only specified keys and values", () => {
-    const a = { name: "Bob", age: 42, sex: "male" };
-    const b = { name: "Bob", age: 42, occupation: "teacher" };
-    expect(Person(a)).toBe(Person(b));
-    expect(Person(a)).toEqual({ name: "Bob", age: 42 });
-  });
-
-  it("returns different object if keys or values differ", () => {
-    const r = Person({ name: "Tom", age: 42 });
-    expect({ x: 1, y: 3 }).not.toBe(r);
-    expect({ x: 1, y: 3 }).not.toBe(r);
-    expect({ x: 1, y: 2, z: 3 }).not.toBe(r);
-  });
-
-  it("respects inherited attributes", () => {
-    const proto = {name: "Bob"};
-    const a = Object.create(proto);
-    a.age = 42;
-    expect(Person(a)).toBe(Person({name: "Bob", age: 42}));
-  });
-});

package/src/tuple.spec.ts

@@ -1,74 +0,0 @@
-import { tuple, tupleType } from ".";
-
-test("Empty tuples", () => {
-  const a = tuple();
-  const b = tuple();
-  expect(b).toBe(a);
-});
-
-test("Indexability", () => {
-  const a = {};
-  const t = tuple(42, "blah", a);
-  expect(t[0]).toBe(42);
-  expect(t[1]).toBe("blah");
-  expect(t[2]).toBe(a);
-});
-
-test("Iterability", () => {
-  const a = {};
-  const t = tuple(42, "blah", a);
-  expect(typeof t[Symbol.iterator]).toBe("function");
-  expect([...t]).toEqual([42, "blah", a]);
-});
-
-test("Basic interned equality (if same input, same object)", () => {
-  const a = {};
-  const f = () => {};
-  const t1 = tuple(a, f, 42, "hi", undefined, true, null, 7839278492n);
-  const t2 = tuple(a, f, 42, "hi", undefined, true, null, 7839278492n);
-  expect(t1).toBe(t2); // same object reference
-});
-
-test("Referential inequality (same structure, different references)", () => {
-  const t1 = tuple({}, 42);
-  const t2 = tuple({}, 42);
-  expect(t1).not.toBe(t2); // different objects
-});
-
-test("Different-length tuples are different tuples", () => {
-  const t1 = tuple(1, 2);
-  const t2 = tuple(1, 2, 3);
-  const t3 = tuple(1, 2, undefined);
-  expect(t1).not.toBe(t2);
-  expect(t1).not.toBe(t3);
-});
-
-test("Nestable", () => {
-  const t1 = tuple("a", tuple("b1", "b2"), "c");
-  const t2 = tuple("a", tuple("b1", "b2"), "c");
-  const t3 = tuple("a", tuple("b1", "b3"), "c");
-  expect(t2).toBe(t1);
-  expect(t3).not.toBe(t1);
-});
-
-test("NaN is equivalent to itself", () => {
-  expect(tuple(NaN)).toBe(tuple(NaN));
-});
-
-test("Positive and negative zero are distinct", () => {
-  expect(tuple(+0)).not.toBe(tuple(-0));
-});
-
-test("Tuple cache entry is cleared when tuple is garbage-collected", async () => {
-  const Point = tupleType<[number, number]>();
-
-  Point(15, 42);
-  expect(Point._cache.size).toBe(1);
-
-  // Trigger garbage collection (requires node --expose-gc)
-  await new Promise((res) => setTimeout(res, 100));
-  (global as any).gc();
-  await new Promise((res) => setTimeout(res, 100));
-
-  expect(Point._cache.size).toBe(0);
-});

package/tsconfig.json

@@ -1,18 +0,0 @@
-{
-  "compilerOptions": {
-    "target": "ES2020",              // supports WeakRef, FinalizationRegistry natively
-    "module": "esnext",              // or "CommonJS" if you want CommonJS output
-    "declaration": true,             // generate .d.ts files
-    "declarationMap": true,
-    "strict": true,                  // enable strict type checks
-    "noFallthroughCasesInSwitch": true,
-    "esModuleInterop": true,         // allow default imports from CommonJS modules
-    "forceConsistentCasingInFileNames": true,
-    "skipLibCheck": true,            // speed up build by skipping lib .d.ts checks
-    "moduleResolution": "node",      // resolve modules like Node.js
-    "outDir": "./dist",              // output directory for compiled files
-    "lib": ["ES2023", "ESNext.Iterator"]
-  },
-  "files": ["src/index.ts"],
-  "include": ["src/*.test.ts", "src/*.spec.ts"],
-}