@milaboratories/pl-tree 1.12.13 → 1.12.15

package/dist/synchronized_tree.cjs

@@ -5,13 +5,39 @@ const require_sync = require("./sync.cjs");
 let _milaboratories_pl_client = require("@milaboratories/pl-client");
 let _milaboratories_computable = require("@milaboratories/computable");
 let node_timers_promises = require("node:timers/promises");
-node_timers_promises = require_runtime.__toESM(node_timers_promises);
+node_timers_promises = require_runtime.__toESM(node_timers_promises, 1);
 //#region src/synchronized_tree.ts
 /** Hard floor between consecutive tree-refresh calls.
 * Applies even when {@link scheduleOnNextState} has woken the loop early,
 * preventing tight polling loops during rapid state transitions. */
 const MIN_POLLING_INTERVAL_MS = 100;
+/** Normalizes the {@link SynchronizedTreeState.init} seed argument — a bare
+* {@link SignedResourceId}, a single {@link TreeSeed}, or an array — to `TreeSeed[]`, so
+* every existing single-root caller is unchanged. */
+function normalizeSeeds(seeds) {
+	if (Array.isArray(seeds)) return seeds;
+	if (typeof seeds === "object" && seeds !== null && "kind" in seeds) return [seeds];
+	return [{
+		kind: "resource",
+		root: seeds
+	}];
+}
+/** How often, in main-loop iterations, a tree with shared-type seeds re-polls
+* ListUserResources to reconcile its discovered roots. 1 would mean every iteration.
+*
+* Discovery (a full ListUserResources stream) is far heavier than an ordinary incremental
+* refresh, so it must NOT run on every fast refresh tick. The refresh cadence is the tree's
+* `pollingInterval` floored by {@link MIN_POLLING_INTERVAL_MS} (~200ms-1s in practice — the
+* shared-seed discovery tree runs at the 200ms default). At N = 15 discovery fires roughly
+* every 15 × 200ms ≈ 3s, decoupling it from the fast refresh loop while keeping the latency
+* of noticing a new/removed share to a few seconds — acceptable for a human-driven share flow.
+*
+* Only trees with shared-type seeds gate on this; {@link discover} is a no-op for single-root
+* and explicit-seed trees (empty `sharedSeeds`), so the value never affects them. */
+const DISCOVERY_EVERY_N_REFRESHES = 15;
 var SynchronizedTreeState = class SynchronizedTreeState {
+	pl;
+	logger;
 	finalPredicate;
 	state;
 	pollingInterval;
@@ -22,9 +48,14 @@ var SynchronizedTreeState = class SynchronizedTreeState {
 	logStat;
 	hooks;
 	abortController = new AbortController();
-	constructor(pl, root, ops, logger) {
+	/** Explicit-resource seeds: fixed roots, present from construction. */
+	explicitRoots;
+	/** Shared-type seeds (discovered roots), if any. */
+	sharedSeeds;
+	/** Roots discovered for shared-type seeds on the last discovery poll. */
+	discoveredRoots = [];
+	constructor(pl, seeds, ops, logger) {
 		this.pl = pl;
-		this.root = root;
 		this.logger = logger;
 		const { finalPredicateOverride, pruning, fieldFilter, traverseStopRules, traversalMode, pollingInterval, stopPollingDelay, logStat } = ops;
 		this.pruning = pruning;
@@ -34,20 +65,45 @@ var SynchronizedTreeState = class SynchronizedTreeState {
 		this.pollingInterval = pollingInterval;
 		this.finalPredicate = finalPredicateOverride ?? pl.finalPredicate;
 		this.logStat = logStat;
-		this.state = new require_state.PlTreeState(root, this.finalPredicate);
+		this.explicitRoots = seeds.filter((s) => s.kind === "resource").map((s) => s.root);
+		this.sharedSeeds = seeds.filter((s) => s.kind === "shared");
+		this.state = new require_state.PlTreeState(this.currentRootSet(), this.finalPredicate);
 		this.hooks = new _milaboratories_computable.PollingComputableHooks(() => this.startUpdating(), () => this.stopUpdating(), { stopDebounce: stopPollingDelay }, (resolve, reject) => this.scheduleOnNextState(resolve, reject));
 	}
+	/** The current protected root set: explicit roots plus the latest discovered roots. */
+	currentRootSet() {
+		return /* @__PURE__ */ new Set([...this.explicitRoots, ...this.discoveredRoots]);
+	}
+	/** Resolves the single root for the backward-compatible single-root accessors, throwing
+	* if the tree does not have exactly one root (guards legacy callers against multi-root). */
+	soleRoot() {
+		const roots = this.currentRootSet();
+		if (roots.size !== 1) throw new Error(`single-root accessor used on a tree with ${roots.size} roots; use rootsEntry() instead`);
+		return roots.values().next().value;
+	}
 	/** @deprecated use "entry" instead */
-	accessor(rid = this.root) {
+	accessor(rid) {
 		if (this.terminated) throw new Error("tree synchronization is terminated");
 		return this.entry(rid);
 	}
-	entry(rid = this.root) {
+	/** Backward-compatible single-root entry. With no `rid` it returns the sole root's entry
+	* and THROWS if the tree has zero or more than one root. An explicit `rid` addresses any
+	* resource in the heap, as today. */
+	entry(rid) {
 		if (this.terminated) throw new Error("tree synchronization is terminated");
 		return new require_accessors.PlTreeEntry({
 			treeProvider: () => this.state,
 			hooks: this.hooks
-		}, rid);
+		}, rid ?? this.soleRoot());
+	}
+	/** Reactive provider for the current root SET. Reading it inside a Computable tracks the
+	* set as a dependency, so the Computable recomputes when discovered roots appear/disappear. */
+	rootsEntry() {
+		if (this.terminated) throw new Error("tree synchronization is terminated");
+		return new require_accessors.PlTreeRootsEntry({
+			treeProvider: () => this.state,
+			hooks: this.hooks
+		});
 	}
 	/** Can be used to externally kick off the synchronization polling loop, and
 	* await for the first synchronization to happen. */
@@ -88,21 +144,51 @@ var SynchronizedTreeState = class SynchronizedTreeState {
 	/** Executed from the main loop, and initialization procedure. */
 	async refresh(stats, txOps) {
 		if (this.terminated) throw new Error("tree synchronization is terminated");
+		try {
+			await this.loadAndApply(stats, txOps);
+		} catch (e) {
+			if (this.sharedSeeds.length > 0 && (0, _milaboratories_pl_client.isUnauthenticated)(e)) {
+				this.logger?.warn("discovery tree: Unauthenticated on ResourceTree (likely revoked/expired root); re-discovering and retrying");
+				await this.discover();
+				await this.loadAndApply(stats, txOps);
+			} else throw e;
+		}
+	}
+	async loadAndApply(stats, txOps) {
 		const request = require_sync.constructTreeLoadingRequest(this.state, {
 			pruningFunction: this.pruning,
 			fieldFilter: this.fieldFilter,
 			traverseStopRules: this.traverseStopRules
 		});
+		if (request.seedResources.length === 0 && request.finalResources.size === 0) return;
 		const data = await this.pl.withReadTx("ReadingTree", async (tx) => {
 			return await require_sync.loadTreeState(tx, request, stats, this.pl.serverInfo.capabilities ?? [], this.traversalMode, this.logger);
 		}, txOps);
 		this.state.updateFromResourceData(data, true);
 	}
+	/** Discovery sync for shared-type seeds: re-polls `ListUserResources` (gRPC-only) and
+	* reconciles the discovered root set against the heap. A longer poll result adds roots; a
+	* shorter one removes them (grant revoked/expired) — the removed roots' subtrees cascade
+	* to collection via the ordinary refcount GC ({@link PlTreeState.setRoots}). No-op when the
+	* tree has no shared-type seeds, or silently no-op on a REST client where `ListUserResources`
+	* is unavailable. */
+	async discover() {
+		if (this.terminated) throw new Error("tree synchronization is terminated");
+		if (this.sharedSeeds.length === 0) return;
+		const discovered = /* @__PURE__ */ new Set();
+		for (const seed of this.sharedSeeds) {
+			const ids = await this.pl.userResources.listSharedResourcesByType(seed.resourceType.name);
+			for (const id of ids) discovered.add(id);
+		}
+		this.discoveredRoots = [...discovered];
+		this.state.setRoots(this.currentRootSet());
+	}
 	/** If true this tree state is permanently terminaed. */
 	terminated = false;
 	async mainLoop() {
 		let stat = this.logStat ? require_sync.initialTreeLoadingStat() : void 0;
 		let lastUpdate = Date.now();
+		let iteration = 0;
 		while (true) {
 			if (!this.keepRunning || this.terminated) break;
 			let toNotify = void 0;
@@ -112,6 +198,8 @@ var SynchronizedTreeState = class SynchronizedTreeState {
 			}
 			try {
 				if (this.logStat === "per-request") stat = require_sync.initialTreeLoadingStat();
+				if (this.sharedSeeds.length > 0 && iteration % DISCOVERY_EVERY_N_REFRESHES === 0) await this.discover();
+				iteration++;
 				await this.refresh(stat);
 				if (stat && this.logger) this.logger.info(`Tree stat (success, after ${Date.now() - lastUpdate}ms): ${JSON.stringify(stat)}`);
 				lastUpdate = Date.now();
@@ -123,7 +211,7 @@ var SynchronizedTreeState = class SynchronizedTreeState {
 				if (e instanceof require_state.TreeStateUpdateError) {
 					this.logger?.error(e);
 					this.state.invalidateTree("stat update error");
-					this.state = new require_state.PlTreeState(this.root, this.finalPredicate);
+					this.state = new require_state.PlTreeState(this.currentRootSet(), this.finalPredicate);
 					continue;
 				} else this.logger?.warn(e);
 			}
@@ -174,11 +262,19 @@ var SynchronizedTreeState = class SynchronizedTreeState {
 		if (this.currentLoop === void 0) return;
 		await this.currentLoop;
 	}
-	static async init(pl, root, ops, logger) {
-		const tree = new SynchronizedTreeState(pl, root, ops, logger);
+	/**
+	* Initializes a synchronized tree from one or more seeds.
+	*
+	* @param seeds a bare {@link SignedResourceId} (the original single-root contract), a
+	*   single {@link TreeSeed}, or an array of seeds. Bare ids and explicit-resource seeds
+	*   become roots immediately; shared-type seeds discover their roots via `ListUserResources`.
+	*/
+	static async init(pl, seeds, ops, logger) {
+		const tree = new SynchronizedTreeState(pl, normalizeSeeds(seeds), ops, logger);
 		const stat = ops.logStat ? require_sync.initialTreeLoadingStat() : void 0;
 		let ok = false;
 		try {
+			await tree.discover();
 			await tree.refresh(stat, { timeout: ops.initialTreeLoadingTimeout });
 			ok = true;
 		} finally {

package/dist/synchronized_tree.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"synchronized_tree.cjs","names":["PlTreeState","PollingComputableHooks","PlTreeEntry","constructTreeLoadingRequest","loadTreeState","initialTreeLoadingStat","TreeStateUpdateError","tp"],"sources":["../src/synchronized_tree.ts"],"sourcesContent":["import { PollingComputableHooks } from \"@milaboratories/computable\";\nimport { PlTreeEntry } from \"./accessors\";\nimport type {\n  FinalResourceDataPredicate,\n  PlClient,\n  SignedResourceId,\n  TxOps,\n} from \"@milaboratories/pl-client\";\nimport type { Filter } from \"@milaboratories/pl-client\";\nimport { isTimeoutOrCancelError } from \"@milaboratories/pl-client\";\nimport type { ExtendedResourceData } from \"./state\";\nimport { PlTreeState, TreeStateUpdateError } from \"./state\";\nimport type { PruningFunction, TraversalMode, TreeLoadingStat } from \"./sync\";\nimport { constructTreeLoadingRequest, initialTreeLoadingStat, loadTreeState } from \"./sync\";\nimport * as tp from \"node:timers/promises\";\n\n/** Hard floor between consecutive tree-refresh calls.\n * Applies even when {@link scheduleOnNextState} has woken the loop early,\n * preventing tight polling loops during rapid state transitions. */\nconst MIN_POLLING_INTERVAL_MS = 100;\nimport type { MiLogger } from \"@milaboratories/ts-helpers\";\n\ntype StatLoggingMode = \"cumulative\" | \"per-request\";\n\nexport type SynchronizedTreeOps = {\n  /** Override final predicate from the PlClient */\n  finalPredicateOverride?: FinalResourceDataPredicate;\n\n  /** Pruning function for legacy fallback path. */\n  pruning?: PruningFunction;\n\n  /** ResourceTree field filter for modern backend path. */\n  fieldFilter?: Filter;\n\n  /** ResourceTree traversal stop rules for modern backend path. */\n  traverseStopRules?: Filter;\n\n  /** Interval after last sync to sleep before the next one */\n  pollingInterval: number;\n  /** For how long to continue polling after the last derived value access */\n  stopPollingDelay: number;\n\n  /** If one of the values, tree will log stats of each polling request */\n  logStat?: StatLoggingMode;\n\n  /** Timeout for initial tree loading. If not specified, will use default for RO tx from pl-client. */\n  initialTreeLoadingTimeout?: number;\n\n  /** Controls which tree-loading path to use.  Default `\"auto\"`. */\n  traversalMode?: TraversalMode;\n};\n\ntype ScheduledRefresh = {\n  resolve: () => void;\n  reject: (err: any) => void;\n};\n\nexport class SynchronizedTreeState {\n  private readonly finalPredicate: FinalResourceDataPredicate;\n  private state: PlTreeState;\n  private readonly pollingInterval: number;\n  private readonly pruning?: PruningFunction;\n  private readonly fieldFilter?: Filter;\n  private readonly traverseStopRules?: Filter;\n  private readonly traversalMode: TraversalMode;\n  private readonly logStat?: StatLoggingMode;\n  private readonly hooks: PollingComputableHooks;\n  private readonly abortController = new AbortController();\n\n  private constructor(\n    private readonly pl: PlClient,\n    private readonly root: SignedResourceId,\n    ops: SynchronizedTreeOps,\n    private readonly logger?: MiLogger,\n  ) {\n    const {\n      finalPredicateOverride,\n      pruning,\n      fieldFilter,\n      traverseStopRules,\n      traversalMode,\n      pollingInterval,\n      stopPollingDelay,\n      logStat,\n    } = ops;\n    this.pruning = pruning;\n    this.fieldFilter = fieldFilter;\n    this.traverseStopRules = traverseStopRules;\n    this.traversalMode = traversalMode ?? \"auto\";\n    this.pollingInterval = pollingInterval;\n    this.finalPredicate = finalPredicateOverride ?? pl.finalPredicate;\n    this.logStat = logStat;\n    this.state = new PlTreeState(root, this.finalPredicate);\n    this.hooks = new PollingComputableHooks(\n      () => this.startUpdating(),\n      () => this.stopUpdating(),\n      { stopDebounce: stopPollingDelay },\n      (resolve, reject) => this.scheduleOnNextState(resolve, reject),\n    );\n  }\n\n  /** @deprecated use \"entry\" instead */\n  public accessor(rid: SignedResourceId = this.root): PlTreeEntry {\n    if (this.terminated) throw new Error(\"tree synchronization is terminated\");\n    return this.entry(rid);\n  }\n\n  public entry(rid: SignedResourceId = this.root): PlTreeEntry {\n    if (this.terminated) throw new Error(\"tree synchronization is terminated\");\n    return new PlTreeEntry({ treeProvider: () => this.state, hooks: this.hooks }, rid);\n  }\n\n  /** Can be used to externally kick off the synchronization polling loop, and\n   * await for the first synchronization to happen. */\n  public async refreshState(): Promise<void> {\n    if (this.terminated) throw new Error(\"tree synchronization is terminated\");\n    await this.hooks.refreshState();\n  }\n\n  private currentLoopDelayInterrupt: AbortController | undefined = undefined;\n  private scheduledOnNextState: ScheduledRefresh[] = [];\n\n  /** Called from computable hooks when external observer asks for state refresh */\n  private scheduleOnNextState(resolve: () => void, reject: (err: any) => void): void {\n    if (this.terminated) reject(new Error(\"tree synchronization is terminated\"));\n    else {\n      this.scheduledOnNextState.push({ resolve, reject });\n      if (this.currentLoopDelayInterrupt) {\n        this.currentLoopDelayInterrupt.abort();\n        this.currentLoopDelayInterrupt = undefined;\n      }\n    }\n  }\n\n  /** Called from observer */\n  private startUpdating(): void {\n    if (this.terminated) return;\n    this.keepRunning = true;\n    if (this.currentLoop === undefined) this.currentLoop = this.mainLoop();\n  }\n\n  /** Called from observer */\n  private stopUpdating(): void {\n    this.keepRunning = false;\n  }\n\n  /** If true, main loop will continue polling pl state. */\n  private keepRunning = false;\n  /** Actual state of main loop. */\n  private currentLoop: Promise<void> | undefined = undefined;\n\n  /** Executed from the main loop, and initialization procedure. */\n  private async refresh(stats?: TreeLoadingStat, txOps?: TxOps): Promise<void> {\n    if (this.terminated) throw new Error(\"tree synchronization is terminated\");\n    const request = constructTreeLoadingRequest(this.state, {\n      pruningFunction: this.pruning,\n      fieldFilter: this.fieldFilter,\n      traverseStopRules: this.traverseStopRules,\n    });\n    const data = await this.pl.withReadTx(\n      \"ReadingTree\",\n      async (tx) => {\n        return await loadTreeState(\n          tx,\n          request,\n          stats,\n          this.pl.serverInfo.capabilities ?? [],\n          this.traversalMode,\n          this.logger,\n        );\n      },\n      txOps,\n    );\n    this.state.updateFromResourceData(data, true);\n  }\n\n  /** If true this tree state is permanently terminaed. */\n  private terminated = false;\n\n  private async mainLoop() {\n    // will hold request stats\n    let stat = this.logStat ? initialTreeLoadingStat() : undefined;\n\n    let lastUpdate = Date.now();\n\n    while (true) {\n      if (!this.keepRunning || this.terminated) break;\n\n      // saving those who want to be notified about new state here\n      // because those who will be added during the tree retrieval\n      // should be notified only on the next round\n      let toNotify: ScheduledRefresh[] | undefined = undefined;\n      if (this.scheduledOnNextState.length > 0) {\n        toNotify = this.scheduledOnNextState;\n        this.scheduledOnNextState = [];\n      }\n\n      try {\n        // resetting stats if we were asked to collect non-cumulative stats\n        if (this.logStat === \"per-request\") stat = initialTreeLoadingStat();\n\n        // actual tree synchronization\n        await this.refresh(stat);\n\n        // logging stats if we were asked to\n        if (stat && this.logger)\n          this.logger.info(\n            `Tree stat (success, after ${Date.now() - lastUpdate}ms): ${JSON.stringify(stat)}`,\n          );\n        lastUpdate = Date.now();\n\n        // notifying that we got new state\n        if (toNotify !== undefined) for (const n of toNotify) n.resolve();\n      } catch (e: any) {\n        // logging stats if we were asked to (even if error occured)\n        if (stat && this.logger)\n          this.logger.info(\n            `Tree stat (error, after ${Date.now() - lastUpdate}ms): ${JSON.stringify(stat)}`,\n          );\n        lastUpdate = Date.now();\n\n        // notifying that we failed to refresh the state\n        if (toNotify !== undefined) for (const n of toNotify) n.reject(e);\n\n        // catching tree update errors, as they may leave our tree in inconsistent state\n        if (e instanceof TreeStateUpdateError) {\n          // important error logging, this should never happen\n          this.logger?.error(e);\n\n          // marking everybody who used previous state as changed\n          this.state.invalidateTree(\"stat update error\");\n          // creating new tree\n          this.state = new PlTreeState(this.root, this.finalPredicate);\n\n          // scheduling state update without delay\n          continue;\n\n          // unfortunately external observer may still see tree in its default\n          // empty state, though this is best we can do in this exceptional\n          // situation, and hope on caching layers inside computables to present\n          // some stale state until we reconstruct the tree again\n        } else this.logger?.warn(e);\n      }\n\n      if (!this.keepRunning || this.terminated) break;\n\n      // Phase 1: mandatory floor — always wait at least MIN_POLLING_INTERVAL_MS.\n      // Not interruptible by scheduleOnNextState; only termination aborts it.\n      try {\n        await tp.setTimeout(MIN_POLLING_INTERVAL_MS, undefined, {\n          signal: this.abortController.signal,\n        });\n      } catch (e: unknown) {\n        if (!isTimeoutOrCancelError(e)) throw new Error(\"Unexpected error\", { cause: e });\n        if (this.abortController.signal.aborted) break;\n      }\n\n      if (!this.keepRunning || this.terminated) break;\n\n      // Phase 2: optional remainder up to pollingInterval — interruptible by\n      // scheduleOnNextState so that an external nudge wakes the loop promptly.\n      if (this.scheduledOnNextState.length === 0) {\n        const remaining = Math.max(0, this.pollingInterval - MIN_POLLING_INTERVAL_MS);\n        if (remaining > 0) {\n          try {\n            this.currentLoopDelayInterrupt = new AbortController();\n            await tp.setTimeout(remaining, undefined, {\n              signal: AbortSignal.any([\n                this.abortController.signal,\n                this.currentLoopDelayInterrupt.signal,\n              ]),\n            });\n          } catch (e: unknown) {\n            if (!isTimeoutOrCancelError(e)) throw new Error(\"Unexpected error\", { cause: e });\n            if (this.abortController.signal.aborted) break;\n            // Otherwise it was just the loop delay interrupt (scheduleOnNextState),\n            // continue to the next iteration\n          } finally {\n            this.currentLoopDelayInterrupt = undefined;\n          }\n        }\n      }\n    }\n\n    // reset only as a very last line\n    this.currentLoop = undefined;\n  }\n\n  /**\n   * Dumps the current state of the tree.\n   * @returns An array of ExtendedResourceData objects representing the current state of the tree.\n   */\n  public dumpState(): ExtendedResourceData[] {\n    return this.state.dumpState();\n  }\n\n  /**\n   * Terminates the internal loop, and permanently destoys all internal state, so\n   * all computables using this state will resolve to errors.\n   * */\n  public async terminate(): Promise<void> {\n    this.keepRunning = false;\n    this.terminated = true;\n    this.abortController.abort();\n\n    if (this.currentLoop === undefined) return;\n    await this.currentLoop;\n\n    this.state.invalidateTree(\"synchronization terminated for the tree\");\n  }\n\n  /** @deprecated */\n  public async awaitSyncLoopTermination(): Promise<void> {\n    if (this.currentLoop === undefined) return;\n    await this.currentLoop;\n  }\n\n  public static async init(\n    pl: PlClient,\n    root: SignedResourceId,\n    ops: SynchronizedTreeOps,\n    logger?: MiLogger,\n  ) {\n    const tree = new SynchronizedTreeState(pl, root, ops, logger);\n\n    const stat = ops.logStat ? initialTreeLoadingStat() : undefined;\n\n    let ok = false;\n\n    try {\n      await tree.refresh(stat, {\n        timeout: ops.initialTreeLoadingTimeout,\n      });\n      ok = true;\n    } finally {\n      // logging stats if we were asked to (even if error occured)\n      if (stat && logger)\n        logger.info(\n          `Tree stat (initial load, ${ok ? \"success\" : \"failure\"}): ${JSON.stringify(stat)}`,\n        );\n    }\n\n    return tree;\n  }\n}\n"],"mappings":";;;;;;;;;;;;AAmBA,MAAM,0BAA0B;AAsChC,IAAa,wBAAb,MAAa,sBAAsB;CACjC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA,kBAAmC,IAAI,iBAAiB;CAExD,YACE,IACA,MACA,KACA,QACA;AAJiB,OAAA,KAAA;AACA,OAAA,OAAA;AAEA,OAAA,SAAA;EAEjB,MAAM,EACJ,wBACA,SACA,aACA,mBACA,eACA,iBACA,kBACA,YACE;AACJ,OAAK,UAAU;AACf,OAAK,cAAc;AACnB,OAAK,oBAAoB;AACzB,OAAK,gBAAgB,iBAAiB;AACtC,OAAK,kBAAkB;AACvB,OAAK,iBAAiB,0BAA0B,GAAG;AACnD,OAAK,UAAU;AACf,OAAK,QAAQ,IAAIA,cAAAA,YAAY,MAAM,KAAK,eAAe;AACvD,OAAK,QAAQ,IAAIC,2BAAAA,6BACT,KAAK,eAAe,QACpB,KAAK,cAAc,EACzB,EAAE,cAAc,kBAAkB,GACjC,SAAS,WAAW,KAAK,oBAAoB,SAAS,OAAO,CAC/D;;;CAIH,SAAgB,MAAwB,KAAK,MAAmB;AAC9D,MAAI,KAAK,WAAY,OAAM,IAAI,MAAM,qCAAqC;AAC1E,SAAO,KAAK,MAAM,IAAI;;CAGxB,MAAa,MAAwB,KAAK,MAAmB;AAC3D,MAAI,KAAK,WAAY,OAAM,IAAI,MAAM,qCAAqC;AAC1E,SAAO,IAAIC,kBAAAA,YAAY;GAAE,oBAAoB,KAAK;GAAO,OAAO,KAAK;GAAO,EAAE,IAAI;;;;CAKpF,MAAa,eAA8B;AACzC,MAAI,KAAK,WAAY,OAAM,IAAI,MAAM,qCAAqC;AAC1E,QAAM,KAAK,MAAM,cAAc;;CAGjC,4BAAiE,KAAA;CACjE,uBAAmD,EAAE;;CAGrD,oBAA4B,SAAqB,QAAkC;AACjF,MAAI,KAAK,WAAY,wBAAO,IAAI,MAAM,qCAAqC,CAAC;OACvE;AACH,QAAK,qBAAqB,KAAK;IAAE;IAAS;IAAQ,CAAC;AACnD,OAAI,KAAK,2BAA2B;AAClC,SAAK,0BAA0B,OAAO;AACtC,SAAK,4BAA4B,KAAA;;;;;CAMvC,gBAA8B;AAC5B,MAAI,KAAK,WAAY;AACrB,OAAK,cAAc;AACnB,MAAI,KAAK,gBAAgB,KAAA,EAAW,MAAK,cAAc,KAAK,UAAU;;;CAIxE,eAA6B;AAC3B,OAAK,cAAc;;;CAIrB,cAAsB;;CAEtB,cAAiD,KAAA;;CAGjD,MAAc,QAAQ,OAAyB,OAA8B;AAC3E,MAAI,KAAK,WAAY,OAAM,IAAI,MAAM,qCAAqC;EAC1E,MAAM,UAAUC,aAAAA,4BAA4B,KAAK,OAAO;GACtD,iBAAiB,KAAK;GACtB,aAAa,KAAK;GAClB,mBAAmB,KAAK;GACzB,CAAC;EACF,MAAM,OAAO,MAAM,KAAK,GAAG,WACzB,eACA,OAAO,OAAO;AACZ,UAAO,MAAMC,aAAAA,cACX,IACA,SACA,OACA,KAAK,GAAG,WAAW,gBAAgB,EAAE,EACrC,KAAK,eACL,KAAK,OACN;KAEH,MACD;AACD,OAAK,MAAM,uBAAuB,MAAM,KAAK;;;CAI/C,aAAqB;CAErB,MAAc,WAAW;EAEvB,IAAI,OAAO,KAAK,UAAUC,aAAAA,wBAAwB,GAAG,KAAA;EAErD,IAAI,aAAa,KAAK,KAAK;AAE3B,SAAO,MAAM;AACX,OAAI,CAAC,KAAK,eAAe,KAAK,WAAY;GAK1C,IAAI,WAA2C,KAAA;AAC/C,OAAI,KAAK,qBAAqB,SAAS,GAAG;AACxC,eAAW,KAAK;AAChB,SAAK,uBAAuB,EAAE;;AAGhC,OAAI;AAEF,QAAI,KAAK,YAAY,cAAe,QAAOA,aAAAA,wBAAwB;AAGnE,UAAM,KAAK,QAAQ,KAAK;AAGxB,QAAI,QAAQ,KAAK,OACf,MAAK,OAAO,KACV,6BAA6B,KAAK,KAAK,GAAG,WAAW,OAAO,KAAK,UAAU,KAAK,GACjF;AACH,iBAAa,KAAK,KAAK;AAGvB,QAAI,aAAa,KAAA,EAAW,MAAK,MAAM,KAAK,SAAU,GAAE,SAAS;YAC1D,GAAQ;AAEf,QAAI,QAAQ,KAAK,OACf,MAAK,OAAO,KACV,2BAA2B,KAAK,KAAK,GAAG,WAAW,OAAO,KAAK,UAAU,KAAK,GAC/E;AACH,iBAAa,KAAK,KAAK;AAGvB,QAAI,aAAa,KAAA,EAAW,MAAK,MAAM,KAAK,SAAU,GAAE,OAAO,EAAE;AAGjE,QAAI,aAAaC,cAAAA,sBAAsB;AAErC,UAAK,QAAQ,MAAM,EAAE;AAGrB,UAAK,MAAM,eAAe,oBAAoB;AAE9C,UAAK,QAAQ,IAAIN,cAAAA,YAAY,KAAK,MAAM,KAAK,eAAe;AAG5D;UAMK,MAAK,QAAQ,KAAK,EAAE;;AAG7B,OAAI,CAAC,KAAK,eAAe,KAAK,WAAY;AAI1C,OAAI;AACF,UAAMO,qBAAG,WAAW,yBAAyB,KAAA,GAAW,EACtD,QAAQ,KAAK,gBAAgB,QAC9B,CAAC;YACK,GAAY;AACnB,QAAI,EAAA,GAAA,0BAAA,wBAAwB,EAAE,CAAE,OAAM,IAAI,MAAM,oBAAoB,EAAE,OAAO,GAAG,CAAC;AACjF,QAAI,KAAK,gBAAgB,OAAO,QAAS;;AAG3C,OAAI,CAAC,KAAK,eAAe,KAAK,WAAY;AAI1C,OAAI,KAAK,qBAAqB,WAAW,GAAG;IAC1C,MAAM,YAAY,KAAK,IAAI,GAAG,KAAK,kBAAkB,wBAAwB;AAC7E,QAAI,YAAY,EACd,KAAI;AACF,UAAK,4BAA4B,IAAI,iBAAiB;AACtD,WAAMA,qBAAG,WAAW,WAAW,KAAA,GAAW,EACxC,QAAQ,YAAY,IAAI,CACtB,KAAK,gBAAgB,QACrB,KAAK,0BAA0B,OAChC,CAAC,EACH,CAAC;aACK,GAAY;AACnB,SAAI,EAAA,GAAA,0BAAA,wBAAwB,EAAE,CAAE,OAAM,IAAI,MAAM,oBAAoB,EAAE,OAAO,GAAG,CAAC;AACjF,SAAI,KAAK,gBAAgB,OAAO,QAAS;cAGjC;AACR,UAAK,4BAA4B,KAAA;;;;AAOzC,OAAK,cAAc,KAAA;;;;;;CAOrB,YAA2C;AACzC,SAAO,KAAK,MAAM,WAAW;;;;;;CAO/B,MAAa,YAA2B;AACtC,OAAK,cAAc;AACnB,OAAK,aAAa;AAClB,OAAK,gBAAgB,OAAO;AAE5B,MAAI,KAAK,gBAAgB,KAAA,EAAW;AACpC,QAAM,KAAK;AAEX,OAAK,MAAM,eAAe,0CAA0C;;;CAItE,MAAa,2BAA0C;AACrD,MAAI,KAAK,gBAAgB,KAAA,EAAW;AACpC,QAAM,KAAK;;CAGb,aAAoB,KAClB,IACA,MACA,KACA,QACA;EACA,MAAM,OAAO,IAAI,sBAAsB,IAAI,MAAM,KAAK,OAAO;EAE7D,MAAM,OAAO,IAAI,UAAUF,aAAAA,wBAAwB,GAAG,KAAA;EAEtD,IAAI,KAAK;AAET,MAAI;AACF,SAAM,KAAK,QAAQ,MAAM,EACvB,SAAS,IAAI,2BACd,CAAC;AACF,QAAK;YACG;AAER,OAAI,QAAQ,OACV,QAAO,KACL,4BAA4B,KAAK,YAAY,UAAU,KAAK,KAAK,UAAU,KAAK,GACjF;;AAGL,SAAO"}
+{"version":3,"file":"synchronized_tree.cjs","names":["PlTreeState","PollingComputableHooks","PlTreeEntry","PlTreeRootsEntry","constructTreeLoadingRequest","loadTreeState","initialTreeLoadingStat","TreeStateUpdateError","tp"],"sources":["../src/synchronized_tree.ts"],"sourcesContent":["import { PollingComputableHooks } from \"@milaboratories/computable\";\nimport { PlTreeEntry, PlTreeRootsEntry } from \"./accessors\";\nimport type {\n  FinalResourceDataPredicate,\n  PlClient,\n  ResourceType,\n  SignedResourceId,\n  TxOps,\n} from \"@milaboratories/pl-client\";\nimport type { Filter } from \"@milaboratories/pl-client\";\nimport { isUnauthenticated, isTimeoutOrCancelError } from \"@milaboratories/pl-client\";\nimport type { ExtendedResourceData } from \"./state\";\nimport { PlTreeState, TreeStateUpdateError } from \"./state\";\nimport type { PruningFunction, TraversalMode, TreeLoadingStat } from \"./sync\";\nimport { constructTreeLoadingRequest, initialTreeLoadingStat, loadTreeState } from \"./sync\";\nimport * as tp from \"node:timers/promises\";\nimport type { MiLogger } from \"@milaboratories/ts-helpers\";\n\n/** Hard floor between consecutive tree-refresh calls.\n * Applies even when {@link scheduleOnNextState} has woken the loop early,\n * preventing tight polling loops during rapid state transitions. */\nconst MIN_POLLING_INTERVAL_MS = 100;\n\ntype StatLoggingMode = \"cumulative\" | \"per-request\";\n\nexport type SynchronizedTreeOps = {\n  /** Override final predicate from the PlClient */\n  finalPredicateOverride?: FinalResourceDataPredicate;\n\n  /** Pruning function for legacy fallback path. */\n  pruning?: PruningFunction;\n\n  /** ResourceTree field filter for modern backend path. */\n  fieldFilter?: Filter;\n\n  /** ResourceTree traversal stop rules for modern backend path. */\n  traverseStopRules?: Filter;\n\n  /** Interval after last sync to sleep before the next one */\n  pollingInterval: number;\n  /** For how long to continue polling after the last derived value access */\n  stopPollingDelay: number;\n\n  /** If one of the values, tree will log stats of each polling request */\n  logStat?: StatLoggingMode;\n\n  /** Timeout for initial tree loading. If not specified, will use default for RO tx from pl-client. */\n  initialTreeLoadingTimeout?: number;\n\n  /** Controls which tree-loading path to use.  Default `\"auto\"`. */\n  traversalMode?: TraversalMode;\n};\n\n/** An explicit resource to serve as a tree root. Several explicit seeds may be passed. */\nexport type ExplicitRootSeed = { kind: \"resource\"; root: SignedResourceId };\n\n/** Discovers, as roots, every resource of this type shared with the current user.\n *  Matched against SharedResource.resourceType by NAME (version optional/ignored). The\n *  discovered set is DYNAMIC — roots appear/disappear as grants are added/revoked/expire. */\nexport type SharedTypeSeed = { kind: \"shared\"; resourceType: ResourceType };\n\nexport type TreeSeed = ExplicitRootSeed | SharedTypeSeed;\n\n/** Normalizes the {@link SynchronizedTreeState.init} seed argument — a bare\n * {@link SignedResourceId}, a single {@link TreeSeed}, or an array — to `TreeSeed[]`, so\n * every existing single-root caller is unchanged. */\nfunction normalizeSeeds(seeds: SignedResourceId | TreeSeed | TreeSeed[]): TreeSeed[] {\n  if (Array.isArray(seeds)) return seeds;\n  if (typeof seeds === \"object\" && seeds !== null && \"kind\" in seeds) return [seeds];\n  // bare SignedResourceId\n  return [{ kind: \"resource\", root: seeds }];\n}\n\n/** How often, in main-loop iterations, a tree with shared-type seeds re-polls\n * ListUserResources to reconcile its discovered roots. 1 would mean every iteration.\n *\n * Discovery (a full ListUserResources stream) is far heavier than an ordinary incremental\n * refresh, so it must NOT run on every fast refresh tick. The refresh cadence is the tree's\n * `pollingInterval` floored by {@link MIN_POLLING_INTERVAL_MS} (~200ms-1s in practice — the\n * shared-seed discovery tree runs at the 200ms default). At N = 15 discovery fires roughly\n * every 15 × 200ms ≈ 3s, decoupling it from the fast refresh loop while keeping the latency\n * of noticing a new/removed share to a few seconds — acceptable for a human-driven share flow.\n *\n * Only trees with shared-type seeds gate on this; {@link discover} is a no-op for single-root\n * and explicit-seed trees (empty `sharedSeeds`), so the value never affects them. */\nconst DISCOVERY_EVERY_N_REFRESHES = 15;\n\ntype ScheduledRefresh = {\n  resolve: () => void;\n  reject: (err: any) => void;\n};\n\nexport class SynchronizedTreeState {\n  private readonly finalPredicate: FinalResourceDataPredicate;\n  private state: PlTreeState;\n  private readonly pollingInterval: number;\n  private readonly pruning?: PruningFunction;\n  private readonly fieldFilter?: Filter;\n  private readonly traverseStopRules?: Filter;\n  private readonly traversalMode: TraversalMode;\n  private readonly logStat?: StatLoggingMode;\n  private readonly hooks: PollingComputableHooks;\n  private readonly abortController = new AbortController();\n\n  /** Explicit-resource seeds: fixed roots, present from construction. */\n  private readonly explicitRoots: SignedResourceId[];\n  /** Shared-type seeds (discovered roots), if any. */\n  private readonly sharedSeeds: SharedTypeSeed[];\n  /** Roots discovered for shared-type seeds on the last discovery poll. */\n  private discoveredRoots: SignedResourceId[] = [];\n\n  private constructor(\n    private readonly pl: PlClient,\n    seeds: TreeSeed[],\n    ops: SynchronizedTreeOps,\n    private readonly logger?: MiLogger,\n  ) {\n    const {\n      finalPredicateOverride,\n      pruning,\n      fieldFilter,\n      traverseStopRules,\n      traversalMode,\n      pollingInterval,\n      stopPollingDelay,\n      logStat,\n    } = ops;\n    this.pruning = pruning;\n    this.fieldFilter = fieldFilter;\n    this.traverseStopRules = traverseStopRules;\n    this.traversalMode = traversalMode ?? \"auto\";\n    this.pollingInterval = pollingInterval;\n    this.finalPredicate = finalPredicateOverride ?? pl.finalPredicate;\n    this.logStat = logStat;\n\n    this.explicitRoots = seeds\n      .filter((s): s is ExplicitRootSeed => s.kind === \"resource\")\n      .map((s) => s.root);\n    this.sharedSeeds = seeds.filter((s): s is SharedTypeSeed => s.kind === \"shared\");\n\n    this.state = new PlTreeState(this.currentRootSet(), this.finalPredicate);\n    this.hooks = new PollingComputableHooks(\n      () => this.startUpdating(),\n      () => this.stopUpdating(),\n      { stopDebounce: stopPollingDelay },\n      (resolve, reject) => this.scheduleOnNextState(resolve, reject),\n    );\n  }\n\n  /** The current protected root set: explicit roots plus the latest discovered roots. */\n  private currentRootSet(): Set<SignedResourceId> {\n    return new Set([...this.explicitRoots, ...this.discoveredRoots]);\n  }\n\n  /** Resolves the single root for the backward-compatible single-root accessors, throwing\n   * if the tree does not have exactly one root (guards legacy callers against multi-root). */\n  private soleRoot(): SignedResourceId {\n    const roots = this.currentRootSet();\n    if (roots.size !== 1)\n      throw new Error(\n        `single-root accessor used on a tree with ${roots.size} roots; use rootsEntry() instead`,\n      );\n    return roots.values().next().value!;\n  }\n\n  /** @deprecated use \"entry\" instead */\n  public accessor(rid?: SignedResourceId): PlTreeEntry {\n    if (this.terminated) throw new Error(\"tree synchronization is terminated\");\n    return this.entry(rid);\n  }\n\n  /** Backward-compatible single-root entry. With no `rid` it returns the sole root's entry\n   * and THROWS if the tree has zero or more than one root. An explicit `rid` addresses any\n   * resource in the heap, as today. */\n  public entry(rid?: SignedResourceId): PlTreeEntry {\n    if (this.terminated) throw new Error(\"tree synchronization is terminated\");\n    return new PlTreeEntry(\n      { treeProvider: () => this.state, hooks: this.hooks },\n      rid ?? this.soleRoot(),\n    );\n  }\n\n  /** Reactive provider for the current root SET. Reading it inside a Computable tracks the\n   * set as a dependency, so the Computable recomputes when discovered roots appear/disappear. */\n  public rootsEntry(): PlTreeRootsEntry {\n    if (this.terminated) throw new Error(\"tree synchronization is terminated\");\n    return new PlTreeRootsEntry({ treeProvider: () => this.state, hooks: this.hooks });\n  }\n\n  /** Can be used to externally kick off the synchronization polling loop, and\n   * await for the first synchronization to happen. */\n  public async refreshState(): Promise<void> {\n    if (this.terminated) throw new Error(\"tree synchronization is terminated\");\n    await this.hooks.refreshState();\n  }\n\n  private currentLoopDelayInterrupt: AbortController | undefined = undefined;\n  private scheduledOnNextState: ScheduledRefresh[] = [];\n\n  /** Called from computable hooks when external observer asks for state refresh */\n  private scheduleOnNextState(resolve: () => void, reject: (err: any) => void): void {\n    if (this.terminated) reject(new Error(\"tree synchronization is terminated\"));\n    else {\n      this.scheduledOnNextState.push({ resolve, reject });\n      if (this.currentLoopDelayInterrupt) {\n        this.currentLoopDelayInterrupt.abort();\n        this.currentLoopDelayInterrupt = undefined;\n      }\n    }\n  }\n\n  /** Called from observer */\n  private startUpdating(): void {\n    if (this.terminated) return;\n    this.keepRunning = true;\n    if (this.currentLoop === undefined) this.currentLoop = this.mainLoop();\n  }\n\n  /** Called from observer */\n  private stopUpdating(): void {\n    this.keepRunning = false;\n  }\n\n  /** If true, main loop will continue polling pl state. */\n  private keepRunning = false;\n  /** Actual state of main loop. */\n  private currentLoop: Promise<void> | undefined = undefined;\n\n  /** Executed from the main loop, and initialization procedure. */\n  private async refresh(stats?: TreeLoadingStat, txOps?: TxOps): Promise<void> {\n    if (this.terminated) throw new Error(\"tree synchronization is terminated\");\n    try {\n      await this.loadAndApply(stats, txOps);\n    } catch (e) {\n      // Discovery-tree self-heal: a discovered root whose grant was revoked/expired fails the whole\n      // ResourceTree poll with Unauthenticated. Re-discover (drops dead roots) and retry once. This is\n      // self-discriminating — a genuinely dead session also fails discover()'s own call, so real auth\n      // loss still propagates. Only for discovery trees; explicit-root trees propagate as-is.\n      if (this.sharedSeeds.length > 0 && isUnauthenticated(e)) {\n        this.logger?.warn(\n          \"discovery tree: Unauthenticated on ResourceTree (likely revoked/expired root); re-discovering and retrying\",\n        );\n        await this.discover();\n        await this.loadAndApply(stats, txOps);\n      } else throw e;\n    }\n  }\n\n  private async loadAndApply(stats?: TreeLoadingStat, txOps?: TxOps): Promise<void> {\n    const request = constructTreeLoadingRequest(this.state, {\n      pruningFunction: this.pruning,\n      fieldFilter: this.fieldFilter,\n      traverseStopRules: this.traverseStopRules,\n    });\n    // A shared-type-seed tree with no currently-discovered roots is legitimately empty:\n    // there is nothing to traverse, and tx.resourceTree([]) would throw \"at least one seed\n    // must be provided\". Skip the backend load and leave the (empty) state as-is — discovery\n    // adds roots later via setRoots(), which schedules the next refresh. Explicit-root trees\n    // never hit this (their root set is non-empty by construction).\n    if (request.seedResources.length === 0 && request.finalResources.size === 0) return;\n    const data = await this.pl.withReadTx(\n      \"ReadingTree\",\n      async (tx) => {\n        return await loadTreeState(\n          tx,\n          request,\n          stats,\n          this.pl.serverInfo.capabilities ?? [],\n          this.traversalMode,\n          this.logger,\n        );\n      },\n      txOps,\n    );\n    this.state.updateFromResourceData(data, true);\n  }\n\n  /** Discovery sync for shared-type seeds: re-polls `ListUserResources` (gRPC-only) and\n   * reconciles the discovered root set against the heap. A longer poll result adds roots; a\n   * shorter one removes them (grant revoked/expired) — the removed roots' subtrees cascade\n   * to collection via the ordinary refcount GC ({@link PlTreeState.setRoots}). No-op when the\n   * tree has no shared-type seeds, or silently no-op on a REST client where `ListUserResources`\n   * is unavailable. */\n  private async discover(): Promise<void> {\n    if (this.terminated) throw new Error(\"tree synchronization is terminated\");\n    if (this.sharedSeeds.length === 0) return;\n\n    const discovered = new Set<SignedResourceId>();\n    for (const seed of this.sharedSeeds) {\n      // match by name only (permissive; ignores version, so it survives schema bumps)\n      const ids = await this.pl.userResources.listSharedResourcesByType(seed.resourceType.name);\n      for (const id of ids) discovered.add(id);\n    }\n\n    this.discoveredRoots = [...discovered];\n    this.state.setRoots(this.currentRootSet());\n  }\n\n  /** If true this tree state is permanently terminaed. */\n  private terminated = false;\n\n  private async mainLoop() {\n    // will hold request stats\n    let stat = this.logStat ? initialTreeLoadingStat() : undefined;\n\n    let lastUpdate = Date.now();\n\n    // counts refresh iterations to pace the discovery poll for shared-type seeds.\n    let iteration = 0;\n\n    while (true) {\n      if (!this.keepRunning || this.terminated) break;\n\n      // saving those who want to be notified about new state here\n      // because those who will be added during the tree retrieval\n      // should be notified only on the next round\n      let toNotify: ScheduledRefresh[] | undefined = undefined;\n      if (this.scheduledOnNextState.length > 0) {\n        toNotify = this.scheduledOnNextState;\n        this.scheduledOnNextState = [];\n      }\n\n      try {\n        // resetting stats if we were asked to collect non-cumulative stats\n        if (this.logStat === \"per-request\") stat = initialTreeLoadingStat();\n\n        // discovery sync for shared-type seeds: reconcile the discovered root set before\n        // refreshing, so newly discovered roots are materialized in this same iteration.\n        if (this.sharedSeeds.length > 0 && iteration % DISCOVERY_EVERY_N_REFRESHES === 0) {\n          await this.discover();\n        }\n        iteration++;\n\n        // actual tree synchronization\n        await this.refresh(stat);\n\n        // logging stats if we were asked to\n        if (stat && this.logger)\n          this.logger.info(\n            `Tree stat (success, after ${Date.now() - lastUpdate}ms): ${JSON.stringify(stat)}`,\n          );\n        lastUpdate = Date.now();\n\n        // notifying that we got new state\n        if (toNotify !== undefined) for (const n of toNotify) n.resolve();\n      } catch (e: any) {\n        // logging stats if we were asked to (even if error occured)\n        if (stat && this.logger)\n          this.logger.info(\n            `Tree stat (error, after ${Date.now() - lastUpdate}ms): ${JSON.stringify(stat)}`,\n          );\n        lastUpdate = Date.now();\n\n        // notifying that we failed to refresh the state\n        if (toNotify !== undefined) for (const n of toNotify) n.reject(e);\n\n        // catching tree update errors, as they may leave our tree in inconsistent state\n        if (e instanceof TreeStateUpdateError) {\n          // important error logging, this should never happen\n          this.logger?.error(e);\n\n          // marking everybody who used previous state as changed\n          this.state.invalidateTree(\"stat update error\");\n          // creating new tree with the full current root set (re-discovered on next iteration)\n          this.state = new PlTreeState(this.currentRootSet(), this.finalPredicate);\n\n          // scheduling state update without delay\n          continue;\n\n          // unfortunately external observer may still see tree in its default\n          // empty state, though this is best we can do in this exceptional\n          // situation, and hope on caching layers inside computables to present\n          // some stale state until we reconstruct the tree again\n        } else this.logger?.warn(e);\n      }\n\n      if (!this.keepRunning || this.terminated) break;\n\n      // Phase 1: mandatory floor — always wait at least MIN_POLLING_INTERVAL_MS.\n      // Not interruptible by scheduleOnNextState; only termination aborts it.\n      try {\n        await tp.setTimeout(MIN_POLLING_INTERVAL_MS, undefined, {\n          signal: this.abortController.signal,\n        });\n      } catch (e: unknown) {\n        if (!isTimeoutOrCancelError(e)) throw new Error(\"Unexpected error\", { cause: e });\n        if (this.abortController.signal.aborted) break;\n      }\n\n      if (!this.keepRunning || this.terminated) break;\n\n      // Phase 2: optional remainder up to pollingInterval — interruptible by\n      // scheduleOnNextState so that an external nudge wakes the loop promptly.\n      if (this.scheduledOnNextState.length === 0) {\n        const remaining = Math.max(0, this.pollingInterval - MIN_POLLING_INTERVAL_MS);\n        if (remaining > 0) {\n          try {\n            this.currentLoopDelayInterrupt = new AbortController();\n            await tp.setTimeout(remaining, undefined, {\n              signal: AbortSignal.any([\n                this.abortController.signal,\n                this.currentLoopDelayInterrupt.signal,\n              ]),\n            });\n          } catch (e: unknown) {\n            if (!isTimeoutOrCancelError(e)) throw new Error(\"Unexpected error\", { cause: e });\n            if (this.abortController.signal.aborted) break;\n            // Otherwise it was just the loop delay interrupt (scheduleOnNextState),\n            // continue to the next iteration\n          } finally {\n            this.currentLoopDelayInterrupt = undefined;\n          }\n        }\n      }\n    }\n\n    // reset only as a very last line\n    this.currentLoop = undefined;\n  }\n\n  /**\n   * Dumps the current state of the tree.\n   * @returns An array of ExtendedResourceData objects representing the current state of the tree.\n   */\n  public dumpState(): ExtendedResourceData[] {\n    return this.state.dumpState();\n  }\n\n  /**\n   * Terminates the internal loop, and permanently destoys all internal state, so\n   * all computables using this state will resolve to errors.\n   * */\n  public async terminate(): Promise<void> {\n    this.keepRunning = false;\n    this.terminated = true;\n    this.abortController.abort();\n\n    if (this.currentLoop === undefined) return;\n    await this.currentLoop;\n\n    this.state.invalidateTree(\"synchronization terminated for the tree\");\n  }\n\n  /** @deprecated */\n  public async awaitSyncLoopTermination(): Promise<void> {\n    if (this.currentLoop === undefined) return;\n    await this.currentLoop;\n  }\n\n  /**\n   * Initializes a synchronized tree from one or more seeds.\n   *\n   * @param seeds a bare {@link SignedResourceId} (the original single-root contract), a\n   *   single {@link TreeSeed}, or an array of seeds. Bare ids and explicit-resource seeds\n   *   become roots immediately; shared-type seeds discover their roots via `ListUserResources`.\n   */\n  public static async init(\n    pl: PlClient,\n    seeds: SignedResourceId | TreeSeed | TreeSeed[],\n    ops: SynchronizedTreeOps,\n    logger?: MiLogger,\n  ) {\n    const tree = new SynchronizedTreeState(pl, normalizeSeeds(seeds), ops, logger);\n\n    const stat = ops.logStat ? initialTreeLoadingStat() : undefined;\n\n    let ok = false;\n\n    try {\n      // resolve shared-type seeds before the first refresh so discovered roots load now\n      await tree.discover();\n      await tree.refresh(stat, {\n        timeout: ops.initialTreeLoadingTimeout,\n      });\n      ok = true;\n    } finally {\n      // logging stats if we were asked to (even if error occured)\n      if (stat && logger)\n        logger.info(\n          `Tree stat (initial load, ${ok ? \"success\" : \"failure\"}): ${JSON.stringify(stat)}`,\n        );\n    }\n\n    return tree;\n  }\n}\n"],"mappings":";;;;;;;;;;;;AAqBA,MAAM,0BAA0B;;;;AA6ChC,SAAS,eAAe,OAA6D;CACnF,IAAI,MAAM,QAAQ,KAAK,GAAG,OAAO;CACjC,IAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,UAAU,OAAO,OAAO,CAAC,KAAK;CAEjF,OAAO,CAAC;EAAE,MAAM;EAAY,MAAM;CAAM,CAAC;AAC3C;;;;;;;;;;;;;AAcA,MAAM,8BAA8B;AAOpC,IAAa,wBAAb,MAAa,sBAAsB;CAoBd;CAGA;CAtBnB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA,kBAAmC,IAAI,gBAAgB;;CAGvD;;CAEA;;CAEA,kBAA8C,CAAC;CAE/C,YACE,IACA,OACA,KACA,QACA;EAJiB,KAAA,KAAA;EAGA,KAAA,SAAA;EAEjB,MAAM,EACJ,wBACA,SACA,aACA,mBACA,eACA,iBACA,kBACA,YACE;EACJ,KAAK,UAAU;EACf,KAAK,cAAc;EACnB,KAAK,oBAAoB;EACzB,KAAK,gBAAgB,iBAAiB;EACtC,KAAK,kBAAkB;EACvB,KAAK,iBAAiB,0BAA0B,GAAG;EACnD,KAAK,UAAU;EAEf,KAAK,gBAAgB,MAClB,QAAQ,MAA6B,EAAE,SAAS,UAAU,CAAC,CAC3D,KAAK,MAAM,EAAE,IAAI;EACpB,KAAK,cAAc,MAAM,QAAQ,MAA2B,EAAE,SAAS,QAAQ;EAE/E,KAAK,QAAQ,IAAIA,cAAAA,YAAY,KAAK,eAAe,GAAG,KAAK,cAAc;EACvE,KAAK,QAAQ,IAAIC,2BAAAA,6BACT,KAAK,cAAc,SACnB,KAAK,aAAa,GACxB,EAAE,cAAc,iBAAiB,IAChC,SAAS,WAAW,KAAK,oBAAoB,SAAS,MAAM,CAC/D;CACF;;CAGA,iBAAgD;EAC9C,uBAAO,IAAI,IAAI,CAAC,GAAG,KAAK,eAAe,GAAG,KAAK,eAAe,CAAC;CACjE;;;CAIA,WAAqC;EACnC,MAAM,QAAQ,KAAK,eAAe;EAClC,IAAI,MAAM,SAAS,GACjB,MAAM,IAAI,MACR,4CAA4C,MAAM,KAAK,iCACzD;EACF,OAAO,MAAM,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC;CAC/B;;CAGA,SAAgB,KAAqC;EACnD,IAAI,KAAK,YAAY,MAAM,IAAI,MAAM,oCAAoC;EACzE,OAAO,KAAK,MAAM,GAAG;CACvB;;;;CAKA,MAAa,KAAqC;EAChD,IAAI,KAAK,YAAY,MAAM,IAAI,MAAM,oCAAoC;EACzE,OAAO,IAAIC,kBAAAA,YACT;GAAE,oBAAoB,KAAK;GAAO,OAAO,KAAK;EAAM,GACpD,OAAO,KAAK,SAAS,CACvB;CACF;;;CAIA,aAAsC;EACpC,IAAI,KAAK,YAAY,MAAM,IAAI,MAAM,oCAAoC;EACzE,OAAO,IAAIC,kBAAAA,iBAAiB;GAAE,oBAAoB,KAAK;GAAO,OAAO,KAAK;EAAM,CAAC;CACnF;;;CAIA,MAAa,eAA8B;EACzC,IAAI,KAAK,YAAY,MAAM,IAAI,MAAM,oCAAoC;EACzE,MAAM,KAAK,MAAM,aAAa;CAChC;CAEA,4BAAiE,KAAA;CACjE,uBAAmD,CAAC;;CAGpD,oBAA4B,SAAqB,QAAkC;EACjF,IAAI,KAAK,YAAY,uBAAO,IAAI,MAAM,oCAAoC,CAAC;OACtE;GACH,KAAK,qBAAqB,KAAK;IAAE;IAAS;GAAO,CAAC;GAClD,IAAI,KAAK,2BAA2B;IAClC,KAAK,0BAA0B,MAAM;IACrC,KAAK,4BAA4B,KAAA;GACnC;EACF;CACF;;CAGA,gBAA8B;EAC5B,IAAI,KAAK,YAAY;EACrB,KAAK,cAAc;EACnB,IAAI,KAAK,gBAAgB,KAAA,GAAW,KAAK,cAAc,KAAK,SAAS;CACvE;;CAGA,eAA6B;EAC3B,KAAK,cAAc;CACrB;;CAGA,cAAsB;;CAEtB,cAAiD,KAAA;;CAGjD,MAAc,QAAQ,OAAyB,OAA8B;EAC3E,IAAI,KAAK,YAAY,MAAM,IAAI,MAAM,oCAAoC;EACzE,IAAI;GACF,MAAM,KAAK,aAAa,OAAO,KAAK;EACtC,SAAS,GAAG;GAKV,IAAI,KAAK,YAAY,SAAS,MAAA,GAAA,0BAAA,kBAAA,CAAuB,CAAC,GAAG;IACvD,KAAK,QAAQ,KACX,4GACF;IACA,MAAM,KAAK,SAAS;IACpB,MAAM,KAAK,aAAa,OAAO,KAAK;GACtC,OAAO,MAAM;EACf;CACF;CAEA,MAAc,aAAa,OAAyB,OAA8B;EAChF,MAAM,UAAUC,aAAAA,4BAA4B,KAAK,OAAO;GACtD,iBAAiB,KAAK;GACtB,aAAa,KAAK;GAClB,mBAAmB,KAAK;EAC1B,CAAC;EAMD,IAAI,QAAQ,cAAc,WAAW,KAAK,QAAQ,eAAe,SAAS,GAAG;EAC7E,MAAM,OAAO,MAAM,KAAK,GAAG,WACzB,eACA,OAAO,OAAO;GACZ,OAAO,MAAMC,aAAAA,cACX,IACA,SACA,OACA,KAAK,GAAG,WAAW,gBAAgB,CAAC,GACpC,KAAK,eACL,KAAK,MACP;EACF,GACA,KACF;EACA,KAAK,MAAM,uBAAuB,MAAM,IAAI;CAC9C;;;;;;;CAQA,MAAc,WAA0B;EACtC,IAAI,KAAK,YAAY,MAAM,IAAI,MAAM,oCAAoC;EACzE,IAAI,KAAK,YAAY,WAAW,GAAG;EAEnC,MAAM,6BAAa,IAAI,IAAsB;EAC7C,KAAK,MAAM,QAAQ,KAAK,aAAa;GAEnC,MAAM,MAAM,MAAM,KAAK,GAAG,cAAc,0BAA0B,KAAK,aAAa,IAAI;GACxF,KAAK,MAAM,MAAM,KAAK,WAAW,IAAI,EAAE;EACzC;EAEA,KAAK,kBAAkB,CAAC,GAAG,UAAU;EACrC,KAAK,MAAM,SAAS,KAAK,eAAe,CAAC;CAC3C;;CAGA,aAAqB;CAErB,MAAc,WAAW;EAEvB,IAAI,OAAO,KAAK,UAAUC,aAAAA,uBAAuB,IAAI,KAAA;EAErD,IAAI,aAAa,KAAK,IAAI;EAG1B,IAAI,YAAY;EAEhB,OAAO,MAAM;GACX,IAAI,CAAC,KAAK,eAAe,KAAK,YAAY;GAK1C,IAAI,WAA2C,KAAA;GAC/C,IAAI,KAAK,qBAAqB,SAAS,GAAG;IACxC,WAAW,KAAK;IAChB,KAAK,uBAAuB,CAAC;GAC/B;GAEA,IAAI;IAEF,IAAI,KAAK,YAAY,eAAe,OAAOA,aAAAA,uBAAuB;IAIlE,IAAI,KAAK,YAAY,SAAS,KAAK,YAAY,gCAAgC,GAC7E,MAAM,KAAK,SAAS;IAEtB;IAGA,MAAM,KAAK,QAAQ,IAAI;IAGvB,IAAI,QAAQ,KAAK,QACf,KAAK,OAAO,KACV,6BAA6B,KAAK,IAAI,IAAI,WAAW,OAAO,KAAK,UAAU,IAAI,GACjF;IACF,aAAa,KAAK,IAAI;IAGtB,IAAI,aAAa,KAAA,GAAW,KAAK,MAAM,KAAK,UAAU,EAAE,QAAQ;GAClE,SAAS,GAAQ;IAEf,IAAI,QAAQ,KAAK,QACf,KAAK,OAAO,KACV,2BAA2B,KAAK,IAAI,IAAI,WAAW,OAAO,KAAK,UAAU,IAAI,GAC/E;IACF,aAAa,KAAK,IAAI;IAGtB,IAAI,aAAa,KAAA,GAAW,KAAK,MAAM,KAAK,UAAU,EAAE,OAAO,CAAC;IAGhE,IAAI,aAAaC,cAAAA,sBAAsB;KAErC,KAAK,QAAQ,MAAM,CAAC;KAGpB,KAAK,MAAM,eAAe,mBAAmB;KAE7C,KAAK,QAAQ,IAAIP,cAAAA,YAAY,KAAK,eAAe,GAAG,KAAK,cAAc;KAGvE;IAMF,OAAO,KAAK,QAAQ,KAAK,CAAC;GAC5B;GAEA,IAAI,CAAC,KAAK,eAAe,KAAK,YAAY;GAI1C,IAAI;IACF,MAAMQ,qBAAG,WAAW,yBAAyB,KAAA,GAAW,EACtD,QAAQ,KAAK,gBAAgB,OAC/B,CAAC;GACH,SAAS,GAAY;IACnB,IAAI,EAAA,GAAA,0BAAA,uBAAA,CAAwB,CAAC,GAAG,MAAM,IAAI,MAAM,oBAAoB,EAAE,OAAO,EAAE,CAAC;IAChF,IAAI,KAAK,gBAAgB,OAAO,SAAS;GAC3C;GAEA,IAAI,CAAC,KAAK,eAAe,KAAK,YAAY;GAI1C,IAAI,KAAK,qBAAqB,WAAW,GAAG;IAC1C,MAAM,YAAY,KAAK,IAAI,GAAG,KAAK,kBAAkB,uBAAuB;IAC5E,IAAI,YAAY,GACd,IAAI;KACF,KAAK,4BAA4B,IAAI,gBAAgB;KACrD,MAAMA,qBAAG,WAAW,WAAW,KAAA,GAAW,EACxC,QAAQ,YAAY,IAAI,CACtB,KAAK,gBAAgB,QACrB,KAAK,0BAA0B,MACjC,CAAC,EACH,CAAC;IACH,SAAS,GAAY;KACnB,IAAI,EAAA,GAAA,0BAAA,uBAAA,CAAwB,CAAC,GAAG,MAAM,IAAI,MAAM,oBAAoB,EAAE,OAAO,EAAE,CAAC;KAChF,IAAI,KAAK,gBAAgB,OAAO,SAAS;IAG3C,UAAU;KACR,KAAK,4BAA4B,KAAA;IACnC;GAEJ;EACF;EAGA,KAAK,cAAc,KAAA;CACrB;;;;;CAMA,YAA2C;EACzC,OAAO,KAAK,MAAM,UAAU;CAC9B;;;;;CAMA,MAAa,YAA2B;EACtC,KAAK,cAAc;EACnB,KAAK,aAAa;EAClB,KAAK,gBAAgB,MAAM;EAE3B,IAAI,KAAK,gBAAgB,KAAA,GAAW;EACpC,MAAM,KAAK;EAEX,KAAK,MAAM,eAAe,yCAAyC;CACrE;;CAGA,MAAa,2BAA0C;EACrD,IAAI,KAAK,gBAAgB,KAAA,GAAW;EACpC,MAAM,KAAK;CACb;;;;;;;;CASA,aAAoB,KAClB,IACA,OACA,KACA,QACA;EACA,MAAM,OAAO,IAAI,sBAAsB,IAAI,eAAe,KAAK,GAAG,KAAK,MAAM;EAE7E,MAAM,OAAO,IAAI,UAAUF,aAAAA,uBAAuB,IAAI,KAAA;EAEtD,IAAI,KAAK;EAET,IAAI;GAEF,MAAM,KAAK,SAAS;GACpB,MAAM,KAAK,QAAQ,MAAM,EACvB,SAAS,IAAI,0BACf,CAAC;GACD,KAAK;EACP,UAAU;GAER,IAAI,QAAQ,QACV,OAAO,KACL,4BAA4B,KAAK,YAAY,UAAU,KAAK,KAAK,UAAU,IAAI,GACjF;EACJ;EAEA,OAAO;CACT;AACF"}

package/dist/synchronized_tree.d.ts

@@ -1,7 +1,7 @@
-import { PlTreeEntry } from "./accessors.js";
+import { PlTreeEntry, PlTreeRootsEntry } from "./accessors.js";
 import { ExtendedResourceData } from "./state.js";
 import { PruningFunction, TraversalMode } from "./sync.js";
-import { Filter, FinalResourceDataPredicate, PlClient, SignedResourceId } from "@milaboratories/pl-client";
+import { Filter, FinalResourceDataPredicate, PlClient, ResourceType, SignedResourceId } from "@milaboratories/pl-client";
 import { MiLogger } from "@milaboratories/ts-helpers";
 
 //#region src/synchronized_tree.d.ts
@@ -17,9 +17,21 @@ type SynchronizedTreeOps = {
   initialTreeLoadingTimeout?: number; /** Controls which tree-loading path to use.  Default `"auto"`. */
   traversalMode?: TraversalMode;
 };
+/** An explicit resource to serve as a tree root. Several explicit seeds may be passed. */
+type ExplicitRootSeed = {
+  kind: "resource";
+  root: SignedResourceId;
+};
+/** Discovers, as roots, every resource of this type shared with the current user.
+ *  Matched against SharedResource.resourceType by NAME (version optional/ignored). The
+ *  discovered set is DYNAMIC — roots appear/disappear as grants are added/revoked/expire. */
+type SharedTypeSeed = {
+  kind: "shared";
+  resourceType: ResourceType;
+};
+type TreeSeed = ExplicitRootSeed | SharedTypeSeed;
 declare class SynchronizedTreeState {
   private readonly pl;
-  private readonly root;
   private readonly logger?;
   private readonly finalPredicate;
   private state;
@@ -31,10 +43,27 @@ declare class SynchronizedTreeState {
   private readonly logStat?;
   private readonly hooks;
   private readonly abortController;
+  /** Explicit-resource seeds: fixed roots, present from construction. */
+  private readonly explicitRoots;
+  /** Shared-type seeds (discovered roots), if any. */
+  private readonly sharedSeeds;
+  /** Roots discovered for shared-type seeds on the last discovery poll. */
+  private discoveredRoots;
   private constructor();
+  /** The current protected root set: explicit roots plus the latest discovered roots. */
+  private currentRootSet;
+  /** Resolves the single root for the backward-compatible single-root accessors, throwing
+   * if the tree does not have exactly one root (guards legacy callers against multi-root). */
+  private soleRoot;
   /** @deprecated use "entry" instead */
   accessor(rid?: SignedResourceId): PlTreeEntry;
+  /** Backward-compatible single-root entry. With no `rid` it returns the sole root's entry
+   * and THROWS if the tree has zero or more than one root. An explicit `rid` addresses any
+   * resource in the heap, as today. */
   entry(rid?: SignedResourceId): PlTreeEntry;
+  /** Reactive provider for the current root SET. Reading it inside a Computable tracks the
+   * set as a dependency, so the Computable recomputes when discovered roots appear/disappear. */
+  rootsEntry(): PlTreeRootsEntry;
   /** Can be used to externally kick off the synchronization polling loop, and
    * await for the first synchronization to happen. */
   refreshState(): Promise<void>;
@@ -52,6 +81,14 @@ declare class SynchronizedTreeState {
   private currentLoop;
   /** Executed from the main loop, and initialization procedure. */
   private refresh;
+  private loadAndApply;
+  /** Discovery sync for shared-type seeds: re-polls `ListUserResources` (gRPC-only) and
+   * reconciles the discovered root set against the heap. A longer poll result adds roots; a
+   * shorter one removes them (grant revoked/expired) — the removed roots' subtrees cascade
+   * to collection via the ordinary refcount GC ({@link PlTreeState.setRoots}). No-op when the
+   * tree has no shared-type seeds, or silently no-op on a REST client where `ListUserResources`
+   * is unavailable. */
+  private discover;
   /** If true this tree state is permanently terminaed. */
   private terminated;
   private mainLoop;
@@ -67,8 +104,15 @@ declare class SynchronizedTreeState {
   terminate(): Promise<void>;
   /** @deprecated */
   awaitSyncLoopTermination(): Promise<void>;
-  static init(pl: PlClient, root: SignedResourceId, ops: SynchronizedTreeOps, logger?: MiLogger): Promise<SynchronizedTreeState>;
+  /**
+   * Initializes a synchronized tree from one or more seeds.
+   *
+   * @param seeds a bare {@link SignedResourceId} (the original single-root contract), a
+   *   single {@link TreeSeed}, or an array of seeds. Bare ids and explicit-resource seeds
+   *   become roots immediately; shared-type seeds discover their roots via `ListUserResources`.
+   */
+  static init(pl: PlClient, seeds: SignedResourceId | TreeSeed | TreeSeed[], ops: SynchronizedTreeOps, logger?: MiLogger): Promise<SynchronizedTreeState>;
 }
 //#endregion
-export { SynchronizedTreeOps, SynchronizedTreeState };
+export { ExplicitRootSeed, SharedTypeSeed, SynchronizedTreeOps, SynchronizedTreeState, TreeSeed };
 //# sourceMappingURL=synchronized_tree.d.ts.map

package/dist/synchronized_tree.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"synchronized_tree.d.ts","names":[],"sources":["../src/synchronized_tree.ts"],"mappings":";;;;;;;KAsBK,eAAA;AAAA,KAEO,mBAAA;EAFQ,iDAIlB,sBAAA,GAAyB,0BAAA,EAJP;EAOlB,OAAA,GAAU,eAAA,EALA;EAQV,WAAA,GAAc,MAAA;EAGd,iBAAA,GAAoB,MAAA,EANV;EASV,eAAA,UAHoB;EAKpB,gBAAA,UASgB;EANhB,OAAA,GAAU,eAAA,EAMmB;EAH7B,yBAAA,WApByB;EAuBzB,aAAA,GAAgB,aAAA;AAAA;AAAA,cAQL,qBAAA;EAAA,iBAaQ,EAAA;EAAA,iBACA,IAAA;EAAA,iBAEA,MAAA;EAAA,iBAfF,cAAA;EAAA,QACT,KAAA;EAAA,iBACS,eAAA;EAAA,iBACA,OAAA;EAAA,iBACA,WAAA;EAAA,iBACA,iBAAA;EAAA,iBACA,aAAA;EAAA,iBACA,OAAA;EAAA,iBACA,KAAA;EAAA,iBACA,eAAA;EAAA,QAEV,WAAA,CAAA;;EAiCA,QAAA,CAAS,GAAA,GAAK,gBAAA,GAA+B,WAAA;EAK7C,KAAA,CAAM,GAAA,GAAK,gBAAA,GAA+B,WAAA;EAA/B;;EAOL,YAAA,CAAA,GAAgB,OAAA;EAAA,QAKrB,yBAAA;EAAA,QACA,oBAAA;EAgMiC;EAAA,QA7LjC,mBAAA;EAoMA;EAAA,QAxLA,aAAA;EA0LG;EAAA,QAnLH,YAAA;EAmLW;EAAA,QA9KX,WAAA;EA8KW;EAAA,QA5KX,WAAA;EA9EW;EAAA,QAiFL,OAAA;EA9FG;EAAA,QAuHT,UAAA;EAAA,QAEM,QAAA;EAtHG;;;;EAuOV,SAAA,CAAA,GAAa,oBAAA;EAlOH;;;;EA0OJ,SAAA,CAAA,GAAa,OAAA;EAtMV;EAkNH,wBAAA,CAAA,GAA4B,OAAA;EAAA,OAKrB,IAAA,CAClB,EAAA,EAAI,QAAA,EACJ,IAAA,EAAM,gBAAA,EACN,GAAA,EAAK,mBAAA,EACL,MAAA,GAAS,QAAA,GAAQ,OAAA,CAAA,qBAAA;AAAA"}
+{"version":3,"file":"synchronized_tree.d.ts","names":[],"sources":["../src/synchronized_tree.ts"],"mappings":";;;;;;;KAuBK,eAAA;AAAA,KAEO,mBAAA;EAFQ,iDAIlB,sBAAA,GAAyB,0BAAA,EAJP;EAOlB,OAAA,GAAU,eAAA,EALA;EAQV,WAAA,GAAc,MAAA;EAGd,iBAAA,GAAoB,MAAA,EANV;EASV,eAAA,UAHoB;EAKpB,gBAAA,UASgB;EANhB,OAAA,GAAU,eAAA,EAMmB;EAH7B,yBAAA,WApByB;EAuBzB,aAAA,GAAgB,aAAA;AAAA;;KAIN,gBAAA;EAAqB,IAAA;EAAkB,IAAA,EAAM,gBAAgB;AAAA;;;;KAK7D,cAAA;EAAmB,IAAA;EAAgB,YAAA,EAAc,YAAY;AAAA;AAAA,KAE7D,QAAA,GAAW,gBAAA,GAAmB,cAAc;AAAA,cA+B3C,qBAAA;EAAA,iBAoBQ,EAAA;EAAA,iBAGA,MAAA;EAAA,iBAtBF,cAAA;EAAA,QACT,KAAA;EAAA,iBACS,eAAA;EAAA,iBACA,OAAA;EAAA,iBACA,WAAA;EAAA,iBACA,iBAAA;EAAA,iBACA,aAAA;EAAA,iBACA,OAAA;EAAA,iBACA,KAAA;EAAA,iBACA,eAAA;EA3CY;EAAA,iBA8CZ,aAAA;EA9C0C;EAAA,iBAgD1C,WAAA;EAhDsD;EAAA,QAkD/D,eAAA;EAAA,QAED,WAAA;;UAuCC,cAAA;EAzF8C;AA+BxD;EA/BwD,QA+F9C,QAAA;;EAUD,QAAA,CAAS,GAAA,GAAM,gBAAA,GAAmB,WAAA;EAAA;;;EAQlC,KAAA,CAAM,GAAA,GAAM,gBAAA,GAAmB,WAAA;EAiBT;;EAPtB,UAAA,IAAc,gBAAA;EAoQoB;;EA7P5B,YAAA,IAAgB,OAAA;EAAA,QAKrB,yBAAA;EAAA,QACA,oBAAA;EAsQD;EAAA,QAnQC,mBAAA;EAoQW;EAAA,QAxPX,aAAA;EAwPW;EAAA,QAjPX,YAAA;EA3GW;EAAA,QAgHX,WAAA;EAnIS;EAAA,QAqIT,WAAA;EAnIS;EAAA,QAsIH,OAAA;EAAA,QAmBA,YAAA;EAtJG;;;;;;EAAA,QAyLH,QAAA;EA9KN;EAAA,QA8LA,UAAA;EAAA,QAEM,QAAA;EAjJN;;;;EA4QD,SAAA,IAAa,oBAAA;EA1Pb;;;;EAkQM,SAAA,IAAa,OAAA;EAxPL;EAoQR,wBAAA,IAA4B,OAAA;EA7PZ;;;;;;;EAAA,OAyQT,IAAA,CAClB,EAAA,EAAI,QAAA,EACJ,KAAA,EAAO,gBAAA,GAAmB,QAAA,GAAW,QAAA,IACrC,GAAA,EAAK,mBAAA,EACL,MAAA,GAAS,QAAA,GAAQ,OAAA,CAAA,qBAAA;AAAA"}

package/dist/synchronized_tree.js

@@ -1,7 +1,7 @@
-import { PlTreeEntry } from "./accessors.js";
+import { PlTreeEntry, PlTreeRootsEntry } from "./accessors.js";
 import { PlTreeState, TreeStateUpdateError } from "./state.js";
 import { constructTreeLoadingRequest, initialTreeLoadingStat, loadTreeState } from "./sync.js";
-import { isTimeoutOrCancelError } from "@milaboratories/pl-client";
+import { isTimeoutOrCancelError, isUnauthenticated } from "@milaboratories/pl-client";
 import { PollingComputableHooks } from "@milaboratories/computable";
 import * as tp from "node:timers/promises";
 //#region src/synchronized_tree.ts
@@ -9,7 +9,33 @@ import * as tp from "node:timers/promises";
 * Applies even when {@link scheduleOnNextState} has woken the loop early,
 * preventing tight polling loops during rapid state transitions. */
 const MIN_POLLING_INTERVAL_MS = 100;
+/** Normalizes the {@link SynchronizedTreeState.init} seed argument — a bare
+* {@link SignedResourceId}, a single {@link TreeSeed}, or an array — to `TreeSeed[]`, so
+* every existing single-root caller is unchanged. */
+function normalizeSeeds(seeds) {
+	if (Array.isArray(seeds)) return seeds;
+	if (typeof seeds === "object" && seeds !== null && "kind" in seeds) return [seeds];
+	return [{
+		kind: "resource",
+		root: seeds
+	}];
+}
+/** How often, in main-loop iterations, a tree with shared-type seeds re-polls
+* ListUserResources to reconcile its discovered roots. 1 would mean every iteration.
+*
+* Discovery (a full ListUserResources stream) is far heavier than an ordinary incremental
+* refresh, so it must NOT run on every fast refresh tick. The refresh cadence is the tree's
+* `pollingInterval` floored by {@link MIN_POLLING_INTERVAL_MS} (~200ms-1s in practice — the
+* shared-seed discovery tree runs at the 200ms default). At N = 15 discovery fires roughly
+* every 15 × 200ms ≈ 3s, decoupling it from the fast refresh loop while keeping the latency
+* of noticing a new/removed share to a few seconds — acceptable for a human-driven share flow.
+*
+* Only trees with shared-type seeds gate on this; {@link discover} is a no-op for single-root
+* and explicit-seed trees (empty `sharedSeeds`), so the value never affects them. */
+const DISCOVERY_EVERY_N_REFRESHES = 15;
 var SynchronizedTreeState = class SynchronizedTreeState {
+	pl;
+	logger;
 	finalPredicate;
 	state;
 	pollingInterval;
@@ -20,9 +46,14 @@ var SynchronizedTreeState = class SynchronizedTreeState {
 	logStat;
 	hooks;
 	abortController = new AbortController();
-	constructor(pl, root, ops, logger) {
+	/** Explicit-resource seeds: fixed roots, present from construction. */
+	explicitRoots;
+	/** Shared-type seeds (discovered roots), if any. */
+	sharedSeeds;
+	/** Roots discovered for shared-type seeds on the last discovery poll. */
+	discoveredRoots = [];
+	constructor(pl, seeds, ops, logger) {
 		this.pl = pl;
-		this.root = root;
 		this.logger = logger;
 		const { finalPredicateOverride, pruning, fieldFilter, traverseStopRules, traversalMode, pollingInterval, stopPollingDelay, logStat } = ops;
 		this.pruning = pruning;
@@ -32,20 +63,45 @@ var SynchronizedTreeState = class SynchronizedTreeState {
 		this.pollingInterval = pollingInterval;
 		this.finalPredicate = finalPredicateOverride ?? pl.finalPredicate;
 		this.logStat = logStat;
-		this.state = new PlTreeState(root, this.finalPredicate);
+		this.explicitRoots = seeds.filter((s) => s.kind === "resource").map((s) => s.root);
+		this.sharedSeeds = seeds.filter((s) => s.kind === "shared");
+		this.state = new PlTreeState(this.currentRootSet(), this.finalPredicate);
 		this.hooks = new PollingComputableHooks(() => this.startUpdating(), () => this.stopUpdating(), { stopDebounce: stopPollingDelay }, (resolve, reject) => this.scheduleOnNextState(resolve, reject));
 	}
+	/** The current protected root set: explicit roots plus the latest discovered roots. */
+	currentRootSet() {
+		return /* @__PURE__ */ new Set([...this.explicitRoots, ...this.discoveredRoots]);
+	}
+	/** Resolves the single root for the backward-compatible single-root accessors, throwing
+	* if the tree does not have exactly one root (guards legacy callers against multi-root). */
+	soleRoot() {
+		const roots = this.currentRootSet();
+		if (roots.size !== 1) throw new Error(`single-root accessor used on a tree with ${roots.size} roots; use rootsEntry() instead`);
+		return roots.values().next().value;
+	}
 	/** @deprecated use "entry" instead */
-	accessor(rid = this.root) {
+	accessor(rid) {
 		if (this.terminated) throw new Error("tree synchronization is terminated");
 		return this.entry(rid);
 	}
-	entry(rid = this.root) {
+	/** Backward-compatible single-root entry. With no `rid` it returns the sole root's entry
+	* and THROWS if the tree has zero or more than one root. An explicit `rid` addresses any
+	* resource in the heap, as today. */
+	entry(rid) {
 		if (this.terminated) throw new Error("tree synchronization is terminated");
 		return new PlTreeEntry({
 			treeProvider: () => this.state,
 			hooks: this.hooks
-		}, rid);
+		}, rid ?? this.soleRoot());
+	}
+	/** Reactive provider for the current root SET. Reading it inside a Computable tracks the
+	* set as a dependency, so the Computable recomputes when discovered roots appear/disappear. */
+	rootsEntry() {
+		if (this.terminated) throw new Error("tree synchronization is terminated");
+		return new PlTreeRootsEntry({
+			treeProvider: () => this.state,
+			hooks: this.hooks
+		});
 	}
 	/** Can be used to externally kick off the synchronization polling loop, and
 	* await for the first synchronization to happen. */
@@ -86,21 +142,51 @@ var SynchronizedTreeState = class SynchronizedTreeState {
 	/** Executed from the main loop, and initialization procedure. */
 	async refresh(stats, txOps) {
 		if (this.terminated) throw new Error("tree synchronization is terminated");
+		try {
+			await this.loadAndApply(stats, txOps);
+		} catch (e) {
+			if (this.sharedSeeds.length > 0 && isUnauthenticated(e)) {
+				this.logger?.warn("discovery tree: Unauthenticated on ResourceTree (likely revoked/expired root); re-discovering and retrying");
+				await this.discover();
+				await this.loadAndApply(stats, txOps);
+			} else throw e;
+		}
+	}
+	async loadAndApply(stats, txOps) {
 		const request = constructTreeLoadingRequest(this.state, {
 			pruningFunction: this.pruning,
 			fieldFilter: this.fieldFilter,
 			traverseStopRules: this.traverseStopRules
 		});
+		if (request.seedResources.length === 0 && request.finalResources.size === 0) return;
 		const data = await this.pl.withReadTx("ReadingTree", async (tx) => {
 			return await loadTreeState(tx, request, stats, this.pl.serverInfo.capabilities ?? [], this.traversalMode, this.logger);
 		}, txOps);
 		this.state.updateFromResourceData(data, true);
 	}
+	/** Discovery sync for shared-type seeds: re-polls `ListUserResources` (gRPC-only) and
+	* reconciles the discovered root set against the heap. A longer poll result adds roots; a
+	* shorter one removes them (grant revoked/expired) — the removed roots' subtrees cascade
+	* to collection via the ordinary refcount GC ({@link PlTreeState.setRoots}). No-op when the
+	* tree has no shared-type seeds, or silently no-op on a REST client where `ListUserResources`
+	* is unavailable. */
+	async discover() {
+		if (this.terminated) throw new Error("tree synchronization is terminated");
+		if (this.sharedSeeds.length === 0) return;
+		const discovered = /* @__PURE__ */ new Set();
+		for (const seed of this.sharedSeeds) {
+			const ids = await this.pl.userResources.listSharedResourcesByType(seed.resourceType.name);
+			for (const id of ids) discovered.add(id);
+		}
+		this.discoveredRoots = [...discovered];
+		this.state.setRoots(this.currentRootSet());
+	}
 	/** If true this tree state is permanently terminaed. */
 	terminated = false;
 	async mainLoop() {
 		let stat = this.logStat ? initialTreeLoadingStat() : void 0;
 		let lastUpdate = Date.now();
+		let iteration = 0;
 		while (true) {
 			if (!this.keepRunning || this.terminated) break;
 			let toNotify = void 0;
@@ -110,6 +196,8 @@ var SynchronizedTreeState = class SynchronizedTreeState {
 			}
 			try {
 				if (this.logStat === "per-request") stat = initialTreeLoadingStat();
+				if (this.sharedSeeds.length > 0 && iteration % DISCOVERY_EVERY_N_REFRESHES === 0) await this.discover();
+				iteration++;
 				await this.refresh(stat);
 				if (stat && this.logger) this.logger.info(`Tree stat (success, after ${Date.now() - lastUpdate}ms): ${JSON.stringify(stat)}`);
 				lastUpdate = Date.now();
@@ -121,7 +209,7 @@ var SynchronizedTreeState = class SynchronizedTreeState {
 				if (e instanceof TreeStateUpdateError) {
 					this.logger?.error(e);
 					this.state.invalidateTree("stat update error");
-					this.state = new PlTreeState(this.root, this.finalPredicate);
+					this.state = new PlTreeState(this.currentRootSet(), this.finalPredicate);
 					continue;
 				} else this.logger?.warn(e);
 			}
@@ -172,11 +260,19 @@ var SynchronizedTreeState = class SynchronizedTreeState {
 		if (this.currentLoop === void 0) return;
 		await this.currentLoop;
 	}
-	static async init(pl, root, ops, logger) {
-		const tree = new SynchronizedTreeState(pl, root, ops, logger);
+	/**
+	* Initializes a synchronized tree from one or more seeds.
+	*
+	* @param seeds a bare {@link SignedResourceId} (the original single-root contract), a
+	*   single {@link TreeSeed}, or an array of seeds. Bare ids and explicit-resource seeds
+	*   become roots immediately; shared-type seeds discover their roots via `ListUserResources`.
+	*/
+	static async init(pl, seeds, ops, logger) {
+		const tree = new SynchronizedTreeState(pl, normalizeSeeds(seeds), ops, logger);
 		const stat = ops.logStat ? initialTreeLoadingStat() : void 0;
 		let ok = false;
 		try {
+			await tree.discover();
 			await tree.refresh(stat, { timeout: ops.initialTreeLoadingTimeout });
 			ok = true;
 		} finally {