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

package/dist/dom.js

@@ -0,0 +1,269 @@
+/** Kept in step with LOC_TAG in @fluixi/dom's runtime.ts. */
+const LOC_TAG = '__fx_loc';
+/** The position the runtime stamped on an element, when there is one. */
+function locationOf(element) {
+    return element[LOC_TAG];
+}
+/** Elements described per tag. Caps how large a snapshot can get. */
+export 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 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;
+}
+/**
+ * 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 function describeAll(graph, 
+/** What a tag returned. Must not fall back to anything, or two tags claim one element. */
+roots, 
+/** Where a value writes. */
+writtenBy, kinds, 
+/** What plugins attached to an element, when any did. */
+extraFor) {
+    const owners = new Map();
+    const writers = new Map();
+    const rendered = 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 = 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 = 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);
+            // Another tag starts here, so stop. Its DOM goes under its own row.
+            const where = locationOf(element);
+            if (owner !== undefined && owner !== node.id) {
+                return { label: describeElement(element), children: [], owner, element, ...(where ? { at: where } : {}) };
+            }
+            // The element the application was mounted into. It goes above the tag rather than
+            // inside it, and what it holds is reached through the tags themselves, so the walk
+            // stops rather than describing the whole application a second time.
+            if (containers.has(element)) {
+                return { label: describeElement(element), children: [], container: true, element, ...(where ? { at: where } : {}) };
+            }
+            const children = [];
+            // Read once: `children` is live, so indexing it in the condition re-resolves the
+            // collection on every step and a parent with a thousand of them goes quadratic.
+            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);
+            // Only tags nested inside this one. A tag further out writes through this element on
+            // its way down, and putting it here would nest it under its own child.
+            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;
+}
+/** Whether `id` sits under `ancestor` in the component nesting. */
+function within(graph, id, ancestor) {
+    const seen = new Set();
+    for (let at = graph.get(id)?.createdIn; at !== undefined && !seen.has(at); at = graph.get(at)?.createdIn) {
+        if (at === ancestor)
+            return true;
+        seen.add(at);
+    }
+    return false;
+}
+/**
+ * Where a tag that rendered nothing of its own goes: the shallowest element it writes into.
+ * A tag writes to its own insertion point and, through whatever it renders, to everything
+ * below that, so the shallowest is the one it is responsible for.
+ *
+ * Where several land on the same element only the outermost is kept, because the rest come
+ * with it as its children.
+ */
+function landings(graph, rendered, writtenBy, kinds, claimed, containers) {
+    const claimers = new Set(claimed.values());
+    const landing = 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)) {
+            // The mount container holds the whole application; landing a tag in it would put that
+            // tag beside the root instead of under it.
+            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;
+}
+/** How deep a tag sits in the component nesting, following what created it. */
+export function tagDepths(graph, kinds) {
+    const depth = new Map();
+    const of = (id, seen) => {
+        const held = depth.get(id);
+        if (held !== undefined)
+            return held;
+        if (seen.has(id))
+            return 0;
+        seen.add(id);
+        const parent = graph.get(id)?.createdIn;
+        const value = parent === undefined ? 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, new Set());
+    return depth;
+}
+function depthInDocument(element) {
+    let steps = 0;
+    for (let at = element.parentElement; at; at = at.parentElement)
+        steps++;
+    return steps;
+}
+/**
+ * Where to put a tag that returned no element of its own, one whose body is another
+ * component, or a boundary like Suspense. What it writes into is the only evidence of where
+ * its content went.
+ *
+ * Two rules keep this from doing damage. Only elements with no owned ancestor are taken: one
+ * below an owned element is already inside that tag's tree, and claiming it there would cut
+ * the tree in half at an arbitrary point. And where several tags write to the same place, the
+ * innermost wins. Every tag on the path from the root writes through to the leaves, so the
+ * outermost is always a match and never the interesting one.
+ */
+function claimOrphans(graph, rendered, writtenBy, kinds, owners) {
+    const depth = tagDepths(graph, kinds);
+    // An element holding something a tag rendered is a wrapper the application was put into,
+    // not content a tag produced. The outermost tag writing there is the one it belongs to;
+    // for anything else it is the innermost.
+    const wraps = (element) => {
+        for (const owned of owners.keys())
+            if (element !== owned && element.contains(owned))
+                return true;
+        return false;
+    };
+    const writing = 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 = new Map();
+    const containers = 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;
+    };
+    // Shallowest first, so each one is only tested against ancestors already decided.
+    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 };
+}
+/**
+ * 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 function withoutElements(nodes) {
+    return nodes.map(({ element, children, ...rest }) => ({
+        ...rest,
+        children: withoutElements(children),
+    }));
+}

package/dist/dom.mjs

@@ -0,0 +1,183 @@
+// src/dom.ts
+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)
+  }));
+}
+export {
+  DOM_BUDGET,
+  describeAll,
+  describeElement,
+  tagDepths,
+  withoutElements
+};

package/dist/export.cjs

@@ -0,0 +1,221 @@
+"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/export.ts
+var export_exports = {};
+__export(export_exports, {
+  exportGraph: () => exportGraph,
+  graphToJson: () => graphToJson
+});
+module.exports = __toCommonJS(export_exports);
+
+// src/instrument.ts
+var import_signal = require("@fluixi/reactive/signal");
+var import_store = require("@fluixi/reactive/store");
+
+// src/source.ts
+var MARKS = "__FLUIXI_DEVTOOLS_MARKS__";
+var host = globalThis;
+var shared = host[MARKS] ?? {
+  pending: null,
+  expiring: false,
+  components: /* @__PURE__ */ new Map()
+};
+host[MARKS] = shared;
+
+// 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/instrument.ts
+var CORE_STATE = { 0: "clean", 1: "check", 2: "dirty" };
+function nodeVersion(n) {
+  return n.core && typeof n.core.version === "number" ? n.core.version : n.runs;
+}
+function nodeState(n) {
+  return n.core && typeof n.core.state === "number" ? CORE_STATE[n.core.state] : void 0;
+}
+
+// src/export.ts
+var at = (source) => {
+  if (!source) return void 0;
+  const where = `${source.file ?? ""}:${source.line ?? ""}:${source.column ?? ""}`;
+  const out = source.compiled;
+  const same = out?.line === source.line && out?.column === source.column;
+  return out && !same ? `${where} (out ${out.line ?? ""}:${out.column ?? ""})` : where;
+};
+function naming(graph) {
+  const seen = /* @__PURE__ */ new Map();
+  for (const node of graph.values()) seen.set(node.label, (seen.get(node.label) ?? 0) + 1);
+  return (id) => {
+    const node = graph.get(id);
+    if (!node) return `#${id}`;
+    return (seen.get(node.label) ?? 0) > 1 ? `${node.label}#${node.id}` : node.label;
+  };
+}
+function exportGraph(graph, options = {}) {
+  const limit = options.limit ?? 400;
+  const name = naming(graph);
+  const nodes = [...graph.values()].map((node) => {
+    let value = node.detail ?? node.value;
+    if (node.read) {
+      try {
+        value = formatValue(node.read(), limit);
+      } catch {
+      }
+    }
+    const feeds = [...node.deps].map(name);
+    const wrote = [...node.writes].map(name);
+    const state = nodeState(node);
+    return {
+      id: node.id,
+      label: node.label,
+      kind: node.kind,
+      ...node.authored === false ? { authored: false } : {},
+      ...value ? { value } : {},
+      ...node.runs ? { runs: node.runs } : {},
+      // Only a node with a core has one; a static node would report a version of 0.
+      ...node.core?.version !== void 0 ? { version: nodeVersion(node) } : {},
+      ...state ? { state } : {},
+      ...feeds.length ? { reads: feeds } : {},
+      ...wrote.length ? { writes: wrote } : {},
+      ...node.createdIn !== void 0 ? { madeIn: name(node.createdIn) } : {},
+      ...at(node.source) ? { source: at(node.source) } : {},
+      ...at(node.declaredAt) ? { declaredAt: at(node.declaredAt) } : {},
+      ...at(node.usedAt) ? { usedAt: at(node.usedAt) } : {},
+      ...node.targets?.length ? {
+        updates: node.targets.map((target) => {
+          const what = target.name ? `${target.name} of ${target.element}` : target.element;
+          const where = at(target.source);
+          return where ? `${what} — ${where}` : what;
+        })
+      } : {},
+      ...node.setAt?.length ? { setAt: node.setAt.map((s) => at(s)).filter(Boolean) } : {}
+    };
+  });
+  return {
+    t: Date.now(),
+    from: options.fromSource ? "source" : "running application",
+    nodes,
+    ...options.events?.length ? { events: [...options.events] } : {}
+  };
+}
+function graphToJson(graph, options = {}) {
+  return JSON.stringify(exportGraph(graph, options), null, 2);
+}