@descent-vtt/spec-brief 0.2.6 → 0.3.0

package/dist/schema.js.map

@@ -1 +1 @@
-{"version":3,"file":"schema.js","sourceRoot":"","sources":["../src/schema.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AA2BH,SAAS,MAAM,CAAC,KAAc;IAC5B,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,MAAM,CAAC;IAClC,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,OAAO,CAAC;IACzC,QAAQ,OAAO,KAAK,EAAE,CAAC;QACrB,KAAK,QAAQ;YACX,OAAO,QAAQ,CAAC;QAClB,KAAK,SAAS;YACZ,OAAO,SAAS,CAAC;QACnB,KAAK,QAAQ;YACX,OAAO,QAAQ,CAAC;QAClB;YACE,OAAO,QAAQ,CAAC;IACpB,CAAC;AACH,CAAC;AAED,SAAS,OAAO,CAAC,MAAc,EAAE,IAAU;IACzC,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;QACpB,KAAK,QAAQ;YACX,OAAO,IAAI,KAAK,QAAQ,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,MAAM,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC;QAC5E,KAAK,SAAS;YACZ,OAAO,IAAI,KAAK,SAAS,CAAC;QAC5B,KAAK,SAAS;YACZ,OAAO,IAAI,KAAK,QAAQ,CAAC;QAC3B,KAAK,OAAO;YACV,OAAO,IAAI,KAAK,OAAO,CAAC;QAC1B,KAAK,QAAQ,CAAC;QACd,KAAK,KAAK;YACR,OAAO,IAAI,KAAK,QAAQ,CAAC;QAC3B,KAAK,OAAO;YACV,OAAO,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC;QAChE,KAAK,KAAK;YACR,OAAO,IAAI,CAAC;IAChB,CAAC;AACH,CAAC;AAED,SAAS,IAAI,CAAC,MAAc;IAC1B,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;QACpB,KAAK,QAAQ;YACX,OAAO,MAAM,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,UAAU,CAAC;QACpE,KAAK,SAAS;YACZ,OAAO,eAAe,CAAC;QACzB,KAAK,SAAS;YACZ,OAAO,YAAY,CAAC;QACtB,KAAK,OAAO;YACV,OAAO,QAAQ,CAAC;QAClB,KAAK,QAAQ,CAAC;QACd,KAAK,KAAK;YACR,OAAO,WAAW,CAAC;QACrB,KAAK,OAAO;YACV,OAAO,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC/C,iFAAiF;QACjF,KAAK,KAAK;YACR,OAAO,UAAU,CAAC;IACtB,CAAC;AACH,CAAC;AAED,SAAS,EAAE,CAAC,IAAY,EAAE,GAAW;IACnC,OAAO,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,GAAG,EAAE,CAAC;AAC9C,CAAC;AAED,qFAAqF;AACrF,MAAM,UAAU,QAAQ,CAAC,MAAc,EAAE,KAAc,EAAE,IAAI,GAAG,EAAE;IAChE,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC;IAC9D,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;QAAE,OAAO,CAAC,GAAG,KAAK,YAAY,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACjF,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;QACpB,KAAK,QAAQ,EAAE,CAAC;YACd,IAAI,OAAO,KAAK,KAAK,QAAQ;gBAAE,OAAO,EAAE,CAAC;YACzC,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC9D,OAAO,CAAC,GAAG,KAAK,mBAAmB,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,KAAK,GAAG,CAAC,CAAC;YACpG,CAAC;YACD,IAAI,MAAM,CAAC,SAAS,KAAK,SAAS,IAAI,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,SAAS;gBAAE,OAAO,CAAC,GAAG,KAAK,oBAAoB,CAAC,CAAC;YAC7G,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,KAAK,SAAS,EAAE,CAAC;YACf,MAAM,MAAM,GAAG,KAAe,CAAC;YAC/B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC;gBAAE,OAAO,CAAC,GAAG,KAAK,qBAAqB,CAAC,CAAC;YACtE,IAAI,MAAM,CAAC,OAAO,KAAK,SAAS,IAAI,MAAM,GAAG,MAAM,CAAC,OAAO;gBAAE,OAAO,CAAC,GAAG,KAAK,qBAAqB,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;YACpH,IAAI,MAAM,CAAC,OAAO,KAAK,SAAS,IAAI,MAAM,GAAG,MAAM,CAAC,OAAO;gBAAE,OAAO,CAAC,GAAG,KAAK,oBAAoB,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;YACnH,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,KAAK,OAAO;YACV,OAAQ,KAAmB,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QAClG,KAAK,QAAQ,EAAE,CAAC;YACd,MAAM,MAAM,GAAG,KAAgC,CAAC;YAChD,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YAC7C,MAAM,QAAQ,GAAa,EAAE,CAAC;YAC9B,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBACtC,MAAM,QAAQ,GAAG,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;gBACxC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;oBAC3B,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;oBAClC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,uBAAuB,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,KAAK,IAAI,EAAE,CAAC,CAAC;oBACjH,SAAS;gBACX,CAAC;gBACD,QAAQ,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YACnE,CAAC;YACD,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,QAAQ,IAAI,EAAE,EAAE,CAAC;gBACxC,IAAI,CAAC,CAAC,GAAG,IAAI,MAAM,CAAC;oBAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,eAAe,CAAC,CAAC;YACxE,CAAC;YACD,OAAO,QAAQ,CAAC;QAClB,CAAC;QACD,KAAK,KAAK;YACR,OAAO,MAAM,CAAC,OAAO,CAAC,KAAgC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,EAAE,CAC9E,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAC7C,CAAC;QACJ,KAAK,OAAO,EAAE,CAAC;YACb,MAAM,UAAU,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACrF,IAAI,KAA2B,CAAC;YAChC,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;gBAChC,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;gBAC/C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;oBAAE,OAAO,EAAE,CAAC;gBACrC,KAAK,KAAK,QAAQ,CAAC;YACrB,CAAC;YACD,OAAO,KAAK,IAAI,EAAE,CAAC;QACrB,CAAC;QACD,KAAK,SAAS,CAAC;QACf,KAAK,KAAK;YACR,OAAO,EAAE,CAAC;IACd,CAAC;AACH,CAAC;AAED,4FAA4F;AAC5F,MAAM,UAAU,OAAO,CAAC,IAAY,EAAE,OAA0B;IAC9D,IAAI,IAAwB,CAAC;IAC7B,IAAI,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAChE,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,MAAM,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC;QAC7D,IAAI,CAAC,GAAG,YAAY,EAAE,CAAC;YACrB,IAAI,GAAG,MAAM,CAAC;YACd,YAAY,GAAG,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,QAAQ,CAAC,CAAS,EAAE,CAAS;IACpC,IAAI,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACjE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACtC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACtC,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzD,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAE,QAAQ,CAAC,CAAC,CAAY,GAAG,CAAC,EAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAY,GAAG,CAAC,EAAG,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAY,GAAG,IAAI,CAAC,CAAC,CAAC;QAClH,CAAC;QACD,QAAQ,GAAG,GAAG,CAAC;IACjB,CAAC;IACD,OAAO,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAW,CAAC;AACtC,CAAC;AAID,uDAAuD;AACvD,MAAM,UAAU,YAAY,CAAC,MAAc;IACzC,MAAM,SAAS,GAAG,CAAC,IAA6B,EAA2B,EAAE,CAC3E,MAAM,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,MAAM,CAAC,WAAW,EAAE,GAAG,IAAI,EAAE,CAAC;IACzF,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;QACpB,KAAK,QAAQ,EAAE,CAAC;YACd,MAAM,IAAI,GAA4B,EAAE,IAAI,EAAE,MAAM,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;YACzG,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS;gBAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5G,IAAI,MAAM,CAAC,SAAS,KAAK,SAAS;gBAAE,IAAI,CAAC,WAAW,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC;YACzE,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC;QACzB,CAAC;QACD,KAAK,SAAS;YACZ,OAAO,SAAS,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;QACxC,KAAK,SAAS,EAAE,CAAC;YACf,MAAM,IAAI,GAA4B,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;YAC1D,IAAI,MAAM,CAAC,OAAO,KAAK,SAAS;gBAAE,IAAI,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC;YACnE,IAAI,MAAM,CAAC,OAAO,KAAK,SAAS;gBAAE,IAAI,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC;YACnE,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC;QACzB,CAAC;QACD,KAAK,OAAO;YACV,OAAO,SAAS,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACzE,KAAK,QAAQ,EAAE,CAAC;YACd,MAAM,UAAU,GAA4B,EAAE,CAAC;YAC/C,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC;gBAAE,UAAU,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;YACpG,MAAM,IAAI,GAA4B,EAAE,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,oBAAoB,EAAE,KAAK,EAAE,CAAC;YAClG,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;gBAAE,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;YACzG,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC;QACzB,CAAC;QACD,KAAK,KAAK;YACR,OAAO,SAAS,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,oBAAoB,EAAE,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC1F,KAAK,OAAO;YACV,OAAO,SAAS,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;QAChE,KAAK,KAAK;YACR,OAAO,SAAS,CAAC,EAAE,CAAC,CAAC;IACzB,CAAC;AACH,CAAC","sourcesContent":["/**\n * A small schema language: one description that both validates a value and\n * renders as JSON Schema, so the published `schema.json` and the checks the\n * loader runs cannot disagree about what a configuration may say.\n */\n\ninterface Described {\n  readonly description?: string;\n}\n\nexport type Schema =\n  | (Described & {\n      readonly type: 'string';\n      readonly enum?: readonly string[];\n      readonly nullable?: boolean;\n      readonly minLength?: number;\n    })\n  | (Described & { readonly type: 'boolean' })\n  | (Described & { readonly type: 'integer'; readonly minimum?: number; readonly maximum?: number })\n  | (Described & { readonly type: 'array'; readonly items: Schema })\n  | (Described & {\n      readonly type: 'object';\n      readonly properties: Readonly<Record<string, Schema>>;\n      readonly required?: readonly string[];\n    })\n  | (Described & { readonly type: 'map'; readonly values: Schema })\n  | (Described & { readonly type: 'anyOf'; readonly options: readonly Schema[] })\n  | (Described & { readonly type: 'any' });\n\ntype Kind = 'null' | 'string' | 'boolean' | 'number' | 'array' | 'object';\n\nfunction kindOf(value: unknown): Kind {\n  if (value === null) return 'null';\n  if (Array.isArray(value)) return 'array';\n  switch (typeof value) {\n    case 'string':\n      return 'string';\n    case 'boolean':\n      return 'boolean';\n    case 'number':\n      return 'number';\n    default:\n      return 'object';\n  }\n}\n\nfunction accepts(schema: Schema, kind: Kind): boolean {\n  switch (schema.type) {\n    case 'string':\n      return kind === 'string' || (kind === 'null' && schema.nullable === true);\n    case 'boolean':\n      return kind === 'boolean';\n    case 'integer':\n      return kind === 'number';\n    case 'array':\n      return kind === 'array';\n    case 'object':\n    case 'map':\n      return kind === 'object';\n    case 'anyOf':\n      return schema.options.some((option) => accepts(option, kind));\n    case 'any':\n      return true;\n  }\n}\n\nfunction noun(schema: Schema): string {\n  switch (schema.type) {\n    case 'string':\n      return schema.nullable === true ? 'a string or null' : 'a string';\n    case 'boolean':\n      return 'true or false';\n    case 'integer':\n      return 'an integer';\n    case 'array':\n      return 'a list';\n    case 'object':\n    case 'map':\n      return 'an object';\n    case 'anyOf':\n      return schema.options.map(noun).join(' or ');\n    /* v8 ignore next 2 -- \"any\" accepts every value, so no message ever names it. */\n    case 'any':\n      return 'anything';\n  }\n}\n\nfunction at(path: string, key: string): string {\n  return path === '' ? key : `${path}.${key}`;\n}\n\n/** The problems with `value`, each naming the path to it. Empty when it conforms. */\nexport function validate(schema: Schema, value: unknown, path = ''): string[] {\n  const where = path === '' ? 'the configuration' : `\"${path}\"`;\n  if (!accepts(schema, kindOf(value))) return [`${where} must be ${noun(schema)}`];\n  switch (schema.type) {\n    case 'string': {\n      if (typeof value !== 'string') return [];\n      if (schema.enum !== undefined && !schema.enum.includes(value)) {\n        return [`${where} must be one of ${schema.enum.map((e) => `\"${e}\"`).join(', ')}, not \"${value}\"`];\n      }\n      if (schema.minLength !== undefined && value.length < schema.minLength) return [`${where} must not be empty`];\n      return [];\n    }\n    case 'integer': {\n      const number = value as number;\n      if (!Number.isInteger(number)) return [`${where} must be an integer`];\n      if (schema.minimum !== undefined && number < schema.minimum) return [`${where} must be at least ${schema.minimum}`];\n      if (schema.maximum !== undefined && number > schema.maximum) return [`${where} must be at most ${schema.maximum}`];\n      return [];\n    }\n    case 'array':\n      return (value as unknown[]).flatMap((item, i) => validate(schema.items, item, `${path}[${i}]`));\n    case 'object': {\n      const record = value as Record<string, unknown>;\n      const known = Object.keys(schema.properties);\n      const problems: string[] = [];\n      for (const key of Object.keys(record)) {\n        const property = schema.properties[key];\n        if (property === undefined) {\n          const guess = closest(key, known);\n          problems.push(`\"${at(path, key)}\" is not a known key${guess === undefined ? '' : `; did you mean \"${guess}\"?`}`);\n          continue;\n        }\n        problems.push(...validate(property, record[key], at(path, key)));\n      }\n      for (const key of schema.required ?? []) {\n        if (!(key in record)) problems.push(`\"${at(path, key)}\" is required`);\n      }\n      return problems;\n    }\n    case 'map':\n      return Object.entries(value as Record<string, unknown>).flatMap(([key, item]) =>\n        validate(schema.values, item, at(path, key)),\n      );\n    case 'anyOf': {\n      const candidates = schema.options.filter((option) => accepts(option, kindOf(value)));\n      let first: string[] | undefined;\n      for (const option of candidates) {\n        const problems = validate(option, value, path);\n        if (problems.length === 0) return [];\n        first ??= problems;\n      }\n      return first ?? [];\n    }\n    case 'boolean':\n    case 'any':\n      return [];\n  }\n}\n\n/** The known key nearest to a misspelling, when one is near enough to be what was meant. */\nexport function closest(word: string, options: readonly string[]): string | undefined {\n  let best: string | undefined;\n  let bestDistance = Math.max(2, Math.floor(word.length / 3)) + 1;\n  for (const option of options) {\n    const d = distance(word.toLowerCase(), option.toLowerCase());\n    if (d < bestDistance) {\n      best = option;\n      bestDistance = d;\n    }\n  }\n  return best;\n}\n\nfunction distance(a: string, b: string): number {\n  let previous = Array.from({ length: b.length + 1 }, (_, j) => j);\n  for (let i = 1; i <= a.length; i += 1) {\n    const row = [i];\n    for (let j = 1; j <= b.length; j += 1) {\n      const cost = a.charAt(i - 1) === b.charAt(j - 1) ? 0 : 1;\n      row.push(Math.min((previous[j] as number) + 1, (row[j - 1] as number) + 1, (previous[j - 1] as number) + cost));\n    }\n    previous = row;\n  }\n  return previous[b.length] as number;\n}\n\ntype Json = null | boolean | number | string | Json[] | { [key: string]: Json };\n\n/** Renders a schema as JSON Schema (draft 2020-12). */\nexport function toJsonSchema(schema: Schema): { [key: string]: Json } {\n  const described = (body: { [key: string]: Json }): { [key: string]: Json } =>\n    schema.description === undefined ? body : { description: schema.description, ...body };\n  switch (schema.type) {\n    case 'string': {\n      const body: { [key: string]: Json } = { type: schema.nullable === true ? ['string', 'null'] : 'string' };\n      if (schema.enum !== undefined) body['enum'] = [...schema.enum, ...(schema.nullable === true ? [null] : [])];\n      if (schema.minLength !== undefined) body['minLength'] = schema.minLength;\n      return described(body);\n    }\n    case 'boolean':\n      return described({ type: 'boolean' });\n    case 'integer': {\n      const body: { [key: string]: Json } = { type: 'integer' };\n      if (schema.minimum !== undefined) body['minimum'] = schema.minimum;\n      if (schema.maximum !== undefined) body['maximum'] = schema.maximum;\n      return described(body);\n    }\n    case 'array':\n      return described({ type: 'array', items: toJsonSchema(schema.items) });\n    case 'object': {\n      const properties: { [key: string]: Json } = {};\n      for (const [key, value] of Object.entries(schema.properties)) properties[key] = toJsonSchema(value);\n      const body: { [key: string]: Json } = { type: 'object', properties, additionalProperties: false };\n      if (schema.required !== undefined && schema.required.length > 0) body['required'] = [...schema.required];\n      return described(body);\n    }\n    case 'map':\n      return described({ type: 'object', additionalProperties: toJsonSchema(schema.values) });\n    case 'anyOf':\n      return described({ anyOf: schema.options.map(toJsonSchema) });\n    case 'any':\n      return described({});\n  }\n}\n"]}
+{"version":3,"file":"schema.js","sourceRoot":"","sources":["../src/schema.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AA2BH,SAAS,MAAM,CAAC,KAAc;IAC5B,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,MAAM,CAAC;IAClC,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,OAAO,CAAC;IACzC,QAAQ,OAAO,KAAK,EAAE,CAAC;QACrB,KAAK,QAAQ;YACX,OAAO,QAAQ,CAAC;QAClB,KAAK,SAAS;YACZ,OAAO,SAAS,CAAC;QACnB,KAAK,QAAQ;YACX,OAAO,QAAQ,CAAC;QAClB;YACE,OAAO,QAAQ,CAAC;IACpB,CAAC;AACH,CAAC;AAED,SAAS,OAAO,CAAC,MAAc,EAAE,IAAU;IACzC,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;QACpB,KAAK,QAAQ;YACX,OAAO,IAAI,KAAK,QAAQ,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,MAAM,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC;QAC5E,KAAK,SAAS;YACZ,OAAO,IAAI,KAAK,SAAS,CAAC;QAC5B,KAAK,SAAS;YACZ,OAAO,IAAI,KAAK,QAAQ,CAAC;QAC3B,KAAK,OAAO;YACV,OAAO,IAAI,KAAK,OAAO,CAAC;QAC1B,KAAK,QAAQ,CAAC;QACd,KAAK,KAAK;YACR,OAAO,IAAI,KAAK,QAAQ,CAAC;QAC3B,KAAK,OAAO;YACV,OAAO,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC;QAChE,KAAK,KAAK;YACR,OAAO,IAAI,CAAC;IAChB,CAAC;AACH,CAAC;AAED,SAAS,IAAI,CAAC,MAAc;IAC1B,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;QACpB,KAAK,QAAQ;YACX,OAAO,MAAM,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,UAAU,CAAC;QACpE,KAAK,SAAS;YACZ,OAAO,eAAe,CAAC;QACzB,KAAK,SAAS;YACZ,OAAO,YAAY,CAAC;QACtB,KAAK,OAAO;YACV,OAAO,QAAQ,CAAC;QAClB,KAAK,QAAQ,CAAC;QACd,KAAK,KAAK;YACR,OAAO,WAAW,CAAC;QACrB,KAAK,OAAO;YACV,OAAO,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC/C,iFAAiF;QACjF,KAAK,KAAK;YACR,OAAO,UAAU,CAAC;IACtB,CAAC;AACH,CAAC;AAED,SAAS,EAAE,CAAC,IAAY,EAAE,GAAW;IACnC,OAAO,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,GAAG,EAAE,CAAC;AAC9C,CAAC;AAED,qFAAqF;AACrF,MAAM,UAAU,QAAQ,CAAC,MAAc,EAAE,KAAc,EAAE,IAAI,GAAG,EAAE;IAChE,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC;IAC9D,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;QAAE,OAAO,CAAC,GAAG,KAAK,YAAY,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACjF,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;QACpB,KAAK,QAAQ,EAAE,CAAC;YACd,IAAI,OAAO,KAAK,KAAK,QAAQ;gBAAE,OAAO,EAAE,CAAC;YACzC,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC9D,OAAO,CAAC,GAAG,KAAK,mBAAmB,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,KAAK,GAAG,CAAC,CAAC;YACpG,CAAC;YACD,IAAI,MAAM,CAAC,SAAS,KAAK,SAAS,IAAI,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,SAAS;gBAAE,OAAO,CAAC,GAAG,KAAK,oBAAoB,CAAC,CAAC;YAC7G,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,KAAK,SAAS,EAAE,CAAC;YACf,MAAM,MAAM,GAAG,KAAe,CAAC;YAC/B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC;gBAAE,OAAO,CAAC,GAAG,KAAK,qBAAqB,CAAC,CAAC;YACtE,IAAI,MAAM,CAAC,OAAO,KAAK,SAAS,IAAI,MAAM,GAAG,MAAM,CAAC,OAAO;gBAAE,OAAO,CAAC,GAAG,KAAK,qBAAqB,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;YACpH,IAAI,MAAM,CAAC,OAAO,KAAK,SAAS,IAAI,MAAM,GAAG,MAAM,CAAC,OAAO;gBAAE,OAAO,CAAC,GAAG,KAAK,oBAAoB,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;YACnH,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,KAAK,OAAO;YACV,OAAQ,KAAmB,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QAClG,KAAK,QAAQ,EAAE,CAAC;YACd,MAAM,MAAM,GAAG,KAAgC,CAAC;YAChD,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YAC7C,MAAM,QAAQ,GAAa,EAAE,CAAC;YAC9B,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBACtC,MAAM,QAAQ,GAAG,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;gBACxC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;oBAC3B,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;oBAClC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,uBAAuB,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,KAAK,IAAI,EAAE,CAAC,CAAC;oBACjH,SAAS;gBACX,CAAC;gBACD,QAAQ,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YACnE,CAAC;YACD,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,QAAQ,IAAI,EAAE,EAAE,CAAC;gBACxC,IAAI,CAAC,CAAC,GAAG,IAAI,MAAM,CAAC;oBAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,eAAe,CAAC,CAAC;YACxE,CAAC;YACD,OAAO,QAAQ,CAAC;QAClB,CAAC;QACD,KAAK,KAAK;YACR,OAAO,MAAM,CAAC,OAAO,CAAC,KAAgC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,EAAE,CAC9E,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAC7C,CAAC;QACJ,KAAK,OAAO,EAAE,CAAC;YACb,MAAM,UAAU,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACrF,IAAI,KAA2B,CAAC;YAChC,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;gBAChC,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;gBAC/C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;oBAAE,OAAO,EAAE,CAAC;gBACrC,KAAK,KAAK,QAAQ,CAAC;YACrB,CAAC;YACD,OAAO,KAAK,IAAI,EAAE,CAAC;QACrB,CAAC;QACD,KAAK,SAAS,CAAC;QACf,KAAK,KAAK;YACR,OAAO,EAAE,CAAC;IACd,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,OAAO,CAAC,IAAY,EAAE,OAA0B;IAC9D,IAAI,IAAwB,CAAC;IAC7B,IAAI,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAChE,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,MAAM,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC;QAC7D,IAAI,CAAC,GAAG,YAAY,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;YACjE,IAAI,GAAG,MAAM,CAAC;YACd,YAAY,GAAG,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,QAAQ,CAAC,CAAS,EAAE,CAAS;IACpC,IAAI,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACjE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACtC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACtC,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzD,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAE,QAAQ,CAAC,CAAC,CAAY,GAAG,CAAC,EAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAY,GAAG,CAAC,EAAG,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAY,GAAG,IAAI,CAAC,CAAC,CAAC;QAClH,CAAC;QACD,QAAQ,GAAG,GAAG,CAAC;IACjB,CAAC;IACD,OAAO,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAW,CAAC;AACtC,CAAC;AAID,uDAAuD;AACvD,MAAM,UAAU,YAAY,CAAC,MAAc;IACzC,MAAM,SAAS,GAAG,CAAC,IAA6B,EAA2B,EAAE,CAC3E,MAAM,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,MAAM,CAAC,WAAW,EAAE,GAAG,IAAI,EAAE,CAAC;IACzF,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;QACpB,KAAK,QAAQ,EAAE,CAAC;YACd,MAAM,IAAI,GAA4B,EAAE,IAAI,EAAE,MAAM,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;YACzG,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS;gBAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5G,IAAI,MAAM,CAAC,SAAS,KAAK,SAAS;gBAAE,IAAI,CAAC,WAAW,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC;YACzE,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC;QACzB,CAAC;QACD,KAAK,SAAS;YACZ,OAAO,SAAS,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;QACxC,KAAK,SAAS,EAAE,CAAC;YACf,MAAM,IAAI,GAA4B,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;YAC1D,IAAI,MAAM,CAAC,OAAO,KAAK,SAAS;gBAAE,IAAI,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC;YACnE,IAAI,MAAM,CAAC,OAAO,KAAK,SAAS;gBAAE,IAAI,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC;YACnE,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC;QACzB,CAAC;QACD,KAAK,OAAO;YACV,OAAO,SAAS,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACzE,KAAK,QAAQ,EAAE,CAAC;YACd,MAAM,UAAU,GAA4B,EAAE,CAAC;YAC/C,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC;gBAAE,UAAU,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;YACpG,MAAM,IAAI,GAA4B,EAAE,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,oBAAoB,EAAE,KAAK,EAAE,CAAC;YAClG,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;gBAAE,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;YACzG,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC;QACzB,CAAC;QACD,KAAK,KAAK;YACR,OAAO,SAAS,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,oBAAoB,EAAE,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC1F,KAAK,OAAO;YACV,OAAO,SAAS,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;QAChE,KAAK,KAAK;YACR,OAAO,SAAS,CAAC,EAAE,CAAC,CAAC;IACzB,CAAC;AACH,CAAC","sourcesContent":["/**\n * A small schema language: one description that both validates a value and\n * renders as JSON Schema, so the published `schema.json` and the checks the\n * loader runs cannot disagree about what a configuration may say.\n */\n\ninterface Described {\n  readonly description?: string;\n}\n\nexport type Schema =\n  | (Described & {\n      readonly type: 'string';\n      readonly enum?: readonly string[];\n      readonly nullable?: boolean;\n      readonly minLength?: number;\n    })\n  | (Described & { readonly type: 'boolean' })\n  | (Described & { readonly type: 'integer'; readonly minimum?: number; readonly maximum?: number })\n  | (Described & { readonly type: 'array'; readonly items: Schema })\n  | (Described & {\n      readonly type: 'object';\n      readonly properties: Readonly<Record<string, Schema>>;\n      readonly required?: readonly string[];\n    })\n  | (Described & { readonly type: 'map'; readonly values: Schema })\n  | (Described & { readonly type: 'anyOf'; readonly options: readonly Schema[] })\n  | (Described & { readonly type: 'any' });\n\ntype Kind = 'null' | 'string' | 'boolean' | 'number' | 'array' | 'object';\n\nfunction kindOf(value: unknown): Kind {\n  if (value === null) return 'null';\n  if (Array.isArray(value)) return 'array';\n  switch (typeof value) {\n    case 'string':\n      return 'string';\n    case 'boolean':\n      return 'boolean';\n    case 'number':\n      return 'number';\n    default:\n      return 'object';\n  }\n}\n\nfunction accepts(schema: Schema, kind: Kind): boolean {\n  switch (schema.type) {\n    case 'string':\n      return kind === 'string' || (kind === 'null' && schema.nullable === true);\n    case 'boolean':\n      return kind === 'boolean';\n    case 'integer':\n      return kind === 'number';\n    case 'array':\n      return kind === 'array';\n    case 'object':\n    case 'map':\n      return kind === 'object';\n    case 'anyOf':\n      return schema.options.some((option) => accepts(option, kind));\n    case 'any':\n      return true;\n  }\n}\n\nfunction noun(schema: Schema): string {\n  switch (schema.type) {\n    case 'string':\n      return schema.nullable === true ? 'a string or null' : 'a string';\n    case 'boolean':\n      return 'true or false';\n    case 'integer':\n      return 'an integer';\n    case 'array':\n      return 'a list';\n    case 'object':\n    case 'map':\n      return 'an object';\n    case 'anyOf':\n      return schema.options.map(noun).join(' or ');\n    /* v8 ignore next 2 -- \"any\" accepts every value, so no message ever names it. */\n    case 'any':\n      return 'anything';\n  }\n}\n\nfunction at(path: string, key: string): string {\n  return path === '' ? key : `${path}.${key}`;\n}\n\n/** The problems with `value`, each naming the path to it. Empty when it conforms. */\nexport function validate(schema: Schema, value: unknown, path = ''): string[] {\n  const where = path === '' ? 'the configuration' : `\"${path}\"`;\n  if (!accepts(schema, kindOf(value))) return [`${where} must be ${noun(schema)}`];\n  switch (schema.type) {\n    case 'string': {\n      if (typeof value !== 'string') return [];\n      if (schema.enum !== undefined && !schema.enum.includes(value)) {\n        return [`${where} must be one of ${schema.enum.map((e) => `\"${e}\"`).join(', ')}, not \"${value}\"`];\n      }\n      if (schema.minLength !== undefined && value.length < schema.minLength) return [`${where} must not be empty`];\n      return [];\n    }\n    case 'integer': {\n      const number = value as number;\n      if (!Number.isInteger(number)) return [`${where} must be an integer`];\n      if (schema.minimum !== undefined && number < schema.minimum) return [`${where} must be at least ${schema.minimum}`];\n      if (schema.maximum !== undefined && number > schema.maximum) return [`${where} must be at most ${schema.maximum}`];\n      return [];\n    }\n    case 'array':\n      return (value as unknown[]).flatMap((item, i) => validate(schema.items, item, `${path}[${i}]`));\n    case 'object': {\n      const record = value as Record<string, unknown>;\n      const known = Object.keys(schema.properties);\n      const problems: string[] = [];\n      for (const key of Object.keys(record)) {\n        const property = schema.properties[key];\n        if (property === undefined) {\n          const guess = closest(key, known);\n          problems.push(`\"${at(path, key)}\" is not a known key${guess === undefined ? '' : `; did you mean \"${guess}\"?`}`);\n          continue;\n        }\n        problems.push(...validate(property, record[key], at(path, key)));\n      }\n      for (const key of schema.required ?? []) {\n        if (!(key in record)) problems.push(`\"${at(path, key)}\" is required`);\n      }\n      return problems;\n    }\n    case 'map':\n      return Object.entries(value as Record<string, unknown>).flatMap(([key, item]) =>\n        validate(schema.values, item, at(path, key)),\n      );\n    case 'anyOf': {\n      const candidates = schema.options.filter((option) => accepts(option, kindOf(value)));\n      let first: string[] | undefined;\n      for (const option of candidates) {\n        const problems = validate(option, value, path);\n        if (problems.length === 0) return [];\n        first ??= problems;\n      }\n      return first ?? [];\n    }\n    case 'boolean':\n    case 'any':\n      return [];\n  }\n}\n\n/**\n * The known key nearest to a misspelling, when one is near enough to be what\n * was meant. One that keeps no character of the word is no misspelling of it,\n * however short both are: `狀態` is two edits from `id`.\n */\nexport function closest(word: string, options: readonly string[]): string | undefined {\n  let best: string | undefined;\n  let bestDistance = Math.max(2, Math.floor(word.length / 3)) + 1;\n  for (const option of options) {\n    const d = distance(word.toLowerCase(), option.toLowerCase());\n    if (d < bestDistance && d < Math.max(word.length, option.length)) {\n      best = option;\n      bestDistance = d;\n    }\n  }\n  return best;\n}\n\nfunction distance(a: string, b: string): number {\n  let previous = Array.from({ length: b.length + 1 }, (_, j) => j);\n  for (let i = 1; i <= a.length; i += 1) {\n    const row = [i];\n    for (let j = 1; j <= b.length; j += 1) {\n      const cost = a.charAt(i - 1) === b.charAt(j - 1) ? 0 : 1;\n      row.push(Math.min((previous[j] as number) + 1, (row[j - 1] as number) + 1, (previous[j - 1] as number) + cost));\n    }\n    previous = row;\n  }\n  return previous[b.length] as number;\n}\n\ntype Json = null | boolean | number | string | Json[] | { [key: string]: Json };\n\n/** Renders a schema as JSON Schema (draft 2020-12). */\nexport function toJsonSchema(schema: Schema): { [key: string]: Json } {\n  const described = (body: { [key: string]: Json }): { [key: string]: Json } =>\n    schema.description === undefined ? body : { description: schema.description, ...body };\n  switch (schema.type) {\n    case 'string': {\n      const body: { [key: string]: Json } = { type: schema.nullable === true ? ['string', 'null'] : 'string' };\n      if (schema.enum !== undefined) body['enum'] = [...schema.enum, ...(schema.nullable === true ? [null] : [])];\n      if (schema.minLength !== undefined) body['minLength'] = schema.minLength;\n      return described(body);\n    }\n    case 'boolean':\n      return described({ type: 'boolean' });\n    case 'integer': {\n      const body: { [key: string]: Json } = { type: 'integer' };\n      if (schema.minimum !== undefined) body['minimum'] = schema.minimum;\n      if (schema.maximum !== undefined) body['maximum'] = schema.maximum;\n      return described(body);\n    }\n    case 'array':\n      return described({ type: 'array', items: toJsonSchema(schema.items) });\n    case 'object': {\n      const properties: { [key: string]: Json } = {};\n      for (const [key, value] of Object.entries(schema.properties)) properties[key] = toJsonSchema(value);\n      const body: { [key: string]: Json } = { type: 'object', properties, additionalProperties: false };\n      if (schema.required !== undefined && schema.required.length > 0) body['required'] = [...schema.required];\n      return described(body);\n    }\n    case 'map':\n      return described({ type: 'object', additionalProperties: toJsonSchema(schema.values) });\n    case 'anyOf':\n      return described({ anyOf: schema.options.map(toJsonSchema) });\n    case 'any':\n      return described({});\n  }\n}\n"]}

package/dist/scope.d.ts

@@ -5,8 +5,9 @@
  * 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).
+ * each, and in neither brief's protections - and the witness is such a file
+ * the tree holds, or else the shortest such path the search builds, as an
+ * example (ADR-0005).
  */
 import type { Brief } from './brief.js';
 import { type Glob, type LiteralReading } from './glob.js';
@@ -29,19 +30,40 @@ export declare function scopeOf(brief: Brief, reading: Reading): Scope;
 export interface Overlap {
     readonly patterns: readonly [string, string];
     readonly witness: string;
+    /**
+     * `true` when the witness is a file the tree holds; `false` when the tree
+     * holds none both patterns match outside the protections, and the witness
+     * is an example the search built; `null` when no tree was given.
+     */
+    readonly inTree: boolean | null;
 }
 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. */
+    /** Pairs of patterns the search could not decide within its budget, and no file of the tree decides. */
     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.
+ *
+ * The search names the shortest such path, which the tree need not hold:
+ * `src/Shop/OrderService.cs` where the tree has `src/Shop/Orders/OrderService.cs`.
+ * So where the search finds a meeting, or cannot decide one, the tree's files
+ * are read, and the first both patterns match outside the protections is the
+ * witness (ADR-0005, amended 2026-09-30). A file that exists and both briefs
+ * may write settles a pair the search could not: it is a collision, proved by
+ * the file, not a guess. Where the tree holds none, the search's path stands,
+ * as an example. A pair the search proves apart has no such file, and the tree
+ * is not read for it.
+ */
+export declare function meet(a: Scope, b: Scope, budget?: number, files?: readonly string[] | null): Meeting;
+/**
+ * A witness as a reader is told it: a file of the tree by its path, and a path
+ * the search built with a word that it is an example.
  */
-export declare function meet(a: Scope, b: Scope, budget?: number): Meeting;
+export declare function witnessText(overlap: Overlap): string;
 export interface Contradiction {
     /** Affected patterns every file of which is protected: nothing of them is writable. */
     readonly covered: readonly string[];

package/dist/scope.js

@@ -5,10 +5,11 @@
  * 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).
+ * each, and in neither brief's protections - and the witness is such a file
+ * the tree holds, or else the shortest such path the search builds, as an
+ * example (ADR-0005).
  */
-import { globCovers, globWitness, parseGlob, WITNESS_BUDGET } from './glob.js';
+import { globCovers, globWitness, matchGlob, parseGlob, WITNESS_BUDGET } from './glob.js';
 /** Patterns that parse, read with one reading. */
 export function patternsOf(patterns, reading) {
     return patterns.flatMap((pattern) => {
@@ -19,26 +20,81 @@ export function patternsOf(patterns, reading) {
 export function scopeOf(brief, reading) {
     return { brief, affected: patternsOf(brief.affectedFiles, reading), protected: patternsOf(brief.protectedFiles, reading) };
 }
+const matched = new WeakMap();
+/**
+ * The files of a tree a pattern matches, in the tree's order. Found once per
+ * pattern and tree, which every pair a brief is in shares; kept or not, the
+ * answer is the same, and only the time differs.
+ */
+function matching(files, glob) {
+    let byGlob = matched.get(files);
+    if (byGlob === undefined) {
+        byGlob = new WeakMap();
+        matched.set(files, byGlob);
+    }
+    let found = byGlob.get(glob);
+    if (found === undefined) {
+        found = new Set(files.filter((file) => matchGlob(glob, file)));
+        byGlob.set(glob, found);
+    }
+    return found;
+}
+/**
+ * The first file of the tree, in its order, that both patterns match and no
+ * protection does. The engine's list is sorted, so the file named is the same
+ * on every run.
+ */
+function heldInBoth(files, x, y, avoid) {
+    const other = matching(files, y);
+    for (const file of matching(files, x)) {
+        if (other.has(file) && !avoid.some((glob) => matchGlob(glob, file)))
+            return file;
+    }
+    return undefined;
+}
 /**
  * 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.
+ *
+ * The search names the shortest such path, which the tree need not hold:
+ * `src/Shop/OrderService.cs` where the tree has `src/Shop/Orders/OrderService.cs`.
+ * So where the search finds a meeting, or cannot decide one, the tree's files
+ * are read, and the first both patterns match outside the protections is the
+ * witness (ADR-0005, amended 2026-09-30). A file that exists and both briefs
+ * may write settles a pair the search could not: it is a collision, proved by
+ * the file, not a guess. Where the tree holds none, the search's path stands,
+ * as an example. A pair the search proves apart has no such file, and the tree
+ * is not read for it.
  */
-export function meet(a, b, budget = WITNESS_BUDGET) {
+export function meet(a, b, budget = WITNESS_BUDGET, files = null) {
     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]);
+            if (witness.kind === 'none')
+                continue;
+            const patterns = [x.pattern, y.pattern];
+            const held = files === null ? undefined : heldInBoth(files, x.glob, y.glob, avoid);
+            if (held !== undefined)
+                overlaps.push({ patterns, witness: held, inTree: true });
+            else if (witness.kind === 'found')
+                overlaps.push({ patterns, witness: witness.path, inTree: files === null ? null : false });
+            else
+                undecided.push(patterns);
         }
     }
     return { overlaps, undecided };
 }
+/**
+ * A witness as a reader is told it: a file of the tree by its path, and a path
+ * the search built with a word that it is an example.
+ */
+export function witnessText(overlap) {
+    return overlap.inTree === false ? `${overlap.witness}, an example not in the tree` : overlap.witness;
+}
 /** The affected patterns a brief's own protections cover entirely. */
 export function contradictions(scope, budget = WITNESS_BUDGET) {
     const covered = [];

package/dist/scope.js.map

@@ -1 +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"]}
+{"version":3,"file":"scope.js","sourceRoot":"","sources":["../src/scope.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAGH,OAAO,EAAa,UAAU,EAAE,WAAW,EAAuB,SAAS,EAAE,SAAS,EAAE,cAAc,EAAE,MAAM,WAAW,CAAC;AAiB1H,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;AAqBD,MAAM,OAAO,GAAG,IAAI,OAAO,EAAyD,CAAC;AAErF;;;;GAIG;AACH,SAAS,QAAQ,CAAC,KAAwB,EAAE,IAAU;IACpD,IAAI,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAChC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QACvB,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAC7B,CAAC;IACD,IAAI,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC7B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/D,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAC1B,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,SAAS,UAAU,CAAC,KAAwB,EAAE,CAAO,EAAE,CAAO,EAAE,KAAsB;IACpF,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACjC,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC;QACtC,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;IACnF,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,IAAI,CAAC,CAAQ,EAAE,CAAQ,EAAE,MAAM,GAAW,cAAc,EAAE,KAAK,GAA6B,IAAI;IAC9G,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,MAAM;gBAAE,SAAS;YACtC,MAAM,QAAQ,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAU,CAAC;YACjD,MAAM,IAAI,GAAG,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACnF,IAAI,IAAI,KAAK,SAAS;gBAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;iBAC5E,IAAI,OAAO,CAAC,IAAI,KAAK,OAAO;gBAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;;gBACxH,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC;AACjC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,OAAgB;IAC1C,OAAO,OAAO,CAAC,MAAM,KAAK,KAAK,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,OAAO,8BAA8B,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC;AACvG,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 is such a file\n * the tree holds, or else the shortest such path the search builds, as an\n * example (ADR-0005).\n */\n\nimport type { Brief } from './brief.js';\nimport { type Glob, globCovers, globWitness, type LiteralReading, matchGlob, 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   * `true` when the witness is a file the tree holds; `false` when the tree\n   * holds none both patterns match outside the protections, and the witness\n   * is an example the search built; `null` when no tree was given.\n   */\n  readonly inTree: boolean | null;\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, and no file of the tree decides. */\n  readonly undecided: readonly (readonly [string, string])[];\n}\n\nconst matched = new WeakMap<readonly string[], WeakMap<Glob, ReadonlySet<string>>>();\n\n/**\n * The files of a tree a pattern matches, in the tree's order. Found once per\n * pattern and tree, which every pair a brief is in shares; kept or not, the\n * answer is the same, and only the time differs.\n */\nfunction matching(files: readonly string[], glob: Glob): ReadonlySet<string> {\n  let byGlob = matched.get(files);\n  if (byGlob === undefined) {\n    byGlob = new WeakMap();\n    matched.set(files, byGlob);\n  }\n  let found = byGlob.get(glob);\n  if (found === undefined) {\n    found = new Set(files.filter((file) => matchGlob(glob, file)));\n    byGlob.set(glob, found);\n  }\n  return found;\n}\n\n/**\n * The first file of the tree, in its order, that both patterns match and no\n * protection does. The engine's list is sorted, so the file named is the same\n * on every run.\n */\nfunction heldInBoth(files: readonly string[], x: Glob, y: Glob, avoid: readonly Glob[]): string | undefined {\n  const other = matching(files, y);\n  for (const file of matching(files, x)) {\n    if (other.has(file) && !avoid.some((glob) => matchGlob(glob, file))) return file;\n  }\n  return undefined;\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 *\n * The search names the shortest such path, which the tree need not hold:\n * `src/Shop/OrderService.cs` where the tree has `src/Shop/Orders/OrderService.cs`.\n * So where the search finds a meeting, or cannot decide one, the tree's files\n * are read, and the first both patterns match outside the protections is the\n * witness (ADR-0005, amended 2026-09-30). A file that exists and both briefs\n * may write settles a pair the search could not: it is a collision, proved by\n * the file, not a guess. Where the tree holds none, the search's path stands,\n * as an example. A pair the search proves apart has no such file, and the tree\n * is not read for it.\n */\nexport function meet(a: Scope, b: Scope, budget: number = WITNESS_BUDGET, files: readonly string[] | null = null): 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 === 'none') continue;\n      const patterns = [x.pattern, y.pattern] as const;\n      const held = files === null ? undefined : heldInBoth(files, x.glob, y.glob, avoid);\n      if (held !== undefined) overlaps.push({ patterns, witness: held, inTree: true });\n      else if (witness.kind === 'found') overlaps.push({ patterns, witness: witness.path, inTree: files === null ? null : false });\n      else undecided.push(patterns);\n    }\n  }\n  return { overlaps, undecided };\n}\n\n/**\n * A witness as a reader is told it: a file of the tree by its path, and a path\n * the search built with a word that it is an example.\n */\nexport function witnessText(overlap: Overlap): string {\n  return overlap.inTree === false ? `${overlap.witness}, an example not in the tree` : overlap.witness;\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"]}

package/dist/trigger.js

@@ -38,12 +38,68 @@ const WHEN = new Set([
  * its numbers: `2026-10-01` and `10/01/2026` are read a number at a time.
  */
 const DATE = /^(?:q[1-4]|\d+(?:st|nd|rd|th)?)$/;
-/** The runs of letters and digits, in lower case: `mid-2027` is two words, and punctuation none. */
+/**
+ * Chinese is written without spaces, so a trigger in it is one run of Han
+ * characters that says when or what: `下個月` (next month), `2026年10月`,
+ * `月結完成後` (after the month-end close). A run says only when if taking out
+ * the words and characters below leaves nothing, Traditional and Simplified
+ * alike.
+ *
+ * The words come out first, since one may hold a character that alone says
+ * nothing about time: `稍後` (later) is `稍` and `後`, and `稍` is not on the
+ * list. A word whose every character is on the list, such as `之後`, needs no
+ * entry of its own.
+ */
+const HAN_WHEN_WORDS = [
+    // A weekday, and the stretches: `星期一`, `禮拜三`, a quarter, a year, an hour, a minute.
+    ...['星期', '禮拜', '礼拜', '季度', '年度', '小時', '小时', '分鐘', '分钟'],
+    // Soon, later, one day, in the future, about.
+    ...['近期', '稍後', '稍后', '以後', '以后', '將來', '将来', '未來', '未来', '改天', '馬上', '马上', '很快', '不久', '左右'],
+];
+/**
+ * Characters that say when, and the ones that join them. `時`, `期` and `每`
+ * are not among them: `到期時` (when it expires) and `每月結算完成時` are
+ * events, and so is a trigger that starts with `當` (when).
+ */
+const HAN_WHEN_CHARACTERS = new Set([
+    // Units: year, month, day, week, quarter, a ten-day stretch, the day of the month, noon.
+    ...['年', '月', '日', '天', '週', '周', '季', '旬', '號', '号', '午'],
+    // Where in one: its start, end, middle, half.
+    ...['初', '底', '末', '中', '半'],
+    // Which one: this, next, last, the one before or after, early, late, the nth.
+    ...['今', '明', '去', '上', '下', '本', '這', '这', '次', '前', '後', '后', '早', '晚', '第', '個', '个'],
+    // How many.
+    ...['〇', '零', '一', '二', '三', '四', '五', '六', '七', '八', '九', '十', '百', '兩', '两', '幾', '几'],
+    // The words that join them: at, in, until, of.
+    ...['在', '於', '于', '到', '的', '之'],
+]);
+/** A run of Han characters, or of other letters and digits. */
+const WORD = /\p{Script=Han}+|(?:(?!\p{Script=Han})[\p{L}\p{N}])+/gu;
+/** A word is all Han or none of it, so one character says which. */
+const HAN = /\p{Script=Han}/u;
+/**
+ * The words of a trigger, in lower case: runs of letters and digits, with Han
+ * characters in runs of their own, so that `10月` is `10` and `月`. `mid-2027`
+ * is two words, and punctuation none. Read in NFKC first, so that full-width
+ * `Ｑ３` is `q3` and `２０２６` is `2026`.
+ */
 function words(text) {
-    return text.toLowerCase().match(/[\p{L}\p{N}]+/gu) ?? [];
+    return text.normalize('NFKC').toLowerCase().match(WORD) ?? [];
+}
+/** Whether a run of Han characters says only when. */
+function hanSaysWhen(run) {
+    let rest = run;
+    for (const word of HAN_WHEN_WORDS)
+        rest = rest.replaceAll(word, '');
+    return [...rest].every((character) => HAN_WHEN_CHARACTERS.has(character));
+}
+function saysWhen(word) {
+    if (HAN.test(word))
+        return hanSaysWhen(word);
+    return WHEN.has(word) || DATE.test(word);
 }
 /** Whether a trigger has a word that says what must happen, rather than only when. */
 export function namesAnEvent(trigger) {
-    return words(trigger).some((word) => !WHEN.has(word) && !DATE.test(word));
+    return words(trigger).some((word) => !saysWhen(word));
 }
 //# sourceMappingURL=trigger.js.map

package/dist/trigger.js.map

@@ -1 +1 @@
-{"version":3,"file":"trigger.js","sourceRoot":"","sources":["../src/trigger.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,MAAM,MAAM,GAAG,CAAC,SAAS,EAAE,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE,SAAS,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;AAC1I,MAAM,QAAQ,GAAG,CAAC,QAAQ,EAAE,SAAS,EAAE,WAAW,EAAE,UAAU,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;AAEhG,4CAA4C;AAC5C,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC;IACnB,GAAG,MAAM;IACT,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnC,MAAM;IACN,GAAG,QAAQ;IACX,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrC,qBAAqB;IACrB,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC;IACzG,OAAO;IACP,UAAU;IACV,MAAM;IACN,OAAO;IACP,oBAAoB;IACpB,GAAG,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,CAAC;IAC5H,4BAA4B;IAC5B,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC;CACrI,CAAC,CAAC;AAEH;;;GAGG;AACH,MAAM,IAAI,GAAG,kCAAkC,CAAC;AAEhD,oGAAoG;AACpG,SAAS,KAAK,CAAC,IAAY;IACzB,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,iBAAiB,CAAC,IAAI,EAAE,CAAC;AAC3D,CAAC;AAED,sFAAsF;AACtF,MAAM,UAAU,YAAY,CAAC,OAAe;IAC1C,OAAO,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;AAC5E,CAAC","sourcesContent":["/**\n * Whether a deferral's trigger names an event or only a time.\n *\n * Deferred work comes back when something happens: \"when the second tenant\n * signs\", \"when p95 exceeds 200 ms\". A date is not that. It passes whether or\n * not the reason for the work has arrived, and a deferral that fires on a date\n * is a reminder to look again, which the deferral itself already is. So a\n * trigger made only of words that say when - a date, a quarter, a month or a\n * weekday, a stretch of time and the small words that join them - is refused,\n * and one word that says what is enough to pass.\n *\n * The lists are deliberately short. A trigger this reads as an event when it\n * is a time is a miss, and a miss costs less here than refusing a real event\n * for looking like a date.\n */\n\nconst MONTHS = ['january', 'february', 'march', 'april', 'may', 'june', 'july', 'august', 'september', 'october', 'november', 'december'];\nconst WEEKDAYS = ['monday', 'tuesday', 'wednesday', 'thursday', 'friday', 'saturday', 'sunday'];\n\n/** Words that say when and nothing else. */\nconst WHEN = new Set([\n  ...MONTHS,\n  ...MONTHS.map((m) => m.slice(0, 3)),\n  'sept',\n  ...WEEKDAYS,\n  ...WEEKDAYS.map((d) => d.slice(0, 3)),\n  // A stretch of time.\n  ...['day', 'week', 'weekend', 'month', 'quarter', 'year', 'sprint'].flatMap((unit) => [unit, `${unit}s`]),\n  'today',\n  'tomorrow',\n  'soon',\n  'later',\n  // How many of them.\n  ...['a', 'one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight', 'nine', 'ten', 'eleven', 'twelve', 'few', 'couple'],\n  // The words that join them.\n  ...['in', 'on', 'by', 'at', 'after', 'before', 'until', 'from', 'of', 'the', 'next', 'this', 'end', 'start', 'early', 'mid', 'late'],\n]);\n\n/**\n * A number or an ordinal - `2026`, `15`, `15th` - or a quarter, `Q3`. A date is\n * its numbers: `2026-10-01` and `10/01/2026` are read a number at a time.\n */\nconst DATE = /^(?:q[1-4]|\\d+(?:st|nd|rd|th)?)$/;\n\n/** The runs of letters and digits, in lower case: `mid-2027` is two words, and punctuation none. */\nfunction words(text: string): readonly string[] {\n  return text.toLowerCase().match(/[\\p{L}\\p{N}]+/gu) ?? [];\n}\n\n/** Whether a trigger has a word that says what must happen, rather than only when. */\nexport function namesAnEvent(trigger: string): boolean {\n  return words(trigger).some((word) => !WHEN.has(word) && !DATE.test(word));\n}\n"]}
+{"version":3,"file":"trigger.js","sourceRoot":"","sources":["../src/trigger.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,MAAM,MAAM,GAAG,CAAC,SAAS,EAAE,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE,SAAS,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;AAC1I,MAAM,QAAQ,GAAG,CAAC,QAAQ,EAAE,SAAS,EAAE,WAAW,EAAE,UAAU,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;AAEhG,4CAA4C;AAC5C,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC;IACnB,GAAG,MAAM;IACT,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnC,MAAM;IACN,GAAG,QAAQ;IACX,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrC,qBAAqB;IACrB,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC;IACzG,OAAO;IACP,UAAU;IACV,MAAM;IACN,OAAO;IACP,oBAAoB;IACpB,GAAG,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,CAAC;IAC5H,4BAA4B;IAC5B,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC;CACrI,CAAC,CAAC;AAEH;;;GAGG;AACH,MAAM,IAAI,GAAG,kCAAkC,CAAC;AAEhD;;;;;;;;;;;GAWG;AACH,MAAM,cAAc,GAAsB;IACxC,oFAAoF;IACpF,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC;IACzD,8CAA8C;IAC9C,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC;CAC9F,CAAC;AAEF;;;;GAIG;AACH,MAAM,mBAAmB,GAAG,IAAI,GAAG,CAAC;IAClC,yFAAyF;IACzF,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;IAC1D,8CAA8C;IAC9C,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;IAC5B,8EAA8E;IAC9E,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;IACxF,YAAY;IACZ,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;IACxF,+CAA+C;IAC/C,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;CAClC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,MAAM,IAAI,GAAG,uDAAuD,CAAC;AAErE,oEAAoE;AACpE,MAAM,GAAG,GAAG,iBAAiB,CAAC;AAE9B;;;;;GAKG;AACH,SAAS,KAAK,CAAC,IAAY;IACzB,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;AAChE,CAAC;AAED,sDAAsD;AACtD,SAAS,WAAW,CAAC,GAAW;IAC9B,IAAI,IAAI,GAAG,GAAG,CAAC;IACf,KAAK,MAAM,IAAI,IAAI,cAAc;QAAE,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IACpE,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,mBAAmB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC;AAC5E,CAAC;AAED,SAAS,QAAQ,CAAC,IAAY;IAC5B,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,WAAW,CAAC,IAAI,CAAC,CAAC;IAC7C,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC3C,CAAC;AAED,sFAAsF;AACtF,MAAM,UAAU,YAAY,CAAC,OAAe;IAC1C,OAAO,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;AACxD,CAAC","sourcesContent":["/**\n * Whether a deferral's trigger names an event or only a time.\n *\n * Deferred work comes back when something happens: \"when the second tenant\n * signs\", \"when p95 exceeds 200 ms\". A date is not that. It passes whether or\n * not the reason for the work has arrived, and a deferral that fires on a date\n * is a reminder to look again, which the deferral itself already is. So a\n * trigger made only of words that say when - a date, a quarter, a month or a\n * weekday, a stretch of time and the small words that join them - is refused,\n * and one word that says what is enough to pass.\n *\n * The lists are deliberately short. A trigger this reads as an event when it\n * is a time is a miss, and a miss costs less here than refusing a real event\n * for looking like a date.\n */\n\nconst MONTHS = ['january', 'february', 'march', 'april', 'may', 'june', 'july', 'august', 'september', 'october', 'november', 'december'];\nconst WEEKDAYS = ['monday', 'tuesday', 'wednesday', 'thursday', 'friday', 'saturday', 'sunday'];\n\n/** Words that say when and nothing else. */\nconst WHEN = new Set([\n  ...MONTHS,\n  ...MONTHS.map((m) => m.slice(0, 3)),\n  'sept',\n  ...WEEKDAYS,\n  ...WEEKDAYS.map((d) => d.slice(0, 3)),\n  // A stretch of time.\n  ...['day', 'week', 'weekend', 'month', 'quarter', 'year', 'sprint'].flatMap((unit) => [unit, `${unit}s`]),\n  'today',\n  'tomorrow',\n  'soon',\n  'later',\n  // How many of them.\n  ...['a', 'one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight', 'nine', 'ten', 'eleven', 'twelve', 'few', 'couple'],\n  // The words that join them.\n  ...['in', 'on', 'by', 'at', 'after', 'before', 'until', 'from', 'of', 'the', 'next', 'this', 'end', 'start', 'early', 'mid', 'late'],\n]);\n\n/**\n * A number or an ordinal - `2026`, `15`, `15th` - or a quarter, `Q3`. A date is\n * its numbers: `2026-10-01` and `10/01/2026` are read a number at a time.\n */\nconst DATE = /^(?:q[1-4]|\\d+(?:st|nd|rd|th)?)$/;\n\n/**\n * Chinese is written without spaces, so a trigger in it is one run of Han\n * characters that says when or what: `下個月` (next month), `2026年10月`,\n * `月結完成後` (after the month-end close). A run says only when if taking out\n * the words and characters below leaves nothing, Traditional and Simplified\n * alike.\n *\n * The words come out first, since one may hold a character that alone says\n * nothing about time: `稍後` (later) is `稍` and `後`, and `稍` is not on the\n * list. A word whose every character is on the list, such as `之後`, needs no\n * entry of its own.\n */\nconst HAN_WHEN_WORDS: readonly string[] = [\n  // A weekday, and the stretches: `星期一`, `禮拜三`, a quarter, a year, an hour, a minute.\n  ...['星期', '禮拜', '礼拜', '季度', '年度', '小時', '小时', '分鐘', '分钟'],\n  // Soon, later, one day, in the future, about.\n  ...['近期', '稍後', '稍后', '以後', '以后', '將來', '将来', '未來', '未来', '改天', '馬上', '马上', '很快', '不久', '左右'],\n];\n\n/**\n * Characters that say when, and the ones that join them. `時`, `期` and `每`\n * are not among them: `到期時` (when it expires) and `每月結算完成時` are\n * events, and so is a trigger that starts with `當` (when).\n */\nconst HAN_WHEN_CHARACTERS = new Set([\n  // Units: year, month, day, week, quarter, a ten-day stretch, the day of the month, noon.\n  ...['年', '月', '日', '天', '週', '周', '季', '旬', '號', '号', '午'],\n  // Where in one: its start, end, middle, half.\n  ...['初', '底', '末', '中', '半'],\n  // Which one: this, next, last, the one before or after, early, late, the nth.\n  ...['今', '明', '去', '上', '下', '本', '這', '这', '次', '前', '後', '后', '早', '晚', '第', '個', '个'],\n  // How many.\n  ...['〇', '零', '一', '二', '三', '四', '五', '六', '七', '八', '九', '十', '百', '兩', '两', '幾', '几'],\n  // The words that join them: at, in, until, of.\n  ...['在', '於', '于', '到', '的', '之'],\n]);\n\n/** A run of Han characters, or of other letters and digits. */\nconst WORD = /\\p{Script=Han}+|(?:(?!\\p{Script=Han})[\\p{L}\\p{N}])+/gu;\n\n/** A word is all Han or none of it, so one character says which. */\nconst HAN = /\\p{Script=Han}/u;\n\n/**\n * The words of a trigger, in lower case: runs of letters and digits, with Han\n * characters in runs of their own, so that `10月` is `10` and `月`. `mid-2027`\n * is two words, and punctuation none. Read in NFKC first, so that full-width\n * `Ｑ３` is `q3` and `２０２６` is `2026`.\n */\nfunction words(text: string): readonly string[] {\n  return text.normalize('NFKC').toLowerCase().match(WORD) ?? [];\n}\n\n/** Whether a run of Han characters says only when. */\nfunction hanSaysWhen(run: string): boolean {\n  let rest = run;\n  for (const word of HAN_WHEN_WORDS) rest = rest.replaceAll(word, '');\n  return [...rest].every((character) => HAN_WHEN_CHARACTERS.has(character));\n}\n\nfunction saysWhen(word: string): boolean {\n  if (HAN.test(word)) return hanSaysWhen(word);\n  return WHEN.has(word) || DATE.test(word);\n}\n\n/** Whether a trigger has a word that says what must happen, rather than only when. */\nexport function namesAnEvent(trigger: string): boolean {\n  return words(trigger).some((word) => !saysWhen(word));\n}\n"]}

package/dist/types.d.ts

@@ -36,4 +36,13 @@ export interface Finding {
     readonly path?: string | undefined;
     /** The paths of a finding about several, such as the files a round changed outside its scope. */
     readonly paths?: readonly string[] | undefined;
+    /**
+     * What the finding is about within its brief, where a rule can report more
+     * than one thing there: a section, a pattern, a dependency, the other brief
+     * of a pair. With the rule, the file and the brief it is the finding's
+     * identity, which the GitLab fingerprint is built from, so it holds no
+     * count, no witness and nothing else a message says that can change while
+     * the problem stays.
+     */
+    readonly subject?: string | undefined;
 }

package/dist/types.js.map

@@ -1 +1 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA;;GAEG","sourcesContent":["/**\n * Types shared across the pipeline. Type-only: this module compiles to nothing.\n */\n\nexport type Severity = 'error' | 'warning' | 'note';\n\n/** A severity as configuration spells it, where `off` silences a rule. */\nexport type SeveritySetting = Severity | 'off';\n\n/** Where a brief lives. Location is the authority on whether a brief is archived. */\nexport type Phase = 'live' | 'archived';\n\n/**\n * The lifecycle a brief moves through. `draft` and `deferred` are optional: a\n * repository that never writes one maps no word to it. A deferred brief waits\n * in the live directory for an event its `trigger` names, and runs in no wave\n * until then. There is no persisted \"archiving\" state; archival is a\n * transaction, and a transaction that stops half-way is rolled back rather\n * than recorded.\n */\nexport type Status = 'draft' | 'active' | 'deferred' | 'archived';\n\n/**\n * One problem, located. Lines are 1-based; a finding about a file as a whole\n * points at line 1.\n */\nexport interface Finding {\n  readonly rule: string;\n  readonly severity: Severity;\n  readonly message: string;\n  /** Repository-relative POSIX path. */\n  readonly file: string;\n  readonly line: number;\n  readonly brief?: string | undefined;\n  /** The concrete next action, where there is one. */\n  readonly hint?: string | undefined;\n  /**\n   * The one repository path a finding is about, where it is about one: a\n   * protected file the round changed is one finding per file, and names it.\n   */\n  readonly path?: string | undefined;\n  /** The paths of a finding about several, such as the files a round changed outside its scope. */\n  readonly paths?: readonly string[] | undefined;\n}\n"]}
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA;;GAEG","sourcesContent":["/**\n * Types shared across the pipeline. Type-only: this module compiles to nothing.\n */\n\nexport type Severity = 'error' | 'warning' | 'note';\n\n/** A severity as configuration spells it, where `off` silences a rule. */\nexport type SeveritySetting = Severity | 'off';\n\n/** Where a brief lives. Location is the authority on whether a brief is archived. */\nexport type Phase = 'live' | 'archived';\n\n/**\n * The lifecycle a brief moves through. `draft` and `deferred` are optional: a\n * repository that never writes one maps no word to it. A deferred brief waits\n * in the live directory for an event its `trigger` names, and runs in no wave\n * until then. There is no persisted \"archiving\" state; archival is a\n * transaction, and a transaction that stops half-way is rolled back rather\n * than recorded.\n */\nexport type Status = 'draft' | 'active' | 'deferred' | 'archived';\n\n/**\n * One problem, located. Lines are 1-based; a finding about a file as a whole\n * points at line 1.\n */\nexport interface Finding {\n  readonly rule: string;\n  readonly severity: Severity;\n  readonly message: string;\n  /** Repository-relative POSIX path. */\n  readonly file: string;\n  readonly line: number;\n  readonly brief?: string | undefined;\n  /** The concrete next action, where there is one. */\n  readonly hint?: string | undefined;\n  /**\n   * The one repository path a finding is about, where it is about one: a\n   * protected file the round changed is one finding per file, and names it.\n   */\n  readonly path?: string | undefined;\n  /** The paths of a finding about several, such as the files a round changed outside its scope. */\n  readonly paths?: readonly string[] | undefined;\n  /**\n   * What the finding is about within its brief, where a rule can report more\n   * than one thing there: a section, a pattern, a dependency, the other brief\n   * of a pair. With the rule, the file and the brief it is the finding's\n   * identity, which the GitLab fingerprint is built from, so it holds no\n   * count, no witness and nothing else a message says that can change while\n   * the problem stays.\n   */\n  readonly subject?: string | undefined;\n}\n"]}

package/dist/vendor/spec-core/markdown/frontmatter.d.ts

@@ -87,7 +87,17 @@ export declare function readFrontMatter(source: string, options?: ReadOptions):
 export declare function parseInline(text: string): YamlValue;
 /** Null in the YAML 1.2 core schema: empty, `~` or `null` in any of its three spellings. */
 export declare function isNull(scalar: YamlScalar): boolean;
-/** Renders a string as a scalar that reads back as the same string. */
+/**
+ * Renders a string as a scalar that reads back as the same string.
+ *
+ * Plain only as a YAML plain scalar that reads back as itself: a letter
+ * first, of any script, then letters, marks, digits, spaces and `._/+-` - so
+ * a status of `封存` or `已接受` is written as it is typed - with no space at
+ * the end, and none of `true`, `false`, `null`, `yes`, `no`, `on`, `off` or
+ * `~` in any case, which YAML 1.2 or 1.1 reads as a boolean or a null.
+ * Anything else is quoted: an indicator, `: ` or ` #`, a number, a space at
+ * either end, a full-width space or punctuation.
+ */
 export declare function renderScalar(value: string): string;
 export declare function findEntry(frontMatter: FrontMatter | null, key: string): FrontMatterEntry | undefined;
 /**

package/dist/vendor/spec-core/markdown/frontmatter.js

@@ -30,7 +30,14 @@ export function frontMatterKind(firstLine) {
 export function frontMatterCloses(line, kind) {
     return (kind === 'yaml' ? YAML_CLOSE : TOML_FENCE).test(line);
 }
-const KEY = /^([A-Za-z_][\w.-]*)[ \t]*:(?:[ \t]+(.*))?$/;
+/**
+ * A key and what follows its colon. A key is a word of any script, as a YAML
+ * plain key may be: a letter or `_` first, then letters, marks, digits and
+ * `_.-`, so `狀態` and `状态` are keys as `status` is. Nothing else is one: a
+ * digit or a mark first, a space, punctuation, and a full-width colon, which
+ * YAML does not read as one.
+ */
+const KEY = /^([\p{L}_][\p{L}\p{M}\p{N}_.-]*)[ \t]*:(?:[ \t]+(.*))?$/u;
 const SEQUENCE_ITEM = /^([ \t]*)-(?:[ \t]+(.*))?$/;
 const BLANK_OR_COMMENT = /^[ \t]*(?:#.*)?$/;
 export function keyName(key) {
@@ -415,10 +422,20 @@ function parseFlowSequence(text) {
 export function isNull(scalar) {
     return !scalar.quoted && ['', '~', 'null', 'Null', 'NULL'].includes(scalar.text);
 }
-/** Renders a string as a scalar that reads back as the same string. */
+/**
+ * Renders a string as a scalar that reads back as the same string.
+ *
+ * Plain only as a YAML plain scalar that reads back as itself: a letter
+ * first, of any script, then letters, marks, digits, spaces and `._/+-` - so
+ * a status of `封存` or `已接受` is written as it is typed - with no space at
+ * the end, and none of `true`, `false`, `null`, `yes`, `no`, `on`, `off` or
+ * `~` in any case, which YAML 1.2 or 1.1 reads as a boolean or a null.
+ * Anything else is quoted: an indicator, `: ` or ` #`, a number, a space at
+ * either end, a full-width space or punctuation.
+ */
 export function renderScalar(value) {
     const reserved = /^(?:true|false|null|yes|no|on|off|~)$/i.test(value);
-    const plain = /^[A-Za-z][A-Za-z0-9 ._/+-]*$/.test(value) && !value.endsWith(' ');
+    const plain = /^\p{L}[\p{L}\p{M}\p{N} ._/+-]*$/u.test(value) && !value.endsWith(' ');
     return plain && !reserved ? value : JSON.stringify(value);
 }
 export function findEntry(frontMatter, key) {