tuplerone 4.0.0-next.1 → 4.0.0-next.3

package/dist/Node.d.ts

@@ -1,5 +1,6 @@
 export declare class Node extends Map<unknown, Node> {
     tuple?: WeakRef<readonly unknown[]>;
     symbol?: WeakRef<symbol>;
+    object?: WeakRef<Readonly<object>>;
     get(edge: unknown): Node;
 }

package/dist/Tuple.d.ts

@@ -1,10 +1 @@
-export declare const isRef: unique symbol;
-interface Referable {
-    [isRef]: boolean;
-}
-declare global {
-    interface Object extends Referable {
-    }
-}
 export declare function Tuple<A extends unknown[]>(...path: A): Readonly<A>;
-export {};

package/dist/graph.cjs

@@ -0,0 +1,83 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// src/graph.ts
+var graph_exports = {};
+__export(graph_exports, {
+  clear: () => clear,
+  getNode: () => getNode,
+  getSymbol: () => getSymbol,
+  prune: () => prune,
+  registry: () => registry
+});
+module.exports = __toCommonJS(graph_exports);
+
+// src/Node.ts
+var Node = class extends Map {
+  tuple;
+  symbol;
+  object;
+  get(edge) {
+    if (!this.has(edge)) {
+      const value = new Node();
+      this.set(edge, value);
+      return value;
+    }
+    return super.get(edge);
+  }
+};
+__name(Node, "Node");
+
+// src/graph.ts
+var root = new Node();
+var registry = new FinalizationRegistry((path) => void prune(path));
+var getNode = /* @__PURE__ */ __name((path) => path.reduce((node, edge) => node.get(edge), root), "getNode");
+var getSymbol = /* @__PURE__ */ __name((path) => {
+  const node = getNode(path);
+  const symbol = node.symbol?.deref();
+  if (!symbol) {
+    const symbol2 = Symbol();
+    node.symbol = new WeakRef(symbol2);
+    registry.register(symbol2, path);
+    return symbol2;
+  }
+  return symbol;
+}, "getSymbol");
+var prune = /* @__PURE__ */ __name((path) => {
+  let last = [root, null];
+  const nodes = [last];
+  for (const edge of path) {
+    last = [last[0].get(edge), edge];
+    nodes.push(last);
+  }
+  for (let i = nodes.length - 1; i > 0; i--) {
+    const [node, edge] = nodes[i];
+    const [parent] = nodes[i - 1];
+    if (node.size || node.tuple?.deref() || node.symbol?.deref() || node.object?.deref()) {
+      break;
+    }
+    parent.delete(edge);
+  }
+}, "prune");
+var clear = /* @__PURE__ */ __name(() => {
+  root.clear();
+}, "clear");
+/*! For license information please see graph.cjs.LEGAL.txt */
+//# sourceMappingURL=graph.cjs.map

package/dist/graph.cjs.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../src/graph.ts", "../src/Node.ts"],
+  "sourcesContent": ["import { Node } from './Node.ts';\n\nconst root = new Node();\n\n/* istanbul ignore next */\nexport const registry = new FinalizationRegistry((path: unknown[]) => void prune(path));\n\nexport const getNode = (path: unknown[]): Node =>\n  path.reduce((node: Node, edge) => node.get(edge), root);\n\nexport const getSymbol = (path: unknown[]): symbol => {\n  const node = getNode(path);\n  const symbol = node.symbol?.deref();\n\n  if (!symbol) {\n    const symbol = Symbol();\n    node.symbol = new WeakRef(symbol);\n    registry.register(symbol, path);\n\n    return symbol;\n  }\n  return symbol;\n};\n\nexport const prune = (path: unknown[]): void => {\n  let last: [Node, unknown] = [root, null];\n  const nodes = [last];\n  for (const edge of path) {\n    last = [last[0].get(edge), edge];\n    nodes.push(last);\n  }\n  for (let i = nodes.length - 1; i > 0; i--) {\n    const [node, edge] = nodes[i];\n    const [parent] = nodes[i - 1];\n    if (node.size || node.tuple?.deref() || node.symbol?.deref() || node.object?.deref()) {\n      break;\n    }\n    parent.delete(edge);\n  }\n};\n\nexport const clear = () => {\n  root.clear();\n};\n", "export class Node extends Map<unknown, Node> {\n  tuple?: WeakRef<readonly unknown[]>;\n  symbol?: WeakRef<symbol>;\n  object?: WeakRef<Readonly<object>>;\n\n  get(edge: unknown): Node {\n    if (!this.has(edge)) {\n      const value = new Node();\n      this.set(edge, value);\n      return value;\n    }\n    return super.get(edge) as Node;\n  }\n}\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACAO,IAAM,OAAN,cAAmB,IAAmB;AAAA,EAC3C;AAAA,EACA;AAAA,EACA;AAAA,EAEA,IAAI,MAAqB;AACvB,QAAI,CAAC,KAAK,IAAI,IAAI,GAAG;AACnB,YAAM,QAAQ,IAAI,KAAK;AACvB,WAAK,IAAI,MAAM,KAAK;AACpB,aAAO;AAAA,IACT;AACA,WAAO,MAAM,IAAI,IAAI;AAAA,EACvB;AACF;AAba;;;ADEb,IAAM,OAAO,IAAI,KAAK;AAGf,IAAM,WAAW,IAAI,qBAAqB,CAAC,SAAoB,KAAK,MAAM,IAAI,CAAC;AAE/E,IAAM,UAAU,wBAAC,SACtB,KAAK,OAAO,CAAC,MAAY,SAAS,KAAK,IAAI,IAAI,GAAG,IAAI,GADjC;AAGhB,IAAM,YAAY,wBAAC,SAA4B;AACpD,QAAM,OAAO,QAAQ,IAAI;AACzB,QAAM,SAAS,KAAK,QAAQ,MAAM;AAElC,MAAI,CAAC,QAAQ;AACX,UAAMA,UAAS,OAAO;AACtB,SAAK,SAAS,IAAI,QAAQA,OAAM;AAChC,aAAS,SAASA,SAAQ,IAAI;AAE9B,WAAOA;AAAA,EACT;AACA,SAAO;AACT,GAZyB;AAclB,IAAM,QAAQ,wBAAC,SAA0B;AAC9C,MAAI,OAAwB,CAAC,MAAM,IAAI;AACvC,QAAM,QAAQ,CAAC,IAAI;AACnB,aAAW,QAAQ,MAAM;AACvB,WAAO,CAAC,KAAK,CAAC,EAAE,IAAI,IAAI,GAAG,IAAI;AAC/B,UAAM,KAAK,IAAI;AAAA,EACjB;AACA,WAAS,IAAI,MAAM,SAAS,GAAG,IAAI,GAAG,KAAK;AACzC,UAAM,CAAC,MAAM,IAAI,IAAI,MAAM,CAAC;AAC5B,UAAM,CAAC,MAAM,IAAI,MAAM,IAAI,CAAC;AAC5B,QAAI,KAAK,QAAQ,KAAK,OAAO,MAAM,KAAK,KAAK,QAAQ,MAAM,KAAK,KAAK,QAAQ,MAAM,GAAG;AACpF;AAAA,IACF;AACA,WAAO,OAAO,IAAI;AAAA,EACpB;AACF,GAfqB;AAiBd,IAAM,QAAQ,6BAAM;AACzB,OAAK,MAAM;AACb,GAFqB;",
+  "names": ["symbol"]
+}

package/dist/graph.d.ts

@@ -1,4 +1,4 @@
-import { Node } from './Node';
+import { Node } from './Node.ts';
 export declare const registry: FinalizationRegistry<unknown[]>;
 export declare const getNode: (path: unknown[]) => Node;
 export declare const getSymbol: (path: unknown[]) => symbol;

package/dist/graph.js

@@ -0,0 +1,62 @@
+var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+
+// src/Node.ts
+var Node = class extends Map {
+  tuple;
+  symbol;
+  object;
+  get(edge) {
+    if (!this.has(edge)) {
+      const value = new Node();
+      this.set(edge, value);
+      return value;
+    }
+    return super.get(edge);
+  }
+};
+__name(Node, "Node");
+
+// src/graph.ts
+var root = new Node();
+var registry = new FinalizationRegistry((path) => void prune(path));
+var getNode = /* @__PURE__ */ __name((path) => path.reduce((node, edge) => node.get(edge), root), "getNode");
+var getSymbol = /* @__PURE__ */ __name((path) => {
+  const node = getNode(path);
+  const symbol = node.symbol?.deref();
+  if (!symbol) {
+    const symbol2 = Symbol();
+    node.symbol = new WeakRef(symbol2);
+    registry.register(symbol2, path);
+    return symbol2;
+  }
+  return symbol;
+}, "getSymbol");
+var prune = /* @__PURE__ */ __name((path) => {
+  let last = [root, null];
+  const nodes = [last];
+  for (const edge of path) {
+    last = [last[0].get(edge), edge];
+    nodes.push(last);
+  }
+  for (let i = nodes.length - 1; i > 0; i--) {
+    const [node, edge] = nodes[i];
+    const [parent] = nodes[i - 1];
+    if (node.size || node.tuple?.deref() || node.symbol?.deref() || node.object?.deref()) {
+      break;
+    }
+    parent.delete(edge);
+  }
+}, "prune");
+var clear = /* @__PURE__ */ __name(() => {
+  root.clear();
+}, "clear");
+export {
+  clear,
+  getNode,
+  getSymbol,
+  prune,
+  registry
+};
+/*! For license information please see graph.js.LEGAL.txt */
+//# sourceMappingURL=graph.js.map

