@atproto-labs/simple-store-memory 0.1.0

package/CHANGELOG.md

@@ -0,0 +1,12 @@
+# @atproto-labs/simple-store-memory
+
+## 0.1.0
+
+### Minor Changes
+
+- [#2482](https://github.com/bluesky-social/atproto/pull/2482) [`a8d6c1123`](https://github.com/bluesky-social/atproto/commit/a8d6c112359f5c4c0cfbe2df63443ed275f2a646) Thanks [@matthieusieben](https://github.com/matthieusieben)! - Add OAuth provider capability & support for DPoP signed tokens
+
+### Patch Changes
+
+- Updated dependencies [[`a8d6c1123`](https://github.com/bluesky-social/atproto/commit/a8d6c112359f5c4c0cfbe2df63443ed275f2a646)]:
+  - @atproto-labs/simple-store@0.1.0

package/LICENSE.txt

@@ -0,0 +1,7 @@
+Dual MIT/Apache-2.0 License
+
+Copyright (c) 2022-2024 Bluesky PBC, and Contributors
+
+Except as otherwise noted in individual files, this software is licensed under the MIT license (<http://opensource.org/licenses/MIT>), or the Apache License, Version 2.0 (<http://www.apache.org/licenses/LICENSE-2.0>).
+
+Downstream projects and end users may chose either license individually, or both together, at their discretion. The motivation for this dual-licensing is the additional software patent assurance provided by Apache 2.0.

package/dist/index.d.ts

@@ -0,0 +1,52 @@
+import { SimpleStore, Key, Value } from '@atproto-labs/simple-store';
+export type SimpleStoreMemoryOptions<K extends Key, V extends Value> = {
+    /**
+     * The maximum number of entries in the cache.
+     */
+    max?: number;
+    /**
+     * The time-to-live of a cache entry, in milliseconds.
+     */
+    ttl?: number;
+    /**
+     * Whether to automatically prune expired entries.
+     */
+    ttlAutopurge?: boolean;
+    /**
+     * The maximum total size of the cache, in units defined by the sizeCalculation
+     * function.
+     *
+     * @default No limit
+     */
+    maxSize?: number;
+    /**
+     * The maximum size of a single cache entry, in units defined by the
+     * sizeCalculation function.
+     *
+     * @default No limit
+     */
+    maxEntrySize?: number;
+    /**
+     * A function that returns the size of a value. The size is used to determine
+     * when the cache should be pruned, based on `maxSize`.
+     *
+     * @default The (rough) size in bytes used in memory.
+     */
+    sizeCalculation?: (value: V, key: K) => number;
+} & ({
+    max: number;
+} | {
+    maxSize: number;
+} | {
+    ttl: number;
+    ttlAutopurge: boolean;
+});
+export declare class SimpleStoreMemory<K extends Key, V extends Value> implements SimpleStore<K, V> {
+    #private;
+    constructor({ sizeCalculation, ...options }: SimpleStoreMemoryOptions<K, V>);
+    get(key: K): V | undefined;
+    set(key: K, value: V): void;
+    del(key: K): void;
+    clear(): void;
+}
+//# 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,EAAE,WAAW,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,4BAA4B,CAAA;AAKpE,MAAM,MAAM,wBAAwB,CAAC,CAAC,SAAS,GAAG,EAAE,CAAC,SAAS,KAAK,IAAI;IACrE;;OAEG;IACH,GAAG,CAAC,EAAE,MAAM,CAAA;IAEZ;;OAEG;IACH,GAAG,CAAC,EAAE,MAAM,CAAA;IAEZ;;OAEG;IACH,YAAY,CAAC,EAAE,OAAO,CAAA;IAEtB;;;;;OAKG;IACH,OAAO,CAAC,EAAE,MAAM,CAAA;IAEhB;;;;;OAKG;IACH,YAAY,CAAC,EAAE,MAAM,CAAA;IAErB;;;;;OAKG;IACH,eAAe,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,MAAM,CAAA;CAC/C,GAAG,CACA;IAAE,GAAG,EAAE,MAAM,CAAA;CAAE,GACf;IAAE,OAAO,EAAE,MAAM,CAAA;CAAE,GACnB;IAAE,GAAG,EAAE,MAAM,CAAC;IAAC,YAAY,EAAE,OAAO,CAAA;CAAE,CACzC,CAAA;AAYD,qBAAa,iBAAiB,CAAC,CAAC,SAAS,GAAG,EAAE,CAAC,SAAS,KAAK,CAC3D,YAAW,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC;;gBAIhB,EAAE,eAAe,EAAE,GAAG,OAAO,EAAE,EAAE,wBAAwB,CAAC,CAAC,EAAE,CAAC,CAAC;IAe3E,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAO1B,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAI3B,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI;IAIjB,KAAK,IAAI,IAAI;CAGd"}

package/dist/index.js

@@ -0,0 +1,56 @@
+"use strict";
+var __classPrivateFieldSet = (this && this.__classPrivateFieldSet) || function (receiver, state, value, kind, f) {
+    if (kind === "m") throw new TypeError("Private method is not writable");
+    if (kind === "a" && !f) throw new TypeError("Private accessor was defined without a setter");
+    if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError("Cannot write private member to an object whose class did not declare it");
+    return (kind === "a" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;
+};
+var __classPrivateFieldGet = (this && this.__classPrivateFieldGet) || function (receiver, state, kind, f) {
+    if (kind === "a" && !f) throw new TypeError("Private accessor was defined without a getter");
+    if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError("Cannot read private member from an object whose class did not declare it");
+    return kind === "m" ? f : kind === "a" ? f.call(receiver) : f ? f.value : state.get(receiver);
+};
+var _SimpleStoreMemory_cache;
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SimpleStoreMemory = void 0;
+const lru_cache_1 = require("lru-cache");
+const util_js_1 = require("./util.js");
+// LRUCache does not allow storing "null", so we use a symbol to represent it.
+const nullSymbol = Symbol('nullItem');
+const toLruValue = (value) => (value === null ? nullSymbol : value);
+const fromLruValue = (value) => (value === nullSymbol ? null : value);
+class SimpleStoreMemory {
+    constructor({ sizeCalculation, ...options }) {
+        _SimpleStoreMemory_cache.set(this, void 0);
+        __classPrivateFieldSet(this, _SimpleStoreMemory_cache, new lru_cache_1.LRUCache({
+            ...options,
+            allowStale: false,
+            updateAgeOnGet: false,
+            updateAgeOnHas: false,
+            sizeCalculation: sizeCalculation
+                ? (value, key) => sizeCalculation(fromLruValue(value), key)
+                : options.maxEntrySize != null || options.maxSize != null
+                    ? // maxEntrySize and maxSize require a size calculation function.
+                        util_js_1.roughSizeOfObject
+                    : undefined,
+        }), "f");
+    }
+    get(key) {
+        const value = __classPrivateFieldGet(this, _SimpleStoreMemory_cache, "f").get(key);
+        if (value === undefined)
+            return undefined;
+        return fromLruValue(value);
+    }
+    set(key, value) {
+        __classPrivateFieldGet(this, _SimpleStoreMemory_cache, "f").set(key, toLruValue(value));
+    }
+    del(key) {
+        __classPrivateFieldGet(this, _SimpleStoreMemory_cache, "f").delete(key);
+    }
+    clear() {
+        __classPrivateFieldGet(this, _SimpleStoreMemory_cache, "f").clear();
+    }
+}
+exports.SimpleStoreMemory = SimpleStoreMemory;
+_SimpleStoreMemory_cache = new WeakMap();
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;AACA,yCAAoC;AAEpC,uCAA6C;AA+C7C,8EAA8E;AAC9E,MAAM,UAAU,GAAG,MAAM,CAAC,UAAU,CAAC,CAAA;AAIrC,MAAM,UAAU,GAAG,CAAkB,KAAQ,EAAE,EAAE,CAC/C,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,CAAkB,CAAA;AACxD,MAAM,YAAY,GAAG,CAAkB,KAAoB,EAAE,EAAE,CAC7D,CAAC,KAAK,KAAK,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAM,CAAA;AAE5C,MAAa,iBAAiB;IAK5B,YAAY,EAAE,eAAe,EAAE,GAAG,OAAO,EAAkC;QAF3E,2CAAkC;QAGhC,uBAAA,IAAI,4BAAU,IAAI,oBAAQ,CAAmB;YAC3C,GAAG,OAAO;YACV,UAAU,EAAE,KAAK;YACjB,cAAc,EAAE,KAAK;YACrB,cAAc,EAAE,KAAK;YACrB,eAAe,EAAE,eAAe;gBAC9B,CAAC,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE,CAAC,eAAe,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC;gBAC3D,CAAC,CAAC,OAAO,CAAC,YAAY,IAAI,IAAI,IAAI,OAAO,CAAC,OAAO,IAAI,IAAI;oBACvD,CAAC,CAAC,gEAAgE;wBAChE,2BAAiB;oBACnB,CAAC,CAAC,SAAS;SAChB,CAAC,MAAA,CAAA;IACJ,CAAC;IAED,GAAG,CAAC,GAAM;QACR,MAAM,KAAK,GAAG,uBAAA,IAAI,gCAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAClC,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,SAAS,CAAA;QAEzC,OAAO,YAAY,CAAC,KAAK,CAAC,CAAA;IAC5B,CAAC;IAED,GAAG,CAAC,GAAM,EAAE,KAAQ;QAClB,uBAAA,IAAI,gCAAO,CAAC,GAAG,CAAC,GAAG,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC,CAAA;IACzC,CAAC;IAED,GAAG,CAAC,GAAM;QACR,uBAAA,IAAI,gCAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;IACzB,CAAC;IAED,KAAK;QACH,uBAAA,IAAI,gCAAO,CAAC,KAAK,EAAE,CAAA;IACrB,CAAC;CACF;AAtCD,8CAsCC"}

package/dist/util.d.ts

@@ -0,0 +1,5 @@
+/**
+ * @see {@link https://stackoverflow.com/a/11900218/356537}
+ */
+export declare function roughSizeOfObject(value: unknown): number;
+//# sourceMappingURL=util.d.ts.map

package/dist/util.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"util.d.ts","sourceRoot":"","sources":["../src/util.ts"],"names":[],"mappings":"AAEA;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,CAuExD"}

package/dist/util.js

@@ -0,0 +1,75 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.roughSizeOfObject = void 0;
+const knownSizes = new WeakMap();
+/**
+ * @see {@link https://stackoverflow.com/a/11900218/356537}
+ */
+function roughSizeOfObject(value) {
+    const objectList = new Set();
+    const stack = [value]; // This would be more efficient using a circular buffer
+    let bytes = 0;
+    while (stack.length) {
+        const value = stack.pop();
+        // > All objects on the heap start with a shape descriptor, which takes one
+        // > pointer size (usually 4 bytes these days, thanks to "pointer
+        // > compression" on 64-bit platforms).
+        switch (typeof value) {
+            // Types are ordered by frequency
+            case 'string':
+                // https://stackoverflow.com/a/68791382/356537
+                bytes += 12 + 4 * Math.ceil(value.length / 4);
+                break;
+            case 'number':
+                bytes += 12; // Shape descriptor + double
+                break;
+            case 'boolean':
+                bytes += 4; // Shape descriptor
+                break;
+            case 'object':
+                bytes += 4; // Shape descriptor
+                if (value === null) {
+                    break;
+                }
+                if (knownSizes.has(value)) {
+                    bytes += knownSizes.get(value);
+                    break;
+                }
+                if (objectList.has(value))
+                    continue;
+                objectList.add(value);
+                if (Array.isArray(value)) {
+                    bytes += 4;
+                    stack.push(...value);
+                }
+                else {
+                    bytes += 8;
+                    const keys = Object.getOwnPropertyNames(value);
+                    for (let i = 0; i < keys.length; i++) {
+                        bytes += 4;
+                        const key = keys[i];
+                        const val = value[key];
+                        if (val !== undefined)
+                            stack.push(val);
+                        stack.push(key);
+                    }
+                }
+                break;
+            case 'function':
+                bytes += 8; // Shape descriptor + pointer (assuming functions are shared)
+                break;
+            case 'symbol':
+                bytes += 8; // Shape descriptor + pointer
+                break;
+            case 'bigint':
+                bytes += 16; // Shape descriptor + BigInt
+                break;
+        }
+    }
+    if (typeof value === 'object' && value !== null) {
+        knownSizes.set(value, bytes);
+    }
+    return bytes;
+}
+exports.roughSizeOfObject = roughSizeOfObject;
+//# sourceMappingURL=util.js.map

package/dist/util.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"util.js","sourceRoot":"","sources":["../src/util.ts"],"names":[],"mappings":";;;AAAA,MAAM,UAAU,GAAG,IAAI,OAAO,EAAkB,CAAA;AAEhD;;GAEG;AACH,SAAgB,iBAAiB,CAAC,KAAc;IAC9C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAE,CAAA;IAC5B,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,CAAA,CAAC,uDAAuD;IAC7E,IAAI,KAAK,GAAG,CAAC,CAAA;IAEb,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;QACpB,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,CAAA;QAEzB,2EAA2E;QAC3E,iEAAiE;QACjE,uCAAuC;QAEvC,QAAQ,OAAO,KAAK,EAAE,CAAC;YACrB,iCAAiC;YACjC,KAAK,QAAQ;gBACX,8CAA8C;gBAC9C,KAAK,IAAI,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;gBAC7C,MAAK;YACP,KAAK,QAAQ;gBACX,KAAK,IAAI,EAAE,CAAA,CAAC,4BAA4B;gBACxC,MAAK;YACP,KAAK,SAAS;gBACZ,KAAK,IAAI,CAAC,CAAA,CAAC,mBAAmB;gBAC9B,MAAK;YACP,KAAK,QAAQ;gBACX,KAAK,IAAI,CAAC,CAAA,CAAC,mBAAmB;gBAE9B,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;oBACnB,MAAK;gBACP,CAAC;gBAED,IAAI,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC1B,KAAK,IAAI,UAAU,CAAC,GAAG,CAAC,KAAK,CAAE,CAAA;oBAC/B,MAAK;gBACP,CAAC;gBAED,IAAI,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC;oBAAE,SAAQ;gBACnC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;gBAErB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;oBACzB,KAAK,IAAI,CAAC,CAAA;oBACV,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAA;gBACtB,CAAC;qBAAM,CAAC;oBACN,KAAK,IAAI,CAAC,CAAA;oBACV,MAAM,IAAI,GAAG,MAAM,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAA;oBAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;wBACrC,KAAK,IAAI,CAAC,CAAA;wBACV,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;wBACnB,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAA;wBACtB,IAAI,GAAG,KAAK,SAAS;4BAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;wBACtC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;oBACjB,CAAC;gBACH,CAAC;gBACD,MAAK;YACP,KAAK,UAAU;gBACb,KAAK,IAAI,CAAC,CAAA,CAAC,6DAA6D;gBACxE,MAAK;YACP,KAAK,QAAQ;gBACX,KAAK,IAAI,CAAC,CAAA,CAAC,6BAA6B;gBACxC,MAAK;YACP,KAAK,QAAQ;gBACX,KAAK,IAAI,EAAE,CAAA,CAAC,4BAA4B;gBACxC,MAAK;QACT,CAAC;IACH,CAAC;IAED,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QAChD,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;IAC9B,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC;AAvED,8CAuEC"}

package/package.json

@@ -0,0 +1,36 @@
+{
+  "name": "@atproto-labs/simple-store-memory",
+  "version": "0.1.0",
+  "license": "MIT",
+  "description": "Memory based simple-store implementation",
+  "keywords": [
+    "cache",
+    "isomorphic",
+    "memory"
+  ],
+  "homepage": "https://atproto.com",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/bluesky-social/atproto",
+    "directory": "packages/internal/simple-store-memory"
+  },
+  "type": "commonjs",
+  "main": "dist/index.js",
+  "types": "dist/index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "default": "./dist/index.js"
+    }
+  },
+  "dependencies": {
+    "lru-cache": "^10.2.0",
+    "@atproto-labs/simple-store": "0.1.0"
+  },
+  "devDependencies": {
+    "typescript": "^5.3.3"
+  },
+  "scripts": {
+    "build": "tsc --build tsconfig.build.json"
+  }
+}

