okf-catalog 0.1.0

package/CHANGELOG.md

@@ -0,0 +1,24 @@
+# Changelog
+
+The format follows [Keep a Changelog](https://keepachangelog.com/en/1.1.0/). The version in `package.json` names the release. 0.1.0 is published before the clean-account run of the acceptance list in `docs/acceptance/version-0.md`, by the maintainer's choice; what that run finds goes into 0.1.1.
+
+## [0.1.0] - 2026-10-07
+
+Version 0: serve a company's Open Knowledge Format 0.2 bundle to Claude Code, locally. Needs Node 24 or later (the Active LTS line) on macOS or Linux.
+
+### Added
+
+- `okf-catalog serve`: a stdio MCP server over one company's bundle, lexical mode, with four read-only tools. `search` takes keywords and the type, topic, overdue and limit filters, and returns every hit with its path, trust tier, verifier, recheck date, source count and resource, in the text and in the structured output; `get_page` returns a page's header, a marker line and the body as data, with its provenance; `catalog` lists a folder from its index file or generates the listing; `status` reports the load, the lock, the poller, the fetched commit and every degradation and refusal.
+- The intake contract: pages are read by the specification's field table (`type`, `title`, `description`, `tags`, `status`, `stale_after` in both 0.2 texts, `generated`, `verified`, `sources`, `resource`, links, reserved files), degrade and are reported rather than refused (specification §11), and only a page without frontmatter or a type, an unsafe or oversize file, a hash mismatch or a missing manifest is refused.
+- `okf-catalog check`: the contract applied to a folder, with the report as text or JSON and an exit code.
+- `okf-catalog pack`: the published bundle written from a checkout, with generated index files and a manifest.
+- A company configuration file (`okf-catalog.yaml`): the company name, a local folder or a git repository with its branch and bundle path, the admission rule, the development flag, the pull interval, the caps, the declared types and the specification text.
+- The cache folder per company with its ownership and mode checks, and one process per company through a lock, with a private fallback for a second process.
+- The git source: a bare shallow clone used as transport only, every fetched tree listed and validated before anything is written, raw blobs extracted into the server's own folder, a hardened runner, and a poller that refreshes when the branch moves.
+- The publish recipe: a GitHub Actions workflow and two shell scripts that run the OKF checkers, pack, run them again, and push parent-linked commits to the published branch.
+- The Claude Code plugin folder with the skill, shipped inside the package; the plugin asks for no settings and runs the `okf-catalog` command from PATH in the project folder, where the server finds `okf-catalog.yaml`.
+- The benchmark harness over four public OKF bundles, with the lexical-versus-full measurement behind the maintainer's model approval.
+
+### Not in this version
+
+HTTP transport and authorization, full mode as a product option, Codex and Grok Build plugins, Windows, npm publication.

package/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/NOTICE

@@ -0,0 +1,10 @@
+okf-catalog
+Copyright 2026 Bitfusion PR LLC (bitfusion.tech) and the okf-catalog contributors
+
+Licensed under the Apache License, Version 2.0; see LICENSE.
+
+The fixture bundle under test/fixtures/bundles/spec-example is a verbatim
+copy of the example bundle bundles/acme_retail from the Open Knowledge Format
+repository, https://github.com/GoogleCloudPlatform/open-knowledge-format, at
+commit 25461dbcdd5b2f3fc9aef99c19fb7d8a94ef6149, which is licensed under the
+Apache License, Version 2.0. test/fixtures/README.md records what was copied.

package/README.md

@@ -0,0 +1,87 @@
+# okf-catalog
+
+A small-company hosted knowledge catalog for AI agents.
+
+okf-catalog is an MCP server that serves a company's [Open Knowledge Format](https://github.com/GoogleCloudPlatform/open-knowledge-format) bundle to agents. It runs on a developer's machine today and from a cheap cloud recipe later, so that local coding agents (Claude Code, Codex, Grok Build) and the web versions of Claude and ChatGPT answer from the same cited knowledge.
+
+What it adds: **qmd done right for OKF.** [qmd](https://github.com/tobi/qmd) is the best Markdown search engine there is. okf-catalog makes it understand OKF's fields: titles, descriptions and tags ranked as they should be, status and recheck dates respected, trust and provenance returned with every answer, deprecated pages pointing to their replacements.
+
+**Status: version 0 release candidate (0.1.0), not yet accepted, not published.** Every item of the version 0 acceptance list that a test can prove is proven on every run; the items that need a person on a clean account (a signed-in Claude Code answering from a bundle, a real publish, the network off) are pending, with their runbook in [docs/acceptance/version-0.md](docs/acceptance/version-0.md). The package is marked private and nothing is on npm; the licence is Apache-2.0 (decision D1). Start with [docs/intent.md](docs/intent.md); the implementation plan and its execution record are under [docs/plans/](docs/plans/).
+
+## Quickstart
+
+Once the package is on npm, the install is one command, and the `okf-catalog` command lands on your PATH:
+
+```bash
+NODE_LLAMA_CPP_SKIP_DOWNLOAD=1 npm install -g okf-catalog
+```
+
+Until then, or to work on the code, use a checkout:
+
+```bash
+git clone https://github.com/drathm/okf-catalog.git && cd okf-catalog
+NODE_LLAMA_CPP_SKIP_DOWNLOAD=1 npm ci
+```
+
+`npm ci` builds `dist/` on its way out (the `prepare` script), and the flag keeps qmd's native dependency from downloading or compiling anything: lexical mode needs no model. Check the install and a bundle (`node dist/cli.js` in a checkout stands in for `okf-catalog`, or `npm install -g .` puts the command on PATH):
+
+```bash
+okf-catalog --version
+okf-catalog check path/to/bundle --integrity none --types Term,Guide
+```
+
+Write the company's configuration, `okf-catalog.yaml`. A folder on this machine, served as it is, drafts admitted and labelled:
+
+```yaml
+company: acme
+source:
+  local: ./knowledge
+serve:
+  dev: true
+types: [Term, Guide, Policy]
+```
+
+Or a published branch, fetched into the server's own cache and polled:
+
+```yaml
+company: acme
+source:
+  repository: git@github.com:acme/knowledge.git
+  branch: published
+  bundle_path: kb
+serve:
+  pull_interval: 10m
+types: [Term, Guide, Policy]
+```
+
+Give it to Claude Code through the plugin, which asks for no settings: it runs the `okf-catalog` command from PATH in the project folder, where the server finds `okf-catalog.yaml` (or the file named by `OKF_CATALOG_CONFIG`). The plugin folder ships inside the package:
+
+```bash
+claude --plugin-dir "$(npm root -g)/okf-catalog/plugin/claude-code"
+```
+
+From a checkout, `npm install -g .` puts the command on PATH and `claude --plugin-dir ./plugin/claude-code` loads the same plugin. In the session, `/mcp` shows the `okf-catalog` server connected, and the skill tells Claude to search with keywords, read pages whole and cite the path, the trust tier, the verifier and the recheck date. The server can also be started from a shell with `okf-catalog serve --config okf-catalog.yaml`; it speaks MCP over stdio.
+
+To publish, `node dist/cli.js pack --config okf-catalog.yaml --from ./knowledge --out ./published` writes what a server serves; `recipes/publish/` has the workflow and scripts that run the OKF checkers around it and push the branch. Not in this version: full mode, a hosted server, Windows, a registry install.
+
+## Requirements
+
+- Node 24 or later (the Active LTS line when version 0 was built), on macOS or Linux (Windows is not a version 0 host: the cache folder's ownership and mode checks assume POSIX).
+- The cache folder (`$XDG_CACHE_HOME/okf-catalog/<company>`, or the platform's user cache folder) must be on a local filesystem: the one-process-per-company lock is an operating-system lock on a SQLite file, which network filesystems do not honour reliably, and it must not lie inside the bundle folder.
+
+## Publishing
+
+A server reads a `published` branch, which `okf-catalog pack` writes from a bundle folder: the admitted pages, their index files, the attachments and a manifest. `recipes/publish/` holds the GitHub Actions workflow and the two shell scripts that produce that branch on every push to the source branch, with the OKF checkers run before and after `pack`. A configuration with `source.repository`, `branch` and `bundle_path` serves that branch and polls it at `serve.pull_interval`; one with `source.local` serves a folder as it is.
+
+## Documents
+
+| Document | Holds |
+|---|---|
+| [docs/intent.md](docs/intent.md) | What this is, for whom, what it must do, and how done is judged |
+| [docs/architecture.md](docs/architecture.md) | The layers, the data flow at serve time, the publish loop, and what lives where |
+| [docs/decisions/0001-founding-decisions.md](docs/decisions/0001-founding-decisions.md) | Every decision behind the design, what was rejected and why, and whether it is settled |
+| [docs/research/](docs/research/) | The verified facts the design rests on, with sources and dates |
+
+## Licence
+
+Apache-2.0 (see `LICENSE` and `NOTICE`); okf-catalog is a product of Bitfusion PR LLC (bitfusion.tech), settled in decision D1 on 2026-10-07. Contributions need the one-time signature of [CLA.md](CLA.md), which keeps a later change of licence possible; see [CONTRIBUTING.md](CONTRIBUTING.md).

package/dist/bundle/cat-file.js

@@ -0,0 +1,94 @@
+const HEADER = /^([0-9a-f]{40,64}) (\S+)(?: (\d+))?$/;
+const utf8 = new TextDecoder("utf-8");
+const concat = (parts) => {
+    let length = 0;
+    for (const part of parts)
+        length += part.length;
+    const out = new Uint8Array(length);
+    let at = 0;
+    for (const part of parts) {
+        out.set(part, at);
+        at += part.length;
+    }
+    return out;
+};
+const indexOfNewline = (bytes) => {
+    for (let i = 0; i < bytes.length; i++)
+        if (bytes[i] === 0x0a)
+            return i;
+    return -1;
+};
+/**
+ * Reads `cat-file --batch` output for a known list of blobs, in order: `<sha> blob <size>\n`, the raw bytes, a
+ * newline. Each header is checked against the listing (the object, its type and its size) before a byte of
+ * content is kept, so a header that lies is never buffered (bite 5 review m1). Blob bytes reach `onBlob` whole.
+ */
+export function createBatchReader(expected, onBlob) {
+    const queue = [...expected];
+    let pending = new Uint8Array(0);
+    let current;
+    let awaitingNewline = false;
+    let done = false;
+    function feed(chunk) {
+        if (done) {
+            if (chunk.length > 0)
+                throw new Error("cat-file printed more after the last blob");
+            return;
+        }
+        pending = pending.length === 0 ? chunk : concat([pending, chunk]);
+        for (;;) {
+            if (awaitingNewline) {
+                if (pending.length === 0)
+                    return;
+                if (pending[0] !== 0x0a)
+                    throw new Error("cat-file printed an unexpected byte after a blob");
+                pending = pending.subarray(1);
+                awaitingNewline = false;
+                if (queue.length === 0) {
+                    done = true;
+                    if (pending.length > 0)
+                        throw new Error("cat-file printed more after the last blob");
+                    return;
+                }
+            }
+            if (current === undefined) {
+                const newline = indexOfNewline(pending);
+                if (newline === -1)
+                    return;
+                const header = utf8.decode(pending.subarray(0, newline));
+                pending = pending.subarray(newline + 1);
+                const match = HEADER.exec(header);
+                const next = queue[0];
+                if (match === null || next === undefined)
+                    throw new Error("cat-file printed a header this reader cannot parse");
+                if (match[2] === "missing")
+                    throw new Error(`the object for ${next.path} is missing`);
+                if (match[1] !== next.sha)
+                    throw new Error(`cat-file answered ${match[1]} where ${next.sha} was expected`);
+                if (match[2] !== "blob")
+                    throw new Error(`the object for ${next.path} is a ${match[2]}, not a blob`);
+                if (Number(match[3] ?? -1) !== next.size)
+                    throw new Error(`cat-file reports size ${match[3] ?? "?"} for ${next.path}, the listing said ${next.size}`);
+                queue.shift();
+                current = { entry: next, got: [], gotLength: 0 };
+            }
+            const take = Math.min(current.entry.size - current.gotLength, pending.length);
+            if (take > 0) {
+                current.got.push(pending.subarray(0, take));
+                current.gotLength += take;
+                pending = pending.subarray(take);
+            }
+            if (current.gotLength < current.entry.size)
+                return;
+            onBlob(current.entry, concat(current.got));
+            current = undefined;
+            awaitingNewline = true;
+        }
+    }
+    function finish() {
+        if (queue.length > 0 || current !== undefined || awaitingNewline)
+            throw new Error("cat-file ended before every blob arrived");
+    }
+    return { feed, finish };
+}
+//# sourceMappingURL=cat-file.js.map

package/dist/bundle/cat-file.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cat-file.js","sourceRoot":"","sources":["../../src/bundle/cat-file.ts"],"names":[],"mappings":"AAcA,MAAM,MAAM,GAAG,sCAAsC,CAAC;AACtD,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,OAAO,CAAC,CAAC;AAEtC,MAAM,MAAM,GAAG,CAAC,KAA4B,EAAc,EAAE;IAC1D,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC;IAChD,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;IACnC,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAClB,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC;IACpB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC,CAAC;AACF,MAAM,cAAc,GAAG,CAAC,KAAiB,EAAU,EAAE;IACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI;YAAE,OAAO,CAAC,CAAC;IACvE,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAC/B,QAAiC,EACjC,MAAwD;IAExD,MAAM,KAAK,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC;IAC5B,IAAI,OAAO,GAAe,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAC5C,IAAI,OAAkF,CAAC;IACvF,IAAI,eAAe,GAAG,KAAK,CAAC;IAC5B,IAAI,IAAI,GAAG,KAAK,CAAC;IAEjB,SAAS,IAAI,CAAC,KAAiB;QAC7B,IAAI,IAAI,EAAE,CAAC;YACT,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;YACnF,OAAO;QACT,CAAC;QACD,OAAO,GAAG,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC;QAClE,SAAS,CAAC;YACR,IAAI,eAAe,EAAE,CAAC;gBACpB,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;oBAAE,OAAO;gBACjC,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,IAAI;oBACrB,MAAM,IAAI,KAAK,CAAC,kDAAkD,CAAC,CAAC;gBACtE,OAAO,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAC9B,eAAe,GAAG,KAAK,CAAC;gBACxB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBACvB,IAAI,GAAG,IAAI,CAAC;oBACZ,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;wBAAE,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;oBACrF,OAAO;gBACT,CAAC;YACH,CAAC;YACD,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC1B,MAAM,OAAO,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;gBACxC,IAAI,OAAO,KAAK,CAAC,CAAC;oBAAE,OAAO;gBAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;gBACzD,OAAO,GAAG,OAAO,CAAC,QAAQ,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;gBACxC,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAClC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACtB,IAAI,KAAK,KAAK,IAAI,IAAI,IAAI,KAAK,SAAS;oBACtC,MAAM,IAAI,KAAK,CAAC,oDAAoD,CAAC,CAAC;gBACxE,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,SAAS;oBAAE,MAAM,IAAI,KAAK,CAAC,kBAAkB,IAAI,CAAC,IAAI,aAAa,CAAC,CAAC;gBACtF,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG;oBACvB,MAAM,IAAI,KAAK,CAAC,qBAAqB,KAAK,CAAC,CAAC,CAAC,UAAU,IAAI,CAAC,GAAG,eAAe,CAAC,CAAC;gBAClF,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,MAAM;oBACrB,MAAM,IAAI,KAAK,CAAC,kBAAkB,IAAI,CAAC,IAAI,SAAS,KAAK,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;gBAC9E,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI;oBACtC,MAAM,IAAI,KAAK,CACb,yBAAyB,KAAK,CAAC,CAAC,CAAC,IAAI,GAAG,QAAQ,IAAI,CAAC,IAAI,sBAAsB,IAAI,CAAC,IAAI,EAAE,CAC3F,CAAC;gBACJ,KAAK,CAAC,KAAK,EAAE,CAAC;gBACd,OAAO,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC;YACnD,CAAC;YACD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,GAAG,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;YAC9E,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;gBACb,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;gBAC5C,OAAO,CAAC,SAAS,IAAI,IAAI,CAAC;gBAC1B,OAAO,GAAG,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACnC,CAAC;YACD,IAAI,OAAO,CAAC,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI;gBAAE,OAAO;YACnD,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3C,OAAO,GAAG,SAAS,CAAC;YACpB,eAAe,GAAG,IAAI,CAAC;QACzB,CAAC;IACH,CAAC;IAED,SAAS,MAAM;QACb,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,KAAK,SAAS,IAAI,eAAe;YAC9D,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;IAChE,CAAC;IAED,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;AAC1B,CAAC","sourcesContent":["/** What one `cat-file --batch` answer must be: the blob asked for, at the size the listing gave. */\nexport interface ExpectedBlob {\n  sha: string;\n  size: number;\n  path: string;\n}\n\nexport interface BatchReader {\n  /** Feeds the next chunk of stdout; throws on the first byte that is not what the listing promised. */\n  feed(chunk: Uint8Array): void;\n  /** Called at the end of stdout; throws when a blob is still owed. */\n  finish(): void;\n}\n\nconst HEADER = /^([0-9a-f]{40,64}) (\\S+)(?: (\\d+))?$/;\nconst utf8 = new TextDecoder(\"utf-8\");\n\nconst concat = (parts: readonly Uint8Array[]): Uint8Array => {\n  let length = 0;\n  for (const part of parts) length += part.length;\n  const out = new Uint8Array(length);\n  let at = 0;\n  for (const part of parts) {\n    out.set(part, at);\n    at += part.length;\n  }\n  return out;\n};\nconst indexOfNewline = (bytes: Uint8Array): number => {\n  for (let i = 0; i < bytes.length; i++) if (bytes[i] === 0x0a) return i;\n  return -1;\n};\n\n/**\n * Reads `cat-file --batch` output for a known list of blobs, in order: `<sha> blob <size>\\n`, the raw bytes, a\n * newline. Each header is checked against the listing (the object, its type and its size) before a byte of\n * content is kept, so a header that lies is never buffered (bite 5 review m1). Blob bytes reach `onBlob` whole.\n */\nexport function createBatchReader(\n  expected: readonly ExpectedBlob[],\n  onBlob: (entry: ExpectedBlob, bytes: Uint8Array) => void,\n): BatchReader {\n  const queue = [...expected];\n  let pending: Uint8Array = new Uint8Array(0);\n  let current: { entry: ExpectedBlob; got: Uint8Array[]; gotLength: number } | undefined;\n  let awaitingNewline = false;\n  let done = false;\n\n  function feed(chunk: Uint8Array): void {\n    if (done) {\n      if (chunk.length > 0) throw new Error(\"cat-file printed more after the last blob\");\n      return;\n    }\n    pending = pending.length === 0 ? chunk : concat([pending, chunk]);\n    for (;;) {\n      if (awaitingNewline) {\n        if (pending.length === 0) return;\n        if (pending[0] !== 0x0a)\n          throw new Error(\"cat-file printed an unexpected byte after a blob\");\n        pending = pending.subarray(1);\n        awaitingNewline = false;\n        if (queue.length === 0) {\n          done = true;\n          if (pending.length > 0) throw new Error(\"cat-file printed more after the last blob\");\n          return;\n        }\n      }\n      if (current === undefined) {\n        const newline = indexOfNewline(pending);\n        if (newline === -1) return;\n        const header = utf8.decode(pending.subarray(0, newline));\n        pending = pending.subarray(newline + 1);\n        const match = HEADER.exec(header);\n        const next = queue[0];\n        if (match === null || next === undefined)\n          throw new Error(\"cat-file printed a header this reader cannot parse\");\n        if (match[2] === \"missing\") throw new Error(`the object for ${next.path} is missing`);\n        if (match[1] !== next.sha)\n          throw new Error(`cat-file answered ${match[1]} where ${next.sha} was expected`);\n        if (match[2] !== \"blob\")\n          throw new Error(`the object for ${next.path} is a ${match[2]}, not a blob`);\n        if (Number(match[3] ?? -1) !== next.size)\n          throw new Error(\n            `cat-file reports size ${match[3] ?? \"?\"} for ${next.path}, the listing said ${next.size}`,\n          );\n        queue.shift();\n        current = { entry: next, got: [], gotLength: 0 };\n      }\n      const take = Math.min(current.entry.size - current.gotLength, pending.length);\n      if (take > 0) {\n        current.got.push(pending.subarray(0, take));\n        current.gotLength += take;\n        pending = pending.subarray(take);\n      }\n      if (current.gotLength < current.entry.size) return;\n      onBlob(current.entry, concat(current.got));\n      current = undefined;\n      awaitingNewline = true;\n    }\n  }\n\n  function finish(): void {\n    if (queue.length > 0 || current !== undefined || awaitingNewline)\n      throw new Error(\"cat-file ended before every blob arrived\");\n  }\n\n  return { feed, finish };\n}\n"]}

package/dist/bundle/contract.js

@@ -0,0 +1,60 @@
+/** The company's admission rule. The development flag admits drafts, and so the unknown statuses read as draft. */
+export function admit(page, admitStatuses, dev) {
+    return admitStatuses.includes(page.status) || (dev && page.status === "draft");
+}
+/** Type values the company did not declare. Nothing is unknown when nothing is declared. */
+export function unknownTypes(pages, declared) {
+    if (declared === undefined || declared.length === 0)
+        return [];
+    const known = new Set(declared);
+    const unknown = new Set();
+    for (const page of pages)
+        if (!known.has(page.type))
+            unknown.add(page.type);
+    return [...unknown].sort();
+}
+/** A path with a dot-leading segment is hidden: skipped and counted, never a page or an attachment. */
+export function isHidden(path) {
+    return path.split("/").some((segment) => segment.startsWith("."));
+}
+/** The search engine's own configuration has no business inside a bundle; such a path is refused. */
+export function isEngineConfig(path) {
+    return path.split("/").some((segment) => segment === ".qmd");
+}
+/** Caps: one oversize file is refused on its own; too many files or too large a tree refuses the bundle. */
+export function capRefusals(files, caps) {
+    const perFile = [];
+    let total = 0;
+    for (const file of files) {
+        total += file.bytes.length;
+        if (file.bytes.length > caps.fileBytes) {
+            perFile.push({
+                path: file.path,
+                rule: "oversize",
+                detail: `${file.bytes.length} bytes exceeds the cap of ${caps.fileBytes}`,
+            });
+        }
+    }
+    if (files.length > caps.files) {
+        return {
+            fatal: {
+                path: "",
+                rule: "too-many-files",
+                detail: `${files.length} files exceeds the cap of ${caps.files}`,
+            },
+            perFile,
+        };
+    }
+    if (total > caps.treeBytes) {
+        return {
+            fatal: {
+                path: "",
+                rule: "tree-too-large",
+                detail: `${total} bytes exceeds the cap of ${caps.treeBytes}`,
+            },
+            perFile,
+        };
+    }
+    return { perFile };
+}
+//# sourceMappingURL=contract.js.map

package/dist/bundle/contract.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"contract.js","sourceRoot":"","sources":["../../src/bundle/contract.ts"],"names":[],"mappings":"AAEA,mHAAmH;AACnH,MAAM,UAAU,KAAK,CAAC,IAAU,EAAE,aAAuB,EAAE,GAAY;IACrE,OAAO,aAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,MAAM,KAAK,OAAO,CAAC,CAAC;AACjF,CAAC;AAED,4FAA4F;AAC5F,MAAM,UAAU,YAAY,CAAC,KAAa,EAAE,QAA8B;IACxE,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAC/D,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;IAChC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5E,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;AAC7B,CAAC;AAED,uGAAuG;AACvG,MAAM,UAAU,QAAQ,CAAC,IAAY;IACnC,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;AACpE,CAAC;AAED,qGAAqG;AACrG,MAAM,UAAU,cAAc,CAAC,IAAY;IACzC,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,KAAK,MAAM,CAAC,CAAC;AAC/D,CAAC;AAED,4GAA4G;AAC5G,MAAM,UAAU,WAAW,CACzB,KAAmB,EACnB,IAAU;IAEV,MAAM,OAAO,GAAc,EAAE,CAAC;IAC9B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAC3B,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YACvC,OAAO,CAAC,IAAI,CAAC;gBACX,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,IAAI,EAAE,UAAU;gBAChB,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,6BAA6B,IAAI,CAAC,SAAS,EAAE;aAC1E,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,OAAO;YACL,KAAK,EAAE;gBACL,IAAI,EAAE,EAAE;gBACR,IAAI,EAAE,gBAAgB;gBACtB,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,6BAA6B,IAAI,CAAC,KAAK,EAAE;aACjE;YACD,OAAO;SACR,CAAC;IACJ,CAAC;IACD,IAAI,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAC3B,OAAO;YACL,KAAK,EAAE;gBACL,IAAI,EAAE,EAAE;gBACR,IAAI,EAAE,gBAAgB;gBACtB,MAAM,EAAE,GAAG,KAAK,6BAA6B,IAAI,CAAC,SAAS,EAAE;aAC9D;YACD,OAAO;SACR,CAAC;IACJ,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,CAAC;AACrB,CAAC","sourcesContent":["import type { BundleFile, Caps, Page, Refusal, Status } from \"./model.js\";\n\n/** The company's admission rule. The development flag admits drafts, and so the unknown statuses read as draft. */\nexport function admit(page: Page, admitStatuses: Status[], dev: boolean): boolean {\n  return admitStatuses.includes(page.status) || (dev && page.status === \"draft\");\n}\n\n/** Type values the company did not declare. Nothing is unknown when nothing is declared. */\nexport function unknownTypes(pages: Page[], declared: string[] | undefined): string[] {\n  if (declared === undefined || declared.length === 0) return [];\n  const known = new Set(declared);\n  const unknown = new Set<string>();\n  for (const page of pages) if (!known.has(page.type)) unknown.add(page.type);\n  return [...unknown].sort();\n}\n\n/** A path with a dot-leading segment is hidden: skipped and counted, never a page or an attachment. */\nexport function isHidden(path: string): boolean {\n  return path.split(\"/\").some((segment) => segment.startsWith(\".\"));\n}\n\n/** The search engine's own configuration has no business inside a bundle; such a path is refused. */\nexport function isEngineConfig(path: string): boolean {\n  return path.split(\"/\").some((segment) => segment === \".qmd\");\n}\n\n/** Caps: one oversize file is refused on its own; too many files or too large a tree refuses the bundle. */\nexport function capRefusals(\n  files: BundleFile[],\n  caps: Caps,\n): { fatal?: Refusal; perFile: Refusal[] } {\n  const perFile: Refusal[] = [];\n  let total = 0;\n  for (const file of files) {\n    total += file.bytes.length;\n    if (file.bytes.length > caps.fileBytes) {\n      perFile.push({\n        path: file.path,\n        rule: \"oversize\",\n        detail: `${file.bytes.length} bytes exceeds the cap of ${caps.fileBytes}`,\n      });\n    }\n  }\n  if (files.length > caps.files) {\n    return {\n      fatal: {\n        path: \"\",\n        rule: \"too-many-files\",\n        detail: `${files.length} files exceeds the cap of ${caps.files}`,\n      },\n      perFile,\n    };\n  }\n  if (total > caps.treeBytes) {\n    return {\n      fatal: {\n        path: \"\",\n        rule: \"tree-too-large\",\n        detail: `${total} bytes exceeds the cap of ${caps.treeBytes}`,\n      },\n      perFile,\n    };\n  }\n  return { perFile };\n}\n"]}

package/dist/bundle/frontmatter.js

@@ -0,0 +1,106 @@
+import { isMap, isScalar, parseDocument } from "yaml";
+import { BOM } from "./paths.js";
+export function decodeUtf8(bytes) {
+    try {
+        return { ok: true, text: new TextDecoder("utf-8", { fatal: true }).decode(bytes) };
+    }
+    catch {
+        return { ok: false };
+    }
+}
+/**
+ * Splits a page into its frontmatter block and body. The block is present only when the text opens with
+ * a `---` line and a later line is exactly `---` or `...`; both fences may carry trailing spaces or tabs, as
+ * the OKF checkers accept. Fence lines and a trailing newline are dropped from the block; the body is
+ * everything after the closing fence as written.
+ */
+export function splitFrontmatter(text) {
+    const t = text.startsWith(BOM) ? text.slice(1) : text;
+    const opening = /^---[ \t]*\r?\n/.exec(t);
+    if (!opening)
+        return { body: t };
+    const start = opening[0].length;
+    let i = start;
+    for (;;) {
+        const nl = t.indexOf("\n", i);
+        const line = nl === -1 ? t.slice(i) : t.slice(i, nl);
+        const bare = line.replace(/[ \t\r]+$/, "");
+        if (bare === "---" || bare === "...") {
+            return {
+                block: t.slice(start, i).replace(/\r?\n$/, ""),
+                body: nl === -1 ? "" : t.slice(nl + 1),
+            };
+        }
+        if (nl === -1)
+            return { body: t, unclosed: true };
+        i = nl + 1;
+    }
+}
+/** A YAML diagnostic as a file position: the block starts on the line after the opening fence. */
+function describe(e, fenceLine, block) {
+    const pos = e.linePos?.[0];
+    const where = pos === undefined ? "" : ` at line ${pos.line + fenceLine}, column ${pos.col}`;
+    if (e.code === "DUPLICATE_KEY") {
+        // The parser's position covers one character of the repeated key; the key is the text before the colon on that line.
+        const line = pos === undefined ? undefined : block.split("\n")[pos.line - 1];
+        const key = line === undefined
+            ? ""
+            : (/^\s*(?:-\s*)?["']?([^"':]+?)["']?\s*:/.exec(line)?.[1] ?? "").trim();
+        return key.length === 0 ? `duplicate key${where}` : `duplicate key "${key}"${where}`;
+    }
+    const first = e.message
+        .split("\n")[0]
+        ?.replace(/\s+at line \d+, column \d+:?\s*$/, "")
+        .replace(/:\s*$/, "") ?? e.code;
+    return `${first}${where}`;
+}
+/**
+ * Parses a frontmatter block as YAML 1.2 with the core schema: dates stay strings, explicit tags are not
+ * resolved, duplicate keys are errors, and a cycle or a non-mapping is an error. `sources` keeps the text
+ * of each top-level scalar as written, so `type: 123` can still be read as "123". `fenceLine` is the file
+ * line of the opening fence, so diagnostics point at file lines.
+ */
+export function parseFrontmatter(block, fenceLine = 1) {
+    const doc = parseDocument(block, {
+        version: "1.2",
+        schema: "core",
+        uniqueKeys: true,
+        resolveKnownTags: false,
+        logLevel: "silent",
+    });
+    if (doc.errors.length > 0) {
+        return { ok: false, error: doc.errors.map((e) => describe(e, fenceLine, block)).join("; ") };
+    }
+    let data;
+    try {
+        data = doc.toJS({ maxAliasCount: 100 });
+    }
+    catch (error) {
+        return { ok: false, error: `frontmatter could not be read: ${error.message}` };
+    }
+    if (data === null || data === undefined)
+        data = {};
+    if (typeof data !== "object" || Array.isArray(data))
+        return { ok: false, error: "frontmatter is not a mapping" };
+    try {
+        JSON.stringify(data);
+    }
+    catch {
+        return { ok: false, error: "frontmatter contains a cycle" };
+    }
+    const sources = Object.create(null);
+    if (isMap(doc.contents)) {
+        for (const pair of doc.contents.items) {
+            if (isScalar(pair.key) && isScalar(pair.value) && typeof pair.value.source === "string") {
+                sources[String(pair.key.value)] = pair.value.source;
+            }
+        }
+    }
+    return {
+        ok: true,
+        data: data,
+        warnings: doc.warnings.map((w) => describe(w, fenceLine, block)),
+        sources,
+    };
+}
+//# sourceMappingURL=frontmatter.js.map

package/dist/bundle/frontmatter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"frontmatter.js","sourceRoot":"","sources":["../../src/bundle/frontmatter.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,MAAM,CAAC;AACtD,OAAO,EAAE,GAAG,EAAE,MAAM,YAAY,CAAC;AAEjC,MAAM,UAAU,UAAU,CAAC,KAAiB;IAC1C,IAAI,CAAC;QACH,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,WAAW,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;IACrF,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC;IACvB,CAAC;AACH,CAAC;AASD;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAY;IAC3C,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACtD,MAAM,OAAO,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1C,IAAI,CAAC,OAAO;QAAE,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;IACjC,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAChC,IAAI,CAAC,GAAG,KAAK,CAAC;IACd,SAAS,CAAC;QACR,MAAM,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC9B,MAAM,IAAI,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;QAC3C,IAAI,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,EAAE,CAAC;YACrC,OAAO;gBACL,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC;gBAC9C,IAAI,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC;aACvC,CAAC;QACJ,CAAC;QACD,IAAI,EAAE,KAAK,CAAC,CAAC;YAAE,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;QAClD,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACb,CAAC;AACH,CAAC;AAaD,kGAAkG;AAClG,SAAS,QAAQ,CAAC,CAAa,EAAE,SAAiB,EAAE,KAAa;IAC/D,MAAM,GAAG,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;IAC3B,MAAM,KAAK,GAAG,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,IAAI,GAAG,SAAS,YAAY,GAAG,CAAC,GAAG,EAAE,CAAC;IAC7F,IAAI,CAAC,CAAC,IAAI,KAAK,eAAe,EAAE,CAAC;QAC/B,qHAAqH;QACrH,MAAM,IAAI,GAAG,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QAC7E,MAAM,GAAG,GACP,IAAI,KAAK,SAAS;YAChB,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,CAAC,uCAAuC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QAC7E,OAAO,GAAG,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,gBAAgB,KAAK,EAAE,CAAC,CAAC,CAAC,kBAAkB,GAAG,IAAI,KAAK,EAAE,CAAC;IACvF,CAAC;IACD,MAAM,KAAK,GACT,CAAC,CAAC,OAAO;SACN,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACf,EAAE,OAAO,CAAC,kCAAkC,EAAE,EAAE,CAAC;SAChD,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC;IACpC,OAAO,GAAG,KAAK,GAAG,KAAK,EAAE,CAAC;AAC5B,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAa,EAAE,SAAS,GAAG,CAAC;IAC3D,MAAM,GAAG,GAAG,aAAa,CAAC,KAAK,EAAE;QAC/B,OAAO,EAAE,KAAK;QACd,MAAM,EAAE,MAAM;QACd,UAAU,EAAE,IAAI;QAChB,gBAAgB,EAAE,KAAK;QACvB,QAAQ,EAAE,QAAQ;KACnB,CAAC,CAAC;IACH,IAAI,GAAG,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1B,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;IAC/F,CAAC;IACD,IAAI,IAAa,CAAC;IAClB,IAAI,CAAC;QACH,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,EAAE,aAAa,EAAE,GAAG,EAAE,CAAC,CAAC;IAC1C,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,kCAAmC,KAAe,CAAC,OAAO,EAAE,EAAE,CAAC;IAC5F,CAAC;IACD,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,SAAS;QAAE,IAAI,GAAG,EAAE,CAAC;IACnD,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;QACjD,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,8BAA8B,EAAE,CAAC;IAC9D,IAAI,CAAC;QACH,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IACvB,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,8BAA8B,EAAE,CAAC;IAC9D,CAAC;IACD,MAAM,OAAO,GAA2B,MAAM,CAAC,MAAM,CAAC,IAAI,CAA2B,CAAC;IACtF,IAAI,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;QACxB,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;YACtC,IAAI,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;gBACxF,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;YACtD,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO;QACL,EAAE,EAAE,IAAI;QACR,IAAI,EAAE,IAA+B;QACrC,QAAQ,EAAE,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;QAChE,OAAO;KACR,CAAC;AACJ,CAAC","sourcesContent":["import { isMap, isScalar, parseDocument } from \"yaml\";\nimport { BOM } from \"./paths.js\";\n\nexport function decodeUtf8(bytes: Uint8Array): { ok: true; text: string } | { ok: false } {\n  try {\n    return { ok: true, text: new TextDecoder(\"utf-8\", { fatal: true }).decode(bytes) };\n  } catch {\n    return { ok: false };\n  }\n}\n\nexport interface Split {\n  block?: string;\n  body: string;\n  /** True when a fence opened the file and no line closed it. */\n  unclosed?: boolean;\n}\n\n/**\n * Splits a page into its frontmatter block and body. The block is present only when the text opens with\n * a `---` line and a later line is exactly `---` or `...`; both fences may carry trailing spaces or tabs, as\n * the OKF checkers accept. Fence lines and a trailing newline are dropped from the block; the body is\n * everything after the closing fence as written.\n */\nexport function splitFrontmatter(text: string): Split {\n  const t = text.startsWith(BOM) ? text.slice(1) : text;\n  const opening = /^---[ \\t]*\\r?\\n/.exec(t);\n  if (!opening) return { body: t };\n  const start = opening[0].length;\n  let i = start;\n  for (;;) {\n    const nl = t.indexOf(\"\\n\", i);\n    const line = nl === -1 ? t.slice(i) : t.slice(i, nl);\n    const bare = line.replace(/[ \\t\\r]+$/, \"\");\n    if (bare === \"---\" || bare === \"...\") {\n      return {\n        block: t.slice(start, i).replace(/\\r?\\n$/, \"\"),\n        body: nl === -1 ? \"\" : t.slice(nl + 1),\n      };\n    }\n    if (nl === -1) return { body: t, unclosed: true };\n    i = nl + 1;\n  }\n}\n\nexport type FrontmatterResult =\n  | { ok: true; data: Record<string, unknown>; warnings: string[]; sources: Record<string, string> }\n  | { ok: false; error: string };\n\ninterface Diagnostic {\n  code: string;\n  message: string;\n  linePos?: Array<{ line: number; col: number }>;\n  pos?: [number, number];\n}\n\n/** A YAML diagnostic as a file position: the block starts on the line after the opening fence. */\nfunction describe(e: Diagnostic, fenceLine: number, block: string): string {\n  const pos = e.linePos?.[0];\n  const where = pos === undefined ? \"\" : ` at line ${pos.line + fenceLine}, column ${pos.col}`;\n  if (e.code === \"DUPLICATE_KEY\") {\n    // The parser's position covers one character of the repeated key; the key is the text before the colon on that line.\n    const line = pos === undefined ? undefined : block.split(\"\\n\")[pos.line - 1];\n    const key =\n      line === undefined\n        ? \"\"\n        : (/^\\s*(?:-\\s*)?[\"']?([^\"':]+?)[\"']?\\s*:/.exec(line)?.[1] ?? \"\").trim();\n    return key.length === 0 ? `duplicate key${where}` : `duplicate key \"${key}\"${where}`;\n  }\n  const first =\n    e.message\n      .split(\"\\n\")[0]\n      ?.replace(/\\s+at line \\d+, column \\d+:?\\s*$/, \"\")\n      .replace(/:\\s*$/, \"\") ?? e.code;\n  return `${first}${where}`;\n}\n\n/**\n * Parses a frontmatter block as YAML 1.2 with the core schema: dates stay strings, explicit tags are not\n * resolved, duplicate keys are errors, and a cycle or a non-mapping is an error. `sources` keeps the text\n * of each top-level scalar as written, so `type: 123` can still be read as \"123\". `fenceLine` is the file\n * line of the opening fence, so diagnostics point at file lines.\n */\nexport function parseFrontmatter(block: string, fenceLine = 1): FrontmatterResult {\n  const doc = parseDocument(block, {\n    version: \"1.2\",\n    schema: \"core\",\n    uniqueKeys: true,\n    resolveKnownTags: false,\n    logLevel: \"silent\",\n  });\n  if (doc.errors.length > 0) {\n    return { ok: false, error: doc.errors.map((e) => describe(e, fenceLine, block)).join(\"; \") };\n  }\n  let data: unknown;\n  try {\n    data = doc.toJS({ maxAliasCount: 100 });\n  } catch (error) {\n    return { ok: false, error: `frontmatter could not be read: ${(error as Error).message}` };\n  }\n  if (data === null || data === undefined) data = {};\n  if (typeof data !== \"object\" || Array.isArray(data))\n    return { ok: false, error: \"frontmatter is not a mapping\" };\n  try {\n    JSON.stringify(data);\n  } catch {\n    return { ok: false, error: \"frontmatter contains a cycle\" };\n  }\n  const sources: Record<string, string> = Object.create(null) as Record<string, string>;\n  if (isMap(doc.contents)) {\n    for (const pair of doc.contents.items) {\n      if (isScalar(pair.key) && isScalar(pair.value) && typeof pair.value.source === \"string\") {\n        sources[String(pair.key.value)] = pair.value.source;\n      }\n    }\n  }\n  return {\n    ok: true,\n    data: data as Record<string, unknown>,\n    warnings: doc.warnings.map((w) => describe(w, fenceLine, block)),\n    sources,\n  };\n}\n"]}