@dou-ui/flow 0.0.0-stage → 0.1.0-alpha.0

package/dist/core/transaction.js

@@ -0,0 +1,288 @@
+// src/core/transaction.ts
+function patched(item, patch) {
+	const next = { ...item };
+	for (const key of Object.keys(patch)) {
+		const value = patch[key];
+		if (value === void 0) delete next[key];
+		else next[key] = value;
+	}
+	return next;
+}
+/** The values `patch` would replace, so applying them restores `item`. */
+function previous(item, patch) {
+	const old = {};
+	for (const key of Object.keys(patch)) old[key] = item[key];
+	return old;
+}
+var sameValue = (a, b) => a === b;
+/**
+* A batch of changes to a document. Steps apply as they are added, so
+* later calls see earlier ones; `doc` is the result.
+*/
+var FlowTransaction = class {
+	before;
+	steps = [];
+	/** The steps that undo this transaction, in the order to apply them. */
+	inverse = [];
+	meta = {};
+	nodes;
+	edges;
+	copied = {
+		nodes: false,
+		edges: false
+	};
+	constructor(before) {
+		this.before = before;
+		this.nodes = before.nodes;
+		this.edges = before.edges;
+	}
+	get doc() {
+		if (!this.steps.length) return this.before;
+		return {
+			...this.before,
+			nodes: this.nodes,
+			edges: this.edges
+		};
+	}
+	/** Whether the change makes any change: it has steps and wasn't cancelled. */
+	get changed() {
+		return this.steps.length > 0 && !this.stopped;
+	}
+	stopped = null;
+	/**
+	* Stops the change: none of it is applied or kept for undo, and the
+	* editor fires `transactionCancel` and says why. For an extension's `transaction`
+	* hook, e.g. to keep people from changing what they may not; hooks after
+	* it don't run. A change kept out of the history (`meta.history: false`),
+	* such as undo, redo or another person's, can't be cancelled and goes ahead.
+	*/
+	cancel(reason) {
+		if (this.meta.history !== false) this.stopped = { reason };
+		else warnUncancellable();
+		return this;
+	}
+	/** Whether `cancel` stopped it. */
+	get cancelled() {
+		return this.stopped !== null;
+	}
+	/** What `cancel` was given, to tell people why. */
+	get cancelReason() {
+		return this.stopped?.reason;
+	}
+	getNode(id) {
+		return this.nodes.find((node) => node.id === id);
+	}
+	getEdge(id) {
+		return this.edges.find((edge) => edge.id === id);
+	}
+	/** Edges that start or end at a node. */
+	edgesOf(id) {
+		return this.edges.filter((edge) => edge.source.node === id || edge.target.node === id);
+	}
+	setMeta(meta) {
+		Object.assign(this.meta, meta);
+		return this;
+	}
+	step(step) {
+		const inverse = this.apply(step);
+		if (inverse) {
+			this.steps.push(step);
+			this.inverse.unshift(inverse);
+		}
+		return this;
+	}
+	addNode(node, index) {
+		return this.step({
+			type: "addNode",
+			node,
+			index
+		});
+	}
+	/** Removes a node and every edge attached to it. */
+	removeNode(id) {
+		for (const edge of this.edgesOf(id)) this.removeEdge(edge.id);
+		return this.step({
+			type: "removeNode",
+			id
+		});
+	}
+	updateNode(id, patch) {
+		return this.step({
+			type: "updateNode",
+			id,
+			patch
+		});
+	}
+	moveNode(id, x, y) {
+		return this.updateNode(id, {
+			x,
+			y
+		});
+	}
+	/** Merges `patch` into the node's `data`. */
+	updateData(id, patch) {
+		const node = this.getNode(id);
+		if (!node) return this;
+		return this.updateNode(id, { data: {
+			...node.data,
+			...patch
+		} });
+	}
+	addEdge(edge, index) {
+		return this.step({
+			type: "addEdge",
+			edge,
+			index
+		});
+	}
+	removeEdge(id) {
+		return this.step({
+			type: "removeEdge",
+			id
+		});
+	}
+	updateEdge(id, patch) {
+		return this.step({
+			type: "updateEdge",
+			id,
+			patch
+		});
+	}
+	writable(kind) {
+		if (!this.copied[kind]) {
+			this.copied[kind] = true;
+			if (kind === "nodes") this.nodes = this.nodes.slice();
+			else this.edges = this.edges.slice();
+		}
+		return kind === "nodes" ? this.nodes : this.edges;
+	}
+	/** Applies a step and returns its inverse, or `null` when it changes nothing. */
+	apply(step) {
+		switch (step.type) {
+			case "addNode": {
+				if (this.getNode(step.node.id)) return null;
+				const list = this.writable("nodes");
+				const index = clampIndex(step.index, list.length);
+				list.splice(index, 0, step.node);
+				return {
+					type: "removeNode",
+					id: step.node.id
+				};
+			}
+			case "removeNode": {
+				const index = this.nodes.findIndex((node) => node.id === step.id);
+				if (index < 0) return null;
+				const [node] = this.writable("nodes").splice(index, 1);
+				return {
+					type: "addNode",
+					node,
+					index
+				};
+			}
+			case "updateNode": {
+				const index = this.nodes.findIndex((node) => node.id === step.id);
+				if (index < 0) return null;
+				const node = this.nodes[index];
+				if (Object.keys(step.patch).every((key) => sameValue(node[key], step.patch[key]))) return null;
+				const list = this.writable("nodes");
+				list[index] = patched(node, step.patch);
+				return {
+					type: "updateNode",
+					id: step.id,
+					patch: previous(node, step.patch)
+				};
+			}
+			case "addEdge": {
+				if (this.getEdge(step.edge.id)) return null;
+				const list = this.writable("edges");
+				list.splice(clampIndex(step.index, list.length), 0, step.edge);
+				return {
+					type: "removeEdge",
+					id: step.edge.id
+				};
+			}
+			case "removeEdge": {
+				const index = this.edges.findIndex((edge) => edge.id === step.id);
+				if (index < 0) return null;
+				const [edge] = this.writable("edges").splice(index, 1);
+				return {
+					type: "addEdge",
+					edge,
+					index
+				};
+			}
+			case "updateEdge": {
+				const index = this.edges.findIndex((edge) => edge.id === step.id);
+				if (index < 0) return null;
+				const edge = this.edges[index];
+				if (Object.keys(step.patch).every((key) => sameValue(edge[key], step.patch[key]))) return null;
+				const list = this.writable("edges");
+				list[index] = patched(edge, step.patch);
+				return {
+					type: "updateEdge",
+					id: step.id,
+					patch: previous(edge, step.patch)
+				};
+			}
+		}
+	}
+};
+function clampIndex(index, length) {
+	if (index == null) return length;
+	return Math.max(0, Math.min(length, index));
+}
+/** Applies steps to a document; steps that no longer apply are skipped. */
+function applyFlowSteps(doc, steps) {
+	const tr = new FlowTransaction(doc);
+	for (const step of steps) tr.step(step);
+	return tr;
+}
+var targetOf = (step) => {
+	switch (step.type) {
+		case "addNode": return `n:${step.node.id}`;
+		case "addEdge": return `e:${step.edge.id}`;
+		case "removeNode":
+		case "updateNode": return `n:${step.id}`;
+		case "removeEdge":
+		case "updateEdge": return `e:${step.id}`;
+	}
+};
+/**
+* Folds updates of the same node or edge into one, as long as nothing
+* adds or removes it in between. Updates of different targets commute, so
+* the result applies the same as the original list.
+*/
+function compactFlowSteps(steps) {
+	const out = [];
+	const lastUpdate = /* @__PURE__ */ new Map();
+	for (const step of steps) {
+		const target = targetOf(step);
+		if (step.type === "updateNode" || step.type === "updateEdge") {
+			const at = lastUpdate.get(target);
+			if (at != null) {
+				const prev = out[at];
+				out[at] = {
+					...prev,
+					patch: {
+						...prev.patch,
+						...step.patch
+					}
+				};
+				continue;
+			}
+			lastUpdate.set(target, out.length);
+		} else lastUpdate.delete(target);
+		out.push(step);
+	}
+	return out.filter((step) => step != null);
+}
+var warnedUncancellable = false;
+/** Says once that cancelling a change kept out of the history does nothing. */
+function warnUncancellable() {
+	if (process.env.NODE_ENV === "production" || warnedUncancellable) return;
+	warnedUncancellable = true;
+	console.warn("[@dou-ui/flow] a change kept out of the history (undo, redo or another person's) can't be cancelled; it goes ahead");
+}
+export { FlowTransaction, applyFlowSteps, compactFlowSteps };
+
+//# sourceMappingURL=transaction.js.map

