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

package/dist/core/document.js

@@ -0,0 +1,231 @@
+import { resolveGanttExtensions } from "./extension.js";
+import { parseTime } from "./time.js";
+import { linkRefusal, parseLag } from "./links.js";
+// src/core/document.ts
+/**
+* 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 Gantt document, before it is saved or shown: an
+* unknown version, tasks and links without an id or sharing one, `parent`
+* pointing nowhere or in a circle, dates and lags that can't be read, and
+* links to missing tasks, to the task itself, between a summary and its
+* own task, twice between the same tasks, or in a circle; with `canLink`
+* or `extensions`, links their rules refuse too.
+*/
+function checkDocument(document, options = {}) {
+	const shape = shapeProblems(document, ["tasks", "links"]);
+	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 tasks = /* @__PURE__ */ new Map();
+	document.tasks.forEach((task, i) => {
+		const path = `tasks[${i}]`;
+		if (!task.id) {
+			problems.push({
+				code: "missing-id",
+				path,
+				text: "",
+				message: `${path} has no id`
+			});
+			return;
+		}
+		if (tasks.has(task.id)) problems.push({
+			code: "duplicate-id",
+			taskId: task.id,
+			path,
+			text: task.id,
+			message: `The task id "${task.id}" is used more than once`
+		});
+		else tasks.set(task.id, task);
+		for (const key of ["start", "end"]) {
+			const text = task[key];
+			if (text == null || text === "" || parseTime(text)) continue;
+			problems.push({
+				code: "bad-date",
+				taskId: task.id,
+				path: `${path}.${key}`,
+				text: String(text),
+				message: `The ${key} "${String(text)}" of "${task.id}" is not a date`
+			});
+		}
+	});
+	document.tasks.forEach((task, i) => {
+		if (!task.id || !task.parent || tasks.get(task.id) !== task) return;
+		const path = `tasks[${i}].parent`;
+		if (!tasks.has(task.parent)) {
+			problems.push({
+				code: "missing-parent",
+				taskId: task.id,
+				path,
+				text: task.parent,
+				message: `The parent "${task.parent}" of "${task.id}" is not in the document`
+			});
+			return;
+		}
+		const seen = /* @__PURE__ */ new Set();
+		for (let at = tasks.get(task.parent); at; at = at.parent ? tasks.get(at.parent) : void 0) {
+			if (at.id !== task.id) {
+				if (seen.has(at.id)) break;
+				seen.add(at.id);
+				continue;
+			}
+			problems.push({
+				code: "parent-cycle",
+				taskId: task.id,
+				path,
+				text: task.parent,
+				message: `The task "${task.id}" is inside itself through its parents`
+			});
+			break;
+		}
+	});
+	const rules = [...options.canLink ? [options.canLink] : [], ...options.extensions ? resolveGanttExtensions(options.extensions).linkRules : []];
+	const ids = /* @__PURE__ */ new Set();
+	/** The links before this one that join tasks that are there, for the rules between links. */
+	const sound = [];
+	document.links.forEach((link, i) => {
+		const path = `links[${i}]`;
+		if (!link.id) problems.push({
+			code: "missing-id",
+			path,
+			text: "",
+			message: `${path} has no id`
+		});
+		else if (ids.has(link.id)) problems.push({
+			code: "duplicate-id",
+			linkId: link.id,
+			path,
+			text: link.id,
+			message: `The link id "${link.id}" is used more than once`
+		});
+		ids.add(link.id);
+		if (!parseLag(link.lag)) problems.push({
+			code: "bad-lag",
+			linkId: link.id,
+			path: `${path}.lag`,
+			text: String(link.lag),
+			message: `The lag "${String(link.lag)}" of "${link.id}" can't be read`
+		});
+		let missing = false;
+		for (const end of ["from", "to"]) {
+			if (tasks.has(link[end])) continue;
+			missing = true;
+			problems.push({
+				code: "missing-task",
+				linkId: link.id,
+				taskId: link[end] || void 0,
+				path: `${path}.${end}`,
+				text: String(link[end] ?? ""),
+				message: `The task "${String(link[end])}" the link "${link.id}" points at is not in the document`
+			});
+		}
+		if (missing) return;
+		const refusal = linkRefusal(tasks, sound, link.from, link.to);
+		if (!refusal) {
+			sound.push(link);
+			for (const rule of rules) {
+				const answer = rule(link, document);
+				if (answer === true) continue;
+				problems.push({
+					code: "refused-link",
+					linkId: link.id,
+					path,
+					text: typeof answer === "string" ? answer : "",
+					message: `The link "${link.id}" is refused by a canLink rule${typeof answer === "string" && answer ? `: ${answer}` : ""}`
+				});
+				break;
+			}
+			return;
+		}
+		problems.push({
+			code: LINK_PROBLEMS[refusal][0],
+			linkId: link.id,
+			path,
+			text: link.id,
+			message: LINK_PROBLEMS[refusal][1](link)
+		});
+	});
+	return problems;
+}
+/** What each refusal of `linkRefusal` is as a problem; `custom` can't come without rules. */
+var LINK_PROBLEMS = {
+	self: ["self-link", (link) => `The link "${link.id}" joins "${link.from}" to itself`],
+	nested: ["nested-link", (link) => `The link "${link.id}" joins a summary task and a task inside it ("${link.from}", "${link.to}")`],
+	duplicate: ["duplicate-link", (link) => `The link "${link.id}" joins "${link.from}" and "${link.to}", which another link already joins`],
+	cycle: ["link-cycle", (link) => `The link "${link.id}" from "${link.from}" to "${link.to}" closes a circle of links`]
+};
+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/gantt] a Gantt 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/gantt] unknown document version ${JSON.stringify(version) ?? String(version)} (expected 1); data saved by a newer @dou-ui/gantt 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`, `tasks`, `links`). Tasks
+* and links 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,
+		tasks: objects(source.tasks),
+		links: objects(source.links)
+	};
+}
+var warned = /* @__PURE__ */ new Set();
+/**
+* The `v-model` as the chart reads it. A document of the wrong shape (not an
+* object, without `tasks` or `links`, 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 chart still opens and what it writes back carries
+* `version: 1`. The scheduler doesn't use `links` and doesn't need them.
+*/
+function readDocument(value, needsLinks = true) {
+	const plain = !!value && typeof value === "object" && !Array.isArray(value);
+	const source = plain ? value : {};
+	const tasks = Array.isArray(source.tasks);
+	const links = Array.isArray(source.links);
+	const problem = !plain ? `is ${Array.isArray(value) ? "an array" : JSON.stringify(value) ?? String(value)}` : !tasks ? "has no tasks array" : !links && needsLinks ? "has no links array" : source.version === void 0 ? "has no version" : source.version !== 1 ? `has version ${JSON.stringify(source.version)}` : "";
+	if (!problem && links) return value;
+	if (problem && process.env.NODE_ENV !== "production" && !warned.has(problem)) {
+		warned.add(problem);
+		console.warn(`[@dou-ui/gantt] the v-model ${problem}; expected { version: 1, tasks: [...], links: [...] }. What is missing is read as empty and the version as 1; read saved data with migrateDocument().`);
+	}
+	return {
+		...source,
+		version: 1,
+		tasks: tasks ? source.tasks : [],
+		links: links ? source.links : []
+	};
+}
+export { checkDocument, migrateDocument, readDocument };
+
+//# sourceMappingURL=document.js.map

package/dist/core/document.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"document.js","names":[],"sources":["../../src/core/document.ts"],"sourcesContent":["import { resolveGanttExtensions, type GanttExtension } from './extension'\nimport { linkRefusal, parseLag } from './links'\nimport type { GanttLink, GanttTask } from './model'\nimport { parseTime } from './time'\nimport type { GanttDocument } from './transaction'\n\nexport interface DocumentProblem {\n  code:\n    | 'version'\n    | 'shape'\n    | 'missing-id'\n    | 'duplicate-id'\n    | 'missing-parent'\n    | 'parent-cycle'\n    | 'bad-date'\n    | 'missing-task'\n    | 'bad-lag'\n    | 'self-link'\n    | 'nested-link'\n    | 'duplicate-link'\n    | 'link-cycle'\n    | 'refused-link'\n  /** The task at fault, or the task a link points at. */\n  taskId?: string\n  /** The link at fault. */\n  linkId?: string\n  /**\n   * Where the problem is, as a path into the document, e.g. `tasks[2].start`\n   * or `links[0].to`; `version` for the version.\n   */\n  path: string\n  /** The id, date or lag at fault, for the editor's message. */\n  text: string\n  /** An English description, for logs. */\n  message: string\n}\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\nexport interface CheckDocumentOptions {\n  /** The chart's `canLink`, to check the links against it too. */\n  canLink?: GanttRule\n  /** The chart's extensions, to check the links against their `canLink` too. */\n  extensions?: readonly (GanttExtension | readonly GanttExtension[])[]\n}\n\ntype GanttRule = NonNullable<GanttExtension['canLink']>\n\n/**\n * The problems of a Gantt document, before it is saved or shown: an\n * unknown version, tasks and links without an id or sharing one, `parent`\n * pointing nowhere or in a circle, dates and lags that can't be read, and\n * links to missing tasks, to the task itself, between a summary and its\n * own task, twice between the same tasks, or in a circle; with `canLink`\n * or `extensions`, links their rules refuse too.\n */\nexport function checkDocument(\n  document: GanttDocument,\n  options: CheckDocumentOptions = {},\n): DocumentProblem[] {\n  const shape = shapeProblems(document, ['tasks', 'links'])\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 tasks = new Map<string, GanttTask>()\n  document.tasks.forEach((task, i) => {\n    const path = `tasks[${i}]`\n    if (!task.id) {\n      problems.push({ code: 'missing-id', path, text: '', message: `${path} has no id` })\n      return\n    }\n    if (tasks.has(task.id))\n      problems.push({\n        code: 'duplicate-id',\n        taskId: task.id,\n        path,\n        text: task.id,\n        message: `The task id \"${task.id}\" is used more than once`,\n      })\n    else tasks.set(task.id, task)\n    for (const key of ['start', 'end'] as const) {\n      const text = task[key]\n      if (text == null || text === '' || parseTime(text)) continue\n      problems.push({\n        code: 'bad-date',\n        taskId: task.id,\n        path: `${path}.${key}`,\n        text: String(text),\n        message: `The ${key} \"${String(text)}\" of \"${task.id}\" is not a date`,\n      })\n    }\n  })\n\n  document.tasks.forEach((task, i) => {\n    if (!task.id || !task.parent || tasks.get(task.id) !== task) return\n    const path = `tasks[${i}].parent`\n    if (!tasks.has(task.parent)) {\n      problems.push({\n        code: 'missing-parent',\n        taskId: task.id,\n        path,\n        text: task.parent,\n        message: `The parent \"${task.parent}\" of \"${task.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 = tasks.get(task.parent); at; at = at.parent ? tasks.get(at.parent) : undefined) {\n      if (at.id !== task.id) {\n        if (seen.has(at.id)) break\n        seen.add(at.id)\n        continue\n      }\n      problems.push({\n        code: 'parent-cycle',\n        taskId: task.id,\n        path,\n        text: task.parent,\n        message: `The task \"${task.id}\" is inside itself through its parents`,\n      })\n      break\n    }\n  })\n\n  const rules: GanttRule[] = [\n    ...(options.canLink ? [options.canLink] : []),\n    ...(options.extensions ? resolveGanttExtensions(options.extensions).linkRules : []),\n  ]\n  const ids = new Set<string>()\n  /** The links before this one that join tasks that are there, for the rules between links. */\n  const sound: GanttLink[] = []\n  document.links.forEach((link, i) => {\n    const path = `links[${i}]`\n    if (!link.id)\n      problems.push({ code: 'missing-id', path, text: '', message: `${path} has no id` })\n    else if (ids.has(link.id))\n      problems.push({\n        code: 'duplicate-id',\n        linkId: link.id,\n        path,\n        text: link.id,\n        message: `The link id \"${link.id}\" is used more than once`,\n      })\n    ids.add(link.id)\n    if (!parseLag(link.lag))\n      problems.push({\n        code: 'bad-lag',\n        linkId: link.id,\n        path: `${path}.lag`,\n        text: String(link.lag),\n        message: `The lag \"${String(link.lag)}\" of \"${link.id}\" can't be read`,\n      })\n    let missing = false\n    for (const end of ['from', 'to'] as const) {\n      if (tasks.has(link[end])) continue\n      missing = true\n      problems.push({\n        code: 'missing-task',\n        linkId: link.id,\n        taskId: link[end] || undefined,\n        path: `${path}.${end}`,\n        text: String(link[end] ?? ''),\n        message: `The task \"${String(link[end])}\" the link \"${link.id}\" points at is not in the document`,\n      })\n    }\n    if (missing) return\n    const refusal = linkRefusal(tasks, sound, link.from, link.to)\n    if (!refusal) {\n      sound.push(link)\n      for (const rule of rules) {\n        const answer = rule(link, document)\n        if (answer === true) continue\n        problems.push({\n          code: 'refused-link',\n          linkId: link.id,\n          path,\n          text: typeof answer === 'string' ? answer : '',\n          message: `The link \"${link.id}\" is refused by a canLink rule${typeof answer === 'string' && answer ? `: ${answer}` : ''}`,\n        })\n        break\n      }\n      return\n    }\n    problems.push({\n      code: LINK_PROBLEMS[refusal as keyof typeof LINK_PROBLEMS][0],\n      linkId: link.id,\n      path,\n      text: link.id,\n      message: LINK_PROBLEMS[refusal as keyof typeof LINK_PROBLEMS][1](link),\n    })\n  })\n  return problems\n}\n\n/** What each refusal of `linkRefusal` is as a problem; `custom` can't come without rules. */\nconst LINK_PROBLEMS = {\n  self: ['self-link', (link: GanttLink) => `The link \"${link.id}\" joins \"${link.from}\" to itself`],\n  nested: [\n    'nested-link',\n    (link: GanttLink) =>\n      `The link \"${link.id}\" joins a summary task and a task inside it (\"${link.from}\", \"${link.to}\")`,\n  ],\n  duplicate: [\n    'duplicate-link',\n    (link: GanttLink) =>\n      `The link \"${link.id}\" joins \"${link.from}\" and \"${link.to}\", which another link already joins`,\n  ],\n  cycle: [\n    'link-cycle',\n    (link: GanttLink) =>\n      `The link \"${link.id}\" from \"${link.from}\" to \"${link.to}\" closes a circle of links`,\n  ],\n} as const satisfies Record<string, readonly [DocumentProblem['code'], (link: GanttLink) => string]>\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/gantt] a Gantt 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/gantt] unknown document version ${JSON.stringify(version) ?? String(version)} (expected 1); data saved by a newer @dou-ui/gantt 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`, `tasks`, `links`). Tasks\n * and links 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): GanttDocument {\n  const source = sourceOf(input)\n  return {\n    ...source,\n    version: 1,\n    tasks: objects<GanttTask>(source.tasks),\n    links: objects<GanttLink>(source.links),\n  }\n}\n\nconst warned = new Set<string>()\n\n/**\n * The `v-model` as the chart reads it. A document of the wrong shape (not an\n * object, without `tasks` or `links`, without a known `version`) gets a\n * warning in development and is read with what is missing left empty and the\n * version as 1, so the chart still opens and what it writes back carries\n * `version: 1`. The scheduler doesn't use `links` and doesn't need them.\n */\nexport function readDocument(value: unknown, needsLinks = true): GanttDocument {\n  const plain = !!value && typeof value === 'object' && !Array.isArray(value)\n  const source = (plain ? value : {}) as Partial<GanttDocument>\n  const tasks = Array.isArray(source.tasks)\n  const links = Array.isArray(source.links)\n  const problem = !plain\n    ? `is ${Array.isArray(value) ? 'an array' : (JSON.stringify(value) ?? String(value))}`\n    : !tasks\n      ? 'has no tasks array'\n      : !links && needsLinks\n        ? 'has no links array'\n        : source.version === undefined\n          ? 'has no version'\n          : source.version !== 1\n            ? `has version ${JSON.stringify(source.version)}`\n            : ''\n  if (!problem && links) return value as GanttDocument\n  if (problem && process.env.NODE_ENV !== 'production' && !warned.has(problem)) {\n    warned.add(problem)\n    console.warn(\n      `[@dou-ui/gantt] the v-model ${problem}; expected { version: 1, tasks: [...], links: [...] }. 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    tasks: tasks ? source.tasks! : [],\n    links: links ? source.links! : [],\n  }\n}\n"],"mappings":";;;;;;;;AAyCA,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;;;;;;;;;AAmBA,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;CAEH,MAAM,wBAAQ,IAAI,IAAuB;CACzC,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,KAAK,MAAM,OAAO,CAAC,SAAS,KAAK,GAAY;GAC3C,MAAM,OAAO,KAAK;GAClB,IAAI,QAAQ,QAAQ,SAAS,MAAM,UAAU,IAAI,GAAG;GACpD,SAAS,KAAK;IACZ,MAAM;IACN,QAAQ,KAAK;IACb,MAAM,GAAG,KAAK,GAAG;IACjB,MAAM,OAAO,IAAI;IACjB,SAAS,OAAO,IAAI,IAAI,OAAO,IAAI,EAAE,QAAQ,KAAK,GAAG;GACvD,CAAC;EACH;CACF,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,QAAqB,CACzB,GAAI,QAAQ,UAAU,CAAC,QAAQ,OAAO,IAAI,CAAC,GAC3C,GAAI,QAAQ,aAAa,uBAAuB,QAAQ,UAAU,CAAC,CAAC,YAAY,CAAC,CACnF;CACA,MAAM,sBAAM,IAAI,IAAY;;CAE5B,MAAM,QAAqB,CAAC;CAC5B,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,IAAI,IAAI,KAAK,EAAE,GACtB,SAAS,KAAK;GACZ,MAAM;GACN,QAAQ,KAAK;GACb;GACA,MAAM,KAAK;GACX,SAAS,gBAAgB,KAAK,GAAG;EACnC,CAAC;EACH,IAAI,IAAI,KAAK,EAAE;EACf,IAAI,CAAC,SAAS,KAAK,GAAG,GACpB,SAAS,KAAK;GACZ,MAAM;GACN,QAAQ,KAAK;GACb,MAAM,GAAG,KAAK;GACd,MAAM,OAAO,KAAK,GAAG;GACrB,SAAS,YAAY,OAAO,KAAK,GAAG,EAAE,QAAQ,KAAK,GAAG;EACxD,CAAC;EACH,IAAI,UAAU;EACd,KAAK,MAAM,OAAO,CAAC,QAAQ,IAAI,GAAY;GACzC,IAAI,MAAM,IAAI,KAAK,IAAI,GAAG;GAC1B,UAAU;GACV,SAAS,KAAK;IACZ,MAAM;IACN,QAAQ,KAAK;IACb,QAAQ,KAAK,QAAQ,KAAA;IACrB,MAAM,GAAG,KAAK,GAAG;IACjB,MAAM,OAAO,KAAK,QAAQ,EAAE;IAC5B,SAAS,aAAa,OAAO,KAAK,IAAI,EAAE,cAAc,KAAK,GAAG;GAChE,CAAC;EACH;EACA,IAAI,SAAS;EACb,MAAM,UAAU,YAAY,OAAO,OAAO,KAAK,MAAM,KAAK,EAAE;EAC5D,IAAI,CAAC,SAAS;GACZ,MAAM,KAAK,IAAI;GACf,KAAK,MAAM,QAAQ,OAAO;IACxB,MAAM,SAAS,KAAK,MAAM,QAAQ;IAClC,IAAI,WAAW,MAAM;IACrB,SAAS,KAAK;KACZ,MAAM;KACN,QAAQ,KAAK;KACb;KACA,MAAM,OAAO,WAAW,WAAW,SAAS;KAC5C,SAAS,aAAa,KAAK,GAAG,gCAAgC,OAAO,WAAW,YAAY,SAAS,KAAK,WAAW;IACvH,CAAC;IACD;GACF;GACA;EACF;EACA,SAAS,KAAK;GACZ,MAAM,cAAc,QAAsC,CAAC;GAC3D,QAAQ,KAAK;GACb;GACA,MAAM,KAAK;GACX,SAAS,cAAc,QAAsC,CAAC,EAAE,CAAC,IAAI;EACvE,CAAC;CACH,CAAC;CACD,OAAO;AACT;;AAGA,IAAM,gBAAgB;CACpB,MAAM,CAAC,cAAc,SAAoB,aAAa,KAAK,GAAG,WAAW,KAAK,KAAK,YAAY;CAC/F,QAAQ,CACN,gBACC,SACC,aAAa,KAAK,GAAG,gDAAgD,KAAK,KAAK,MAAM,KAAK,GAAG,GACjG;CACA,WAAW,CACT,mBACC,SACC,aAAa,KAAK,GAAG,WAAW,KAAK,KAAK,SAAS,KAAK,GAAG,oCAC/D;CACA,OAAO,CACL,eACC,SACC,aAAa,KAAK,GAAG,UAAU,KAAK,KAAK,QAAQ,KAAK,GAAG,2BAC7D;AACF;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,2DAA2D,MAAM,QAAQ,KAAK,IAAI,aAAc,KAAK,UAAU,KAAK,KAAK,OAAO,KAAK,GACvI;CACF,MAAM,SAAS;CACf,MAAM,UAAU,OAAO,WAAW;CAClC,IAAI,YAAY,GACd,MAAM,IAAI,MACR,4CAA4C,KAAK,UAAU,OAAO,KAAK,OAAO,OAAO,EAAE,8EACzF;CACF,OAAO;AACT;;;;;;;;AASA,SAAgB,gBAAgB,OAA+B;CAC7D,MAAM,SAAS,SAAS,KAAK;CAC7B,OAAO;EACL,GAAG;EACH,SAAS;EACT,OAAO,QAAmB,OAAO,KAAK;EACtC,OAAO,QAAmB,OAAO,KAAK;CACxC;AACF;AAEA,IAAM,yBAAS,IAAI,IAAY;;;;;;;;AAS/B,SAAgB,aAAa,OAAgB,aAAa,MAAqB;CAC7E,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,SAAS,aACR,uBACA,OAAO,YAAY,KAAA,IACjB,mBACA,OAAO,YAAY,IACjB,eAAe,KAAK,UAAU,OAAO,OAAO,MAC5C;CACZ,IAAI,CAAC,WAAW,OAAO,OAAO;CAC9B,IAAI,WAAA,QAAA,IAAA,aAAoC,gBAAgB,CAAC,OAAO,IAAI,OAAO,GAAG;EAC5E,OAAO,IAAI,OAAO;EAClB,QAAQ,KACN,+BAA+B,QAAQ,sJACzC;CACF;CACA,OAAO;EACL,GAAG;EACH,SAAS;EACT,OAAO,QAAQ,OAAO,QAAS,CAAC;EAChC,OAAO,QAAQ,OAAO,QAAS,CAAC;CAClC;AACF"}

