@buoy-gg/shared-ui 7.0.41 → 7.0.42

package/lib/commonjs/utils/safeStringify.js

@@ -1,229 +1 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.safeStringify = safeStringify;
-/**
- * Safely stringifies objects with circular references by:
- * 1. Pre-processing to detect and temporarily replace circular references
- * 2. Handling special JS types that JSON.stringify can't serialize
- * 3. Restoring original object structure after stringification
- * 4. Inspired by fast-safe-stringify with additional type handling
- */
-
-const CIRCULAR_REPLACE_NODE = "[Circular]";
-const LIMIT_REPLACE_NODE = "[...]";
-
-/**
- * Safely stringifies objects with circular references and special JavaScript types
- * 
- * This function provides comprehensive JSON serialization that handles:
- * - Circular references (replaced with "[Circular]")
- * - Special JavaScript types (Date, RegExp, Error, Map, Set, etc.)
- * - Non-serializable values (undefined, functions, symbols, BigInt)
- * - Depth and edge limits to prevent infinite recursion
- * - Restoration of original object structure after processing
- * 
- * @param obj - The object/value to stringify
- * @param space - Number of spaces for pretty-printing (optional)
- * @param options - Configuration options for limits
- * @param options.depthLimit - Maximum depth to traverse (default: unlimited)
- * @param options.edgesLimit - Maximum edges per object (default: unlimited)
- * 
- * @returns JSON string representation of the object
- * 
- * @example
- * ```typescript
- * const obj = { name: "test" };
- * obj.self = obj; // circular reference
- * 
- * const result = safeStringify(obj, 2);
- * // Returns: '{\n  "name": "test",\n  "self": "[Circular]"\n}'
- * 
- * // With limits
- * const limited = safeStringify(deepObject, 2, { depthLimit: 5 });
- * ```
- * 
- * @performance Uses pre-processing approach to handle circular references efficiently
- * @performance Includes object restoration to maintain original structure integrity
- * @performance Optimized for arrays and objects with separate handling paths
- */
-function safeStringify(obj, space, options = {}) {
-  const {
-    depthLimit = Number.MAX_SAFE_INTEGER,
-    edgesLimit = Number.MAX_SAFE_INTEGER
-  } = options;
-  const arr = []; // Store original values to restore after stringification
-
-  // Pre-process the object to handle circular references and depth limits
-  function decirc(val, k, edgeIndex, stack, parent, depth) {
-    depth += 1;
-    if (typeof val === "object" && val !== null) {
-      // Check for circular references
-      for (let i = 0; i < stack.length; i++) {
-        if (stack[i] === val) {
-          setReplace(CIRCULAR_REPLACE_NODE, val, k, parent);
-          return;
-        }
-      }
-
-      // Check depth limit
-      if (depth > depthLimit) {
-        setReplace(LIMIT_REPLACE_NODE, val, k, parent);
-        return;
-      }
-
-      // Check edges limit
-      if (edgeIndex + 1 > edgesLimit) {
-        setReplace(LIMIT_REPLACE_NODE, val, k, parent);
-        return;
-      }
-      stack.push(val);
-
-      // Optimize for Arrays
-      if (Array.isArray(val)) {
-        const arrayParent = val;
-        for (let i = 0; i < val.length; i++) {
-          decirc(val[i], i, i, stack, arrayParent, depth);
-        }
-      } else if (val instanceof Map || val instanceof Set || val instanceof RegExp || val instanceof Date || val instanceof Error) {
-        // Skip special objects
-        stack.pop();
-        return;
-      } else {
-        const objParent = val;
-        const keys = Object.keys(objParent);
-        for (let i = 0; i < keys.length; i++) {
-          const key = keys[i];
-          decirc(objParent[key], key, i, stack, objParent, depth);
-        }
-      }
-      stack.pop();
-    }
-  }
-  function setReplace(replace, val, k, parent) {
-    if (!parent) return;
-    const propertyDescriptor = Object.getOwnPropertyDescriptor(parent, k);
-    if (propertyDescriptor?.get !== undefined) {
-      if (propertyDescriptor.configurable) {
-        Object.defineProperty(parent, k, {
-          value: replace
-        });
-        arr.push([parent, k, val, propertyDescriptor]);
-      } else {
-        // Handle non-configurable getters - skip for now
-        return;
-      }
-    } else {
-      parent[k] = replace;
-      arr.push([parent, k, val]);
-    }
-  }
-
-  // Custom replacer for special types
-  const replacer = (key, value) => {
-    // Handle primitives that JSON.stringify can't handle
-    if (typeof value === "bigint") return `${value.toString()}n`;
-    if (typeof value === "symbol") return value.toString();
-    if (typeof value === "undefined") return "undefined";
-    if (typeof value === "function") {
-      return `[Function: ${value.name || "anonymous"}]`;
-    }
-
-    // Handle special number values
-    if (typeof value === "number") {
-      if (value === Infinity) return "Infinity";
-      if (value === -Infinity) return "-Infinity";
-      if (Number.isNaN(value)) return "NaN";
-    }
-
-    // Handle special objects
-    if (value instanceof Error) {
-      const errorObj = {
-        name: value.name,
-        message: value.message,
-        stack: value.stack
-      };
-      // Include custom properties
-      Object.getOwnPropertyNames(value).forEach(prop => {
-        if (!["name", "message", "stack"].includes(prop)) {
-          try {
-            const propValue = value[prop];
-            if (propValue !== undefined) {
-              errorObj[prop] = propValue;
-            }
-          } catch {
-            // Skip properties that can't be accessed
-          }
-        }
-      });
-      return errorObj;
-    }
-    if (value instanceof Date) return value.toISOString();
-    if (value instanceof RegExp) return value.toString();
-
-    // Handle Map objects
-    if (value instanceof Map) {
-      try {
-        const entries = Array.from(value.entries()).map(([mapKey, val]) => [String(mapKey), val]);
-        return {
-          __type: "Map",
-          entries: entries
-        };
-      } catch {
-        // Handle cases where Map iteration fails
-        return {
-          __type: "Map",
-          entries: "[Map iteration failed]"
-        };
-      }
-    }
-
-    // Handle Set objects
-    if (value instanceof Set) {
-      try {
-        return {
-          __type: "Set",
-          values: Array.from(value)
-        };
-      } catch {
-        return {
-          __type: "Set",
-          values: "[Set iteration failed]"
-        };
-      }
-    }
-    return value;
-  };
-
-  // Pre-process to handle circular references
-  try {
-    decirc(obj, "", 0, [], null, 0);
-
-    // Stringify with custom replacer
-    const result = JSON.stringify(obj, replacer, space);
-    return result;
-  } catch {
-    // Fallback for complex circular references
-    return JSON.stringify("[unable to serialize, circular reference is too complex to analyze]");
-  } finally {
-    // Restore original object structure
-    while (arr.length !== 0) {
-      const part = arr.pop();
-      if (part && part.length === 4) {
-        // Restore property descriptor
-        const [targetObj, key,, descriptor] = part;
-        if (targetObj && typeof targetObj === "object" && descriptor) {
-          Object.defineProperty(targetObj, key, descriptor);
-        }
-      } else if (part) {
-        // Restore simple property
-        const [targetObj, key, value] = part;
-        if (targetObj && typeof targetObj === "object" && (typeof key === "string" || typeof key === "number")) {
-          targetObj[key] = value;
-        }
-      }
-    }
-  }
-}
+"use strict";Object.defineProperty(exports,"__esModule",{value:true});exports.safeStringify=safeStringify;const CIRCULAR_REPLACE_NODE="[Circular]";const LIMIT_REPLACE_NODE="[...]";function safeStringify(g,m,_={}){const{depthLimit:E=Number.MAX_SAFE_INTEGER,edgesLimit:S=Number.MAX_SAFE_INTEGER}=_;const s=[];function p(t,e,n,r,i,c){c+=1;if(typeof t==="object"&&t!==null){for(let o=0;o<r.length;o++){if(r[o]===t){u(CIRCULAR_REPLACE_NODE,t,e,i);return}}if(c>E){u(LIMIT_REPLACE_NODE,t,e,i);return}if(n+1>S){u(LIMIT_REPLACE_NODE,t,e,i);return}r.push(t);if(Array.isArray(t)){const o=t;for(let f=0;f<t.length;f++){p(t[f],f,f,r,o,c)}}else if(t instanceof Map||t instanceof Set||t instanceof RegExp||t instanceof Date||t instanceof Error){r.pop();return}else{const o=t;const f=Object.keys(o);for(let y=0;y<f.length;y++){const b=f[y];p(o[b],b,y,r,o,c)}}r.pop()}}function u(t,e,n,r){if(!r)return;const i=Object.getOwnPropertyDescriptor(r,n);if(i?.get!==void 0){if(i.configurable){Object.defineProperty(r,n,{value:t});s.push([r,n,e,i])}else{return}}else{r[n]=t;s.push([r,n,e])}}const d=(t,e)=>{if(typeof e==="bigint")return`${e.toString()}n`;if(typeof e==="symbol")return e.toString();if(typeof e==="undefined")return"undefined";if(typeof e==="function"){return`[Function: ${e.name||"anonymous"}]`}if(typeof e==="number"){if(e===Infinity)return"Infinity";if(e===-Infinity)return"-Infinity";if(Number.isNaN(e))return"NaN"}if(e instanceof Error){const n={name:e.name,message:e.message,stack:e.stack};Object.getOwnPropertyNames(e).forEach(r=>{if(!["name","message","stack"].includes(r)){try{const i=e[r];if(i!==void 0){n[r]=i}}catch{}}});return n}if(e instanceof Date)return e.toISOString();if(e instanceof RegExp)return e.toString();if(e instanceof Map){try{const n=Array.from(e.entries()).map(([r,i])=>[String(r),i]);return{__type:"Map",entries:n}}catch{return{__type:"Map",entries:"[Map iteration failed]"}}}if(e instanceof Set){try{return{__type:"Set",values:Array.from(e)}}catch{return{__type:"Set",values:"[Set iteration failed]"}}}return e};try{p(g,"",0,[],null,0);const t=JSON.stringify(g,d,m);return t}catch{return JSON.stringify("[unable to serialize, circular reference is too complex to analyze]")}finally{while(s.length!==0){const t=s.pop();if(t&&t.length===4){const[e,n,,r]=t;if(e&&typeof e==="object"&&r){Object.defineProperty(e,n,r)}}else if(t){const[e,n,r]=t;if(e&&typeof e==="object"&&(typeof n==="string"||typeof n==="number")){e[n]=r}}}}}

