@graphrefly/ts 0.0.1 → 0.0.2

package/dist/chunk-6E76H4OU.js

@@ -0,0 +1,132 @@
+import {
+  depLatest
+} from "./chunk-WQIA3GFB.js";
+
+// src/graph/policies/collection.ts
+var PolicyInputs = class {
+  deps;
+  constructor(initial = []) {
+    this.deps = [...initial];
+  }
+  add(node) {
+    if (node === void 0) return missingPolicyReader();
+    const index = this.deps.push(node) - 1;
+    return policyReader(index);
+  }
+};
+function missingPolicyReader() {
+  return {
+    index: -1,
+    read: (_ctx, current) => current
+  };
+}
+function policyReader(index) {
+  return {
+    index,
+    read(ctx, current) {
+      const latest = depLatest(ctx, index);
+      return latest === void 0 ? current : latest;
+    }
+  };
+}
+function lruKeys(keys) {
+  return {
+    keys: () => keys
+  };
+}
+function trimHeadOverflow(items, config) {
+  const { maxSize } = config;
+  if (maxSize === void 0) return [];
+  if (!Number.isInteger(maxSize) || maxSize < 1)
+    throw new RangeError(`maxSize must be a positive integer (got ${maxSize})`);
+  const size = "size" in config ? config.size : Array.isArray(items) ? items.length : void 0;
+  if (size === void 0) throw new Error("trimHeadOverflow requires size for non-array iterables");
+  const overflow = size - maxSize;
+  if (overflow <= 0) return [];
+  if (Array.isArray(items) && !("size" in config)) return items.splice(0, overflow);
+  const victims = [];
+  for (const item of items) {
+    victims.push(item);
+    if (victims.length === overflow) break;
+  }
+  return victims;
+}
+function deadlines() {
+  return new MinDeadlineHeap();
+}
+var MinDeadlineHeap = class {
+  items = [];
+  get size() {
+    return this.items.length;
+  }
+  push(item) {
+    this.items.push(item);
+    this.up(this.items.length - 1);
+  }
+  peek() {
+    return this.items[0];
+  }
+  pop() {
+    const top = this.items[0];
+    const last = this.items.pop();
+    if (top !== void 0 && last !== void 0 && this.items.length > 0) {
+      this.items[0] = last;
+      this.down(0);
+    }
+    return top;
+  }
+  up(i) {
+    while (i > 0) {
+      const p = i - 1 >> 1;
+      if (this.items[p].expiresAt <= this.items[i].expiresAt)
+        return;
+      [this.items[p], this.items[i]] = [
+        this.items[i],
+        this.items[p]
+      ];
+      i = p;
+    }
+  }
+  down(i) {
+    for (; ; ) {
+      const left = i * 2 + 1;
+      const right = left + 1;
+      let smallest = i;
+      if (left < this.items.length && this.expiresAt(left) < this.expiresAt(smallest))
+        smallest = left;
+      if (right < this.items.length && this.expiresAt(right) < this.expiresAt(smallest))
+        smallest = right;
+      if (smallest === i) return;
+      [this.items[i], this.items[smallest]] = [
+        this.items[smallest],
+        this.items[i]
+      ];
+      i = smallest;
+    }
+  }
+  expiresAt(i) {
+    return this.items[i].expiresAt;
+  }
+};
+function selectRetentionVictims(scoredEntries, config) {
+  const { maxSize } = config;
+  if (maxSize === void 0) return [];
+  if (!Number.isInteger(maxSize) || maxSize < 0)
+    throw new RangeError(`retention maxSize must be a non-negative integer (got ${maxSize})`);
+  const overflow = scoredEntries.length - maxSize;
+  if (overflow <= 0) return [];
+  return scoredEntries.map((item, index) => {
+    if (!Number.isFinite(item.score))
+      throw new RangeError(`retention score must be finite (got ${item.score})`);
+    return { ...item, index };
+  }).sort((a, b) => a.score - b.score || a.index - b.index).slice(0, overflow).map((item) => item.entry);
+}
+
+export {
+  PolicyInputs,
+  lruKeys,
+  trimHeadOverflow,
+  deadlines,
+  selectRetentionVictims
+};
+//# sourceMappingURL=chunk-6E76H4OU.js.map

