frontier-mcp 0.1.0

package/dist/storage/markdown/create.js

@@ -0,0 +1,298 @@
+import { mkdir, rename, rmdir, unlink, writeFile } from 'node:fs/promises';
+import { join } from 'node:path';
+import { MINTED_ID } from '../../domain.js';
+import { resolveDraftEdges } from '../../edges.js';
+import { serializeNew } from './serialize.js';
+import { stage, unstage } from './write.js';
+/**
+ * How many times the batch will re-scan and start over when a parallel session
+ * lands an id between our scan and our guard. Each retry needs a real collision,
+ * so more than a couple means something other than contention.
+ */
+const MAX_ATTEMPTS = 8;
+/**
+ * A ceiling on how far a single batch will walk looking for free ids. Reached
+ * only when a workspace has collected a guard per candidate from crashed
+ * sessions, which is a broken state rather than a busy one.
+ */
+const CANDIDATE_HEADROOM = 1000;
+/**
+ * Create every Ticket in the batch, or none, and return the filenames written in
+ * the order asked for.
+ *
+ * Ids are `max + 1` over the whole workspace — derived, so there is no counter
+ * file to drift — and made safe against a parallel session by an exclusive
+ * create: `open(..., 'wx')` on a guard named for the candidate id, bumping to the
+ * next candidate on collision. The filesystem provides the mutual exclusion.
+ *
+ * The guard alone is not compare-and-set. A session that scanned before ours and
+ * finished writing after would hand us an id it has already used, so the batch
+ * re-scans *while holding every guard* and starts over if any candidate has
+ * turned up on disk. That is what makes the invariant hold: a file carrying id X
+ * is only ever written while X's guard is held, and the guard is only kept when a
+ * scan taken after acquiring it shows X unused — so two sessions can never both
+ * write X. See ADR 0005.
+ */
+export async function createTicketFiles(request) {
+    const { scratch, effort, dir, issues, drafts, rescan, validate, createEffort } = request;
+    const { reservations, tickets } = await reserve(scratch, drafts.length, rescan);
+    try {
+        const ids = reservations.map(entry => entry.id);
+        // The last rule that can only be checked now: the ids are real, and nothing
+        // has been written or even created, so a refusal leaves no trace at all.
+        validate(ids, tickets);
+        const files = filesFor(effort, drafts, ids, tickets);
+        // After validation, so a refused batch never leaves an empty Effort behind —
+        // a bare issues/ directory is enough to make one show up in list_efforts.
+        await mkdir(issues, { recursive: true });
+        try {
+            await writeAll(issues, files);
+        }
+        catch (error) {
+            if (createEffort)
+                await discardEffort(dir, issues);
+            throw error;
+        }
+        return files.map(file => file.filename);
+    }
+    finally {
+        // Released only once every file is on disk. A guard held across the write is
+        // the whole guarantee; releasing early would reopen the window it closes.
+        await release(reservations);
+    }
+}
+/**
+ * Hold exclusive id guards for `count` fresh ids, run `use`, then release.
+ * Migration mints through this so a parallel create_tickets cannot collide.
+ */
+export async function withIdReservations(scratch, count, rescan, use) {
+    if (count === 0)
+        return use([]);
+    const { reservations } = await reserve(scratch, count, rescan);
+    try {
+        return await use(reservations.map(entry => entry.id));
+    }
+    finally {
+        await release(reservations);
+    }
+}
+/**
+ * The next `count` minted ids from a scan, without taking guards. Preview uses
+ * this so a dry run never leaves `.frontier-id-*.guard` files behind.
+ */
+export function peekMintedIds(used, count) {
+    const ids = [];
+    let candidate = highestMinted(used) + 1;
+    while (ids.length < count) {
+        const id = `T${String(candidate)}`;
+        if (!used.has(id))
+            ids.push(id);
+        candidate += 1;
+    }
+    return ids;
+}
+/** The cosmetic filename convention: `<NN>-T<n>-<slug>.md`. */
+export function ticketFilename(order, id, title) {
+    return `${pad(order)}-${id}-${slugify(title)}.md`;
+}
+/**
+ * Remove an Effort this call made and then failed to fill. `rmdir` rather than a
+ * recursive delete: it fails with ENOTEMPTY on a directory holding anything,
+ * which is exactly right if a concurrent session has already put something
+ * there. Never a recursive `rm` — this runs on a failure path, where being wrong
+ * about which directory it is would destroy somebody's work.
+ */
+async function discardEffort(dir, issues) {
+    await rmdir(issues).catch(() => { });
+    await rmdir(dir).catch(() => { });
+}
+/**
+ * Turn the drafts into files. Temporary keys resolve here, against the ids the
+ * batch just reserved — the same resolution the cycle check validated, so the
+ * graph that was approved is the graph that gets written.
+ */
+function filesFor(effort, drafts, ids, tickets) {
+    const resolve = resolveDraftEdges(drafts, ids);
+    const firstOrder = nextOrder(tickets, effort);
+    return drafts.map((draft, index) => {
+        const id = ids[index];
+        if (id === undefined)
+            throw new Error('Reserved fewer ids than there are Tickets to create.');
+        const contents = serializeNew({
+            id,
+            title: draft.title,
+            kind: draft.kind,
+            type: draft.type,
+            status: 'open',
+            triage: draft.triage,
+            blockedBy: draft.blockedBy.map(resolve),
+        }, draft.body);
+        return { filename: ticketFilename(firstOrder + index, id, draft.title), contents };
+    });
+}
+/**
+ * Stage every file beside its target, then rename them all into place. Both
+ * phases settle in full before the next begins, because a `Promise.all` that
+ * rejects on the first failure leaves its siblings running — and a rename
+ * landing after the cleanup ran is the orphan this is trying to prevent.
+ *
+ * Splitting the phases is what makes "all or none" true of the batch rather than
+ * only of each file. Everything that can fail — a full disk, a bad path — fails
+ * in the staging phase, where nothing is visible yet. By the time the renames
+ * start, every file exists in the directory it is going into, and a rename
+ * within one directory is atomic and essentially cannot fail.
+ */
+async function writeAll(issues, files) {
+    const staged = await Promise.allSettled(files.map(async (file) => ({
+        temporary: await stage(join(issues, file.filename), file.contents),
+        target: join(issues, file.filename),
+    })));
+    const ready = staged.filter(entry => entry.status === 'fulfilled').map(entry => entry.value);
+    const failed = staged.find(entry => entry.status === 'rejected');
+    if (failed !== undefined) {
+        await Promise.allSettled(ready.map(entry => unstage(entry.temporary)));
+        throw failed.reason;
+    }
+    const renamed = await Promise.allSettled(ready.map(async (entry) => {
+        // Two batches racing on one Effort can pick the same sort order, which is
+        // cosmetic — the id beside it still differs, so the names cannot actually
+        // collide. This is the assertion of that rather than a case with a path to
+        // it: a target that exists would be a Ticket this write was about to
+        // destroy.
+        await rename(entry.temporary, entry.target);
+        return entry.target;
+    }));
+    const landed = renamed.filter(entry => entry.status === 'fulfilled').map(entry => entry.value);
+    const lost = renamed.find(entry => entry.status === 'rejected');
+    if (lost !== undefined) {
+        await Promise.allSettled([
+            ...landed.map(path => unlink(path).catch(() => { })),
+            ...ready.map(entry => unstage(entry.temporary)),
+        ]);
+        throw lost.reason;
+    }
+}
+async function reserve(scratch, count, rescan, attempt = 1) {
+    const used = idsOf(await rescan());
+    const reservations = await claim(scratch, used, count, highestMinted(used) + 1, []);
+    let settled;
+    try {
+        settled = await rescan();
+    }
+    catch (error) {
+        await release(reservations);
+        throw error;
+    }
+    const taken = idsOf(settled);
+    const redundant = reservations.filter(entry => taken.has(entry.id));
+    if (redundant.length === 0)
+        return { reservations, tickets: settled };
+    await release(reservations);
+    if (attempt >= MAX_ATTEMPTS) {
+        throw new Error(`Could not reserve ${String(count)} Ticket ids after ${String(MAX_ATTEMPTS)} attempts — ` +
+            'another session is creating Tickets continuously. Retry in a moment.');
+    }
+    return reserve(scratch, count, rescan, attempt + 1);
+}
+function release(reservations) {
+    return Promise.allSettled(reservations.map(entry => unlink(entry.guard).catch(() => { })));
+}
+/**
+ * Walk candidates, taking a guard on each. Recursive rather than a loop because
+ * each attempt depends on the one before it, and a bumped candidate is the
+ * normal case rather than an error.
+ */
+async function claim(scratch, used, count, candidate, taken) {
+    if (taken.length === count)
+        return taken;
+    if (candidate > highestMinted(used) + CANDIDATE_HEADROOM + count) {
+        await release(taken);
+        throw new Error(`No free Ticket id within ${String(CANDIDATE_HEADROOM)} of the highest in use. ` +
+            'Sweep the abandoned .frontier-id-*.guard files under .scratch/.');
+    }
+    const id = `T${String(candidate)}`;
+    if (used.has(id))
+        return claim(scratch, used, count, candidate + 1, taken);
+    const guard = guardFor(scratch, id);
+    // A guard we cannot take belongs to a session that is still allocating. Bump
+    // rather than wait: an id may be skipped, never reused.
+    if (!(await hold(guard)))
+        return claim(scratch, used, count, candidate + 1, taken);
+    return claim(scratch, used, count, candidate + 1, [...taken, { id, guard }]);
+}
+/**
+ * Take a guard, or report that somebody else has it.
+ *
+ * A guard is **never** broken, only bumped past, and that is the whole of the
+ * concurrency story here. Every scheme for reclaiming one — an age threshold, a
+ * liveness check on the pid inside it — has the same shape: read the guard,
+ * decide it is abandoned, then remove it. The decision goes stale between those
+ * two steps, and a session that removes a guard another session has just taken
+ * hands both of them the same id. That is the exact defect this file exists to
+ * prevent, so it is not reintroduced to tidy up after crashes.
+ *
+ * The cost is a guard left by a crashed session, which makes one id number
+ * unusable. Ids are promised never to be *reused*, never to run without gaps, so
+ * a skipped number costs nothing; the file is hidden, one line, and names the
+ * process that left it. {@link CANDIDATE_HEADROOM} bounds how many can pile up
+ * before allocation says so and points at them.
+ */
+async function hold(guard) {
+    try {
+        await writeFile(guard, `${String(process.pid)}\n`, { flag: 'wx' });
+        return true;
+    }
+    catch (error) {
+        if (error?.code !== 'EEXIST')
+            throw error;
+        return false;
+    }
+}
+/**
+ * Beside the Efforts rather than inside one, because the counter is repo-global:
+ * two sessions creating into different Efforts must still collide here. Hidden
+ * and not `.md`, so no scan mistakes it for a Ticket, and `.scratch/` yields it
+ * no Effort because it is not a directory.
+ */
+function guardFor(scratch, id) {
+    return join(scratch, `.frontier-id-${id}.guard`);
+}
+function idsOf(tickets) {
+    return new Set(tickets.map(entry => entry.id).filter(id => id !== undefined));
+}
+/**
+ * The counter, derived. Ids preserved verbatim through migration need not look
+ * like `T<n>` at all; those still occupy their name but contribute no number.
+ */
+function highestMinted(used) {
+    let highest = 0;
+    for (const id of used) {
+        const digits = MINTED_ID.exec(id)?.[1];
+        if (digits !== undefined)
+            highest = Math.max(highest, Number(digits));
+    }
+    return highest;
+}
+/** `NN` is sort order within the Effort and nothing else, so it simply continues. */
+function nextOrder(tickets, effort) {
+    const orders = tickets.filter(entry => entry.effort === effort).map(entry => entry.order);
+    return orders.length === 0 ? 1 : Math.max(...orders) + 1;
+}
+function pad(order) {
+    return String(order).padStart(2, '0');
+}
+/**
+ * The cosmetic half of a filename. It exists so a directory listing reads, and
+ * carries no identity — the id beside it does, and the frontmatter is the
+ * authority over both.
+ */
+function slugify(title) {
+    const slug = title
+        .toLowerCase()
+        .replace(/[^a-z0-9]+/g, '-')
+        .replace(/^-+|-+$/g, '')
+        .slice(0, 48)
+        .replace(/-+$/, '');
+    return slug === '' ? 'ticket' : slug;
+}
+//# sourceMappingURL=create.js.map

