@bgub/fig-reconciler 0.1.0-alpha.2 → 0.1.0-alpha.3

package/dist/refresh.d.ts

@@ -6,6 +6,10 @@ interface RefreshUpdate {
   staleFamilies: Set<RefreshFamily>;
   updatedFamilies: Set<RefreshFamily>;
 }
+interface RefreshAdapter {
+  setRefreshHandler(handler: (type: unknown) => RefreshFamily | undefined): void;
+  scheduleRefresh(update: RefreshUpdate): void;
+}
 declare function setRefreshHandler(handler: ((type: unknown) => RefreshFamily | undefined) | null): void;
 //#endregion
-export { RefreshFamily, RefreshUpdate, setRefreshHandler };
+export { RefreshAdapter, RefreshFamily, RefreshUpdate, setRefreshHandler };

package/dist/refresh.js.map

@@ -1 +1 @@
-{"version":3,"file":"refresh.js","names":[],"sources":["../src/refresh.ts"],"sourcesContent":["import { setRefreshHandlerState } from \"./refresh-internal.ts\";\n\ndeclare const __FIG_DEV__: boolean | undefined;\n\nconst __DEV__ = typeof __FIG_DEV__ === \"boolean\" ? __FIG_DEV__ : false;\n\n// A family groups every version of a component across hot edits; `current` is\n// the latest implementation. The handler is module-global (one refresh runtime\n// per app) so module-level reconcile helpers can consult it. In production no\n// handler is ever set, so all of this collapses to identity/equality paths.\nexport interface RefreshFamily {\n  current: unknown;\n}\n\nexport interface RefreshUpdate {\n  staleFamilies: Set<RefreshFamily>;\n  updatedFamilies: Set<RefreshFamily>;\n}\n\nexport function setRefreshHandler(\n  handler: ((type: unknown) => RefreshFamily | undefined) | null,\n): void {\n  if (__DEV__) {\n    setRefreshHandlerState(handler);\n  }\n}\n"],"mappings":";AAmBA,SAAgB,kBACd,SACM,CAIR"}
+{"version":3,"file":"refresh.js","names":[],"sources":["../src/refresh.ts"],"sourcesContent":["import { setRefreshHandlerState } from \"./refresh-internal.ts\";\n\ndeclare const __FIG_DEV__: boolean | undefined;\n\nconst __DEV__ = typeof __FIG_DEV__ === \"boolean\" ? __FIG_DEV__ : false;\n\n// A family groups every version of a component across hot edits; `current` is\n// the latest implementation. The handler is module-global within one\n// renderer-owned reconciler so module-level reconcile helpers can consult it.\n// In production no handler is ever set, so this collapses to identity paths.\nexport interface RefreshFamily {\n  current: unknown;\n}\n\nexport interface RefreshUpdate {\n  staleFamilies: Set<RefreshFamily>;\n  updatedFamilies: Set<RefreshFamily>;\n}\n\nexport interface RefreshAdapter {\n  setRefreshHandler(\n    handler: (type: unknown) => RefreshFamily | undefined,\n  ): void;\n  scheduleRefresh(update: RefreshUpdate): void;\n}\n\nexport function setRefreshHandler(\n  handler: ((type: unknown) => RefreshFamily | undefined) | null,\n): void {\n  if (__DEV__) {\n    setRefreshHandlerState(handler);\n  }\n}\n"],"mappings":";AA0BA,SAAgB,kBACd,SACM,CAIR"}

package/dist-development/act.js

@@ -0,0 +1,2 @@
+import { t as act } from "./scheduler-WVeIVb_n.js";
+export { act };

package/dist-development/commit-coordinator.js

@@ -0,0 +1 @@
+export {};

package/dist-development/devtools.js

@@ -0,0 +1 @@
+export {};

package/dist-development/fiber-traversal-B_egclZy.js

