@koda-sl/baker-cli 0.465.0 → 0.467.0

package/dist/chunk-F3FSD6BO.js

@@ -0,0 +1,96 @@
+import {
+  ApiError,
+  apiGet,
+  apiPost
+} from "./chunk-KB5XJHQX.js";
+
+// src/commands/images/api.ts
+import { readFile } from "fs/promises";
+import { basename, extname } from "path";
+var imageProcessingTimeoutMs = 18e4;
+var imageReadyPollIntervalMs = 2e3;
+var mimeMap = {
+  ".png": "image/png",
+  ".jpg": "image/jpeg",
+  ".jpeg": "image/jpeg",
+  ".gif": "image/gif",
+  ".webp": "image/webp",
+  ".svg": "image/svg+xml",
+  ".avif": "image/avif"
+};
+var defaultImageApiDeps = {
+  readFile,
+  post: apiPost,
+  get: apiGet,
+  sleep: (ms) => new Promise((resolve) => setTimeout(resolve, ms))
+};
+function detectImageContentType(filePath, opts = {}) {
+  const ext = extname(filePath).toLowerCase();
+  const contentType = mimeMap[ext];
+  if (!contentType || opts.allowedContentTypes && !opts.allowedContentTypes.includes(contentType)) {
+    throw new ApiError(
+      "VALIDATION_ERROR",
+      opts.unsupportedMessage ?? `Cannot detect content type for extension "${ext}". Use --content-type.`
+    );
+  }
+  return contentType;
+}
+async function uploadLocalImage(args, deps = defaultImageApiDeps) {
+  return uploadImageBytes(
+    {
+      bytes: await deps.readFile(args.file),
+      contentType: args.contentType,
+      // Only the bytes used to be sent, so "iso27001-badge.png" arrived as an
+      // anonymous blob. The describe pass treats this as a hint, not gospel.
+      originalFilename: basename(args.file),
+      source: args.source,
+      descriptionContext: args.descriptionContext
+    },
+    deps
+  );
+}
+function uploadImageBytes(args, deps = defaultImageApiDeps) {
+  const body = {
+    base64: args.bytes.toString("base64"),
+    contentType: args.contentType,
+    originalFilename: args.originalFilename
+  };
+  if (args.source) body.source = args.source;
+  if (args.descriptionContext) body.descriptionContext = args.descriptionContext;
+  return deps.post("/api/images/upload", body, { timeoutMs: imageProcessingTimeoutMs });
+}
+function getImage(deps, imageId) {
+  return deps.get("/api/images/get", { id: imageId });
+}
+function publishImageAsCreative(deps, args) {
+  return deps.post("/api/creatives/publish", args);
+}
+async function waitForReadyImage(deps, imageId, opts = {}) {
+  const timeoutMs = opts.timeoutMs ?? imageProcessingTimeoutMs;
+  const pollIntervalMs = opts.pollIntervalMs ?? imageReadyPollIntervalMs;
+  const deadline = Date.now() + timeoutMs;
+  let lastStatus = "unknown";
+  while (Date.now() <= deadline) {
+    const image = await getImage(deps, imageId);
+    lastStatus = image.status;
+    if (image.status === "ready") {
+      return image;
+    }
+    if (image.status === "error") {
+      throw new ApiError("IMAGE_PROCESSING_ERROR", "Image processing failed");
+    }
+    await deps.sleep(pollIntervalMs);
+  }
+  throw new ApiError("TIMEOUT", `Image was not ready before timeout; last status: ${lastStatus}`);
+}
+
+export {
+  imageProcessingTimeoutMs,
+  defaultImageApiDeps,
+  detectImageContentType,
+  uploadLocalImage,
+  uploadImageBytes,
+  publishImageAsCreative,
+  waitForReadyImage
+};
+//# sourceMappingURL=chunk-F3FSD6BO.js.map

package/dist/chunk-F5XU546T.js

@@ -0,0 +1,23 @@
+import {
+  creativesRunResponseSchema
+} from "./chunk-WXC3I4CT.js";
+import {
+  ApiError,
+  apiPost
+} from "./chunk-KB5XJHQX.js";
+
+// src/commands/canvas/run-history.ts
+async function fetchRunRecord(runId, post = apiPost) {
+  try {
+    const response = await post("/api/creatives/run", { runId });
+    return creativesRunResponseSchema.parse(response).data;
+  } catch (e) {
+    if (e instanceof ApiError && e.code === "NOT_FOUND") return null;
+    throw e;
+  }
+}
+
+export {
+  fetchRunRecord
+};
+//# sourceMappingURL=chunk-F5XU546T.js.map

package/dist/chunk-G3KO2HFZ.js