package/dist/graph.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../src/Node.ts", "../src/graph.ts"],
+  "sourcesContent": ["export class Node extends Map<unknown, Node> {\n  tuple?: WeakRef<readonly unknown[]>;\n  symbol?: WeakRef<symbol>;\n  object?: WeakRef<Readonly<object>>;\n\n  get(edge: unknown): Node {\n    if (!this.has(edge)) {\n      const value = new Node();\n      this.set(edge, value);\n      return value;\n    }\n    return super.get(edge) as Node;\n  }\n}\n", "import { Node } from './Node.ts';\n\nconst root = new Node();\n\n/* istanbul ignore next */\nexport const registry = new FinalizationRegistry((path: unknown[]) => void prune(path));\n\nexport const getNode = (path: unknown[]): Node =>\n  path.reduce((node: Node, edge) => node.get(edge), root);\n\nexport const getSymbol = (path: unknown[]): symbol => {\n  const node = getNode(path);\n  const symbol = node.symbol?.deref();\n\n  if (!symbol) {\n    const symbol = Symbol();\n    node.symbol = new WeakRef(symbol);\n    registry.register(symbol, path);\n\n    return symbol;\n  }\n  return symbol;\n};\n\nexport const prune = (path: unknown[]): void => {\n  let last: [Node, unknown] = [root, null];\n  const nodes = [last];\n  for (const edge of path) {\n    last = [last[0].get(edge), edge];\n    nodes.push(last);\n  }\n  for (let i = nodes.length - 1; i > 0; i--) {\n    const [node, edge] = nodes[i];\n    const [parent] = nodes[i - 1];\n    if (node.size || node.tuple?.deref() || node.symbol?.deref() || node.object?.deref()) {\n      break;\n    }\n    parent.delete(edge);\n  }\n};\n\nexport const clear = () => {\n  root.clear();\n};\n"],
+  "mappings": ";;;;AAAO,IAAM,OAAN,cAAmB,IAAmB;AAAA,EAC3C;AAAA,EACA;AAAA,EACA;AAAA,EAEA,IAAI,MAAqB;AACvB,QAAI,CAAC,KAAK,IAAI,IAAI,GAAG;AACnB,YAAM,QAAQ,IAAI,KAAK;AACvB,WAAK,IAAI,MAAM,KAAK;AACpB,aAAO;AAAA,IACT;AACA,WAAO,MAAM,IAAI,IAAI;AAAA,EACvB;AACF;AAba;;;ACEb,IAAM,OAAO,IAAI,KAAK;AAGf,IAAM,WAAW,IAAI,qBAAqB,CAAC,SAAoB,KAAK,MAAM,IAAI,CAAC;AAE/E,IAAM,UAAU,wBAAC,SACtB,KAAK,OAAO,CAAC,MAAY,SAAS,KAAK,IAAI,IAAI,GAAG,IAAI,GADjC;AAGhB,IAAM,YAAY,wBAAC,SAA4B;AACpD,QAAM,OAAO,QAAQ,IAAI;AACzB,QAAM,SAAS,KAAK,QAAQ,MAAM;AAElC,MAAI,CAAC,QAAQ;AACX,UAAMA,UAAS,OAAO;AACtB,SAAK,SAAS,IAAI,QAAQA,OAAM;AAChC,aAAS,SAASA,SAAQ,IAAI;AAE9B,WAAOA;AAAA,EACT;AACA,SAAO;AACT,GAZyB;AAclB,IAAM,QAAQ,wBAAC,SAA0B;AAC9C,MAAI,OAAwB,CAAC,MAAM,IAAI;AACvC,QAAM,QAAQ,CAAC,IAAI;AACnB,aAAW,QAAQ,MAAM;AACvB,WAAO,CAAC,KAAK,CAAC,EAAE,IAAI,IAAI,GAAG,IAAI;AAC/B,UAAM,KAAK,IAAI;AAAA,EACjB;AACA,WAAS,IAAI,MAAM,SAAS,GAAG,IAAI,GAAG,KAAK;AACzC,UAAM,CAAC,MAAM,IAAI,IAAI,MAAM,CAAC;AAC5B,UAAM,CAAC,MAAM,IAAI,MAAM,IAAI,CAAC;AAC5B,QAAI,KAAK,QAAQ,KAAK,OAAO,MAAM,KAAK,KAAK,QAAQ,MAAM,KAAK,KAAK,QAAQ,MAAM,GAAG;AACpF;AAAA,IACF;AACA,WAAO,OAAO,IAAI;AAAA,EACpB;AACF,GAfqB;AAiBd,IAAM,QAAQ,6BAAM;AACzB,OAAK,MAAM;AACb,GAFqB;",
+  "names": ["symbol"]
+}

package/dist/shallow.d.ts

@@ -0,0 +1,11 @@
+export declare const isRef: unique symbol;
+interface Referable {
+    [isRef]?: boolean;
+}
+declare global {
+    interface Object extends Referable {
+    }
+}
+export declare const shallow: <A extends object>(target: A) => A;
+export declare const cache: WeakSet<object>;
+export {};

package/dist/{tuplerone.mjs → tuplerone.cjs}

@@ -1,10 +1,39 @@
+"use strict";
 var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
 var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// src/tuplerone.ts