package/dist/core/transaction.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"transaction.js","names":[],"sources":["../../src/core/transaction.ts"],"sourcesContent":["import type { FlowDocument, FlowEdge, FlowNode } from './model'\n\n/*\n * Every change to a document is a list of steps. Applying a step also\n * gives the step that undoes it, so history, collaboration and the\n * `transaction` event all work on the same small vocabulary.\n */\n\ntype Patch<T> = { [K in keyof T]?: T[K] | undefined }\n\nexport type FlowStep =\n  | { type: 'addNode'; node: FlowNode; index?: number }\n  | { type: 'removeNode'; id: string }\n  | { type: 'updateNode'; id: string; patch: Patch<FlowNode> }\n  | { type: 'addEdge'; edge: FlowEdge; index?: number }\n  | { type: 'removeEdge'; id: string }\n  | { type: 'updateEdge'; id: string; patch: Patch<FlowEdge> }\n\nexport interface FlowTransactionMeta {\n  /** Keep out of the undo history, e.g. changes from another client. */\n  history?: boolean\n  /**\n   * Consecutive transactions in the same group within a second undo as\n   * one, e.g. the frames of a drag or repeated arrow key nudges.\n   */\n  group?: string\n  /** Who made the change, passed on to the `transaction` event. */\n  origin?: string\n}\n\nfunction patched<T extends object>(item: T, patch: Patch<T>): T {\n  const next = { ...item } as Record<string, unknown>\n  for (const key of Object.keys(patch)) {\n    const value = (patch as Record<string, unknown>)[key]\n    if (value === undefined) delete next[key]\n    else next[key] = value\n  }\n  return next as T\n}\n\n/** The values `patch` would replace, so applying them restores `item`. */\nfunction previous<T extends object>(item: T, patch: Patch<T>): Patch<T> {\n  const old: Record<string, unknown> = {}\n  for (const key of Object.keys(patch)) old[key] = (item as Record<string, unknown>)[key]\n  return old as Patch<T>\n}\n\nconst sameValue = (a: unknown, b: unknown) => a === b\n\n/**\n * A batch of changes to a document. Steps apply as they are added, so\n * later calls see earlier ones; `doc` is the result.\n */\nexport class FlowTransaction {\n  readonly steps: FlowStep[] = []\n  /** The steps that undo this transaction, in the order to apply them. */\n  readonly inverse: FlowStep[] = []\n  meta: FlowTransactionMeta = {}\n  private nodes: FlowNode[]\n  private edges: FlowEdge[]\n  private copied = { nodes: false, edges: false }\n\n  constructor(readonly before: FlowDocument) {\n    this.nodes = before.nodes\n    this.edges = before.edges\n  }\n\n  get doc(): FlowDocument {\n    if (!this.steps.length) return this.before\n    return { ...this.before, nodes: this.nodes, edges: this.edges }\n  }\n\n  /** Whether the change makes any change: it has steps and wasn't cancelled. */\n  get changed() {\n    return this.steps.length > 0 && !this.stopped\n  }\n\n  private stopped: { reason?: string } | null = null\n\n  /**\n   * Stops the change: none of it is applied or kept for undo, and the\n   * editor fires `transactionCancel` and says why. For an extension's `transaction`\n   * hook, e.g. to keep people from changing what they may not; hooks after\n   * it don't run. A change kept out of the history (`meta.history: false`),\n   * such as undo, redo or another person's, can't be cancelled and goes ahead.\n   */\n  cancel(reason?: string) {\n    if (this.meta.history !== false) this.stopped = { reason }\n    else warnUncancellable()\n    return this\n  }\n\n  /** Whether `cancel` stopped it. */\n  get cancelled() {\n    return this.stopped !== null\n  }\n\n  /** What `cancel` was given, to tell people why. */\n  get cancelReason() {\n    return this.stopped?.reason\n  }\n\n  getNode(id: string) {\n    return this.nodes.find((node) => node.id === id)\n  }\n\n  getEdge(id: string) {\n    return this.edges.find((edge) => edge.id === id)\n  }\n\n  /** Edges that start or end at a node. */\n  edgesOf(id: string) {\n    return this.edges.filter((edge) => edge.source.node === id || edge.target.node === id)\n  }\n\n  setMeta(meta: FlowTransactionMeta) {\n    Object.assign(this.meta, meta)\n    return this\n  }\n\n  step(step: FlowStep) {\n    const inverse = this.apply(step)\n    if (inverse) {\n      this.steps.push(step)\n      this.inverse.unshift(inverse)\n    }\n    return this\n  }\n\n  addNode(node: FlowNode, index?: number) {\n    return this.step({ type: 'addNode', node, index })\n  }\n\n  /** Removes a node and every edge attached to it. */\n  removeNode(id: string) {\n    for (const edge of this.edgesOf(id)) this.removeEdge(edge.id)\n    return this.step({ type: 'removeNode', id })\n  }\n\n  updateNode(id: string, patch: Patch<FlowNode>) {\n    return this.step({ type: 'updateNode', id, patch })\n  }\n\n  moveNode(id: string, x: number, y: number) {\n    return this.updateNode(id, { x, y })\n  }\n\n  /** Merges `patch` into the node's `data`. */\n  updateData(id: string, patch: Record<string, unknown>) {\n    const node = this.getNode(id)\n    if (!node) return this\n    return this.updateNode(id, { data: { ...node.data, ...patch } })\n  }\n\n  addEdge(edge: FlowEdge, index?: number) {\n    return this.step({ type: 'addEdge', edge, index })\n  }\n\n  removeEdge(id: string) {\n    return this.step({ type: 'removeEdge', id })\n  }\n\n  updateEdge(id: string, patch: Patch<FlowEdge>) {\n    return this.step({ type: 'updateEdge', id, patch })\n  }\n\n  private writable(kind: 'nodes' | 'edges') {\n    if (!this.copied[kind]) {\n      this.copied[kind] = true\n      if (kind === 'nodes') this.nodes = this.nodes.slice()\n      else this.edges = this.edges.slice()\n    }\n    return kind === 'nodes' ? this.nodes : this.edges\n  }\n\n  /** Applies a step and returns its inverse, or `null` when it changes nothing. */\n  private apply(step: FlowStep): FlowStep | null {\n    switch (step.type) {\n      case 'addNode': {\n        if (this.getNode(step.node.id)) return null\n        const list = this.writable('nodes') as FlowNode[]\n        const index = clampIndex(step.index, list.length)\n        list.splice(index, 0, step.node)\n        return { type: 'removeNode', id: step.node.id }\n      }\n      case 'removeNode': {\n        const index = this.nodes.findIndex((node) => node.id === step.id)\n        if (index < 0) return null\n        const list = this.writable('nodes') as FlowNode[]\n        const [node] = list.splice(index, 1)\n        return { type: 'addNode', node: node!, index }\n      }\n      case 'updateNode': {\n        const index = this.nodes.findIndex((node) => node.id === step.id)\n        if (index < 0) return null\n        const node = this.nodes[index]!\n        const keys = Object.keys(step.patch) as (keyof FlowNode)[]\n        if (keys.every((key) => sameValue(node[key], step.patch[key]))) return null\n        const list = this.writable('nodes') as FlowNode[]\n        list[index] = patched(node, step.patch)\n        return { type: 'updateNode', id: step.id, patch: previous(node, step.patch) }\n      }\n      case 'addEdge': {\n        if (this.getEdge(step.edge.id)) return null\n        const list = this.writable('edges') as FlowEdge[]\n        list.splice(clampIndex(step.index, list.length), 0, step.edge)\n        return { type: 'removeEdge', id: step.edge.id }\n      }\n      case 'removeEdge': {\n        const index = this.edges.findIndex((edge) => edge.id === step.id)\n        if (index < 0) return null\n        const list = this.writable('edges') as FlowEdge[]\n        const [edge] = list.splice(index, 1)\n        return { type: 'addEdge', edge: edge!, index }\n      }\n      case 'updateEdge': {\n        const index = this.edges.findIndex((edge) => edge.id === step.id)\n        if (index < 0) return null\n        const edge = this.edges[index]!\n        const keys = Object.keys(step.patch) as (keyof FlowEdge)[]\n        if (keys.every((key) => sameValue(edge[key], step.patch[key]))) return null\n        const list = this.writable('edges') as FlowEdge[]\n        list[index] = patched(edge, step.patch)\n        return { type: 'updateEdge', id: step.id, patch: previous(edge, step.patch) }\n      }\n    }\n  }\n}\n\nfunction clampIndex(index: number | undefined, length: number) {\n  if (index == null) return length\n  return Math.max(0, Math.min(length, index))\n}\n\n/** Applies steps to a document; steps that no longer apply are skipped. */\nexport function applyFlowSteps(doc: FlowDocument, steps: readonly FlowStep[]) {\n  const tr = new FlowTransaction(doc)\n  for (const step of steps) tr.step(step)\n  return tr\n}\n\nconst targetOf = (step: FlowStep) => {\n  switch (step.type) {\n    case 'addNode':\n      return `n:${step.node.id}`\n    case 'addEdge':\n      return `e:${step.edge.id}`\n    case 'removeNode':\n    case 'updateNode':\n      return `n:${step.id}`\n    case 'removeEdge':\n    case 'updateEdge':\n      return `e:${step.id}`\n  }\n}\n\n/**\n * Folds updates of the same node or edge into one, as long as nothing\n * adds or removes it in between. Updates of different targets commute, so\n * the result applies the same as the original list.\n */\nexport function compactFlowSteps(steps: readonly FlowStep[]): FlowStep[] {\n  const out: (FlowStep | null)[] = []\n  const lastUpdate = new Map<string, number>()\n  for (const step of steps) {\n    const target = targetOf(step)\n    if (step.type === 'updateNode' || step.type === 'updateEdge') {\n      const at = lastUpdate.get(target)\n      if (at != null) {\n        const prev = out[at] as typeof step\n        out[at] = { ...prev, patch: { ...prev.patch, ...step.patch } } as FlowStep\n        continue\n      }\n      lastUpdate.set(target, out.length)\n    } else {\n      lastUpdate.delete(target)\n    }\n    out.push(step)\n  }\n  return out.filter((step): step is FlowStep => step != null)\n}\n\nlet warnedUncancellable = false\n/** Says once that cancelling a change kept out of the history does nothing. */\nfunction warnUncancellable() {\n  // the app's bundler replaces this, as for Vue's own warnings\n  if (process.env.NODE_ENV === 'production' || warnedUncancellable) return\n  warnedUncancellable = true\n  console.warn(\n    \"[@dou-ui/flow] a change kept out of the history (undo, redo or another person's) can't be cancelled; it goes ahead\",\n  )\n}\n"],"mappings":";AA8BA,SAAS,QAA0B,MAAS,OAAoB;CAC9D,MAAM,OAAO,EAAE,GAAG,KAAK;CACvB,KAAK,MAAM,OAAO,OAAO,KAAK,KAAK,GAAG;EACpC,MAAM,QAAS,MAAkC;EACjD,IAAI,UAAU,KAAA,GAAW,OAAO,KAAK;OAChC,KAAK,OAAO;CACnB;CACA,OAAO;AACT;;AAGA,SAAS,SAA2B,MAAS,OAA2B;CACtE,MAAM,MAA+B,CAAC;CACtC,KAAK,MAAM,OAAO,OAAO,KAAK,KAAK,GAAG,IAAI,OAAQ,KAAiC;CACnF,OAAO;AACT;AAEA,IAAM,aAAa,GAAY,MAAe,MAAM;;;;;AAMpD,IAAa,kBAAb,MAA6B;CASN;CARrB,QAA6B,CAAC;;CAE9B,UAA+B,CAAC;CAChC,OAA4B,CAAC;CAC7B;CACA;CACA,SAAiB;EAAE,OAAO;EAAO,OAAO;CAAM;CAE9C,YAAY,QAA+B;EAAtB,KAAA,SAAA;EACnB,KAAK,QAAQ,OAAO;EACpB,KAAK,QAAQ,OAAO;CACtB;CAEA,IAAI,MAAoB;EACtB,IAAI,CAAC,KAAK,MAAM,QAAQ,OAAO,KAAK;EACpC,OAAO;GAAE,GAAG,KAAK;GAAQ,OAAO,KAAK;GAAO,OAAO,KAAK;EAAM;CAChE;;CAGA,IAAI,UAAU;EACZ,OAAO,KAAK,MAAM,SAAS,KAAK,CAAC,KAAK;CACxC;CAEA,UAA8C;;;;;;;;CAS9C,OAAO,QAAiB;EACtB,IAAI,KAAK,KAAK,YAAY,OAAO,KAAK,UAAU,EAAE,OAAO;OACpD,kBAAkB;EACvB,OAAO;CACT;;CAGA,IAAI,YAAY;EACd,OAAO,KAAK,YAAY;CAC1B;;CAGA,IAAI,eAAe;EACjB,OAAO,KAAK,SAAS;CACvB;CAEA,QAAQ,IAAY;EAClB,OAAO,KAAK,MAAM,MAAM,SAAS,KAAK,OAAO,EAAE;CACjD;CAEA,QAAQ,IAAY;EAClB,OAAO,KAAK,MAAM,MAAM,SAAS,KAAK,OAAO,EAAE;CACjD;;CAGA,QAAQ,IAAY;EAClB,OAAO,KAAK,MAAM,QAAQ,SAAS,KAAK,OAAO,SAAS,MAAM,KAAK,OAAO,SAAS,EAAE;CACvF;CAEA,QAAQ,MAA2B;EACjC,OAAO,OAAO,KAAK,MAAM,IAAI;EAC7B,OAAO;CACT;CAEA,KAAK,MAAgB;EACnB,MAAM,UAAU,KAAK,MAAM,IAAI;EAC/B,IAAI,SAAS;GACX,KAAK,MAAM,KAAK,IAAI;GACpB,KAAK,QAAQ,QAAQ,OAAO;EAC9B;EACA,OAAO;CACT;CAEA,QAAQ,MAAgB,OAAgB;EACtC,OAAO,KAAK,KAAK;GAAE,MAAM;GAAW;GAAM;EAAM,CAAC;CACnD;;CAGA,WAAW,IAAY;EACrB,KAAK,MAAM,QAAQ,KAAK,QAAQ,EAAE,GAAG,KAAK,WAAW,KAAK,EAAE;EAC5D,OAAO,KAAK,KAAK;GAAE,MAAM;GAAc;EAAG,CAAC;CAC7C;CAEA,WAAW,IAAY,OAAwB;EAC7C,OAAO,KAAK,KAAK;GAAE,MAAM;GAAc;GAAI;EAAM,CAAC;CACpD;CAEA,SAAS,IAAY,GAAW,GAAW;EACzC,OAAO,KAAK,WAAW,IAAI;GAAE;GAAG;EAAE,CAAC;CACrC;;CAGA,WAAW,IAAY,OAAgC;EACrD,MAAM,OAAO,KAAK,QAAQ,EAAE;EAC5B,IAAI,CAAC,MAAM,OAAO;EAClB,OAAO,KAAK,WAAW,IAAI,EAAE,MAAM;GAAE,GAAG,KAAK;GAAM,GAAG;EAAM,EAAE,CAAC;CACjE;CAEA,QAAQ,MAAgB,OAAgB;EACtC,OAAO,KAAK,KAAK;GAAE,MAAM;GAAW;GAAM;EAAM,CAAC;CACnD;CAEA,WAAW,IAAY;EACrB,OAAO,KAAK,KAAK;GAAE,MAAM;GAAc;EAAG,CAAC;CAC7C;CAEA,WAAW,IAAY,OAAwB;EAC7C,OAAO,KAAK,KAAK;GAAE,MAAM;GAAc;GAAI;EAAM,CAAC;CACpD;CAEA,SAAiB,MAAyB;EACxC,IAAI,CAAC,KAAK,OAAO,OAAO;GACtB,KAAK,OAAO,QAAQ;GACpB,IAAI,SAAS,SAAS,KAAK,QAAQ,KAAK,MAAM,MAAM;QAC/C,KAAK,QAAQ,KAAK,MAAM,MAAM;EACrC;EACA,OAAO,SAAS,UAAU,KAAK,QAAQ,KAAK;CAC9C;;CAGA,MAAc,MAAiC;EAC7C,QAAQ,KAAK,MAAb;GACE,KAAK,WAAW;IACd,IAAI,KAAK,QAAQ,KAAK,KAAK,EAAE,GAAG,OAAO;IACvC,MAAM,OAAO,KAAK,SAAS,OAAO;IAClC,MAAM,QAAQ,WAAW,KAAK,OAAO,KAAK,MAAM;IAChD,KAAK,OAAO,OAAO,GAAG,KAAK,IAAI;IAC/B,OAAO;KAAE,MAAM;KAAc,IAAI,KAAK,KAAK;IAAG;GAChD;GACA,KAAK,cAAc;IACjB,MAAM,QAAQ,KAAK,MAAM,WAAW,SAAS,KAAK,OAAO,KAAK,EAAE;IAChE,IAAI,QAAQ,GAAG,OAAO;IAEtB,MAAM,CAAC,QADM,KAAK,SAAS,OACZ,CAAA,CAAK,OAAO,OAAO,CAAC;IACnC,OAAO;KAAE,MAAM;KAAiB;KAAO;IAAM;GAC/C;GACA,KAAK,cAAc;IACjB,MAAM,QAAQ,KAAK,MAAM,WAAW,SAAS,KAAK,OAAO,KAAK,EAAE;IAChE,IAAI,QAAQ,GAAG,OAAO;IACtB,MAAM,OAAO,KAAK,MAAM;IAExB,IADa,OAAO,KAAK,KAAK,KAC1B,CAAA,CAAK,OAAO,QAAQ,UAAU,KAAK,MAAM,KAAK,MAAM,IAAI,CAAC,GAAG,OAAO;IACvE,MAAM,OAAO,KAAK,SAAS,OAAO;IAClC,KAAK,SAAS,QAAQ,MAAM,KAAK,KAAK;IACtC,OAAO;KAAE,MAAM;KAAc,IAAI,KAAK;KAAI,OAAO,SAAS,MAAM,KAAK,KAAK;IAAE;GAC9E;GACA,KAAK,WAAW;IACd,IAAI,KAAK,QAAQ,KAAK,KAAK,EAAE,GAAG,OAAO;IACvC,MAAM,OAAO,KAAK,SAAS,OAAO;IAClC,KAAK,OAAO,WAAW,KAAK,OAAO,KAAK,MAAM,GAAG,GAAG,KAAK,IAAI;IAC7D,OAAO;KAAE,MAAM;KAAc,IAAI,KAAK,KAAK;IAAG;GAChD;GACA,KAAK,cAAc;IACjB,MAAM,QAAQ,KAAK,MAAM,WAAW,SAAS,KAAK,OAAO,KAAK,EAAE;IAChE,IAAI,QAAQ,GAAG,OAAO;IAEtB,MAAM,CAAC,QADM,KAAK,SAAS,OACZ,CAAA,CAAK,OAAO,OAAO,CAAC;IACnC,OAAO;KAAE,MAAM;KAAiB;KAAO;IAAM;GAC/C;GACA,KAAK,cAAc;IACjB,MAAM,QAAQ,KAAK,MAAM,WAAW,SAAS,KAAK,OAAO,KAAK,EAAE;IAChE,IAAI,QAAQ,GAAG,OAAO;IACtB,MAAM,OAAO,KAAK,MAAM;IAExB,IADa,OAAO,KAAK,KAAK,KAC1B,CAAA,CAAK,OAAO,QAAQ,UAAU,KAAK,MAAM,KAAK,MAAM,IAAI,CAAC,GAAG,OAAO;IACvE,MAAM,OAAO,KAAK,SAAS,OAAO;IAClC,KAAK,SAAS,QAAQ,MAAM,KAAK,KAAK;IACtC,OAAO;KAAE,MAAM;KAAc,IAAI,KAAK;KAAI,OAAO,SAAS,MAAM,KAAK,KAAK;IAAE;GAC9E;EACF;CACF;AACF;AAEA,SAAS,WAAW,OAA2B,QAAgB;CAC7D,IAAI,SAAS,MAAM,OAAO;CAC1B,OAAO,KAAK,IAAI,GAAG,KAAK,IAAI,QAAQ,KAAK,CAAC;AAC5C;;AAGA,SAAgB,eAAe,KAAmB,OAA4B;CAC5E,MAAM,KAAK,IAAI,gBAAgB,GAAG;CAClC,KAAK,MAAM,QAAQ,OAAO,GAAG,KAAK,IAAI;CACtC,OAAO;AACT;AAEA,IAAM,YAAY,SAAmB;CACnC,QAAQ,KAAK,MAAb;EACE,KAAK,WACH,OAAO,KAAK,KAAK,KAAK;EACxB,KAAK,WACH,OAAO,KAAK,KAAK,KAAK;EACxB,KAAK;EACL,KAAK,cACH,OAAO,KAAK,KAAK;EACnB,KAAK;EACL,KAAK,cACH,OAAO,KAAK,KAAK;CACrB;AACF;;;;;;AAOA,SAAgB,iBAAiB,OAAwC;CACvE,MAAM,MAA2B,CAAC;CAClC,MAAM,6BAAa,IAAI,IAAoB;CAC3C,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,SAAS,SAAS,IAAI;EAC5B,IAAI,KAAK,SAAS,gBAAgB,KAAK,SAAS,cAAc;GAC5D,MAAM,KAAK,WAAW,IAAI,MAAM;GAChC,IAAI,MAAM,MAAM;IACd,MAAM,OAAO,IAAI;IACjB,IAAI,MAAM;KAAE,GAAG;KAAM,OAAO;MAAE,GAAG,KAAK;MAAO,GAAG,KAAK;KAAM;IAAE;IAC7D;GACF;GACA,WAAW,IAAI,QAAQ,IAAI,MAAM;EACnC,OACE,WAAW,OAAO,MAAM;EAE1B,IAAI,KAAK,IAAI;CACf;CACA,OAAO,IAAI,QAAQ,SAA2B,QAAQ,IAAI;AAC5D;AAEA,IAAI,sBAAsB;;AAE1B,SAAS,oBAAoB;CAE3B,IAAA,QAAA,IAAA,aAA6B,gBAAgB,qBAAqB;CAClE,sBAAsB;CACtB,QAAQ,KACN,oHACF;AACF"}