package/dist/core/extension.js

@@ -0,0 +1,42 @@
+// src/core/extension.ts
+/** Declares an extension; only gives it a type. */
+function defineGanttExtension(extension) {
+	return extension;
+}
+function flatten(list) {
+	const out = [];
+	for (const item of list) if (Array.isArray(item)) out.push(...flatten(item));
+	else out.push(item);
+	return out;
+}
+/** Sorts the extensions by priority and collects what they add. */
+function resolveGanttExtensions(list = []) {
+	const extensions = flatten(list).map((extension, index) => ({
+		extension,
+		index
+	})).sort((a, b) => (b.extension.priority ?? 100) - (a.extension.priority ?? 100) || a.index - b.index).map((entry) => entry.extension);
+	const names = /* @__PURE__ */ new Set();
+	for (const extension of extensions) {
+		if (names.has(extension.name)) throw new Error(`[@dou-ui/gantt] the extension "${extension.name}" is added twice`);
+		names.add(extension.name);
+	}
+	const pick = (key) => extensions.flatMap((e) => e[key] ? [e[key]] : []);
+	return {
+		extensions,
+		columns: extensions.flatMap((e) => e.columns ?? []),
+		linkRules: pick("canLink"),
+		moveRules: pick("canMove"),
+		keymaps: pick("keymap"),
+		markers: pick("markers"),
+		menus: pick("contextMenu"),
+		setups: pick("setup"),
+		transactions: pick("transaction"),
+		history: extensions.find((e) => e.history)?.history,
+		below: extensions.flatMap((e) => e.layers?.below ?? []),
+		above: extensions.flatMap((e) => e.layers?.above ?? []),
+		overlays: extensions.flatMap((e) => e.overlays ?? [])
+	};
+}
+export { defineGanttExtension, resolveGanttExtensions };
+
+//# sourceMappingURL=extension.js.map