@@ -0,0 +1,35 @@
+import {
+  ApiError
+} from "./chunk-KB5XJHQX.js";
+import {
+  writeJson
+} from "./chunk-4DM6OAQ6.js";
+
+// src/commands/winning-ads/shared.ts
+function splitList(value) {
+  if (!value) {
+    return [];
+  }
+  return value.split(",").map((v) => v.trim()).filter(Boolean);
+}
+function reportError(err) {
+  if (err instanceof ApiError) {
+    writeJson({ ok: false, error: { code: err.code, message: err.message } });
+    process.exit(1);
+  }
+  writeJson({ ok: false, error: { code: "INTERNAL_ERROR", message: "Unexpected error" } });
+  process.exit(1);
+}
+var PLATFORM_NAMES = {
+  meta: "Meta",
+  linkedin: "LinkedIn",
+  tiktok: "TikTok",
+  google: "Google Ads"
+};
+
+export {
+  splitList,
+  reportError,
+  PLATFORM_NAMES
+};
+//# sourceMappingURL=chunk-G3KO2HFZ.js.map

package/dist/chunk-GIWHHCD6.js

@@ -0,0 +1,145 @@
+// ../api/src/decide.ts
+import { z } from "zod";
+var DECIDE_MAX_QUESTIONS = 2e3;
+var DECIDE_MAX_NAMED_QUESTIONS = 40;
+var DECIDE_MAX_ITEMS = 500;
+var DECIDE_MAX_ITEM_CHARS = 4e3;
+var DECIDE_MAX_STATE_CHARS = 5e4;
+var DECIDE_MAX_OPTIONS = 255;
+var DECIDE_MAX_REQUEST_CHARS = 6e4;
+var LIMIT = { decideLimit: true };
+var questionText = z.string().trim().min(1, "a question cannot be empty").max(1e3);
+var optionKey = z.string().regex(/^[A-Za-z0-9][A-Za-z0-9_-]{0,63}$/, "option keys are short slugs: letters, digits, - and _");
+var decideQuestionSchema = z.discriminatedUnion("type", [
+  z.object({ type: z.literal("noul"), question: questionText }),
+  z.object({
+    type: z.literal("choice"),
+    question: questionText,
+    /** Option key → what it means, in words. Jev picks exactly one. */
+    options: z.record(optionKey, z.string().trim().min(1).max(300)).refine((options) => Object.keys(options).length >= 2, "a choice needs at least 2 options").refine(
+      (options) => Object.keys(options).length <= DECIDE_MAX_OPTIONS,
+      `a choice takes at most ${DECIDE_MAX_OPTIONS} options`
+    )
+  }),
+  z.object({
+    type: z.literal("score"),
+    question: questionText,
+    /** The levels in words, lowest first. */
+    levels: z.array(z.string().trim().min(1).max(300)).min(2).max(10).refine((levels) => new Set(levels).size === levels.length, "a score's levels must be different")
+  })
+]);
+var questionName = z.string().regex(/^[A-Za-z][A-Za-z0-9_]{0,47}$/, "question names are identifiers: a letter, then letters, digits or _");
+var jsonChars = (value) => JSON.stringify(value)?.length ?? 0;
+function decideQuestionChars(question, item) {
+  return jsonChars(item === void 0 ? question : { item, ...question });
+}
+var decideItemSchema = z.object({
+  id: z.string().trim().min(1).max(200),
+  /** The item's words, or its named fields (`{ "angle": "…", "summary": "…" }`). Text only. */
+  text: z.union([z.string().trim().min(1), z.record(z.string(), z.unknown())])
+}).superRefine((item, ctx) => {
+  const chars = jsonChars(item.text);
+  if (chars > DECIDE_MAX_ITEM_CHARS) {
+    ctx.addIssue({
+      code: "custom",
+      params: LIMIT,
+      path: ["text"],
+      message: `item "${item.id}" is ${chars} characters; one item takes at most ${DECIDE_MAX_ITEM_CHARS}`
+    });
+  }
+});
+var decideRequestSchema = z.object({
+  questions: z.record(questionName, decideQuestionSchema).refine((questions) => Object.keys(questions).length >= 1, "ask at least one question").refine((questions) => Object.keys(questions).length <= DECIDE_MAX_NAMED_QUESTIONS, {
+    message: `at most ${DECIDE_MAX_NAMED_QUESTIONS} named questions per call`,
+    params: LIMIT
+  }),
+  /** What every question reads beside its item (or on its own, with no items). */
+  state: z.union([z.string(), z.record(z.string(), z.unknown()), z.array(z.unknown())]).refine((state) => jsonChars(state) <= DECIDE_MAX_STATE_CHARS, {
+    message: `state is longer than ${DECIDE_MAX_STATE_CHARS} characters`,
+    params: LIMIT
+  }).optional(),
+  items: z.array(decideItemSchema).min(1).max(DECIDE_MAX_ITEMS).optional(),
+  /** Every option's probability on Choices and Scores, not only the pick's. */
+  full: z.boolean().default(false)
+}).superRefine((request, ctx) => {
+  const ids = /* @__PURE__ */ new Set();
+  for (const [index, item] of (request.items ?? []).entries()) {
+    if (ids.has(item.id)) {
+      ctx.addIssue({ code: "custom", path: ["items", index, "id"], message: `item id "${item.id}" appears twice` });
+      return;
+    }
+    ids.add(item.id);
+  }
+  const asked = Object.keys(request.questions).length * (request.items?.length ?? 1);
+  if (asked > DECIDE_MAX_QUESTIONS) {
+    ctx.addIssue({
+      code: "custom",
+      params: LIMIT,
+      path: ["items"],
+      message: `this call asks ${asked} questions (items \xD7 named questions); one call asks at most ${DECIDE_MAX_QUESTIONS}`
+    });
+    return;
+  }
+  const questions = Object.values(request.questions);
+  const stateChars = request.state === void 0 ? 0 : jsonChars(request.state);
+  const subjects = request.items ? request.items.map((item, index) => ({ id: item.id, text: item.text, index })) : [{ id: null }];
+  for (const subject of subjects) {
+    const chars = stateChars + questions.reduce((total, question) => total + decideQuestionChars(question, subject.text), 0);
+    if (chars <= DECIDE_MAX_REQUEST_CHARS) continue;
+    const what = subject.id === null ? "the questions" : `item "${subject.id}" with its ${questions.length} questions`;
+    ctx.addIssue({
+      code: "custom",
+      params: LIMIT,
+      path: subject.index === void 0 ? ["state"] : ["items", subject.index, "text"],
+      message: `${what} and the state come to ${chars} characters, and one request carries at most ${DECIDE_MAX_REQUEST_CHARS}: ask fewer questions per call, shorten the state, or trim the item`
+    });
+    return;
+  }
+});
+function isDecideLimitIssue(issue) {
+  if (issue.code === "too_big" && issue.path.length === 1 && issue.path[0] === "items") return true;
+  return issue.code === "custom" && issue.params?.decideLimit === true;
+}
+var probabilities = z.record(z.string(), z.number());
+var decideAnswerSchema = z.union([
+  z.object({ noul: z.number() }),
+  z.object({
+    choice: z.string(),
+    /** The pick's own probability. */
+    probability: z.number(),
+    /** How concentrated the distribution is; low means torn between options. */
+    confidence: z.number(),
+    probabilities: probabilities.optional()
+  }),
+  z.object({
+    /** The probability-weighted level, 0 = the first level; can land between levels. */
+    score: z.number(),
+    /** The level `score` rounds to, in words. */
+    level: z.string(),
+    confidence: z.number(),
+    probabilities: probabilities.optional()
+  })
+]);
+var answersByName = z.record(z.string(), decideAnswerSchema);
+var decideResponseSchema = z.object({
+  model: z.string(),
+  /** With no items: each named question's answer about `state`. */
+  answers: answersByName.optional(),
+  /** With items: each item's answers, in the order sent; `null` when Jev did not answer that item. */
+  items: z.array(z.object({ id: z.string(), answers: answersByName.nullable() })).optional(),
+  /** Ids of the items Jev did not answer (their request failed); the rest stand. */
+  unanswered: z.array(z.string()),
+  /** Jev requests the call was packed into (sent at once). */
+  requests: z.number(),
+  costUsd: z.number()
+});
+
+export {
+  DECIDE_MAX_QUESTIONS,
+  DECIDE_MAX_ITEMS,
+  DECIDE_MAX_ITEM_CHARS,
+  DECIDE_MAX_REQUEST_CHARS,
+  decideRequestSchema,
+  isDecideLimitIssue
+};
+//# sourceMappingURL=chunk-GIWHHCD6.js.map

