link-cache 0.3.0

package/LICENSE

@@ -0,0 +1,201 @@
+                                 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/README.md

@@ -0,0 +1,86 @@
+# link-cache
+
+Zero-dependency helper CLIs for **cached** link checking with [Lychee][], for
+any static site that builds to a `public/` directory (Docsy, Hugo, and others).
+Two tools:
+
+- **`lychee-norm-cache`** — run lychee over your built `public/` output, then
+  normalize `.lycheecache` so reruns and commits stay byte stable.
+- **`refcache`** — inspect and prune that `.lycheecache` (the "refcache"): list
+  the oldest entries, prune a count or percentage, or print a summary.
+
+With a committed `lychee.toml` and `.lycheecache`, these give a site a
+self-contained, cached link-checking setup: fast reruns, and diffs that only
+change when links actually change.
+
+## Requirements
+
+- The [lychee][] binary on your `PATH`.
+- A `lychee.toml` at your site root (lychee's config and ignore rules).
+- A built site under `public/` (run your site build first).
+- [Node.js][] ≥ 24.
+- Optional: the [`gh`][gh] CLI — `lychee-norm-cache` bridges its token to lychee
+  to raise the github.com rate limit when `GITHUB_TOKEN` isn't already set.
+
+## Install
+
+```sh
+npm install --save-dev link-cache
+```
+
+Or, to install from GitHub rather than the npm registry:
+
+```sh
+npm install --save-dev github:chalin/link-cache#semver:^0.3.0
+```
+
+This puts both bins on your project's `PATH`.
+
+## Usage
+
+Wire the bins into your `package.json` scripts (bare names — `npm run` puts
+`node_modules/.bin` on the `PATH`):
+
+```json
+"scripts": {
+  "check:links": "lychee-norm-cache",
+  "refcache": "refcache"
+}
+```
+
+```sh
+npm run check:links          # check links, then sort/normalize the cache
+npm run refcache -- --summary # cache stats (count, oldest, status, ages)
+```
+
+> [!WARNING]
+>
+> Don't invoke these bins via `npx`: this package isn't on the npm registry, so
+> on a stale or missing `node_modules`, `npx` falls back to the public registry
+> and runs **whatever package holds the name there** (the `lychee-norm-cache`
+> name is squatted). Bare bin names in `npm run` scripts resolve locally or fail
+> loudly — they never touch the registry.
+
+`lychee-norm-cache` runs in the current directory (your site root) and forwards
+any extra arguments to lychee. Run either tool with `--help` for its full
+options, and `lychee --help` for the link-checking flags `lychee-norm-cache`
+forwards (e.g. `--offline`, `--max-cache-age 0`).
+
+## Development
+
+The published CLIs have **zero runtime dependencies**; Prettier is the only dev
+dependency. Run the checks (format + tests) with:
+
+```sh
+npm install
+npm run check
+```
+
+Tests use Node's built-in test runner (`node --test`) and need no network or the
+lychee binary.
+
+<!-- prettier-ignore-start -->
+[Lychee]: https://github.com/lycheeverse/lychee
+[Node.js]: https://nodejs.org/
+[gh]: https://cli.github.com/
+<!-- prettier-ignore-end -->

package/check/index.mjs

@@ -0,0 +1,130 @@
+#!/usr/bin/env node
+// The `lychee-norm-cache` bin: run lychee over a built site and normalize
+// .lycheecache for byte-stable reruns. Runs in the cwd (the site root), so any
+// site with a lychee.toml can reuse it. Run with `--help` for usage.
+//
+// When GITHUB_TOKEN is unset, a token is bridged from the gh CLI — lychee reads
+// GITHUB_TOKEN, which also lifts the github.com rate limit; CI sets it directly.
+
+import { spawnSync } from 'node:child_process';
+import {
+  existsSync,
+  readFileSync,
+  realpathSync,
+  statSync,
+  writeFileSync,
+} from 'node:fs';
+import path from 'node:path';
+import { fileURLToPath } from 'node:url';
+
+const INSTALL_HINT = 'https://github.com/lycheeverse/lychee#installation';
+
+const USAGE = `Usage: lychee-norm-cache [lychee args...]
+
+Run lychee over this site's built ./public output, then normalize .lycheecache
+so reruns stay byte stable. Bridges a GitHub token from the gh CLI when
+GITHUB_TOKEN isn't set; extra arguments pass through to lychee.
+
+  -h, --help   show this help
+
+Requires the lychee binary on your PATH and a lychee.toml at the site root.
+Run \`lychee --help\` for all link-checking options.`;
+
+// --- pure helpers (unit-tested) --------------------------------------------
+
+// Prefer an existing GITHUB_TOKEN; otherwise fall back to the gh CLI; '' if neither.
+export function resolveToken({ env = process.env, runGh = ghAuthToken } = {}) {
+  const fromEnv = (env.GITHUB_TOKEN ?? '').trim();
+  if (fromEnv) return fromEnv;
+  return (runGh() ?? '').trim();
+}
+
+// Sort .lycheecache by raw byte value (matching `LC_ALL=C sort`) and terminate
+// with a single newline, so lychee's nondeterministic cache writes diff cleanly.
+// Byte order via Buffer.compare — not JS string order, which compares UTF-16
+// code units and can diverge from LC_ALL=C on non-ASCII URLs.
+export function sortCacheText(text) {
+  const lines = text.split('\n');
+  if (lines.length && lines[lines.length - 1] === '') lines.pop();
+  if (lines.length === 0) return '';
+  lines.sort((a, b) => Buffer.compare(Buffer.from(a), Buffer.from(b)));
+  return lines.join('\n') + '\n';
+}
+
+// Return the site's public/ dir under the given cwd, or null if missing.
+// The path is kept lexical (symlinks unresolved): sites often symlink public/
+// to a separate diffable repo, and the /public/-anchored exclude_path patterns
+// in lychee.toml silently stop matching if the path handed to lychee no longer
+// contains the /public component.
+export function publicDirOf(cwd) {
+  const publicDir = path.join(cwd, 'public');
+  try {
+    if (!statSync(publicDir).isDirectory()) return null;
+  } catch {
+    return null;
+  }
+  return publicDir;
+}
+
+// --- lychee invocation -----------------------------------------------------
+
+function ghAuthToken() {
+  const r = spawnSync('gh', ['auth', 'token'], { encoding: 'utf8' });
+  return r.error || r.status !== 0 ? '' : (r.stdout ?? '').trim();
+}
+
+function hasLychee() {
+  return !spawnSync('lychee', ['--version'], { stdio: 'ignore' }).error;
+}
+
+function main(argv) {
+  if (argv.includes('-h') || argv.includes('--help')) {
+    console.log(USAGE);
+    return 0;
+  }
+
+  if (!hasLychee()) {
+    process.stderr.write(`[help] lychee not found. Install: ${INSTALL_HINT}\n`);
+    return 1;
+  }
+
+  const cwd = process.cwd();
+  const publicDir = publicDirOf(cwd);
+  if (!publicDir) {
+    process.stderr.write(
+      `[help] ${path.join(cwd, 'public')} not found. Build the site first.\n`,
+    );
+    return 1;
+  }
+
+  const token = resolveToken();
+  const status =
+    spawnSync(
+      'lychee',
+      ['--config', 'lychee.toml', '--root-dir', publicDir, ...argv, publicDir],
+      { stdio: 'inherit', env: { ...process.env, GITHUB_TOKEN: token } },
+    ).status ?? 1;
+
+  // Normalize the cache even on failure, so a partial run still leaves a stable
+  // .lycheecache.
+  const cachePath = path.join(cwd, '.lycheecache');
+  if (existsSync(cachePath)) {
+    writeFileSync(cachePath, sortCacheText(readFileSync(cachePath, 'utf8')));
+  }
+
+  return status;
+}
+
+// Real-path compare, not `file://${argv[1]}`: npm links bins as symlinks, so
+// argv[1] is the symlink while import.meta.url is the real path.
+function isEntryPoint() {
+  try {
+    return realpathSync(process.argv[1]) === fileURLToPath(import.meta.url);
+  } catch {
+    return false;
+  }
+}
+
+if (isEntryPoint()) {
+  process.exit(main(process.argv.slice(2)));
+}

package/package.json

@@ -0,0 +1,42 @@
+{
+  "name": "link-cache",
+  "version": "0.3.0",
+  "description": "Zero-dependency helper CLIs for cached Lychee link-checking: lychee-norm-cache (run + normalize .lycheecache) and refcache (inspect/prune the cache).",
+  "keywords": [
+    "lychee",
+    "link-checker",
+    "link-checking",
+    "cache",
+    "cli"
+  ],
+  "homepage": "https://github.com/chalin/link-cache#readme",
+  "bugs": "https://github.com/chalin/link-cache/issues",
+  "repository": "github:chalin/link-cache",
+  "license": "Apache-2.0",
+  "author": "Patrice Chalin",
+  "type": "module",
+  "bin": {
+    "lychee-norm-cache": "check/index.mjs",
+    "refcache": "refcache/index.mjs"
+  },
+  "files": [
+    "check/index.mjs",
+    "refcache/index.mjs"
+  ],
+  "scripts": {
+    "check": "npm run check:format && npm test",
+    "check:format": "prettier --check .",
+    "fix:format": "prettier --write .",
+    "test": "node --test"
+  },
+  "prettier": {
+    "proseWrap": "always",
+    "singleQuote": true
+  },
+  "devDependencies": {
+    "prettier": "^3.9.4"
+  },
+  "engines": {
+    "node": ">=24"
+  }
+}

package/refcache/index.mjs

@@ -0,0 +1,332 @@
+#!/usr/bin/env node
+// The `refcache` bin: inspect and prune a Lychee refcache. Read-only unless
+// `--prune` is given, and never hits the network. Run with `--help` for usage.
+//
+// Refcache line format: URL,STATUS,UNIX_TIMESTAMP — the URL is CSV-quoted when
+// it contains a comma, so STATUS and TIMESTAMP are read from the final two
+// fields.
+
+import { readFileSync, realpathSync, writeFileSync } from 'node:fs';
+import { fileURLToPath } from 'node:url';
+
+const DAY = 86400;
+const BUCKET_COUNT = 5;
+const DEFAULT_PATH = '.lycheecache';
+
+// --- parsing ---------------------------------------------------------------
+
+function parseLine(raw) {
+  const lastComma = raw.lastIndexOf(',');
+  if (lastComma < 0) return null;
+  const ts = Number(raw.slice(lastComma + 1));
+  const head = raw.slice(0, lastComma);
+  const statusComma = head.lastIndexOf(',');
+  if (statusComma < 0) return null;
+  const status = head.slice(statusComma + 1).trim();
+  const url = head.slice(0, statusComma);
+  if (!Number.isInteger(ts) || status === '') return null;
+  return { url, status, ts };
+}
+
+// Parse the whole file, keeping the original lines (so a prune can rewrite the
+// file with a minimal, still-sorted diff) and tagging each entry with its line
+// index.
+export function parseCache(text) {
+  const lines = text.split('\n');
+  const entries = [];
+  let malformed = 0;
+  lines.forEach((raw, index) => {
+    if (raw.trim() === '') return;
+    const parsed = parseLine(raw);
+    if (!parsed) {
+      malformed += 1;
+      return;
+    }
+    entries.push({ ...parsed, index });
+  });
+  return { lines, entries, malformed };
+}
+
+// --- selection / pruning ---------------------------------------------------
+
+export function selectOldest(entries, n) {
+  return [...entries]
+    .sort((a, b) => a.ts - b.ts || a.index - b.index)
+    .slice(0, Math.max(0, n));
+}
+
+export function resolvePruneCount(spec, total) {
+  const m = /^(\d+)(%?)$/.exec(String(spec));
+  if (!m) throw new Error(`--prune needs NUM or NUM%, got: ${spec}`);
+  const num = Number(m[1]);
+  const count = m[2] ? Math.floor((total * num) / 100) : num;
+  return Math.min(count, total);
+}
+
+// --- stats -----------------------------------------------------------------
+
+// Equal-width age histogram over 0..maxAge with an open-ended final bucket. The
+// width adapts to the data, so the split stays useful whether the cache spans a
+// couple of weeks or a year.
+function ageHistogram(ages, maxAgeDays) {
+  if (ages.length === 0) return [];
+  const width = Math.max(1, Math.ceil((maxAgeDays + 1) / BUCKET_COUNT));
+  const buckets = Array.from({ length: BUCKET_COUNT }, (_, i) => {
+    const lo = i * width;
+    const last = i === BUCKET_COUNT - 1;
+    return { label: last ? `≥${lo}d` : `${lo}–${lo + width}d`, count: 0 };
+  });
+  for (const age of ages) {
+    const i = Math.max(0, Math.min(BUCKET_COUNT - 1, Math.floor(age / width)));
+    buckets[i].count += 1;
+  }
+  return buckets;
+}
+
+export function computeStats(
+  entries,
+  { now = Date.now() / 1000, malformed = 0, pruned = 0 } = {},
+) {
+  const statusCounts = new Map();
+  const ages = [];
+  let oldestTs = null;
+  let newestTs = null;
+
+  for (const entry of entries) {
+    statusCounts.set(entry.status, (statusCounts.get(entry.status) ?? 0) + 1);
+    if (oldestTs === null || entry.ts < oldestTs) oldestTs = entry.ts;
+    if (newestTs === null || entry.ts > newestTs) newestTs = entry.ts;
+    ages.push(Math.floor((now - entry.ts) / DAY));
+  }
+
+  const byStatus = [...statusCounts.entries()].sort(
+    (a, b) => b[1] - a[1] || a[0].localeCompare(b[0]),
+  );
+
+  const at = (ts) =>
+    ts === null ? null : { ts, ageDays: Math.floor((now - ts) / DAY) };
+  const oldest = at(oldestTs);
+
+  return {
+    count: entries.length,
+    malformed,
+    pruned,
+    byStatus,
+    oldest,
+    newest: at(newestTs),
+    ageBuckets: ageHistogram(ages, oldest ? oldest.ageDays : 0),
+  };
+}
+
+// --- rendering -------------------------------------------------------------
+
+const pad2 = (n) => String(n).padStart(2, '0');
+
+// Local-time `YYYY-MM-DD HH:MM:SS ZONE` — entries minutes apart share a date, so
+// the time disambiguates them. Shown in the user's timezone (with a short zone
+// label) to save them the UTC math.
+const localStamp = (ts) => {
+  const d = new Date(ts * 1000);
+  const date = `${d.getFullYear()}-${pad2(d.getMonth() + 1)}-${pad2(d.getDate())}`;
+  const time = `${pad2(d.getHours())}:${pad2(d.getMinutes())}:${pad2(d.getSeconds())}`;
+  const zone = new Intl.DateTimeFormat('en-US', { timeZoneName: 'short' })
+    .formatToParts(d)
+    .find((p) => p.type === 'timeZoneName')?.value;
+  return zone ? `${date} ${time} ${zone}` : `${date} ${time}`;
+};
+
+const displayUrl = (url) =>
+  url.startsWith('"') && url.endsWith('"')
+    ? url.slice(1, -1).replace(/""/g, '"')
+    : url;
+
+export function formatList(entries, n, { now = Date.now() / 1000 } = {}) {
+  const chosen = selectOldest(entries, n);
+  const head = `${chosen.length} oldest ${chosen.length === 1 ? 'entry' : 'entries'}:`;
+  const rows = chosen.map((e) => {
+    const ageDays = Math.floor((now - e.ts) / DAY);
+    return `  ${localStamp(e.ts)}  ${String(ageDays).padStart(4)}d  ${e.status}  ${displayUrl(e.url)}`;
+  });
+  return [head, ...rows].join('\n');
+}
+
+export function formatStats(stats, { now = Date.now() / 1000, path } = {}) {
+  const lines = [];
+  lines.push(`Lychee refcache${path ? `: ${path}` : ''}`);
+  lines.push(`  Entries: ${stats.count}`);
+  if (stats.pruned) {
+    const before = stats.count + stats.pruned;
+    lines.push(`  Pruned:  ${stats.pruned} (${before} → ${stats.count})`);
+  }
+  if (stats.malformed) lines.push(`  Malformed lines: ${stats.malformed}`);
+
+  if (stats.oldest && stats.newest) {
+    lines.push(
+      `  Oldest:  ${localStamp(stats.oldest.ts)} (${stats.oldest.ageDays} days ago)`,
+    );
+    lines.push(
+      `  Newest:  ${localStamp(stats.newest.ts)} (${stats.newest.ageDays} days ago)`,
+    );
+  }
+
+  lines.push('  Status:');
+  for (const [status, n] of stats.byStatus) {
+    lines.push(`    ${status.padEnd(5)} ${n}`);
+  }
+
+  if (stats.ageBuckets.length) {
+    lines.push('  Age:');
+    const w = Math.max(...stats.ageBuckets.map((b) => b.label.length));
+    for (const { label, count } of stats.ageBuckets) {
+      lines.push(`    ${label.padEnd(w)}  ${count}`);
+    }
+  }
+
+  return lines.join('\n');
+}
+
+// --- ordered execution -----------------------------------------------------
+
+// Run the parsed ops in order over the evolving cache. Pure: returns the text to
+// print and the lines to write (null when nothing was pruned); no I/O.
+export function runOps(parsed, ops, { now = Date.now() / 1000, path } = {}) {
+  const removed = new Set();
+  let pruned = 0;
+  const out = [];
+  const current = () => parsed.entries.filter((e) => !removed.has(e.index));
+
+  for (const op of ops) {
+    if (op.kind === 'list') {
+      out.push(formatList(current(), Number(op.value), { now }));
+    } else if (op.kind === 'prune') {
+      const cur = current();
+      const k = resolvePruneCount(op.value, cur.length);
+      for (const victim of selectOldest(cur, k)) removed.add(victim.index);
+      pruned += k;
+      out.push(
+        `Pruned ${k} oldest ${k === 1 ? 'entry' : 'entries'} (${cur.length} → ${cur.length - k}).`,
+      );
+    } else if (op.kind === 'summary') {
+      const stats = computeStats(current(), {
+        now,
+        malformed: parsed.malformed,
+        pruned,
+      });
+      out.push(formatStats(stats, { now, path }));
+    }
+  }
+
+  const writeLines =
+    pruned > 0 ? parsed.lines.filter((_, i) => !removed.has(i)) : null;
+  return { output: out.join('\n\n'), writeLines, pruned };
+}
+
+// --- CLI -------------------------------------------------------------------
+
+const FLAGS = new Map([
+  ['-l', 'list'],
+  ['--list', 'list'],
+  ['-p', 'prune'],
+  ['--prune', 'prune'],
+  ['-s', 'summary'],
+  ['--summary', 'summary'],
+]);
+
+export function parseArgs(argv) {
+  const ops = [];
+  const seen = new Set();
+  let path = null;
+  let help = false;
+
+  for (let i = 0; i < argv.length; i++) {
+    const a = argv[i];
+    if (a === '-h' || a === '--help') {
+      help = true;
+      continue;
+    }
+    const kind = FLAGS.get(a);
+    if (kind) {
+      if (seen.has(kind)) throw new Error(`repeated flag: ${a}`);
+      seen.add(kind);
+      if (kind === 'summary') {
+        ops.push({ kind });
+        continue;
+      }
+      const value = argv[++i];
+      if (value === undefined) throw new Error(`${a} requires a value`);
+      if (kind === 'list' && !/^\d+$/.test(value)) {
+        throw new Error(`--list needs a count, got: ${value}`);
+      }
+      if (kind === 'prune' && !/^\d+%?$/.test(value)) {
+        throw new Error(`--prune needs NUM or NUM%, got: ${value}`);
+      }
+      ops.push({ kind, value });
+      continue;
+    }
+    if (a.startsWith('-')) throw new Error(`unknown flag: ${a}`);
+    if (path !== null) throw new Error(`unexpected extra argument: ${a}`);
+    path = a;
+  }
+
+  return { ops, path: path ?? DEFAULT_PATH, help };
+}
+
+const USAGE = `Usage: refcache [REFCACHE_FILE] [options]
+
+Inspect and prune a Lychee refcache (default: ${DEFAULT_PATH}). Options run in
+the order given, over the evolving cache, so \`-l 5 -p 5\` lists the 5 oldest
+about to be pruned, while \`-p 5 -l 5\` lists the next 5 after pruning.
+
+  -l, --list NUM        list the NUM oldest entries
+  -p, --prune NUM[%]    drop the NUM (or NUM%) oldest entries, then rewrite
+  -s, --summary         print a summary (counts, ages, status, histogram)
+  -h, --help            show this help
+
+With no options, prints the summary. A flag may not be repeated.`;
+
+function main(argv) {
+  let args;
+  try {
+    args = parseArgs(argv);
+  } catch (err) {
+    console.error(`[error] ${err.message}\n`);
+    console.error(USAGE);
+    process.exit(2);
+  }
+  if (args.help) {
+    console.log(USAGE);
+    return;
+  }
+
+  let text;
+  try {
+    text = readFileSync(args.path, 'utf8');
+  } catch {
+    console.error(`[error] cannot read refcache file: ${args.path}`);
+    process.exit(1);
+  }
+
+  const now = Date.now() / 1000;
+  const ops = args.ops.length ? args.ops : [{ kind: 'summary' }];
+  const { output, writeLines } = runOps(parseCache(text), ops, {
+    now,
+    path: args.path,
+  });
+
+  if (output) console.log(output);
+  if (writeLines) writeFileSync(args.path, writeLines.join('\n'));
+}
+
+// Real-path compare, not `file://${argv[1]}`: npm links bins as symlinks, so
+// argv[1] is the symlink while import.meta.url is the real path.
+function isEntryPoint() {
+  try {
+    return realpathSync(process.argv[1]) === fileURLToPath(import.meta.url);
+  } catch {
+    return false;
+  }
+}
+
+if (isEntryPoint()) {
+  main(process.argv.slice(2));
+}