package/dist/core/extension.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"extension.js","names":[],"sources":["../../src/core/extension.ts"],"sourcesContent":["import type { ContextMenuItem } from 'dou-ui'\nimport type { Component } from 'vue'\nimport type { GanttContext } from '../context'\nimport type { GanttColumn, GanttMarker, GanttMove } from '../types'\nimport type { GanttMenuTarget } from './menu'\nimport type { GanttLink } from './model'\nimport type { GanttDocument, GanttTransaction } from './transaction'\n\n/** What an extension's hooks receive; the same as `useGantt()`. */\nexport type GanttExtensionContext = GanttContext\n\n/**\n * A key handler: return `false` to let the key through to the next handler\n * and the chart's own keys; anything else means it was handled.\n */\nexport type GanttKeyHandler = (event: KeyboardEvent) => boolean | void\n\n/** An undo history that replaces the chart's own, e.g. one that only undoes this user's changes. */\nexport interface GanttHistoryHandler {\n  /** `false` when there is nothing to undo. */\n  undo: () => boolean\n  redo: () => boolean\n  canUndo: () => boolean\n  canRedo: () => boolean\n}\n\n/**\n * A piece of the Gantt chart: table columns, rules for links and moves,\n * keys, marker lines and extra layers. A third-party extension can do\n * anything the chart's own props can.\n */\nexport interface GanttExtension {\n  name: string\n  /** Higher runs first: its keys and rules are asked before others. Defaults to 100. */\n  priority?: number\n  /** Columns added after the table's own. */\n  columns?: GanttColumn[]\n  /** A link rule, asked with `can-link`. Return `true` to allow, or a sentence saying why not. */\n  canLink?: (link: Pick<GanttLink, 'from' | 'to' | 'type'>, doc: GanttDocument) => boolean | string\n  /** A rule for new dates, asked with `can-move`. */\n  canMove?: (move: GanttMove, doc: GanttDocument) => boolean | string\n  /** Keys, written as in `useHotkey` (e.g. `mod+d`, `shift+t`), while the chart has focus. */\n  keymap?: (context: GanttExtensionContext) => Record<string, GanttKeyHandler>\n  /**\n   * Items for the context menu, which opens on a right click, the menu key\n   * or a long press. They come before the built-in ones.\n   */\n  contextMenu?: (context: GanttExtensionContext, target: GanttMenuTarget) => ContextMenuItem[]\n  /** Vertical marker lines, such as a release day; worked out again when what they read changes. */\n  markers?: (context: GanttExtensionContext) => GanttMarker[]\n  /**\n   * Components drawn on the timeline, in its own coordinates: `below` under\n   * the dependency lines, `above` over the bars. They scroll with it.\n   */\n  layers?: { below?: Component[]; above?: Component[] }\n  /** Components drawn over the chart, not scrolled, e.g. a panel. They can call `useGantt()`. */\n  overlays?: Component[]\n  /** Runs once the chart is mounted. Return a function to run when it unmounts. */\n  setup?: (context: GanttExtensionContext) => void | (() => void)\n  /**\n   * Sees every change before it reaches the tasks and links, in priority\n   * order, and may add steps to it. Undo and redo come through here too.\n   */\n  transaction?: (tr: GanttTransaction, context: GanttExtensionContext) => void\n  /** Replaces the chart's undo history; the first extension that has one wins. */\n  history?: (context: GanttExtensionContext) => GanttHistoryHandler\n}\n\n/** Declares an extension; only gives it a type. */\nexport function defineGanttExtension(extension: GanttExtension): GanttExtension {\n  return extension\n}\n\n/** Everything the extensions contribute, gathered once per list. */\nexport interface ResolvedGanttExtensions {\n  extensions: GanttExtension[]\n  columns: GanttColumn[]\n  linkRules: NonNullable<GanttExtension['canLink']>[]\n  moveRules: NonNullable<GanttExtension['canMove']>[]\n  keymaps: NonNullable<GanttExtension['keymap']>[]\n  markers: NonNullable<GanttExtension['markers']>[]\n  menus: NonNullable<GanttExtension['contextMenu']>[]\n  setups: NonNullable<GanttExtension['setup']>[]\n  transactions: NonNullable<GanttExtension['transaction']>[]\n  history: GanttExtension['history']\n  below: Component[]\n  above: Component[]\n  overlays: Component[]\n}\n\ntype ExtensionList = readonly (GanttExtension | readonly GanttExtension[])[]\n\nfunction flatten(list: ExtensionList): GanttExtension[] {\n  const out: GanttExtension[] = []\n  for (const item of list) {\n    if (Array.isArray(item)) out.push(...flatten(item))\n    else out.push(item as GanttExtension)\n  }\n  return out\n}\n\n/** Sorts the extensions by priority and collects what they add. */\nexport function resolveGanttExtensions(list: ExtensionList = []): ResolvedGanttExtensions {\n  const extensions = flatten(list)\n    .map((extension, index) => ({ extension, index }))\n    // oxlint-disable-next-line unicorn/no-array-sort -- sorts a fresh array\n    .sort(\n      (a, b) => (b.extension.priority ?? 100) - (a.extension.priority ?? 100) || a.index - b.index,\n    )\n    .map((entry) => entry.extension)\n\n  const names = new Set<string>()\n  for (const extension of extensions) {\n    if (names.has(extension.name))\n      throw new Error(`[@dou-ui/gantt] the extension \"${extension.name}\" is added twice`)\n    names.add(extension.name)\n  }\n\n  const pick = <K extends keyof GanttExtension>(key: K) =>\n    extensions.flatMap((e) => (e[key] ? [e[key]] : [])) as NonNullable<GanttExtension[K]>[]\n\n  return {\n    extensions,\n    columns: extensions.flatMap((e) => e.columns ?? []),\n    linkRules: pick('canLink'),\n    moveRules: pick('canMove'),\n    keymaps: pick('keymap'),\n    markers: pick('markers'),\n    menus: pick('contextMenu'),\n    setups: pick('setup'),\n    transactions: pick('transaction'),\n    history: extensions.find((e) => e.history)?.history,\n    below: extensions.flatMap((e) => e.layers?.below ?? []),\n    above: extensions.flatMap((e) => e.layers?.above ?? []),\n    overlays: extensions.flatMap((e) => e.overlays ?? []),\n  }\n}\n"],"mappings":";;AAqEA,SAAgB,qBAAqB,WAA2C;CAC9E,OAAO;AACT;AAqBA,SAAS,QAAQ,MAAuC;CACtD,MAAM,MAAwB,CAAC;CAC/B,KAAK,MAAM,QAAQ,MACjB,IAAI,MAAM,QAAQ,IAAI,GAAG,IAAI,KAAK,GAAG,QAAQ,IAAI,CAAC;MAC7C,IAAI,KAAK,IAAsB;CAEtC,OAAO;AACT;;AAGA,SAAgB,uBAAuB,OAAsB,CAAC,GAA4B;CACxF,MAAM,aAAa,QAAQ,IAAI,CAAC,CAC7B,KAAK,WAAW,WAAW;EAAE;EAAW;CAAM,EAAE,CAAC,CAEjD,MACE,GAAG,OAAO,EAAE,UAAU,YAAY,QAAQ,EAAE,UAAU,YAAY,QAAQ,EAAE,QAAQ,EAAE,KACzF,CAAC,CACA,KAAK,UAAU,MAAM,SAAS;CAEjC,MAAM,wBAAQ,IAAI,IAAY;CAC9B,KAAK,MAAM,aAAa,YAAY;EAClC,IAAI,MAAM,IAAI,UAAU,IAAI,GAC1B,MAAM,IAAI,MAAM,kCAAkC,UAAU,KAAK,iBAAiB;EACpF,MAAM,IAAI,UAAU,IAAI;CAC1B;CAEA,MAAM,QAAwC,QAC5C,WAAW,SAAS,MAAO,EAAE,OAAO,CAAC,EAAE,IAAI,IAAI,CAAC,CAAE;CAEpD,OAAO;EACL;EACA,SAAS,WAAW,SAAS,MAAM,EAAE,WAAW,CAAC,CAAC;EAClD,WAAW,KAAK,SAAS;EACzB,WAAW,KAAK,SAAS;EACzB,SAAS,KAAK,QAAQ;EACtB,SAAS,KAAK,SAAS;EACvB,OAAO,KAAK,aAAa;EACzB,QAAQ,KAAK,OAAO;EACpB,cAAc,KAAK,aAAa;EAChC,SAAS,WAAW,MAAM,MAAM,EAAE,OAAO,CAAC,EAAE;EAC5C,OAAO,WAAW,SAAS,MAAM,EAAE,QAAQ,SAAS,CAAC,CAAC;EACtD,OAAO,WAAW,SAAS,MAAM,EAAE,QAAQ,SAAS,CAAC,CAAC;EACtD,UAAU,WAAW,SAAS,MAAM,EAAE,YAAY,CAAC,CAAC;CACtD;AACF"}