package/dist/chunk-6E76H4OU.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/graph/policies/collection.ts"],"sourcesContent":["/**\n * Internal graph-layer policy helpers (D70).\n *\n * This module is deliberately NOT exported from the package index. It centralizes policy plumbing\n * shared by collection structures while each structure still owns backend mutation + delta emission\n * in its apply/mutation path (D60/D61/D68/D69).\n */\n\nimport { type Ctx, depLatest } from \"../../ctx/types.js\";\nimport type { Node } from \"../../node/node.js\";\n\nexport type PolicyOpt<T> = T | Node<T>;\n\nexport interface PolicyReader<T> {\n\treadonly index: number;\n\tread(ctx: Ctx, current: T | undefined): T | undefined;\n}\n\nexport class PolicyInputs {\n\treadonly deps: Node<unknown>[];\n\n\tconstructor(initial: readonly Node<unknown>[] = []) {\n\t\tthis.deps = [...initial];\n\t}\n\n\tadd<T>(node: Node<T> | undefined): PolicyReader<T> {\n\t\tif (node === undefined) return missingPolicyReader<T>();\n\t\tconst index = this.deps.push(node as Node<unknown>) - 1;\n\t\treturn policyReader<T>(index);\n\t}\n}\n\nfunction missingPolicyReader<T>(): PolicyReader<T> {\n\treturn {\n\t\tindex: -1,\n\t\tread: (_ctx, current) => current,\n\t};\n}\n\nfunction policyReader<T>(index: number): PolicyReader<T> {\n\treturn {\n\t\tindex,\n\t\tread(ctx, current) {\n\t\t\tconst latest = depLatest(ctx, index);\n\t\t\treturn latest === undefined ? current : (latest as T);\n\t\t},\n\t};\n}\n\nexport interface KeyOrderPolicy<K> {\n\tkeys(): Iterable<K>;\n}\n\nexport function lruKeys<K>(keys: Iterable<K>): KeyOrderPolicy<K> {\n\treturn {\n\t\tkeys: () => keys,\n\t};\n}\n\nexport interface CapacityConfig {\n\treadonly maxSize?: number;\n}\n\nexport interface SizedCapacityConfig extends CapacityConfig {\n\treadonly size: number;\n}\n\nexport function trimHeadOverflow<T>(items: T[], config: CapacityConfig): T[];\nexport function trimHeadOverflow<T>(items: Iterable<T>, config: SizedCapacityConfig): T[];\nexport function trimHeadOverflow<T>(\n\titems: T[] | Iterable<T>,\n\tconfig: CapacityConfig | SizedCapacityConfig,\n): T[] {\n\tconst { maxSize } = config;\n\tif (maxSize === undefined) return [];\n\tif (!Number.isInteger(maxSize) || maxSize < 1)\n\t\tthrow new RangeError(`maxSize must be a positive integer (got ${maxSize})`);\n\n\tconst size = \"size\" in config ? config.size : Array.isArray(items) ? items.length : undefined;\n\tif (size === undefined) throw new Error(\"trimHeadOverflow requires size for non-array iterables\");\n\tconst overflow = size - maxSize;\n\tif (overflow <= 0) return [];\n\n\tif (Array.isArray(items) && !(\"size\" in config)) return items.splice(0, overflow);\n\n\tconst victims: T[] = [];\n\tfor (const item of items) {\n\t\tvictims.push(item);\n\t\tif (victims.length === overflow) break;\n\t}\n\treturn victims;\n}\n\nexport interface DeadlineEntry<K> {\n\treadonly key: K;\n\treadonly expiresAt: number;\n}\n\nexport interface DeadlinePolicy<K> {\n\treadonly size: number;\n\tpush(item: DeadlineEntry<K>): void;\n\tpeek(): DeadlineEntry<K> | undefined;\n\tpop(): DeadlineEntry<K> | undefined;\n}\n\nexport function deadlines<K>(): DeadlinePolicy<K> {\n\treturn new MinDeadlineHeap<K>();\n}\n\nclass MinDeadlineHeap<K> implements DeadlinePolicy<K> {\n\tprivate readonly items: DeadlineEntry<K>[] = [];\n\n\tget size(): number {\n\t\treturn this.items.length;\n\t}\n\n\tpush(item: DeadlineEntry<K>): void {\n\t\tthis.items.push(item);\n\t\tthis.up(this.items.length - 1);\n\t}\n\n\tpeek(): DeadlineEntry<K> | undefined {\n\t\treturn this.items[0];\n\t}\n\n\tpop(): DeadlineEntry<K> | undefined {\n\t\tconst top = this.items[0];\n\t\tconst last = this.items.pop();\n\t\tif (top !== undefined && last !== undefined && this.items.length > 0) {\n\t\t\tthis.items[0] = last;\n\t\t\tthis.down(0);\n\t\t}\n\t\treturn top;\n\t}\n\n\tprivate up(i: number): void {\n\t\twhile (i > 0) {\n\t\t\tconst p = (i - 1) >> 1;\n\t\t\tif (\n\t\t\t\t(this.items[p] as DeadlineEntry<K>).expiresAt <=\n\t\t\t\t(this.items[i] as DeadlineEntry<K>).expiresAt\n\t\t\t)\n\t\t\t\treturn;\n\t\t\t[this.items[p], this.items[i]] = [\n\t\t\t\tthis.items[i] as DeadlineEntry<K>,\n\t\t\t\tthis.items[p] as DeadlineEntry<K>,\n\t\t\t];\n\t\t\ti = p;\n\t\t}\n\t}\n\n\tprivate down(i: number): void {\n\t\tfor (;;) {\n\t\t\tconst left = i * 2 + 1;\n\t\t\tconst right = left + 1;\n\t\t\tlet smallest = i;\n\t\t\tif (left < this.items.length && this.expiresAt(left) < this.expiresAt(smallest))\n\t\t\t\tsmallest = left;\n\t\t\tif (right < this.items.length && this.expiresAt(right) < this.expiresAt(smallest))\n\t\t\t\tsmallest = right;\n\t\t\tif (smallest === i) return;\n\t\t\t[this.items[i], this.items[smallest]] = [\n\t\t\t\tthis.items[smallest] as DeadlineEntry<K>,\n\t\t\t\tthis.items[i] as DeadlineEntry<K>,\n\t\t\t];\n\t\t\ti = smallest;\n\t\t}\n\t}\n\n\tprivate expiresAt(i: number): number {\n\t\treturn (this.items[i] as DeadlineEntry<K>).expiresAt;\n\t}\n}\n\nexport interface ScoredEntry<T> {\n\treadonly entry: T;\n\treadonly score: number;\n}\n\nexport interface RetentionSelectionConfig {\n\treadonly maxSize?: number;\n}\n\nexport function selectRetentionVictims<T>(\n\tscoredEntries: readonly ScoredEntry<T>[],\n\tconfig: RetentionSelectionConfig,\n): T[] {\n\tconst { maxSize } = config;\n\tif (maxSize === undefined) return [];\n\tif (!Number.isInteger(maxSize) || maxSize < 0)\n\t\tthrow new RangeError(`retention maxSize must be a non-negative integer (got ${maxSize})`);\n\tconst overflow = scoredEntries.length - maxSize;\n\tif (overflow <= 0) return [];\n\n\treturn scoredEntries\n\t\t.map((item, index) => {\n\t\t\tif (!Number.isFinite(item.score))\n\t\t\t\tthrow new RangeError(`retention score must be finite (got ${item.score})`);\n\t\t\treturn { ...item, index };\n\t\t})\n\t\t.sort((a, b) => a.score - b.score || a.index - b.index)\n\t\t.slice(0, overflow)\n\t\t.map((item) => item.entry);\n}\n"],"mappings":";;;;;AAkBO,IAAM,eAAN,MAAmB;AAAA,EAChB;AAAA,EAET,YAAY,UAAoC,CAAC,GAAG;AACnD,SAAK,OAAO,CAAC,GAAG,OAAO;AAAA,EACxB;AAAA,EAEA,IAAO,MAA4C;AAClD,QAAI,SAAS,OAAW,QAAO,oBAAuB;AACtD,UAAM,QAAQ,KAAK,KAAK,KAAK,IAAqB,IAAI;AACtD,WAAO,aAAgB,KAAK;AAAA,EAC7B;AACD;AAEA,SAAS,sBAA0C;AAClD,SAAO;AAAA,IACN,OAAO;AAAA,IACP,MAAM,CAAC,MAAM,YAAY;AAAA,EAC1B;AACD;AAEA,SAAS,aAAgB,OAAgC;AACxD,SAAO;AAAA,IACN;AAAA,IACA,KAAK,KAAK,SAAS;AAClB,YAAM,SAAS,UAAU,KAAK,KAAK;AACnC,aAAO,WAAW,SAAY,UAAW;AAAA,IAC1C;AAAA,EACD;AACD;AAMO,SAAS,QAAW,MAAsC;AAChE,SAAO;AAAA,IACN,MAAM,MAAM;AAAA,EACb;AACD;AAYO,SAAS,iBACf,OACA,QACM;AACN,QAAM,EAAE,QAAQ,IAAI;AACpB,MAAI,YAAY,OAAW,QAAO,CAAC;AACnC,MAAI,CAAC,OAAO,UAAU,OAAO,KAAK,UAAU;AAC3C,UAAM,IAAI,WAAW,2CAA2C,OAAO,GAAG;AAE3E,QAAM,OAAO,UAAU,SAAS,OAAO,OAAO,MAAM,QAAQ,KAAK,IAAI,MAAM,SAAS;AACpF,MAAI,SAAS,OAAW,OAAM,IAAI,MAAM,wDAAwD;AAChG,QAAM,WAAW,OAAO;AACxB,MAAI,YAAY,EAAG,QAAO,CAAC;AAE3B,MAAI,MAAM,QAAQ,KAAK,KAAK,EAAE,UAAU,QAAS,QAAO,MAAM,OAAO,GAAG,QAAQ;AAEhF,QAAM,UAAe,CAAC;AACtB,aAAW,QAAQ,OAAO;AACzB,YAAQ,KAAK,IAAI;AACjB,QAAI,QAAQ,WAAW,SAAU;AAAA,EAClC;AACA,SAAO;AACR;AAcO,SAAS,YAAkC;AACjD,SAAO,IAAI,gBAAmB;AAC/B;AAEA,IAAM,kBAAN,MAAsD;AAAA,EACpC,QAA4B,CAAC;AAAA,EAE9C,IAAI,OAAe;AAClB,WAAO,KAAK,MAAM;AAAA,EACnB;AAAA,EAEA,KAAK,MAA8B;AAClC,SAAK,MAAM,KAAK,IAAI;AACpB,SAAK,GAAG,KAAK,MAAM,SAAS,CAAC;AAAA,EAC9B;AAAA,EAEA,OAAqC;AACpC,WAAO,KAAK,MAAM,CAAC;AAAA,EACpB;AAAA,EAEA,MAAoC;AACnC,UAAM,MAAM,KAAK,MAAM,CAAC;AACxB,UAAM,OAAO,KAAK,MAAM,IAAI;AAC5B,QAAI,QAAQ,UAAa,SAAS,UAAa,KAAK,MAAM,SAAS,GAAG;AACrE,WAAK,MAAM,CAAC,IAAI;AAChB,WAAK,KAAK,CAAC;AAAA,IACZ;AACA,WAAO;AAAA,EACR;AAAA,EAEQ,GAAG,GAAiB;AAC3B,WAAO,IAAI,GAAG;AACb,YAAM,IAAK,IAAI,KAAM;AACrB,UACE,KAAK,MAAM,CAAC,EAAuB,aACnC,KAAK,MAAM,CAAC,EAAuB;AAEpC;AACD,OAAC,KAAK,MAAM,CAAC,GAAG,KAAK,MAAM,CAAC,CAAC,IAAI;AAAA,QAChC,KAAK,MAAM,CAAC;AAAA,QACZ,KAAK,MAAM,CAAC;AAAA,MACb;AACA,UAAI;AAAA,IACL;AAAA,EACD;AAAA,EAEQ,KAAK,GAAiB;AAC7B,eAAS;AACR,YAAM,OAAO,IAAI,IAAI;AACrB,YAAM,QAAQ,OAAO;AACrB,UAAI,WAAW;AACf,UAAI,OAAO,KAAK,MAAM,UAAU,KAAK,UAAU,IAAI,IAAI,KAAK,UAAU,QAAQ;AAC7E,mBAAW;AACZ,UAAI,QAAQ,KAAK,MAAM,UAAU,KAAK,UAAU,KAAK,IAAI,KAAK,UAAU,QAAQ;AAC/E,mBAAW;AACZ,UAAI,aAAa,EAAG;AACpB,OAAC,KAAK,MAAM,CAAC,GAAG,KAAK,MAAM,QAAQ,CAAC,IAAI;AAAA,QACvC,KAAK,MAAM,QAAQ;AAAA,QACnB,KAAK,MAAM,CAAC;AAAA,MACb;AACA,UAAI;AAAA,IACL;AAAA,EACD;AAAA,EAEQ,UAAU,GAAmB;AACpC,WAAQ,KAAK,MAAM,CAAC,EAAuB;AAAA,EAC5C;AACD;AAWO,SAAS,uBACf,eACA,QACM;AACN,QAAM,EAAE,QAAQ,IAAI;AACpB,MAAI,YAAY,OAAW,QAAO,CAAC;AACnC,MAAI,CAAC,OAAO,UAAU,OAAO,KAAK,UAAU;AAC3C,UAAM,IAAI,WAAW,yDAAyD,OAAO,GAAG;AACzF,QAAM,WAAW,cAAc,SAAS;AACxC,MAAI,YAAY,EAAG,QAAO,CAAC;AAE3B,SAAO,cACL,IAAI,CAAC,MAAM,UAAU;AACrB,QAAI,CAAC,OAAO,SAAS,KAAK,KAAK;AAC9B,YAAM,IAAI,WAAW,uCAAuC,KAAK,KAAK,GAAG;AAC1E,WAAO,EAAE,GAAG,MAAM,MAAM;AAAA,EACzB,CAAC,EACA,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,KAAK,EACrD,MAAM,GAAG,QAAQ,EACjB,IAAI,CAAC,SAAS,KAAK,KAAK;AAC3B;","names":[]}