attaform 0.31.1 → 0.31.2

package/dist/shared/attaform.BPSqtU7a.mjs

@@ -1,274 +0,0 @@
-import { s as safeAssign, a as safeOwnRead, r as readConsumerIndex, c as consumerKeys, b as readConsumerProp } from './attaform._1Zp3mDG.mjs';
-import { m as mapSegmentKeys, f as pathsEqual, i as isPathPrefix } from './attaform.BhtAZysa.mjs';
-
-const DEFAULT_FIELD_VALIDATION_DEBOUNCE_MS = 0;
-const DEFAULT_HISTORY_MAX_SNAPSHOTS = 128;
-const RESERVED_KEY_PREFIX = "__atta:";
-const ANONYMOUS_FORM_KEY_PREFIX = `${RESERVED_KEY_PREFIX}anon:`;
-const ANONYMOUS_WIZARD_KEY_PREFIX = `${RESERVED_KEY_PREFIX}anon-wizard:`;
-const DEFAULT_MAX_RECURSION_DEPTH = 64;
-function normalizeNumericOption(config) {
-  const { value, source, min, defaultValue } = config;
-  if (typeof value !== "number" || !Number.isFinite(value)) {
-    return defaultValue;
-  }
-  return Math.max(min, Math.floor(value));
-}
-function pickDefined(bag) {
-  const out = {};
-  for (const key of Object.keys(bag)) {
-    if (bag[key] !== void 0) out[key] = bag[key];
-  }
-  return out;
-}
-
-function isDescendable(value) {
-  if (value === null || typeof value !== "object") return false;
-  if (Array.isArray(value)) return true;
-  if (value instanceof Map) return mapSegmentKeys(value) !== null;
-  const proto = Object.getPrototypeOf(value);
-  return proto === null || proto === Object.prototype;
-}
-function isBarePatch(patch) {
-  return patch.kind === "added" ? isDescendable(patch.newValue) : patch.kind === "removed" && isDescendable(patch.oldValue);
-}
-function appendSegment(prefix, segment) {
-  const next = new Array(prefix.length + 1);
-  for (let i = 0; i < prefix.length; i++) {
-    const s = prefix[i];
-    next[i] = s;
-  }
-  next[prefix.length] = segment;
-  return next;
-}
-function diffAndApply(oldValue, newValue, prefix, visit) {
-  if (Object.is(oldValue, newValue)) return;
-  const oldIsDescendable = isDescendable(oldValue);
-  const newIsDescendable = isDescendable(newValue);
-  if (oldValue === void 0 && newIsDescendable) {
-    walkDescendable(newValue, prefix, visit, true);
-    return;
-  }
-  if (oldIsDescendable && newValue === void 0) {
-    walkDescendable(oldValue, prefix, visit, false);
-    return;
-  }
-  if (oldIsDescendable && newIsDescendable) {
-    const oldIsMap = oldValue instanceof Map;
-    const newIsMap = newValue instanceof Map;
-    if (oldIsMap && newIsMap) {
-      diffMapsLockstep(oldValue, newValue, prefix, visit);
-      return;
-    }
-    if (oldIsMap !== newIsMap) {
-      visit({ kind: "changed", path: prefix, oldValue, newValue });
-      return;
-    }
-    const oldIsArray = Array.isArray(oldValue);
-    const newIsArray = Array.isArray(newValue);
-    if (oldIsArray && newIsArray) {
-      diffArraysLockstep(oldValue, newValue, prefix, visit);
-      return;
-    }
-    if (!oldIsArray && !newIsArray) {
-      diffObjectsLockstep(
-        oldValue,
-        newValue,
-        prefix,
-        visit
-      );
-      return;
-    }
-    visit({ kind: "changed", path: prefix, oldValue, newValue });
-    return;
-  }
-  if (oldIsDescendable && !newIsDescendable) {
-    visit({ kind: "changed", path: prefix, oldValue, newValue });
-    return;
-  }
-  if (!oldIsDescendable && newIsDescendable) {
-    visit({ kind: "changed", path: prefix, oldValue, newValue });
-    return;
-  }
-  if (oldValue === void 0) {
-    visit({ kind: "added", path: prefix, newValue });
-    return;
-  }
-  if (newValue === void 0) {
-    visit({ kind: "removed", path: prefix, oldValue });
-    return;
-  }
-  visit({ kind: "changed", path: prefix, oldValue, newValue });
-}
-function walkDescendable(value, prefix, visit, arrived) {
-  let reported = false;
-  if (Array.isArray(value)) {
-    for (let i = 0; i < value.length; i++) {
-      diffSlot(readConsumerIndex(value, i), appendSegment(prefix, i), visit, arrived);
-    }
-    reported = value.length > 0;
-  } else if (value instanceof Map) {
-    for (const [key, entry] of value) {
-      diffSlot(entry, appendSegment(prefix, key), visit, arrived);
-    }
-    reported = value.size > 0;
-  } else {
-    const rec = value;
-    for (const k of consumerKeys(rec)) {
-      const entry = readConsumerProp(rec, k);
-      if (entry === void 0) continue;
-      reported = true;
-      if (arrived) diffAndApply(void 0, entry, appendSegment(prefix, k), visit);
-      else diffAndApply(entry, void 0, appendSegment(prefix, k), visit);
-    }
-  }
-  if (!reported) visit(presencePatch(arrived, prefix, value));
-}
-function diffSlot(entry, path, visit, arrived) {
-  if (entry === void 0) visit(presencePatch(arrived, path, entry));
-  else if (arrived) diffAndApply(void 0, entry, path, visit);
-  else diffAndApply(entry, void 0, path, visit);
-}
-function presencePatch(arrived, path, value) {
-  return arrived ? { kind: "added", path, newValue: value } : { kind: "removed", path, oldValue: value };
-}
-function diffMapsLockstep(oldMap, newMap, prefix, visit) {
-  for (const [key, entry] of newMap) {
-    const path = appendSegment(prefix, key);
-    if (oldMap.has(key)) diffAndApply(oldMap.get(key), entry, path, visit);
-    else diffSlot(entry, path, visit, true);
-  }
-  for (const [key, entry] of oldMap) {
-    if (!newMap.has(key)) diffSlot(entry, appendSegment(prefix, key), visit, false);
-  }
-}
-function diffArraysLockstep(oldArr, newArr, prefix, visit) {
-  const min = Math.min(oldArr.length, newArr.length);
-  for (let i = 0; i < min; i++) {
-    diffAndApply(
-      readConsumerIndex(oldArr, i),
-      readConsumerIndex(newArr, i),
-      appendSegment(prefix, i),
-      visit
-    );
-  }
-  for (let i = min; i < newArr.length; i++) {
-    diffSlot(readConsumerIndex(newArr, i), appendSegment(prefix, i), visit, true);
-  }
-  for (let i = min; i < oldArr.length; i++) {
-    diffSlot(readConsumerIndex(oldArr, i), appendSegment(prefix, i), visit, false);
-  }
-}
-function diffObjectsLockstep(oldRec, newRec, prefix, visit) {
-  const seen = /* @__PURE__ */ new Set();
-  for (const k of consumerKeys(oldRec)) {
-    seen.add(k);
-    diffAndApply(
-      readConsumerProp(oldRec, k),
-      readConsumerProp(newRec, k),
-      appendSegment(prefix, k),
-      visit
-    );
-  }
-  for (const k of consumerKeys(newRec)) {
-    if (seen.has(k)) continue;
-    diffAndApply(
-      readConsumerProp(oldRec, k),
-      readConsumerProp(newRec, k),
-      appendSegment(prefix, k),
-      visit
-    );
-  }
-}
-function applyChangedKeys(target, source, arrayOpPath, currentPath, patches) {
-  if (!isDescendable(target) || !isDescendable(source)) return false;
-  if (target instanceof Map || source instanceof Map) return false;
-  const targetIsArray = Array.isArray(target);
-  const sourceIsArray = Array.isArray(source);
-  if (targetIsArray !== sourceIsArray) return false;
-  const depth = currentPath.length;
-  const changedFirstSegments = /* @__PURE__ */ new Set();
-  for (const patch of patches) {
-    if (patch.path.length === depth) return false;
-    changedFirstSegments.add(patch.path[depth]);
-  }
-  if (targetIsArray) {
-    const t = target;
-    const s = source;
-    if (arrayOpPath === null || pathsEqual(currentPath, arrayOpPath)) {
-      if (t.length > s.length) t.length = s.length;
-      for (const idx of changedFirstSegments) {
-        const i = typeof idx === "number" ? idx : Number(idx);
-        if (i >= s.length) continue;
-        t[i] = s[i];
-      }
-    } else {
-      for (const idx of changedFirstSegments) {
-        const i = typeof idx === "number" ? idx : Number(idx);
-        if (i >= s.length) continue;
-        const childPath = appendSegment(currentPath, i);
-        const curEl = t[i];
-        const nextEl = s[i];
-        if (isPathPrefix(childPath, arrayOpPath) && isDescendable(curEl) && isDescendable(nextEl) && applyChangedKeys(
-          curEl,
-          nextEl,
-          arrayOpPath,
-          childPath,
-          patches.filter((p) => isPathPrefix(childPath, p.path))
-        )) {
-          continue;
-        }
-        t[i] = nextEl;
-      }
-    }
-  } else {
-    const t = target;
-    const s = source;
-    const sourceKeys = new Set(Object.keys(s));
-    for (const k of Object.keys(t)) {
-      if (!sourceKeys.has(k)) delete t[k];
-    }
-    for (const k of changedFirstSegments) {
-      const key = String(k);
-      const nextVal = safeOwnRead(s, key);
-      if (arrayOpPath !== null) {
-        const curVal = safeOwnRead(t, key);
-        const childPath = appendSegment(currentPath, key);
-        if (isDescendable(curVal) && isDescendable(nextVal) && applyChangedKeys(
-          curVal,
-          nextVal,
-          arrayOpPath,
-          childPath,
-          patches.filter((p) => isPathPrefix(childPath, p.path))
-        )) {
-          continue;
-        }
-      }
-      safeAssign(t, key, nextVal);
-    }
-  }
-  return true;
-}
-function structuralSnapshot(value) {
-  if (!isDescendable(value)) return value;
-  if (value instanceof Map) {
-    const out2 = /* @__PURE__ */ new Map();
-    for (const [k, v] of value) out2.set(k, structuralSnapshot(v));
-    return out2;
-  }
-  if (Array.isArray(value)) {
-    const out2 = new Array(value.length);
-    for (let i = 0; i < value.length; i++) {
-      out2[i] = structuralSnapshot(value[i]);
-    }
-    return out2;
-  }
-  const src = value;
-  const out = {};
-  for (const k of Object.keys(src)) {
-    safeAssign(out, k, structuralSnapshot(safeOwnRead(src, k)));
-  }
-  return out;
-}
-
-export { ANONYMOUS_FORM_KEY_PREFIX as A, DEFAULT_HISTORY_MAX_SNAPSHOTS as D, RESERVED_KEY_PREFIX as R, DEFAULT_FIELD_VALIDATION_DEBOUNCE_MS as a, isDescendable as b, applyChangedKeys as c, diffAndApply as d, DEFAULT_MAX_RECURSION_DEPTH as e, ANONYMOUS_WIZARD_KEY_PREFIX as f, isBarePatch as i, normalizeNumericOption as n, pickDefined as p, structuralSnapshot as s };