package/dist/core/geometry.js

@@ -0,0 +1,112 @@
+// src/core/geometry.ts
+/**
+* A path through `points` with straight segments and corners rounded by
+* up to `radius`; a corner never takes more than half of either segment.
+*/
+function roundedPath(points, radius = 4) {
+	const clean = [];
+	for (const point of points) {
+		const last = clean[clean.length - 1];
+		if (last && last.x === point.x && last.y === point.y) continue;
+		const before = clean[clean.length - 2];
+		if (before && last && (before.x === last.x && last.x === point.x || before.y === last.y && last.y === point.y)) clean.pop();
+		clean.push(point);
+	}
+	if (!clean.length) return "";
+	let d = `M${clean[0].x} ${clean[0].y}`;
+	for (let i = 1; i < clean.length - 1; i++) {
+		const prev = clean[i - 1];
+		const at = clean[i];
+		const next = clean[i + 1];
+		const into = Math.hypot(at.x - prev.x, at.y - prev.y);
+		const out = Math.hypot(next.x - at.x, next.y - at.y);
+		const r = Math.min(radius, into / 2, out / 2);
+		const a = {
+			x: at.x - (at.x - prev.x) / into * r,
+			y: at.y - (at.y - prev.y) / into * r
+		};
+		const b = {
+			x: at.x + (next.x - at.x) / out * r,
+			y: at.y + (next.y - at.y) / out * r
+		};
+		d += ` L${a.x} ${a.y} Q${at.x} ${at.y} ${b.x} ${b.y}`;
+	}
+	const last = clean[clean.length - 1];
+	return `${d} L${last.x} ${last.y}`;
+}
+/**
+* The route of a dependency line: out of one end of `from`, into one end
+* of `to`. It leaves and arrives horizontally, `gap` px clear of the bars,
+* and takes a single vertical run when one fits; otherwise it turns back
+* along the boundary between the rows (`rowHeight` apart).
+*/
+function routeLink(from, to, type = "fs", rowHeight = 36, gap = 12) {
+	const leavesEnd = type === "fs" || type === "ff";
+	const entersStart = type === "fs" || type === "ss";
+	const out = leavesEnd ? 1 : -1;
+	const into = entersStart ? 1 : -1;
+	const p = {
+		x: leavesEnd ? from.right : from.left,
+		y: from.y
+	};
+	const q = {
+		x: entersStart ? to.left : to.right,
+		y: to.y
+	};
+	const a = p.x + out * gap;
+	const b = q.x - into * gap;
+	const low = Math.max(out > 0 ? a : -Infinity, into < 0 ? b : -Infinity);
+	const high = Math.min(out < 0 ? a : Infinity, into > 0 ? b : Infinity);
+	let points;
+	if (low <= high || from.y === to.y) {
+		const x = out > 0 ? low : high;
+		points = [
+			p,
+			{
+				x,
+				y: p.y
+			},
+			{
+				x,
+				y: q.y
+			},
+			q
+		];
+	} else {
+		const mid = p.y + Math.sign(q.y - p.y) * (rowHeight / 2);
+		points = [
+			p,
+			{
+				x: a,
+				y: p.y
+			},
+			{
+				x: a,
+				y: mid
+			},
+			{
+				x: b,
+				y: mid
+			},
+			{
+				x: b,
+				y: q.y
+			},
+			q
+		];
+	}
+	return {
+		points,
+		tip: q,
+		direction: into
+	};
+}
+/** A small solid arrowhead with its tip at `tip`. */
+function arrowPath(tip, direction, size = 6) {
+	const back = tip.x - direction * size;
+	const half = size / 2 + .5;
+	return `M${tip.x} ${tip.y} L${back} ${tip.y - half} L${back} ${tip.y + half} Z`;
+}
+export { arrowPath, roundedPath, routeLink };
+
+//# sourceMappingURL=geometry.js.map

