@fluixi/devtools 0.2.0-alpha.2 → 0.2.0-alpha.4

package/dist/diff.mjs

@@ -0,0 +1,202 @@
+// src/format.ts
+var MAX_DEPTH = 3;
+var MAX_ENTRIES = 8;
+function domName(v) {
+  if (typeof v?.nodeType !== "number" || typeof v.nodeName !== "string") return null;
+  return v.tagName ? `<${v.tagName.toLowerCase()}>` : `#${v.nodeName.toLowerCase()}`;
+}
+function fnName(v) {
+  return v.name ? `ƒ ${v.name}()` : "ƒ";
+}
+function className(v) {
+  const name = v.constructor?.name;
+  return name && name !== "Object" ? `${name} ` : "";
+}
+function primitive(v) {
+  if (v === null) return "null";
+  switch (typeof v) {
+    case "undefined":
+      return "undefined";
+    case "string":
+      return JSON.stringify(v);
+    case "number":
+    case "boolean":
+      return String(v);
+    case "bigint":
+      return `${v}n`;
+    case "symbol":
+      return v.toString();
+    case "function":
+      return fnName(v);
+    default:
+      return null;
+  }
+}
+function walk(value, depth, seen) {
+  const simple = primitive(value);
+  if (simple !== null) return simple;
+  const object = value;
+  if (seen.has(object)) return "[circular]";
+  const dom = domName(object);
+  if (dom) return dom;
+  if (object instanceof Date) return Number.isNaN(object.getTime()) ? "Invalid Date" : object.toISOString();
+  if (object instanceof RegExp) return String(object);
+  if (object instanceof Error) return `${object.name}: ${object.message}`;
+  if (object instanceof Promise) return "Promise";
+  if (ArrayBuffer.isView(object)) {
+    return `${className(object).trim()}(${object.length ?? ""})`;
+  }
+  if (depth >= MAX_DEPTH) return Array.isArray(object) ? "[…]" : "{…}";
+  seen.add(object);
+  try {
+    if (Array.isArray(object)) {
+      const shown2 = object.slice(0, MAX_ENTRIES).map((item) => walk(item, depth + 1, seen));
+      if (object.length > MAX_ENTRIES) shown2.push("…");
+      return `[${shown2.join(", ")}]`;
+    }
+    if (object instanceof Map) {
+      const shown2 = [];
+      for (const [k, v] of object) {
+        if (shown2.length === MAX_ENTRIES) {
+          shown2.push("…");
+          break;
+        }
+        shown2.push(`${walk(k, depth + 1, seen)} => ${walk(v, depth + 1, seen)}`);
+      }
+      return `Map(${object.size}) {${shown2.join(", ")}}`;
+    }
+    if (object instanceof Set) {
+      const shown2 = [];
+      for (const item of object) {
+        if (shown2.length === MAX_ENTRIES) {
+          shown2.push("…");
+          break;
+        }
+        shown2.push(walk(item, depth + 1, seen));
+      }
+      return `Set(${object.size}) {${shown2.join(", ")}}`;
+    }
+    const keys = Object.keys(object);
+    const shown = keys.slice(0, MAX_ENTRIES).map((key) => {
+      let read;
+      try {
+        read = walk(object[key], depth + 1, seen);
+      } catch {
+        read = "[unreadable]";
+      }
+      return `${key}: ${read}`;
+    });
+    if (keys.length > MAX_ENTRIES) shown.push("…");
+    return `${className(object)}{${shown.join(", ")}}`;
+  } finally {
+    seen.delete(object);
+  }
+}
+function formatValue(value, limit = 240) {
+  let text;
+  try {
+    text = walk(value, 0, /* @__PURE__ */ new Set());
+  } catch {
+    text = "[unreadable]";
+  }
+  return text.length > limit ? `${text.slice(0, limit - 1)}…` : text;
+}
+
+// src/diff.ts
+var MAX_ENTRIES2 = 24;
+var ENTRY_VALUE = 120;
+var ENTRY_JSON = 4e3;
+var show = (value) => formatValue(value, ENTRY_VALUE);
+function json(value) {
+  if (value === null || typeof value !== "object") return void 0;
+  try {
+    const text = JSON.stringify(value);
+    return text && text.length <= ENTRY_JSON ? text : void 0;
+  } catch {
+    return void 0;
+  }
+}
+var side = (value, key) => {
+  const text = json(value);
+  return { [key]: show(value), ...text ? { [`${key}Json`]: text } : {} };
+};
+var isPlainObject = (value) => typeof value === "object" && value !== null && !Array.isArray(value);
+function same(a, b) {
+  if (Object.is(a, b)) return true;
+  if (typeof a !== "object" || typeof b !== "object" || a === null || b === null) return false;
+  if (Array.isArray(a) !== Array.isArray(b)) return false;
+  const ka = Object.keys(a);
+  const kb = Object.keys(b);
+  if (ka.length !== kb.length) return false;
+  return ka.every((k) => Object.is(a[k], b[k]));
+}
+function diffArray(before, after) {
+  let head = 0;
+  while (head < before.length && head < after.length && same(before[head], after[head])) head++;
+  let tail = 0;
+  while (tail < before.length - head && tail < after.length - head && same(before[before.length - 1 - tail], after[after.length - 1 - tail])) {
+    tail++;
+  }
+  const entries = [];
+  let skipped = 0;
+  const push = (entry) => {
+    if (entries.length < MAX_ENTRIES2) entries.push(entry);
+    else skipped++;
+  };
+  const removedCount = before.length - head - tail;
+  const addedCount = after.length - head - tail;
+  const overlap = Math.min(removedCount, addedCount);
+  for (let i = 0; i < overlap; i++) {
+    push({
+      key: String(head + i),
+      op: "changed",
+      ...side(before[head + i], "from"),
+      ...side(after[head + i], "to")
+    });
+  }
+  for (let i = overlap; i < addedCount; i++) {
+    push({ key: String(head + i), op: "added", ...side(after[head + i], "to") });
+  }
+  for (let i = overlap; i < removedCount; i++) {
+    push({ key: String(head + i), op: "removed", ...side(before[head + i], "from") });
+  }
+  return {
+    shape: "array",
+    entries,
+    ...skipped ? { more: skipped } : {},
+    ...before.length !== after.length ? { length: { from: before.length, to: after.length } } : {}
+  };
+}
+function diffObject(before, after) {
+  const entries = [];
+  let skipped = 0;
+  const push = (entry) => {
+    if (entries.length < MAX_ENTRIES2) entries.push(entry);
+    else skipped++;
+  };
+  for (const key of /* @__PURE__ */ new Set([...Object.keys(before), ...Object.keys(after)])) {
+    const had = key in before;
+    const has = key in after;
+    if (had && has) {
+      if (!same(before[key], after[key])) {
+        push({ key, op: "changed", ...side(before[key], "from"), ...side(after[key], "to") });
+      }
+    } else if (has) push({ key, op: "added", ...side(after[key], "to") });
+    else push({ key, op: "removed", ...side(before[key], "from") });
+  }
+  return { shape: "object", entries, ...skipped ? { more: skipped } : {} };
+}
+function diffValues(before, after) {
+  if (Array.isArray(before) && Array.isArray(after)) {
+    const change = diffArray(before, after);
+    return change.entries?.length || change.length ? change : void 0;
+  }
+  if (isPlainObject(before) && isPlainObject(after)) {
+    const change = diffObject(before, after);
+    return change.entries?.length ? change : void 0;
+  }
+  return void 0;
+}
+export {
+  diffValues
+};