package/lib/commonjs/utils/snapshotProviderKit.js

@@ -1,167 +1 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.PREVIEW_ITEM_RENDER_BYTE_LIMIT = void 0;
-exports.classifyPreviewItem = classifyPreviewItem;
-exports.createRestoreScope = createRestoreScope;
-exports.emptyRestoreResult = emptyRestoreResult;
-exports.failedRestore = failedRestore;
-exports.skippedRestore = skippedRestore;
-exports.unionKeys = unionKeys;
-exports.wontApply = wontApply;
-var _objectDiff = require("../dataViewer/objectDiff.js");
-/**
- * snapshotProviderKit — the parts of a Time Machine `StateSnapshotProvider`
- * that are the same for every source.
- *
- * storage, redux, zustand, jotai and react-query each register a provider
- * (see stateSnapshotRegistry.ts). What differs is how they read and write
- * their source. What was copied five times is:
- *
- *  - the restore SCOPE gate: `excludeKeys` (touch all but these) and
- *    `includeKeys` (touch only these), the "N item(s) excluded by you"
- *    warning, and the empty `StateSnapshotRestoreResult`;
- *  - the preview VERDICT ladder: removed → added → unchanged → too-large →
- *    changed, with the 256 KB per-item render cap;
- *  - the "won't apply" override: a difference restore cannot apply must say
- *    so instead of rendering as a green change.
- *
- * The parts that stay per-tool are the ones that matter: redux verifies the
- * jump by reference identity, zustand grafts action functions back, jotai
- * leaves derived atoms to recompute, storage gates MMKV buffers and
- * biometric keys, react-query diffs a comparable projection.
- */
-
-/** Beyond this a preview item is "too-large": restore still applies it, the diff isn't drawn. */
-const PREVIEW_ITEM_RENDER_BYTE_LIMIT = exports.PREVIEW_ITEM_RENDER_BYTE_LIMIT = 256 * 1024;
-/**
- * Both option lists use preview item keys, and both mean "leave everything
- * else untouched in BOTH directions". `includeKeys` wins when present;
- * `excludeKeys` still applies on top.
- */
-function createRestoreScope(options) {
-  const excludedSet = new Set(options?.excludeKeys ?? []);
-  const includedSet = options?.includeKeys ? new Set(options.includeKeys) : null;
-  let excludedHits = 0;
-  const touch = key => !excludedSet.has(key) && (!includedSet || includedSet.has(key));
-  return {
-    touch,
-    allows(key) {
-      if (touch(key)) return true;
-      excludedHits += 1;
-      return false;
-    },
-    countExcluded(n) {
-      excludedHits += n;
-    },
-    get excludedHits() {
-      return excludedHits;
-    },
-    excludedWarning(noun) {
-      return excludedHits > 0 ? `${excludedHits} ${noun} excluded by you` : null;
-    }
-  };
-}
-
-/** A fresh, successful, empty result to accumulate into. */
-function emptyRestoreResult() {
-  return {
-    ok: true,
-    applied: 0,
-    skipped: [],
-    warnings: []
-  };
-}
-
-/** A failed result with one warning (an empty or unusable snapshot). */
-function failedRestore(warning) {
-  return {
-    ok: false,
-    applied: 0,
-    skipped: [],
-    warnings: [warning]
-  };
-}
-
-/** A failed result with one skipped item and its reason. */
-function skippedRestore(id, reason) {
-  return {
-    ok: false,
-    applied: 0,
-    skipped: [{
-      id,
-      reason
-    }],
-    warnings: []
-  };
-}
-/**
- * The verdict ladder: removed → added → unchanged → too-large → changed.
- * Callers layer source-specific verdicts (`wont-apply`, `recomputes`) on top
- * with `wontApply()`.
- */
-function classifyPreviewItem(input, options = {}) {
-  const {
-    key,
-    label,
-    oldValue,
-    newValue,
-    inOld,
-    inNew
-  } = input;
-  if (!inNew) return {
-    key,
-    label,
-    verdict: "removed",
-    oldValue
-  };
-  if (!inOld) return {
-    key,
-    label,
-    verdict: "added",
-    newValue
-  };
-  const equal = options.equal ?? _objectDiff.boundedDeepEqual;
-  if (equal(oldValue, newValue)) return {
-    key,
-    label,
-    verdict: "unchanged"
-  };
-  const tooLarge = options.tooLarge ?? (value => (0, _objectDiff.jsonLikelyLargerThan)(value, PREVIEW_ITEM_RENDER_BYTE_LIMIT));
-  if (tooLarge(oldValue) || tooLarge(newValue)) {
-    return {
-      key,
-      label,
-      verdict: "too-large",
-      reason: options.tooLargeReason ?? "value too large to render a diff — restore still applies it"
-    };
-  }
-  return {
-    key,
-    label,
-    verdict: "changed",
-    oldValue,
-    newValue
-  };
-}
-
-/**
- * Mark an item as something restore cannot apply. An unchanged item is left
- * alone — there is nothing to apply, so nothing is being refused.
- */
-function wontApply(item, reason) {
-  if (item.verdict === "unchanged") return item;
-  return {
-    ...item,
-    verdict: "wont-apply",
-    reason
-  };
-}
-
-/** Every key present in either record, once. */
-function unionKeys(a, b) {
-  const keysOf = r => r === undefined ? [] : r instanceof Map ? Array.from(r.keys()) : Object.keys(r);
-  return new Set([...keysOf(a), ...keysOf(b)]);
-}
+"use strict";Object.defineProperty(exports,"__esModule",{value:true});exports.PREVIEW_ITEM_RENDER_BYTE_LIMIT=void 0;exports.classifyPreviewItem=classifyPreviewItem;exports.createRestoreScope=createRestoreScope;exports.emptyRestoreResult=emptyRestoreResult;exports.failedRestore=failedRestore;exports.skippedRestore=skippedRestore;exports.unionKeys=unionKeys;exports.wontApply=wontApply;var _objectDiff=require("../dataViewer/objectDiff.js");const PREVIEW_ITEM_RENDER_BYTE_LIMIT=exports.PREVIEW_ITEM_RENDER_BYTE_LIMIT=256*1024;function createRestoreScope(t){const n=new Set(t?.excludeKeys??[]);const o=t?.includeKeys?new Set(t.includeKeys):null;let e=0;const s=r=>!n.has(r)&&(!o||o.has(r));return{touch:s,allows(r){if(s(r))return true;e+=1;return false},countExcluded(r){e+=r},get excludedHits(){return e},excludedWarning(r){return e>0?`${e} ${r} excluded by you`:null}}}function emptyRestoreResult(){return{ok:true,applied:0,skipped:[],warnings:[]}}function failedRestore(t){return{ok:false,applied:0,skipped:[],warnings:[t]}}function skippedRestore(t,n){return{ok:false,applied:0,skipped:[{id:t,reason:n}],warnings:[]}}function classifyPreviewItem(t,n={}){const{key:o,label:e,oldValue:s,newValue:r,inOld:i,inNew:d}=t;if(!d)return{key:o,label:e,verdict:"removed",oldValue:s};if(!i)return{key:o,label:e,verdict:"added",newValue:r};const l=n.equal??_objectDiff.boundedDeepEqual;if(l(s,r))return{key:o,label:e,verdict:"unchanged"};const u=n.tooLarge??(a=>(0,_objectDiff.jsonLikelyLargerThan)(a,PREVIEW_ITEM_RENDER_BYTE_LIMIT));if(u(s)||u(r)){return{key:o,label:e,verdict:"too-large",reason:n.tooLargeReason??"value too large to render a diff \u2014 restore still applies it"}}return{key:o,label:e,verdict:"changed",oldValue:s,newValue:r}}function wontApply(t,n){if(t.verdict==="unchanged")return t;return{...t,verdict:"wont-apply",reason:n}}function unionKeys(t,n){const o=e=>e===void 0?[]:e instanceof Map?Array.from(e.keys()):Object.keys(e);return new Set([...o(t),...o(n)])}