package/dist/core/geometry.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"geometry.js","names":[],"sources":["../../src/core/geometry.ts"],"sourcesContent":["import type { GanttLinkType } from './model'\n\nexport interface Point {\n  x: number\n  y: number\n}\n\n/**\n * A path through `points` with straight segments and corners rounded by\n * up to `radius`; a corner never takes more than half of either segment.\n */\nexport function roundedPath(points: readonly Point[], radius = 4) {\n  // drop points that don't turn: repeats and ones on a straight line\n  const clean: Point[] = []\n  for (const point of points) {\n    const last = clean[clean.length - 1]\n    if (last && last.x === point.x && last.y === point.y) continue\n    const before = clean[clean.length - 2]\n    if (\n      before &&\n      last &&\n      ((before.x === last.x && last.x === point.x) || (before.y === last.y && last.y === point.y))\n    )\n      clean.pop()\n    clean.push(point)\n  }\n  if (!clean.length) return ''\n  let d = `M${clean[0]!.x} ${clean[0]!.y}`\n  for (let i = 1; i < clean.length - 1; i++) {\n    const prev = clean[i - 1]!\n    const at = clean[i]!\n    const next = clean[i + 1]!\n    const into = Math.hypot(at.x - prev.x, at.y - prev.y)\n    const out = Math.hypot(next.x - at.x, next.y - at.y)\n    const r = Math.min(radius, into / 2, out / 2)\n    const a = { x: at.x - ((at.x - prev.x) / into) * r, y: at.y - ((at.y - prev.y) / into) * r }\n    const b = { x: at.x + ((next.x - at.x) / out) * r, y: at.y + ((next.y - at.y) / out) * r }\n    d += ` L${a.x} ${a.y} Q${at.x} ${at.y} ${b.x} ${b.y}`\n  }\n  const last = clean[clean.length - 1]!\n  return `${d} L${last.x} ${last.y}`\n}\n\n/** Where a bar sits on screen, in px. */\nexport interface BarBox {\n  /** Left and right edges; equal for a milestone's centre. */\n  left: number\n  right: number\n  /** Vertical centre. */\n  y: number\n}\n\nexport interface LinkRoute {\n  points: Point[]\n  /** The arrow's tip, and which way it points: `1` right, `-1` left. */\n  tip: Point\n  direction: 1 | -1\n}\n\n/**\n * The route of a dependency line: out of one end of `from`, into one end\n * of `to`. It leaves and arrives horizontally, `gap` px clear of the bars,\n * and takes a single vertical run when one fits; otherwise it turns back\n * along the boundary between the rows (`rowHeight` apart).\n */\nexport function routeLink(\n  from: BarBox,\n  to: BarBox,\n  type: GanttLinkType = 'fs',\n  rowHeight = 36,\n  gap = 12,\n): LinkRoute {\n  const leavesEnd = type === 'fs' || type === 'ff'\n  const entersStart = type === 'fs' || type === 'ss'\n  const out = leavesEnd ? 1 : -1\n  const into = entersStart ? 1 : -1\n  const p = { x: leavesEnd ? from.right : from.left, y: from.y }\n  const q = { x: entersStart ? to.left : to.right, y: to.y }\n  const a = p.x + out * gap\n  const b = q.x - into * gap\n\n  // one vertical run at x works when x is past `a` going out and before `b` coming in\n  const low = Math.max(out > 0 ? a : -Infinity, into < 0 ? b : -Infinity)\n  const high = Math.min(out < 0 ? a : Infinity, into > 0 ? b : Infinity)\n  let points: Point[]\n  if (low <= high || from.y === to.y) {\n    const x = out > 0 ? low : high\n    points = [p, { x, y: p.y }, { x, y: q.y }, q]\n  } else {\n    const mid = p.y + Math.sign(q.y - p.y) * (rowHeight / 2)\n    points = [p, { x: a, y: p.y }, { x: a, y: mid }, { x: b, y: mid }, { x: b, y: q.y }, q]\n  }\n  return { points, tip: q, direction: into }\n}\n\n/** A small solid arrowhead with its tip at `tip`. */\nexport function arrowPath(tip: Point, direction: 1 | -1, size = 6) {\n  const back = tip.x - direction * size\n  const half = size / 2 + 0.5\n  return `M${tip.x} ${tip.y} L${back} ${tip.y - half} L${back} ${tip.y + half} Z`\n}\n"],"mappings":";;;;;AAWA,SAAgB,YAAY,QAA0B,SAAS,GAAG;CAEhE,MAAM,QAAiB,CAAC;CACxB,KAAK,MAAM,SAAS,QAAQ;EAC1B,MAAM,OAAO,MAAM,MAAM,SAAS;EAClC,IAAI,QAAQ,KAAK,MAAM,MAAM,KAAK,KAAK,MAAM,MAAM,GAAG;EACtD,MAAM,SAAS,MAAM,MAAM,SAAS;EACpC,IACE,UACA,SACE,OAAO,MAAM,KAAK,KAAK,KAAK,MAAM,MAAM,KAAO,OAAO,MAAM,KAAK,KAAK,KAAK,MAAM,MAAM,IAEzF,MAAM,IAAI;EACZ,MAAM,KAAK,KAAK;CAClB;CACA,IAAI,CAAC,MAAM,QAAQ,OAAO;CAC1B,IAAI,IAAI,IAAI,MAAM,EAAE,CAAE,EAAE,GAAG,MAAM,EAAE,CAAE;CACrC,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,SAAS,GAAG,KAAK;EACzC,MAAM,OAAO,MAAM,IAAI;EACvB,MAAM,KAAK,MAAM;EACjB,MAAM,OAAO,MAAM,IAAI;EACvB,MAAM,OAAO,KAAK,MAAM,GAAG,IAAI,KAAK,GAAG,GAAG,IAAI,KAAK,CAAC;EACpD,MAAM,MAAM,KAAK,MAAM,KAAK,IAAI,GAAG,GAAG,KAAK,IAAI,GAAG,CAAC;EACnD,MAAM,IAAI,KAAK,IAAI,QAAQ,OAAO,GAAG,MAAM,CAAC;EAC5C,MAAM,IAAI;GAAE,GAAG,GAAG,KAAM,GAAG,IAAI,KAAK,KAAK,OAAQ;GAAG,GAAG,GAAG,KAAM,GAAG,IAAI,KAAK,KAAK,OAAQ;EAAE;EAC3F,MAAM,IAAI;GAAE,GAAG,GAAG,KAAM,KAAK,IAAI,GAAG,KAAK,MAAO;GAAG,GAAG,GAAG,KAAM,KAAK,IAAI,GAAG,KAAK,MAAO;EAAE;EACzF,KAAK,KAAK,EAAE,EAAE,GAAG,EAAE,EAAE,IAAI,GAAG,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE;CACpD;CACA,MAAM,OAAO,MAAM,MAAM,SAAS;CAClC,OAAO,GAAG,EAAE,IAAI,KAAK,EAAE,GAAG,KAAK;AACjC;;;;;;;AAwBA,SAAgB,UACd,MACA,IACA,OAAsB,MACtB,YAAY,IACZ,MAAM,IACK;CACX,MAAM,YAAY,SAAS,QAAQ,SAAS;CAC5C,MAAM,cAAc,SAAS,QAAQ,SAAS;CAC9C,MAAM,MAAM,YAAY,IAAI;CAC5B,MAAM,OAAO,cAAc,IAAI;CAC/B,MAAM,IAAI;EAAE,GAAG,YAAY,KAAK,QAAQ,KAAK;EAAM,GAAG,KAAK;CAAE;CAC7D,MAAM,IAAI;EAAE,GAAG,cAAc,GAAG,OAAO,GAAG;EAAO,GAAG,GAAG;CAAE;CACzD,MAAM,IAAI,EAAE,IAAI,MAAM;CACtB,MAAM,IAAI,EAAE,IAAI,OAAO;CAGvB,MAAM,MAAM,KAAK,IAAI,MAAM,IAAI,IAAI,WAAW,OAAO,IAAI,IAAI,SAAS;CACtE,MAAM,OAAO,KAAK,IAAI,MAAM,IAAI,IAAI,UAAU,OAAO,IAAI,IAAI,QAAQ;CACrE,IAAI;CACJ,IAAI,OAAO,QAAQ,KAAK,MAAM,GAAG,GAAG;EAClC,MAAM,IAAI,MAAM,IAAI,MAAM;EAC1B,SAAS;GAAC;GAAG;IAAE;IAAG,GAAG,EAAE;GAAE;GAAG;IAAE;IAAG,GAAG,EAAE;GAAE;GAAG;EAAC;CAC9C,OAAO;EACL,MAAM,MAAM,EAAE,IAAI,KAAK,KAAK,EAAE,IAAI,EAAE,CAAC,KAAK,YAAY;EACtD,SAAS;GAAC;GAAG;IAAE,GAAG;IAAG,GAAG,EAAE;GAAE;GAAG;IAAE,GAAG;IAAG,GAAG;GAAI;GAAG;IAAE,GAAG;IAAG,GAAG;GAAI;GAAG;IAAE,GAAG;IAAG,GAAG,EAAE;GAAE;GAAG;EAAC;CACxF;CACA,OAAO;EAAE;EAAQ,KAAK;EAAG,WAAW;CAAK;AAC3C;;AAGA,SAAgB,UAAU,KAAY,WAAmB,OAAO,GAAG;CACjE,MAAM,OAAO,IAAI,IAAI,YAAY;CACjC,MAAM,OAAO,OAAO,IAAI;CACxB,OAAO,IAAI,IAAI,EAAE,GAAG,IAAI,EAAE,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK;AAC9E"}