package/dist/dom.cjs

@@ -0,0 +1,204 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// src/dom.ts
+var dom_exports = {};
+__export(dom_exports, {
+  DOM_BUDGET: () => DOM_BUDGET,
+  describeAll: () => describeAll,
+  describeElement: () => describeElement,
+  tagDepths: () => tagDepths,
+  withoutElements: () => withoutElements
+});
+module.exports = __toCommonJS(dom_exports);
+var LOC_TAG = "__fx_loc";
+function locationOf(element) {
+  return element[LOC_TAG];
+}
+var DOM_BUDGET = 200;
+function describeElement(element) {
+  let out = element.tagName.toLowerCase();
+  if (element.id) out += `#${element.id}`;
+  const classes = element.classList;
+  if (classes.length > 0) {
+    out += `.${classes[0]}`;
+    if (classes.length > 1) out += `.${classes[1]}`;
+  }
+  return out;
+}
+function describeAll(graph, roots, writtenBy, kinds, extraFor) {
+  const owners = /* @__PURE__ */ new Map();
+  const writers = /* @__PURE__ */ new Map();
+  const rendered = /* @__PURE__ */ new Map();
+  for (const node of graph.values()) {
+    if (kinds.has(node.kind)) {
+      const found = roots(node.id);
+      rendered.set(node.id, found);
+      for (const element of found) if (!owners.has(element)) owners.set(element, node.id);
+      continue;
+    }
+    for (const element of writtenBy(node.id)) {
+      const held = writers.get(element);
+      if (held) held.push(node.id);
+      else writers.set(element, [node.id]);
+    }
+  }
+  const { claimed, containers } = claimOrphans(graph, rendered, writtenBy, kinds, owners);
+  const claims = /* @__PURE__ */ new Map();
+  for (const [element, id] of claimed) {
+    const held = claims.get(id);
+    if (held) held.push(element);
+    else claims.set(id, [element]);
+  }
+  const landing = landings(graph, rendered, writtenBy, kinds, claimed, containers);
+  const out = /* @__PURE__ */ new Map();
+  for (const node of graph.values()) {
+    if (!kinds.has(node.kind)) continue;
+    const budget = { left: DOM_BUDGET };
+    const walk = (element) => {
+      const owner = owners.get(element) ?? claimed.get(element);
+      const where = locationOf(element);
+      if (owner !== void 0 && owner !== node.id) {
+        return { label: describeElement(element), children: [], owner, element, ...where ? { at: where } : {} };
+      }
+      if (containers.has(element)) {
+        return { label: describeElement(element), children: [], container: true, element, ...where ? { at: where } : {} };
+      }
+      const children = [];
+      const kids = element.children;
+      for (let i = 0, n = kids.length; i < n && budget.left > 0; i++) {
+        budget.left -= 1;
+        children.push(walk(kids[i]));
+      }
+      const writes = writers.get(element);
+      const extra = extraFor?.(element);
+      const inside = landing.get(element)?.filter((id) => within(graph, id, node.id));
+      return {
+        label: describeElement(element),
+        children,
+        element,
+        ...where ? { at: where } : {},
+        ...writes?.length ? { writes } : {},
+        ...inside?.length ? { inside } : {},
+        ...extra ? { extra } : {}
+      };
+    };
+    out.set(node.id, [...rendered.get(node.id) ?? [], ...claims.get(node.id) ?? []].map(walk));
+  }
+  return out;
+}
+function within(graph, id, ancestor) {
+  const seen = /* @__PURE__ */ new Set();
+  for (let at = graph.get(id)?.createdIn; at !== void 0 && !seen.has(at); at = graph.get(at)?.createdIn) {
+    if (at === ancestor) return true;
+    seen.add(at);
+  }
+  return false;
+}
+function landings(graph, rendered, writtenBy, kinds, claimed, containers) {
+  const claimers = new Set(claimed.values());
+  const landing = /* @__PURE__ */ new Map();
+  for (const node of graph.values()) {
+    if (!kinds.has(node.kind) || (rendered.get(node.id) ?? []).length) continue;
+    if (claimers.has(node.id)) continue;
+    let shallowest;
+    let best = Infinity;
+    for (const element of writtenBy(node.id)) {
+      if (containers.has(element)) continue;
+      const depth = depthInDocument(element);
+      if (depth < best) {
+        best = depth;
+        shallowest = element;
+      }
+    }
+    if (!shallowest) continue;
+    const held = landing.get(shallowest);
+    if (held) held.push(node.id);
+    else landing.set(shallowest, [node.id]);
+  }
+  for (const [element, ids] of landing) {
+    landing.set(element, ids.filter((id) => !ids.some((other) => other !== id && within(graph, id, other))));
+  }
+  return landing;
+}
+function tagDepths(graph, kinds) {
+  const depth = /* @__PURE__ */ new Map();
+  const of = (id, seen) => {
+    const held = depth.get(id);
+    if (held !== void 0) return held;
+    if (seen.has(id)) return 0;
+    seen.add(id);
+    const parent = graph.get(id)?.createdIn;
+    const value = parent === void 0 ? 0 : of(parent, seen) + 1;
+    depth.set(id, value);
+    return value;
+  };
+  for (const node of graph.values()) if (kinds.has(node.kind)) of(node.id, /* @__PURE__ */ new Set());
+  return depth;
+}
+function depthInDocument(element) {
+  let steps = 0;
+  for (let at = element.parentElement; at; at = at.parentElement) steps++;
+  return steps;
+}
+function claimOrphans(graph, rendered, writtenBy, kinds, owners) {
+  const depth = tagDepths(graph, kinds);
+  const wraps = (element) => {
+    for (const owned of owners.keys()) if (element !== owned && element.contains(owned)) return true;
+    return false;
+  };
+  const writing = /* @__PURE__ */ new Map();
+  for (const node of graph.values()) {
+    if (!kinds.has(node.kind) || (rendered.get(node.id) ?? []).length) continue;
+    for (const element of writtenBy(node.id)) {
+      if (owners.has(element)) continue;
+      const held = writing.get(element);
+      if (held) held.push(node.id);
+      else writing.set(element, [node.id]);
+    }
+  }
+  const claimed = /* @__PURE__ */ new Map();
+  const containers = /* @__PURE__ */ new Set();
+  const covered = (element) => {
+    for (let at = element.parentElement; at; at = at.parentElement) {
+      if (owners.has(at) || claimed.has(at)) return true;
+    }
+    return false;
+  };
+  const order = [...writing.keys()].sort((a, b) => depthInDocument(a) - depthInDocument(b));
+  for (const element of order) {
+    if (covered(element)) continue;
+    const ids = writing.get(element);
+    const container = wraps(element);
+    const pick = ids.reduce((best, id) => {
+      const a = depth.get(id) ?? 0;
+      const b = depth.get(best) ?? 0;
+      return container ? a < b ? id : best : a > b ? id : best;
+    });
+    claimed.set(element, pick);
+    if (container) containers.add(element);
+  }
+  return { claimed, containers };
+}
+function withoutElements(nodes) {
+  return nodes.map(({ element, children, ...rest }) => ({
+    ...rest,
+    children: withoutElements(children)
+  }));
+}