package/src/index.ts

@@ -0,0 +1,99 @@
+import { SimpleStore, Key, Value } from '@atproto-labs/simple-store'
+import { LRUCache } from 'lru-cache'
+
+import { roughSizeOfObject } from './util.js'
+
+export type SimpleStoreMemoryOptions<K extends Key, V extends Value> = {
+  /**
+   * The maximum number of entries in the cache.
+   */
+  max?: number
+
+  /**
+   * The time-to-live of a cache entry, in milliseconds.
+   */
+  ttl?: number
+
+  /**
+   * Whether to automatically prune expired entries.
+   */
+  ttlAutopurge?: boolean
+
+  /**
+   * The maximum total size of the cache, in units defined by the sizeCalculation
+   * function.
+   *
+   * @default No limit
+   */
+  maxSize?: number
+
+  /**
+   * The maximum size of a single cache entry, in units defined by the
+   * sizeCalculation function.
+   *
+   * @default No limit
+   */
+  maxEntrySize?: number
+
+  /**
+   * A function that returns the size of a value. The size is used to determine
+   * when the cache should be pruned, based on `maxSize`.
+   *
+   * @default The (rough) size in bytes used in memory.
+   */
+  sizeCalculation?: (value: V, key: K) => number
+} & ( // Memory is not infinite, so at least one pruning option is required.
+  | { max: number }
+  | { maxSize: number }
+  | { ttl: number; ttlAutopurge: boolean }
+)
+
+// LRUCache does not allow storing "null", so we use a symbol to represent it.
+const nullSymbol = Symbol('nullItem')
+type AsLruValue<V extends Value> = V extends null
+  ? typeof nullSymbol
+  : Exclude<V, null>
+const toLruValue = <V extends Value>(value: V) =>
+  (value === null ? nullSymbol : value) as AsLruValue<V>
+const fromLruValue = <V extends Value>(value: AsLruValue<V>) =>
+  (value === nullSymbol ? null : value) as V
+
+export class SimpleStoreMemory<K extends Key, V extends Value>
+  implements SimpleStore<K, V>
+{
+  #cache: LRUCache<K, AsLruValue<V>>
+
+  constructor({ sizeCalculation, ...options }: SimpleStoreMemoryOptions<K, V>) {
+    this.#cache = new LRUCache<K, AsLruValue<V>>({
+      ...options,
+      allowStale: false,
+      updateAgeOnGet: false,
+      updateAgeOnHas: false,
+      sizeCalculation: sizeCalculation
+        ? (value, key) => sizeCalculation(fromLruValue(value), key)
+        : options.maxEntrySize != null || options.maxSize != null
+          ? // maxEntrySize and maxSize require a size calculation function.
+            roughSizeOfObject
+          : undefined,
+    })
+  }
+
+  get(key: K): V | undefined {
+    const value = this.#cache.get(key)
+    if (value === undefined) return undefined
+
+    return fromLruValue(value)
+  }
+
+  set(key: K, value: V): void {
+    this.#cache.set(key, toLruValue(value))
+  }
+
+  del(key: K): void {
+    this.#cache.delete(key)
+  }
+
+  clear(): void {
+    this.#cache.clear()
+  }
+}