package/dist/chunk-GIWHHCD6.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../api/src/decide.ts"],"sourcesContent":["/**\n * `baker decide` — the wire contract for asking Jev (the decision model, see\n * docs/decision-model.md) typed questions about text and getting typed answers\n * back: a yes/no probability (Noul), one option of a set (Choice), or a level\n * on a scale (Score).\n *\n * Named questions are asked once about `state`, or — with `items` — once about\n * every item, each item inside its own question's instructions. The backend\n * packs the questions into as few Jev requests as fit and sends them at once.\n * Read-only: it decides, it never writes or generates anything.\n */\nimport { z } from \"zod\";\n\n/** Items × named questions in one call. Past it, split the items across calls. */\nexport const DECIDE_MAX_QUESTIONS = 2000;\nexport const DECIDE_MAX_NAMED_QUESTIONS = 40;\nexport const DECIDE_MAX_ITEMS = 500;\n/** One item's text (or its fields, as JSON). An ad's summary, angle and copy fit well within it. */\nexport const DECIDE_MAX_ITEM_CHARS = 4000;\n/** The shared `state`, as JSON. It goes in every request, so it leaves room there for the questions. */\nexport const DECIDE_MAX_STATE_CHARS = 50_000;\nexport const DECIDE_MAX_OPTIONS = 255;\n/** What one Jev request carries — the state and every question in it, items inside — under Jev's 32k-token context. */\nexport const DECIDE_MAX_REQUEST_CHARS = 60_000;\n\n/** Marks an issue a smaller call fixes (fewer items or questions, a shorter item or state), not a wrong one. */\nconst LIMIT = { decideLimit: true };\n\nconst questionText = z.string().trim().min(1, \"a question cannot be empty\").max(1000);\nconst optionKey = z\n  .string()\n  .regex(/^[A-Za-z0-9][A-Za-z0-9_-]{0,63}$/, \"option keys are short slugs: letters, digits, - and _\");\n\nconst decideQuestionSchema = z.discriminatedUnion(\"type\", [\n  z.object({ type: z.literal(\"noul\"), question: questionText }),\n  z.object({\n    type: z.literal(\"choice\"),\n    question: questionText,\n    /** Option key → what it means, in words. Jev picks exactly one. */\n    options: z\n      .record(optionKey, z.string().trim().min(1).max(300))\n      .refine((options) => Object.keys(options).length >= 2, \"a choice needs at least 2 options\")\n      .refine(\n        (options) => Object.keys(options).length <= DECIDE_MAX_OPTIONS,\n        `a choice takes at most ${DECIDE_MAX_OPTIONS} options`,\n      ),\n  }),\n  z.object({\n    type: z.literal(\"score\"),\n    question: questionText,\n    /** The levels in words, lowest first. */\n    levels: z\n      .array(z.string().trim().min(1).max(300))\n      .min(2)\n      .max(10)\n      .refine((levels) => new Set(levels).size === levels.length, \"a score's levels must be different\"),\n  }),\n]);\n\nexport type DecideQuestion = z.infer<typeof decideQuestionSchema>;\n\nconst questionName = z\n  .string()\n  .regex(/^[A-Za-z][A-Za-z0-9_]{0,47}$/, \"question names are identifiers: a letter, then letters, digits or _\");\n\nconst jsonChars = (value: unknown) => JSON.stringify(value)?.length ?? 0;\n\n/** One named question as one request carries it, with the item it is asked about. The budget `DECIDE_MAX_REQUEST_CHARS` counts. */\nexport function decideQuestionChars(question: DecideQuestion, item?: unknown): number {\n  return jsonChars(item === undefined ? question : { item, ...question });\n}\n\nconst decideItemSchema = z\n  .object({\n    id: z.string().trim().min(1).max(200),\n    /** The item's words, or its named fields (`{ \"angle\": \"…\", \"summary\": \"…\" }`). Text only. */\n    text: z.union([z.string().trim().min(1), z.record(z.string(), z.unknown())]),\n  })\n  .superRefine((item, ctx) => {\n    const chars = jsonChars(item.text);\n    if (chars > DECIDE_MAX_ITEM_CHARS) {\n      ctx.addIssue({\n        code: \"custom\",\n        params: LIMIT,\n        path: [\"text\"],\n        message: `item \"${item.id}\" is ${chars} characters; one item takes at most ${DECIDE_MAX_ITEM_CHARS}`,\n      });\n    }\n  });\n\nexport type DecideItem = z.infer<typeof decideItemSchema>;\n\nexport const decideRequestSchema = z\n  .object({\n    questions: z\n      .record(questionName, decideQuestionSchema)\n      .refine((questions) => Object.keys(questions).length >= 1, \"ask at least one question\")\n      .refine((questions) => Object.keys(questions).length <= DECIDE_MAX_NAMED_QUESTIONS, {\n        message: `at most ${DECIDE_MAX_NAMED_QUESTIONS} named questions per call`,\n        params: LIMIT,\n      }),\n    /** What every question reads beside its item (or on its own, with no items). */\n    state: z\n      .union([z.string(), z.record(z.string(), z.unknown()), z.array(z.unknown())])\n      .refine((state) => jsonChars(state) <= DECIDE_MAX_STATE_CHARS, {\n        message: `state is longer than ${DECIDE_MAX_STATE_CHARS} characters`,\n        params: LIMIT,\n      })\n      .optional(),\n    items: z.array(decideItemSchema).min(1).max(DECIDE_MAX_ITEMS).optional(),\n    /** Every option's probability on Choices and Scores, not only the pick's. */\n    full: z.boolean().default(false),\n  })\n  .superRefine((request, ctx) => {\n    const ids = new Set<string>();\n    for (const [index, item] of (request.items ?? []).entries()) {\n      if (ids.has(item.id)) {\n        ctx.addIssue({ code: \"custom\", path: [\"items\", index, \"id\"], message: `item id \"${item.id}\" appears twice` });\n        return;\n      }\n      ids.add(item.id);\n    }\n    const asked = Object.keys(request.questions).length * (request.items?.length ?? 1);\n    if (asked > DECIDE_MAX_QUESTIONS) {\n      ctx.addIssue({\n        code: \"custom\",\n        params: LIMIT,\n        path: [\"items\"],\n        message: `this call asks ${asked} questions (items × named questions); one call asks at most ${DECIDE_MAX_QUESTIONS}`,\n      });\n      return;\n    }\n    // Every question about one item goes in one request, beside the whole state: past the budget, no request can carry it.\n    const questions = Object.values(request.questions);\n    const stateChars = request.state === undefined ? 0 : jsonChars(request.state);\n    const subjects: { id: string | null; text?: unknown; index?: number }[] = request.items\n      ? request.items.map((item, index) => ({ id: item.id, text: item.text, index }))\n      : [{ id: null }];\n    for (const subject of subjects) {\n      const chars =\n        stateChars + questions.reduce((total, question) => total + decideQuestionChars(question, subject.text), 0);\n      if (chars <= DECIDE_MAX_REQUEST_CHARS) continue;\n      const what =\n        subject.id === null ? \"the questions\" : `item \"${subject.id}\" with its ${questions.length} questions`;\n      ctx.addIssue({\n        code: \"custom\",\n        params: LIMIT,\n        path: subject.index === undefined ? [\"state\"] : [\"items\", subject.index, \"text\"],\n        message: `${what} and the state come to ${chars} characters, and one request carries at most ${DECIDE_MAX_REQUEST_CHARS}: ask fewer questions per call, shorten the state, or trim the item`,\n      });\n      return;\n    }\n  });\n\n/** Whether a refusal is a size limit, which a smaller call fixes, rather than input that is wrong. */\nexport function isDecideLimitIssue(issue: z.core.$ZodIssue): boolean {\n  if (issue.code === \"too_big\" && issue.path.length === 1 && issue.path[0] === \"items\") return true;\n  return issue.code === \"custom\" && issue.params?.decideLimit === true;\n}\n\nexport type DecideRequest = z.input<typeof decideRequestSchema>;\nexport type DecideRequestParsed = z.output<typeof decideRequestSchema>;\n\nconst probabilities = z.record(z.string(), z.number());\n\nexport const decideAnswerSchema = z.union([\n  z.object({ noul: z.number() }),\n  z.object({\n    choice: z.string(),\n    /** The pick's own probability. */\n    probability: z.number(),\n    /** How concentrated the distribution is; low means torn between options. */\n    confidence: z.number(),\n    probabilities: probabilities.optional(),\n  }),\n  z.object({\n    /** The probability-weighted level, 0 = the first level; can land between levels. */\n    score: z.number(),\n    /** The level `score` rounds to, in words. */\n    level: z.string(),\n    confidence: z.number(),\n    probabilities: probabilities.optional(),\n  }),\n]);\n\nexport type DecideAnswer = z.infer<typeof decideAnswerSchema>;\n\nconst answersByName = z.record(z.string(), decideAnswerSchema);\n\nexport const decideResponseSchema = z.object({\n  model: z.string(),\n  /** With no items: each named question's answer about `state`. */\n  answers: answersByName.optional(),\n  /** With items: each item's answers, in the order sent; `null` when Jev did not answer that item. */\n  items: z.array(z.object({ id: z.string(), answers: answersByName.nullable() })).optional(),\n  /** Ids of the items Jev did not answer (their request failed); the rest stand. */\n  unanswered: z.array(z.string()),\n  /** Jev requests the call was packed into (sent at once). */\n  requests: z.number(),\n  costUsd: z.number(),\n});\n\nexport type DecideResponse = z.infer<typeof decideResponseSchema>;\n"],"mappings":";AAWA,SAAS,SAAS;AAGX,IAAM,uBAAuB;AAC7B,IAAM,6BAA6B;AACnC,IAAM,mBAAmB;AAEzB,IAAM,wBAAwB;AAE9B,IAAM,yBAAyB;AAC/B,IAAM,qBAAqB;AAE3B,IAAM,2BAA2B;AAGxC,IAAM,QAAQ,EAAE,aAAa,KAAK;AAElC,IAAM,eAAe,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,4BAA4B,EAAE,IAAI,GAAI;AACpF,IAAM,YAAY,EACf,OAAO,EACP,MAAM,oCAAoC,uDAAuD;AAEpG,IAAM,uBAAuB,EAAE,mBAAmB,QAAQ;AAAA,EACxD,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,MAAM,GAAG,UAAU,aAAa,CAAC;AAAA,EAC5D,EAAE,OAAO;AAAA,IACP,MAAM,EAAE,QAAQ,QAAQ;AAAA,IACxB,UAAU;AAAA;AAAA,IAEV,SAAS,EACN,OAAO,WAAW,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,CAAC,EACnD,OAAO,CAAC,YAAY,OAAO,KAAK,OAAO,EAAE,UAAU,GAAG,mCAAmC,EACzF;AAAA,MACC,CAAC,YAAY,OAAO,KAAK,OAAO,EAAE,UAAU;AAAA,MAC5C,0BAA0B,kBAAkB;AAAA,IAC9C;AAAA,EACJ,CAAC;AAAA,EACD,EAAE,OAAO;AAAA,IACP,MAAM,EAAE,QAAQ,OAAO;AAAA,IACvB,UAAU;AAAA;AAAA,IAEV,QAAQ,EACL,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,CAAC,EACvC,IAAI,CAAC,EACL,IAAI,EAAE,EACN,OAAO,CAAC,WAAW,IAAI,IAAI,MAAM,EAAE,SAAS,OAAO,QAAQ,oCAAoC;AAAA,EACpG,CAAC;AACH,CAAC;AAID,IAAM,eAAe,EAClB,OAAO,EACP,MAAM,gCAAgC,qEAAqE;AAE9G,IAAM,YAAY,CAAC,UAAmB,KAAK,UAAU,KAAK,GAAG,UAAU;AAGhE,SAAS,oBAAoB,UAA0B,MAAwB;AACpF,SAAO,UAAU,SAAS,SAAY,WAAW,EAAE,MAAM,GAAG,SAAS,CAAC;AACxE;AAEA,IAAM,mBAAmB,EACtB,OAAO;AAAA,EACN,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG;AAAA;AAAA,EAEpC,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC;AAC7E,CAAC,EACA,YAAY,CAAC,MAAM,QAAQ;AAC1B,QAAM,QAAQ,UAAU,KAAK,IAAI;AACjC,MAAI,QAAQ,uBAAuB;AACjC,QAAI,SAAS;AAAA,MACX,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,MAAM,CAAC,MAAM;AAAA,MACb,SAAS,SAAS,KAAK,EAAE,QAAQ,KAAK,uCAAuC,qBAAqB;AAAA,IACpG,CAAC;AAAA,EACH;AACF,CAAC;AAII,IAAM,sBAAsB,EAChC,OAAO;AAAA,EACN,WAAW,EACR,OAAO,cAAc,oBAAoB,EACzC,OAAO,CAAC,cAAc,OAAO,KAAK,SAAS,EAAE,UAAU,GAAG,2BAA2B,EACrF,OAAO,CAAC,cAAc,OAAO,KAAK,SAAS,EAAE,UAAU,4BAA4B;AAAA,IAClF,SAAS,WAAW,0BAA0B;AAAA,IAC9C,QAAQ;AAAA,EACV,CAAC;AAAA;AAAA,EAEH,OAAO,EACJ,MAAM,CAAC,EAAE,OAAO,GAAG,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,QAAQ,CAAC,GAAG,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,EAC3E,OAAO,CAAC,UAAU,UAAU,KAAK,KAAK,wBAAwB;AAAA,IAC7D,SAAS,wBAAwB,sBAAsB;AAAA,IACvD,QAAQ;AAAA,EACV,CAAC,EACA,SAAS;AAAA,EACZ,OAAO,EAAE,MAAM,gBAAgB,EAAE,IAAI,CAAC,EAAE,IAAI,gBAAgB,EAAE,SAAS;AAAA;AAAA,EAEvE,MAAM,EAAE,QAAQ,EAAE,QAAQ,KAAK;AACjC,CAAC,EACA,YAAY,CAAC,SAAS,QAAQ;AAC7B,QAAM,MAAM,oBAAI,IAAY;AAC5B,aAAW,CAAC,OAAO,IAAI,MAAM,QAAQ,SAAS,CAAC,GAAG,QAAQ,GAAG;AAC3D,QAAI,IAAI,IAAI,KAAK,EAAE,GAAG;AACpB,UAAI,SAAS,EAAE,MAAM,UAAU,MAAM,CAAC,SAAS,OAAO,IAAI,GAAG,SAAS,YAAY,KAAK,EAAE,kBAAkB,CAAC;AAC5G;AAAA,IACF;AACA,QAAI,IAAI,KAAK,EAAE;AAAA,EACjB;AACA,QAAM,QAAQ,OAAO,KAAK,QAAQ,SAAS,EAAE,UAAU,QAAQ,OAAO,UAAU;AAChF,MAAI,QAAQ,sBAAsB;AAChC,QAAI,SAAS;AAAA,MACX,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,MAAM,CAAC,OAAO;AAAA,MACd,SAAS,kBAAkB,KAAK,kEAA+D,oBAAoB;AAAA,IACrH,CAAC;AACD;AAAA,EACF;AAEA,QAAM,YAAY,OAAO,OAAO,QAAQ,SAAS;AACjD,QAAM,aAAa,QAAQ,UAAU,SAAY,IAAI,UAAU,QAAQ,KAAK;AAC5E,QAAM,WAAoE,QAAQ,QAC9E,QAAQ,MAAM,IAAI,CAAC,MAAM,WAAW,EAAE,IAAI,KAAK,IAAI,MAAM,KAAK,MAAM,MAAM,EAAE,IAC5E,CAAC,EAAE,IAAI,KAAK,CAAC;AACjB,aAAW,WAAW,UAAU;AAC9B,UAAM,QACJ,aAAa,UAAU,OAAO,CAAC,OAAO,aAAa,QAAQ,oBAAoB,UAAU,QAAQ,IAAI,GAAG,CAAC;AAC3G,QAAI,SAAS,yBAA0B;AACvC,UAAM,OACJ,QAAQ,OAAO,OAAO,kBAAkB,SAAS,QAAQ,EAAE,cAAc,UAAU,MAAM;AAC3F,QAAI,SAAS;AAAA,MACX,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,MAAM,QAAQ,UAAU,SAAY,CAAC,OAAO,IAAI,CAAC,SAAS,QAAQ,OAAO,MAAM;AAAA,MAC/E,SAAS,GAAG,IAAI,0BAA0B,KAAK,gDAAgD,wBAAwB;AAAA,IACzH,CAAC;AACD;AAAA,EACF;AACF,CAAC;AAGI,SAAS,mBAAmB,OAAkC;AACnE,MAAI,MAAM,SAAS,aAAa,MAAM,KAAK,WAAW,KAAK,MAAM,KAAK,CAAC,MAAM,QAAS,QAAO;AAC7F,SAAO,MAAM,SAAS,YAAY,MAAM,QAAQ,gBAAgB;AAClE;AAKA,IAAM,gBAAgB,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,OAAO,CAAC;AAE9C,IAAM,qBAAqB,EAAE,MAAM;AAAA,EACxC,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;AAAA,EAC7B,EAAE,OAAO;AAAA,IACP,QAAQ,EAAE,OAAO;AAAA;AAAA,IAEjB,aAAa,EAAE,OAAO;AAAA;AAAA,IAEtB,YAAY,EAAE,OAAO;AAAA,IACrB,eAAe,cAAc,SAAS;AAAA,EACxC,CAAC;AAAA,EACD,EAAE,OAAO;AAAA;AAAA,IAEP,OAAO,EAAE,OAAO;AAAA;AAAA,IAEhB,OAAO,EAAE,OAAO;AAAA,IAChB,YAAY,EAAE,OAAO;AAAA,IACrB,eAAe,cAAc,SAAS;AAAA,EACxC,CAAC;AACH,CAAC;AAID,IAAM,gBAAgB,EAAE,OAAO,EAAE,OAAO,GAAG,kBAAkB;AAEtD,IAAM,uBAAuB,EAAE,OAAO;AAAA,EAC3C,OAAO,EAAE,OAAO;AAAA;AAAA,EAEhB,SAAS,cAAc,SAAS;AAAA;AAAA,EAEhC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,GAAG,SAAS,cAAc,SAAS,EAAE,CAAC,CAAC,EAAE,SAAS;AAAA;AAAA,EAEzF,YAAY,EAAE,MAAM,EAAE,OAAO,CAAC;AAAA;AAAA,EAE9B,UAAU,EAAE,OAAO;AAAA,EACnB,SAAS,EAAE,OAAO;AACpB,CAAC;","names":[]}