package/lib/commonjs/utils/stateSnapshotRegistry.js

@@ -1,71 +1 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.getStateSnapshotProvider = getStateSnapshotProvider;
-exports.getStateSnapshotProviders = getStateSnapshotProviders;
-exports.registerStateSnapshotProvider = registerStateSnapshotProvider;
-exports.subscribeToStateSnapshotProviders = subscribeToStateSnapshotProviders;
-/**
- * Cross-package bridge for app-state snapshot & restore (Time Machine).
- *
- * Each state tool (`@buoy-gg/storage`, `@buoy-gg/redux`, `@buoy-gg/zustand`,
- * `@buoy-gg/jotai`, `@buoy-gg/react-query`) registers a provider here at
- * module init (or from its app-lifetime sync hook); `@buoy-gg/time-machine`
- * consumes the registry. Neither side imports the other — same
- * optional-capability pattern as renderCaptureRegistry.
- *
- * Apps can also register custom providers for state Buoy doesn't know about.
- */
-
-/**
- * Per-item verdict in a Restore Preview. The critical distinction:
- * "changed" means the restore WILL apply this difference; "wont-apply" means
- * a difference exists (or an item does) that restore can NOT apply, with the
- * reason. A preview that shows raw diffs without this distinction lies.
- */
-
-// beyond diff budgets; treated as changed, not rendered
-
-const providers = new Map();
-const listeners = new Set();
-function notify() {
-  listeners.forEach(l => {
-    try {
-      l();
-    } catch {
-      // listener errors must not break registration
-    }
-  });
-}
-
-/**
- * Register a provider. Last registration wins for a given id.
- * Returns an unregister function (only removes the provider if it is still
- * the registered one for that id).
- */
-function registerStateSnapshotProvider(provider) {
-  providers.set(provider.id, provider);
-  notify();
-  return () => {
-    if (providers.get(provider.id) === provider) {
-      providers.delete(provider.id);
-      notify();
-    }
-  };
-}
-function getStateSnapshotProviders() {
-  return Array.from(providers.values());
-}
-function getStateSnapshotProvider(id) {
-  return providers.get(id) ?? null;
-}
-
-/** Notifies when providers register/unregister (query registers late). */
-function subscribeToStateSnapshotProviders(listener) {
-  listeners.add(listener);
-  return () => {
-    listeners.delete(listener);
-  };
-}
+"use strict";Object.defineProperty(exports,"__esModule",{value:true});exports.getStateSnapshotProvider=getStateSnapshotProvider;exports.getStateSnapshotProviders=getStateSnapshotProviders;exports.registerStateSnapshotProvider=registerStateSnapshotProvider;exports.subscribeToStateSnapshotProviders=subscribeToStateSnapshotProviders;const providers=new Map;const listeners=new Set;function notify(){listeners.forEach(t=>{try{t()}catch{}})}function registerStateSnapshotProvider(t){providers.set(t.id,t);notify();return()=>{if(providers.get(t.id)===t){providers.delete(t.id);notify()}}}function getStateSnapshotProviders(){return Array.from(providers.values())}function getStateSnapshotProvider(t){return providers.get(t)??null}function subscribeToStateSnapshotProviders(t){listeners.add(t);return()=>{listeners.delete(t)}}