+var tuplerone_exports = {};
+__export(tuplerone_exports, {
+  Tuple: () => Tuple2,
+  getDeepSymbol: () => getDeepSymbol,
+  isRef: () => isRef,
+  memoize: () => memoize,
+  shallow: () => shallow
+});
+module.exports = __toCommonJS(tuplerone_exports);
 
 // src/Node.ts
 var Node = class extends Map {
   tuple;
   symbol;
+  object;
   get(edge) {
     if (!this.has(edge)) {
       const value = new Node();
@@ -41,7 +70,7 @@ var prune = /* @__PURE__ */ __name((path) => {
   for (let i = nodes.length - 1; i > 0; i--) {
     const [node, edge] = nodes[i];
     const [parent] = nodes[i - 1];
-    if (node.size || node.tuple?.deref() || node.symbol?.deref()) {
+    if (node.size || node.tuple?.deref() || node.symbol?.deref() || node.object?.deref()) {
       break;
     }
     parent.delete(edge);
@@ -56,7 +85,6 @@ var TupleConstructor = /* @__PURE__ */ __name(class Tuple extends Array {
     Object.freeze(this);
   }
 }, "Tuple");
-var isRef = Symbol("isRef");
 function Tuple2(...path) {
   if (new.target) {
     throw new TypeError("Tuple is not a constructor");
@@ -75,12 +103,10 @@ function Tuple2(...path) {
   return tuple;
 }
 __name(Tuple2, "Tuple");
-Object.defineProperties(Tuple2, {
-  [Symbol.hasInstance]: {
-    value: (instance) => instance instanceof TupleConstructor,
-    writable: false,
-    configurable: false
-  }
+Object.defineProperty(Tuple2, Symbol.hasInstance, {
+  value: (instance) => instance instanceof TupleConstructor,
+  writable: false,
+  configurable: false
 });
 var tuple0 = new TupleConstructor([]);
 
@@ -93,23 +119,15 @@ var getDeepSymbol = /* @__PURE__ */ __name((target) => {
   return result;
 }, "getDeepSymbol");
 var _get = /* @__PURE__ */ __name((edge) => {
-  switch (typeof edge) {
-    case "string":
-    case "symbol":
-    case "number":
-    case "boolean":
-    case "bigint":
-    case "undefined":
-    case "function":
-      return edge;
-    default:
-      if (Array.isArray(edge)) {
-        return getSymbol(edge.map(_get));
-      }
-      return getSymbol(
-        Object.entries(edge).flat().map((value, i) => i % 2 ? _get(value) : value)
-      );
+  if (typeof edge === "object") {
+    if (Array.isArray(edge)) {
+      return getSymbol(edge.map(_get));
+    }
+    return getSymbol(
+      Object.entries(edge).flat().map((value, i) => i % 2 ? _get(value) : value)
+    );
   }
+  return edge;
 }, "_get");
 
 // src/memoize.ts
@@ -127,11 +145,13 @@ var memoize = /* @__PURE__ */ __name((fn) => {
   }
   return memoized;
 }, "memoize");
-export {
-  Tuple2 as Tuple,
-  getDeepSymbol,
-  isRef,
-  memoize
-};
-/*! For license information please see tuplerone.mjs.LEGAL.txt */
-//# sourceMappingURL=tuplerone.mjs.map
+
+// src/shallow.ts
+var isRef = Symbol("isRef");
+var shallow = /* @__PURE__ */ __name((target) => {
+  cache2.add(target);
+  return target;
+}, "shallow");
+var cache2 = /* @__PURE__ */ new WeakSet();
+/*! For license information please see tuplerone.cjs.LEGAL.txt */
+//# sourceMappingURL=tuplerone.cjs.map

package/dist/tuplerone.cjs.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../src/tuplerone.ts", "../src/Node.ts", "../src/graph.ts", "../src/Tuple.ts", "../src/deep.ts", "../src/memoize.ts", "../src/shallow.ts"],
+  "sourcesContent": ["export { Tuple } from './Tuple.ts';\nexport { getDeepSymbol } from './deep.ts';\nexport { memoize } from './memoize.ts';\nexport { isRef, shallow } from './shallow.ts';\n", "export class Node extends Map<unknown, Node> {\n  tuple?: WeakRef<readonly unknown[]>;\n  symbol?: WeakRef<symbol>;\n  object?: WeakRef<Readonly<object>>;\n\n  get(edge: unknown): Node {\n    if (!this.has(edge)) {\n      const value = new Node();\n      this.set(edge, value);\n      return value;\n    }\n    return super.get(edge) as Node;\n  }\n}\n", "import { Node } from './Node.ts';\n\nconst root = new Node();\n\n/* istanbul ignore next */\nexport const registry = new FinalizationRegistry((path: unknown[]) => void prune(path));\n\nexport const getNode = (path: unknown[]): Node =>\n  path.reduce((node: Node, edge) => node.get(edge), root);\n\nexport const getSymbol = (path: unknown[]): symbol => {\n  const node = getNode(path);\n  const symbol = node.symbol?.deref();\n\n  if (!symbol) {\n    const symbol = Symbol();\n    node.symbol = new WeakRef(symbol);\n    registry.register(symbol, path);\n\n    return symbol;\n  }\n  return symbol;\n};\n\nexport const prune = (path: unknown[]): void => {\n  let last: [Node, unknown] = [root, null];\n  const nodes = [last];\n  for (const edge of path) {\n    last = [last[0].get(edge), edge];\n    nodes.push(last);\n  }\n  for (let i = nodes.length - 1; i > 0; i--) {\n    const [node, edge] = nodes[i];\n    const [parent] = nodes[i - 1];\n    if (node.size || node.tuple?.deref() || node.symbol?.deref() || node.object?.deref()) {\n      break;\n    }\n    parent.delete(edge);\n  }\n};\n\nexport const clear = () => {\n  root.clear();\n};\n", "import { getNode, registry } from './graph.ts';\n\nconst TupleConstructor = class Tuple<A extends readonly unknown[]> extends Array {\n  constructor(values: A) {\n    super();\n    this.push(...values);\n    Object.freeze(this);\n  }\n};\n\nexport function Tuple<A extends unknown[]>(...path: A): Readonly<A> {\n  if (new.target) {\n    throw new TypeError('Tuple is not a constructor');\n  }\n\n  if (path.length === 0) {\n    // Shortcut for 0-tuples\n    return tuple0 as any;\n  }\n\n  const node = getNode(path);\n  const derefed = node.tuple?.deref();\n  if (derefed) {\n    return derefed as A;\n  }\n  const tuple = new TupleConstructor<A>(path);\n  node.tuple = new WeakRef(tuple);\n  registry.register(tuple, path);\n\n  return tuple as A;\n}\n\n// Allow `instanceof` checks with the helper function as if it were a constructor\nObject.defineProperty(Tuple, Symbol.hasInstance, {\n  value: (instance: unknown) => instance instanceof TupleConstructor,\n  writable: false,\n  configurable: false,\n});\n\n// 0-tuple singleton\nconst tuple0 = new TupleConstructor([]);\n", "import { getSymbol } from './graph.ts';\n\nexport const getDeepSymbol = (target: unknown): symbol => {\n  const result = _get(target);\n  if (typeof result !== 'symbol') {\n    throw TypeError('Primitive values are not valid targets');\n  }\n  return result;\n};\n\nconst _get = <A>(edge: A): A | symbol => {\n  if (typeof edge === 'object') {\n    if (Array.isArray(edge)) {\n      return getSymbol(edge.map(_get));\n    }\n    return getSymbol(\n      Object.entries(edge as object)\n        .flat()\n        .map((value, i) => (i % 2 ? _get(value) : value)),\n    );\n  }\n  return edge;\n};\n", "import { getNode } from './graph.ts';\n\nconst cache = new WeakMap();\n\nexport const memoize = <A extends (...args: unknown[]) => unknown>(fn: A): A => {\n  const memoized = function (this: unknown, ...args: unknown[]) {\n    const node = getNode([memoized, this, ...args]);\n    if (!cache.has(node)) {\n      cache.set(node, fn.apply(this, args));\n    }\n    return cache.get(node);\n  };\n\n  if (fn.name) {\n    Object.defineProperty(memoized, 'name', { value: fn.name, writable: false });\n  }\n  return memoized as A;\n};\n", "export const isRef = Symbol('isRef');\n\ninterface Referable {\n  [isRef]?: boolean;\n}\n\ndeclare global {\n  interface Object extends Referable {}\n}\n\nexport const shallow = <A extends object>(target: A): A => {\n  cache.add(target);\n  return target;\n};\n\nexport const cache = new WeakSet<object>();\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA,eAAAA;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACAO,IAAM,OAAN,cAAmB,IAAmB;AAAA,EAC3C;AAAA,EACA;AAAA,EACA;AAAA,EAEA,IAAI,MAAqB;AACvB,QAAI,CAAC,KAAK,IAAI,IAAI,GAAG;AACnB,YAAM,QAAQ,IAAI,KAAK;AACvB,WAAK,IAAI,MAAM,KAAK;AACpB,aAAO;AAAA,IACT;AACA,WAAO,MAAM,IAAI,IAAI;AAAA,EACvB;AACF;AAba;;;ACEb,IAAM,OAAO,IAAI,KAAK;AAGf,IAAM,WAAW,IAAI,qBAAqB,CAAC,SAAoB,KAAK,MAAM,IAAI,CAAC;AAE/E,IAAM,UAAU,wBAAC,SACtB,KAAK,OAAO,CAAC,MAAY,SAAS,KAAK,IAAI,IAAI,GAAG,IAAI,GADjC;AAGhB,IAAM,YAAY,wBAAC,SAA4B;AACpD,QAAM,OAAO,QAAQ,IAAI;AACzB,QAAM,SAAS,KAAK,QAAQ,MAAM;AAElC,MAAI,CAAC,QAAQ;AACX,UAAMC,UAAS,OAAO;AACtB,SAAK,SAAS,IAAI,QAAQA,OAAM;AAChC,aAAS,SAASA,SAAQ,IAAI;AAE9B,WAAOA;AAAA,EACT;AACA,SAAO;AACT,GAZyB;AAclB,IAAM,QAAQ,wBAAC,SAA0B;AAC9C,MAAI,OAAwB,CAAC,MAAM,IAAI;AACvC,QAAM,QAAQ,CAAC,IAAI;AACnB,aAAW,QAAQ,MAAM;AACvB,WAAO,CAAC,KAAK,CAAC,EAAE,IAAI,IAAI,GAAG,IAAI;AAC/B,UAAM,KAAK,IAAI;AAAA,EACjB;AACA,WAAS,IAAI,MAAM,SAAS,GAAG,IAAI,GAAG,KAAK;AACzC,UAAM,CAAC,MAAM,IAAI,IAAI,MAAM,CAAC;AAC5B,UAAM,CAAC,MAAM,IAAI,MAAM,IAAI,CAAC;AAC5B,QAAI,KAAK,QAAQ,KAAK,OAAO,MAAM,KAAK,KAAK,QAAQ,MAAM,KAAK,KAAK,QAAQ,MAAM,GAAG;AACpF;AAAA,IACF;AACA,WAAO,OAAO,IAAI;AAAA,EACpB;AACF,GAfqB;;;ACtBrB,IAAM,mBAAmB,6BAAM,cAA4C,MAAM;AAAA,EAC/E,YAAY,QAAW;AACrB,UAAM;AACN,SAAK,KAAK,GAAG,MAAM;AACnB,WAAO,OAAO,IAAI;AAAA,EACpB;AACF,GANyB;AAQlB,SAASC,UAA8B,MAAsB;AAClE,MAAI,YAAY;AACd,UAAM,IAAI,UAAU,4BAA4B;AAAA,EAClD;AAEA,MAAI,KAAK,WAAW,GAAG;AAErB,WAAO;AAAA,EACT;AAEA,QAAM,OAAO,QAAQ,IAAI;AACzB,QAAM,UAAU,KAAK,OAAO,MAAM;AAClC,MAAI,SAAS;AACX,WAAO;AAAA,EACT;AACA,QAAM,QAAQ,IAAI,iBAAoB,IAAI;AAC1C,OAAK,QAAQ,IAAI,QAAQ,KAAK;AAC9B,WAAS,SAAS,OAAO,IAAI;AAE7B,SAAO;AACT;AApBgB,OAAAA,QAAA;AAuBhB,OAAO,eAAeA,QAAO,OAAO,aAAa;AAAA,EAC/C,OAAO,CAAC,aAAsB,oBAAoB;AAAA,EAClD,UAAU;AAAA,EACV,cAAc;AAChB,CAAC;AAGD,IAAM,SAAS,IAAI,iBAAiB,CAAC,CAAC;;;ACtC/B,IAAM,gBAAgB,wBAAC,WAA4B;AACxD,QAAM,SAAS,KAAK,MAAM;AAC1B,MAAI,OAAO,WAAW,UAAU;AAC9B,UAAM,UAAU,wCAAwC;AAAA,EAC1D;AACA,SAAO;AACT,GAN6B;AAQ7B,IAAM,OAAO,wBAAI,SAAwB;AACvC,MAAI,OAAO,SAAS,UAAU;AAC5B,QAAI,MAAM,QAAQ,IAAI,GAAG;AACvB,aAAO,UAAU,KAAK,IAAI,IAAI,CAAC;AAAA,IACjC;AACA,WAAO;AAAA,MACL,OAAO,QAAQ,IAAc,EAC1B,KAAK,EACL,IAAI,CAAC,OAAO,MAAO,IAAI,IAAI,KAAK,KAAK,IAAI,KAAM;AAAA,IACpD;AAAA,EACF;AACA,SAAO;AACT,GAZa;;;ACRb,IAAM,QAAQ,oBAAI,QAAQ;AAEnB,IAAM,UAAU,wBAA4C,OAAa;AAC9E,QAAM,WAAW,mCAA4B,MAAiB;AAC5D,UAAM,OAAO,QAAQ,CAAC,UAAU,MAAM,GAAG,IAAI,CAAC;AAC9C,QAAI,CAAC,MAAM,IAAI,IAAI,GAAG;AACpB,YAAM,IAAI,MAAM,GAAG,MAAM,MAAM,IAAI,CAAC;AAAA,IACtC;AACA,WAAO,MAAM,IAAI,IAAI;AAAA,EACvB,GANiB;AAQjB,MAAI,GAAG,MAAM;AACX,WAAO,eAAe,UAAU,QAAQ,EAAE,OAAO,GAAG,MAAM,UAAU,MAAM,CAAC;AAAA,EAC7E;AACA,SAAO;AACT,GAbuB;;;ACJhB,IAAM,QAAQ,OAAO,OAAO;AAU5B,IAAM,UAAU,wBAAmB,WAAiB;AACzD,EAAAC,OAAM,IAAI,MAAM;AAChB,SAAO;AACT,GAHuB;AAKhB,IAAMA,SAAQ,oBAAI,QAAgB;",
+  "names": ["Tuple", "symbol", "Tuple", "cache"]
+}

package/dist/tuplerone.d.ts

@@ -1,3 +1,4 @@
-export { Tuple, isRef } from './Tuple';
-export { getDeepSymbol } from './deep';
-export { memoize } from './memoize';
+export { Tuple } from './Tuple.ts';
+export { getDeepSymbol } from './deep.ts';
+export { memoize } from './memoize.ts';
+export { isRef, shallow } from './shallow.ts';

package/dist/tuplerone.js

@@ -1,37 +1,11 @@
-"use strict";
 var __defProp = Object.defineProperty;
-var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
-var __getOwnPropNames = Object.getOwnPropertyNames;
-var __hasOwnProp = Object.prototype.hasOwnProperty;
 var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
-var __export = (target, all) => {
-  for (var name in all)
-    __defProp(target, name, { get: all[name], enumerable: true });
-};
-var __copyProps = (to, from, except, desc) => {
-  if (from && typeof from === "object" || typeof from === "function") {
-    for (let key of __getOwnPropNames(from))
-      if (!__hasOwnProp.call(to, key) && key !== except)
-        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
-  }
-  return to;
-};
-var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
-
-// src/tuplerone.ts
-var tuplerone_exports = {};
-__export(tuplerone_exports, {
-  Tuple: () => Tuple2,
-  getDeepSymbol: () => getDeepSymbol,
-  isRef: () => isRef,
-  memoize: () => memoize
-});
-module.exports = __toCommonJS(tuplerone_exports);
 
 // src/Node.ts
 var Node = class extends Map {
   tuple;
   symbol;
+  object;
   get(edge) {
     if (!this.has(edge)) {
       const value = new Node();
@@ -68,7 +42,7 @@ var prune = /* @__PURE__ */ __name((path) => {
   for (let i = nodes.length - 1; i > 0; i--) {
     const [node, edge] = nodes[i];
     const [parent] = nodes[i - 1];
-    if (node.size || node.tuple?.deref() || node.symbol?.deref()) {
+    if (node.size || node.tuple?.deref() || node.symbol?.deref() || node.object?.deref()) {
       break;
     }
     parent.delete(edge);
@@ -83,7 +57,6 @@ var TupleConstructor = /* @__PURE__ */ __name(class Tuple extends Array {
     Object.freeze(this);
   }
 }, "Tuple");
-var isRef = Symbol("isRef");
 function Tuple2(...path) {
   if (new.target) {
     throw new TypeError("Tuple is not a constructor");
@@ -102,12 +75,10 @@ function Tuple2(...path) {
   return tuple;
 }
 __name(Tuple2, "Tuple");
-Object.defineProperties(Tuple2, {
-  [Symbol.hasInstance]: {
-    value: (instance) => instance instanceof TupleConstructor,
-    writable: false,
-    configurable: false
-  }
+Object.defineProperty(Tuple2, Symbol.hasInstance, {
+  value: (instance) => instance instanceof TupleConstructor,
+  writable: false,
+  configurable: false
 });
 var tuple0 = new TupleConstructor([]);
 
@@ -120,23 +91,15 @@ var getDeepSymbol = /* @__PURE__ */ __name((target) => {
   return result;
 }, "getDeepSymbol");
 var _get = /* @__PURE__ */ __name((edge) => {
-  switch (typeof edge) {
-    case "string":
-    case "symbol":
-    case "number":
-    case "boolean":
-    case "bigint":
-    case "undefined":
-    case "function":
-      return edge;
-    default:
-      if (Array.isArray(edge)) {
-        return getSymbol(edge.map(_get));
-      }
-      return getSymbol(
-        Object.entries(edge).flat().map((value, i) => i % 2 ? _get(value) : value)
-      );
+  if (typeof edge === "object") {
+    if (Array.isArray(edge)) {
+      return getSymbol(edge.map(_get));
+    }
+    return getSymbol(
+      Object.entries(edge).flat().map((value, i) => i % 2 ? _get(value) : value)
+    );
   }
+  return edge;
 }, "_get");
 
 // src/memoize.ts
@@ -154,5 +117,20 @@ var memoize = /* @__PURE__ */ __name((fn) => {
   }
   return memoized;
 }, "memoize");
+
+// src/shallow.ts
+var isRef = Symbol("isRef");
+var shallow = /* @__PURE__ */ __name((target) => {
+  cache2.add(target);
+  return target;
+}, "shallow");
+var cache2 = /* @__PURE__ */ new WeakSet();
+export {
+  Tuple2 as Tuple,
+  getDeepSymbol,
+  isRef,
+  memoize,
+  shallow
+};
 /*! For license information please see tuplerone.js.LEGAL.txt */
 //# sourceMappingURL=tuplerone.js.map

package/dist/tuplerone.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
-  "sources": ["../src/tuplerone.ts", "../src/Node.ts", "../src/graph.ts", "../src/Tuple.ts", "../src/deep.ts", "../src/memoize.ts"],
-  "sourcesContent": ["export { Tuple, isRef } from './Tuple';\nexport { getDeepSymbol } from './deep';\nexport { memoize } from './memoize';\n", "export class Node extends Map<unknown, Node> {\n  tuple?: WeakRef<readonly unknown[]>;\n  symbol?: WeakRef<symbol>;\n\n  get(edge: unknown): Node {\n    if (!this.has(edge)) {\n      const value = new Node();\n      this.set(edge, value);\n      return value;\n    }\n    return super.get(edge) as Node;\n  }\n}\n", "// import { Tuple } from './Tuple'\nimport { Node } from './Node';\n\nconst root = new Node();\n\nexport const registry = new FinalizationRegistry((path: unknown[]) => void prune(path));\n\nexport const getNode = (path: unknown[]): Node =>\n  path.reduce((node: Node, edge) => node.get(edge), root);\n\nexport const getSymbol = (path: unknown[]): symbol => {\n  const node = getNode(path);\n  const symbol = node.symbol?.deref();\n\n  if (!symbol) {\n    const symbol = Symbol();\n    node.symbol = new WeakRef(symbol);\n    registry.register(symbol, path);\n\n    return symbol;\n  }\n  return symbol;\n};\n\nexport const prune = (path: unknown[]): void => {\n  let last: [Node, unknown] = [root, null];\n  const nodes = [last];\n  for (const edge of path) {\n    last = [last[0].get(edge), edge];\n    nodes.push(last);\n  }\n  for (let i = nodes.length - 1; i > 0; i--) {\n    const [node, edge] = nodes[i];\n    const [parent] = nodes[i - 1];\n    if (node.size || node.tuple?.deref() || node.symbol?.deref()) {\n      break;\n    }\n    parent.delete(edge);\n  }\n};\n\nexport const clear = () => {\n  root.clear();\n};\n", "import { getNode, registry } from './graph';\n\nconst TupleConstructor = class Tuple<A extends readonly unknown[]> extends Array {\n  constructor(values: A) {\n    super();\n    this.push(...values);\n    Object.freeze(this);\n  }\n};\n\n// TODO: add isRef checks\nexport const isRef = Symbol('isRef');\n\ninterface Referable {\n  [isRef]: boolean;\n}\n\ndeclare global {\n  interface Object extends Referable {}\n}\n\nexport function Tuple<A extends unknown[]>(...path: A): Readonly<A> {\n  if (new.target) {\n    throw new TypeError('Tuple is not a constructor');\n  }\n\n  if (path.length === 0) {\n    // Shortcut for 0-tuples\n    return tuple0 as any;\n  }\n\n  const node = getNode(path);\n  const derefed = node.tuple?.deref();\n  if (derefed) {\n    return derefed as A;\n  }\n  const tuple = new TupleConstructor<A>(path);\n  node.tuple = new WeakRef(tuple);\n  registry.register(tuple, path);\n\n  return tuple as A;\n}\n\n// Allow `instanceof` checks with the helper function as if it were a constructor\nObject.defineProperties(Tuple, {\n  [Symbol.hasInstance]: {\n    value: (instance: unknown) => instance instanceof TupleConstructor,\n    writable: false,\n    configurable: false,\n  },\n});\n\n// 0-tuple singleton\nconst tuple0 = new TupleConstructor([]);\n", "import { getSymbol } from './graph';\n\nexport const getDeepSymbol = (target: unknown): symbol => {\n  const result = _get(target);\n  if (typeof result !== 'symbol') {\n    throw TypeError('Primitive values are not valid targets');\n  }\n  return result;\n};\n\nconst _get = <A>(edge: A): A | symbol => {\n  switch (typeof edge) {\n    case 'string':\n    case 'symbol':\n    case 'number':\n    case 'boolean':\n    case 'bigint':\n    case 'undefined':\n    case 'function':\n      return edge;\n    default:\n      if (Array.isArray(edge)) {\n        return getSymbol(edge.map(_get));\n      }\n      return getSymbol(\n        Object.entries(edge as object)\n          .flat()\n          .map((value, i) => (i % 2 ? _get(value) : value)),\n      );\n  }\n};\n", "import { getNode } from './graph';\n\nconst cache = new WeakMap();\n\nexport const memoize = <A extends (...args: unknown[]) => unknown>(fn: A): A => {\n  const memoized = function (this: unknown, ...args: unknown[]) {\n    const node = getNode([memoized, this, ...args]);\n    if (!cache.has(node)) {\n      cache.set(node, fn.apply(this, args));\n    }\n    return cache.get(node);\n  };\n\n  if (fn.name) {\n    Object.defineProperty(memoized, 'name', { value: fn.name, writable: false });\n  }\n  return memoized as A;\n};\n"],
-  "mappings": ";;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA,eAAAA;AAAA,EAAA;AAAA;AAAA;AAAA;AAAA;;;ACAO,IAAM,OAAN,cAAmB,IAAmB;AAAA,EAC3C;AAAA,EACA;AAAA,EAEA,IAAI,MAAqB;AACvB,QAAI,CAAC,KAAK,IAAI,IAAI,GAAG;AACnB,YAAM,QAAQ,IAAI,KAAK;AACvB,WAAK,IAAI,MAAM,KAAK;AACpB,aAAO;AAAA,IACT;AACA,WAAO,MAAM,IAAI,IAAI;AAAA,EACvB;AACF;AAZa;;;ACGb,IAAM,OAAO,IAAI,KAAK;AAEf,IAAM,WAAW,IAAI,qBAAqB,CAAC,SAAoB,KAAK,MAAM,IAAI,CAAC;AAE/E,IAAM,UAAU,wBAAC,SACtB,KAAK,OAAO,CAAC,MAAY,SAAS,KAAK,IAAI,IAAI,GAAG,IAAI,GADjC;AAGhB,IAAM,YAAY,wBAAC,SAA4B;AACpD,QAAM,OAAO,QAAQ,IAAI;AACzB,QAAM,SAAS,KAAK,QAAQ,MAAM;AAElC,MAAI,CAAC,QAAQ;AACX,UAAMC,UAAS,OAAO;AACtB,SAAK,SAAS,IAAI,QAAQA,OAAM;AAChC,aAAS,SAASA,SAAQ,IAAI;AAE9B,WAAOA;AAAA,EACT;AACA,SAAO;AACT,GAZyB;AAclB,IAAM,QAAQ,wBAAC,SAA0B;AAC9C,MAAI,OAAwB,CAAC,MAAM,IAAI;AACvC,QAAM,QAAQ,CAAC,IAAI;AACnB,aAAW,QAAQ,MAAM;AACvB,WAAO,CAAC,KAAK,CAAC,EAAE,IAAI,IAAI,GAAG,IAAI;AAC/B,UAAM,KAAK,IAAI;AAAA,EACjB;AACA,WAAS,IAAI,MAAM,SAAS,GAAG,IAAI,GAAG,KAAK;AACzC,UAAM,CAAC,MAAM,IAAI,IAAI,MAAM,CAAC;AAC5B,UAAM,CAAC,MAAM,IAAI,MAAM,IAAI,CAAC;AAC5B,QAAI,KAAK,QAAQ,KAAK,OAAO,MAAM,KAAK,KAAK,QAAQ,MAAM,GAAG;AAC5D;AAAA,IACF;AACA,WAAO,OAAO,IAAI;AAAA,EACpB;AACF,GAfqB;;;ACtBrB,IAAM,mBAAmB,6BAAM,cAA4C,MAAM;AAAA,EAC/E,YAAY,QAAW;AACrB,UAAM;AACN,SAAK,KAAK,GAAG,MAAM;AACnB,WAAO,OAAO,IAAI;AAAA,EACpB;AACF,GANyB;AASlB,IAAM,QAAQ,OAAO,OAAO;AAU5B,SAASC,UAA8B,MAAsB;AAClE,MAAI,YAAY;AACd,UAAM,IAAI,UAAU,4BAA4B;AAAA,EAClD;AAEA,MAAI,KAAK,WAAW,GAAG;AAErB,WAAO;AAAA,EACT;AAEA,QAAM,OAAO,QAAQ,IAAI;AACzB,QAAM,UAAU,KAAK,OAAO,MAAM;AAClC,MAAI,SAAS;AACX,WAAO;AAAA,EACT;AACA,QAAM,QAAQ,IAAI,iBAAoB,IAAI;AAC1C,OAAK,QAAQ,IAAI,QAAQ,KAAK;AAC9B,WAAS,SAAS,OAAO,IAAI;AAE7B,SAAO;AACT;AApBgB,OAAAA,QAAA;AAuBhB,OAAO,iBAAiBA,QAAO;AAAA,EAC7B,CAAC,OAAO,WAAW,GAAG;AAAA,IACpB,OAAO,CAAC,aAAsB,oBAAoB;AAAA,IAClD,UAAU;AAAA,IACV,cAAc;AAAA,EAChB;AACF,CAAC;AAGD,IAAM,SAAS,IAAI,iBAAiB,CAAC,CAAC;;;ACnD/B,IAAM,gBAAgB,wBAAC,WAA4B;AACxD,QAAM,SAAS,KAAK,MAAM;AAC1B,MAAI,OAAO,WAAW,UAAU;AAC9B,UAAM,UAAU,wCAAwC;AAAA,EAC1D;AACA,SAAO;AACT,GAN6B;AAQ7B,IAAM,OAAO,wBAAI,SAAwB;AACvC,UAAQ,OAAO,MAAM;AAAA,IACnB,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,aAAO;AAAA,IACT;AACE,UAAI,MAAM,QAAQ,IAAI,GAAG;AACvB,eAAO,UAAU,KAAK,IAAI,IAAI,CAAC;AAAA,MACjC;AACA,aAAO;AAAA,QACL,OAAO,QAAQ,IAAc,EAC1B,KAAK,EACL,IAAI,CAAC,OAAO,MAAO,IAAI,IAAI,KAAK,KAAK,IAAI,KAAM;AAAA,MACpD;AAAA,EACJ;AACF,GApBa;;;ACRb,IAAM,QAAQ,oBAAI,QAAQ;AAEnB,IAAM,UAAU,wBAA4C,OAAa;AAC9E,QAAM,WAAW,mCAA4B,MAAiB;AAC5D,UAAM,OAAO,QAAQ,CAAC,UAAU,MAAM,GAAG,IAAI,CAAC;AAC9C,QAAI,CAAC,MAAM,IAAI,IAAI,GAAG;AACpB,YAAM,IAAI,MAAM,GAAG,MAAM,MAAM,IAAI,CAAC;AAAA,IACtC;AACA,WAAO,MAAM,IAAI,IAAI;AAAA,EACvB,GANiB;AAQjB,MAAI,GAAG,MAAM;AACX,WAAO,eAAe,UAAU,QAAQ,EAAE,OAAO,GAAG,MAAM,UAAU,MAAM,CAAC;AAAA,EAC7E;AACA,SAAO;AACT,GAbuB;",
-  "names": ["Tuple", "symbol", "Tuple"]
+  "sources": ["../src/Node.ts", "../src/graph.ts", "../src/Tuple.ts", "../src/deep.ts", "../src/memoize.ts", "../src/shallow.ts"],
+  "sourcesContent": ["export class Node extends Map<unknown, Node> {\n  tuple?: WeakRef<readonly unknown[]>;\n  symbol?: WeakRef<symbol>;\n  object?: WeakRef<Readonly<object>>;\n\n  get(edge: unknown): Node {\n    if (!this.has(edge)) {\n      const value = new Node();\n      this.set(edge, value);\n      return value;\n    }\n    return super.get(edge) as Node;\n  }\n}\n", "import { Node } from './Node.ts';\n\nconst root = new Node();\n\n/* istanbul ignore next */\nexport const registry = new FinalizationRegistry((path: unknown[]) => void prune(path));\n\nexport const getNode = (path: unknown[]): Node =>\n  path.reduce((node: Node, edge) => node.get(edge), root);\n\nexport const getSymbol = (path: unknown[]): symbol => {\n  const node = getNode(path);\n  const symbol = node.symbol?.deref();\n\n  if (!symbol) {\n    const symbol = Symbol();\n    node.symbol = new WeakRef(symbol);\n    registry.register(symbol, path);\n\n    return symbol;\n  }\n  return symbol;\n};\n\nexport const prune = (path: unknown[]): void => {\n  let last: [Node, unknown] = [root, null];\n  const nodes = [last];\n  for (const edge of path) {\n    last = [last[0].get(edge), edge];\n    nodes.push(last);\n  }\n  for (let i = nodes.length - 1; i > 0; i--) {\n    const [node, edge] = nodes[i];\n    const [parent] = nodes[i - 1];\n    if (node.size || node.tuple?.deref() || node.symbol?.deref() || node.object?.deref()) {\n      break;\n    }\n    parent.delete(edge);\n  }\n};\n\nexport const clear = () => {\n  root.clear();\n};\n", "import { getNode, registry } from './graph.ts';\n\nconst TupleConstructor = class Tuple<A extends readonly unknown[]> extends Array {\n  constructor(values: A) {\n    super();\n    this.push(...values);\n    Object.freeze(this);\n  }\n};\n\nexport function Tuple<A extends unknown[]>(...path: A): Readonly<A> {\n  if (new.target) {\n    throw new TypeError('Tuple is not a constructor');\n  }\n\n  if (path.length === 0) {\n    // Shortcut for 0-tuples\n    return tuple0 as any;\n  }\n\n  const node = getNode(path);\n  const derefed = node.tuple?.deref();\n  if (derefed) {\n    return derefed as A;\n  }\n  const tuple = new TupleConstructor<A>(path);\n  node.tuple = new WeakRef(tuple);\n  registry.register(tuple, path);\n\n  return tuple as A;\n}\n\n// Allow `instanceof` checks with the helper function as if it were a constructor\nObject.defineProperty(Tuple, Symbol.hasInstance, {\n  value: (instance: unknown) => instance instanceof TupleConstructor,\n  writable: false,\n  configurable: false,\n});\n\n// 0-tuple singleton\nconst tuple0 = new TupleConstructor([]);\n", "import { getSymbol } from './graph.ts';\n\nexport const getDeepSymbol = (target: unknown): symbol => {\n  const result = _get(target);\n  if (typeof result !== 'symbol') {\n    throw TypeError('Primitive values are not valid targets');\n  }\n  return result;\n};\n\nconst _get = <A>(edge: A): A | symbol => {\n  if (typeof edge === 'object') {\n    if (Array.isArray(edge)) {\n      return getSymbol(edge.map(_get));\n    }\n    return getSymbol(\n      Object.entries(edge as object)\n        .flat()\n        .map((value, i) => (i % 2 ? _get(value) : value)),\n    );\n  }\n  return edge;\n};\n", "import { getNode } from './graph.ts';\n\nconst cache = new WeakMap();\n\nexport const memoize = <A extends (...args: unknown[]) => unknown>(fn: A): A => {\n  const memoized = function (this: unknown, ...args: unknown[]) {\n    const node = getNode([memoized, this, ...args]);\n    if (!cache.has(node)) {\n      cache.set(node, fn.apply(this, args));\n    }\n    return cache.get(node);\n  };\n\n  if (fn.name) {\n    Object.defineProperty(memoized, 'name', { value: fn.name, writable: false });\n  }\n  return memoized as A;\n};\n", "export const isRef = Symbol('isRef');\n\ninterface Referable {\n  [isRef]?: boolean;\n}\n\ndeclare global {\n  interface Object extends Referable {}\n}\n\nexport const shallow = <A extends object>(target: A): A => {\n  cache.add(target);\n  return target;\n};\n\nexport const cache = new WeakSet<object>();\n"],
+  "mappings": ";;;;AAAO,IAAM,OAAN,cAAmB,IAAmB;AAAA,EAC3C;AAAA,EACA;AAAA,EACA;AAAA,EAEA,IAAI,MAAqB;AACvB,QAAI,CAAC,KAAK,IAAI,IAAI,GAAG;AACnB,YAAM,QAAQ,IAAI,KAAK;AACvB,WAAK,IAAI,MAAM,KAAK;AACpB,aAAO;AAAA,IACT;AACA,WAAO,MAAM,IAAI,IAAI;AAAA,EACvB;AACF;AAba;;;ACEb,IAAM,OAAO,IAAI,KAAK;AAGf,IAAM,WAAW,IAAI,qBAAqB,CAAC,SAAoB,KAAK,MAAM,IAAI,CAAC;AAE/E,IAAM,UAAU,wBAAC,SACtB,KAAK,OAAO,CAAC,MAAY,SAAS,KAAK,IAAI,IAAI,GAAG,IAAI,GADjC;AAGhB,IAAM,YAAY,wBAAC,SAA4B;AACpD,QAAM,OAAO,QAAQ,IAAI;AACzB,QAAM,SAAS,KAAK,QAAQ,MAAM;AAElC,MAAI,CAAC,QAAQ;AACX,UAAMA,UAAS,OAAO;AACtB,SAAK,SAAS,IAAI,QAAQA,OAAM;AAChC,aAAS,SAASA,SAAQ,IAAI;AAE9B,WAAOA;AAAA,EACT;AACA,SAAO;AACT,GAZyB;AAclB,IAAM,QAAQ,wBAAC,SAA0B;AAC9C,MAAI,OAAwB,CAAC,MAAM,IAAI;AACvC,QAAM,QAAQ,CAAC,IAAI;AACnB,aAAW,QAAQ,MAAM;AACvB,WAAO,CAAC,KAAK,CAAC,EAAE,IAAI,IAAI,GAAG,IAAI;AAC/B,UAAM,KAAK,IAAI;AAAA,EACjB;AACA,WAAS,IAAI,MAAM,SAAS,GAAG,IAAI,GAAG,KAAK;AACzC,UAAM,CAAC,MAAM,IAAI,IAAI,MAAM,CAAC;AAC5B,UAAM,CAAC,MAAM,IAAI,MAAM,IAAI,CAAC;AAC5B,QAAI,KAAK,QAAQ,KAAK,OAAO,MAAM,KAAK,KAAK,QAAQ,MAAM,KAAK,KAAK,QAAQ,MAAM,GAAG;AACpF;AAAA,IACF;AACA,WAAO,OAAO,IAAI;AAAA,EACpB;AACF,GAfqB;;;ACtBrB,IAAM,mBAAmB,6BAAM,cAA4C,MAAM;AAAA,EAC/E,YAAY,QAAW;AACrB,UAAM;AACN,SAAK,KAAK,GAAG,MAAM;AACnB,WAAO,OAAO,IAAI;AAAA,EACpB;AACF,GANyB;AAQlB,SAASC,UAA8B,MAAsB;AAClE,MAAI,YAAY;AACd,UAAM,IAAI,UAAU,4BAA4B;AAAA,EAClD;AAEA,MAAI,KAAK,WAAW,GAAG;AAErB,WAAO;AAAA,EACT;AAEA,QAAM,OAAO,QAAQ,IAAI;AACzB,QAAM,UAAU,KAAK,OAAO,MAAM;AAClC,MAAI,SAAS;AACX,WAAO;AAAA,EACT;AACA,QAAM,QAAQ,IAAI,iBAAoB,IAAI;AAC1C,OAAK,QAAQ,IAAI,QAAQ,KAAK;AAC9B,WAAS,SAAS,OAAO,IAAI;AAE7B,SAAO;AACT;AApBgB,OAAAA,QAAA;AAuBhB,OAAO,eAAeA,QAAO,OAAO,aAAa;AAAA,EAC/C,OAAO,CAAC,aAAsB,oBAAoB;AAAA,EAClD,UAAU;AAAA,EACV,cAAc;AAChB,CAAC;AAGD,IAAM,SAAS,IAAI,iBAAiB,CAAC,CAAC;;;ACtC/B,IAAM,gBAAgB,wBAAC,WAA4B;AACxD,QAAM,SAAS,KAAK,MAAM;AAC1B,MAAI,OAAO,WAAW,UAAU;AAC9B,UAAM,UAAU,wCAAwC;AAAA,EAC1D;AACA,SAAO;AACT,GAN6B;AAQ7B,IAAM,OAAO,wBAAI,SAAwB;AACvC,MAAI,OAAO,SAAS,UAAU;AAC5B,QAAI,MAAM,QAAQ,IAAI,GAAG;AACvB,aAAO,UAAU,KAAK,IAAI,IAAI,CAAC;AAAA,IACjC;AACA,WAAO;AAAA,MACL,OAAO,QAAQ,IAAc,EAC1B,KAAK,EACL,IAAI,CAAC,OAAO,MAAO,IAAI,IAAI,KAAK,KAAK,IAAI,KAAM;AAAA,IACpD;AAAA,EACF;AACA,SAAO;AACT,GAZa;;;ACRb,IAAM,QAAQ,oBAAI,QAAQ;AAEnB,IAAM,UAAU,wBAA4C,OAAa;AAC9E,QAAM,WAAW,mCAA4B,MAAiB;AAC5D,UAAM,OAAO,QAAQ,CAAC,UAAU,MAAM,GAAG,IAAI,CAAC;AAC9C,QAAI,CAAC,MAAM,IAAI,IAAI,GAAG;AACpB,YAAM,IAAI,MAAM,GAAG,MAAM,MAAM,IAAI,CAAC;AAAA,IACtC;AACA,WAAO,MAAM,IAAI,IAAI;AAAA,EACvB,GANiB;AAQjB,MAAI,GAAG,MAAM;AACX,WAAO,eAAe,UAAU,QAAQ,EAAE,OAAO,GAAG,MAAM,UAAU,MAAM,CAAC;AAAA,EAC7E;AACA,SAAO;AACT,GAbuB;;;ACJhB,IAAM,QAAQ,OAAO,OAAO;AAU5B,IAAM,UAAU,wBAAmB,WAAiB;AACzD,EAAAC,OAAM,IAAI,MAAM;AAChB,SAAO;AACT,GAHuB;AAKhB,IAAMA,SAAQ,oBAAI,QAAgB;",
+  "names": ["symbol", "Tuple", "cache"]
 }

package/package.json

@@ -13,14 +13,21 @@
     "hashing",
     "value objects"
   ],
+  "type": "module",
   "exports": {
     ".": {
       "types": "./dist/tuplerone.d.ts",
-      "require": "./dist/tuplerone.js",
-      "import": "./dist/tuplerone.mjs"
+      "import": "./dist/tuplerone.js",
+      "require": "./dist/tuplerone.cjs"
     },
-    "./package.json": "./package.json"
+    "./graph": {
+      "types": "./dist/graph.d.ts",
+      "import": "./dist/graph.js",
+      "require": "./dist/graph.cjs"
+    }
   },
+  "types": "./dist/tuplerone.d.ts",
+  "main": "./dist/tuplerone.cjs",
   "files": [
     "dist"
   ],
@@ -34,15 +41,18 @@
     "lint:eslint": "eslint .",
     "lint:prettier": "prettier --check .",
     "test": "jest",
-    "_postinstall": "husky install",
+    "_postinstall": "is-ci || husky install",
     "prepack": "pinst --disable",
     "postpack": "pinst --enable",
-    "build": "nanobundle build"
+    "build": "nanobundle build",
+    "demo": "yarn workspace demo",
+    "docs": "typedoc"
   },
   "lint-staged": {
+    "*": "prettier --ignore-unknown --write",
     "src/**/*.ts": [
-      "prettier --write",
-      "git add"
+      "eslint --fix",
+      "tsc-files"
     ]
   },
   "jest": {
@@ -71,9 +81,12 @@
     "@babel/core": "^7.22.9",
     "@babel/preset-env": "^7.22.9",
     "@babel/preset-typescript": "^7.22.5",
+    "@commitlint/cli": "^17.6.7",
+    "@commitlint/config-conventional": "^17.6.7",
     "@types/babel__core": "^7.20.1",
     "@types/babel__preset-env": "^7.9.2",
     "@types/eslint": "^8.44.1",
+    "@types/is-ci": "^3",
     "@types/jest": "^29.5.3",
     "@types/node": "^20.4.5",
     "@typescript-eslint/eslint-plugin": "^6.2.0",
@@ -86,25 +99,20 @@
     "eslint-plugin-jest": "^27.2.3",
     "eslint-plugin-tsdoc": "^0.2.17",
     "husky": "^8.0.3",
+    "is-ci": "^3.0.1",
     "jest": "^29.6.2",
     "lint-staged": "^13.2.3",
     "lodash.camelcase": "^4.3.0",
     "microbundle": "^0.15.1",
     "nanobundle": "^1.6.0",
     "pinst": "^3.0.0",
-    "prettier": "^3.0.0",
+    "prettier": "2.8.8",
     "semantic-release": "^21.0.7",
+    "tsc-files": "^1.1.4",
     "typedoc": "^0.24.8",
     "typescript": "5.2.0-beta"
   },
   "bugs": "https://github.com/slikts/tuplerone/issues",
-  "husky": {
-    "husky": {
-      "hooks": {
-        "pre-commit": "lint-staged"
-      }
-    }
-  },
   "packageManager": "yarn@4.0.0-rc.48",
-  "version": "4.0.0-next.1"
+  "version": "4.0.0-next.3"
 }

package/dist/tuplerone.mjs.map

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../src/Node.ts", "../src/graph.ts", "../src/Tuple.ts", "../src/deep.ts", "../src/memoize.ts"],
-  "sourcesContent": ["export class Node extends Map<unknown, Node> {\n  tuple?: WeakRef<readonly unknown[]>;\n  symbol?: WeakRef<symbol>;\n\n  get(edge: unknown): Node {\n    if (!this.has(edge)) {\n      const value = new Node();\n      this.set(edge, value);\n      return value;\n    }\n    return super.get(edge) as Node;\n  }\n}\n", "// import { Tuple } from './Tuple'\nimport { Node } from './Node';\n\nconst root = new Node();\n\nexport const registry = new FinalizationRegistry((path: unknown[]) => void prune(path));\n\nexport const getNode = (path: unknown[]): Node =>\n  path.reduce((node: Node, edge) => node.get(edge), root);\n\nexport const getSymbol = (path: unknown[]): symbol => {\n  const node = getNode(path);\n  const symbol = node.symbol?.deref();\n\n  if (!symbol) {\n    const symbol = Symbol();\n    node.symbol = new WeakRef(symbol);\n    registry.register(symbol, path);\n\n    return symbol;\n  }\n  return symbol;\n};\n\nexport const prune = (path: unknown[]): void => {\n  let last: [Node, unknown] = [root, null];\n  const nodes = [last];\n  for (const edge of path) {\n    last = [last[0].get(edge), edge];\n    nodes.push(last);\n  }\n  for (let i = nodes.length - 1; i > 0; i--) {\n    const [node, edge] = nodes[i];\n    const [parent] = nodes[i - 1];\n    if (node.size || node.tuple?.deref() || node.symbol?.deref()) {\n      break;\n    }\n    parent.delete(edge);\n  }\n};\n\nexport const clear = () => {\n  root.clear();\n};\n", "import { getNode, registry } from './graph';\n\nconst TupleConstructor = class Tuple<A extends readonly unknown[]> extends Array {\n  constructor(values: A) {\n    super();\n    this.push(...values);\n    Object.freeze(this);\n  }\n};\n\n// TODO: add isRef checks\nexport const isRef = Symbol('isRef');\n\ninterface Referable {\n  [isRef]: boolean;\n}\n\ndeclare global {\n  interface Object extends Referable {}\n}\n\nexport function Tuple<A extends unknown[]>(...path: A): Readonly<A> {\n  if (new.target) {\n    throw new TypeError('Tuple is not a constructor');\n  }\n\n  if (path.length === 0) {\n    // Shortcut for 0-tuples\n    return tuple0 as any;\n  }\n\n  const node = getNode(path);\n  const derefed = node.tuple?.deref();\n  if (derefed) {\n    return derefed as A;\n  }\n  const tuple = new TupleConstructor<A>(path);\n  node.tuple = new WeakRef(tuple);\n  registry.register(tuple, path);\n\n  return tuple as A;\n}\n\n// Allow `instanceof` checks with the helper function as if it were a constructor\nObject.defineProperties(Tuple, {\n  [Symbol.hasInstance]: {\n    value: (instance: unknown) => instance instanceof TupleConstructor,\n    writable: false,\n    configurable: false,\n  },\n});\n\n// 0-tuple singleton\nconst tuple0 = new TupleConstructor([]);\n", "import { getSymbol } from './graph';\n\nexport const getDeepSymbol = (target: unknown): symbol => {\n  const result = _get(target);\n  if (typeof result !== 'symbol') {\n    throw TypeError('Primitive values are not valid targets');\n  }\n  return result;\n};\n\nconst _get = <A>(edge: A): A | symbol => {\n  switch (typeof edge) {\n    case 'string':\n    case 'symbol':\n    case 'number':\n    case 'boolean':\n    case 'bigint':\n    case 'undefined':\n    case 'function':\n      return edge;\n    default:\n      if (Array.isArray(edge)) {\n        return getSymbol(edge.map(_get));\n      }\n      return getSymbol(\n        Object.entries(edge as object)\n          .flat()\n          .map((value, i) => (i % 2 ? _get(value) : value)),\n      );\n  }\n};\n", "import { getNode } from './graph';\n\nconst cache = new WeakMap();\n\nexport const memoize = <A extends (...args: unknown[]) => unknown>(fn: A): A => {\n  const memoized = function (this: unknown, ...args: unknown[]) {\n    const node = getNode([memoized, this, ...args]);\n    if (!cache.has(node)) {\n      cache.set(node, fn.apply(this, args));\n    }\n    return cache.get(node);\n  };\n\n  if (fn.name) {\n    Object.defineProperty(memoized, 'name', { value: fn.name, writable: false });\n  }\n  return memoized as A;\n};\n"],
-  "mappings": ";;;;AAAO,IAAM,OAAN,cAAmB,IAAmB;AAAA,EAC3C;AAAA,EACA;AAAA,EAEA,IAAI,MAAqB;AACvB,QAAI,CAAC,KAAK,IAAI,IAAI,GAAG;AACnB,YAAM,QAAQ,IAAI,KAAK;AACvB,WAAK,IAAI,MAAM,KAAK;AACpB,aAAO;AAAA,IACT;AACA,WAAO,MAAM,IAAI,IAAI;AAAA,EACvB;AACF;AAZa;;;ACGb,IAAM,OAAO,IAAI,KAAK;AAEf,IAAM,WAAW,IAAI,qBAAqB,CAAC,SAAoB,KAAK,MAAM,IAAI,CAAC;AAE/E,IAAM,UAAU,wBAAC,SACtB,KAAK,OAAO,CAAC,MAAY,SAAS,KAAK,IAAI,IAAI,GAAG,IAAI,GADjC;AAGhB,IAAM,YAAY,wBAAC,SAA4B;AACpD,QAAM,OAAO,QAAQ,IAAI;AACzB,QAAM,SAAS,KAAK,QAAQ,MAAM;AAElC,MAAI,CAAC,QAAQ;AACX,UAAMA,UAAS,OAAO;AACtB,SAAK,SAAS,IAAI,QAAQA,OAAM;AAChC,aAAS,SAASA,SAAQ,IAAI;AAE9B,WAAOA;AAAA,EACT;AACA,SAAO;AACT,GAZyB;AAclB,IAAM,QAAQ,wBAAC,SAA0B;AAC9C,MAAI,OAAwB,CAAC,MAAM,IAAI;AACvC,QAAM,QAAQ,CAAC,IAAI;AACnB,aAAW,QAAQ,MAAM;AACvB,WAAO,CAAC,KAAK,CAAC,EAAE,IAAI,IAAI,GAAG,IAAI;AAC/B,UAAM,KAAK,IAAI;AAAA,EACjB;AACA,WAAS,IAAI,MAAM,SAAS,GAAG,IAAI,GAAG,KAAK;AACzC,UAAM,CAAC,MAAM,IAAI,IAAI,MAAM,CAAC;AAC5B,UAAM,CAAC,MAAM,IAAI,MAAM,IAAI,CAAC;AAC5B,QAAI,KAAK,QAAQ,KAAK,OAAO,MAAM,KAAK,KAAK,QAAQ,MAAM,GAAG;AAC5D;AAAA,IACF;AACA,WAAO,OAAO,IAAI;AAAA,EACpB;AACF,GAfqB;;;ACtBrB,IAAM,mBAAmB,6BAAM,cAA4C,MAAM;AAAA,EAC/E,YAAY,QAAW;AACrB,UAAM;AACN,SAAK,KAAK,GAAG,MAAM;AACnB,WAAO,OAAO,IAAI;AAAA,EACpB;AACF,GANyB;AASlB,IAAM,QAAQ,OAAO,OAAO;AAU5B,SAASC,UAA8B,MAAsB;AAClE,MAAI,YAAY;AACd,UAAM,IAAI,UAAU,4BAA4B;AAAA,EAClD;AAEA,MAAI,KAAK,WAAW,GAAG;AAErB,WAAO;AAAA,EACT;AAEA,QAAM,OAAO,QAAQ,IAAI;AACzB,QAAM,UAAU,KAAK,OAAO,MAAM;AAClC,MAAI,SAAS;AACX,WAAO;AAAA,EACT;AACA,QAAM,QAAQ,IAAI,iBAAoB,IAAI;AAC1C,OAAK,QAAQ,IAAI,QAAQ,KAAK;AAC9B,WAAS,SAAS,OAAO,IAAI;AAE7B,SAAO;AACT;AApBgB,OAAAA,QAAA;AAuBhB,OAAO,iBAAiBA,QAAO;AAAA,EAC7B,CAAC,OAAO,WAAW,GAAG;AAAA,IACpB,OAAO,CAAC,aAAsB,oBAAoB;AAAA,IAClD,UAAU;AAAA,IACV,cAAc;AAAA,EAChB;AACF,CAAC;AAGD,IAAM,SAAS,IAAI,iBAAiB,CAAC,CAAC;;;ACnD/B,IAAM,gBAAgB,wBAAC,WAA4B;AACxD,QAAM,SAAS,KAAK,MAAM;AAC1B,MAAI,OAAO,WAAW,UAAU;AAC9B,UAAM,UAAU,wCAAwC;AAAA,EAC1D;AACA,SAAO;AACT,GAN6B;AAQ7B,IAAM,OAAO,wBAAI,SAAwB;AACvC,UAAQ,OAAO,MAAM;AAAA,IACnB,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACH,aAAO;AAAA,IACT;AACE,UAAI,MAAM,QAAQ,IAAI,GAAG;AACvB,eAAO,UAAU,KAAK,IAAI,IAAI,CAAC;AAAA,MACjC;AACA,aAAO;AAAA,QACL,OAAO,QAAQ,IAAc,EAC1B,KAAK,EACL,IAAI,CAAC,OAAO,MAAO,IAAI,IAAI,KAAK,KAAK,IAAI,KAAM;AAAA,MACpD;AAAA,EACJ;AACF,GApBa;;;ACRb,IAAM,QAAQ,oBAAI,QAAQ;AAEnB,IAAM,UAAU,wBAA4C,OAAa;AAC9E,QAAM,WAAW,mCAA4B,MAAiB;AAC5D,UAAM,OAAO,QAAQ,CAAC,UAAU,MAAM,GAAG,IAAI,CAAC;AAC9C,QAAI,CAAC,MAAM,IAAI,IAAI,GAAG;AACpB,YAAM,IAAI,MAAM,GAAG,MAAM,MAAM,IAAI,CAAC;AAAA,IACtC;AACA,WAAO,MAAM,IAAI,IAAI;AAAA,EACvB,GANiB;AAQjB,MAAI,GAAG,MAAM;AACX,WAAO,eAAe,UAAU,QAAQ,EAAE,OAAO,GAAG,MAAM,UAAU,MAAM,CAAC;AAAA,EAC7E;AACA,SAAO;AACT,GAbuB;",
-  "names": ["symbol", "Tuple"]
-}