@descent-vtt/spec-brief 0.1.0 → 0.2.1

package/dist/scaffold.js.map

@@ -1 +1 @@
-{"version":3,"file":"scaffold.js","sourceRoot":"","sources":["../src/scaffold.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAChD,OAAO,EAAE,YAAY,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAWlD;;;;GAIG;AACH,MAAM,UAAU,MAAM,CAAC,MAAc;IACnC,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAgB,EAAE,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC;IACrF,MAAM,OAAO,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACjE,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IACxD,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;IACjE,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AAC7D,CAAC;AAED,MAAM,UAAU,WAAW,CAAC,MAAc,EAAE,EAAU,EAAE,KAAa;IACnE,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;IAC5B,IAAI,MAAM,CAAC,EAAE,CAAC,MAAM,KAAK,aAAa;QAAE,OAAO,GAAG,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC;IAC/E,OAAO,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,SAAS,GAAG,IAAI,KAAK,CAAC;AAC5E,CAAC;AAED,MAAM,KAAK,GAAqC;IAC9C,MAAM,EAAE,mFAAmF;IAC3F,gBAAgB,EAAE,gEAAgE;IAClF,eAAe,EAAE,4DAA4D;IAC7E,UAAU,EAAE,8EAA8E;IAC1F,qBAAqB,EAAE,oEAAoE;IAC3F,sBAAsB,EAAE,iEAAiE;CAC1F,CAAC;AAEF,SAAS,IAAI,CAAC,IAAiB;IAC7B,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,IAAI,aAAa,IAAI,CAAC,IAAI,GAAG,CAAC;AACrE,CAAC;AAED,SAAS,WAAW,CAAC,MAAc,EAAE,KAAe;IAClD,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;IACtB,IAAI,MAAM,CAAC,EAAE,CAAC,MAAM,KAAK,aAAa;QAAE,KAAK,CAAC,IAAI,CAAC,OAAO,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IACpF,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;QACjC,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,KAAK,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACrG,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IAClC,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,SAAS,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC9E,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IAChE,IAAI,KAAK,CAAC,SAAS,KAAK,SAAS,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAChE,KAAK,CAAC,IAAI,CAAC,eAAe,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACzF,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,mBAAmB,EAAE,oBAAoB,EAAE,KAAK,CAAC,CAAC;IAC7D,OAAO,KAAK,CAAC;AACf,CAAC;AAED,sFAAsF;AACtF,MAAM,UAAU,cAAc,CAAC,MAAc,EAAE,KAAe,EAAE,QAAuB;IACrF,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;QACtB,OAAO,YAAY,CAAC,QAAQ,EAAE;YAC5B,EAAE,EAAE,KAAK,CAAC,EAAE;YACZ,KAAK,EAAE,KAAK,CAAC,KAAK;YAClB,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,EAAE;YACtB,IAAI,EAAE,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC;YACxD,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM;SACpD,CAAC,CAAC;IACL,CAAC;IACD,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;IAC/E,MAAM,KAAK,GAAG,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,EAAE,EAAE,KAAK,KAAK,CAAC,EAAE,WAAW,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;IACzF,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,MAAM,CAAC,QAAQ,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;QAClD,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,IAAI,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,QAAQ,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChE,qEAAqE;QACrE,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC;QAChG,IAAI,IAAI,CAAC,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,0BAA0B,CAAC,CAAC;IACjE,CAAC;IACD,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;AACjC,CAAC","sourcesContent":["/**\n * Writing a new brief: the next free id, a file name, and a body with every\n * section the configuration requires, each holding a hint in a comment.\n * Comments are not content, so a freshly scaffolded brief reads as unwritten\n * until somebody writes it.\n */\n\nimport type { Config, SectionRule } from './config.js';\nimport type { Corpus } from './corpus.js';\nimport { renderScalar } from './frontmatter.js';\nimport { fillTemplate, slugify } from './text.js';\n\nexport interface NewBrief {\n  readonly id: string;\n  readonly title: string;\n  readonly date: string;\n  readonly type?: string | undefined;\n  readonly wave?: number | undefined;\n  readonly dependsOn?: readonly string[] | undefined;\n}\n\n/**\n * The next id: one more than the highest numeric id, live or archived, at the\n * configured width. Ids are never reused, so an archived brief still holds\n * its number. `null` when the corpus has ids but none of them are numbers.\n */\nexport function nextId(corpus: Corpus): string | null {\n  const ids = corpus.briefs.map((b) => b.id).filter((id): id is string => id !== null);\n  const numeric = ids.filter((id) => /^\\d+$/.test(id)).map(Number);\n  if (numeric.length === 0 && ids.length > 0) return null;\n  const next = numeric.length === 0 ? 1 : Math.max(...numeric) + 1;\n  return String(next).padStart(corpus.config.id.digits, '0');\n}\n\nexport function fileNameFor(config: Config, id: string, title: string): string {\n  const slug = slugify(title);\n  if (config.id.source === 'frontmatter') return `${slug === '' ? id : slug}.md`;\n  return slug === '' ? `${id}.md` : `${id}${config.id.separator}${slug}.md`;\n}\n\nconst HINTS: Readonly<Record<string, string>> = {\n  intent: 'The state of the tree when this round is done, and why it matters. One paragraph.',\n  'negative scope': 'What this round must not do, even where it would look helpful.',\n  'not empowered': 'Files, interfaces and decisions this round may not change.',\n  invariants: 'Checks that must hold before the round is called done, each one a task item.',\n  'acceptance criteria': 'What a reviewer checks to accept the result, each one a task item.',\n  'the defect, measured': 'How to reproduce the defect, and the measurement that shows it.',\n};\n\nfunction hint(rule: SectionRule): string {\n  return HINTS[rule.name.toLowerCase()] ?? `Write the ${rule.name}.`;\n}\n\nfunction frontMatter(config: Config, brief: NewBrief): string[] {\n  const lines = ['---'];\n  if (config.id.source === 'frontmatter') lines.push(`id: ${renderScalar(brief.id)}`);\n  if (config.status.field !== null) {\n    lines.push(`${config.status.field}: ${renderScalar(config.status.draft ?? config.status.active)}`);\n  }\n  lines.push(`date: ${brief.date}`);\n  if (brief.type !== undefined) lines.push(`type: ${renderScalar(brief.type)}`);\n  if (brief.wave !== undefined) lines.push(`wave: ${brief.wave}`);\n  if (brief.dependsOn !== undefined && brief.dependsOn.length > 0) {\n    lines.push(`dependsOn: [${brief.dependsOn.map((d) => JSON.stringify(d)).join(', ')}]`);\n  }\n  lines.push('affectedFiles: []', 'protectedFiles: []', '---');\n  return lines;\n}\n\n/** The text of a new brief, from the configured template or from the section list. */\nexport function renderNewBrief(config: Config, brief: NewBrief, template: string | null): string {\n  if (template !== null) {\n    return fillTemplate(template, {\n      id: brief.id,\n      title: brief.title,\n      date: brief.date,\n      type: brief.type ?? '',\n      wave: brief.wave === undefined ? '' : String(brief.wave),\n      status: config.status.draft ?? config.status.active,\n    });\n  }\n  const typed = brief.type === undefined ? [] : (config.types[brief.type] ?? []);\n  const lines = [...frontMatter(config, brief), '', `# ${brief.id} \\u2014 ${brief.title}`];\n  for (const rule of [...config.sections, ...typed]) {\n    lines.push('', `## ${rule.name}`, '', `<!-- ${hint(rule)} -->`);\n    // Text a section must contain is written in, so it is not forgotten.\n    if (rule.mustContain.length > 0) lines.push('', ...rule.mustContain.map((text) => `- ${text}`));\n    if (rule.checklist) lines.push('', '- [ ] <!-- one check -->');\n  }\n  return `${lines.join('\\n')}\\n`;\n}\n"]}
+{"version":3,"file":"scaffold.js","sourceRoot":"","sources":["../src/scaffold.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAe,cAAc,EAAoB,MAAM,aAAa,CAAC;AAE5E,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAChD,OAAO,EAAE,YAAY,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAWlD;;;;GAIG;AACH,MAAM,UAAU,MAAM,CAAC,MAAc;IACnC,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAgB,EAAE,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC;IACrF,MAAM,OAAO,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACjE,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IACxD,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;IACjE,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AAC7D,CAAC;AAED,MAAM,UAAU,WAAW,CAAC,MAAc,EAAE,EAAU,EAAE,KAAa;IACnE,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;IAC5B,IAAI,MAAM,CAAC,EAAE,CAAC,MAAM,KAAK,aAAa;QAAE,OAAO,GAAG,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC;IAC/E,OAAO,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,SAAS,GAAG,IAAI,KAAK,CAAC;AAC5E,CAAC;AAED,MAAM,aAAa,GAA2B,CAAC,GAAG,cAAc,CAAC,QAAQ,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;AAE1H;;;;;GAKG;AACH,SAAS,IAAI,CAAC,IAAiB;IAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,IAAI,IAAI,aAAa,IAAI,CAAC,IAAI,GAAG,CAAC;IACzI,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;AACxC,CAAC;AAED,SAAS,WAAW,CAAC,MAAc,EAAE,KAAe;IAClD,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;IACtB,IAAI,MAAM,CAAC,EAAE,CAAC,MAAM,KAAK,aAAa;QAAE,KAAK,CAAC,IAAI,CAAC,OAAO,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IACpF,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;QACjC,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,KAAK,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACrG,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IAClC,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,SAAS,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC9E,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS;QAAE,KAAK,CAAC,IAAI,CAAC,SAAS,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IAChE,IAAI,KAAK,CAAC,SAAS,KAAK,SAAS,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAChE,KAAK,CAAC,IAAI,CAAC,eAAe,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACzF,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,mBAAmB,EAAE,oBAAoB,EAAE,KAAK,CAAC,CAAC;IAC7D,OAAO,KAAK,CAAC;AACf,CAAC;AAED,sFAAsF;AACtF,MAAM,UAAU,cAAc,CAAC,MAAc,EAAE,KAAe,EAAE,QAAuB;IACrF,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;QACtB,OAAO,YAAY,CAAC,QAAQ,EAAE;YAC5B,EAAE,EAAE,KAAK,CAAC,EAAE;YACZ,KAAK,EAAE,KAAK,CAAC,KAAK;YAClB,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,EAAE;YACtB,IAAI,EAAE,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC;YACxD,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM;SACpD,CAAC,CAAC;IACL,CAAC;IACD,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;IAC/E,MAAM,KAAK,GAAG,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,EAAE,EAAE,KAAK,KAAK,CAAC,EAAE,WAAW,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;IACzF,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,MAAM,CAAC,QAAQ,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;QAClD,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,IAAI,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,QAAQ,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChE,qEAAqE;QACrE,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC;QAChG,IAAI,IAAI,CAAC,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,0BAA0B,CAAC,CAAC;IACjE,CAAC;IACD,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;AACjC,CAAC","sourcesContent":["/**\n * Writing a new brief: the next free id, a file name, and a body with every\n * section the configuration requires, each holding a hint in a comment.\n * Comments are not content, so a freshly scaffolded brief reads as unwritten\n * until somebody writes it.\n */\n\nimport { type Config, DEFAULT_CONFIG, type SectionRule } from './config.js';\nimport type { Corpus } from './corpus.js';\nimport { renderScalar } from './frontmatter.js';\nimport { fillTemplate, slugify } from './text.js';\n\nexport interface NewBrief {\n  readonly id: string;\n  readonly title: string;\n  readonly date: string;\n  readonly type?: string | undefined;\n  readonly wave?: number | undefined;\n  readonly dependsOn?: readonly string[] | undefined;\n}\n\n/**\n * The next id: one more than the highest numeric id, live or archived, at the\n * configured width. Ids are never reused, so an archived brief still holds\n * its number. `null` when the corpus has ids but none of them are numbers.\n */\nexport function nextId(corpus: Corpus): string | null {\n  const ids = corpus.briefs.map((b) => b.id).filter((id): id is string => id !== null);\n  const numeric = ids.filter((id) => /^\\d+$/.test(id)).map(Number);\n  if (numeric.length === 0 && ids.length > 0) return null;\n  const next = numeric.length === 0 ? 1 : Math.max(...numeric) + 1;\n  return String(next).padStart(corpus.config.id.digits, '0');\n}\n\nexport function fileNameFor(config: Config, id: string, title: string): string {\n  const slug = slugify(title);\n  if (config.id.source === 'frontmatter') return `${slug === '' ? id : slug}.md`;\n  return slug === '' ? `${id}.md` : `${id}${config.id.separator}${slug}.md`;\n}\n\nconst DEFAULT_RULES: readonly SectionRule[] = [...DEFAULT_CONFIG.sections, ...Object.values(DEFAULT_CONFIG.types).flat()];\n\n/**\n * What a new brief says under a heading: the section's configured hint, or the\n * default section's of the same name - a configuration written before hints\n * existed names its sections without one - or a plain instruction. A \"-->\"\n * would end the comment early and leave the rest as content, so it is broken.\n */\nfunction hint(rule: SectionRule): string {\n  const text = rule.hint ?? DEFAULT_RULES.find((d) => d.name.toLowerCase() === rule.name.toLowerCase())?.hint ?? `Write the ${rule.name}.`;\n  return text.replaceAll('-->', '-- >');\n}\n\nfunction frontMatter(config: Config, brief: NewBrief): string[] {\n  const lines = ['---'];\n  if (config.id.source === 'frontmatter') lines.push(`id: ${renderScalar(brief.id)}`);\n  if (config.status.field !== null) {\n    lines.push(`${config.status.field}: ${renderScalar(config.status.draft ?? config.status.active)}`);\n  }\n  lines.push(`date: ${brief.date}`);\n  if (brief.type !== undefined) lines.push(`type: ${renderScalar(brief.type)}`);\n  if (brief.wave !== undefined) lines.push(`wave: ${brief.wave}`);\n  if (brief.dependsOn !== undefined && brief.dependsOn.length > 0) {\n    lines.push(`dependsOn: [${brief.dependsOn.map((d) => JSON.stringify(d)).join(', ')}]`);\n  }\n  lines.push('affectedFiles: []', 'protectedFiles: []', '---');\n  return lines;\n}\n\n/** The text of a new brief, from the configured template or from the section list. */\nexport function renderNewBrief(config: Config, brief: NewBrief, template: string | null): string {\n  if (template !== null) {\n    return fillTemplate(template, {\n      id: brief.id,\n      title: brief.title,\n      date: brief.date,\n      type: brief.type ?? '',\n      wave: brief.wave === undefined ? '' : String(brief.wave),\n      status: config.status.draft ?? config.status.active,\n    });\n  }\n  const typed = brief.type === undefined ? [] : (config.types[brief.type] ?? []);\n  const lines = [...frontMatter(config, brief), '', `# ${brief.id} \\u2014 ${brief.title}`];\n  for (const rule of [...config.sections, ...typed]) {\n    lines.push('', `## ${rule.name}`, '', `<!-- ${hint(rule)} -->`);\n    // Text a section must contain is written in, so it is not forgotten.\n    if (rule.mustContain.length > 0) lines.push('', ...rule.mustContain.map((text) => `- ${text}`));\n    if (rule.checklist) lines.push('', '- [ ] <!-- one check -->');\n  }\n  return `${lines.join('\\n')}\\n`;\n}\n"]}

package/dist/schedule.d.ts

@@ -0,0 +1,133 @@
+/**
+ * Waves, computed: which live briefs can run side by side, so that no two in
+ * one wave can write the same file and every brief runs after the briefs it
+ * depends on.
+ *
+ * Deciding what the rounds of a goal are is prose, and an agent's work. Given
+ * the rounds, placing them is not: it is precedence-constrained colouring, and
+ * a tool answers it the same way every time (ADR-0011). Briefs are taken in
+ * dependency order, ties broken by id, and each goes into the lowest wave that
+ * is after every live dependency's and holds nothing it collides with. A brief
+ * with no scope cannot be proved apart from anything, so it shares its wave
+ * with nobody. The greedy answer is not always the fewest waves - no fast
+ * method promises that - but it is always a valid one, and the same one.
+ *
+ * Nothing is written here. `planWaves` says what `--write` would write, and
+ * the engine writes it as the archive writes, as one transaction.
+ */
+import type { FileOp } from './archive.js';
+import { type Brief } from './brief.js';
+import { type Corpus } from './corpus.js';
+import { type Overlap } from './scope.js';
+import type { Finding } from './types.js';
+export interface ScheduleOptions {
+    /** The files the tree holds, which say whether a literal path is a file or a directory. */
+    readonly repoFiles?: readonly string[] | null;
+    /** How many states one witness search may visit before it answers `undecided`. */
+    readonly budget?: number;
+}
+/** A wave a brief could not join, and the brief already there that kept it out. */
+export type Passed = {
+    readonly wave: number;
+    readonly reason: 'collision';
+    readonly brief: Brief;
+    readonly overlaps: readonly Overlap[];
+} | {
+    readonly wave: number;
+    readonly reason: 'undecided';
+    readonly brief: Brief;
+    readonly patterns: readonly (readonly [string, string])[];
+}
+/** One of the two declares no affectedFiles, and an unscoped brief runs alone. */
+ | {
+    readonly wave: number;
+    readonly reason: 'unscoped';
+    readonly brief: Brief;
+};
+/**
+ * Why a declared wave does not hold: what `matrix` or `lint` would report as
+ * an error if the brief ran there.
+ */
+export type Breach = 
+/** A brief the matrix compares, declaring the same wave, whose scope meets this one's. Overlaps name this brief's pattern first. */
+{
+    readonly reason: 'collision';
+    readonly brief: Brief;
+    readonly overlaps: readonly Overlap[];
+}
+/** A live dependency declaring the same wave or a later one. */
+ | {
+    readonly reason: 'dependency';
+    readonly brief: Brief;
+    readonly wave: number;
+}
+/** A live brief depending on this one, declaring the same wave or an earlier one. */
+ | {
+    readonly reason: 'dependent';
+    readonly brief: Brief;
+    readonly wave: number;
+};
+export interface Placement {
+    readonly brief: Brief;
+    /** The wave its front matter declares; `null` when it declares none it can read. */
+    readonly declared: number | null;
+    readonly proposed: number;
+    /** The live dependency in the latest wave, which sets the earliest wave this one may run in. */
+    readonly after: {
+        readonly brief: Brief;
+        readonly wave: number;
+    } | null;
+    /** Every wave from that earliest one that it could not join, in order. Overlaps and patterns name its own pattern first. */
+    readonly passed: readonly Passed[];
+    /** Declares no affectedFiles, so it shares its wave with nobody. */
+    readonly unscoped: boolean;
+    /**
+     * Why the declared wave does not hold, when it is not the proposed one. Empty
+     * when it holds - a person moved the brief, and `lint` and `matrix` accept
+     * the wave - and when there is no declared wave to judge.
+     */
+    readonly breaches: readonly Breach[];
+}
+/** A live brief that can be placed in no wave, and the dependency that holds it. */
+export interface Unplaced {
+    readonly brief: Brief;
+    readonly waitsOn: Brief;
+    /** The dependency is deferred, is in a dependency cycle, or is itself unplaced. */
+    readonly because: 'deferred' | 'cycle' | 'unplaced';
+}
+export interface Schedule {
+    /** The first wave: the lowest any scheduled brief declares, or 1 when none declares one. */
+    readonly first: number;
+    /** In the order they were placed: dependency order, ties by id. */
+    readonly placements: readonly Placement[];
+    /** By id. */
+    readonly unplaced: readonly Unplaced[];
+    /** Dependency cycles among the scheduled briefs, each as a path back to its start. */
+    readonly cycles: readonly (readonly Brief[])[];
+    /** Deferred briefs, which wait for their trigger and run in no wave. By id. */
+    readonly deferred: readonly Brief[];
+}
+export { byId } from './corpus.js';
+export declare function schedule(corpus: Corpus, options?: ScheduleOptions): Schedule;
+/** The briefs whose declared wave the schedule would change. */
+export declare function moves(s: Schedule): Placement[];
+/**
+ * Whether a brief's declared wave holds: it is the proposed one, or one a
+ * person chose that `lint` and `matrix` accept. The schedule is one valid
+ * answer, not the only one (ADR-0011, amended).
+ */
+export declare function holds(p: Placement): boolean;
+/** Why a declared wave does not hold, a clause each. */
+export declare function breachReasons(p: Placement): string[];
+/** Why a brief is in its wave and not an earlier one, a clause each. */
+export declare function reasons(p: Placement): string[];
+/** The schedule as findings: cycles, briefs whose waves would move, briefs that run alone, and pairs it could not decide. */
+export declare function scheduleFindings(corpus: Corpus, s: Schedule): Finding[];
+export interface WavePlan {
+    /** A write of each brief whose wave changes: its front matter's `wave`, and every other line as it was. */
+    readonly ops: readonly FileOp[];
+    /** Briefs whose wave cannot be written, which refuse the whole write. */
+    readonly refused: readonly Finding[];
+}
+/** What `--write` writes. */
+export declare function planWaves(s: Schedule): WavePlan;

package/dist/schedule.js

@@ -0,0 +1,265 @@
+/**
+ * Waves, computed: which live briefs can run side by side, so that no two in
+ * one wave can write the same file and every brief runs after the briefs it
+ * depends on.
+ *
+ * Deciding what the rounds of a goal are is prose, and an agent's work. Given
+ * the rounds, placing them is not: it is precedence-constrained colouring, and
+ * a tool answers it the same way every time (ADR-0011). Briefs are taken in
+ * dependency order, ties broken by id, and each goes into the lowest wave that
+ * is after every live dependency's and holds nothing it collides with. A brief
+ * with no scope cannot be proved apart from anything, so it shares its wave
+ * with nobody. The greedy answer is not always the fewest waves - no fast
+ * method promises that - but it is always a valid one, and the same one.
+ *
+ * Nothing is written here. `planWaves` says what `--write` would write, and
+ * the engine writes it as the archive writes, as one transaction.
+ */
+import { lineOfField } from './brief.js';
+import { undecidedFinding, unscopedFinding } from './collisions.js';
+import { byId, dependencyCycles, liveDependencies, waitingOnDeferred } from './corpus.js';
+import { editable, setEntryKeepingComment } from './frontmatter.js';
+import { readingIn, WITNESS_BUDGET } from './glob.js';
+import { configuredSeverity } from './lint.js';
+import { meet, scopeOf } from './scope.js';
+import { encodeLike } from './text.js';
+function label(brief) {
+    return brief.id ?? brief.name;
+}
+export { byId } from './corpus.js';
+/** The first brief in a wave this one cannot share it with, or `null` when it can join. */
+function clash(own, wave, here, budget) {
+    for (const other of here) {
+        if (own.affected.length === 0 || other.affected.length === 0)
+            return { wave, reason: 'unscoped', brief: other.brief };
+        const meeting = meet(own, other, budget);
+        if (meeting.overlaps.length > 0)
+            return { wave, reason: 'collision', brief: other.brief, overlaps: meeting.overlaps };
+        if (meeting.undecided.length > 0)
+            return { wave, reason: 'undecided', brief: other.brief, patterns: meeting.undecided };
+    }
+    return null;
+}
+/**
+ * Why a brief's declared wave does not hold, judged as `lint` and `matrix`
+ * judge it: against the waves the other briefs declare, not the ones proposed.
+ * Collisions are with the briefs the matrix compares; the dependency order is
+ * wave-order's, both ways, over every live brief.
+ */
+function breachesOf(brief, wave, judge) {
+    const out = [];
+    for (const dependency of judge.dependencies.get(brief)) {
+        if (dependency.wave !== null && dependency.wave >= wave)
+            out.push({ reason: 'dependency', brief: dependency, wave: dependency.wave });
+    }
+    for (const other of judge.dependents.get(brief) ?? []) {
+        if (other.wave !== null && other.wave <= wave)
+            out.push({ reason: 'dependent', brief: other, wave: other.wave });
+    }
+    for (const other of judge.compared) {
+        if (other === brief || other.wave !== wave)
+            continue;
+        const overlaps = meet(judge.scope(brief), judge.scope(other), judge.budget).overlaps;
+        if (overlaps.length > 0)
+            out.push({ reason: 'collision', brief: other, overlaps });
+    }
+    return out;
+}
+export function schedule(corpus, options = {}) {
+    const reading = readingIn(options.repoFiles ?? null);
+    const budget = options.budget ?? WITNESS_BUDGET;
+    const deferred = corpus.live.filter((b) => b.status === 'deferred').sort(byId);
+    const briefs = corpus.live.filter((b) => b.status !== 'deferred').sort(byId);
+    const dependencies = new Map(briefs.map((b) => [b, liveDependencies(corpus, b)]));
+    const declared = briefs.flatMap((b) => (b.wave === null ? [] : [b.wave]));
+    const first = declared.length === 0 ? 1 : Math.min(...declared);
+    const scopes = new Map();
+    const scope = (b) => {
+        const known = scopes.get(b) ?? scopeOf(b, reading);
+        scopes.set(b, known);
+        return known;
+    };
+    const waiting = new Set(waitingOnDeferred(corpus).map((w) => w.brief));
+    // Deferred briefs too: lint's wave-order reads every live brief's wave.
+    const everyDependency = new Map(corpus.live.map((b) => [b, liveDependencies(corpus, b)]));
+    const dependents = new Map();
+    for (const b of [...corpus.live].sort(byId)) {
+        for (const d of everyDependency.get(b))
+            dependents.set(d, [...(dependents.get(d) ?? []), b]);
+    }
+    const judge = { compared: briefs.filter((b) => !waiting.has(b)), dependencies: everyDependency, dependents, scope, budget };
+    const waveOf = new Map();
+    const occupants = new Map();
+    const placements = [];
+    const pending = [...briefs];
+    // Kahn's order, taking the least id whose dependencies are all placed. A
+    // brief waiting on a deferred one, or on a cycle, is never taken.
+    for (;;) {
+        const next = pending.find((b) => dependencies.get(b).every((d) => waveOf.has(d)));
+        if (next === undefined)
+            break;
+        pending.splice(pending.indexOf(next), 1);
+        let after = null;
+        for (const dependency of dependencies.get(next)) {
+            const wave = waveOf.get(dependency);
+            if (after === null || wave > after.wave)
+                after = { brief: dependency, wave };
+        }
+        const own = scope(next);
+        const passed = [];
+        let wave = after === null ? first : after.wave + 1;
+        // Ends by construction: a wave past every occupied one is empty, and an empty wave takes anyone.
+        for (;;) {
+            const found = clash(own, wave, occupants.get(wave) ?? [], budget);
+            if (found === null)
+                break;
+            passed.push(found);
+            wave += 1;
+        }
+        waveOf.set(next, wave);
+        occupants.set(wave, [...(occupants.get(wave) ?? []), own]);
+        const breaches = next.wave === null || next.wave === wave ? [] : breachesOf(next, next.wave, judge);
+        placements.push({ brief: next, declared: next.wave, proposed: wave, after, passed, unscoped: own.affected.length === 0, breaches });
+    }
+    const cycles = dependencyCycles(corpus).filter((cycle) => cycle.every((b) => b.status !== 'deferred'));
+    const inCycle = new Set(cycles.flat());
+    const unplaced = pending.map((brief) => {
+        const waitsOn = dependencies.get(brief).find((d) => !waveOf.has(d));
+        const because = waitsOn.status === 'deferred' ? 'deferred' : inCycle.has(waitsOn) ? 'cycle' : 'unplaced';
+        return { brief, waitsOn, because };
+    });
+    return { first, placements, unplaced, cycles, deferred };
+}
+/** The briefs whose declared wave the schedule would change. */
+export function moves(s) {
+    return s.placements.filter((p) => p.proposed !== p.declared);
+}
+/**
+ * Whether a brief's declared wave holds: it is the proposed one, or one a
+ * person chose that `lint` and `matrix` accept. The schedule is one valid
+ * answer, not the only one (ADR-0011, amended).
+ */
+export function holds(p) {
+    return p.declared !== null && p.breaches.length === 0;
+}
+/** Why a declared wave does not hold, a clause each. */
+export function breachReasons(p) {
+    return p.breaches.map((b) => {
+        if (b.reason === 'collision')
+            return `${label(b.brief)} there also writes ${b.overlaps[0].witness}`;
+        if (b.reason === 'dependency')
+            return `it depends on ${label(b.brief)}, in wave ${b.wave}`;
+        return `${label(b.brief)} depends on it, in wave ${b.wave}`;
+    });
+}
+/** Why a brief is in its wave and not an earlier one, a clause each. */
+export function reasons(p) {
+    const out = [];
+    if (p.after !== null)
+        out.push(`after ${label(p.after.brief)}, in wave ${p.after.wave}`);
+    if (p.unscoped && p.passed.length > 0)
+        out.push('it declares no affectedFiles, so it runs in a wave of its own');
+    for (const passed of p.passed) {
+        const there = `not wave ${passed.wave}, where ${label(passed.brief)}`;
+        if (passed.reason === 'collision') {
+            const [overlap] = passed.overlaps;
+            out.push(`${there} also writes ${overlap.witness} ("${overlap.patterns[0]}" and "${overlap.patterns[1]}")`);
+        }
+        else if (passed.reason === 'undecided') {
+            out.push(`${there} may write the same files: the search could not decide within its budget`);
+        }
+        else if (!p.unscoped) {
+            out.push(`${there} declares no affectedFiles and runs alone`);
+        }
+    }
+    if (out.length === 0)
+        out.push('nothing holds it later');
+    return out;
+}
+/** The schedule as findings: cycles, briefs whose waves would move, briefs that run alone, and pairs it could not decide. */
+export function scheduleFindings(corpus, s) {
+    const findings = [];
+    const cycle = configuredSeverity(corpus, 'dependency-cycle');
+    if (cycle !== null) {
+        for (const members of s.cycles) {
+            const start = members[0];
+            findings.push({
+                rule: 'dependency-cycle',
+                severity: cycle,
+                message: `dependencies form a cycle, so no wave can hold them: ${members.map(label).join(' -> ')}`,
+                file: start.file,
+                line: lineOfField(start, 'dependsOn') + 1,
+                brief: start.id ?? undefined,
+                hint: 'a cycle can never become ready; remove the dependency that is not real',
+            });
+        }
+    }
+    const change = configuredSeverity(corpus, 'wave-schedule');
+    if (change !== null) {
+        // A wave a person chose that lint and matrix accept is theirs to keep: a
+        // note, so that CI passes it. One missing, or one that does not hold, is
+        // the rule's finding at its configured severity.
+        for (const p of moves(s)) {
+            const valid = holds(p);
+            const was = p.declared === null
+                ? 'declares no wave'
+                : valid
+                    ? `declares wave ${p.declared}, which holds`
+                    : `declares wave ${p.declared}, which does not hold (${breachReasons(p).join('; ')})`;
+            findings.push({
+                rule: 'wave-schedule',
+                severity: valid ? 'note' : change,
+                message: `${was}; the schedule puts it in wave ${p.proposed}: ${reasons(p).join('; ')}`,
+                file: p.brief.file,
+                line: lineOfField(p.brief, 'wave') + 1,
+                brief: p.brief.id ?? undefined,
+                hint: valid
+                    ? `keep wave ${p.declared}, or run "spec-brief schedule --write" for wave ${p.proposed}`
+                    : `run "spec-brief schedule --write", or set "wave: ${p.proposed}"`,
+            });
+        }
+    }
+    const unscoped = configuredSeverity(corpus, 'unscoped');
+    if (unscoped !== null && s.placements.length > 1) {
+        for (const p of s.placements.filter((x) => x.unscoped)) {
+            findings.push(unscopedFinding(unscoped, p.brief, `the ${s.placements.length - 1} other brief(s) the schedule places; it runs alone in wave ${p.proposed}`));
+        }
+    }
+    const undecided = configuredSeverity(corpus, 'collision-undecided');
+    if (undecided !== null) {
+        for (const p of s.placements) {
+            for (const passed of p.passed) {
+                if (passed.reason !== 'undecided')
+                    continue;
+                const theirsFirst = passed.patterns.map(([own, theirs]) => [theirs, own]);
+                findings.push(undecidedFinding(undecided, passed.brief, p.brief, theirsFirst, passed.wave));
+            }
+        }
+    }
+    return findings;
+}
+/** What `--write` writes. */
+export function planWaves(s) {
+    const ops = [];
+    const refused = [];
+    for (const p of moves(s)) {
+        const { brief } = p;
+        if (brief.frontMatter !== null && !editable(brief.frontMatter)) {
+            const open = brief.frontMatter.close < 0;
+            refused.push({
+                rule: 'front-matter',
+                severity: 'error',
+                message: `the front matter is ${open ? 'never closed' : 'TOML'}, so wave ${p.proposed} cannot be written into it`,
+                file: brief.file,
+                line: 1,
+                brief: brief.id ?? undefined,
+                hint: open ? 'close the front matter with a "---" line, and schedule again' : 'write the front matter as YAML between "---" lines, and schedule again',
+            });
+            continue;
+        }
+        const lines = setEntryKeepingComment(brief.lines, brief.frontMatter, 'wave', String(p.proposed));
+        ops.push({ kind: 'write', path: brief.file, content: encodeLike(brief.source, lines), before: brief.source });
+    }
+    return { ops, refused };
+}
+//# sourceMappingURL=schedule.js.map

package/dist/schedule.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"schedule.js","sourceRoot":"","sources":["../src/schedule.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAGH,OAAO,EAAc,WAAW,EAAE,MAAM,YAAY,CAAC;AACrD,OAAO,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AACpE,OAAO,EAAE,IAAI,EAAe,gBAAgB,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AACvG,OAAO,EAAE,QAAQ,EAAE,sBAAsB,EAAE,MAAM,kBAAkB,CAAC;AACpE,OAAO,EAAE,SAAS,EAAE,cAAc,EAAE,MAAM,WAAW,CAAC;AACtD,OAAO,EAAE,kBAAkB,EAAE,MAAM,WAAW,CAAC;AAC/C,OAAO,EAAE,IAAI,EAA4B,OAAO,EAAE,MAAM,YAAY,CAAC;AACrE,OAAO,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAqEvC,SAAS,KAAK,CAAC,KAAY;IACzB,OAAO,KAAK,CAAC,EAAE,IAAI,KAAK,CAAC,IAAI,CAAC;AAChC,CAAC;AAED,OAAO,EAAE,IAAI,EAAE,MAAM,aAAa,CAAC;AAEnC,2FAA2F;AAC3F,SAAS,KAAK,CAAC,GAAU,EAAE,IAAY,EAAE,IAAsB,EAAE,MAAc;IAC7E,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;QACzB,IAAI,GAAG,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC;QACtH,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;QACzC,IAAI,OAAO,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,CAAC;QACtH,IAAI,OAAO,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,CAAC,SAAS,EAAE,CAAC;IAC1H,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAaD;;;;;GAKG;AACH,SAAS,UAAU,CAAC,KAAY,EAAE,IAAY,EAAE,KAAY;IAC1D,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,UAAU,IAAI,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAY,EAAE,CAAC;QAClE,IAAI,UAAU,CAAC,IAAI,KAAK,IAAI,IAAI,UAAU,CAAC,IAAI,IAAI,IAAI;YAAE,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC;IACxI,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;QACtD,IAAI,KAAK,CAAC,IAAI,KAAK,IAAI,IAAI,KAAK,CAAC,IAAI,IAAI,IAAI;YAAE,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IACnH,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;QACnC,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,IAAI;YAAE,SAAS;QACrD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC;QACrF,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC;IACrF,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,UAAU,QAAQ,CAAC,MAAc,EAAE,OAAO,GAAoB,EAAE;IACpE,MAAM,OAAO,GAAG,SAAS,CAAC,OAAO,CAAC,SAAS,IAAI,IAAI,CAAC,CAAC;IACrD,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,cAAc,CAAC;IAChD,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/E,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7E,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,gBAAgB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClF,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1E,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC;IAChE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAgB,CAAC;IACvC,MAAM,KAAK,GAAG,CAAC,CAAQ,EAAS,EAAE;QAChC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;QACnD,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACrB,OAAO,KAAK,CAAC;IACf,CAAC,CAAC;IACF,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACvE,wEAAwE;IACxE,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,gBAAgB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1F,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC7C,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QAC5C,KAAK,MAAM,CAAC,IAAI,eAAe,CAAC,GAAG,CAAC,CAAC,CAAY;YAAE,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC1G,CAAC;IACD,MAAM,KAAK,GAAU,EAAE,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,eAAe,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IAEnI,MAAM,MAAM,GAAG,IAAI,GAAG,EAAiB,CAAC;IACxC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC7C,MAAM,UAAU,GAAgB,EAAE,CAAC;IACnC,MAAM,OAAO,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;IAC5B,yEAAyE;IACzE,kEAAkE;IAClE,SAAS,CAAC;QACR,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAE,YAAY,CAAC,GAAG,CAAC,CAAC,CAAa,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/F,IAAI,IAAI,KAAK,SAAS;YAAE,MAAM;QAC9B,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QACzC,IAAI,KAAK,GAAuB,IAAI,CAAC;QACrC,KAAK,MAAM,UAAU,IAAI,YAAY,CAAC,GAAG,CAAC,IAAI,CAAY,EAAE,CAAC;YAC3D,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,UAAU,CAAW,CAAC;YAC9C,IAAI,KAAK,KAAK,IAAI,IAAI,IAAI,GAAG,KAAK,CAAC,IAAI;gBAAE,KAAK,GAAG,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;QAC/E,CAAC;QACD,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QACxB,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,IAAI,IAAI,GAAG,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC;QACnD,iGAAiG;QACjG,SAAS,CAAC;YACR,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,MAAM,CAAC,CAAC;YAClE,IAAI,KAAK,KAAK,IAAI;gBAAE,MAAM;YAC1B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,IAAI,IAAI,CAAC,CAAC;QACZ,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACvB,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3D,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACpG,UAAU,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC;IACtI,CAAC;IAED,MAAM,MAAM,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC,CAAC;IACvG,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;IACvC,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAY,EAAE;QAC/C,MAAM,OAAO,GAAI,YAAY,CAAC,GAAG,CAAC,KAAK,CAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAU,CAAC;QAC1F,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC;QACzG,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC;IACrC,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;AAC3D,CAAC;AAED,gEAAgE;AAChE,MAAM,UAAU,KAAK,CAAC,CAAW;IAC/B,OAAO,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;AAC/D,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,KAAK,CAAC,CAAY;IAChC,OAAO,CAAC,CAAC,QAAQ,KAAK,IAAI,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC;AACxD,CAAC;AAED,wDAAwD;AACxD,MAAM,UAAU,aAAa,CAAC,CAAY;IACxC,OAAO,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAC1B,IAAI,CAAC,CAAC,MAAM,KAAK,WAAW;YAAE,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,sBAAuB,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAa,CAAC,OAAO,EAAE,CAAC;QACjH,IAAI,CAAC,CAAC,MAAM,KAAK,YAAY;YAAE,OAAO,iBAAiB,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,IAAI,EAAE,CAAC;QAC3F,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,2BAA2B,CAAC,CAAC,IAAI,EAAE,CAAC;IAC9D,CAAC,CAAC,CAAC;AACL,CAAC;AAED,wEAAwE;AACxE,MAAM,UAAU,OAAO,CAAC,CAAY;IAClC,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,IAAI,CAAC,CAAC,KAAK,KAAK,IAAI;QAAE,GAAG,CAAC,IAAI,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IACzF,IAAI,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;QAAE,GAAG,CAAC,IAAI,CAAC,+DAA+D,CAAC,CAAC;IACjH,KAAK,MAAM,MAAM,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,YAAY,MAAM,CAAC,IAAI,WAAW,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;QACtE,IAAI,MAAM,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;YAClC,MAAM,CAAC,OAAO,CAAC,GAAG,MAAM,CAAC,QAAqB,CAAC;YAC/C,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,gBAAgB,OAAO,CAAC,OAAO,MAAM,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,UAAU,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC9G,CAAC;aAAM,IAAI,MAAM,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;YACzC,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,0EAA0E,CAAC,CAAC;QAC/F,CAAC;aAAM,IAAI,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;YACvB,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,2CAA2C,CAAC,CAAC;QAChE,CAAC;IACH,CAAC;IACD,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;QAAE,GAAG,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC;IACzD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,6HAA6H;AAC7H,MAAM,UAAU,gBAAgB,CAAC,MAAc,EAAE,CAAW;IAC1D,MAAM,QAAQ,GAAc,EAAE,CAAC;IAC/B,MAAM,KAAK,GAAG,kBAAkB,CAAC,MAAM,EAAE,kBAAkB,CAAC,CAAC;IAC7D,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QACnB,KAAK,MAAM,OAAO,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;YAC/B,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAU,CAAC;YAClC,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,kBAAkB;gBACxB,QAAQ,EAAE,KAAK;gBACf,OAAO,EAAE,wDAAwD,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;gBAClG,IAAI,EAAE,KAAK,CAAC,IAAI;gBAChB,IAAI,EAAE,WAAW,CAAC,KAAK,EAAE,WAAW,CAAC,GAAG,CAAC;gBACzC,KAAK,EAAE,KAAK,CAAC,EAAE,IAAI,SAAS;gBAC5B,IAAI,EAAE,wEAAwE;aAC/E,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,MAAM,MAAM,GAAG,kBAAkB,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;IAC3D,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;QACpB,yEAAyE;QACzE,yEAAyE;QACzE,iDAAiD;QACjD,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;YACzB,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,GAAG,GACP,CAAC,CAAC,QAAQ,KAAK,IAAI;gBACjB,CAAC,CAAC,kBAAkB;gBACpB,CAAC,CAAC,KAAK;oBACL,CAAC,CAAC,iBAAiB,CAAC,CAAC,QAAQ,eAAe;oBAC5C,CAAC,CAAC,iBAAiB,CAAC,CAAC,QAAQ,0BAA0B,aAAa,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;YAC5F,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,eAAe;gBACrB,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM;gBACjC,OAAO,EAAE,GAAG,GAAG,kCAAkC,CAAC,CAAC,QAAQ,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;gBACvF,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI;gBAClB,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC;gBACtC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,IAAI,SAAS;gBAC9B,IAAI,EAAE,KAAK;oBACT,CAAC,CAAC,aAAa,CAAC,CAAC,QAAkB,mDAAmD,CAAC,CAAC,QAAQ,EAAE;oBAClG,CAAC,CAAC,oDAAoD,CAAC,CAAC,QAAQ,GAAG;aACtE,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,MAAM,QAAQ,GAAG,kBAAkB,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IACxD,IAAI,QAAQ,KAAK,IAAI,IAAI,CAAC,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACjD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;YACvD,QAAQ,CAAC,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,CAAC,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,8DAA8D,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC9J,CAAC;IACH,CAAC;IACD,MAAM,SAAS,GAAG,kBAAkB,CAAC,MAAM,EAAE,qBAAqB,CAAC,CAAC;IACpE,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,UAAU,EAAE,CAAC;YAC7B,KAAK,MAAM,MAAM,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;gBAC9B,IAAI,MAAM,CAAC,MAAM,KAAK,WAAW;oBAAE,SAAS;gBAC5C,MAAM,WAAW,GAAG,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,GAAG,CAAU,CAAC,CAAC;gBACnF,QAAQ,CAAC,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,WAAW,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YAC9F,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AASD,6BAA6B;AAC7B,MAAM,UAAU,SAAS,CAAC,CAAW;IACnC,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,OAAO,GAAc,EAAE,CAAC;IAC9B,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;QACzB,MAAM,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;QACpB,IAAI,KAAK,CAAC,WAAW,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,WAAW,CAAC,EAAE,CAAC;YAC/D,MAAM,IAAI,GAAG,KAAK,CAAC,WAAW,CAAC,KAAK,GAAG,CAAC,CAAC;YACzC,OAAO,CAAC,IAAI,CAAC;gBACX,IAAI,EAAE,cAAc;gBACpB,QAAQ,EAAE,OAAO;gBACjB,OAAO,EAAE,uBAAuB,IAAI,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,MAAM,aAAa,CAAC,CAAC,QAAQ,4BAA4B;gBACjH,IAAI,EAAE,KAAK,CAAC,IAAI;gBAChB,IAAI,EAAE,CAAC;gBACP,KAAK,EAAE,KAAK,CAAC,EAAE,IAAI,SAAS;gBAC5B,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,8DAA8D,CAAC,CAAC,CAAC,wEAAwE;aACvJ,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QACD,MAAM,KAAK,GAAG,sBAAsB,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,WAAW,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QACjG,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,OAAO,EAAE,UAAU,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IAChH,CAAC;IACD,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC;AAC1B,CAAC","sourcesContent":["/**\n * Waves, computed: which live briefs can run side by side, so that no two in\n * one wave can write the same file and every brief runs after the briefs it\n * depends on.\n *\n * Deciding what the rounds of a goal are is prose, and an agent's work. Given\n * the rounds, placing them is not: it is precedence-constrained colouring, and\n * a tool answers it the same way every time (ADR-0011). Briefs are taken in\n * dependency order, ties broken by id, and each goes into the lowest wave that\n * is after every live dependency's and holds nothing it collides with. A brief\n * with no scope cannot be proved apart from anything, so it shares its wave\n * with nobody. The greedy answer is not always the fewest waves - no fast\n * method promises that - but it is always a valid one, and the same one.\n *\n * Nothing is written here. `planWaves` says what `--write` would write, and\n * the engine writes it as the archive writes, as one transaction.\n */\n\nimport type { FileOp } from './archive.js';\nimport { type Brief, lineOfField } from './brief.js';\nimport { undecidedFinding, unscopedFinding } from './collisions.js';\nimport { byId, type Corpus, dependencyCycles, liveDependencies, waitingOnDeferred } from './corpus.js';\nimport { editable, setEntryKeepingComment } from './frontmatter.js';\nimport { readingIn, WITNESS_BUDGET } from './glob.js';\nimport { configuredSeverity } from './lint.js';\nimport { meet, type Overlap, type Scope, scopeOf } from './scope.js';\nimport { encodeLike } from './text.js';\nimport type { Finding } from './types.js';\n\nexport interface ScheduleOptions {\n  /** The files the tree holds, which say whether a literal path is a file or a directory. */\n  readonly repoFiles?: readonly string[] | null;\n  /** How many states one witness search may visit before it answers `undecided`. */\n  readonly budget?: number;\n}\n\n/** A wave a brief could not join, and the brief already there that kept it out. */\nexport type Passed =\n  | { readonly wave: number; readonly reason: 'collision'; readonly brief: Brief; readonly overlaps: readonly Overlap[] }\n  | { readonly wave: number; readonly reason: 'undecided'; readonly brief: Brief; readonly patterns: readonly (readonly [string, string])[] }\n  /** One of the two declares no affectedFiles, and an unscoped brief runs alone. */\n  | { readonly wave: number; readonly reason: 'unscoped'; readonly brief: Brief };\n\n/**\n * Why a declared wave does not hold: what `matrix` or `lint` would report as\n * an error if the brief ran there.\n */\nexport type Breach =\n  /** A brief the matrix compares, declaring the same wave, whose scope meets this one's. Overlaps name this brief's pattern first. */\n  | { readonly reason: 'collision'; readonly brief: Brief; readonly overlaps: readonly Overlap[] }\n  /** A live dependency declaring the same wave or a later one. */\n  | { readonly reason: 'dependency'; readonly brief: Brief; readonly wave: number }\n  /** A live brief depending on this one, declaring the same wave or an earlier one. */\n  | { readonly reason: 'dependent'; readonly brief: Brief; readonly wave: number };\n\nexport interface Placement {\n  readonly brief: Brief;\n  /** The wave its front matter declares; `null` when it declares none it can read. */\n  readonly declared: number | null;\n  readonly proposed: number;\n  /** The live dependency in the latest wave, which sets the earliest wave this one may run in. */\n  readonly after: { readonly brief: Brief; readonly wave: number } | null;\n  /** Every wave from that earliest one that it could not join, in order. Overlaps and patterns name its own pattern first. */\n  readonly passed: readonly Passed[];\n  /** Declares no affectedFiles, so it shares its wave with nobody. */\n  readonly unscoped: boolean;\n  /**\n   * Why the declared wave does not hold, when it is not the proposed one. Empty\n   * when it holds - a person moved the brief, and `lint` and `matrix` accept\n   * the wave - and when there is no declared wave to judge.\n   */\n  readonly breaches: readonly Breach[];\n}\n\n/** A live brief that can be placed in no wave, and the dependency that holds it. */\nexport interface Unplaced {\n  readonly brief: Brief;\n  readonly waitsOn: Brief;\n  /** The dependency is deferred, is in a dependency cycle, or is itself unplaced. */\n  readonly because: 'deferred' | 'cycle' | 'unplaced';\n}\n\nexport interface Schedule {\n  /** The first wave: the lowest any scheduled brief declares, or 1 when none declares one. */\n  readonly first: number;\n  /** In the order they were placed: dependency order, ties by id. */\n  readonly placements: readonly Placement[];\n  /** By id. */\n  readonly unplaced: readonly Unplaced[];\n  /** Dependency cycles among the scheduled briefs, each as a path back to its start. */\n  readonly cycles: readonly (readonly Brief[])[];\n  /** Deferred briefs, which wait for their trigger and run in no wave. By id. */\n  readonly deferred: readonly Brief[];\n}\n\nfunction label(brief: Brief): string {\n  return brief.id ?? brief.name;\n}\n\nexport { byId } from './corpus.js';\n\n/** The first brief in a wave this one cannot share it with, or `null` when it can join. */\nfunction clash(own: Scope, wave: number, here: readonly Scope[], budget: number): Passed | null {\n  for (const other of here) {\n    if (own.affected.length === 0 || other.affected.length === 0) return { wave, reason: 'unscoped', brief: other.brief };\n    const meeting = meet(own, other, budget);\n    if (meeting.overlaps.length > 0) return { wave, reason: 'collision', brief: other.brief, overlaps: meeting.overlaps };\n    if (meeting.undecided.length > 0) return { wave, reason: 'undecided', brief: other.brief, patterns: meeting.undecided };\n  }\n  return null;\n}\n\n/** What a declared wave is judged against. */\ninterface Judge {\n  /** The briefs the matrix compares: none deferred, none waiting on deferred work. */\n  readonly compared: readonly Brief[];\n  /** Every live brief's live dependencies, and the live briefs that depend on each, by id. */\n  readonly dependencies: ReadonlyMap<Brief, readonly Brief[]>;\n  readonly dependents: ReadonlyMap<Brief, readonly Brief[]>;\n  readonly scope: (b: Brief) => Scope;\n  readonly budget: number;\n}\n\n/**\n * Why a brief's declared wave does not hold, judged as `lint` and `matrix`\n * judge it: against the waves the other briefs declare, not the ones proposed.\n * Collisions are with the briefs the matrix compares; the dependency order is\n * wave-order's, both ways, over every live brief.\n */\nfunction breachesOf(brief: Brief, wave: number, judge: Judge): Breach[] {\n  const out: Breach[] = [];\n  for (const dependency of judge.dependencies.get(brief) as Brief[]) {\n    if (dependency.wave !== null && dependency.wave >= wave) out.push({ reason: 'dependency', brief: dependency, wave: dependency.wave });\n  }\n  for (const other of judge.dependents.get(brief) ?? []) {\n    if (other.wave !== null && other.wave <= wave) out.push({ reason: 'dependent', brief: other, wave: other.wave });\n  }\n  for (const other of judge.compared) {\n    if (other === brief || other.wave !== wave) continue;\n    const overlaps = meet(judge.scope(brief), judge.scope(other), judge.budget).overlaps;\n    if (overlaps.length > 0) out.push({ reason: 'collision', brief: other, overlaps });\n  }\n  return out;\n}\n\nexport function schedule(corpus: Corpus, options: ScheduleOptions = {}): Schedule {\n  const reading = readingIn(options.repoFiles ?? null);\n  const budget = options.budget ?? WITNESS_BUDGET;\n  const deferred = corpus.live.filter((b) => b.status === 'deferred').sort(byId);\n  const briefs = corpus.live.filter((b) => b.status !== 'deferred').sort(byId);\n  const dependencies = new Map(briefs.map((b) => [b, liveDependencies(corpus, b)]));\n  const declared = briefs.flatMap((b) => (b.wave === null ? [] : [b.wave]));\n  const first = declared.length === 0 ? 1 : Math.min(...declared);\n  const scopes = new Map<Brief, Scope>();\n  const scope = (b: Brief): Scope => {\n    const known = scopes.get(b) ?? scopeOf(b, reading);\n    scopes.set(b, known);\n    return known;\n  };\n  const waiting = new Set(waitingOnDeferred(corpus).map((w) => w.brief));\n  // Deferred briefs too: lint's wave-order reads every live brief's wave.\n  const everyDependency = new Map(corpus.live.map((b) => [b, liveDependencies(corpus, b)]));\n  const dependents = new Map<Brief, Brief[]>();\n  for (const b of [...corpus.live].sort(byId)) {\n    for (const d of everyDependency.get(b) as Brief[]) dependents.set(d, [...(dependents.get(d) ?? []), b]);\n  }\n  const judge: Judge = { compared: briefs.filter((b) => !waiting.has(b)), dependencies: everyDependency, dependents, scope, budget };\n\n  const waveOf = new Map<Brief, number>();\n  const occupants = new Map<number, Scope[]>();\n  const placements: Placement[] = [];\n  const pending = [...briefs];\n  // Kahn's order, taking the least id whose dependencies are all placed. A\n  // brief waiting on a deferred one, or on a cycle, is never taken.\n  for (;;) {\n    const next = pending.find((b) => (dependencies.get(b) as Brief[]).every((d) => waveOf.has(d)));\n    if (next === undefined) break;\n    pending.splice(pending.indexOf(next), 1);\n    let after: Placement['after'] = null;\n    for (const dependency of dependencies.get(next) as Brief[]) {\n      const wave = waveOf.get(dependency) as number;\n      if (after === null || wave > after.wave) after = { brief: dependency, wave };\n    }\n    const own = scope(next);\n    const passed: Passed[] = [];\n    let wave = after === null ? first : after.wave + 1;\n    // Ends by construction: a wave past every occupied one is empty, and an empty wave takes anyone.\n    for (;;) {\n      const found = clash(own, wave, occupants.get(wave) ?? [], budget);\n      if (found === null) break;\n      passed.push(found);\n      wave += 1;\n    }\n    waveOf.set(next, wave);\n    occupants.set(wave, [...(occupants.get(wave) ?? []), own]);\n    const breaches = next.wave === null || next.wave === wave ? [] : breachesOf(next, next.wave, judge);\n    placements.push({ brief: next, declared: next.wave, proposed: wave, after, passed, unscoped: own.affected.length === 0, breaches });\n  }\n\n  const cycles = dependencyCycles(corpus).filter((cycle) => cycle.every((b) => b.status !== 'deferred'));\n  const inCycle = new Set(cycles.flat());\n  const unplaced = pending.map((brief): Unplaced => {\n    const waitsOn = (dependencies.get(brief) as Brief[]).find((d) => !waveOf.has(d)) as Brief;\n    const because = waitsOn.status === 'deferred' ? 'deferred' : inCycle.has(waitsOn) ? 'cycle' : 'unplaced';\n    return { brief, waitsOn, because };\n  });\n  return { first, placements, unplaced, cycles, deferred };\n}\n\n/** The briefs whose declared wave the schedule would change. */\nexport function moves(s: Schedule): Placement[] {\n  return s.placements.filter((p) => p.proposed !== p.declared);\n}\n\n/**\n * Whether a brief's declared wave holds: it is the proposed one, or one a\n * person chose that `lint` and `matrix` accept. The schedule is one valid\n * answer, not the only one (ADR-0011, amended).\n */\nexport function holds(p: Placement): boolean {\n  return p.declared !== null && p.breaches.length === 0;\n}\n\n/** Why a declared wave does not hold, a clause each. */\nexport function breachReasons(p: Placement): string[] {\n  return p.breaches.map((b) => {\n    if (b.reason === 'collision') return `${label(b.brief)} there also writes ${(b.overlaps[0] as Overlap).witness}`;\n    if (b.reason === 'dependency') return `it depends on ${label(b.brief)}, in wave ${b.wave}`;\n    return `${label(b.brief)} depends on it, in wave ${b.wave}`;\n  });\n}\n\n/** Why a brief is in its wave and not an earlier one, a clause each. */\nexport function reasons(p: Placement): string[] {\n  const out: string[] = [];\n  if (p.after !== null) out.push(`after ${label(p.after.brief)}, in wave ${p.after.wave}`);\n  if (p.unscoped && p.passed.length > 0) out.push('it declares no affectedFiles, so it runs in a wave of its own');\n  for (const passed of p.passed) {\n    const there = `not wave ${passed.wave}, where ${label(passed.brief)}`;\n    if (passed.reason === 'collision') {\n      const [overlap] = passed.overlaps as [Overlap];\n      out.push(`${there} also writes ${overlap.witness} (\"${overlap.patterns[0]}\" and \"${overlap.patterns[1]}\")`);\n    } else if (passed.reason === 'undecided') {\n      out.push(`${there} may write the same files: the search could not decide within its budget`);\n    } else if (!p.unscoped) {\n      out.push(`${there} declares no affectedFiles and runs alone`);\n    }\n  }\n  if (out.length === 0) out.push('nothing holds it later');\n  return out;\n}\n\n/** The schedule as findings: cycles, briefs whose waves would move, briefs that run alone, and pairs it could not decide. */\nexport function scheduleFindings(corpus: Corpus, s: Schedule): Finding[] {\n  const findings: Finding[] = [];\n  const cycle = configuredSeverity(corpus, 'dependency-cycle');\n  if (cycle !== null) {\n    for (const members of s.cycles) {\n      const start = members[0] as Brief;\n      findings.push({\n        rule: 'dependency-cycle',\n        severity: cycle,\n        message: `dependencies form a cycle, so no wave can hold them: ${members.map(label).join(' -> ')}`,\n        file: start.file,\n        line: lineOfField(start, 'dependsOn') + 1,\n        brief: start.id ?? undefined,\n        hint: 'a cycle can never become ready; remove the dependency that is not real',\n      });\n    }\n  }\n  const change = configuredSeverity(corpus, 'wave-schedule');\n  if (change !== null) {\n    // A wave a person chose that lint and matrix accept is theirs to keep: a\n    // note, so that CI passes it. One missing, or one that does not hold, is\n    // the rule's finding at its configured severity.\n    for (const p of moves(s)) {\n      const valid = holds(p);\n      const was =\n        p.declared === null\n          ? 'declares no wave'\n          : valid\n            ? `declares wave ${p.declared}, which holds`\n            : `declares wave ${p.declared}, which does not hold (${breachReasons(p).join('; ')})`;\n      findings.push({\n        rule: 'wave-schedule',\n        severity: valid ? 'note' : change,\n        message: `${was}; the schedule puts it in wave ${p.proposed}: ${reasons(p).join('; ')}`,\n        file: p.brief.file,\n        line: lineOfField(p.brief, 'wave') + 1,\n        brief: p.brief.id ?? undefined,\n        hint: valid\n          ? `keep wave ${p.declared as number}, or run \"spec-brief schedule --write\" for wave ${p.proposed}`\n          : `run \"spec-brief schedule --write\", or set \"wave: ${p.proposed}\"`,\n      });\n    }\n  }\n  const unscoped = configuredSeverity(corpus, 'unscoped');\n  if (unscoped !== null && s.placements.length > 1) {\n    for (const p of s.placements.filter((x) => x.unscoped)) {\n      findings.push(unscopedFinding(unscoped, p.brief, `the ${s.placements.length - 1} other brief(s) the schedule places; it runs alone in wave ${p.proposed}`));\n    }\n  }\n  const undecided = configuredSeverity(corpus, 'collision-undecided');\n  if (undecided !== null) {\n    for (const p of s.placements) {\n      for (const passed of p.passed) {\n        if (passed.reason !== 'undecided') continue;\n        const theirsFirst = passed.patterns.map(([own, theirs]) => [theirs, own] as const);\n        findings.push(undecidedFinding(undecided, passed.brief, p.brief, theirsFirst, passed.wave));\n      }\n    }\n  }\n  return findings;\n}\n\nexport interface WavePlan {\n  /** A write of each brief whose wave changes: its front matter's `wave`, and every other line as it was. */\n  readonly ops: readonly FileOp[];\n  /** Briefs whose wave cannot be written, which refuse the whole write. */\n  readonly refused: readonly Finding[];\n}\n\n/** What `--write` writes. */\nexport function planWaves(s: Schedule): WavePlan {\n  const ops: FileOp[] = [];\n  const refused: Finding[] = [];\n  for (const p of moves(s)) {\n    const { brief } = p;\n    if (brief.frontMatter !== null && !editable(brief.frontMatter)) {\n      const open = brief.frontMatter.close < 0;\n      refused.push({\n        rule: 'front-matter',\n        severity: 'error',\n        message: `the front matter is ${open ? 'never closed' : 'TOML'}, so wave ${p.proposed} cannot be written into it`,\n        file: brief.file,\n        line: 1,\n        brief: brief.id ?? undefined,\n        hint: open ? 'close the front matter with a \"---\" line, and schedule again' : 'write the front matter as YAML between \"---\" lines, and schedule again',\n      });\n      continue;\n    }\n    const lines = setEntryKeepingComment(brief.lines, brief.frontMatter, 'wave', String(p.proposed));\n    ops.push({ kind: 'write', path: brief.file, content: encodeLike(brief.source, lines), before: brief.source });\n  }\n  return { ops, refused };\n}\n"]}

package/dist/scope.d.ts

@@ -0,0 +1,52 @@
+/**
+ * A brief's scope, and whether two briefs can write the same file.
+ *
+ * What a brief may write is its `affectedFiles` less its `protectedFiles`:
+ * protection wins, so "all of `src/` but the schema" is written
+ * `affectedFiles: [src/**]` with `protectedFiles: [src/db/schema.ts]`. Two
+ * briefs meet when some file lies in both writable scopes - in a pattern of
+ * each, and in neither brief's protections - and the witness search names
+ * the shortest such file (ADR-0005).
+ */
+import type { Brief } from './brief.js';
+import { type Glob, type LiteralReading } from './glob.js';
+/** How a literal path is read, as {@link readingIn} answers for a tree. */
+export type Reading = (path: string) => LiteralReading;
+export interface ScopePattern {
+    readonly pattern: string;
+    readonly glob: Glob;
+}
+export interface Scope {
+    readonly brief: Brief;
+    /** The `affectedFiles` that parse. One that does not is the `glob` rule's finding, and scopes nothing. */
+    readonly affected: readonly ScopePattern[];
+    readonly protected: readonly ScopePattern[];
+}
+/** Patterns that parse, read with one reading. */
+export declare function patternsOf(patterns: readonly string[], reading: Reading): ScopePattern[];
+export declare function scopeOf(brief: Brief, reading: Reading): Scope;
+/** A pattern from each scope, and a file both may write. */
+export interface Overlap {
+    readonly patterns: readonly [string, string];
+    readonly witness: string;
+}
+export interface Meeting {
+    /** Every pair of patterns that meets outside both protections, the first scope's pattern first. */
+    readonly overlaps: readonly Overlap[];
+    /** Pairs of patterns the search could not decide within its budget. */
+    readonly undecided: readonly (readonly [string, string])[];
+}
+/**
+ * Where two writable scopes meet. Each pair of affected patterns is searched
+ * for a file both cover that neither brief protects: a file one brief protects
+ * is one that brief will not write, so it is no collision.
+ */
+export declare function meet(a: Scope, b: Scope, budget?: number): Meeting;
+export interface Contradiction {
+    /** Affected patterns every file of which is protected: nothing of them is writable. */
+    readonly covered: readonly string[];
+    /** Affected patterns for which the search could not decide within its budget. */
+    readonly undecided: readonly string[];
+}
+/** The affected patterns a brief's own protections cover entirely. */
+export declare function contradictions(scope: Scope, budget?: number): Contradiction;

package/dist/scope.js

@@ -0,0 +1,56 @@
+/**
+ * A brief's scope, and whether two briefs can write the same file.
+ *
+ * What a brief may write is its `affectedFiles` less its `protectedFiles`:
+ * protection wins, so "all of `src/` but the schema" is written
+ * `affectedFiles: [src/**]` with `protectedFiles: [src/db/schema.ts]`. Two
+ * briefs meet when some file lies in both writable scopes - in a pattern of
+ * each, and in neither brief's protections - and the witness search names
+ * the shortest such file (ADR-0005).
+ */
+import { globCovers, globWitness, parseGlob, WITNESS_BUDGET } from './glob.js';
+/** Patterns that parse, read with one reading. */
+export function patternsOf(patterns, reading) {
+    return patterns.flatMap((pattern) => {
+        const parsed = parseGlob(pattern, { literal: reading });
+        return parsed.ok ? [{ pattern, glob: parsed.glob }] : [];
+    });
+}
+export function scopeOf(brief, reading) {
+    return { brief, affected: patternsOf(brief.affectedFiles, reading), protected: patternsOf(brief.protectedFiles, reading) };
+}
+/**
+ * Where two writable scopes meet. Each pair of affected patterns is searched
+ * for a file both cover that neither brief protects: a file one brief protects
+ * is one that brief will not write, so it is no collision.
+ */
+export function meet(a, b, budget = WITNESS_BUDGET) {
+    const avoid = [...a.protected, ...b.protected].map((p) => p.glob);
+    const overlaps = [];
+    const undecided = [];
+    for (const x of a.affected) {
+        for (const y of b.affected) {
+            const witness = globWitness([x.glob, y.glob], avoid, budget);
+            if (witness.kind === 'found')
+                overlaps.push({ patterns: [x.pattern, y.pattern], witness: witness.path });
+            else if (witness.kind === 'undecided')
+                undecided.push([x.pattern, y.pattern]);
+        }
+    }
+    return { overlaps, undecided };
+}
+/** The affected patterns a brief's own protections cover entirely. */
+export function contradictions(scope, budget = WITNESS_BUDGET) {
+    const covered = [];
+    const undecided = [];
+    const outer = scope.protected.map((p) => p.glob);
+    for (const { pattern, glob } of scope.affected) {
+        const answer = globCovers(outer, glob, budget);
+        if (answer === true)
+            covered.push(pattern);
+        else if (answer === 'undecided')
+            undecided.push(pattern);
+    }
+    return { covered, undecided };
+}
+//# sourceMappingURL=scope.js.map

package/dist/scope.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scope.js","sourceRoot":"","sources":["../src/scope.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAGH,OAAO,EAAa,UAAU,EAAE,WAAW,EAAuB,SAAS,EAAE,cAAc,EAAE,MAAM,WAAW,CAAC;AAiB/G,kDAAkD;AAClD,MAAM,UAAU,UAAU,CAAC,QAA2B,EAAE,OAAgB;IACtE,OAAO,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;QAClC,MAAM,MAAM,GAAG,SAAS,CAAC,OAAO,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC;QACxD,OAAO,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC3D,CAAC,CAAC,CAAC;AACL,CAAC;AAED,MAAM,UAAU,OAAO,CAAC,KAAY,EAAE,OAAgB;IACpD,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,UAAU,CAAC,KAAK,CAAC,aAAa,EAAE,OAAO,CAAC,EAAE,SAAS,EAAE,UAAU,CAAC,KAAK,CAAC,cAAc,EAAE,OAAO,CAAC,EAAE,CAAC;AAC7H,CAAC;AAeD;;;;GAIG;AACH,MAAM,UAAU,IAAI,CAAC,CAAQ,EAAE,CAAQ,EAAE,MAAM,GAAW,cAAc;IACtE,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAClE,MAAM,QAAQ,GAAc,EAAE,CAAC;IAC/B,MAAM,SAAS,GAAkC,EAAE,CAAC;IACpD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC3B,MAAM,OAAO,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;YAC7D,IAAI,OAAO,CAAC,IAAI,KAAK,OAAO;gBAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;iBACpG,IAAI,OAAO,CAAC,IAAI,KAAK,WAAW;gBAAE,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;QAChF,CAAC;IACH,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC;AACjC,CAAC;AASD,sEAAsE;AACtE,MAAM,UAAU,cAAc,CAAC,KAAY,EAAE,MAAM,GAAW,cAAc;IAC1E,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,MAAM,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACjD,KAAK,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;QAC/C,MAAM,MAAM,GAAG,UAAU,CAAC,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;QAC/C,IAAI,MAAM,KAAK,IAAI;YAAE,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;aACtC,IAAI,MAAM,KAAK,WAAW;YAAE,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC3D,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;AAChC,CAAC","sourcesContent":["/**\n * A brief's scope, and whether two briefs can write the same file.\n *\n * What a brief may write is its `affectedFiles` less its `protectedFiles`:\n * protection wins, so \"all of `src/` but the schema\" is written\n * `affectedFiles: [src/**]` with `protectedFiles: [src/db/schema.ts]`. Two\n * briefs meet when some file lies in both writable scopes - in a pattern of\n * each, and in neither brief's protections - and the witness search names\n * the shortest such file (ADR-0005).\n */\n\nimport type { Brief } from './brief.js';\nimport { type Glob, globCovers, globWitness, type LiteralReading, parseGlob, WITNESS_BUDGET } from './glob.js';\n\n/** How a literal path is read, as {@link readingIn} answers for a tree. */\nexport type Reading = (path: string) => LiteralReading;\n\nexport interface ScopePattern {\n  readonly pattern: string;\n  readonly glob: Glob;\n}\n\nexport interface Scope {\n  readonly brief: Brief;\n  /** The `affectedFiles` that parse. One that does not is the `glob` rule's finding, and scopes nothing. */\n  readonly affected: readonly ScopePattern[];\n  readonly protected: readonly ScopePattern[];\n}\n\n/** Patterns that parse, read with one reading. */\nexport function patternsOf(patterns: readonly string[], reading: Reading): ScopePattern[] {\n  return patterns.flatMap((pattern) => {\n    const parsed = parseGlob(pattern, { literal: reading });\n    return parsed.ok ? [{ pattern, glob: parsed.glob }] : [];\n  });\n}\n\nexport function scopeOf(brief: Brief, reading: Reading): Scope {\n  return { brief, affected: patternsOf(brief.affectedFiles, reading), protected: patternsOf(brief.protectedFiles, reading) };\n}\n\n/** A pattern from each scope, and a file both may write. */\nexport interface Overlap {\n  readonly patterns: readonly [string, string];\n  readonly witness: string;\n}\n\nexport interface Meeting {\n  /** Every pair of patterns that meets outside both protections, the first scope's pattern first. */\n  readonly overlaps: readonly Overlap[];\n  /** Pairs of patterns the search could not decide within its budget. */\n  readonly undecided: readonly (readonly [string, string])[];\n}\n\n/**\n * Where two writable scopes meet. Each pair of affected patterns is searched\n * for a file both cover that neither brief protects: a file one brief protects\n * is one that brief will not write, so it is no collision.\n */\nexport function meet(a: Scope, b: Scope, budget: number = WITNESS_BUDGET): Meeting {\n  const avoid = [...a.protected, ...b.protected].map((p) => p.glob);\n  const overlaps: Overlap[] = [];\n  const undecided: (readonly [string, string])[] = [];\n  for (const x of a.affected) {\n    for (const y of b.affected) {\n      const witness = globWitness([x.glob, y.glob], avoid, budget);\n      if (witness.kind === 'found') overlaps.push({ patterns: [x.pattern, y.pattern], witness: witness.path });\n      else if (witness.kind === 'undecided') undecided.push([x.pattern, y.pattern]);\n    }\n  }\n  return { overlaps, undecided };\n}\n\nexport interface Contradiction {\n  /** Affected patterns every file of which is protected: nothing of them is writable. */\n  readonly covered: readonly string[];\n  /** Affected patterns for which the search could not decide within its budget. */\n  readonly undecided: readonly string[];\n}\n\n/** The affected patterns a brief's own protections cover entirely. */\nexport function contradictions(scope: Scope, budget: number = WITNESS_BUDGET): Contradiction {\n  const covered: string[] = [];\n  const undecided: string[] = [];\n  const outer = scope.protected.map((p) => p.glob);\n  for (const { pattern, glob } of scope.affected) {\n    const answer = globCovers(outer, glob, budget);\n    if (answer === true) covered.push(pattern);\n    else if (answer === 'undecided') undecided.push(pattern);\n  }\n  return { covered, undecided };\n}\n"]}