package/lib/commonjs/utils/stateTools.js

@@ -1,160 +1 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.entityColor = entityColor;
-exports.formatValuePreview = formatValuePreview;
-exports.shallowDiffSummary = shallowDiffSummary;
-/**
- * stateTools — helpers the state tools (redux / zustand / jotai) each carried
- * a private copy of. Pure functions; no React, no RN.
- */
-
-// ============================================
-// Entity color
-// ============================================
-
-/**
- * Consistent color for a named entity (a zustand store, a jotai atom, a redux
- * slice). Exact match on `known` wins, then a substring match, then a stable
- * HSL hash of the name rendered as `#rrggbb` so the "color + alpha hex"
- * pattern works everywhere.
- */
-function entityColor(name, known = {}) {
-  const lower = name.toLowerCase();
-  if (known[lower]) return known[lower];
-  for (const [key, color] of Object.entries(known)) {
-    if (lower.includes(key)) return color;
-  }
-  const hash = name.split("").reduce((acc, char) => acc + char.charCodeAt(0), 0);
-  const hue = hash * 137 % 360;
-  const s = 0.7;
-  const l = 0.6;
-  const c = (1 - Math.abs(2 * l - 1)) * s;
-  const x = c * (1 - Math.abs(hue / 60 % 2 - 1));
-  const m = l - c / 2;
-  let r = 0;
-  let g = 0;
-  let b = 0;
-  if (hue < 60) {
-    r = c;
-    g = x;
-  } else if (hue < 120) {
-    r = x;
-    g = c;
-  } else if (hue < 180) {
-    g = c;
-    b = x;
-  } else if (hue < 240) {
-    g = x;
-    b = c;
-  } else if (hue < 300) {
-    r = x;
-    b = c;
-  } else {
-    r = c;
-    b = x;
-  }
-  const toHex = v => Math.round((v + m) * 255).toString(16).padStart(2, "0");
-  return `#${toHex(r)}${toHex(g)}${toHex(b)}`;
-}
-
-// ============================================
-// Value preview
-// ============================================
-
-/**
- * One-line preview of an arbitrary value for a list row: strings quoted and
- * truncated, arrays and objects stringified when short, otherwise collapsed
- * to `[N items]` / `{ N keys }`. Never throws.
- */
-function formatValuePreview(value, options = {}) {
-  const maxLength = options.maxLength ?? 40;
-  if (value === undefined) return options.undefinedLabel ?? "undefined";
-  if (value === null) return "null";
-  try {
-    if (typeof value === "function") return options.functionLabel ?? "(fn)";
-    if (typeof value === "string") {
-      return value.length > maxLength ? `"${value.slice(0, maxLength - 3)}..."` : `"${value}"`;
-    }
-    if (typeof value === "number" || typeof value === "boolean") {
-      return String(value);
-    }
-    if (Array.isArray(value)) {
-      if (value.length === 0) return "[]";
-      const preview = JSON.stringify(value);
-      return preview.length > maxLength ? `[${value.length} items]` : preview;
-    }
-    if (typeof value === "object") {
-      const keys = Object.keys(value);
-      if (keys.length === 0) return "{}";
-      const preview = JSON.stringify(value);
-      if (preview.length <= maxLength) return preview;
-      return `{ ${keys.length} keys }`;
-    }
-    return String(value).slice(0, maxLength);
-  } catch {
-    return "[complex]";
-  }
-}
-
-// ============================================
-// Shallow diff summary
-// ============================================
-
-/**
- * Top-level, reference-equality diff between two states. Enough for a list
- * row ("+1 ~2 keys"); the detail view runs the real tree diff.
- *
- * A state object that was REPLACED without any top-level value moving —
- * exactly what zustand's persist middleware does when it rehydrates — is
- * reported as `"nested change"` with no keys, never as one changed key with
- * none named.
- */
-function shallowDiffSummary(prev, next) {
-  if (prev === next) {
-    return {
-      summary: "no change",
-      changedKeys: [],
-      changedCount: 0
-    };
-  }
-  if (typeof prev !== "object" || typeof next !== "object" || prev === null || next === null) {
-    return {
-      summary: "changed",
-      changedKeys: [],
-      changedCount: 0
-    };
-  }
-  const prevRecord = prev;
-  const nextRecord = next;
-  const prevKeys = Object.keys(prevRecord);
-  const nextKeys = Object.keys(nextRecord);
-  const added = nextKeys.filter(k => !prevKeys.includes(k));
-  const removed = prevKeys.filter(k => !nextKeys.includes(k));
-  const changed = [];
-  for (const key of prevKeys) {
-    if (nextKeys.includes(key) && prevRecord[key] !== nextRecord[key]) {
-      changed.push(key);
-    }
-  }
-  const changedKeys = [...added, ...removed, ...changed];
-  const parts = [];
-  if (added.length > 0) parts.push(`+${added.length}`);
-  if (removed.length > 0) parts.push(`-${removed.length}`);
-  if (changed.length > 0) parts.push(`~${changed.length}`);
-  if (parts.length === 0) {
-    return {
-      summary: "nested change",
-      changedKeys: [],
-      changedCount: 0
-    };
-  }
-  const total = changedKeys.length;
-  return {
-    summary: `${parts.join(" ")} ${total === 1 ? "key" : "keys"}`,
-    changedKeys,
-    changedCount: total
-  };
-}
+"use strict";Object.defineProperty(exports,"__esModule",{value:true});exports.entityColor=entityColor;exports.formatValuePreview=formatValuePreview;exports.shallowDiffSummary=shallowDiffSummary;function entityColor(e,r={}){const s=e.toLowerCase();if(r[s])return r[s];for(const[g,a]of Object.entries(r)){if(s.includes(g))return a}const f=e.split("").reduce((g,a)=>g+a.charCodeAt(0),0);const n=f*137%360;const l=.7;const u=.6;const o=(1-Math.abs(2*u-1))*l;const c=o*(1-Math.abs(n/60%2-1));const y=u-o/2;let i=0;let h=0;let t=0;if(n<60){i=o;h=c}else if(n<120){i=c;h=o}else if(n<180){h=o;t=c}else if(n<240){h=c;t=o}else if(n<300){i=c;t=o}else{i=o;t=c}const d=g=>Math.round((g+y)*255).toString(16).padStart(2,"0");return`#${d(i)}${d(h)}${d(t)}`}function formatValuePreview(e,r={}){const s=r.maxLength??40;if(e===void 0)return r.undefinedLabel??"undefined";if(e===null)return"null";try{if(typeof e==="function")return r.functionLabel??"(fn)";if(typeof e==="string"){return e.length>s?`"${e.slice(0,s-3)}..."`:`"${e}"`}if(typeof e==="number"||typeof e==="boolean"){return String(e)}if(Array.isArray(e)){if(e.length===0)return"[]";const f=JSON.stringify(e);return f.length>s?`[${e.length} items]`:f}if(typeof e==="object"){const f=Object.keys(e);if(f.length===0)return"{}";const n=JSON.stringify(e);if(n.length<=s)return n;return`{ ${f.length} keys }`}return String(e).slice(0,s)}catch{return"[complex]"}}function shallowDiffSummary(e,r){if(e===r){return{summary:"no change",changedKeys:[],changedCount:0}}if(typeof e!=="object"||typeof r!=="object"||e===null||r===null){return{summary:"changed",changedKeys:[],changedCount:0}}const s=e;const f=r;const n=Object.keys(s);const l=Object.keys(f);const u=l.filter(t=>!n.includes(t));const o=n.filter(t=>!l.includes(t));const c=[];for(const t of n){if(l.includes(t)&&s[t]!==f[t]){c.push(t)}}const y=[...u,...o,...c];const i=[];if(u.length>0)i.push(`+${u.length}`);if(o.length>0)i.push(`-${o.length}`);if(c.length>0)i.push(`~${c.length}`);if(i.length===0){return{summary:"nested change",changedKeys:[],changedCount:0}}const h=y.length;return{summary:`${i.join(" ")} ${h===1?"key":"keys"}`,changedKeys:y,changedCount:h}}