package/dist/chunk-GKXMIXEV.js

@@ -0,0 +1,166 @@
+import {
+  HEADLINE_SET_FLOOR,
+  SAME_CLAIM_HELD,
+  TELL_QUESTIONS,
+  copySentences,
+  sameClaimQuestion,
+  tellQuestionsFor
+} from "./chunk-4NZ47VXO.js";
+import {
+  rememberedJev
+} from "./chunk-D5MF337I.js";
+import {
+  holdUnbilledSpend
+} from "./chunk-VHMNSO2B.js";
+import {
+  findWorkspaceRoot
+} from "./chunk-65BQAJMH.js";
+import {
+  CAPABILITY_SURFACE_SPECS
+} from "./chunk-XQIOCIDO.js";
+
+// src/commands/capabilities/fix.ts
+function capabilityFix(surface) {
+  const spec = CAPABILITY_SURFACE_SPECS[surface];
+  return {
+    action: `baker capabilities ${surface}`,
+    explanation: `Do not guess another field name. \`baker capabilities ${surface}\` lists every ${spec.label} change with its required and optional fields and the exact values each field accepts, plus what cannot be changed here at all and why. Read it, then either re-stage correctly or tell the user this part is out of reach \u2014 and carry on with the rest of the job either way.`
+  };
+}
+
+// src/commands/ads/boolean-word-positional.ts
+var BOOLEAN_WORD = /^(true|false)$/i;
+function booleanWordPositionalError(args, entity) {
+  const positionals = Array.isArray(args._) ? args._ : [];
+  const word = positionals.find((value2) => typeof value2 === "string" && BOOLEAN_WORD.test(value2));
+  if (word === void 0) {
+    return void 0;
+  }
+  const value = word.toLowerCase();
+  const raised = Object.keys(args).filter((key) => key !== "_" && args[key] === true);
+  const named = raised.length > 0 ? raised.map((flag) => `--${flag}`).join(" or ") : "a boolean flag";
+  const fix = raised.length > 0 ? raised.map((flag) => `--${flag}=${value}`).join(" or ") : `--<flag>=${value}`;
+  const negated = raised.length === 1 && value === "false" ? ` (or --no-${raised[0]})` : "";
+  return `"${word}" was read as the ${entity} target, not as a value for ${named}. A boolean flag written with a space is set to TRUE and the word is dropped \u2014 attach it instead: ${fix}${negated}.`;
+}
+
+// src/commands/ads/copy-hints.ts
+import path from "path";
+
+// src/engine/copy-tells/judge.ts
+var SAMPLE_MAX = 60;
+var sample = (text) => text.length <= SAMPLE_MAX ? text : `${text.slice(0, SAMPLE_MAX)}\u2026`;
+async function judgedCopyTells(input, ask) {
+  const sentences = input.texts.flatMap((t) => copySentences(t));
+  const pairs = (input.headlineSets ?? []).map((set) => set.map((h) => h.trim()).filter(Boolean)).filter((set) => set.length >= HEADLINE_SET_FLOOR).flatMap((set, s) => set.flatMap((a, i) => set.slice(i + 1).map((b) => ({ set: s, a, b }))));
+  const questions = [...sentences.flatMap(tellQuestionsFor), ...pairs.map(({ a, b }) => sameClaimQuestion(a, b))];
+  if (questions.length === 0) return [];
+  const answers = await ask(questions);
+  if (answers === null) return null;
+  const tells = [];
+  TELL_QUESTIONS.forEach((tell, t) => {
+    const hits = sentences.filter((_, s) => (answers[s * TELL_QUESTIONS.length + t] ?? 0) >= tell.threshold);
+    if (hits.length > 0) tells.push({ id: tell.id, count: hits.length, sample: sample(hits[0]?.text ?? "") });
+  });
+  const offset = sentences.length * TELL_QUESTIONS.length;
+  const cycled = pairs.filter((_, p) => (answers[offset + p] ?? 0) >= SAME_CLAIM_HELD);
+  for (const set of new Set(cycled.map((p) => p.set))) {
+    const inSet = cycled.filter((p) => p.set === set);
+    const { a, b } = inSet[0] ?? { a: "", b: "" };
+    tells.push({ id: "synonym-cycling", count: inSet.length, sample: sample(`"${a}" / "${b}"`) });
+  }
+  return tells;
+}
+
+// src/commands/ads/copy-hints.ts
+var COPY_KEYS = /* @__PURE__ */ new Set([
+  "headline",
+  "headlines",
+  "longheadline",
+  "longheadlines",
+  "shortheadline",
+  "shortheadlines",
+  "description",
+  "descriptions",
+  "primarytext",
+  "primarytexts",
+  "message",
+  "messages",
+  "commentary",
+  "body",
+  "bodies",
+  "text",
+  "calltoaction",
+  "linkdescription",
+  "sitelinktext",
+  "callout",
+  "callouts",
+  "introtext"
+]);
+var HEADLINE_SET_KEYS = /* @__PURE__ */ new Set(["headlines", "longheadlines", "shortheadlines"]);
+var MAX_HINTS = 5;
+var SYNONYM_PAIR_FLOOR = 2;
+function asStrings(value) {
+  const one = (v) => {
+    const text = typeof v === "string" ? v : v !== null && typeof v === "object" ? v.text : "";
+    return typeof text === "string" && text.trim() ? text : void 0;
+  };
+  const values = Array.isArray(value) ? value : [value];
+  return values.map(one).filter((v) => v !== void 0);
+}
+function collectCopy(value, depth = 0) {
+  const texts = [];
+  const headlineSets = [];
+  if (depth > 4 || value === null || typeof value !== "object") return { texts, headlineSets };
+  if (Array.isArray(value)) {
+    for (const item of value) {
+      const nested = collectCopy(item, depth + 1);
+      texts.push(...nested.texts);
+      headlineSets.push(...nested.headlineSets);
+    }
+    return { texts, headlineSets };
+  }
+  for (const [key, raw] of Object.entries(value)) {
+    const normalized = key.toLowerCase().replace(/[_-]/g, "");
+    const strings = COPY_KEYS.has(normalized) ? asStrings(raw) : [];
+    if (strings.length > 0) {
+      texts.push(...strings);
+      if (HEADLINE_SET_KEYS.has(normalized) && strings.length > 1) headlineSets.push(strings);
+      continue;
+    }
+    const nested = collectCopy(raw, depth + 1);
+    texts.push(...nested.texts);
+    headlineSets.push(...nested.headlineSets);
+  }
+  return { texts, headlineSets };
+}
+function hintFor(tell) {
+  if (tell.id === "synonym-cycling") {
+    return `AI COPY TELL \u2014 ${tell.count} headline pairs are the same claim reworded (${tell.sample}). A cycled set gives the auction nothing to choose between: make each headline a different claim, not a different verb.`;
+  }
+  return `AI COPY TELL (${tell.id}) \u2014 "${tell.sample}". This construction reads as machine-written; rewrite it as a plain, specific claim before publishing.`;
+}
+async function adCopyHints(payload, ask) {
+  const { texts, headlineSets } = collectCopy(payload);
+  if (texts.length === 0) return [];
+  const cacheDir = path.join(findWorkspaceRoot(process.cwd()) ?? process.cwd(), "canvas", ".cache");
+  const spent = [];
+  const judged = await judgedCopyTells(
+    { texts: texts.flatMap((t) => t.split("\n")), headlineSets },
+    ask ?? rememberedJev(path.join(cacheDir, "copy-tells.json"), (u) => spent.push(u))
+  ).catch(() => null);
+  await holdUnbilledSpend(cacheDir, spent).catch(() => void 0);
+  const cycled = (judged ?? []).filter((t) => t.id === "synonym-cycling" && t.count >= SYNONYM_PAIR_FLOOR).sort((a, b) => b.count - a.count).slice(0, 1);
+  const tells = [...cycled, ...(judged ?? []).filter((t) => t.id !== "synonym-cycling")];
+  tells.sort(
+    (a, b) => (b.id === "synonym-cycling" ? 1 : 0) - (a.id === "synonym-cycling" ? 1 : 0) || b.count - a.count
+  );
+  return tells.slice(0, MAX_HINTS).map(hintFor);
+}
+
+export {
+  capabilityFix,
+  booleanWordPositionalError,
+  adCopyHints
+};
+//# sourceMappingURL=chunk-GKXMIXEV.js.map