@@ -0,0 +1,252 @@
+import { Fragment } from "@bgub/fig";
+import { isActivity, isAssets, isContext, isErrorBoundary, isSuspense, isThenable, isViewTransition } from "@bgub/fig/internal";
+//#region src/fiber-work.ts
+const StoreConsistencyFlag = 2048;
+const AssetFlag = 16384;
+const ContextPropagationFlag = 1024;
+const ViewTransitionStaticFlag = 4096;
+const HoistedStaticFlag = 8192;
+const StaticFlagsMask = 12288;
+function childSubtreeFlags(node) {
+	return node.flags & -24843 | node.subtreeFlags;
+}
+function clearTransientFlags(node) {
+	node.flags &= StaticFlagsMask;
+	node.subtreeFlags &= StaticFlagsMask;
+}
+function tagFor(element) {
+	if (typeof element.type === "string") return 1;
+	if (element.type === Fragment) return 4;
+	if (isAssets(element.type)) return 9;
+	if (isContext(element.type)) return 5;
+	if (isSuspense(element.type)) return 6;
+	if (isActivity(element.type)) return 10;
+	if (isErrorBoundary(element.type)) return 7;
+	if (isViewTransition(element.type)) return 11;
+	return 3;
+}
+const RetryLane1 = 1 << 22;
+const SelectiveHydrationLane = 1 << 26;
+const IdleHydrationLane = 1 << 27;
+const IdleLane = 1 << 28;
+const OffscreenLane = 1 << 29;
+const DeferredLane = 1 << 30;
+const AllTransitionLanes = 4194048;
+const RetryLanes = 62914560;
+const syncLaneExpirationMs = 250;
+const transitionLaneExpirationMs = 5e3;
+let currentUpdateLane = 32;
+let nextTransitionLane = 256;
+let nextRetryLane = RetryLane1;
+let asyncTransitionLanes = 0;
+const asyncTransitionLaneCounts = createLaneMap(0);
+const transitionTypeHooks = {};
+function createLaneMap(initial) {
+	return Array.from({ length: 31 }, () => initial);
+}
+function mergeLanes(a, b) {
+	return a | b;
+}
+function includesSomeLane(set, subset) {
+	return (set & subset) !== 0;
+}
+function getHighestPriorityLane(lanes) {
+	return lanes & -lanes;
+}
+function getHighestPriorityLanes(lanes) {
+	const lane = getHighestPriorityLane(lanes);
+	if (includesSomeLane(4194048, lane)) return lanes & AllTransitionLanes;
+	if (includesSomeLane(62914560, lane)) return lanes & RetryLanes;
+	return lane;
+}
+function getNextLanes(root, wipLanes = 0) {
+	const pending = root.pendingLanes;
+	if (pending === 0) return 0;
+	const unblocked = pending & ~root.suspendedLanes;
+	const pinged = pending & root.pingedLanes;
+	let next = root.expiredLanes & unblocked;
+	if (next === 0) {
+		next = getHighestPriorityLanes(unblocked);
+		if (next === 0) {
+			const expiredPinged = root.expiredLanes & pinged;
+			next = expiredPinged !== 0 ? expiredPinged : getHighestPriorityLanes(pinged);
+		}
+	}
+	if (next === 0) return 0;
+	if (wipLanes !== 0 && wipLanes !== next && !includesSomeLane(root.expiredLanes, wipLanes) && getHighestPriorityLane(next) >= getHighestPriorityLane(wipLanes)) return wipLanes;
+	return getEntangledLanes(root, next);
+}
+function getEntangledLanes(root, lanes) {
+	let entangled = lanes;
+	let visited = 0;
+	let laneSet = entangled & root.entangledLanes;
+	while (laneSet !== 0) {
+		const index = laneToIndex(laneSet);
+		const lane = 1 << index;
+		entangled |= root.entanglements[index];
+		visited |= lane;
+		laneSet = entangled & root.entangledLanes & ~visited;
+	}
+	return entangled;
+}
+function markRootUpdated(root, lane) {
+	root.pendingLanes |= lane;
+	if (lane !== 268435456) {
+		root.suspendedLanes = 0;
+		root.pingedLanes = 0;
+	}
+}
+function markRootFinished(root, remainingLanes) {
+	const noLongerPending = root.pendingLanes & ~remainingLanes;
+	root.pendingLanes = remainingLanes;
+	root.suspendedLanes = 0;
+	root.pingedLanes = 0;
+	root.expiredLanes &= remainingLanes;
+	root.entangledLanes &= remainingLanes;
+	let lanes = noLongerPending;
+	while (lanes !== 0) {
+		const index = laneToIndex(lanes);
+		const lane = 1 << index;
+		root.entanglements[index] = 0;
+		root.expirationTimes[index] = -1;
+		lanes &= ~lane;
+	}
+}
+function markRootSuspended(root, lanes) {
+	root.suspendedLanes |= lanes;
+	root.pingedLanes &= ~lanes;
+	let laneSet = lanes;
+	while (laneSet !== 0) {
+		const index = laneToIndex(laneSet);
+		const lane = 1 << index;
+		root.expirationTimes[index] = -1;
+		laneSet &= ~lane;
+	}
+}
+function markRootPinged(root, lanes) {
+	root.pingedLanes |= root.suspendedLanes & lanes;
+}
+function markRootEntangled(root, lanes) {
+	root.entangledLanes |= lanes;
+	let laneSet = lanes;
+	while (laneSet !== 0) {
+		const index = laneToIndex(laneSet);
+		const lane = 1 << index;
+		root.entanglements[index] |= lanes;
+		laneSet &= ~lane;
+	}
+}
+function markStarvedLanesAsExpired(root, currentTime) {
+	let lanes = root.pendingLanes & -62914561;
+	while (lanes !== 0) {
+		const index = laneToIndex(lanes);
+		const lane = 1 << index;
+		const expiration = root.expirationTimes[index];
+		if (expiration === -1) {
+			if (!includesSomeLane(root.suspendedLanes, lane) || includesSomeLane(root.pingedLanes, lane)) root.expirationTimes[index] = computeExpirationTime(lane, currentTime);
+		} else if (expiration <= currentTime) root.expiredLanes |= lane;
+		lanes &= ~lane;
+	}
+}
+function claimNextTransitionLane() {
+	const lane = nextTransitionLane;
+	nextTransitionLane <<= 1;
+	if (!includesSomeLane(261888, nextTransitionLane)) nextTransitionLane = 256;
+	return lane;
+}
+function claimNextRetryLane() {
+	const lane = nextRetryLane;
+	nextRetryLane <<= 1;
+	if (!includesSomeLane(62914560, nextRetryLane)) nextRetryLane = RetryLane1;
+	return lane;
+}
+function isSyncLane(lane) {
+	return includesSomeLane(3, lane);
+}
+function includesOnlyTransitions(lanes) {
+	return (lanes & AllTransitionLanes) === lanes;
+}
+function getLaneSchedulerPriority(lane) {
+	if (includesSomeLane(3, lane)) return 1;
+	if (includesSomeLane(76, lane)) return 2;
+	if (includesSomeLane(71303088, lane)) return 3;
+	if (includesSomeLane(62914560, lane)) return 4;
+	return 5;
+}
+function requestUpdateLane() {
+	if (currentUpdateLane === 32 && asyncTransitionLanes !== 0) return getHighestPriorityLane(asyncTransitionLanes);
+	return currentUpdateLane;
+}
+function runWithPriority(lane, callback) {
+	const previousLane = currentUpdateLane;
+	currentUpdateLane = lane;
+	try {
+		return callback();
+	} finally {
+		currentUpdateLane = previousLane;
+	}
+}
+function runWithTransition(callback, options) {
+	return runWithTransitionLane(includesSomeLane(4194048, currentUpdateLane) ? currentUpdateLane : claimNextTransitionLane(), callback, options);
+}
+function runWithTransitionLane(lane, callback, options) {
+	const releaseTransition = transitionTypeHooks.retain?.(lane, options?.types);
+	let result;
+	try {
+		result = runWithPriority(lane, callback);
+	} catch (error) {
+		releaseTransition?.();
+		throw error;
+	}
+	if (isThenable(result)) {
+		const releaseAsyncLane = trackAsyncTransitionLane(lane);
+		let released = false;
+		const release = () => {
+			if (released) return;
+			released = true;
+			releaseAsyncLane();
+			releaseTransition?.();
+		};
+		result.then(release, release);
+	} else releaseTransition?.();
+	return result;
+}
+function trackAsyncTransitionLane(lane) {
+	const index = laneToIndex(lane);
+	asyncTransitionLaneCounts[index] += 1;
+	asyncTransitionLanes |= lane;
+	return () => releaseAsyncTransitionLane(lane, index);
+}
+function releaseAsyncTransitionLane(lane, index) {
+	asyncTransitionLaneCounts[index] = Math.max(0, asyncTransitionLaneCounts[index] - 1);
+	if (asyncTransitionLaneCounts[index] === 0) asyncTransitionLanes &= ~lane;
+}
+function computeExpirationTime(lane, currentTime) {
+	if (includesSomeLane(79, lane)) return currentTime + syncLaneExpirationMs;
+	if (includesSomeLane(4194224, lane)) return currentTime + transitionLaneExpirationMs;
+	return -1;
+}
+function laneToIndex(lanes) {
+	return 31 - Math.clz32(lanes);
+}
+//#endregion
+//#region src/fiber-traversal.ts
+function walkFiberForest(node, visitor) {
+	walkFiberTree(node, true, visitor);
+}
+function walkFiberSubtree(node, visitor) {
+	walkFiberTree(node, false, visitor);
+}
+function walkFiberTree(node, includeRootSiblings, visitor) {
+	const stack = [];
+	let cursor = node;
+	while (cursor !== null) {
+		const shouldDescend = visitor(cursor) !== false && cursor.child !== null;
+		if ((includeRootSiblings || cursor !== node) && cursor.sibling !== null) stack.push(cursor.sibling);
+		cursor = shouldDescend ? cursor.child : stack.pop() ?? null;
+	}
+}
+//#endregion
+export { runWithTransitionLane as A, clearTransientFlags as B, markRootSuspended as C, requestUpdateLane as D, mergeLanes as E, HoistedStaticFlag as F, StaticFlagsMask as I, StoreConsistencyFlag as L, tagFor as M, AssetFlag as N, runWithPriority as O, ContextPropagationFlag as P, ViewTransitionStaticFlag as R, markRootPinged as S, markStarvedLanesAsExpired as T, includesSomeLane as _, IdleHydrationLane as a, markRootEntangled as b, RetryLanes as c, claimNextTransitionLane as d, createLaneMap as f, includesOnlyTransitions as g, getNextLanes as h, DeferredLane as i, transitionTypeHooks as j, runWithTransition as k, SelectiveHydrationLane as l, getLaneSchedulerPriority as m, walkFiberSubtree as n, IdleLane as o, getHighestPriorityLane as p, AllTransitionLanes as r, OffscreenLane as s, walkFiberForest as t, claimNextRetryLane as u, isSyncLane as v, markRootUpdated as w, markRootFinished as x, laneToIndex as y, childSubtreeFlags as z };
+
+//# sourceMappingURL=fiber-traversal-B_egclZy.js.map