package/dist/core/history.js

@@ -0,0 +1,70 @@
+import { applyGanttSteps, compactSteps } from "./transaction.js";
+// src/core/history.ts
+/** Transactions in one group merge when they come within this many ms. */
+var GROUP_WINDOW = 1e3;
+var GanttHistory = class {
+	depth;
+	done = [];
+	undone = [];
+	constructor(depth = 100) {
+		this.depth = depth;
+	}
+	get canUndo() {
+		return this.done.length > 0;
+	}
+	get canRedo() {
+		return this.undone.length > 0;
+	}
+	record(tr, selectionBefore, selectionAfter, now = Date.now()) {
+		if (!tr.changed || tr.meta.history === false) return;
+		this.undone = [];
+		const last = this.done[this.done.length - 1];
+		const group = tr.meta.group;
+		if (last && group && last.group === group && now - last.time < GROUP_WINDOW) {
+			last.steps = compactSteps([...last.steps, ...tr.steps]);
+			last.inverse = compactSteps([...tr.inverse, ...last.inverse]);
+			last.time = now;
+			last.selectionAfter = selectionAfter;
+			return;
+		}
+		this.done.push({
+			steps: tr.steps.slice(),
+			inverse: tr.inverse.slice(),
+			group,
+			time: now,
+			selectionBefore,
+			selectionAfter
+		});
+		if (this.done.length > this.depth) this.done.shift();
+	}
+	undo(doc) {
+		const entry = this.done.pop();
+		if (!entry) return null;
+		const tr = applyGanttSteps(doc, entry.inverse);
+		this.undone.push(entry);
+		return {
+			tr,
+			selection: entry.selectionBefore
+		};
+	}
+	redo(doc) {
+		const entry = this.undone.pop();
+		if (!entry) return null;
+		const tr = applyGanttSteps(doc, entry.steps);
+		this.done.push({
+			...entry,
+			group: void 0
+		});
+		return {
+			tr,
+			selection: entry.selectionAfter
+		};
+	}
+	clear() {
+		this.done = [];
+		this.undone = [];
+	}
+};
+export { GanttHistory };
+
+//# sourceMappingURL=history.js.map