package/dist/document.js

@@ -0,0 +1,220 @@
+import { portsOf } from "./core/node-types.js";
+import { defaultNode } from "./components/default-node2.js";
+import { resolveFlowExtensions } from "./core/extension.js";
+import { flowKit } from "./kit.js";
+// src/document.ts
+var isNumber = (value) => typeof value === "number" && Number.isFinite(value);
+/**
+* What is wrong with the shape itself: the document is not an object, or a
+* list in it is not an array. Nothing else can be checked until it is fixed.
+*/
+function shapeProblems(value, lists) {
+	if (!value || typeof value !== "object" || Array.isArray(value)) return [{
+		code: "shape",
+		path: "",
+		text: "",
+		message: "The document is not an object"
+	}];
+	return lists.filter((key) => !Array.isArray(value[key])).map((key) => ({
+		code: "shape",
+		path: key,
+		text: "",
+		message: `"${key}" is not a list`
+	}));
+}
+/**
+* The problems of a flow document, before it is saved or shown: an unknown
+* version, nodes and edges without an id or sharing one, positions that are
+* not numbers, edges whose ends are missing, `parent` pointing nowhere or
+* in a circle, and, given the editor's types, types nobody registered and
+* ports a node does not have.
+*/
+function checkDocument(document, options = {}) {
+	const shape = shapeProblems(document, ["nodes", "edges"]);
+	if (shape.length) return shape;
+	const problems = [];
+	if (document.version !== 1) problems.push({
+		code: "version",
+		path: "version",
+		text: String(document.version),
+		message: `Version ${String(document.version)} is not known`
+	});
+	const resolved = options.extensions || options.nodeTypes || options.edgeTypes ? resolveFlowExtensions(options.extensions ?? flowKit()) : void 0;
+	const nodeTypes = resolved && new Map(resolved.nodeTypes);
+	for (const spec of options.nodeTypes ?? []) nodeTypes?.set(spec.type, spec);
+	const edgeTypes = resolved && new Set(resolved.edgeTypes.keys());
+	for (const spec of options.edgeTypes ?? []) edgeTypes?.add(spec.type);
+	const nodes = /* @__PURE__ */ new Map();
+	document.nodes.forEach((node, i) => {
+		const path = `nodes[${i}]`;
+		if (!node.id) {
+			problems.push({
+				code: "missing-id",
+				path,
+				text: "",
+				message: `${path} has no id`
+			});
+			return;
+		}
+		if (nodes.has(node.id)) problems.push({
+			code: "duplicate-id",
+			nodeId: node.id,
+			path,
+			text: node.id,
+			message: `The node id "${node.id}" is used more than once`
+		});
+		else nodes.set(node.id, node);
+		if (!isNumber(node.x) || !isNumber(node.y)) problems.push({
+			code: "bad-position",
+			nodeId: node.id,
+			path,
+			text: node.id,
+			message: `The node "${node.id}" has no numeric x and y`
+		});
+		if (nodeTypes && node.type && node.type !== "default" && !nodeTypes.has(node.type)) problems.push({
+			code: "unknown-type",
+			nodeId: node.id,
+			path,
+			text: node.type,
+			message: `No node type "${node.type}" is registered`
+		});
+	});
+	document.nodes.forEach((node, i) => {
+		if (!node.id || !node.parent || nodes.get(node.id) !== node) return;
+		const path = `nodes[${i}].parent`;
+		if (!nodes.has(node.parent)) {
+			problems.push({
+				code: "missing-parent",
+				nodeId: node.id,
+				path,
+				text: node.parent,
+				message: `The parent "${node.parent}" of "${node.id}" is not in the document`
+			});
+			return;
+		}
+		const seen = /* @__PURE__ */ new Set();
+		for (let at = nodes.get(node.parent); at; at = at.parent ? nodes.get(at.parent) : void 0) {
+			if (at.id !== node.id) {
+				if (seen.has(at.id)) break;
+				seen.add(at.id);
+				continue;
+			}
+			problems.push({
+				code: "parent-cycle",
+				nodeId: node.id,
+				path,
+				text: node.parent,
+				message: `The node "${node.id}" is inside itself through its parents`
+			});
+			break;
+		}
+	});
+	const edgeIds = /* @__PURE__ */ new Set();
+	document.edges.forEach((edge, i) => {
+		const path = `edges[${i}]`;
+		if (!edge.id) problems.push({
+			code: "missing-id",
+			path,
+			text: "",
+			message: `${path} has no id`
+		});
+		else if (edgeIds.has(edge.id)) problems.push({
+			code: "duplicate-id",
+			edgeId: edge.id,
+			path,
+			text: edge.id,
+			message: `The edge id "${edge.id}" is used more than once`
+		});
+		edgeIds.add(edge.id);
+		if (edgeTypes && edge.type && !edgeTypes.has(edge.type)) problems.push({
+			code: "unknown-type",
+			edgeId: edge.id,
+			path,
+			text: edge.type,
+			message: `No edge type "${edge.type}" is registered`
+		});
+		for (const end of ["source", "target"]) checkEnd(edge, end, `${path}.${end}`, nodes, nodeTypes, problems);
+	});
+	return problems;
+}
+function checkEnd(edge, end, path, nodes, nodeTypes, problems) {
+	const endpoint = edge[end];
+	const node = endpoint && nodes.get(endpoint.node);
+	if (!node) {
+		const id = String(endpoint?.node ?? "");
+		problems.push({
+			code: "missing-node",
+			edgeId: edge.id,
+			nodeId: id || void 0,
+			path,
+			text: id,
+			message: `The ${end} "${id}" of the edge "${edge.id}" is not in the document`
+		});
+		return;
+	}
+	if (!nodeTypes || endpoint.port === void 0) return;
+	const spec = nodeTypes.get(node.type ?? "default") ?? nodeTypes.get("default") ?? defaultNode;
+	if (portsOf(spec, node).some((port) => port.id === endpoint.port)) return;
+	problems.push({
+		code: "missing-port",
+		edgeId: edge.id,
+		nodeId: node.id,
+		path,
+		text: endpoint.port,
+		message: `The node "${node.id}" has no port "${endpoint.port}"`
+	});
+}
+var objects = (value) => (Array.isArray(value) ? value : []).filter((item) => !!item && typeof item === "object");
+/** The saved data as an object of version 1, or an error saying why it can't be. */
+function sourceOf(input) {
+	if (!input || typeof input !== "object" || Array.isArray(input)) throw new Error(`[@dou-ui/flow] a flow document must be an object, not ${Array.isArray(input) ? "an array" : JSON.stringify(input) ?? String(input)}`);
+	const source = input;
+	const version = source.version ?? 1;
+	if (version !== 1) throw new Error(`[@dou-ui/flow] unknown document version ${JSON.stringify(version) ?? String(version)} (expected 1); data saved by a newer @dou-ui/flow needs that version to open`);
+	return source;
+}
+/**
+* Brings a saved document up to the current version, and fills what an
+* older or hand-written one may lack (`version`, `nodes`, `edges`). Nodes
+* and edges that are not objects are dropped; anything else is kept as it
+* is. Throws for data that is not an object
+* (an array, `null`, a string) and for a version it does not know.
+*/
+function migrateDocument(input) {
+	const source = sourceOf(input);
+	return {
+		...source,
+		version: 1,
+		nodes: objects(source.nodes),
+		edges: objects(source.edges)
+	};
+}
+var warned = /* @__PURE__ */ new Set();
+/**
+* The `v-model` as the editor reads it. A document of the wrong shape (not
+* an object, without `nodes` or `edges`, without a known `version`) gets a
+* warning in development and is read with what is missing left empty and
+* the version as 1, so the editor still opens and what it writes back
+* carries `version: 1`.
+*/
+function readDocument(value) {
+	const plain = !!value && typeof value === "object" && !Array.isArray(value);
+	const source = plain ? value : {};
+	const nodes = Array.isArray(source.nodes);
+	const edges = Array.isArray(source.edges);
+	const problem = !plain ? `is ${Array.isArray(value) ? "an array" : JSON.stringify(value) ?? String(value)}` : !nodes ? "has no nodes array" : !edges ? "has no edges array" : source.version === void 0 ? "has no version" : source.version !== 1 ? `has version ${JSON.stringify(source.version)}` : "";
+	if (!problem) return value;
+	if (process.env.NODE_ENV !== "production" && !warned.has(problem)) {
+		warned.add(problem);
+		console.warn(`[@dou-ui/flow] the v-model ${problem}; expected { version: 1, nodes: [...], edges: [...] }. What is missing is read as empty and the version as 1; read saved data with migrateDocument().`);
+	}
+	return {
+		...source,
+		version: 1,
+		nodes: nodes ? source.nodes : [],
+		edges: edges ? source.edges : []
+	};
+}
+export { checkDocument, migrateDocument, readDocument };
+
+//# sourceMappingURL=document.js.map