package/dist-development/fiber-traversal-B_egclZy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fiber-traversal-B_egclZy.js","names":[],"sources":["../src/fiber-work.ts","../src/fiber-tags.ts","../src/lanes.ts","../src/fiber-traversal.ts"],"sourcesContent":["export const NoFlags = 0;\n\n// Render emits transient work on individual fibers. Completion folds the\n// subset in SubtreeVisibleFlags into subtreeFlags, and commit interprets the\n// resulting tree summary in host order.\nexport const PlacementFlag = 1 << 0;\nexport const UpdateFlag = 1 << 1;\nexport const HydrationFlag = 1 << 2;\nexport const TextContentFlag = 1 << 3;\nexport const VisibilityFlag = 1 << 5;\nexport const DeletionFlag = 1 << 7;\nexport const EffectFlag = 1 << 9;\nexport const StoreConsistencyFlag = 1 << 11;\n// An Assets fiber owes its renderer a committed descriptor-list diff. Asset\n// work is sparse-indexed and out-of-band, so it never enters subtreeFlags.\nexport const AssetFlag = 1 << 14;\n\n// The fiber reused its committed children without cloning; render skips the\n// subtree and commit walks must not consume already-committed state below it.\nexport const AdoptedFlag = 1 << 4;\n// A host fiber assembled its children at complete-time, so placement inserts\n// the whole subtree once instead of placing each child independently.\nexport const AssembledFlag = 1 << 6;\n// Membership in the root's sparse commit index. Recording is idempotent, and\n// rollback clears this bit from every discarded index entry.\nexport const CommitIndexedFlag = 1 << 8;\n// This render already propagated changed providers through the subtree.\nexport const ContextPropagationFlag = 1 << 10;\n// Static capabilities survive commits and bailouts. A subtree capability is\n// a durable fact about tree shape, unlike transient work owed by this commit.\nexport const ViewTransitionStaticFlag = 1 << 12;\n// The host resolved this fiber to an out-of-band instance. Placement is fixed\n// for the fiber's lifetime and survives updates without reclassifying props.\nexport const HoistedStaticFlag = 1 << 13;\n\nexport type Flag = number;\n\nexport const MutationMask =\n  PlacementFlag | UpdateFlag | HydrationFlag | TextContentFlag | VisibilityFlag;\nexport const HostUpdateMask = UpdateFlag | TextContentFlag;\n\n// These marks never enter subtreeFlags. Host updates are found through the\n// sparse commit index; membership and cache marks are not descendant work.\nconst SubtreeMaskedFlags =\n  AssetFlag | CommitIndexedFlag | HostUpdateMask | HoistedStaticFlag;\n// Static facts survive commits and bailouts so adopted and deleted subtrees\n// remain searchable without rebuilding their summaries.\nexport const StaticFlagsMask = ViewTransitionStaticFlag | HoistedStaticFlag;\n\nexport function childSubtreeFlags(node: {\n  flags: Flag;\n  subtreeFlags: Flag;\n}): Flag {\n  return (node.flags & ~SubtreeMaskedFlags) | node.subtreeFlags;\n}\n\nexport function clearTransientFlags(node: {\n  flags: Flag;\n  subtreeFlags: Flag;\n}): void {\n  node.flags &= StaticFlagsMask;\n  node.subtreeFlags &= StaticFlagsMask;\n}\n","import { type FigElement, Fragment } from \"@bgub/fig\";\nimport {\n  isActivity,\n  isAssets,\n  isContext,\n  isErrorBoundary,\n  isSuspense,\n  isViewTransition,\n} from \"@bgub/fig/internal\";\n\nexport const RootTag = 0;\nexport const HostTag = 1;\nexport const TextTag = 2;\nexport const FunctionTag = 3;\nexport const FragmentTag = 4;\nexport const ContextProviderTag = 5;\nexport const SuspenseTag = 6;\nexport const ErrorBoundaryTag = 7;\nexport const PortalTag = 8;\nexport const AssetsTag = 9;\nexport const ActivityTag = 10;\nexport const ViewTransitionTag = 11;\nexport const ThenableTag = 12;\n\nexport type Tag =\n  | typeof RootTag\n  | typeof HostTag\n  | typeof TextTag\n  | typeof FunctionTag\n  | typeof FragmentTag\n  | typeof ContextProviderTag\n  | typeof SuspenseTag\n  | typeof ErrorBoundaryTag\n  | typeof PortalTag\n  | typeof AssetsTag\n  | typeof ActivityTag\n  | typeof ViewTransitionTag\n  | typeof ThenableTag;\n\nexport function tagFor(element: FigElement): Tag {\n  if (typeof element.type === \"string\") return HostTag;\n  if (element.type === Fragment) return FragmentTag;\n  if (isAssets(element.type)) return AssetsTag;\n  if (isContext(element.type)) return ContextProviderTag;\n  if (isSuspense(element.type)) return SuspenseTag;\n  if (isActivity(element.type)) return ActivityTag;\n  if (isErrorBoundary(element.type)) return ErrorBoundaryTag;\n  if (isViewTransition(element.type)) return ViewTransitionTag;\n  return FunctionTag;\n}\n","import { isThenable, type TransitionOptions } from \"@bgub/fig/internal\";\nimport {\n  IdlePriority,\n  ImmediatePriority,\n  LowPriority,\n  NormalPriority,\n  type PriorityLevel,\n  UserBlockingPriority,\n} from \"./scheduler.ts\";\n\nexport type Lane = number;\nexport type Lanes = number;\nexport type LaneMap<T extends number> = T[];\n\nexport const TotalLanes = 31;\nexport const NoTimestamp = -1;\nexport const NoLane = 0;\nexport const NoLanes = 0;\n\nexport const SyncHydrationLane = 1 << 0;\nexport const SyncLane = 1 << 1;\nexport const InputContinuousHydrationLane = 1 << 2;\nexport const InputContinuousLane = 1 << 3;\nexport const DefaultHydrationLane = 1 << 4;\nexport const DefaultLane = 1 << 5;\nexport const GestureLane = 1 << 6;\nexport const TransitionHydrationLane = 1 << 7;\nexport const TransitionLane1 = 1 << 8;\nexport const TransitionLane2 = 1 << 9;\nexport const TransitionLane3 = 1 << 10;\nexport const TransitionLane4 = 1 << 11;\nexport const TransitionLane5 = 1 << 12;\nexport const TransitionLane6 = 1 << 13;\nexport const TransitionLane7 = 1 << 14;\nexport const TransitionLane8 = 1 << 15;\nexport const TransitionLane9 = 1 << 16;\nexport const TransitionLane10 = 1 << 17;\nexport const TransitionLane11 = 1 << 18;\nexport const TransitionLane12 = 1 << 19;\nexport const TransitionLane13 = 1 << 20;\nexport const TransitionLane14 = 1 << 21;\nexport const RetryLane1 = 1 << 22;\nexport const RetryLane2 = 1 << 23;\nexport const RetryLane3 = 1 << 24;\nexport const RetryLane4 = 1 << 25;\nexport const SelectiveHydrationLane = 1 << 26;\nexport const IdleHydrationLane = 1 << 27;\nexport const IdleLane = 1 << 28;\nexport const OffscreenLane = 1 << 29;\nexport const DeferredLane = 1 << 30;\n\nexport const TransitionLane = TransitionLane1;\n\nexport const TransitionLanes =\n  TransitionLane1 |\n  TransitionLane2 |\n  TransitionLane3 |\n  TransitionLane4 |\n  TransitionLane5 |\n  TransitionLane6 |\n  TransitionLane7 |\n  TransitionLane8 |\n  TransitionLane9 |\n  TransitionLane10;\nexport const TransitionDeferredLanes =\n  TransitionLane11 | TransitionLane12 | TransitionLane13 | TransitionLane14;\nexport const AllTransitionLanes = TransitionLanes | TransitionDeferredLanes;\nexport const RetryLanes = RetryLane1 | RetryLane2 | RetryLane3 | RetryLane4;\nexport const IdleLanes = IdleHydrationLane | IdleLane | OffscreenLane;\nexport const NonIdleLanes = (1 << 27) - 1;\nexport const HydrationLanes =\n  SyncHydrationLane |\n  InputContinuousHydrationLane |\n  DefaultHydrationLane |\n  TransitionHydrationLane |\n  SelectiveHydrationLane |\n  IdleHydrationLane;\n\nexport type LanePriority =\n  | \"sync\"\n  | \"input\"\n  | \"default\"\n  | \"gesture\"\n  | \"transition\"\n  | \"retry\"\n  | \"idle\"\n  | \"offscreen\"\n  | \"deferred\";\n\nexport interface LaneRoot {\n  pendingLanes: Lanes;\n  suspendedLanes: Lanes;\n  pingedLanes: Lanes;\n  expiredLanes: Lanes;\n  entangledLanes: Lanes;\n  entanglements: LaneMap<Lanes>;\n  expirationTimes: LaneMap<number>;\n}\n\nconst syncLaneExpirationMs = 250;\nconst transitionLaneExpirationMs = 5_000;\n\nlet currentUpdateLane: Lane = DefaultLane;\nlet nextTransitionLane: Lane = TransitionLane1;\nlet nextRetryLane: Lane = RetryLane1;\n// JavaScript does not expose per-continuation async context in browsers yet, so\n// async transitions keep their lane ambient while the returned thenable is\n// pending. Explicit event/sync priorities still override this fallback.\nlet asyncTransitionLanes: Lanes = NoLanes;\nconst asyncTransitionLaneCounts = createLaneMap<number>(0);\n\ninterface TransitionTypeHooks {\n  retain?(lane: Lane, types: readonly string[] | undefined): () => void;\n  record?(root: object, lane: Lane): void;\n  complete?(root: object, remainingLanes: Lanes): void;\n}\n\n// The optional View Transition entry installs these hooks. Keeping the state\n// behind that entry leaves ordinary renderer bundles with only the hook calls.\nexport const transitionTypeHooks: TransitionTypeHooks = {};\n\nexport function createLaneMap<T extends number>(initial: T): LaneMap<T> {\n  return Array.from({ length: TotalLanes }, () => initial);\n}\n\nexport function mergeLanes(a: Lanes, b: Lanes): Lanes {\n  return a | b;\n}\n\nexport function includesSomeLane(set: Lanes, subset: Lanes): boolean {\n  return (set & subset) !== NoLanes;\n}\n\nexport function getHighestPriorityLane(lanes: Lanes): Lane {\n  return lanes & -lanes;\n}\n\nexport function getHighestPriorityLanes(lanes: Lanes): Lanes {\n  const lane = getHighestPriorityLane(lanes);\n\n  if (includesSomeLane(AllTransitionLanes, lane)) {\n    return lanes & AllTransitionLanes;\n  }\n\n  if (includesSomeLane(RetryLanes, lane)) {\n    return lanes & RetryLanes;\n  }\n\n  return lane;\n}\n\nexport function getNextLanes(root: LaneRoot, wipLanes: Lanes = NoLanes): Lanes {\n  const pending = root.pendingLanes;\n  if (pending === NoLanes) return NoLanes;\n\n  const unblocked = pending & ~root.suspendedLanes;\n  const pinged = pending & root.pingedLanes;\n  let next = root.expiredLanes & unblocked;\n  if (next === NoLanes) {\n    next = getHighestPriorityLanes(unblocked);\n\n    if (next === NoLanes) {\n      // Expired pinged work wins over fresh pinged work; NoLanes is 0, so the\n      // fallback only runs when no expired pinged lane exists.\n      const expiredPinged = root.expiredLanes & pinged;\n      next =\n        expiredPinged !== NoLanes\n          ? expiredPinged\n          : getHighestPriorityLanes(pinged);\n    }\n  }\n\n  if (next === NoLanes) return NoLanes;\n\n  if (\n    wipLanes !== NoLanes &&\n    wipLanes !== next &&\n    !includesSomeLane(root.expiredLanes, wipLanes) &&\n    getHighestPriorityLane(next) >= getHighestPriorityLane(wipLanes)\n  ) {\n    return wipLanes;\n  }\n\n  return getEntangledLanes(root, next);\n}\n\nexport function getEntangledLanes(root: LaneRoot, lanes: Lanes): Lanes {\n  let entangled = lanes;\n  let visited = NoLanes;\n  let laneSet = entangled & root.entangledLanes;\n\n  while (laneSet !== NoLanes) {\n    const index = laneToIndex(laneSet);\n    const lane = 1 << index;\n    entangled |= root.entanglements[index];\n    visited |= lane;\n    laneSet = entangled & root.entangledLanes & ~visited;\n  }\n\n  return entangled;\n}\n\nexport function markRootUpdated(root: LaneRoot, lane: Lane): void {\n  root.pendingLanes |= lane;\n\n  if (lane !== IdleLane) {\n    root.suspendedLanes = NoLanes;\n    root.pingedLanes = NoLanes;\n  }\n}\n\nexport function markRootFinished(root: LaneRoot, remainingLanes: Lanes): void {\n  const noLongerPending = root.pendingLanes & ~remainingLanes;\n  root.pendingLanes = remainingLanes;\n  root.suspendedLanes = NoLanes;\n  root.pingedLanes = NoLanes;\n  root.expiredLanes &= remainingLanes;\n  root.entangledLanes &= remainingLanes;\n\n  let lanes = noLongerPending;\n  while (lanes !== NoLanes) {\n    const index = laneToIndex(lanes);\n    const lane = 1 << index;\n    root.entanglements[index] = NoLanes;\n    root.expirationTimes[index] = NoTimestamp;\n    lanes &= ~lane;\n  }\n}\n\nexport function markRootSuspended(root: LaneRoot, lanes: Lanes): void {\n  root.suspendedLanes |= lanes;\n  root.pingedLanes &= ~lanes;\n\n  let laneSet = lanes;\n  while (laneSet !== NoLanes) {\n    const index = laneToIndex(laneSet);\n    const lane = 1 << index;\n    root.expirationTimes[index] = NoTimestamp;\n    laneSet &= ~lane;\n  }\n}\n\nexport function markRootPinged(root: LaneRoot, lanes: Lanes): void {\n  root.pingedLanes |= root.suspendedLanes & lanes;\n}\n\nexport function markRootEntangled(root: LaneRoot, lanes: Lanes): void {\n  root.entangledLanes |= lanes;\n\n  let laneSet = lanes;\n  while (laneSet !== NoLanes) {\n    const index = laneToIndex(laneSet);\n    const lane = 1 << index;\n    root.entanglements[index] |= lanes;\n    laneSet &= ~lane;\n  }\n}\n\nexport function markStarvedLanesAsExpired(\n  root: LaneRoot,\n  currentTime: number,\n): void {\n  let lanes = root.pendingLanes & ~RetryLanes;\n\n  while (lanes !== NoLanes) {\n    const index = laneToIndex(lanes);\n    const lane = 1 << index;\n    const expiration = root.expirationTimes[index];\n\n    if (expiration === NoTimestamp) {\n      if (\n        !includesSomeLane(root.suspendedLanes, lane) ||\n        includesSomeLane(root.pingedLanes, lane)\n      ) {\n        root.expirationTimes[index] = computeExpirationTime(lane, currentTime);\n      }\n    } else if (expiration <= currentTime) {\n      root.expiredLanes |= lane;\n    }\n\n    lanes &= ~lane;\n  }\n}\n\nexport function claimNextTransitionLane(): Lane {\n  const lane = nextTransitionLane;\n  nextTransitionLane <<= 1;\n\n  if (!includesSomeLane(TransitionLanes, nextTransitionLane)) {\n    nextTransitionLane = TransitionLane1;\n  }\n\n  return lane;\n}\n\nexport function claimNextRetryLane(): Lane {\n  const lane = nextRetryLane;\n  nextRetryLane <<= 1;\n\n  if (!includesSomeLane(RetryLanes, nextRetryLane)) {\n    nextRetryLane = RetryLane1;\n  }\n\n  return lane;\n}\n\nexport function isSyncLane(lane: Lane): boolean {\n  return includesSomeLane(SyncHydrationLane | SyncLane, lane);\n}\n\nexport function includesOnlyTransitions(lanes: Lanes): boolean {\n  return (lanes & AllTransitionLanes) === lanes;\n}\n\nexport function getLanePriority(lane: Lane): LanePriority {\n  if (includesSomeLane(SyncHydrationLane | SyncLane, lane)) return \"sync\";\n  if (\n    includesSomeLane(InputContinuousHydrationLane | InputContinuousLane, lane)\n  ) {\n    return \"input\";\n  }\n  if (\n    includesSomeLane(\n      DefaultHydrationLane | DefaultLane | SelectiveHydrationLane,\n      lane,\n    )\n  ) {\n    return \"default\";\n  }\n  if (includesSomeLane(GestureLane, lane)) return \"gesture\";\n  if (includesSomeLane(AllTransitionLanes | TransitionHydrationLane, lane)) {\n    return \"transition\";\n  }\n  if (includesSomeLane(RetryLanes, lane)) return \"retry\";\n  if (includesSomeLane(DeferredLane, lane)) return \"deferred\";\n  if (includesSomeLane(OffscreenLane, lane)) return \"offscreen\";\n  return \"idle\";\n}\n\n// Mask checks directly instead of via getLanePriority's string names, so the\n// name table stays out of production bundles (getLanePriority survives for\n// tests and diagnostics only). `lane` is a single bit (highest-priority\n// lane), so merging the groups is exact.\nexport function getLaneSchedulerPriority(lane: Lane): PriorityLevel {\n  if (includesSomeLane(SyncHydrationLane | SyncLane, lane)) {\n    return ImmediatePriority;\n  }\n  if (\n    includesSomeLane(\n      InputContinuousHydrationLane | InputContinuousLane | GestureLane,\n      lane,\n    )\n  ) {\n    return UserBlockingPriority;\n  }\n  // SelectiveHydrationLane is non-idle work (event-triggered hydration of a\n  // dehydrated boundary): schedule it at Normal like React, or it starves\n  // behind every transition and never gets a scheduler timeout.\n  if (\n    includesSomeLane(\n      DefaultHydrationLane |\n        DefaultLane |\n        AllTransitionLanes |\n        TransitionHydrationLane |\n        SelectiveHydrationLane,\n      lane,\n    )\n  ) {\n    return NormalPriority;\n  }\n  if (includesSomeLane(RetryLanes, lane)) return LowPriority;\n  return IdlePriority;\n}\n\nexport function requestUpdateLane(): Lane {\n  if (currentUpdateLane === DefaultLane && asyncTransitionLanes !== NoLanes) {\n    return getHighestPriorityLane(asyncTransitionLanes);\n  }\n\n  return currentUpdateLane;\n}\n\nexport function runWithPriority<T>(lane: Lane, callback: () => T): T {\n  const previousLane = currentUpdateLane;\n  currentUpdateLane = lane;\n\n  try {\n    return callback();\n  } finally {\n    currentUpdateLane = previousLane;\n  }\n}\n\nexport function runWithTransition<T>(\n  callback: () => T,\n  options?: TransitionOptions,\n): T {\n  const lane = includesSomeLane(AllTransitionLanes, currentUpdateLane)\n    ? currentUpdateLane\n    : claimNextTransitionLane();\n\n  return runWithTransitionLane(lane, callback, options);\n}\n\nexport function runWithTransitionLane<T>(\n  lane: Lane,\n  callback: () => T,\n  options?: TransitionOptions,\n): T {\n  const releaseTransition = transitionTypeHooks.retain?.(lane, options?.types);\n  let result: T;\n  try {\n    result = runWithPriority(lane, callback);\n  } catch (error) {\n    releaseTransition?.();\n    throw error;\n  }\n\n  if (isThenable(result)) {\n    const releaseAsyncLane = trackAsyncTransitionLane(lane);\n    let released = false;\n    const release = (): void => {\n      if (released) return;\n      released = true;\n      releaseAsyncLane();\n      releaseTransition?.();\n    };\n    result.then(release, release);\n  } else {\n    releaseTransition?.();\n  }\n\n  return result;\n}\n\nfunction trackAsyncTransitionLane(lane: Lane): () => void {\n  const index = laneToIndex(lane);\n  asyncTransitionLaneCounts[index] += 1;\n  asyncTransitionLanes |= lane;\n\n  return () => releaseAsyncTransitionLane(lane, index);\n}\n\nfunction releaseAsyncTransitionLane(lane: Lane, index: number): void {\n  asyncTransitionLaneCounts[index] = Math.max(\n    0,\n    asyncTransitionLaneCounts[index] - 1,\n  );\n\n  if (asyncTransitionLaneCounts[index] === 0) {\n    asyncTransitionLanes &= ~lane;\n  }\n}\n\nfunction computeExpirationTime(lane: Lane, currentTime: number): number {\n  if (\n    includesSomeLane(\n      SyncHydrationLane |\n        SyncLane |\n        InputContinuousHydrationLane |\n        InputContinuousLane |\n        GestureLane,\n      lane,\n    )\n  ) {\n    return currentTime + syncLaneExpirationMs;\n  }\n\n  if (\n    includesSomeLane(\n      DefaultHydrationLane |\n        DefaultLane |\n        TransitionHydrationLane |\n        AllTransitionLanes,\n      lane,\n    )\n  ) {\n    return currentTime + transitionLaneExpirationMs;\n  }\n\n  return NoTimestamp;\n}\n\nexport function laneToIndex(lanes: Lanes): number {\n  return 31 - Math.clz32(lanes);\n}\n","interface TreeNode<Node> {\n  child: Node | null;\n  sibling: Node | null;\n}\n\nexport function walkFiberForest<Node extends TreeNode<Node>>(\n  node: Node | null,\n  visitor: (node: Node) => boolean | void,\n): void {\n  walkFiberTree(node, true, visitor);\n}\n\nexport function walkFiberSubtree<Node extends TreeNode<Node>>(\n  node: Node,\n  visitor: (node: Node) => boolean | void,\n): void {\n  walkFiberTree(node, false, visitor);\n}\n\n// The explicit sibling stack bounds a subtree walk even when a detached\n// deletion still points at kept siblings through its old fiber links.\nfunction walkFiberTree<Node extends TreeNode<Node>>(\n  node: Node | null,\n  includeRootSiblings: boolean,\n  visitor: (node: Node) => boolean | void,\n): void {\n  const stack: Node[] = [];\n  let cursor = node;\n\n  while (cursor !== null) {\n    const shouldDescend = visitor(cursor) !== false && cursor.child !== null;\n\n    if ((includeRootSiblings || cursor !== node) && cursor.sibling !== null) {\n      stack.push(cursor.sibling);\n    }\n\n    cursor = shouldDescend ? cursor.child : (stack.pop() ?? null);\n  }\n}\n"],"mappings":";;;AAYA,MAAa,uBAAuB;AAGpC,MAAa,YAAY;AAYzB,MAAa,yBAAyB;AAGtC,MAAa,2BAA2B;AAGxC,MAAa,oBAAoB;AAcjC,MAAa,kBAAkB;AAE/B,SAAgB,kBAAkB,MAGzB;CACP,OAAQ,KAAK,QAAQ,SAAuB,KAAK;AACnD;AAEA,SAAgB,oBAAoB,MAG3B;CACP,KAAK,SAAS;CACd,KAAK,gBAAgB;AACvB;ACvBA,SAAgB,OAAO,SAA0B;CAC/C,IAAI,OAAO,QAAQ,SAAS,UAAU,OAAA;CACtC,IAAI,QAAQ,SAAS,UAAU,OAAA;CAC/B,IAAI,SAAS,QAAQ,IAAI,GAAG,OAAA;CAC5B,IAAI,UAAU,QAAQ,IAAI,GAAG,OAAA;CAC7B,IAAI,WAAW,QAAQ,IAAI,GAAG,OAAA;CAC9B,IAAI,WAAW,QAAQ,IAAI,GAAG,OAAA;CAC9B,IAAI,gBAAgB,QAAQ,IAAI,GAAG,OAAA;CACnC,IAAI,iBAAiB,QAAQ,IAAI,GAAG,OAAA;CACpC,OAAA;AACF;ACRA,MAAa,aAAa,KAAK;AAI/B,MAAa,yBAAyB,KAAK;AAC3C,MAAa,oBAAoB,KAAK;AACtC,MAAa,WAAW,KAAK;AAC7B,MAAa,gBAAgB,KAAK;AAClC,MAAa,eAAe,KAAK;AAiBjC,MAAa,qBAAqB;AAClC,MAAa,aAAa;AAgC1B,MAAM,uBAAuB;AAC7B,MAAM,6BAA6B;AAEnC,IAAI,oBAAA;AACJ,IAAI,qBAAA;AACJ,IAAI,gBAAsB;AAI1B,IAAI,uBAAA;AACJ,MAAM,4BAA4B,cAAsB,CAAC;AAUzD,MAAa,sBAA2C,CAAC;AAEzD,SAAgB,cAAgC,SAAwB;CACtE,OAAO,MAAM,KAAK,EAAE,QAAA,GAAmB,SAAS,OAAO;AACzD;AAEA,SAAgB,WAAW,GAAU,GAAiB;CACpD,OAAO,IAAI;AACb;AAEA,SAAgB,iBAAiB,KAAY,QAAwB;CACnE,QAAQ,MAAM,YAAA;AAChB;AAEA,SAAgB,uBAAuB,OAAoB;CACzD,OAAO,QAAQ,CAAC;AAClB;AAEA,SAAgB,wBAAwB,OAAqB;CAC3D,MAAM,OAAO,uBAAuB,KAAK;CAEzC,IAAI,iBAAA,SAAqC,IAAI,GAC3C,OAAO,QAAQ;CAGjB,IAAI,iBAAA,UAA6B,IAAI,GACnC,OAAO,QAAQ;CAGjB,OAAO;AACT;AAEA,SAAgB,aAAa,MAAgB,WAAA,GAAkC;CAC7E,MAAM,UAAU,KAAK;CACrB,IAAI,YAAA,GAAqB,OAAA;CAEzB,MAAM,YAAY,UAAU,CAAC,KAAK;CAClC,MAAM,SAAS,UAAU,KAAK;CAC9B,IAAI,OAAO,KAAK,eAAe;CAC/B,IAAI,SAAA,GAAkB;EACpB,OAAO,wBAAwB,SAAS;EAExC,IAAI,SAAA,GAAkB;GAGpB,MAAM,gBAAgB,KAAK,eAAe;GAC1C,OACE,kBAAA,IACI,gBACA,wBAAwB,MAAM;EACtC;CACF;CAEA,IAAI,SAAA,GAAkB,OAAA;CAEtB,IACE,aAAA,KACA,aAAa,QACb,CAAC,iBAAiB,KAAK,cAAc,QAAQ,KAC7C,uBAAuB,IAAI,KAAK,uBAAuB,QAAQ,GAE/D,OAAO;CAGT,OAAO,kBAAkB,MAAM,IAAI;AACrC;AAEA,SAAgB,kBAAkB,MAAgB,OAAqB;CACrE,IAAI,YAAY;CAChB,IAAI,UAAA;CACJ,IAAI,UAAU,YAAY,KAAK;CAE/B,OAAO,YAAA,GAAqB;EAC1B,MAAM,QAAQ,YAAY,OAAO;EACjC,MAAM,OAAO,KAAK;EAClB,aAAa,KAAK,cAAc;EAChC,WAAW;EACX,UAAU,YAAY,KAAK,iBAAiB,CAAC;CAC/C;CAEA,OAAO;AACT;AAEA,SAAgB,gBAAgB,MAAgB,MAAkB;CAChE,KAAK,gBAAgB;CAErB,IAAI,SAAA,WAAmB;EACrB,KAAK,iBAAA;EACL,KAAK,cAAA;CACP;AACF;AAEA,SAAgB,iBAAiB,MAAgB,gBAA6B;CAC5E,MAAM,kBAAkB,KAAK,eAAe,CAAC;CAC7C,KAAK,eAAe;CACpB,KAAK,iBAAA;CACL,KAAK,cAAA;CACL,KAAK,gBAAgB;CACrB,KAAK,kBAAkB;CAEvB,IAAI,QAAQ;CACZ,OAAO,UAAA,GAAmB;EACxB,MAAM,QAAQ,YAAY,KAAK;EAC/B,MAAM,OAAO,KAAK;EAClB,KAAK,cAAc,SAAA;EACnB,KAAK,gBAAgB,SAAA;EACrB,SAAS,CAAC;CACZ;AACF;AAEA,SAAgB,kBAAkB,MAAgB,OAAoB;CACpE,KAAK,kBAAkB;CACvB,KAAK,eAAe,CAAC;CAErB,IAAI,UAAU;CACd,OAAO,YAAA,GAAqB;EAC1B,MAAM,QAAQ,YAAY,OAAO;EACjC,MAAM,OAAO,KAAK;EAClB,KAAK,gBAAgB,SAAA;EACrB,WAAW,CAAC;CACd;AACF;AAEA,SAAgB,eAAe,MAAgB,OAAoB;CACjE,KAAK,eAAe,KAAK,iBAAiB;AAC5C;AAEA,SAAgB,kBAAkB,MAAgB,OAAoB;CACpE,KAAK,kBAAkB;CAEvB,IAAI,UAAU;CACd,OAAO,YAAA,GAAqB;EAC1B,MAAM,QAAQ,YAAY,OAAO;EACjC,MAAM,OAAO,KAAK;EAClB,KAAK,cAAc,UAAU;EAC7B,WAAW,CAAC;CACd;AACF;AAEA,SAAgB,0BACd,MACA,aACM;CACN,IAAI,QAAQ,KAAK,eAAe;CAEhC,OAAO,UAAA,GAAmB;EACxB,MAAM,QAAQ,YAAY,KAAK;EAC/B,MAAM,OAAO,KAAK;EAClB,MAAM,aAAa,KAAK,gBAAgB;EAExC,IAAI,eAAA;OAEA,CAAC,iBAAiB,KAAK,gBAAgB,IAAI,KAC3C,iBAAiB,KAAK,aAAa,IAAI,GAEvC,KAAK,gBAAgB,SAAS,sBAAsB,MAAM,WAAW;EAAA,OAElE,IAAI,cAAc,aACvB,KAAK,gBAAgB;EAGvB,SAAS,CAAC;CACZ;AACF;AAEA,SAAgB,0BAAgC;CAC9C,MAAM,OAAO;CACb,uBAAuB;CAEvB,IAAI,CAAC,iBAAA,QAAkC,kBAAkB,GACvD,qBAAA;CAGF,OAAO;AACT;AAEA,SAAgB,qBAA2B;CACzC,MAAM,OAAO;CACb,kBAAkB;CAElB,IAAI,CAAC,iBAAA,UAA6B,aAAa,GAC7C,gBAAgB;CAGlB,OAAO;AACT;AAEA,SAAgB,WAAW,MAAqB;CAC9C,OAAO,iBAAiB,GAA8B,IAAI;AAC5D;AAEA,SAAgB,wBAAwB,OAAuB;CAC7D,QAAQ,QAAQ,wBAAwB;AAC1C;AA+BA,SAAgB,yBAAyB,MAA2B;CAClE,IAAI,iBAAiB,GAA8B,IAAI,GACrD,OAAA;CAEF,IACE,iBACE,IACA,IACF,GAEA,OAAA;CAKF,IACE,iBACE,UAKA,IACF,GAEA,OAAA;CAEF,IAAI,iBAAA,UAA6B,IAAI,GAAG,OAAA;CACxC,OAAA;AACF;AAEA,SAAgB,oBAA0B;CACxC,IAAI,sBAAA,MAAqC,yBAAA,GACvC,OAAO,uBAAuB,oBAAoB;CAGpD,OAAO;AACT;AAEA,SAAgB,gBAAmB,MAAY,UAAsB;CACnE,MAAM,eAAe;CACrB,oBAAoB;CAEpB,IAAI;EACF,OAAO,SAAS;CAClB,UAAU;EACR,oBAAoB;CACtB;AACF;AAEA,SAAgB,kBACd,UACA,SACG;CAKH,OAAO,sBAJM,iBAAA,SAAqC,iBAAiB,IAC/D,oBACA,wBAAwB,GAEO,UAAU,OAAO;AACtD;AAEA,SAAgB,sBACd,MACA,UACA,SACG;CACH,MAAM,oBAAoB,oBAAoB,SAAS,MAAM,SAAS,KAAK;CAC3E,IAAI;CACJ,IAAI;EACF,SAAS,gBAAgB,MAAM,QAAQ;CACzC,SAAS,OAAO;EACd,oBAAoB;EACpB,MAAM;CACR;CAEA,IAAI,WAAW,MAAM,GAAG;EACtB,MAAM,mBAAmB,yBAAyB,IAAI;EACtD,IAAI,WAAW;EACf,MAAM,gBAAsB;GAC1B,IAAI,UAAU;GACd,WAAW;GACX,iBAAiB;GACjB,oBAAoB;EACtB;EACA,OAAO,KAAK,SAAS,OAAO;CAC9B,OACE,oBAAoB;CAGtB,OAAO;AACT;AAEA,SAAS,yBAAyB,MAAwB;CACxD,MAAM,QAAQ,YAAY,IAAI;CAC9B,0BAA0B,UAAU;CACpC,wBAAwB;CAExB,aAAa,2BAA2B,MAAM,KAAK;AACrD;AAEA,SAAS,2BAA2B,MAAY,OAAqB;CACnE,0BAA0B,SAAS,KAAK,IACtC,GACA,0BAA0B,SAAS,CACrC;CAEA,IAAI,0BAA0B,WAAW,GACvC,wBAAwB,CAAC;AAE7B;AAEA,SAAS,sBAAsB,MAAY,aAA6B;CACtE,IACE,iBACE,IAKA,IACF,GAEA,OAAO,cAAc;CAGvB,IACE,iBACE,SAIA,IACF,GAEA,OAAO,cAAc;CAGvB,OAAA;AACF;AAEA,SAAgB,YAAY,OAAsB;CAChD,OAAO,KAAK,KAAK,MAAM,KAAK;AAC9B;;;ACheA,SAAgB,gBACd,MACA,SACM;CACN,cAAc,MAAM,MAAM,OAAO;AACnC;AAEA,SAAgB,iBACd,MACA,SACM;CACN,cAAc,MAAM,OAAO,OAAO;AACpC;AAIA,SAAS,cACP,MACA,qBACA,SACM;CACN,MAAM,QAAgB,CAAC;CACvB,IAAI,SAAS;CAEb,OAAO,WAAW,MAAM;EACtB,MAAM,gBAAgB,QAAQ,MAAM,MAAM,SAAS,OAAO,UAAU;EAEpE,KAAK,uBAAuB,WAAW,SAAS,OAAO,YAAY,MACjE,MAAM,KAAK,OAAO,OAAO;EAG3B,SAAS,gBAAgB,OAAO,QAAS,MAAM,IAAI,KAAK;CAC1D;AACF"}