package/dist/storage/markdown/create.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"create.js","sourceRoot":"","sources":["../../../src/storage/markdown/create.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AAC3E,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAGjC,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAC5C,OAAO,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AACnD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAE5C;;;;GAIG;AACH,MAAM,YAAY,GAAG,CAAC,CAAC;AAEvB;;;;GAIG;AACH,MAAM,kBAAkB,GAAG,IAAI,CAAC;AA6BhC;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CAAC,OAAsB;IAC5D,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,YAAY,EAAE,GAAG,OAAO,CAAC;IACzF,MAAM,EAAE,YAAY,EAAE,OAAO,EAAE,GAAG,MAAM,OAAO,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAEhF,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAChD,4EAA4E;QAC5E,yEAAyE;QACzE,QAAQ,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QAEvB,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;QAErD,6EAA6E;QAC7E,0EAA0E;QAC1E,MAAM,KAAK,CAAC,MAAM,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QACzC,IAAI,CAAC;YACH,MAAM,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAChC,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,YAAY;gBAAE,MAAM,aAAa,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;YACnD,MAAM,KAAK,CAAC;QACd,CAAC;QAED,OAAO,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC1C,CAAC;YAAS,CAAC;QACT,6EAA6E;QAC7E,0EAA0E;QAC1E,MAAM,OAAO,CAAC,YAAY,CAAC,CAAC;IAC9B,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,OAAe,EACf,KAAa,EACb,MAAc,EACd,GAA2C;IAE3C,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC,EAAE,CAAC,CAAC;IAEhC,MAAM,EAAE,YAAY,EAAE,GAAG,MAAM,OAAO,CAAC,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IAC/D,IAAI,CAAC;QACH,OAAO,MAAM,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IACxD,CAAC;YAAS,CAAC;QACT,MAAM,OAAO,CAAC,YAAY,CAAC,CAAC;IAC9B,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,IAAyB,EAAE,KAAa;IACpE,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,IAAI,SAAS,GAAG,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAExC,OAAO,GAAG,CAAC,MAAM,GAAG,KAAK,EAAE,CAAC;QAC1B,MAAM,EAAE,GAAG,IAAI,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC;QACnC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAChC,SAAS,IAAI,CAAC,CAAC;IACjB,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC;AAED,+DAA+D;AAC/D,MAAM,UAAU,cAAc,CAAC,KAAa,EAAE,EAAU,EAAE,KAAa;IACrE,OAAO,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC;AACpD,CAAC;AAED;;;;;;GAMG;AACH,KAAK,UAAU,aAAa,CAAC,GAAW,EAAE,MAAc;IACtD,MAAM,KAAK,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;IACpC,MAAM,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;AACnC,CAAC;AAOD;;;;GAIG;AACH,SAAS,QAAQ,CACf,MAAc,EACd,MAA8B,EAC9B,GAAsB,EACtB,OAA0B;IAE1B,MAAM,OAAO,GAAG,iBAAiB,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IAC/C,MAAM,UAAU,GAAG,SAAS,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IAE9C,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;QACjC,MAAM,EAAE,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;QACtB,IAAI,EAAE,KAAK,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,sDAAsD,CAAC,CAAC;QAE9F,MAAM,QAAQ,GAAG,YAAY,CAC3B;YACE,EAAE;YACF,KAAK,EAAE,KAAK,CAAC,KAAK;YAClB,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,MAAM,EAAE,MAAM;YACd,MAAM,EAAE,KAAK,CAAC,MAAM;YACpB,SAAS,EAAE,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC;SACxC,EACD,KAAK,CAAC,IAAI,CACX,CAAC;QAEF,OAAO,EAAE,QAAQ,EAAE,cAAc,CAAC,UAAU,GAAG,KAAK,EAAE,EAAE,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,QAAQ,EAAE,CAAC;IACrF,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;;;;;;GAWG;AACH,KAAK,UAAU,QAAQ,CAAC,MAAc,EAAE,KAAyB;IAC/D,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,UAAU,CACrC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAC,IAAI,EAAC,EAAE,CAAC,CAAC;QACvB,SAAS,EAAE,MAAM,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC;QAClE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC;KACpC,CAAC,CAAC,CACJ,CAAC;IAEF,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAC7F,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC;IACjE,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,MAAM,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACvE,MAAM,MAAM,CAAC,MAAe,CAAC;IAC/B,CAAC;IAED,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,UAAU,CACtC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAC,KAAK,EAAC,EAAE;QACtB,0EAA0E;QAC1E,0EAA0E;QAC1E,2EAA2E;QAC3E,qEAAqE;QACrE,WAAW;QACX,MAAM,MAAM,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QAC5C,OAAO,KAAK,CAAC,MAAM,CAAC;IACtB,CAAC,CAAC,CACH,CAAC;IAEF,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAC/F,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC;IAChE,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,MAAM,OAAO,CAAC,UAAU,CAAC;YACvB,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;YACnD,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;SAChD,CAAC,CAAC;QACH,MAAM,IAAI,CAAC,MAAe,CAAC;IAC7B,CAAC;AACH,CAAC;AAQD,KAAK,UAAU,OAAO,CACpB,OAAe,EACf,KAAa,EACb,MAAc,EACd,OAAO,GAAG,CAAC;IAEX,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,MAAM,EAAE,CAAC,CAAC;IACnC,MAAM,YAAY,GAAG,MAAM,KAAK,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;IAEpF,IAAI,OAA0B,CAAC;IAC/B,IAAI,CAAC;QACH,OAAO,GAAG,MAAM,MAAM,EAAE,CAAC;IAC3B,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,OAAO,CAAC,YAAY,CAAC,CAAC;QAC5B,MAAM,KAAK,CAAC;IACd,CAAC;IAED,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC;IAC7B,MAAM,SAAS,GAAG,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IACpE,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,YAAY,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC;IAEtE,MAAM,OAAO,CAAC,YAAY,CAAC,CAAC;IAC5B,IAAI,OAAO,IAAI,YAAY,EAAE,CAAC;QAC5B,MAAM,IAAI,KAAK,CACb,qBAAqB,MAAM,CAAC,KAAK,CAAC,qBAAqB,MAAM,CAAC,YAAY,CAAC,cAAc;YACvF,sEAAsE,CACzE,CAAC;IACJ,CAAC;IAED,OAAO,OAAO,CAAC,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC;AACtD,CAAC;AAED,SAAS,OAAO,CAAC,YAAoC;IACnD,OAAO,OAAO,CAAC,UAAU,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AAC5F,CAAC;AAED;;;;GAIG;AACH,KAAK,UAAU,KAAK,CAClB,OAAe,EACf,IAAyB,EACzB,KAAa,EACb,SAAiB,EACjB,KAA6B;IAE7B,IAAI,KAAK,CAAC,MAAM,KAAK,KAAK;QAAE,OAAO,KAAK,CAAC;IAEzC,IAAI,SAAS,GAAG,aAAa,CAAC,IAAI,CAAC,GAAG,kBAAkB,GAAG,KAAK,EAAE,CAAC;QACjE,MAAM,OAAO,CAAC,KAAK,CAAC,CAAC;QACrB,MAAM,IAAI,KAAK,CACb,4BAA4B,MAAM,CAAC,kBAAkB,CAAC,0BAA0B;YAC9E,iEAAiE,CACpE,CAAC;IACJ,CAAC;IAED,MAAM,EAAE,GAAG,IAAI,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC;IACnC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAAE,OAAO,KAAK,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;IAE3E,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IACpC,6EAA6E;IAC7E,wDAAwD;IACxD,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC;QAAE,OAAO,KAAK,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;IAEnF,OAAO,KAAK,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;AAC/E,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,KAAK,UAAU,IAAI,CAAC,KAAa;IAC/B,IAAI,CAAC;QACH,MAAM,SAAS,CAAC,KAAK,EAAE,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;QACnE,OAAO,IAAI,CAAC;IACd,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAK,KAAsC,EAAE,IAAI,KAAK,QAAQ;YAAE,MAAM,KAAK,CAAC;QAC5E,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,SAAS,QAAQ,CAAC,OAAe,EAAE,EAAU;IAC3C,OAAO,IAAI,CAAC,OAAO,EAAE,gBAAgB,EAAE,QAAQ,CAAC,CAAC;AACnD,CAAC;AAED,SAAS,KAAK,CAAC,OAA0B;IACvC,OAAO,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC;AAChF,CAAC;AAED;;;GAGG;AACH,SAAS,aAAa,CAAC,IAAyB;IAC9C,IAAI,OAAO,GAAG,CAAC,CAAC;IAEhB,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;QACtB,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACvC,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IACxE,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,qFAAqF;AACrF,SAAS,SAAS,CAAC,OAA0B,EAAE,MAAc;IAC3D,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAC1F,OAAO,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;AAC3D,CAAC;AAED,SAAS,GAAG,CAAC,KAAa;IACxB,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AACxC,CAAC;AAED;;;;GAIG;AACH,SAAS,OAAO,CAAC,KAAa;IAC5B,MAAM,IAAI,GAAG,KAAK;SACf,WAAW,EAAE;SACb,OAAO,CAAC,aAAa,EAAE,GAAG,CAAC;SAC3B,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC;SACvB,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;SACZ,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IAEtB,OAAO,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC;AACvC,CAAC"}

package/dist/storage/markdown/driver.d.ts

@@ -0,0 +1,7 @@
+import type { StorageDriver } from '../driver.ts';
+/**
+ * The markdown driver — the only driver in v1. Bound to `root`, the resolved
+ * workspace, so that no path crosses the {@link StorageDriver} interface.
+ */
+export declare function createMarkdownDriver(root: string): StorageDriver;
+//# sourceMappingURL=driver.d.ts.map

package/dist/storage/markdown/driver.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"driver.d.ts","sourceRoot":"","sources":["../../../src/storage/markdown/driver.ts"],"names":[],"mappings":"AAcA,OAAO,KAAK,EAGV,aAAa,EAEd,MAAM,cAAc,CAAC;AAsCtB;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,MAAM,GAAG,aAAa,CAsFhE"}