kanbo-cli 0.1.0

package/dist/lib/index.mjs

@@ -0,0 +1,284 @@
+import { $ as formatPlainActivityValue, A as formatExternalSessionRef, B as readChangeSeq, C as ignoreBoardFile, D as maskDatabaseUrl, E as writeBinding, F as UNMET_ENTRY_RULE_REASONS, G as diffFieldChanges, H as DEFAULT_STATUSES, I as evaluateEntryRules, J as activityKindOrder, K as BOARD_ACTOR, L as readChecklist, M as pullRequestFactKeys, N as ENTRY_RULES, O as maskDatabaseUrls, P as ENTRY_RULE_DESCRIPTIONS, Q as formatActivityIssueReference, R as readEntryRules, S as BINDING_FILE_PATH, T as readProjectBinding, U as normalizeStatusName, V as runBoardWrite, W as TRACKED_FIELDS, X as activityToken, Y as activityText, Z as commentAuthorReference, a as BOARD_ERROR_RESPONSES, at as toIssueView, b as DEFAULT_BOARD_FILE_PATH, ct as nextIssueNumber, et as isEmptyActivityValue, i as KANBO_TOOL_NAMES, it as normalizeCommentAuthorKind, j as parseExternalSessionRef, k as createBoardOps, lt as nextIssueOrder, n as buildCapabilitiesManifest, nt as readSystemCommentKind, ot as formatIssueId, q as currentUnixSeconds, r as KANBO_TOOL_CLI_EQUIVALENTS, rt as isOutsideWriter, st as nextIssueIdentity, t as CAPABILITIES_MANIFEST_VERSION, tt as parseActivityStringArray, ut as readIssuePrefix, w as readBinding, x as renderCapabilitiesMarkdown, z as serializeEntryRules } from "./manifest-C0EcwwgO.mjs";
+import { a as BoardError } from "./migrations-path-Ciwan537.mjs";
+//#region src/domain/card-display-title.ts
+/**
+* What a card is called wherever a person or an agent reads it by name.
+*
+* A card written as a description alone is titled with its own key (every
+* writer does that). Named by its key, such a card says nothing — so its name
+* is the first line of its description instead. A browser bundle that does not
+* load this package keeps the same rule on its own, tested with the same
+* examples.
+*/
+/** How long a description line may run before it is cut with an ellipsis. */
+const DESCRIPTION_LINE_LIMIT = 120;
+function cardDisplayTitle(card) {
+	if (card.title !== card.id) return card.title;
+	return descriptionFirstLine(card.description) ?? card.title;
+}
+function descriptionFirstLine(description) {
+	for (const rawLine of (description ?? "").split("\n")) {
+		const line = stripMarkdown(rawLine);
+		if (line) return line.length > DESCRIPTION_LINE_LIMIT ? `${line.slice(0, 119).trimEnd()}…` : line;
+	}
+	return null;
+}
+function stripMarkdown(line) {
+	return line.replace(/^\s*(?:>\s*)+/, "").replace(/^\s*#{1,6}\s+/, "").replace(/^\s*(?:[-*+]|\d+[.)])\s+(?:\[[ x]\]\s+)?/i, "").replace(/!\[([^\]]*)\]\([^)]*\)/g, "$1").replace(/\[([^\]]*)\]\([^)]*\)/g, "$1").replace(/<[^>]+>/g, "").replace(/[*_~`]/g, "").replace(/\s+/g, " ").trim();
+}
+//#endregion
+//#region src/ops/board-copy.ts
+/** Nothing copied — what a move that had nothing to move reports. */
+function emptyCopyCounts() {
+	return {
+		statuses: 0,
+		milestones: 0,
+		issues: 0,
+		comments: 0,
+		runs: 0,
+		relations: 0,
+		fieldChanges: 0,
+		contextRefs: 0,
+		pullRequests: 0
+	};
+}
+/**
+* Everything the workspace has on this board, read in one pass before a single
+* row is written anywhere.
+*
+* Links are collected by id because an edge is listed by both of the cards it
+* touches, and one reaching a card outside this workspace is left behind rather
+* than copied: the target holds this workspace's board and nothing else, so the
+* far end of that edge is not there to point at.
+*/
+async function readBoardSlice(from, workspaceId) {
+	const warnings = [];
+	const statuses = await from.statuses.listByWorkspace(workspaceId);
+	const milestones = await from.milestones.listByWorkspace(workspaceId);
+	const issues = orderParentsFirst(await from.issues.listByWorkspace(workspaceId));
+	const issueIds = new Set(issues.map((issue) => issue.id));
+	const comments = [];
+	const runs = [];
+	const relations = /* @__PURE__ */ new Map();
+	const fieldChanges = [];
+	const pullRequests = [];
+	const skippedRelations = /* @__PURE__ */ new Set();
+	for (const issue of issues) {
+		comments.push(...await from.comments.listByIssue(issue.id));
+		runs.push(...await from.runs.listByIssue(issue.id));
+		for (const relation of await from.relations.listByIssue(issue.id)) {
+			if (issueIds.has(relation.sourceIssueId) && issueIds.has(relation.targetIssueId)) {
+				relations.set(relation.id, relation);
+				continue;
+			}
+			skippedRelations.add(relation.id);
+		}
+		fieldChanges.push(...await from.fieldChanges.listByIssue(issue.id));
+		pullRequests.push(...await from.pullRequests.listByIssue(issue.id));
+	}
+	if (skippedRelations.size > 0) warnings.push(`${skippedRelations.size} links to cards in other workspaces were not moved`);
+	return {
+		statuses,
+		milestones,
+		issues,
+		comments,
+		runs,
+		relations: [...relations.values()],
+		fieldChanges,
+		pullRequests,
+		warnings
+	};
+}
+/**
+* Write a slice into the target board, in one transaction, and say what was
+* written and what a person should know about it — the slice's own warnings
+* first.
+*
+* It is idempotent by id. A row the target already has is left exactly as it
+* is and counted as already present, so a copy interrupted half-way is finished
+* by running it again, and a second run of a finished one copies nothing. A
+* clash that is not the same row — a column name or a card number the target
+* holds under another id — refuses the whole copy before its first insert
+* (`board_copy_conflict`, ruling 3-55).
+*/
+async function writeBoardSlice(to, slice, workspaceId) {
+	const warnings = [...slice.warnings];
+	const copied = emptyCopyCounts();
+	let alreadyPresent = 0;
+	await to.transaction(async (tx) => {
+		await assertTheCopyFits(tx, slice, workspaceId);
+		for (const status of slice.statuses) {
+			if (await tx.statuses.findById(status.id)) {
+				alreadyPresent += 1;
+				continue;
+			}
+			await tx.statuses.create(status);
+			copied.statuses += 1;
+		}
+		for (const milestone of slice.milestones) {
+			if (await tx.milestones.findById(milestone.id)) {
+				alreadyPresent += 1;
+				continue;
+			}
+			await tx.milestones.create(milestone);
+			copied.milestones += 1;
+		}
+		const movingIssueIds = new Set(slice.issues.map((issue) => issue.id));
+		for (const issue of slice.issues) {
+			if (await tx.issues.findById(issue.id)) {
+				alreadyPresent += 1;
+				continue;
+			}
+			const parentIsReachable = issue.parentIssueId === null || movingIssueIds.has(issue.parentIssueId) || await tx.issues.findById(issue.parentIssueId) !== null;
+			if (!parentIsReachable) warnings.push(`${issue.id} lost its parent card, which is not on this board`);
+			const { contextRefs, ...row } = issue;
+			await tx.issues.create({
+				...row,
+				parentIssueId: parentIsReachable ? issue.parentIssueId : null
+			});
+			copied.issues += 1;
+			if (contextRefs !== "[]") {
+				await tx.contextRefs.replace(issue.id, contextRefs, issue.updatedAt);
+				copied.contextRefs += 1;
+			}
+		}
+		for (const comment of slice.comments) {
+			if (await tx.comments.findById(comment.id)) {
+				alreadyPresent += 1;
+				continue;
+			}
+			await tx.comments.create(comment);
+			copied.comments += 1;
+		}
+		for (const run of slice.runs) {
+			if (await tx.runs.findById(run.id)) {
+				alreadyPresent += 1;
+				continue;
+			}
+			await tx.runs.create(run);
+			copied.runs += 1;
+		}
+		for (const relation of slice.relations) {
+			if (await tx.relations.findById(relation.id)) {
+				alreadyPresent += 1;
+				continue;
+			}
+			await tx.relations.create(relation);
+			copied.relations += 1;
+		}
+		const changesByIssue = /* @__PURE__ */ new Map();
+		for (const change of slice.fieldChanges) changesByIssue.set(change.issueId, [...changesByIssue.get(change.issueId) ?? [], change]);
+		for (const [issueId, changes] of changesByIssue) {
+			const present = new Set((await tx.fieldChanges.listByIssue(issueId)).map((change) => change.id));
+			for (const change of changes) {
+				if (present.has(change.id)) {
+					alreadyPresent += 1;
+					continue;
+				}
+				await tx.fieldChanges.create(change);
+				copied.fieldChanges += 1;
+			}
+		}
+		const linksByIssue = /* @__PURE__ */ new Map();
+		for (const link of slice.pullRequests) linksByIssue.set(link.issueId, [...linksByIssue.get(link.issueId) ?? [], link]);
+		for (const [issueId, links] of linksByIssue) {
+			const present = new Set((await tx.pullRequests.listByIssue(issueId)).map((link) => link.id));
+			for (const link of links) {
+				if (present.has(link.id) || (await tx.pullRequests.link(link)).id !== link.id) {
+					alreadyPresent += 1;
+					continue;
+				}
+				copied.pullRequests += 1;
+			}
+		}
+		await tx.meta.bumpRevision("board", currentUnixSeconds());
+	});
+	if (alreadyPresent > 0) warnings.push(`${alreadyPresent} rows were already present on the target board and were left as they are`);
+	return {
+		copied,
+		warnings
+	};
+}
+/**
+* Empty the slice off the board it was read from, in a transaction of its own.
+*
+* Only the cards, the columns and the milestones are named: comments, runs,
+* links, pull request links and the field-change history hang off a card by a
+* foreign key that cascades on both engines, so deleting the card takes them
+* with it.
+*/
+async function deleteBoardSlice(from, slice) {
+	await from.transaction(async (tx) => {
+		for (const issue of slice.issues) await tx.issues.delete(issue.id);
+		for (const milestone of slice.milestones) await tx.milestones.delete(milestone.id);
+		for (const status of slice.statuses) await tx.statuses.delete(status.id);
+		await tx.meta.bumpRevision("board", currentUnixSeconds());
+	});
+}
+/**
+* What a copy would collide with on the target, said before a row is written.
+*
+* The board carries two uniqueness rules that a *second* board of the same
+* workspace can break: a column's name within its workspace, and a card's
+* number within it. In practice it is the columns that collide: a standard set
+* created a second time carries the same names under new ids, while a card's id
+* is its key (`BST-001`), so two generations of card *number* 1 are two rows
+* with one id — which the copy treats as already present rather than as a
+* clash. The number check covers the case where they are not: a workspace whose
+* identifier changed between the two generations numbers from 1 again under
+* different ids.
+*
+* A row the target already has *by id* is not a collision — it is the
+* idempotent half of the copy, which is why the holder's id is compared rather
+* than merely counted. Milestones need no check: neither engine makes their
+* titles unique.
+*/
+async function assertTheCopyFits(tx, slice, workspaceId) {
+	const conflicts = [];
+	const numbers = new Map((await tx.issues.listByWorkspace(workspaceId)).map((issue) => [issue.number, issue.id]));
+	for (const issue of slice.issues) {
+		const holder = numbers.get(issue.number);
+		if (holder !== void 0 && holder !== issue.id) conflicts.push({
+			kind: "card",
+			value: issue.number,
+			heldBy: holder
+		});
+	}
+	const names = new Map((await tx.statuses.listByWorkspace(workspaceId)).map((status) => [status.name, status.id]));
+	for (const status of slice.statuses) {
+		const holder = names.get(status.name);
+		if (holder !== void 0 && holder !== status.id) conflicts.push({
+			kind: "column",
+			value: status.name,
+			heldBy: holder
+		});
+	}
+	if (conflicts.length > 0) throw new BoardError("board_copy_conflict", {
+		workspaceId,
+		conflicts
+	});
+}
+/**
+* The same cards, ordered so that a parent is always written before its
+* children. The column is a foreign key onto the same table, so any other order
+* writes a card pointing at one that is not there yet.
+*/
+function orderParentsFirst(issues) {
+	const byId = new Map(issues.map((issue) => [issue.id, issue]));
+	const ordered = [];
+	const placed = /* @__PURE__ */ new Set();
+	function place(issue, ancestors) {
+		if (placed.has(issue.id) || ancestors.has(issue.id)) return;
+		ancestors.add(issue.id);
+		const parent = issue.parentIssueId === null ? void 0 : byId.get(issue.parentIssueId);
+		if (parent) place(parent, ancestors);
+		placed.add(issue.id);
+		ordered.push(issue);
+	}
+	for (const issue of issues) place(issue, /* @__PURE__ */ new Set());
+	return ordered;
+}
+//#endregion
+export { BINDING_FILE_PATH, BOARD_ACTOR, BOARD_ERROR_RESPONSES, BoardError, CAPABILITIES_MANIFEST_VERSION, DEFAULT_BOARD_FILE_PATH, DEFAULT_STATUSES, ENTRY_RULES, ENTRY_RULE_DESCRIPTIONS, KANBO_TOOL_CLI_EQUIVALENTS, KANBO_TOOL_NAMES, TRACKED_FIELDS, UNMET_ENTRY_RULE_REASONS, activityKindOrder, activityText, activityToken, buildCapabilitiesManifest, cardDisplayTitle, commentAuthorReference, createBoardOps, currentUnixSeconds, deleteBoardSlice, diffFieldChanges, emptyCopyCounts, evaluateEntryRules, formatActivityIssueReference, formatExternalSessionRef, formatIssueId, formatPlainActivityValue, ignoreBoardFile, isEmptyActivityValue, isOutsideWriter, maskDatabaseUrl, maskDatabaseUrls, nextIssueIdentity, nextIssueNumber, nextIssueOrder, normalizeCommentAuthorKind, normalizeStatusName, parseActivityStringArray, parseExternalSessionRef, pullRequestFactKeys, readBinding, readBoardSlice, readChangeSeq, readChecklist, readEntryRules, readIssuePrefix, readProjectBinding, readSystemCommentKind, renderCapabilitiesMarkdown, runBoardWrite, serializeEntryRules, toIssueView, writeBinding, writeBoardSlice };
+
+//# sourceMappingURL=index.mjs.map

package/dist/lib/index.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.mjs","names":[],"sources":["../../src/domain/card-display-title.ts","../../src/ops/board-copy.ts"],"sourcesContent":["/**\n * What a card is called wherever a person or an agent reads it by name.\n *\n * A card written as a description alone is titled with its own key (every\n * writer does that). Named by its key, such a card says nothing — so its name\n * is the first line of its description instead. A browser bundle that does not\n * load this package keeps the same rule on its own, tested with the same\n * examples.\n */\n\n/** How long a description line may run before it is cut with an ellipsis. */\nconst DESCRIPTION_LINE_LIMIT = 120\n\nexport function cardDisplayTitle(card: { id: string, title: string, description?: string | null }): string {\n  if (card.title !== card.id) {\n    return card.title\n  }\n  return descriptionFirstLine(card.description) ?? card.title\n}\n\nfunction descriptionFirstLine(description: string | null | undefined): string | null {\n  for (const rawLine of (description ?? '').split('\\n')) {\n    const line = stripMarkdown(rawLine)\n    if (line) {\n      return line.length > DESCRIPTION_LINE_LIMIT ? `${line.slice(0, DESCRIPTION_LINE_LIMIT - 1).trimEnd()}…` : line\n    }\n  }\n  return null\n}\n\nfunction stripMarkdown(line: string): string {\n  return line\n    .replace(/^\\s*(?:>\\s*)+/, '')\n    .replace(/^\\s*#{1,6}\\s+/, '')\n    .replace(/^\\s*(?:[-*+]|\\d+[.)])\\s+(?:\\[[ x]\\]\\s+)?/i, '')\n    .replace(/!\\[([^\\]]*)\\]\\([^)]*\\)/g, '$1')\n    .replace(/\\[([^\\]]*)\\]\\([^)]*\\)/g, '$1')\n    .replace(/<[^>]+>/g, '')\n    .replace(/[*_~`]/g, '')\n    .replace(/\\s+/g, ' ')\n    .trim()\n}\n","import type { BoardStore } from '../board-store'\nimport { BoardError } from '../domain/errors'\nimport { currentUnixSeconds } from '../domain/time'\nimport type {\n  Issue,\n  IssueComment,\n  IssueFieldChange,\n  IssueMilestone,\n  IssuePullRequest,\n  IssueRelation,\n  IssueRun,\n  IssueStatus,\n} from '../sqlite/schema'\n\n/** How many rows of each kind a copy wrote into the target board. */\nexport interface BoardCopyCounts {\n  statuses: number\n  milestones: number\n  issues: number\n  comments: number\n  runs: number\n  relations: number\n  fieldChanges: number\n  /** Cards that carried refs, not rows: context refs are a column on the card. */\n  contextRefs: number\n  pullRequests: number\n}\n\n/** Everything one workspace has on a board, read before anything is written. */\nexport interface BoardSlice {\n  statuses: IssueStatus[]\n  milestones: IssueMilestone[]\n  /** In an order where a card's parent always comes before it. */\n  issues: Issue[]\n  comments: IssueComment[]\n  runs: IssueRun[]\n  relations: IssueRelation[]\n  fieldChanges: IssueFieldChange[]\n  pullRequests: IssuePullRequest[]\n  /** What reading it had to leave behind, said to a person. */\n  warnings: string[]\n}\n\n/** Nothing copied — what a move that had nothing to move reports. */\nexport function emptyCopyCounts(): BoardCopyCounts {\n  return { statuses: 0, milestones: 0, issues: 0, comments: 0, runs: 0, relations: 0, fieldChanges: 0, contextRefs: 0, pullRequests: 0 }\n}\n\n/**\n * Everything the workspace has on this board, read in one pass before a single\n * row is written anywhere.\n *\n * Links are collected by id because an edge is listed by both of the cards it\n * touches, and one reaching a card outside this workspace is left behind rather\n * than copied: the target holds this workspace's board and nothing else, so the\n * far end of that edge is not there to point at.\n */\nexport async function readBoardSlice(from: BoardStore, workspaceId: string): Promise<BoardSlice> {\n  const warnings: string[] = []\n  const statuses = await from.statuses.listByWorkspace(workspaceId)\n  const milestones = await from.milestones.listByWorkspace(workspaceId)\n  const issues = orderParentsFirst(await from.issues.listByWorkspace(workspaceId))\n  const issueIds = new Set(issues.map(issue => issue.id))\n\n  const comments: IssueComment[] = []\n  const runs: IssueRun[] = []\n  const relations = new Map<string, IssueRelation>()\n  const fieldChanges: IssueFieldChange[] = []\n  const pullRequests: IssuePullRequest[] = []\n  const skippedRelations = new Set<string>()\n  for (const issue of issues) {\n    // The store's own order — insertion order on either engine, for runs, for\n    // comments and for field changes alike — is the order they are written back\n    // in. That is what keeps an attempt number, and the last word on a card,\n    // reading the same after the move as before it.\n    comments.push(...await from.comments.listByIssue(issue.id))\n    runs.push(...await from.runs.listByIssue(issue.id))\n    for (const relation of await from.relations.listByIssue(issue.id)) {\n      if (issueIds.has(relation.sourceIssueId) && issueIds.has(relation.targetIssueId)) {\n        relations.set(relation.id, relation)\n        continue\n      }\n      skippedRelations.add(relation.id)\n    }\n    fieldChanges.push(...await from.fieldChanges.listByIssue(issue.id))\n    pullRequests.push(...await from.pullRequests.listByIssue(issue.id))\n  }\n  if (skippedRelations.size > 0) {\n    warnings.push(`${skippedRelations.size} links to cards in other workspaces were not moved`)\n  }\n\n  return { statuses, milestones, issues, comments, runs, relations: [...relations.values()], fieldChanges, pullRequests, warnings }\n}\n\n/**\n * Write a slice into the target board, in one transaction, and say what was\n * written and what a person should know about it — the slice's own warnings\n * first.\n *\n * It is idempotent by id. A row the target already has is left exactly as it\n * is and counted as already present, so a copy interrupted half-way is finished\n * by running it again, and a second run of a finished one copies nothing. A\n * clash that is not the same row — a column name or a card number the target\n * holds under another id — refuses the whole copy before its first insert\n * (`board_copy_conflict`, ruling 3-55).\n */\nexport async function writeBoardSlice(\n  to: BoardStore,\n  slice: BoardSlice,\n  workspaceId: string,\n): Promise<{ copied: BoardCopyCounts, warnings: string[] }> {\n  const warnings = [...slice.warnings]\n  const copied = emptyCopyCounts()\n  let alreadyPresent = 0\n\n  await to.transaction(async (tx) => {\n    await assertTheCopyFits(tx, slice, workspaceId)\n\n    for (const status of slice.statuses) {\n      if (await tx.statuses.findById(status.id)) {\n        alreadyPresent += 1\n        continue\n      }\n      await tx.statuses.create(status)\n      copied.statuses += 1\n    }\n\n    for (const milestone of slice.milestones) {\n      if (await tx.milestones.findById(milestone.id)) {\n        alreadyPresent += 1\n        continue\n      }\n      await tx.milestones.create(milestone)\n      copied.milestones += 1\n    }\n\n    const movingIssueIds = new Set(slice.issues.map(issue => issue.id))\n    for (const issue of slice.issues) {\n      if (await tx.issues.findById(issue.id)) {\n        alreadyPresent += 1\n        continue\n      }\n      // A card whose parent is neither moving with it nor already on the target\n      // would point at a row that is not there. The board's own rule is that a\n      // parent which goes away leaves its children parentless, so that is what\n      // happens here too — said out loud, because a person is losing a link.\n      const parentIsReachable = issue.parentIssueId === null\n        || movingIssueIds.has(issue.parentIssueId)\n        || (await tx.issues.findById(issue.parentIssueId)) !== null\n      if (!parentIsReachable) {\n        warnings.push(`${issue.id} lost its parent card, which is not on this board`)\n      }\n      const { contextRefs, ...row } = issue\n      await tx.issues.create({ ...row, parentIssueId: parentIsReachable ? issue.parentIssueId : null })\n      copied.issues += 1\n      if (contextRefs !== '[]') {\n        await tx.contextRefs.replace(issue.id, contextRefs, issue.updatedAt)\n        copied.contextRefs += 1\n      }\n    }\n\n    for (const comment of slice.comments) {\n      if (await tx.comments.findById(comment.id)) {\n        alreadyPresent += 1\n        continue\n      }\n      await tx.comments.create(comment)\n      copied.comments += 1\n    }\n\n    for (const run of slice.runs) {\n      if (await tx.runs.findById(run.id)) {\n        alreadyPresent += 1\n        continue\n      }\n      await tx.runs.create(run)\n      copied.runs += 1\n    }\n\n    for (const relation of slice.relations) {\n      if (await tx.relations.findById(relation.id)) {\n        alreadyPresent += 1\n        continue\n      }\n      await tx.relations.create(relation)\n      copied.relations += 1\n    }\n\n    // Field changes carry no lookup by id of their own — they are read a card\n    // at a time — so what the target already has is read a card at a time too.\n    const changesByIssue = new Map<string, IssueFieldChange[]>()\n    for (const change of slice.fieldChanges) {\n      changesByIssue.set(change.issueId, [...(changesByIssue.get(change.issueId) ?? []), change])\n    }\n    for (const [issueId, changes] of changesByIssue) {\n      const present = new Set((await tx.fieldChanges.listByIssue(issueId)).map(change => change.id))\n      for (const change of changes) {\n        if (present.has(change.id)) {\n          alreadyPresent += 1\n          continue\n        }\n        await tx.fieldChanges.create(change)\n        copied.fieldChanges += 1\n      }\n    }\n\n    // Pull request links, like field changes, are read a card at a time. One\n    // the target holds under another id names the same pull request — `link`\n    // hands back that standing row — so it is already present too.\n    const linksByIssue = new Map<string, IssuePullRequest[]>()\n    for (const link of slice.pullRequests) {\n      linksByIssue.set(link.issueId, [...(linksByIssue.get(link.issueId) ?? []), link])\n    }\n    for (const [issueId, links] of linksByIssue) {\n      const present = new Set((await tx.pullRequests.listByIssue(issueId)).map(link => link.id))\n      for (const link of links) {\n        if (present.has(link.id) || (await tx.pullRequests.link(link)).id !== link.id) {\n          alreadyPresent += 1\n          continue\n        }\n        copied.pullRequests += 1\n      }\n    }\n\n    // One bump for the whole copy: a reader watching the target refetches once,\n    // not once per card.\n    await tx.meta.bumpRevision('board', currentUnixSeconds())\n  })\n\n  if (alreadyPresent > 0) {\n    warnings.push(`${alreadyPresent} rows were already present on the target board and were left as they are`)\n  }\n  return { copied, warnings }\n}\n\n/**\n * Empty the slice off the board it was read from, in a transaction of its own.\n *\n * Only the cards, the columns and the milestones are named: comments, runs,\n * links, pull request links and the field-change history hang off a card by a\n * foreign key that cascades on both engines, so deleting the card takes them\n * with it.\n */\nexport async function deleteBoardSlice(from: BoardStore, slice: BoardSlice): Promise<void> {\n  await from.transaction(async (tx) => {\n    for (const issue of slice.issues) {\n      await tx.issues.delete(issue.id)\n    }\n    for (const milestone of slice.milestones) {\n      await tx.milestones.delete(milestone.id)\n    }\n    for (const status of slice.statuses) {\n      await tx.statuses.delete(status.id)\n    }\n    await tx.meta.bumpRevision('board', currentUnixSeconds())\n  })\n}\n\n/**\n * What a copy would collide with on the target, said before a row is written.\n *\n * The board carries two uniqueness rules that a *second* board of the same\n * workspace can break: a column's name within its workspace, and a card's\n * number within it. In practice it is the columns that collide: a standard set\n * created a second time carries the same names under new ids, while a card's id\n * is its key (`BST-001`), so two generations of card *number* 1 are two rows\n * with one id — which the copy treats as already present rather than as a\n * clash. The number check covers the case where they are not: a workspace whose\n * identifier changed between the two generations numbers from 1 again under\n * different ids.\n *\n * A row the target already has *by id* is not a collision — it is the\n * idempotent half of the copy, which is why the holder's id is compared rather\n * than merely counted. Milestones need no check: neither engine makes their\n * titles unique.\n */\nasync function assertTheCopyFits(tx: BoardStore, slice: BoardSlice, workspaceId: string): Promise<void> {\n  const conflicts: { kind: 'card' | 'column', value: string | number, heldBy: string }[] = []\n\n  const numbers = new Map((await tx.issues.listByWorkspace(workspaceId)).map(issue => [issue.number, issue.id]))\n  for (const issue of slice.issues) {\n    const holder = numbers.get(issue.number)\n    if (holder !== undefined && holder !== issue.id) {\n      conflicts.push({ kind: 'card', value: issue.number, heldBy: holder })\n    }\n  }\n\n  const names = new Map((await tx.statuses.listByWorkspace(workspaceId)).map(status => [status.name, status.id]))\n  for (const status of slice.statuses) {\n    const holder = names.get(status.name)\n    if (holder !== undefined && holder !== status.id) {\n      conflicts.push({ kind: 'column', value: status.name, heldBy: holder })\n    }\n  }\n\n  if (conflicts.length > 0) {\n    throw new BoardError('board_copy_conflict', { workspaceId, conflicts })\n  }\n}\n\n/**\n * The same cards, ordered so that a parent is always written before its\n * children. The column is a foreign key onto the same table, so any other order\n * writes a card pointing at one that is not there yet.\n */\nfunction orderParentsFirst(issues: Issue[]): Issue[] {\n  const byId = new Map(issues.map(issue => [issue.id, issue]))\n  const ordered: Issue[] = []\n  const placed = new Set<string>()\n\n  function place(issue: Issue, ancestors: Set<string>): void {\n    if (placed.has(issue.id) || ancestors.has(issue.id)) {\n      return\n    }\n    ancestors.add(issue.id)\n    const parent = issue.parentIssueId === null ? undefined : byId.get(issue.parentIssueId)\n    if (parent) {\n      place(parent, ancestors)\n    }\n    placed.add(issue.id)\n    ordered.push(issue)\n  }\n\n  for (const issue of issues) {\n    place(issue, new Set())\n  }\n  return ordered\n}\n"],"mappings":";;;;;;;;;;;;;AAWA,MAAM,yBAAyB;AAE/B,SAAgB,iBAAiB,MAA0E;CACzG,IAAI,KAAK,UAAU,KAAK,IACtB,OAAO,KAAK;CAEd,OAAO,qBAAqB,KAAK,WAAW,KAAK,KAAK;AACxD;AAEA,SAAS,qBAAqB,aAAuD;CACnF,KAAK,MAAM,YAAY,eAAe,GAAA,CAAI,MAAM,IAAI,GAAG;EACrD,MAAM,OAAO,cAAc,OAAO;EAClC,IAAI,MACF,OAAO,KAAK,SAAS,yBAAyB,GAAG,KAAK,MAAM,GAAG,GAA0B,CAAC,CAAC,QAAQ,EAAE,KAAK;CAE9G;CACA,OAAO;AACT;AAEA,SAAS,cAAc,MAAsB;CAC3C,OAAO,KACJ,QAAQ,iBAAiB,EAAE,CAAC,CAC5B,QAAQ,iBAAiB,EAAE,CAAC,CAC5B,QAAQ,6CAA6C,EAAE,CAAC,CACxD,QAAQ,2BAA2B,IAAI,CAAC,CACxC,QAAQ,0BAA0B,IAAI,CAAC,CACvC,QAAQ,YAAY,EAAE,CAAC,CACvB,QAAQ,WAAW,EAAE,CAAC,CACtB,QAAQ,QAAQ,GAAG,CAAC,CACpB,KAAK;AACV;;;;ACGA,SAAgB,kBAAmC;CACjD,OAAO;EAAE,UAAU;EAAG,YAAY;EAAG,QAAQ;EAAG,UAAU;EAAG,MAAM;EAAG,WAAW;EAAG,cAAc;EAAG,aAAa;EAAG,cAAc;CAAE;AACvI;;;;;;;;;;AAWA,eAAsB,eAAe,MAAkB,aAA0C;CAC/F,MAAM,WAAqB,CAAC;CAC5B,MAAM,WAAW,MAAM,KAAK,SAAS,gBAAgB,WAAW;CAChE,MAAM,aAAa,MAAM,KAAK,WAAW,gBAAgB,WAAW;CACpE,MAAM,SAAS,kBAAkB,MAAM,KAAK,OAAO,gBAAgB,WAAW,CAAC;CAC/E,MAAM,WAAW,IAAI,IAAI,OAAO,KAAI,UAAS,MAAM,EAAE,CAAC;CAEtD,MAAM,WAA2B,CAAC;CAClC,MAAM,OAAmB,CAAC;CAC1B,MAAM,4BAAY,IAAI,IAA2B;CACjD,MAAM,eAAmC,CAAC;CAC1C,MAAM,eAAmC,CAAC;CAC1C,MAAM,mCAAmB,IAAI,IAAY;CACzC,KAAK,MAAM,SAAS,QAAQ;EAK1B,SAAS,KAAK,GAAG,MAAM,KAAK,SAAS,YAAY,MAAM,EAAE,CAAC;EAC1D,KAAK,KAAK,GAAG,MAAM,KAAK,KAAK,YAAY,MAAM,EAAE,CAAC;EAClD,KAAK,MAAM,YAAY,MAAM,KAAK,UAAU,YAAY,MAAM,EAAE,GAAG;GACjE,IAAI,SAAS,IAAI,SAAS,aAAa,KAAK,SAAS,IAAI,SAAS,aAAa,GAAG;IAChF,UAAU,IAAI,SAAS,IAAI,QAAQ;IACnC;GACF;GACA,iBAAiB,IAAI,SAAS,EAAE;EAClC;EACA,aAAa,KAAK,GAAG,MAAM,KAAK,aAAa,YAAY,MAAM,EAAE,CAAC;EAClE,aAAa,KAAK,GAAG,MAAM,KAAK,aAAa,YAAY,MAAM,EAAE,CAAC;CACpE;CACA,IAAI,iBAAiB,OAAO,GAC1B,SAAS,KAAK,GAAG,iBAAiB,KAAK,mDAAmD;CAG5F,OAAO;EAAE;EAAU;EAAY;EAAQ;EAAU;EAAM,WAAW,CAAC,GAAG,UAAU,OAAO,CAAC;EAAG;EAAc;EAAc;CAAS;AAClI;;;;;;;;;;;;;AAcA,eAAsB,gBACpB,IACA,OACA,aAC0D;CAC1D,MAAM,WAAW,CAAC,GAAG,MAAM,QAAQ;CACnC,MAAM,SAAS,gBAAgB;CAC/B,IAAI,iBAAiB;CAErB,MAAM,GAAG,YAAY,OAAO,OAAO;EACjC,MAAM,kBAAkB,IAAI,OAAO,WAAW;EAE9C,KAAK,MAAM,UAAU,MAAM,UAAU;GACnC,IAAI,MAAM,GAAG,SAAS,SAAS,OAAO,EAAE,GAAG;IACzC,kBAAkB;IAClB;GACF;GACA,MAAM,GAAG,SAAS,OAAO,MAAM;GAC/B,OAAO,YAAY;EACrB;EAEA,KAAK,MAAM,aAAa,MAAM,YAAY;GACxC,IAAI,MAAM,GAAG,WAAW,SAAS,UAAU,EAAE,GAAG;IAC9C,kBAAkB;IAClB;GACF;GACA,MAAM,GAAG,WAAW,OAAO,SAAS;GACpC,OAAO,cAAc;EACvB;EAEA,MAAM,iBAAiB,IAAI,IAAI,MAAM,OAAO,KAAI,UAAS,MAAM,EAAE,CAAC;EAClE,KAAK,MAAM,SAAS,MAAM,QAAQ;GAChC,IAAI,MAAM,GAAG,OAAO,SAAS,MAAM,EAAE,GAAG;IACtC,kBAAkB;IAClB;GACF;GAKA,MAAM,oBAAoB,MAAM,kBAAkB,QAC7C,eAAe,IAAI,MAAM,aAAa,KACrC,MAAM,GAAG,OAAO,SAAS,MAAM,aAAa,MAAO;GACzD,IAAI,CAAC,mBACH,SAAS,KAAK,GAAG,MAAM,GAAG,kDAAkD;GAE9E,MAAM,EAAE,aAAa,GAAG,QAAQ;GAChC,MAAM,GAAG,OAAO,OAAO;IAAE,GAAG;IAAK,eAAe,oBAAoB,MAAM,gBAAgB;GAAK,CAAC;GAChG,OAAO,UAAU;GACjB,IAAI,gBAAgB,MAAM;IACxB,MAAM,GAAG,YAAY,QAAQ,MAAM,IAAI,aAAa,MAAM,SAAS;IACnE,OAAO,eAAe;GACxB;EACF;EAEA,KAAK,MAAM,WAAW,MAAM,UAAU;GACpC,IAAI,MAAM,GAAG,SAAS,SAAS,QAAQ,EAAE,GAAG;IAC1C,kBAAkB;IAClB;GACF;GACA,MAAM,GAAG,SAAS,OAAO,OAAO;GAChC,OAAO,YAAY;EACrB;EAEA,KAAK,MAAM,OAAO,MAAM,MAAM;GAC5B,IAAI,MAAM,GAAG,KAAK,SAAS,IAAI,EAAE,GAAG;IAClC,kBAAkB;IAClB;GACF;GACA,MAAM,GAAG,KAAK,OAAO,GAAG;GACxB,OAAO,QAAQ;EACjB;EAEA,KAAK,MAAM,YAAY,MAAM,WAAW;GACtC,IAAI,MAAM,GAAG,UAAU,SAAS,SAAS,EAAE,GAAG;IAC5C,kBAAkB;IAClB;GACF;GACA,MAAM,GAAG,UAAU,OAAO,QAAQ;GAClC,OAAO,aAAa;EACtB;EAIA,MAAM,iCAAiB,IAAI,IAAgC;EAC3D,KAAK,MAAM,UAAU,MAAM,cACzB,eAAe,IAAI,OAAO,SAAS,CAAC,GAAI,eAAe,IAAI,OAAO,OAAO,KAAK,CAAC,GAAI,MAAM,CAAC;EAE5F,KAAK,MAAM,CAAC,SAAS,YAAY,gBAAgB;GAC/C,MAAM,UAAU,IAAI,KAAK,MAAM,GAAG,aAAa,YAAY,OAAO,EAAA,CAAG,KAAI,WAAU,OAAO,EAAE,CAAC;GAC7F,KAAK,MAAM,UAAU,SAAS;IAC5B,IAAI,QAAQ,IAAI,OAAO,EAAE,GAAG;KAC1B,kBAAkB;KAClB;IACF;IACA,MAAM,GAAG,aAAa,OAAO,MAAM;IACnC,OAAO,gBAAgB;GACzB;EACF;EAKA,MAAM,+BAAe,IAAI,IAAgC;EACzD,KAAK,MAAM,QAAQ,MAAM,cACvB,aAAa,IAAI,KAAK,SAAS,CAAC,GAAI,aAAa,IAAI,KAAK,OAAO,KAAK,CAAC,GAAI,IAAI,CAAC;EAElF,KAAK,MAAM,CAAC,SAAS,UAAU,cAAc;GAC3C,MAAM,UAAU,IAAI,KAAK,MAAM,GAAG,aAAa,YAAY,OAAO,EAAA,CAAG,KAAI,SAAQ,KAAK,EAAE,CAAC;GACzF,KAAK,MAAM,QAAQ,OAAO;IACxB,IAAI,QAAQ,IAAI,KAAK,EAAE,MAAM,MAAM,GAAG,aAAa,KAAK,IAAI,EAAA,CAAG,OAAO,KAAK,IAAI;KAC7E,kBAAkB;KAClB;IACF;IACA,OAAO,gBAAgB;GACzB;EACF;EAIA,MAAM,GAAG,KAAK,aAAa,SAAS,mBAAmB,CAAC;CAC1D,CAAC;CAED,IAAI,iBAAiB,GACnB,SAAS,KAAK,GAAG,eAAe,yEAAyE;CAE3G,OAAO;EAAE;EAAQ;CAAS;AAC5B;;;;;;;;;AAUA,eAAsB,iBAAiB,MAAkB,OAAkC;CACzF,MAAM,KAAK,YAAY,OAAO,OAAO;EACnC,KAAK,MAAM,SAAS,MAAM,QACxB,MAAM,GAAG,OAAO,OAAO,MAAM,EAAE;EAEjC,KAAK,MAAM,aAAa,MAAM,YAC5B,MAAM,GAAG,WAAW,OAAO,UAAU,EAAE;EAEzC,KAAK,MAAM,UAAU,MAAM,UACzB,MAAM,GAAG,SAAS,OAAO,OAAO,EAAE;EAEpC,MAAM,GAAG,KAAK,aAAa,SAAS,mBAAmB,CAAC;CAC1D,CAAC;AACH;;;;;;;;;;;;;;;;;;;AAoBA,eAAe,kBAAkB,IAAgB,OAAmB,aAAoC;CACtG,MAAM,YAAmF,CAAC;CAE1F,MAAM,UAAU,IAAI,KAAK,MAAM,GAAG,OAAO,gBAAgB,WAAW,EAAA,CAAG,KAAI,UAAS,CAAC,MAAM,QAAQ,MAAM,EAAE,CAAC,CAAC;CAC7G,KAAK,MAAM,SAAS,MAAM,QAAQ;EAChC,MAAM,SAAS,QAAQ,IAAI,MAAM,MAAM;EACvC,IAAI,WAAW,KAAA,KAAa,WAAW,MAAM,IAC3C,UAAU,KAAK;GAAE,MAAM;GAAQ,OAAO,MAAM;GAAQ,QAAQ;EAAO,CAAC;CAExE;CAEA,MAAM,QAAQ,IAAI,KAAK,MAAM,GAAG,SAAS,gBAAgB,WAAW,EAAA,CAAG,KAAI,WAAU,CAAC,OAAO,MAAM,OAAO,EAAE,CAAC,CAAC;CAC9G,KAAK,MAAM,UAAU,MAAM,UAAU;EACnC,MAAM,SAAS,MAAM,IAAI,OAAO,IAAI;EACpC,IAAI,WAAW,KAAA,KAAa,WAAW,OAAO,IAC5C,UAAU,KAAK;GAAE,MAAM;GAAU,OAAO,OAAO;GAAM,QAAQ;EAAO,CAAC;CAEzE;CAEA,IAAI,UAAU,SAAS,GACrB,MAAM,IAAI,WAAW,uBAAuB;EAAE;EAAa;CAAU,CAAC;AAE1E;;;;;;AAOA,SAAS,kBAAkB,QAA0B;CACnD,MAAM,OAAO,IAAI,IAAI,OAAO,KAAI,UAAS,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC;CAC3D,MAAM,UAAmB,CAAC;CAC1B,MAAM,yBAAS,IAAI,IAAY;CAE/B,SAAS,MAAM,OAAc,WAA8B;EACzD,IAAI,OAAO,IAAI,MAAM,EAAE,KAAK,UAAU,IAAI,MAAM,EAAE,GAChD;EAEF,UAAU,IAAI,MAAM,EAAE;EACtB,MAAM,SAAS,MAAM,kBAAkB,OAAO,KAAA,IAAY,KAAK,IAAI,MAAM,aAAa;EACtF,IAAI,QACF,MAAM,QAAQ,SAAS;EAEzB,OAAO,IAAI,MAAM,EAAE;EACnB,QAAQ,KAAK,KAAK;CACpB;CAEA,KAAK,MAAM,SAAS,QAClB,MAAM,uBAAO,IAAI,IAAI,CAAC;CAExB,OAAO;AACT"}