package/dist/core/history.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"history.js","names":[],"sources":["../../src/core/history.ts"],"sourcesContent":["import {\n  applyGanttSteps,\n  compactSteps,\n  type GanttDocument,\n  type GanttStep,\n  type GanttTransaction,\n} from './transaction'\n\ninterface Entry {\n  steps: GanttStep[]\n  inverse: GanttStep[]\n  group?: string\n  time: number\n  selectionBefore: string[]\n  selectionAfter: string[]\n}\n\n/** Transactions in one group merge when they come within this many ms. */\nconst GROUP_WINDOW = 1000\n\nexport class GanttHistory {\n  private done: Entry[] = []\n  private undone: Entry[] = []\n\n  constructor(private depth = 100) {}\n\n  get canUndo() {\n    return this.done.length > 0\n  }\n\n  get canRedo() {\n    return this.undone.length > 0\n  }\n\n  record(\n    tr: GanttTransaction,\n    selectionBefore: string[],\n    selectionAfter: string[],\n    now = Date.now(),\n  ) {\n    if (!tr.changed || tr.meta.history === false) return\n    this.undone = []\n    const last = this.done[this.done.length - 1]\n    const group = tr.meta.group\n    if (last && group && last.group === group && now - last.time < GROUP_WINDOW) {\n      last.steps = compactSteps([...last.steps, ...tr.steps])\n      last.inverse = compactSteps([...tr.inverse, ...last.inverse])\n      last.time = now\n      last.selectionAfter = selectionAfter\n      return\n    }\n    this.done.push({\n      steps: tr.steps.slice(),\n      inverse: tr.inverse.slice(),\n      group,\n      time: now,\n      selectionBefore,\n      selectionAfter,\n    })\n    if (this.done.length > this.depth) this.done.shift()\n  }\n\n  undo(doc: GanttDocument) {\n    const entry = this.done.pop()\n    if (!entry) return null\n    const tr = applyGanttSteps(doc, entry.inverse)\n    this.undone.push(entry)\n    return { tr, selection: entry.selectionBefore }\n  }\n\n  redo(doc: GanttDocument) {\n    const entry = this.undone.pop()\n    if (!entry) return null\n    const tr = applyGanttSteps(doc, entry.steps)\n    this.done.push({ ...entry, group: undefined })\n    return { tr, selection: entry.selectionAfter }\n  }\n\n  clear() {\n    this.done = []\n    this.undone = []\n  }\n}\n"],"mappings":";;;AAkBA,IAAM,eAAe;AAErB,IAAa,eAAb,MAA0B;CAIJ;CAHpB,OAAwB,CAAC;CACzB,SAA0B,CAAC;CAE3B,YAAY,QAAgB,KAAK;EAAb,KAAA,QAAA;CAAc;CAElC,IAAI,UAAU;EACZ,OAAO,KAAK,KAAK,SAAS;CAC5B;CAEA,IAAI,UAAU;EACZ,OAAO,KAAK,OAAO,SAAS;CAC9B;CAEA,OACE,IACA,iBACA,gBACA,MAAM,KAAK,IAAI,GACf;EACA,IAAI,CAAC,GAAG,WAAW,GAAG,KAAK,YAAY,OAAO;EAC9C,KAAK,SAAS,CAAC;EACf,MAAM,OAAO,KAAK,KAAK,KAAK,KAAK,SAAS;EAC1C,MAAM,QAAQ,GAAG,KAAK;EACtB,IAAI,QAAQ,SAAS,KAAK,UAAU,SAAS,MAAM,KAAK,OAAO,cAAc;GAC3E,KAAK,QAAQ,aAAa,CAAC,GAAG,KAAK,OAAO,GAAG,GAAG,KAAK,CAAC;GACtD,KAAK,UAAU,aAAa,CAAC,GAAG,GAAG,SAAS,GAAG,KAAK,OAAO,CAAC;GAC5D,KAAK,OAAO;GACZ,KAAK,iBAAiB;GACtB;EACF;EACA,KAAK,KAAK,KAAK;GACb,OAAO,GAAG,MAAM,MAAM;GACtB,SAAS,GAAG,QAAQ,MAAM;GAC1B;GACA,MAAM;GACN;GACA;EACF,CAAC;EACD,IAAI,KAAK,KAAK,SAAS,KAAK,OAAO,KAAK,KAAK,MAAM;CACrD;CAEA,KAAK,KAAoB;EACvB,MAAM,QAAQ,KAAK,KAAK,IAAI;EAC5B,IAAI,CAAC,OAAO,OAAO;EACnB,MAAM,KAAK,gBAAgB,KAAK,MAAM,OAAO;EAC7C,KAAK,OAAO,KAAK,KAAK;EACtB,OAAO;GAAE;GAAI,WAAW,MAAM;EAAgB;CAChD;CAEA,KAAK,KAAoB;EACvB,MAAM,QAAQ,KAAK,OAAO,IAAI;EAC9B,IAAI,CAAC,OAAO,OAAO;EACnB,MAAM,KAAK,gBAAgB,KAAK,MAAM,KAAK;EAC3C,KAAK,KAAK,KAAK;GAAE,GAAG;GAAO,OAAO,KAAA;EAAU,CAAC;EAC7C,OAAO;GAAE;GAAI,WAAW,MAAM;EAAe;CAC/C;CAEA,QAAQ;EACN,KAAK,OAAO,CAAC;EACb,KAAK,SAAS,CAAC;CACjB;AACF"}

package/dist/core/links.js

@@ -0,0 +1,72 @@
+// src/core/links.ts
+/** Whether `to` can be reached from `from` along the links. */
+function reaches(links, from, to) {
+	const next = /* @__PURE__ */ new Map();
+	for (const link of links) {
+		const list = next.get(link.from);
+		if (list) list.push(link.to);
+		else next.set(link.from, [link.to]);
+	}
+	const seen = /* @__PURE__ */ new Set();
+	const stack = [from];
+	while (stack.length) {
+		const id = stack.pop();
+		if (id === to) return true;
+		if (seen.has(id)) continue;
+		seen.add(id);
+		stack.push(...next.get(id) ?? []);
+	}
+	return false;
+}
+/** Whether `ancestor` is a parent, grandparent… of `id`. */
+function isAncestor(tasks, ancestor, id) {
+	const seen = /* @__PURE__ */ new Set();
+	for (let up = tasks.get(id)?.parent; up != null && !seen.has(up); up = tasks.get(up)?.parent) {
+		if (up === ancestor) return true;
+		seen.add(up);
+	}
+	return false;
+}
+/**
+* Why a link from `from` to `to` can't be made, or `null` when it can: a
+* task can't depend on itself, on its own parent or child, on a task it
+* already depends on, or on a task that waits for it.
+*/
+function linkRefusal(tasks, links, from, to) {
+	if (from === to) return "self";
+	if (isAncestor(tasks, from, to) || isAncestor(tasks, to, from)) return "nested";
+	if (links.some((link) => link.from === from && link.to === to || link.from === to && link.to === from)) return "duplicate";
+	if (reaches(links, to, from)) return "cycle";
+	return null;
+}
+/** The link type for a line drawn from one end of a task to one end of another. */
+function linkTypeOf(fromEnd, toEnd) {
+	if (fromEnd === "end") return toEnd === "start" ? "fs" : "ff";
+	return toEnd === "start" ? "ss" : "sf";
+}
+/** Reads a `lag`: a number of working days, or `'2d'`, `'4h'`, `'30m'`; `null` when unreadable. */
+function parseLag(lag) {
+	if (lag == null || lag === "") return {
+		amount: 0,
+		unit: "day"
+	};
+	if (typeof lag === "number") return Number.isFinite(lag) ? {
+		amount: lag,
+		unit: "day"
+	} : null;
+	const match = /^\s*(-?\d+(?:\.\d+)?)\s*(d|h|m)\s*$/i.exec(lag);
+	if (!match) return null;
+	const value = Number(match[1]);
+	const unit = match[2].toLowerCase();
+	if (unit === "d") return {
+		amount: value,
+		unit: "day"
+	};
+	return {
+		amount: Math.round(unit === "h" ? value * 60 : value),
+		unit: "minute"
+	};
+}
+export { linkRefusal, linkTypeOf, parseLag, reaches };
+
+//# sourceMappingURL=links.js.map

