@fictjs/runtime 0.7.0 → 0.9.0

package/dist/internal.js

@@ -1,13 +1,18 @@
+import {
+  createKeyedList,
+  isNodeBetweenMarkers,
+  moveNodesBefore,
+  reconcileArrays
+} from "./chunk-N6ODUM2Y.js";
 import {
   runInScope
-} from "./chunk-TLDT76RV.js";
+} from "./chunk-FVX77557.js";
 import {
   Fragment,
   __fictProp,
   __fictPropsRest,
   addEventListener,
   assign,
-  batch,
   bindAttribute,
   bindClass,
   bindEvent,
@@ -28,7 +33,6 @@ import {
   insert,
   insertBetween,
   insertNodesBefore,
-  isHydratingActive,
   isReactive,
   keyed,
   mergeProps,
@@ -46,14 +50,14 @@ import {
   spread,
   template,
   toNodeArray,
-  unwrap,
-  withHydrationRange
-} from "./chunk-4LCHQ7U4.js";
+  unwrap
+} from "./chunk-T2LNV5Q5.js";
 import {
   Aliases,
   BooleanAttributes,
   ChildProperties,
   DelegatedEvents,
+  FICT_SSR_SNAPSHOT_SCHEMA_VERSION,
   Properties,
   SVGElements,
   SVGNamespace,
@@ -96,766 +100,22 @@ import {
   createEffect,
   createMemo,
   createRenderEffect,
-  createRootContext,
   createSelector,
   createStore,
   deserializeValue,
-  destroyRoot,
-  effectScope,
-  flush,
-  flushOnMount,
-  getCurrentRoot,
   getPropAlias,
   isStoreProxy,
   onDestroy,
-  popRoot,
-  pushRoot,
   serializeValue,
-  setActiveSub,
   signal,
   unwrapStore
-} from "./chunk-7YQK3XKY.js";
-
-// src/reconcile.ts
-function reconcileArrays(parentNode, a, b) {
-  const bLength = b.length;
-  let aEnd = a.length;
-  let bEnd = bLength;
-  let aStart = 0;
-  let bStart = 0;
-  const after = aEnd > 0 ? a[aEnd - 1].nextSibling : null;
-  let map = null;
-  while (aStart < aEnd || bStart < bEnd) {
-    if (a[aStart] === b[bStart]) {
-      aStart++;
-      bStart++;
-      continue;
-    }
-    while (a[aEnd - 1] === b[bEnd - 1]) {
-      aEnd--;
-      bEnd--;
-    }
-    if (aEnd === aStart) {
-      const node = bEnd < bLength ? bStart ? b[bStart - 1].nextSibling : b[bEnd - bStart] ?? null : after;
-      const count = bEnd - bStart;
-      const doc = parentNode.ownerDocument;
-      if (count > 1 && doc) {
-        const frag = doc.createDocumentFragment();
-        for (let i = bStart; i < bEnd; i++) {
-          frag.appendChild(b[i]);
-        }
-        parentNode.insertBefore(frag, node);
-        bStart = bEnd;
-      } else {
-        while (bStart < bEnd) {
-          parentNode.insertBefore(b[bStart++], node);
-        }
-      }
-    } else if (bEnd === bStart) {
-      while (aStart < aEnd) {
-        const nodeToRemove = a[aStart];
-        if (!map || !map.has(nodeToRemove)) {
-          nodeToRemove.parentNode?.removeChild(nodeToRemove);
-        }
-        aStart++;
-      }
-    } else if (a[aStart] === b[bEnd - 1] && b[bStart] === a[aEnd - 1]) {
-      const node = a[--aEnd].nextSibling;
-      parentNode.insertBefore(b[bStart++], a[aStart++].nextSibling);
-      parentNode.insertBefore(b[--bEnd], node);
-      a[aEnd] = b[bEnd];
-    } else {
-      if (!map) {
-        map = /* @__PURE__ */ new Map();
-        let i = bStart;
-        while (i < bEnd) {
-          map.set(b[i], i++);
-        }
-      }
-      const index = map.get(a[aStart]);
-      if (index != null) {
-        if (bStart < index && index < bEnd) {
-          let i = aStart;
-          let sequence = 1;
-          let t;
-          while (++i < aEnd && i < bEnd) {
-            t = map.get(a[i]);
-            if (t == null || t !== index + sequence) break;
-            sequence++;
-          }
-          if (sequence > index - bStart) {
-            const node = a[aStart];
-            while (bStart < index) {
-              parentNode.insertBefore(b[bStart++], node);
-            }
-          } else {
-            parentNode.replaceChild(b[bStart++], a[aStart++]);
-          }
-        } else {
-          aStart++;
-        }
-      } else {
-        const nodeToRemove = a[aStart++];
-        nodeToRemove.parentNode?.removeChild(nodeToRemove);
-      }
-    }
-  }
-}
-
-// src/list-helpers.ts
-var isDev = typeof __DEV__ !== "undefined" ? __DEV__ : typeof process === "undefined" || process.env?.NODE_ENV !== "production";
-var isShadowRoot = (node) => typeof ShadowRoot !== "undefined" && node instanceof ShadowRoot;
-function moveNodesBefore(parent, nodes, anchor) {
-  for (let i = nodes.length - 1; i >= 0; i--) {
-    const node = nodes[i];
-    if (!node || !(node instanceof Node)) {
-      const message = isDev ? "Invalid node in moveNodesBefore" : "FICT:E_NODE";
-      throw new Error(message);
-    }
-    if (node.nextSibling !== anchor) {
-      if (node.ownerDocument !== parent.ownerDocument && parent.ownerDocument) {
-        parent.ownerDocument.adoptNode(node);
-      }
-      try {
-        parent.insertBefore(node, anchor);
-      } catch (e) {
-        if (parent.ownerDocument) {
-          try {
-            const clone = parent.ownerDocument.importNode(node, true);
-            parent.insertBefore(clone, anchor);
-            nodes[i] = clone;
-            if (isDev) {
-              console.warn(
-                `[fict] Node cloning fallback triggered during list reordering. This may indicate cross-document node insertion. The node reference has been updated to the clone.`
-              );
-            }
-            anchor = clone;
-            continue;
-          } catch {
-          }
-        }
-        throw e;
-      }
-    }
-    anchor = node;
-  }
-}
-var MAX_SAFE_VERSION = 9007199254740991;
-function createVersionedSignalAccessor(initialValue) {
-  let current = initialValue;
-  let version = 0;
-  const track = signal(version);
-  function accessor(value) {
-    if (arguments.length === 0) {
-      track();
-      return current;
-    }
-    current = value;
-    version = version >= MAX_SAFE_VERSION ? 1 : version + 1;
-    track(version);
-  }
-  return accessor;
-}
-function createKeyedListContainer(startOverride, endOverride) {
-  const startMarker = startOverride ?? document.createComment("fict:list:start");
-  const endMarker = endOverride ?? document.createComment("fict:list:end");
-  const dispose = () => {
-    for (const block of container.blocks.values()) {
-      destroyRoot(block.root);
-    }
-    container.blocks.clear();
-    container.nextBlocks.clear();
-    if (!startMarker.parentNode || !endMarker.parentNode) {
-      container.currentNodes = [];
-      container.nextNodes = [];
-      container.orderedBlocks.length = 0;
-      container.nextOrderedBlocks.length = 0;
-      container.orderedIndexByKey.clear();
-      return;
-    }
-    const range = document.createRange();
-    range.setStartBefore(startMarker);
-    range.setEndAfter(endMarker);
-    range.deleteContents();
-    container.currentNodes = [];
-    container.nextNodes = [];
-    container.nextBlocks.clear();
-    container.orderedBlocks.length = 0;
-    container.nextOrderedBlocks.length = 0;
-    container.orderedIndexByKey.clear();
-  };
-  const container = {
-    startMarker,
-    endMarker,
-    blocks: /* @__PURE__ */ new Map(),
-    nextBlocks: /* @__PURE__ */ new Map(),
-    currentNodes: [startMarker, endMarker],
-    nextNodes: [],
-    orderedBlocks: [],
-    nextOrderedBlocks: [],
-    orderedIndexByKey: /* @__PURE__ */ new Map(),
-    dispose
-  };
-  return container;
-}
-function createKeyedBlock(key, item, index, render2, needsIndex = true, hostRoot) {
-  const itemSig = createVersionedSignalAccessor(item);
-  const indexSig = needsIndex ? signal(index) : ((next) => {
-    if (arguments.length === 0) return index;
-    index = next;
-    return index;
-  });
-  const root = createRootContext(hostRoot);
-  const prevRoot = pushRoot(root);
-  let nodes = [];
-  let scopeDispose;
-  const prevSub = setActiveSub(void 0);
-  try {
-    scopeDispose = effectScope(() => {
-      const rendered = render2(itemSig, indexSig, key);
-      if (rendered instanceof Node || Array.isArray(rendered) && rendered.every((n) => n instanceof Node)) {
-        nodes = toNodeArray(rendered);
-      } else {
-        const element = createElement(rendered);
-        nodes = toNodeArray(element);
-      }
-    });
-    if (scopeDispose) {
-      root.cleanups.push(scopeDispose);
-    }
-  } finally {
-    setActiveSub(prevSub);
-    popRoot(prevRoot);
-  }
-  return {
-    key,
-    nodes,
-    root,
-    item: itemSig,
-    index: indexSig,
-    rawItem: item,
-    rawIndex: index
-  };
-}
-function isNodeBetweenMarkers(node, startMarker, endMarker) {
-  let current = startMarker.nextSibling;
-  while (current && current !== endMarker) {
-    if (current === node) return true;
-    current = current.nextSibling;
-  }
-  return false;
-}
-function reorderBySwap(parent, first, second) {
-  if (first === second) return false;
-  const firstNodes = first.nodes;
-  const secondNodes = second.nodes;
-  if (firstNodes.length === 0 || secondNodes.length === 0) return false;
-  const lastFirst = firstNodes[firstNodes.length - 1];
-  const lastSecond = secondNodes[secondNodes.length - 1];
-  const afterFirst = lastFirst.nextSibling;
-  const afterSecond = lastSecond.nextSibling;
-  moveNodesBefore(parent, firstNodes, afterSecond);
-  moveNodesBefore(parent, secondNodes, afterFirst);
-  return true;
-}
-function getLISIndices(sequence) {
-  const predecessors = new Array(sequence.length);
-  const result = [];
-  for (let i = 0; i < sequence.length; i++) {
-    const value = sequence[i];
-    if (value < 0) {
-      predecessors[i] = -1;
-      continue;
-    }
-    let low = 0;
-    let high = result.length;
-    while (low < high) {
-      const mid = low + high >> 1;
-      if (sequence[result[mid]] < value) {
-        low = mid + 1;
-      } else {
-        high = mid;
-      }
-    }
-    predecessors[i] = low > 0 ? result[low - 1] : -1;
-    if (low === result.length) {
-      result.push(i);
-    } else {
-      result[low] = i;
-    }
-  }
-  const lis = new Array(result.length);
-  let k = result.length > 0 ? result[result.length - 1] : -1;
-  for (let i = result.length - 1; i >= 0; i--) {
-    lis[i] = k;
-    k = predecessors[k];
-  }
-  return lis;
-}
-function reorderByLIS(parent, endMarker, prev, next) {
-  const positions = /* @__PURE__ */ new Map();
-  for (let i = 0; i < prev.length; i++) {
-    positions.set(prev[i], i);
-  }
-  const sequence = new Array(next.length);
-  for (let i = 0; i < next.length; i++) {
-    const position = positions.get(next[i]);
-    if (position === void 0) return false;
-    sequence[i] = position;
-  }
-  const lisIndices = getLISIndices(sequence);
-  if (lisIndices.length === sequence.length) return true;
-  const inLIS = new Array(sequence.length).fill(false);
-  for (let i = 0; i < lisIndices.length; i++) {
-    inLIS[lisIndices[i]] = true;
-  }
-  let anchor = endMarker;
-  let moved = false;
-  for (let i = next.length - 1; i >= 0; i--) {
-    const block = next[i];
-    const nodes = block.nodes;
-    if (nodes.length === 0) continue;
-    if (inLIS[i]) {
-      anchor = nodes[0];
-      continue;
-    }
-    moveNodesBefore(parent, nodes, anchor);
-    anchor = nodes[0];
-    moved = true;
-  }
-  return moved;
-}
-function createKeyedList(getItems, keyFn, renderItem, needsIndex, startMarker, endMarker) {
-  const resolvedNeedsIndex = arguments.length >= 4 ? !!needsIndex : renderItem.length > 1;
-  return createFineGrainedKeyedList(
-    getItems,
-    keyFn,
-    renderItem,
-    resolvedNeedsIndex,
-    startMarker,
-    endMarker
-  );
-}
-function createFineGrainedKeyedList(getItems, keyFn, renderItem, needsIndex, startOverride, endOverride) {
-  const container = createKeyedListContainer(startOverride, endOverride);
-  const hostRoot = getCurrentRoot();
-  const useProvided = !!(startOverride && endOverride);
-  const fragment = useProvided ? container.startMarker : document.createDocumentFragment();
-  if (!useProvided) {
-    ;
-    fragment.append(container.startMarker, container.endMarker);
-  }
-  let disposed = false;
-  let effectDispose;
-  let connectObserver = null;
-  let effectStarted = false;
-  let startScheduled = false;
-  let initialHydrating = __fictIsHydrating();
-  const collectBetween = () => {
-    const nodes = [];
-    let cursor = container.startMarker.nextSibling;
-    while (cursor && cursor !== container.endMarker) {
-      nodes.push(cursor);
-      cursor = cursor.nextSibling;
-    }
-    return nodes;
-  };
-  const getConnectedParent = () => {
-    const endParent = container.endMarker.parentNode;
-    const startParent = container.startMarker.parentNode;
-    if (endParent && startParent && endParent === startParent && endParent.nodeType !== 11) {
-      const parentNode = endParent;
-      if ("isConnected" in parentNode && !parentNode.isConnected) return null;
-      return parentNode;
-    }
-    if (endParent && startParent && endParent === startParent && isShadowRoot(endParent)) {
-      const shadowRoot = endParent;
-      const host = shadowRoot.host;
-      if ("isConnected" in host && !host.isConnected) return null;
-      return shadowRoot;
-    }
-    return null;
-  };
-  const performDiff = () => {
-    if (disposed) return;
-    const isSSR = __fictIsSSR();
-    const parent = isSSR ? container.startMarker.parentNode : getConnectedParent();
-    if (!parent) return;
-    batch(() => {
-      const oldBlocks = container.blocks;
-      const newBlocks = container.nextBlocks;
-      const prevOrderedBlocks = container.orderedBlocks;
-      const nextOrderedBlocks = container.nextOrderedBlocks;
-      const orderedIndexByKey = container.orderedIndexByKey;
-      const newItems = getItems();
-      if (initialHydrating && isHydratingActive()) {
-        initialHydrating = false;
-        newBlocks.clear();
-        nextOrderedBlocks.length = 0;
-        orderedIndexByKey.clear();
-        if (newItems.length === 0) {
-          oldBlocks.clear();
-          prevOrderedBlocks.length = 0;
-          container.currentNodes = [container.startMarker, container.endMarker];
-          container.nextNodes.length = 0;
-          return;
-        }
-        const createdBlocks2 = [];
-        withHydrationRange(
-          container.startMarker.nextSibling,
-          container.endMarker,
-          parent.ownerDocument ?? document,
-          () => {
-            for (let index = 0; index < newItems.length; index++) {
-              const item = newItems[index];
-              const key = keyFn(item, index);
-              if (newBlocks.has(key)) {
-                if (isDev) {
-                  console.warn(
-                    `[fict] Duplicate key "${String(key)}" detected in list hydration. Each item should have a unique key.`
-                  );
-                }
-                const existing = newBlocks.get(key);
-                if (existing) {
-                  destroyRoot(existing.root);
-                  removeNodes(existing.nodes);
-                }
-              }
-              const block = createKeyedBlock(key, item, index, renderItem, needsIndex, hostRoot);
-              createdBlocks2.push(block);
-              newBlocks.set(key, block);
-              orderedIndexByKey.set(key, nextOrderedBlocks.length);
-              nextOrderedBlocks.push(block);
-            }
-          }
-        );
-        container.blocks = newBlocks;
-        container.nextBlocks = oldBlocks;
-        container.orderedBlocks = nextOrderedBlocks;
-        container.nextOrderedBlocks = prevOrderedBlocks;
-        oldBlocks.clear();
-        prevOrderedBlocks.length = 0;
-        container.currentNodes = [container.startMarker, ...collectBetween(), container.endMarker];
-        container.nextNodes.length = 0;
-        for (const block of createdBlocks2) {
-          if (newBlocks.get(block.key) === block) {
-            flushOnMount(block.root);
-          }
-        }
-        return;
-      }
-      if (newItems.length === 0) {
-        if (oldBlocks.size > 0) {
-          for (const block of oldBlocks.values()) {
-            destroyRoot(block.root);
-          }
-          const range = document.createRange();
-          range.setStartAfter(container.startMarker);
-          range.setEndBefore(container.endMarker);
-          range.deleteContents();
-        }
-        oldBlocks.clear();
-        newBlocks.clear();
-        prevOrderedBlocks.length = 0;
-        nextOrderedBlocks.length = 0;
-        orderedIndexByKey.clear();
-        container.currentNodes.length = 0;
-        container.currentNodes.push(container.startMarker, container.endMarker);
-        container.nextNodes.length = 0;
-        return;
-      }
-      const prevCount = prevOrderedBlocks.length;
-      if (prevCount > 0 && newItems.length === prevCount && orderedIndexByKey.size === prevCount) {
-        let stableOrder = true;
-        const seen = /* @__PURE__ */ new Set();
-        for (let i = 0; i < prevCount; i++) {
-          const item = newItems[i];
-          const key = keyFn(item, i);
-          if (seen.has(key) || prevOrderedBlocks[i].key !== key) {
-            stableOrder = false;
-            break;
-          }
-          seen.add(key);
-        }
-        if (stableOrder) {
-          for (let i = 0; i < prevCount; i++) {
-            const item = newItems[i];
-            const block = prevOrderedBlocks[i];
-            if (block.rawItem !== item) {
-              block.rawItem = item;
-              block.item(item);
-            }
-            if (needsIndex && block.rawIndex !== i) {
-              block.rawIndex = i;
-              block.index(i);
-            }
-          }
-          return;
-        }
-      }
-      newBlocks.clear();
-      nextOrderedBlocks.length = 0;
-      orderedIndexByKey.clear();
-      const createdBlocks = [];
-      let appendCandidate = prevCount > 0 && newItems.length >= prevCount;
-      const appendedBlocks = [];
-      let mismatchCount = 0;
-      let mismatchFirst = -1;
-      let mismatchSecond = -1;
-      let hasDuplicateKey = false;
-      newItems.forEach((item, index) => {
-        const key = keyFn(item, index);
-        let block = oldBlocks.get(key);
-        const existed = block !== void 0;
-        if (block) {
-          if (block.rawItem !== item) {
-            block.rawItem = item;
-            block.item(item);
-          }
-          if (needsIndex && block.rawIndex !== index) {
-            block.rawIndex = index;
-            block.index(index);
-          }
-        }
-        if (block) {
-          newBlocks.set(key, block);
-          oldBlocks.delete(key);
-        } else {
-          const existingBlock = newBlocks.get(key);
-          if (existingBlock) {
-            if (isDev) {
-              console.warn(
-                `[fict] Duplicate key "${String(key)}" detected in list rendering. Each item should have a unique key. The previous item with this key will be replaced.`
-              );
-            }
-            destroyRoot(existingBlock.root);
-            removeNodes(existingBlock.nodes);
-          }
-          block = createKeyedBlock(key, item, index, renderItem, needsIndex, hostRoot);
-          createdBlocks.push(block);
-        }
-        const resolvedBlock = block;
-        newBlocks.set(key, resolvedBlock);
-        const position = orderedIndexByKey.get(key);
-        if (position !== void 0) {
-          appendCandidate = false;
-          hasDuplicateKey = true;
-          const prior = nextOrderedBlocks[position];
-          if (prior && prior !== resolvedBlock) {
-            destroyRoot(prior.root);
-            removeNodes(prior.nodes);
-          }
-          nextOrderedBlocks[position] = resolvedBlock;
-        } else {
-          if (appendCandidate) {
-            if (index < prevCount) {
-              if (!prevOrderedBlocks[index] || prevOrderedBlocks[index].key !== key) {
-                appendCandidate = false;
-              }
-            } else if (existed) {
-              appendCandidate = false;
-            }
-          }
-          const nextIndex = nextOrderedBlocks.length;
-          orderedIndexByKey.set(key, nextIndex);
-          nextOrderedBlocks.push(resolvedBlock);
-          if (mismatchCount < 3 && (nextIndex >= prevCount || prevOrderedBlocks[nextIndex] !== resolvedBlock)) {
-            if (mismatchCount === 0) {
-              mismatchFirst = nextIndex;
-            } else if (mismatchCount === 1) {
-              mismatchSecond = nextIndex;
-            }
-            mismatchCount++;
-          }
-        }
-        if (appendCandidate && index >= prevCount) {
-          appendedBlocks.push(resolvedBlock);
-        }
-      });
-      const canAppend = appendCandidate && prevCount > 0 && newItems.length > prevCount && oldBlocks.size === 0 && appendedBlocks.length > 0;
-      if (canAppend) {
-        const appendedNodes = [];
-        for (const block of appendedBlocks) {
-          for (let i = 0; i < block.nodes.length; i++) {
-            appendedNodes.push(block.nodes[i]);
-          }
-        }
-        if (appendedNodes.length > 0) {
-          insertNodesBefore(parent, appendedNodes, container.endMarker);
-          const currentNodes = container.currentNodes;
-          currentNodes.pop();
-          for (let i = 0; i < appendedNodes.length; i++) {
-            currentNodes.push(appendedNodes[i]);
-          }
-          currentNodes.push(container.endMarker);
-        }
-        container.blocks = newBlocks;
-        container.nextBlocks = oldBlocks;
-        container.orderedBlocks = nextOrderedBlocks;
-        container.nextOrderedBlocks = prevOrderedBlocks;
-        for (const block of createdBlocks) {
-          if (newBlocks.get(block.key) === block) {
-            flushOnMount(block.root);
-          }
-        }
-        return;
-      }
-      if (oldBlocks.size > 0) {
-        for (const block of oldBlocks.values()) {
-          destroyRoot(block.root);
-          removeNodes(block.nodes);
-        }
-        oldBlocks.clear();
-      }
-      const canReorderInPlace = createdBlocks.length === 0 && oldBlocks.size === 0 && nextOrderedBlocks.length === prevOrderedBlocks.length;
-      let skipReconcile = false;
-      let updateNodeBuffer = true;
-      if (canReorderInPlace && nextOrderedBlocks.length > 0 && !hasDuplicateKey) {
-        if (mismatchCount === 0) {
-          skipReconcile = true;
-          updateNodeBuffer = false;
-        } else if (mismatchCount === 2 && prevOrderedBlocks[mismatchFirst] === nextOrderedBlocks[mismatchSecond] && prevOrderedBlocks[mismatchSecond] === nextOrderedBlocks[mismatchFirst]) {
-          if (reorderBySwap(
-            parent,
-            prevOrderedBlocks[mismatchFirst],
-            prevOrderedBlocks[mismatchSecond]
-          )) {
-            skipReconcile = true;
-          }
-        } else if (reorderByLIS(parent, container.endMarker, prevOrderedBlocks, nextOrderedBlocks)) {
-          skipReconcile = true;
-        }
-      }
-      if (!skipReconcile && (newBlocks.size > 0 || container.currentNodes.length > 0)) {
-        const prevNodes = container.currentNodes;
-        const nextNodes = container.nextNodes;
-        nextNodes.length = 0;
-        nextNodes.push(container.startMarker);
-        for (let i = 0; i < nextOrderedBlocks.length; i++) {
-          const nodes = nextOrderedBlocks[i].nodes;
-          for (let j = 0; j < nodes.length; j++) {
-            nextNodes.push(nodes[j]);
-          }
-        }
-        nextNodes.push(container.endMarker);
-        reconcileArrays(parent, prevNodes, nextNodes);
-        container.currentNodes = nextNodes;
-        container.nextNodes = prevNodes;
-      } else if (skipReconcile && updateNodeBuffer) {
-        const prevNodes = container.currentNodes;
-        const nextNodes = container.nextNodes;
-        nextNodes.length = 0;
-        nextNodes.push(container.startMarker);
-        for (let i = 0; i < nextOrderedBlocks.length; i++) {
-          const nodes = nextOrderedBlocks[i].nodes;
-          for (let j = 0; j < nodes.length; j++) {
-            nextNodes.push(nodes[j]);
-          }
-        }
-        nextNodes.push(container.endMarker);
-        container.currentNodes = nextNodes;
-        container.nextNodes = prevNodes;
-      }
-      container.blocks = newBlocks;
-      container.nextBlocks = oldBlocks;
-      container.orderedBlocks = nextOrderedBlocks;
-      container.nextOrderedBlocks = prevOrderedBlocks;
-      for (const block of createdBlocks) {
-        if (newBlocks.get(block.key) === block) {
-          flushOnMount(block.root);
-        }
-      }
-    });
-  };
-  const disconnectObserver = () => {
-    connectObserver?.disconnect();
-    connectObserver = null;
-  };
-  const ensureEffectStarted = () => {
-    if (disposed || effectStarted) return effectStarted;
-    const isSSR = __fictIsSSR();
-    const parent = isSSR ? container.startMarker.parentNode : getConnectedParent();
-    if (!parent) return false;
-    const start = () => {
-      effectDispose = createRenderEffect(performDiff);
-      effectStarted = true;
-    };
-    if (hostRoot) {
-      const prev = pushRoot(hostRoot);
-      try {
-        start();
-      } finally {
-        popRoot(prev);
-      }
-    } else {
-      start();
-    }
-    return true;
-  };
-  const waitForConnection = () => {
-    if (connectObserver || typeof MutationObserver === "undefined") return;
-    const root = container.startMarker.getRootNode?.() ?? document;
-    const shadowRoot = root && root.nodeType === 11 && isShadowRoot(root) ? root : null;
-    connectObserver = new MutationObserver(() => {
-      if (disposed) return;
-      if (getConnectedParent()) {
-        disconnectObserver();
-        if (ensureEffectStarted()) {
-          flush();
-        }
-      }
-    });
-    connectObserver.observe(document, { childList: true, subtree: true });
-    if (shadowRoot) {
-      connectObserver.observe(shadowRoot, { childList: true, subtree: true });
-    }
-  };
-  const scheduleStart = () => {
-    if (startScheduled || disposed || effectStarted) return;
-    startScheduled = true;
-    const run = () => {
-      startScheduled = false;
-      if (!ensureEffectStarted()) {
-        waitForConnection();
-      }
-    };
-    if (typeof queueMicrotask === "function") {
-      queueMicrotask(run);
-    } else {
-      Promise.resolve().then(run).catch(() => void 0);
-    }
-  };
-  scheduleStart();
-  return {
-    get marker() {
-      scheduleStart();
-      return fragment;
-    },
-    startMarker: container.startMarker,
-    endMarker: container.endMarker,
-    // Flush pending items - call after markers are inserted into DOM
-    flush: () => {
-      if (disposed) return;
-      scheduleStart();
-      if (ensureEffectStarted()) {
-        flush();
-      } else {
-        waitForConnection();
-      }
-    },
-    dispose: () => {
-      disposed = true;
-      effectDispose?.();
-      disconnectObserver();
-      container.dispose();
-    }
-  };
-}
+} from "./chunk-DXG3TARY.js";
 export {
   Aliases,
   BooleanAttributes,
   ChildProperties,
   DelegatedEvents,
+  FICT_SSR_SNAPSHOT_SCHEMA_VERSION,
   Fragment,
   Properties,
   SVGElements,