package/dist/document.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"document.js","names":[],"sources":["../src/document.ts"],"sourcesContent":["import { resolveFlowExtensions, type FlowExtension } from './core/extension'\nimport type { EdgeTypeSpec } from './core/edge-types'\nimport type { FlowDocument, FlowEdge, FlowNode } from './core/model'\nimport { portsOf, type NodeTypeSpec } from './core/node-types'\nimport { defaultNode } from './components/default-node'\nimport { flowKit } from './kit'\n\nexport interface DocumentProblem {\n  code:\n    | 'version'\n    | 'shape'\n    | 'missing-id'\n    | 'duplicate-id'\n    | 'bad-position'\n    | 'unknown-type'\n    | 'missing-node'\n    | 'missing-port'\n    | 'missing-parent'\n    | 'parent-cycle'\n  /** The node at fault, or the node an edge's end points at. */\n  nodeId?: string\n  /** The edge at fault. */\n  edgeId?: string\n  /**\n   * Where the problem is, as a path into the document, e.g. `nodes[2]` or\n   * `edges[0].target`; `version` for the version.\n   */\n  path: string\n  /** The id, type or port at fault, for the editor's message. */\n  text: string\n  /** An English description, for logs. */\n  message: string\n}\n\nexport interface CheckDocumentOptions {\n  /**\n   * The editor's `extensions`, for the node and edge types they add. With\n   * none of `extensions`, `nodeTypes` and `edgeTypes`, types and ports are\n   * not checked; with `nodeTypes` or `edgeTypes` alone, the default\n   * `flowKit()` is assumed, as in the editor.\n   */\n  extensions?: readonly (FlowExtension | readonly FlowExtension[])[]\n  /** The editor's `nodeTypes`. */\n  nodeTypes?: readonly NodeTypeSpec<any>[]\n  /** The editor's `edgeTypes`. */\n  edgeTypes?: readonly EdgeTypeSpec<any>[]\n}\n\nconst isNumber = (value: unknown) => typeof value === 'number' && Number.isFinite(value)\n\n/**\n * What is wrong with the shape itself: the document is not an object, or a\n * list in it is not an array. Nothing else can be checked until it is fixed.\n */\nfunction shapeProblems(value: unknown, lists: string[]): DocumentProblem[] {\n  if (!value || typeof value !== 'object' || Array.isArray(value))\n    return [{ code: 'shape', path: '', text: '', message: 'The document is not an object' }]\n  return lists\n    .filter((key) => !Array.isArray((value as Record<string, unknown>)[key]))\n    .map((key) => ({ code: 'shape', path: key, text: '', message: `\"${key}\" is not a list` }))\n}\n\n/**\n * The problems of a flow document, before it is saved or shown: an unknown\n * version, nodes and edges without an id or sharing one, positions that are\n * not numbers, edges whose ends are missing, `parent` pointing nowhere or\n * in a circle, and, given the editor's types, types nobody registered and\n * ports a node does not have.\n */\nexport function checkDocument(\n  document: FlowDocument,\n  options: CheckDocumentOptions = {},\n): DocumentProblem[] {\n  const shape = shapeProblems(document, ['nodes', 'edges'])\n  if (shape.length) return shape\n  const problems: DocumentProblem[] = []\n  if (document.version !== 1)\n    problems.push({\n      code: 'version',\n      path: 'version',\n      text: String(document.version),\n      message: `Version ${String(document.version)} is not known`,\n    })\n\n  const typed = options.extensions || options.nodeTypes || options.edgeTypes\n  const resolved = typed ? resolveFlowExtensions(options.extensions ?? flowKit()) : undefined\n  const nodeTypes = resolved && new Map<string, NodeTypeSpec>(resolved.nodeTypes)\n  for (const spec of options.nodeTypes ?? []) nodeTypes?.set(spec.type, spec as NodeTypeSpec)\n  const edgeTypes = resolved && new Set(resolved.edgeTypes.keys())\n  for (const spec of options.edgeTypes ?? []) edgeTypes?.add(spec.type)\n\n  const nodes = new Map<string, FlowNode>()\n  document.nodes.forEach((node, i) => {\n    const path = `nodes[${i}]`\n    if (!node.id) {\n      problems.push({ code: 'missing-id', path, text: '', message: `${path} has no id` })\n      return\n    }\n    if (nodes.has(node.id))\n      problems.push({\n        code: 'duplicate-id',\n        nodeId: node.id,\n        path,\n        text: node.id,\n        message: `The node id \"${node.id}\" is used more than once`,\n      })\n    else nodes.set(node.id, node)\n    if (!isNumber(node.x) || !isNumber(node.y))\n      problems.push({\n        code: 'bad-position',\n        nodeId: node.id,\n        path,\n        text: node.id,\n        message: `The node \"${node.id}\" has no numeric x and y`,\n      })\n    // A node without a type is drawn as the default node, registered or not.\n    if (nodeTypes && node.type && node.type !== 'default' && !nodeTypes.has(node.type))\n      problems.push({\n        code: 'unknown-type',\n        nodeId: node.id,\n        path,\n        text: node.type,\n        message: `No node type \"${node.type}\" is registered`,\n      })\n  })\n\n  document.nodes.forEach((node, i) => {\n    if (!node.id || !node.parent || nodes.get(node.id) !== node) return\n    const path = `nodes[${i}].parent`\n    if (!nodes.has(node.parent)) {\n      problems.push({\n        code: 'missing-parent',\n        nodeId: node.id,\n        path,\n        text: node.parent,\n        message: `The parent \"${node.parent}\" of \"${node.id}\" is not in the document`,\n      })\n      return\n    }\n    // only the members of a circle are reported; one hanging below it is fine itself\n    const seen = new Set<string>()\n    for (let at = nodes.get(node.parent); at; at = at.parent ? nodes.get(at.parent) : undefined) {\n      if (at.id !== node.id) {\n        if (seen.has(at.id)) break\n        seen.add(at.id)\n        continue\n      }\n      problems.push({\n        code: 'parent-cycle',\n        nodeId: node.id,\n        path,\n        text: node.parent,\n        message: `The node \"${node.id}\" is inside itself through its parents`,\n      })\n      break\n    }\n  })\n\n  const edgeIds = new Set<string>()\n  document.edges.forEach((edge, i) => {\n    const path = `edges[${i}]`\n    if (!edge.id)\n      problems.push({ code: 'missing-id', path, text: '', message: `${path} has no id` })\n    else if (edgeIds.has(edge.id))\n      problems.push({\n        code: 'duplicate-id',\n        edgeId: edge.id,\n        path,\n        text: edge.id,\n        message: `The edge id \"${edge.id}\" is used more than once`,\n      })\n    edgeIds.add(edge.id)\n    if (edgeTypes && edge.type && !edgeTypes.has(edge.type))\n      problems.push({\n        code: 'unknown-type',\n        edgeId: edge.id,\n        path,\n        text: edge.type,\n        message: `No edge type \"${edge.type}\" is registered`,\n      })\n    for (const end of ['source', 'target'] as const)\n      checkEnd(edge, end, `${path}.${end}`, nodes, nodeTypes, problems)\n  })\n  return problems\n}\n\nfunction checkEnd(\n  edge: FlowEdge,\n  end: 'source' | 'target',\n  path: string,\n  nodes: Map<string, FlowNode>,\n  nodeTypes: Map<string, NodeTypeSpec> | undefined,\n  problems: DocumentProblem[],\n) {\n  const endpoint = edge[end]\n  const node = endpoint && nodes.get(endpoint.node)\n  if (!node) {\n    const id = String(endpoint?.node ?? '')\n    problems.push({\n      code: 'missing-node',\n      edgeId: edge.id,\n      nodeId: id || undefined,\n      path,\n      text: id,\n      message: `The ${end} \"${id}\" of the edge \"${edge.id}\" is not in the document`,\n    })\n    return\n  }\n  if (!nodeTypes || endpoint.port === undefined) return\n  // as the editor draws it: an unknown type as the default node\n  const spec =\n    nodeTypes.get(node.type ?? 'default') ??\n    nodeTypes.get('default') ??\n    (defaultNode as NodeTypeSpec)\n  if (portsOf(spec, node).some((port) => port.id === endpoint.port)) return\n  problems.push({\n    code: 'missing-port',\n    edgeId: edge.id,\n    nodeId: node.id,\n    path,\n    text: endpoint.port,\n    message: `The node \"${node.id}\" has no port \"${endpoint.port}\"`,\n  })\n}\n\nconst objects = <T>(value: unknown) =>\n  (Array.isArray(value) ? value : []).filter(\n    (item): item is T => !!item && typeof item === 'object',\n  )\n\n/** The saved data as an object of version 1, or an error saying why it can't be. */\nfunction sourceOf(input: unknown): Record<string, unknown> {\n  if (!input || typeof input !== 'object' || Array.isArray(input))\n    throw new Error(\n      `[@dou-ui/flow] a flow document must be an object, not ${Array.isArray(input) ? 'an array' : (JSON.stringify(input) ?? String(input))}`,\n    )\n  const source = input as Record<string, unknown>\n  const version = source.version ?? 1\n  if (version !== 1)\n    throw new Error(\n      `[@dou-ui/flow] unknown document version ${JSON.stringify(version) ?? String(version)} (expected 1); data saved by a newer @dou-ui/flow needs that version to open`,\n    )\n  return source\n}\n\n/**\n * Brings a saved document up to the current version, and fills what an\n * older or hand-written one may lack (`version`, `nodes`, `edges`). Nodes\n * and edges that are not objects are dropped; anything else is kept as it\n * is. Throws for data that is not an object\n * (an array, `null`, a string) and for a version it does not know.\n */\nexport function migrateDocument(input: unknown): FlowDocument {\n  const source = sourceOf(input)\n  return {\n    ...source,\n    version: 1,\n    nodes: objects<FlowNode>(source.nodes),\n    edges: objects<FlowEdge>(source.edges),\n  }\n}\n\nconst warned = new Set<string>()\n\n/**\n * The `v-model` as the editor reads it. A document of the wrong shape (not\n * an object, without `nodes` or `edges`, without a known `version`) gets a\n * warning in development and is read with what is missing left empty and\n * the version as 1, so the editor still opens and what it writes back\n * carries `version: 1`.\n */\nexport function readDocument(value: unknown): FlowDocument {\n  const plain = !!value && typeof value === 'object' && !Array.isArray(value)\n  const source = (plain ? value : {}) as Partial<FlowDocument>\n  const nodes = Array.isArray(source.nodes)\n  const edges = Array.isArray(source.edges)\n  const problem = !plain\n    ? `is ${Array.isArray(value) ? 'an array' : (JSON.stringify(value) ?? String(value))}`\n    : !nodes\n      ? 'has no nodes array'\n      : !edges\n        ? 'has no edges array'\n        : source.version === undefined\n          ? 'has no version'\n          : source.version !== 1\n            ? `has version ${JSON.stringify(source.version)}`\n            : ''\n  if (!problem) return value as FlowDocument\n  if (process.env.NODE_ENV !== 'production' && !warned.has(problem)) {\n    warned.add(problem)\n    console.warn(\n      `[@dou-ui/flow] the v-model ${problem}; expected { version: 1, nodes: [...], edges: [...] }. What is missing is read as empty and the version as 1; read saved data with migrateDocument().`,\n    )\n  }\n  return {\n    ...source,\n    version: 1,\n    nodes: nodes ? source.nodes! : [],\n    edges: edges ? source.edges! : [],\n  }\n}\n"],"mappings":";;;;;AAgDA,IAAM,YAAY,UAAmB,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK;;;;;AAMvF,SAAS,cAAc,OAAgB,OAAoC;CACzE,IAAI,CAAC,SAAS,OAAO,UAAU,YAAY,MAAM,QAAQ,KAAK,GAC5D,OAAO,CAAC;EAAE,MAAM;EAAS,MAAM;EAAI,MAAM;EAAI,SAAS;CAAgC,CAAC;CACzF,OAAO,MACJ,QAAQ,QAAQ,CAAC,MAAM,QAAS,MAAkC,IAAI,CAAC,CAAC,CACxE,KAAK,SAAS;EAAE,MAAM;EAAS,MAAM;EAAK,MAAM;EAAI,SAAS,IAAI,IAAI;CAAiB,EAAE;AAC7F;;;;;;;;AASA,SAAgB,cACd,UACA,UAAgC,CAAC,GACd;CACnB,MAAM,QAAQ,cAAc,UAAU,CAAC,SAAS,OAAO,CAAC;CACxD,IAAI,MAAM,QAAQ,OAAO;CACzB,MAAM,WAA8B,CAAC;CACrC,IAAI,SAAS,YAAY,GACvB,SAAS,KAAK;EACZ,MAAM;EACN,MAAM;EACN,MAAM,OAAO,SAAS,OAAO;EAC7B,SAAS,WAAW,OAAO,SAAS,OAAO,EAAE;CAC/C,CAAC;CAGH,MAAM,WADQ,QAAQ,cAAc,QAAQ,aAAa,QAAQ,YACxC,sBAAsB,QAAQ,cAAc,QAAQ,CAAC,IAAI,KAAA;CAClF,MAAM,YAAY,YAAY,IAAI,IAA0B,SAAS,SAAS;CAC9E,KAAK,MAAM,QAAQ,QAAQ,aAAa,CAAC,GAAG,WAAW,IAAI,KAAK,MAAM,IAAoB;CAC1F,MAAM,YAAY,YAAY,IAAI,IAAI,SAAS,UAAU,KAAK,CAAC;CAC/D,KAAK,MAAM,QAAQ,QAAQ,aAAa,CAAC,GAAG,WAAW,IAAI,KAAK,IAAI;CAEpE,MAAM,wBAAQ,IAAI,IAAsB;CACxC,SAAS,MAAM,SAAS,MAAM,MAAM;EAClC,MAAM,OAAO,SAAS,EAAE;EACxB,IAAI,CAAC,KAAK,IAAI;GACZ,SAAS,KAAK;IAAE,MAAM;IAAc;IAAM,MAAM;IAAI,SAAS,GAAG,KAAK;GAAY,CAAC;GAClF;EACF;EACA,IAAI,MAAM,IAAI,KAAK,EAAE,GACnB,SAAS,KAAK;GACZ,MAAM;GACN,QAAQ,KAAK;GACb;GACA,MAAM,KAAK;GACX,SAAS,gBAAgB,KAAK,GAAG;EACnC,CAAC;OACE,MAAM,IAAI,KAAK,IAAI,IAAI;EAC5B,IAAI,CAAC,SAAS,KAAK,CAAC,KAAK,CAAC,SAAS,KAAK,CAAC,GACvC,SAAS,KAAK;GACZ,MAAM;GACN,QAAQ,KAAK;GACb;GACA,MAAM,KAAK;GACX,SAAS,aAAa,KAAK,GAAG;EAChC,CAAC;EAEH,IAAI,aAAa,KAAK,QAAQ,KAAK,SAAS,aAAa,CAAC,UAAU,IAAI,KAAK,IAAI,GAC/E,SAAS,KAAK;GACZ,MAAM;GACN,QAAQ,KAAK;GACb;GACA,MAAM,KAAK;GACX,SAAS,iBAAiB,KAAK,KAAK;EACtC,CAAC;CACL,CAAC;CAED,SAAS,MAAM,SAAS,MAAM,MAAM;EAClC,IAAI,CAAC,KAAK,MAAM,CAAC,KAAK,UAAU,MAAM,IAAI,KAAK,EAAE,MAAM,MAAM;EAC7D,MAAM,OAAO,SAAS,EAAE;EACxB,IAAI,CAAC,MAAM,IAAI,KAAK,MAAM,GAAG;GAC3B,SAAS,KAAK;IACZ,MAAM;IACN,QAAQ,KAAK;IACb;IACA,MAAM,KAAK;IACX,SAAS,eAAe,KAAK,OAAO,QAAQ,KAAK,GAAG;GACtD,CAAC;GACD;EACF;EAEA,MAAM,uBAAO,IAAI,IAAY;EAC7B,KAAK,IAAI,KAAK,MAAM,IAAI,KAAK,MAAM,GAAG,IAAI,KAAK,GAAG,SAAS,MAAM,IAAI,GAAG,MAAM,IAAI,KAAA,GAAW;GAC3F,IAAI,GAAG,OAAO,KAAK,IAAI;IACrB,IAAI,KAAK,IAAI,GAAG,EAAE,GAAG;IACrB,KAAK,IAAI,GAAG,EAAE;IACd;GACF;GACA,SAAS,KAAK;IACZ,MAAM;IACN,QAAQ,KAAK;IACb;IACA,MAAM,KAAK;IACX,SAAS,aAAa,KAAK,GAAG;GAChC,CAAC;GACD;EACF;CACF,CAAC;CAED,MAAM,0BAAU,IAAI,IAAY;CAChC,SAAS,MAAM,SAAS,MAAM,MAAM;EAClC,MAAM,OAAO,SAAS,EAAE;EACxB,IAAI,CAAC,KAAK,IACR,SAAS,KAAK;GAAE,MAAM;GAAc;GAAM,MAAM;GAAI,SAAS,GAAG,KAAK;EAAY,CAAC;OAC/E,IAAI,QAAQ,IAAI,KAAK,EAAE,GAC1B,SAAS,KAAK;GACZ,MAAM;GACN,QAAQ,KAAK;GACb;GACA,MAAM,KAAK;GACX,SAAS,gBAAgB,KAAK,GAAG;EACnC,CAAC;EACH,QAAQ,IAAI,KAAK,EAAE;EACnB,IAAI,aAAa,KAAK,QAAQ,CAAC,UAAU,IAAI,KAAK,IAAI,GACpD,SAAS,KAAK;GACZ,MAAM;GACN,QAAQ,KAAK;GACb;GACA,MAAM,KAAK;GACX,SAAS,iBAAiB,KAAK,KAAK;EACtC,CAAC;EACH,KAAK,MAAM,OAAO,CAAC,UAAU,QAAQ,GACnC,SAAS,MAAM,KAAK,GAAG,KAAK,GAAG,OAAO,OAAO,WAAW,QAAQ;CACpE,CAAC;CACD,OAAO;AACT;AAEA,SAAS,SACP,MACA,KACA,MACA,OACA,WACA,UACA;CACA,MAAM,WAAW,KAAK;CACtB,MAAM,OAAO,YAAY,MAAM,IAAI,SAAS,IAAI;CAChD,IAAI,CAAC,MAAM;EACT,MAAM,KAAK,OAAO,UAAU,QAAQ,EAAE;EACtC,SAAS,KAAK;GACZ,MAAM;GACN,QAAQ,KAAK;GACb,QAAQ,MAAM,KAAA;GACd;GACA,MAAM;GACN,SAAS,OAAO,IAAI,IAAI,GAAG,iBAAiB,KAAK,GAAG;EACtD,CAAC;EACD;CACF;CACA,IAAI,CAAC,aAAa,SAAS,SAAS,KAAA,GAAW;CAE/C,MAAM,OACJ,UAAU,IAAI,KAAK,QAAQ,SAAS,KACpC,UAAU,IAAI,SAAS,KACtB;CACH,IAAI,QAAQ,MAAM,IAAI,CAAC,CAAC,MAAM,SAAS,KAAK,OAAO,SAAS,IAAI,GAAG;CACnE,SAAS,KAAK;EACZ,MAAM;EACN,QAAQ,KAAK;EACb,QAAQ,KAAK;EACb;EACA,MAAM,SAAS;EACf,SAAS,aAAa,KAAK,GAAG,iBAAiB,SAAS,KAAK;CAC/D,CAAC;AACH;AAEA,IAAM,WAAc,WACjB,MAAM,QAAQ,KAAK,IAAI,QAAQ,CAAC,EAAA,CAAG,QACjC,SAAoB,CAAC,CAAC,QAAQ,OAAO,SAAS,QACjD;;AAGF,SAAS,SAAS,OAAyC;CACzD,IAAI,CAAC,SAAS,OAAO,UAAU,YAAY,MAAM,QAAQ,KAAK,GAC5D,MAAM,IAAI,MACR,yDAAyD,MAAM,QAAQ,KAAK,IAAI,aAAc,KAAK,UAAU,KAAK,KAAK,OAAO,KAAK,GACrI;CACF,MAAM,SAAS;CACf,MAAM,UAAU,OAAO,WAAW;CAClC,IAAI,YAAY,GACd,MAAM,IAAI,MACR,2CAA2C,KAAK,UAAU,OAAO,KAAK,OAAO,OAAO,EAAE,6EACxF;CACF,OAAO;AACT;;;;;;;;AASA,SAAgB,gBAAgB,OAA8B;CAC5D,MAAM,SAAS,SAAS,KAAK;CAC7B,OAAO;EACL,GAAG;EACH,SAAS;EACT,OAAO,QAAkB,OAAO,KAAK;EACrC,OAAO,QAAkB,OAAO,KAAK;CACvC;AACF;AAEA,IAAM,yBAAS,IAAI,IAAY;;;;;;;;AAS/B,SAAgB,aAAa,OAA8B;CACzD,MAAM,QAAQ,CAAC,CAAC,SAAS,OAAO,UAAU,YAAY,CAAC,MAAM,QAAQ,KAAK;CAC1E,MAAM,SAAU,QAAQ,QAAQ,CAAC;CACjC,MAAM,QAAQ,MAAM,QAAQ,OAAO,KAAK;CACxC,MAAM,QAAQ,MAAM,QAAQ,OAAO,KAAK;CACxC,MAAM,UAAU,CAAC,QACb,MAAM,MAAM,QAAQ,KAAK,IAAI,aAAc,KAAK,UAAU,KAAK,KAAK,OAAO,KAAK,MAChF,CAAC,QACC,uBACA,CAAC,QACC,uBACA,OAAO,YAAY,KAAA,IACjB,mBACA,OAAO,YAAY,IACjB,eAAe,KAAK,UAAU,OAAO,OAAO,MAC5C;CACZ,IAAI,CAAC,SAAS,OAAO;CACrB,IAAA,QAAA,IAAA,aAA6B,gBAAgB,CAAC,OAAO,IAAI,OAAO,GAAG;EACjE,OAAO,IAAI,OAAO;EAClB,QAAQ,KACN,8BAA8B,QAAQ,sJACxC;CACF;CACA,OAAO;EACL,GAAG;EACH,SAAS;EACT,OAAO,QAAQ,OAAO,QAAS,CAAC;EAChC,OAAO,QAAQ,OAAO,QAAS,CAAC;CAClC;AACF"}