package/src/util.ts

@@ -0,0 +1,77 @@
+const knownSizes = new WeakMap<object, number>()
+
+/**
+ * @see {@link https://stackoverflow.com/a/11900218/356537}
+ */
+export function roughSizeOfObject(value: unknown): number {
+  const objectList = new Set()
+  const stack = [value] // This would be more efficient using a circular buffer
+  let bytes = 0
+
+  while (stack.length) {
+    const value = stack.pop()
+
+    // > All objects on the heap start with a shape descriptor, which takes one
+    // > pointer size (usually 4 bytes these days, thanks to "pointer
+    // > compression" on 64-bit platforms).
+
+    switch (typeof value) {
+      // Types are ordered by frequency
+      case 'string':
+        // https://stackoverflow.com/a/68791382/356537
+        bytes += 12 + 4 * Math.ceil(value.length / 4)
+        break
+      case 'number':
+        bytes += 12 // Shape descriptor + double
+        break
+      case 'boolean':
+        bytes += 4 // Shape descriptor
+        break
+      case 'object':
+        bytes += 4 // Shape descriptor
+
+        if (value === null) {
+          break
+        }
+
+        if (knownSizes.has(value)) {
+          bytes += knownSizes.get(value)!
+          break
+        }
+
+        if (objectList.has(value)) continue
+        objectList.add(value)
+
+        if (Array.isArray(value)) {
+          bytes += 4
+          stack.push(...value)
+        } else {
+          bytes += 8
+          const keys = Object.getOwnPropertyNames(value)
+          for (let i = 0; i < keys.length; i++) {
+            bytes += 4
+            const key = keys[i]
+            const val = value[key]
+            if (val !== undefined) stack.push(val)
+            stack.push(key)
+          }
+        }
+        break
+      case 'function':
+        bytes += 8 // Shape descriptor + pointer (assuming functions are shared)
+        break
+      case 'symbol':
+        bytes += 8 // Shape descriptor + pointer
+        break
+      case 'bigint':
+        bytes += 16 // Shape descriptor + BigInt
+        break
+    }
+  }
+
+  if (typeof value === 'object' && value !== null) {
+    knownSizes.set(value, bytes)
+  }
+
+  return bytes
+}

package/tsconfig.build.json

@@ -0,0 +1,8 @@
+{
+  "extends": "../../../tsconfig/isomorphic.json",
+  "compilerOptions": {
+    "rootDir": "./src",
+    "outDir": "./dist"
+  },
+  "include": ["./src"]
+}

package/tsconfig.json

@@ -0,0 +1,4 @@
+{
+  "include": [],
+  "references": [{ "path": "./tsconfig.build.json" }]
+}