package/dist/core/links.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"links.js","names":[],"sources":["../../src/core/links.ts"],"sourcesContent":["import type { GanttLink, GanttLinkType, GanttTask } from './model'\n\n/** Why a new link was refused. */\nexport type GanttLinkRefusal = 'self' | 'nested' | 'duplicate' | 'cycle' | 'custom'\n\n/** Whether `to` can be reached from `from` along the links. */\nexport function reaches(links: readonly GanttLink[], from: string, to: string) {\n  const next = new Map<string, string[]>()\n  for (const link of links) {\n    const list = next.get(link.from)\n    if (list) list.push(link.to)\n    else next.set(link.from, [link.to])\n  }\n  const seen = new Set<string>()\n  const stack = [from]\n  while (stack.length) {\n    const id = stack.pop()!\n    if (id === to) return true\n    if (seen.has(id)) continue\n    seen.add(id)\n    stack.push(...(next.get(id) ?? []))\n  }\n  return false\n}\n\n/** Whether `ancestor` is a parent, grandparent… of `id`. */\nfunction isAncestor(tasks: ReadonlyMap<string, GanttTask>, ancestor: string, id: string) {\n  const seen = new Set<string>()\n  for (let up = tasks.get(id)?.parent; up != null && !seen.has(up); up = tasks.get(up)?.parent) {\n    if (up === ancestor) return true\n    seen.add(up)\n  }\n  return false\n}\n\n/**\n * Why a link from `from` to `to` can't be made, or `null` when it can: a\n * task can't depend on itself, on its own parent or child, on a task it\n * already depends on, or on a task that waits for it.\n */\nexport function linkRefusal(\n  tasks: ReadonlyMap<string, GanttTask>,\n  links: readonly GanttLink[],\n  from: string,\n  to: string,\n): GanttLinkRefusal | null {\n  if (from === to) return 'self'\n  if (isAncestor(tasks, from, to) || isAncestor(tasks, to, from)) return 'nested'\n  if (\n    links.some(\n      (link) => (link.from === from && link.to === to) || (link.from === to && link.to === from),\n    )\n  )\n    return 'duplicate'\n  if (reaches(links, to, from)) return 'cycle'\n  return null\n}\n\n/** The link type for a line drawn from one end of a task to one end of another. */\nexport function linkTypeOf(fromEnd: 'start' | 'end', toEnd: 'start' | 'end'): GanttLinkType {\n  if (fromEnd === 'end') return toEnd === 'start' ? 'fs' : 'ff'\n  return toEnd === 'start' ? 'ss' : 'sf'\n}\n\n/** A link's lag, read: an amount of working days, or of working minutes. */\nexport interface GanttLag {\n  amount: number\n  unit: 'day' | 'minute'\n}\n\n/** Reads a `lag`: a number of working days, or `'2d'`, `'4h'`, `'30m'`; `null` when unreadable. */\nexport function parseLag(lag: number | string | undefined): GanttLag | null {\n  if (lag == null || lag === '') return { amount: 0, unit: 'day' }\n  if (typeof lag === 'number') return Number.isFinite(lag) ? { amount: lag, unit: 'day' } : null\n  const match = /^\\s*(-?\\d+(?:\\.\\d+)?)\\s*(d|h|m)\\s*$/i.exec(lag)\n  if (!match) return null\n  const value = Number(match[1])\n  const unit = match[2]!.toLowerCase()\n  if (unit === 'd') return { amount: value, unit: 'day' }\n  return { amount: Math.round(unit === 'h' ? value * 60 : value), unit: 'minute' }\n}\n"],"mappings":";;AAMA,SAAgB,QAAQ,OAA6B,MAAc,IAAY;CAC7E,MAAM,uBAAO,IAAI,IAAsB;CACvC,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,OAAO,KAAK,IAAI,KAAK,IAAI;EAC/B,IAAI,MAAM,KAAK,KAAK,KAAK,EAAE;OACtB,KAAK,IAAI,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC;CACpC;CACA,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,QAAQ,CAAC,IAAI;CACnB,OAAO,MAAM,QAAQ;EACnB,MAAM,KAAK,MAAM,IAAI;EACrB,IAAI,OAAO,IAAI,OAAO;EACtB,IAAI,KAAK,IAAI,EAAE,GAAG;EAClB,KAAK,IAAI,EAAE;EACX,MAAM,KAAK,GAAI,KAAK,IAAI,EAAE,KAAK,CAAC,CAAE;CACpC;CACA,OAAO;AACT;;AAGA,SAAS,WAAW,OAAuC,UAAkB,IAAY;CACvF,MAAM,uBAAO,IAAI,IAAY;CAC7B,KAAK,IAAI,KAAK,MAAM,IAAI,EAAE,CAAC,EAAE,QAAQ,MAAM,QAAQ,CAAC,KAAK,IAAI,EAAE,GAAG,KAAK,MAAM,IAAI,EAAE,CAAC,EAAE,QAAQ;EAC5F,IAAI,OAAO,UAAU,OAAO;EAC5B,KAAK,IAAI,EAAE;CACb;CACA,OAAO;AACT;;;;;;AAOA,SAAgB,YACd,OACA,OACA,MACA,IACyB;CACzB,IAAI,SAAS,IAAI,OAAO;CACxB,IAAI,WAAW,OAAO,MAAM,EAAE,KAAK,WAAW,OAAO,IAAI,IAAI,GAAG,OAAO;CACvE,IACE,MAAM,MACH,SAAU,KAAK,SAAS,QAAQ,KAAK,OAAO,MAAQ,KAAK,SAAS,MAAM,KAAK,OAAO,IACvF,GAEA,OAAO;CACT,IAAI,QAAQ,OAAO,IAAI,IAAI,GAAG,OAAO;CACrC,OAAO;AACT;;AAGA,SAAgB,WAAW,SAA0B,OAAuC;CAC1F,IAAI,YAAY,OAAO,OAAO,UAAU,UAAU,OAAO;CACzD,OAAO,UAAU,UAAU,OAAO;AACpC;;AASA,SAAgB,SAAS,KAAmD;CAC1E,IAAI,OAAO,QAAQ,QAAQ,IAAI,OAAO;EAAE,QAAQ;EAAG,MAAM;CAAM;CAC/D,IAAI,OAAO,QAAQ,UAAU,OAAO,OAAO,SAAS,GAAG,IAAI;EAAE,QAAQ;EAAK,MAAM;CAAM,IAAI;CAC1F,MAAM,QAAQ,uCAAuC,KAAK,GAAG;CAC7D,IAAI,CAAC,OAAO,OAAO;CACnB,MAAM,QAAQ,OAAO,MAAM,EAAE;CAC7B,MAAM,OAAO,MAAM,EAAE,CAAE,YAAY;CACnC,IAAI,SAAS,KAAK,OAAO;EAAE,QAAQ;EAAO,MAAM;CAAM;CACtD,OAAO;EAAE,QAAQ,KAAK,MAAM,SAAS,MAAM,QAAQ,KAAK,KAAK;EAAG,MAAM;CAAS;AACjF"}