package/dist/export/color.js

@@ -0,0 +1,38 @@
+// src/export/color.ts
+var normalizer;
+var SRGB = /^(#|rgba?\()/;
+/**
+* A computed color as `rgb(…)`, `rgba(…)` or `#rrggbb`, which every SVG reader
+* understands. A canvas converts most colors as it parses them; colors it
+* keeps in another space (`oklab(…)`, `color(…)`) are painted on a pixel
+* and read back.
+*/
+function plainColor(color) {
+	const value = color.trim();
+	if (!value || value === "none" || SRGB.test(value)) return value;
+	if (value === "transparent") return "rgba(0, 0, 0, 0)";
+	if (normalizer === void 0) try {
+		const sheet = document.createElement("canvas");
+		sheet.width = sheet.height = 1;
+		normalizer = sheet.getContext("2d", { willReadFrequently: true });
+	} catch {
+		normalizer = null;
+	}
+	if (!normalizer) return value;
+	normalizer.fillStyle = "#000";
+	normalizer.fillStyle = value;
+	const parsed = String(normalizer.fillStyle);
+	if (SRGB.test(parsed)) return parsed;
+	normalizer.clearRect(0, 0, 1, 1);
+	normalizer.fillRect(0, 0, 1, 1);
+	const [r, g, b, a] = normalizer.getImageData(0, 0, 1, 1).data;
+	if (a === 255) return `#${[
+		r,
+		g,
+		b
+	].map((n) => n.toString(16).padStart(2, "0")).join("")}`;
+	return `rgba(${r}, ${g}, ${b}, ${Math.round(a / 255 * 1e3) / 1e3})`;
+}
+export { plainColor };
+
+//# sourceMappingURL=color.js.map

package/dist/export/color.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"color.js","names":[],"sources":["../../src/export/color.ts"],"sourcesContent":["let normalizer: CanvasRenderingContext2D | null | undefined\n\nconst SRGB = /^(#|rgba?\\()/\n\n/**\n * A computed color as `rgb(…)`, `rgba(…)` or `#rrggbb`, which every SVG reader\n * understands. A canvas converts most colors as it parses them; colors it\n * keeps in another space (`oklab(…)`, `color(…)`) are painted on a pixel\n * and read back.\n */\nexport function plainColor(color: string): string {\n  const value = color.trim()\n  if (!value || value === 'none' || SRGB.test(value)) return value\n  if (value === 'transparent') return 'rgba(0, 0, 0, 0)'\n  if (normalizer === undefined)\n    try {\n      const sheet = document.createElement('canvas')\n      sheet.width = sheet.height = 1\n      normalizer = sheet.getContext('2d', { willReadFrequently: true })\n    } catch {\n      normalizer = null\n    }\n  if (!normalizer) return value\n  normalizer.fillStyle = '#000'\n  normalizer.fillStyle = value\n  const parsed = String(normalizer.fillStyle)\n  if (SRGB.test(parsed)) return parsed\n  normalizer.clearRect(0, 0, 1, 1)\n  normalizer.fillRect(0, 0, 1, 1)\n  const [r, g, b, a] = normalizer.getImageData(0, 0, 1, 1).data\n  if (a === 255) return `#${[r, g, b].map((n) => n!.toString(16).padStart(2, '0')).join('')}`\n  return `rgba(${r}, ${g}, ${b}, ${Math.round((a! / 255) * 1000) / 1000})`\n}\n"],"mappings":";AAAA,IAAI;AAEJ,IAAM,OAAO;;;;;;;AAQb,SAAgB,WAAW,OAAuB;CAChD,MAAM,QAAQ,MAAM,KAAK;CACzB,IAAI,CAAC,SAAS,UAAU,UAAU,KAAK,KAAK,KAAK,GAAG,OAAO;CAC3D,IAAI,UAAU,eAAe,OAAO;CACpC,IAAI,eAAe,KAAA,GACjB,IAAI;EACF,MAAM,QAAQ,SAAS,cAAc,QAAQ;EAC7C,MAAM,QAAQ,MAAM,SAAS;EAC7B,aAAa,MAAM,WAAW,MAAM,EAAE,oBAAoB,KAAK,CAAC;CAClE,QAAQ;EACN,aAAa;CACf;CACF,IAAI,CAAC,YAAY,OAAO;CACxB,WAAW,YAAY;CACvB,WAAW,YAAY;CACvB,MAAM,SAAS,OAAO,WAAW,SAAS;CAC1C,IAAI,KAAK,KAAK,MAAM,GAAG,OAAO;CAC9B,WAAW,UAAU,GAAG,GAAG,GAAG,CAAC;CAC/B,WAAW,SAAS,GAAG,GAAG,GAAG,CAAC;CAC9B,MAAM,CAAC,GAAG,GAAG,GAAG,KAAK,WAAW,aAAa,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;CACzD,IAAI,MAAM,KAAK,OAAO,IAAI;EAAC;EAAG;EAAG;CAAC,CAAC,CAAC,KAAK,MAAM,EAAG,SAAS,EAAE,CAAC,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE;CACxF,OAAO,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,KAAK,MAAO,IAAK,MAAO,GAAI,IAAI,IAAK;AACxE"}