package/dist/dom.d.ts

@@ -0,0 +1,81 @@
+/**
+ * A serialisable description of the DOM a tag rendered.
+ *
+ * The chrome panel reads the graph through `eval` and the editor panel over http, so neither
+ * can hold Elements. This is the same tree with the elements reduced to labels.
+ *
+ * The walk stops at any element that is another tag's root and records that tag's id in
+ * `owner`. That keeps the result a tree of the application rather than the whole document,
+ * and lets the consumer nest the child tag's own DOM under its own row.
+ */
+import type { RNode } from './instrument.js';
+export interface DomNode {
+    /** The element as a selector: `div#app.card`. */
+    label: string;
+    children: DomNode[];
+    /** The node whose root this element is, when it is one. */
+    owner?: number;
+    /**
+     * Ids of the values that write into this element. A consumer outside the page has no
+     * elements to compare, so it cannot work this out for itself.
+     */
+    writes?: number[];
+    /**
+     * Tags that render inside this element without producing one of their own, such as a boundary
+     * like Suspense, or a component whose body is another component. They sit here rather than
+     * beside the element, which is where the nesting actually puts them.
+     */
+    inside?: number[];
+    /**
+     * The element the application was mounted into. It is nobody's output, having been on the
+     * page first, so it belongs above the root tag rather than under it.
+     */
+    container?: boolean;
+    /**
+     * Where the element was written. Stamped on it by the runtime when the compiler listed
+     * the positions of a template's elements; absent in a build without source locations.
+     */
+    at?: {
+        file: string;
+        line: number;
+        column: number;
+    };
+    /** What plugins attached to this element, by plugin name. */
+    extra?: Record<string, unknown>;
+    /** Set only in-page. A description that crossed a wire has no element. */
+    element?: Element;
+}
+/** Elements described per tag. Caps how large a snapshot can get. */
+export declare const DOM_BUDGET = 200;
+/**
+ * Static attributes only: a class computed at runtime is not in the source.
+ *
+ * Written out rather than spread-and-join. This runs once per element of the page on every
+ * sample, and building three throwaway arrays to read at most two class names cost more
+ * than everything else the walk does.
+ */
+export declare function describeElement(element: Element): string;
+/**
+ * Describe what every tag rendered, in one pass.
+ *
+ * Per-tag would rebuild the element maps each time, which is enough work to stall a render
+ * loop on a page of any size.
+ */
+export declare function describeAll(graph: Map<number, RNode>, 
+/** What a tag returned. Must not fall back to anything, or two tags claim one element. */
+roots: (of: number) => readonly Element[], 
+/** Where a value writes. */
+writtenBy: (of: number) => readonly Element[], kinds: ReadonlySet<string>, 
+/** What plugins attached to an element, when any did. */
+extraFor?: (element: Element) => Record<string, unknown> | undefined): Map<number, DomNode[]>;
+/** How deep a tag sits in the component nesting, following what created it. */
+export declare function tagDepths(graph: Map<number, RNode>, kinds: ReadonlySet<string>): Map<number, number>;
+/**
+ * Drop the Elements so the result can be serialised.
+ *
+ * Everything else is copied as-is rather than field by field. The copy that describes and the
+ * copy that strips are built separately, since an extension bundles its own, so a list of fields
+ * here goes stale against a description made elsewhere, and the field just disappears.
+ */
+export declare function withoutElements(nodes: readonly DomNode[]): DomNode[];
+//# sourceMappingURL=dom.d.ts.map

package/dist/dom.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dom.d.ts","sourceRoot":"","sources":["../src/dom.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,iBAAiB,CAAC;AAE7C,MAAM,WAAW,OAAO;IACtB,iDAAiD;IACjD,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,OAAO,EAAE,CAAC;IACpB,2DAA2D;IAC3D,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;;OAGG;IACH,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;IAClB;;;;OAIG;IACH,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;IAClB;;;OAGG;IACH,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB;;;OAGG;IACH,EAAE,CAAC,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;IACpD,6DAA6D;IAC7D,KAAK,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAChC,0EAA0E;IAC1E,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AAUD,qEAAqE;AACrE,eAAO,MAAM,UAAU,MAAM,CAAC;AAE9B;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,OAAO,EAAE,OAAO,GAAG,MAAM,CASxD;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC;AACzB,0FAA0F;AAC1F,KAAK,EAAE,CAAC,EAAE,EAAE,MAAM,KAAK,SAAS,OAAO,EAAE;AACzC,4BAA4B;AAC5B,SAAS,EAAE,CAAC,EAAE,EAAE,MAAM,KAAK,SAAS,OAAO,EAAE,EAC7C,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC;AAC1B,yDAAyD;AACzD,QAAQ,CAAC,EAAE,CAAC,OAAO,EAAE,OAAO,KAAK,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,GACnE,GAAG,CAAC,MAAM,EAAE,OAAO,EAAE,CAAC,CAwExB;AAwDD,+EAA+E;AAC/E,wBAAgB,SAAS,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAcpG;AAuED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,SAAS,OAAO,EAAE,GAAG,OAAO,EAAE,CAKpE"}