@aglyn/plugins-ai 1.0.0-beta.143

package/src/lib/jobs/ai-job-products-step.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../../../libs/plugins/ai/src/lib/jobs/ai-job-products-step.ts"],"sourcesContent":["/**\n * @license\n * Copyright 2026 Aglyn LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { checkEntitlement } from '@aglyn/aglyn/app-utils/plan-entitlements'\nimport type { AglynOrgBilling } from '@aglyn/aglyn/foundation/definitions/org-billing.types'\nimport { isHostPluginEnabled } from '@aglyn/aglyn/plugin-manager/enabled-plugins'\nimport { resolveOrgIdForHost } from '@aglyn/tenant-data-admin/server/organizations'\nimport { filterEnabledPluginsByReleaseFlags } from '@aglyn/tenant-data-admin/server/release-flags'\nimport type { AiJob, AiJobOutput } from '../model/ai-jobs.types'\nimport {\n  AI_PRODUCT_CATEGORY_LIST_MAX,\n  AI_PRODUCT_OPTIONS_MAX,\n  AI_PRODUCT_OPTION_VALUES_MAX,\n  AI_PRODUCT_TEXT_MAX_CHARS,\n  AI_PRODUCT_TYPES,\n  AI_PRODUCTS_BULK_MAX,\n  AI_PRODUCTS_OUTPUT_IDS,\n  aiProductGaps,\n  aiProductsProposalOf,\n  parseAiProductsJobInputs,\n  type AiCatalogProposal,\n  type AiCategoriesProposal,\n  type AiProductCategory,\n  type AiProductCopy,\n  type AiProductCopyProposal,\n  type AiProductFacts,\n  type AiProductPhotoRead,\n  type AiProductType,\n} from '../model/ai-products'\nimport { AI_STEP_TIERS } from '../providers/catalog'\nimport { aiModelForStep } from '../providers/routing'\nimport type { AiValidatedGeneration } from '../runtime/ai-doctrine'\nimport {\n  AI_CATALOG_MAX_TOKENS,\n  AI_PRODUCT_CATEGORIES_MAX_TOKENS,\n  AI_PRODUCT_COPY_MAX_TOKENS,\n  AI_PRODUCTS_STEP,\n  generateAiCatalog,\n  generateAiCategories,\n  generateAiProductCopy,\n} from '../runtime/ai-products-generation'\nimport { aiRouteReadsImages } from '../runtime/ai-runtime'\nimport { registerAiJobAdmission, type AiJobAdmission } from './ai-job-admission'\nimport { aiJobStepBudget } from './ai-job-budget'\nimport { aiGenerationSpent, aiUnspentOutcome } from './ai-job-generation'\nimport { AI_PRODUCT_IMAGE_READ_MS, readAiProductImage, type AiProductImageSeams } from './ai-product-image'\nimport type { AiJobStepContext, AiJobStepOutcome, AiJobStepRunner } from './ai-job-text-step'\nimport { registerAiJobStep, registerAiJobStepPasses } from './ai-jobs'\n\n/**\n * The `products` step (AGL-2916): commerce by AI, as proposals.\n *\n * `inputs.target` names the work (`model/ai-products.ts`): one product's copy\n * from what its editor holds, the copy of many saved products one a pass, a\n * store's first products from a brief, or its categories and a first set of\n * discounts from a brief.\n *\n * ## It writes nothing\n *\n * Like every runner, this reads, asks and returns. Every output is a\n * `product` proposal, and the commerce plugin's own surfaces write what a\n * person accepts: the product editor's Save, the products card's apply, and\n * the create paths the catalog and discount cards already use — each with the\n * allowance, role and seed checks those paths carry. A proposed product is\n * created as a draft with no price, and a proposed discount is created\n * switched off.\n *\n * ## A bulk job, a product at a time\n *\n * A bulk job's pass writes one product's copy and asks the machine to\n * continue while products remain, so each product is one reservation and one\n * provider exchange, and a job that runs out of credits resumes at the\n * product where it stopped. Which product is next is read from the job's own\n * outputs, one a product, so nothing is kept anywhere else. A product that is\n * gone, or whose copy cannot be held to the rules, is reported and passed\n * over rather than failing the products after it.\n *\n * ## What the model is shown\n *\n * The product's name, type, text, tags, options and current search listing,\n * the names of the site's categories, the store's name, and — for a model that\n * reads pictures — the product's first photo, read from the site's own media\n * library as `ai-product-image.ts` describes. A catalog or categories request\n * carries the brief and the store's name, and the second its existing category\n * names. No price, stock, order, customer or other product is read for any of\n * them.\n */\n\nexport const AI_PRODUCTS_NO_SITE_COPY = 'Open the store this job is for before starting it.'\nexport const AI_PRODUCTS_UNKNOWN_SITE_COPY = 'This AI job names a site this workspace does not have.'\nexport const AI_PRODUCTS_NOT_ENTITLED_COPY = 'Your plan does not include selling products. See Billing.'\nexport const AI_PRODUCTS_COMMERCE_OFF_COPY = 'Turn on Commerce for this site before starting the job.'\nexport const AI_PRODUCTS_GONE_COPY = 'This product is no longer in the catalog.'\nexport const AI_PRODUCTS_DECLINED_COPY = 'The model declined to write copy for this product.'\n\n/** The notes a proposal carries about its product's photo. */\nexport const AI_PRODUCT_PHOTO_NOTES: Readonly<Partial<Record<AiProductPhotoRead, string>>> = {\n  'not-in-library':\n    'The photo was not read: it is not in this site’s media library. The copy is written from the product’s words.',\n  unreadable: 'The photo could not be read, so the copy is written from the product’s words.',\n  model: 'The photo was not read: the model this job ran on does not read pictures.',\n}\n\n/** The commerce plugin, as `plugins.config.json` names it. */\nconst COMMERCE_PLUGIN_ID = 'commerce'\n\n/**\n * ASSUMED: how long a catalog or categories pass reads the site before it\n * asks: the host document and, for categories, the category names.\n */\nexport const AI_PRODUCTS_SITE_READ_MS = 1_000\n\nconst TIER = AI_STEP_TIERS[AI_PRODUCTS_STEP]\n\n/**\n * One product's copy (AGL-3035): its generation and re-ask at the copy's own\n * ceiling on the tier `job.products` is served from, with the photo read. The\n * least any pass of the step needs, and so what the step registers.\n */\nexport const AI_JOB_PRODUCT_COPY_BUDGET = aiJobStepBudget({\n  tier: TIER,\n  maxTokens: AI_PRODUCT_COPY_MAX_TOKENS,\n  lookups: 0,\n  ownReadsMs: AI_PRODUCT_IMAGE_READ_MS,\n})\n\n/** A catalog: the largest answer the step asks for, at the routing table's ceiling. */\nexport const AI_JOB_CATALOG_BUDGET = aiJobStepBudget({\n  tier: TIER,\n  maxTokens: AI_CATALOG_MAX_TOKENS,\n  lookups: 0,\n  ownReadsMs: AI_PRODUCTS_SITE_READ_MS,\n})\n\n/** Categories and discounts. */\nexport const AI_JOB_CATEGORIES_BUDGET = aiJobStepBudget({\n  tier: TIER,\n  maxTokens: AI_PRODUCT_CATEGORIES_MAX_TOKENS,\n  lookups: 0,\n  ownReadsMs: AI_PRODUCTS_SITE_READ_MS,\n})\n\n/** What the `products` step registers: the least any of its passes needs. */\nexport const AI_JOB_PRODUCTS_STEP_BUDGET = AI_JOB_PRODUCT_COPY_BUDGET\n\n/** The least time the next pass of a job needs, by what the job asks for. */\nexport function aiProductsRunMinimumMs(job: Pick<AiJob, 'inputs'>): number {\n  const inputs = parseAiProductsJobInputs(job.inputs)\n  if (typeof inputs === 'string') return AI_JOB_PRODUCT_COPY_BUDGET.minimumMs\n  if (inputs.target === 'catalog') return AI_JOB_CATALOG_BUDGET.minimumMs\n  if (inputs.target === 'categories') return AI_JOB_CATEGORIES_BUDGET.minimumMs\n  return AI_JOB_PRODUCT_COPY_BUDGET.minimumMs\n}\n\ntype Firestore = FirebaseFirestore.Firestore\n\ninterface StoreSite {\n  hostId: string\n  subdomain: string | null\n  /** The store's name, as its visitors read it. */\n  name: string\n}\n\nconst str = (value: unknown): string => (typeof value === 'string' ? value.trim() : '')\n\n/** Through JSON, so no `undefined` reaches the job document's write. */\nconst plain = <T>(value: T): Record<string, unknown> =>\n  JSON.parse(JSON.stringify(value)) as Record<string, unknown>\n\n/** The site a job names, read and checked against the job's org. */\nasync function loadStore(firestore: Firestore, job: AiJob): Promise<StoreSite | { failure: string }> {\n  if (!job.hostId) return { failure: AI_PRODUCTS_NO_SITE_COPY }\n  const snapshot = await firestore.collection('hosts').doc(job.hostId).get()\n  const host = snapshot.exists ? (snapshot.data() as Record<string, unknown>) : null\n  // The door checks the caller's membership of the org the job is metered\n  // against; a site of another org is refused here, before anything of it\n  // reaches a prompt.\n  if (!host || host['orgId'] !== job.orgId) return { failure: AI_PRODUCTS_UNKNOWN_SITE_COPY }\n  const seo = (host['seo'] ?? {}) as Record<string, unknown>\n  const subdomain = str(host['subdomain']) || null\n  return {\n    hostId: job.hostId,\n    subdomain,\n    name: str(seo['title']) || str(host['displayName']) || subdomain || '',\n  }\n}\n\n/** The site's categories by name, as many as a request lists. */\nasync function readCategories(firestore: Firestore, hostId: string): Promise<AiProductCategory[]> {\n  const snapshot = await firestore\n    .collection('hosts')\n    .doc(hostId)\n    .collection('productCategories')\n    .select('name')\n    .limit(AI_PRODUCT_CATEGORY_LIST_MAX)\n    .get()\n  return snapshot.docs\n    .map((doc) => ({ id: doc.id, name: str(doc.get('name')) }))\n    .filter((category) => category.name)\n    .sort((a, b) => a.name.localeCompare(b.name))\n}\n\n/** A saved product's facts, as a bulk pass reads them; `null` when it is gone. */\nasync function readProductFacts(firestore: Firestore, hostId: string, productId: string): Promise<AiProductFacts | null> {\n  const snapshot = await firestore.collection('hosts').doc(hostId).collection('products').doc(productId).get()\n  const data = snapshot.exists ? (snapshot.data() as Record<string, unknown>) : null\n  if (!data || data['deletedAt']) return null\n  const name = str(data['name'])\n  if (!name) return null\n  const type = data['type']\n  const seo = (data['seo'] ?? {}) as Record<string, unknown>\n  const mediaUrls = Array.isArray(data['mediaUrls']) ? data['mediaUrls'] : []\n  return {\n    id: productId,\n    name,\n    type: (AI_PRODUCT_TYPES as readonly unknown[]).includes(type) ? (type as AiProductType) : 'physical',\n    text: str(data['description']).slice(0, AI_PRODUCT_TEXT_MAX_CHARS),\n    tags: (Array.isArray(data['tags']) ? data['tags'] : []).map(str).filter(Boolean),\n    categoryIds: (Array.isArray(data['categoryIds']) ? data['categoryIds'] : []).map(str).filter(Boolean),\n    options: (Array.isArray(data['options']) ? data['options'] : [])\n      .slice(0, AI_PRODUCT_OPTIONS_MAX)\n      .map((option) => {\n        const record = (option ?? {}) as Record<string, unknown>\n        return {\n          name: str(record['name']),\n          values: (Array.isArray(record['values']) ? record['values'] : [])\n            .map(str)\n            .filter(Boolean)\n            .slice(0, AI_PRODUCT_OPTION_VALUES_MAX),\n        }\n      })\n      .filter((option) => option.name),\n    imageUrl: str(mediaUrls[0]) || str(data['imageUrl']) || null,\n    seoTitle: str(seo['title']),\n    seoDescription: str(seo['description']),\n  }\n}\n\nfunction modelOf(context: AiJobStepContext): string {\n  return context.modelFor?.(AI_PRODUCTS_STEP) ?? aiModelForStep(AI_PRODUCTS_STEP)\n}\n\n/** An output addressed to the site, so its link opens the site's products. */\nfunction output(site: StoreSite, id: string, label: string, proposal: object): AiJobOutput {\n  return {\n    resource: 'product',\n    id,\n    hostId: site.hostId,\n    hostSubdomain: site.subdomain,\n    label,\n    proposal: plain(proposal),\n  }\n}\n\nexport interface AiJobProductsStepDeps {\n  image?: AiProductImageSeams\n  /** Whether a model reads pictures; the provider's own descriptor otherwise. */\n  readsImages?: (model: string) => boolean\n}\n\ninterface CopyRun {\n  generation: AiValidatedGeneration<AiProductCopy>\n  proposal: AiProductCopyProposal\n}\n\n/** Ask for one product's copy, and build its proposal from the answer. */\nasync function writeProductCopy(\n  context: AiJobStepContext & { firestore: Firestore },\n  model: string,\n  site: StoreSite,\n  product: AiProductFacts,\n  deps: AiJobProductsStepDeps,\n): Promise<CopyRun> {\n  const { job, firestore, signal } = context\n  const categories = await readCategories(firestore, site.hostId)\n  let photo: AiProductPhotoRead = 'none'\n  let image = null\n  if (product.imageUrl) {\n    if ((deps.readsImages ?? aiRouteReadsImages)(model)) {\n      const read = await readAiProductImage(\n        firestore,\n        { value: product.imageUrl, hostId: site.hostId, orgId: job.orgId },\n        deps.image,\n      )\n      photo = read.status\n      image = read.status === 'read' ? read.image : null\n    } else {\n      photo = 'model'\n    }\n  }\n  const generation = await generateAiProductCopy({\n    store: site.name,\n    product,\n    categories,\n    photo: Boolean(image),\n    image,\n    model,\n    maxTokens: AI_JOB_PRODUCT_COPY_BUDGET.maxTokens(model),\n    ...(signal ? { signal } : {}),\n  })\n  const values = generation.status === 'ok' ? generation.value : null\n  const names = new Map(categories.map((category) => [category.id, category.name]))\n  const note = AI_PRODUCT_PHOTO_NOTES[photo]\n  return {\n    generation,\n    proposal: {\n      kind: 'copy',\n      product: { id: product.id, name: product.name },\n      values,\n      categories: (values?.categoryIds ?? []).map((id) => ({ id, name: names.get(id) ?? id })),\n      optionNamesBefore: product.options.map((option) => option.name),\n      gaps: values ? aiProductGaps(values.description) : [],\n      photo,\n      skipped: null,\n      notes: note ? [note] : [],\n    },\n  }\n}\n\n/** The step, with its reads replaceable where a spec needs them. */\nexport function createAiJobProductsStep(deps: AiJobProductsStepDeps = {}): AiJobStepRunner {\n  return async (context) => {\n    const { job, firestore, signal } = context\n    const model = modelOf(context)\n    const inputs = parseAiProductsJobInputs(job.inputs)\n    if (typeof inputs === 'string') return { ...aiUnspentOutcome(model), failure: inputs }\n    const site = await loadStore(firestore, job)\n    if ('failure' in site) return { ...aiUnspentOutcome(model), failure: site.failure }\n\n    if (inputs.target === 'product') {\n      const { generation, proposal } = await writeProductCopy(context, model, site, inputs.product, deps)\n      const spent = aiGenerationSpent(generation)\n      if (generation.status === 'refused') return { ...spent, refused: true }\n      if (generation.status === 'needs_input') return { ...spent, failure: generation.message }\n      return {\n        ...spent,\n        outputs: [output(site, AI_PRODUCTS_OUTPUT_IDS.copy(inputs.product.id), `Product copy · ${inputs.product.name}`, proposal)],\n      }\n    }\n\n    if (inputs.target === 'bulk') {\n      const done = (job.outputs ?? []).filter((entry) => aiProductsProposalOf(entry)?.kind === 'copy').length\n      const productId = inputs.productIds[done]\n      if (!productId) return aiUnspentOutcome(model)\n      const more = done + 1 < inputs.productIds.length\n      const product = await readProductFacts(firestore, site.hostId, productId)\n      if (!product) {\n        const skipped: AiProductCopyProposal = {\n          kind: 'copy',\n          product: { id: productId, name: productId },\n          values: null,\n          categories: [],\n          optionNamesBefore: [],\n          gaps: [],\n          photo: 'none',\n          skipped: AI_PRODUCTS_GONE_COPY,\n          notes: [],\n        }\n        return {\n          ...aiUnspentOutcome(model, {\n            outputs: [output(site, AI_PRODUCTS_OUTPUT_IDS.copy(productId), `Product copy · ${productId}`, skipped)],\n          }),\n          continue: more,\n        }\n      }\n      const { generation, proposal } = await writeProductCopy(context, model, site, product, deps)\n      const spent = aiGenerationSpent(generation)\n      // One product the rules could not hold, or the model declined, is\n      // reported and passed over: its tokens are metered with the pass, and\n      // the products after it still get their copy.\n      const reported: AiProductCopyProposal =\n        generation.status === 'ok'\n          ? proposal\n          : {\n              ...proposal,\n              skipped: generation.status === 'needs_input' ? generation.message : AI_PRODUCTS_DECLINED_COPY,\n            }\n      return {\n        ...spent,\n        outputs: [output(site, AI_PRODUCTS_OUTPUT_IDS.copy(productId), `Product copy · ${product.name}`, reported)],\n        continue: more,\n      }\n    }\n\n    if (inputs.target === 'catalog') {\n      const generation = await generateAiCatalog({\n        store: site.name,\n        brief: job.brief,\n        model,\n        maxTokens: AI_JOB_CATALOG_BUDGET.maxTokens(model),\n        ...(signal ? { signal } : {}),\n      })\n      const spent = aiGenerationSpent(generation)\n      if (generation.status === 'refused') return { ...spent, refused: true }\n      if (generation.status === 'needs_input') return { ...spent, failure: generation.message }\n      const proposal: AiCatalogProposal = { kind: 'catalog', products: generation.value, notes: [] }\n      return {\n        ...spent,\n        outputs: [\n          output(\n            site,\n            AI_PRODUCTS_OUTPUT_IDS.catalog,\n            `Proposed products · ${generation.value.length}`,\n            proposal,\n          ),\n        ],\n      }\n    }\n\n    const existing = await readCategories(firestore, site.hostId)\n    const generation = await generateAiCategories({\n      store: site.name,\n      brief: job.brief,\n      existingCategoryNames: existing.map((category) => category.name),\n      model,\n      maxTokens: AI_JOB_CATEGORIES_BUDGET.maxTokens(model),\n      ...(signal ? { signal } : {}),\n    })\n    const spent = aiGenerationSpent(generation)\n    if (generation.status === 'refused') return { ...spent, refused: true }\n    if (generation.status === 'needs_input') return { ...spent, failure: generation.message }\n    const proposal: AiCategoriesProposal = { kind: 'categories', ...generation.value, notes: [] }\n    return {\n      ...spent,\n      outputs: [output(site, AI_PRODUCTS_OUTPUT_IDS.categories, 'Proposed categories and discounts', proposal)],\n    }\n  }\n}\n\nexport const runAiJobProductsStep = createAiJobProductsStep()\n\n/**\n * Whether a `products` job may start: inputs it can run, a site of the job's\n * own org, a plan that sells products, and Commerce on for the site and past\n * its release flag. Asked by the create door before the job exists, so a\n * refusal spends nothing.\n */\nexport const aiProductsJobAdmission: AiJobAdmission = async (context) => {\n  const inputs = parseAiProductsJobInputs(context.inputs)\n  if (typeof inputs === 'string') return { status: 400, error: inputs }\n  if (!context.hostId) return { status: 400, error: AI_PRODUCTS_NO_SITE_COPY }\n  const owner = await resolveOrgIdForHost(context.hostId)\n  if (!owner || owner !== context.orgId) return { status: 404, error: AI_PRODUCTS_UNKNOWN_SITE_COPY }\n  const org = context.org as (Partial<AglynOrgBilling> & { enabledPlugins?: string[] }) | null\n  if (!checkEntitlement(org, 'commerce')) return { status: 403, error: AI_PRODUCTS_NOT_ENTITLED_COPY }\n  const host = (await context.firestore.collection('hosts').doc(context.hostId).get()).data() ?? null\n  const released = await filterEnabledPluginsByReleaseFlags([COMMERCE_PLUGIN_ID], {\n    orgId: context.orgId,\n    authorization: null,\n  })\n  if (!released.includes(COMMERCE_PLUGIN_ID) || !isHostPluginEnabled(org, host, COMMERCE_PLUGIN_ID)) {\n    return { status: 403, error: AI_PRODUCTS_COMMERCE_OFF_COPY }\n  }\n  return null\n}\n\n/**\n * Registers the `products` step, the least time each of its passes needs, its\n * pass bound and its admission.\n */\nexport function registerAiProductsJob(): void {\n  registerAiJobStep('products', runAiJobProductsStep, {\n    minimumMs: AI_JOB_PRODUCTS_STEP_BUDGET.minimumMs,\n    minimumMsFor: aiProductsRunMinimumMs,\n  })\n  registerAiJobStepPasses('products', AI_PRODUCTS_BULK_MAX)\n  registerAiJobAdmission('products', aiProductsJobAdmission)\n}\n"],"names":["checkEntitlement","isHostPluginEnabled","resolveOrgIdForHost","filterEnabledPluginsByReleaseFlags","AI_PRODUCT_CATEGORY_LIST_MAX","AI_PRODUCT_OPTIONS_MAX","AI_PRODUCT_OPTION_VALUES_MAX","AI_PRODUCT_TEXT_MAX_CHARS","AI_PRODUCT_TYPES","AI_PRODUCTS_BULK_MAX","AI_PRODUCTS_OUTPUT_IDS","aiProductGaps","aiProductsProposalOf","parseAiProductsJobInputs","AI_STEP_TIERS","aiModelForStep","AI_CATALOG_MAX_TOKENS","AI_PRODUCT_CATEGORIES_MAX_TOKENS","AI_PRODUCT_COPY_MAX_TOKENS","AI_PRODUCTS_STEP","generateAiCatalog","generateAiCategories","generateAiProductCopy","aiRouteReadsImages","registerAiJobAdmission","aiJobStepBudget","aiGenerationSpent","aiUnspentOutcome","AI_PRODUCT_IMAGE_READ_MS","readAiProductImage","registerAiJobStep","registerAiJobStepPasses","AI_PRODUCTS_NO_SITE_COPY","AI_PRODUCTS_UNKNOWN_SITE_COPY","AI_PRODUCTS_NOT_ENTITLED_COPY","AI_PRODUCTS_COMMERCE_OFF_COPY","AI_PRODUCTS_GONE_COPY","AI_PRODUCTS_DECLINED_COPY","AI_PRODUCT_PHOTO_NOTES","unreadable","model","COMMERCE_PLUGIN_ID","AI_PRODUCTS_SITE_READ_MS","TIER","AI_JOB_PRODUCT_COPY_BUDGET","tier","maxTokens","lookups","ownReadsMs","AI_JOB_CATALOG_BUDGET","AI_JOB_CATEGORIES_BUDGET","AI_JOB_PRODUCTS_STEP_BUDGET","aiProductsRunMinimumMs","job","inputs","minimumMs","target","str","value","trim","plain","JSON","parse","stringify","loadStore","firestore","host","hostId","failure","snapshot","collection","doc","get","exists","data","orgId","seo","subdomain","name","readCategories","select","limit","docs","map","id","filter","category","sort","a","b","localeCompare","readProductFacts","productId","type","mediaUrls","Array","isArray","includes","text","slice","tags","Boolean","categoryIds","options","option","record","values","imageUrl","seoTitle","seoDescription","modelOf","context","modelFor","output","site","label","proposal","resource","hostSubdomain","writeProductCopy","product","deps","signal","categories","photo","image","readsImages","read","status","generation","store","names","Map","note","kind","optionNamesBefore","gaps","description","skipped","notes","createAiJobProductsStep","spent","refused","message","outputs","copy","done","entry","length","productIds","more","continue","reported","brief","products","catalog","existing","existingCategoryNames","runAiJobProductsStep","aiProductsJobAdmission","error","owner","org","released","authorization","registerAiProductsJob","minimumMsFor"],"mappings":";AAAA;;;;;;;;;;;;;;;CAeC,GAED,SAASA,gBAAgB,QAAQ,2CAA0C;AAE3E,SAASC,mBAAmB,QAAQ,8CAA6C;AACjF,SAASC,mBAAmB,QAAQ,gDAA+C;AACnF,SAASC,kCAAkC,QAAQ,gDAA+C;AAElG,SACEC,4BAA4B,EAC5BC,sBAAsB,EACtBC,4BAA4B,EAC5BC,yBAAyB,EACzBC,gBAAgB,EAChBC,oBAAoB,EACpBC,sBAAsB,EACtBC,aAAa,EACbC,oBAAoB,EACpBC,wBAAwB,QASnB,0BAAsB;AAC7B,SAASC,aAAa,QAAQ,0BAAsB;AACpD,SAASC,cAAc,QAAQ,0BAAsB;AAErD,SACEC,qBAAqB,EACrBC,gCAAgC,EAChCC,0BAA0B,EAC1BC,gBAAgB,EAChBC,iBAAiB,EACjBC,oBAAoB,EACpBC,qBAAqB,QAChB,uCAAmC;AAC1C,SAASC,kBAAkB,QAAQ,2BAAuB;AAC1D,SAASC,sBAAsB,QAA6B,wBAAoB;AAChF,SAASC,eAAe,QAAQ,qBAAiB;AACjD,SAASC,iBAAiB,EAAEC,gBAAgB,QAAQ,yBAAqB;AACzE,SAASC,wBAAwB,EAAEC,kBAAkB,QAAkC,wBAAoB;AAE3G,SAASC,iBAAiB,EAAEC,uBAAuB,QAAQ,eAAW;AAEtE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAqCC,GAED,OAAO,MAAMC,2BAA2B,qDAAoD;AAC5F,OAAO,MAAMC,gCAAgC,yDAAwD;AACrG,OAAO,MAAMC,gCAAgC,4DAA2D;AACxG,OAAO,MAAMC,gCAAgC,0DAAyD;AACtG,OAAO,MAAMC,wBAAwB,4CAA2C;AAChF,OAAO,MAAMC,4BAA4B,qDAAoD;AAE7F,4DAA4D,GAC5D,OAAO,MAAMC,yBAAgF;IAC3F,kBACE;IACFC,YAAY;IACZC,OAAO;AACT,EAAC;AAED,4DAA4D,GAC5D,MAAMC,qBAAqB;AAE3B;;;CAGC,GACD,OAAO,MAAMC,2BAA2B,KAAK;AAE7C,MAAMC,OAAO7B,aAAa,CAACK,iBAAiB;AAE5C;;;;CAIC,GACD,OAAO,MAAMyB,6BAA6BnB,gBAAgB;IACxDoB,MAAMF;IACNG,WAAW5B;IACX6B,SAAS;IACTC,YAAYpB;AACd,GAAE;AAEF,qFAAqF,GACrF,OAAO,MAAMqB,wBAAwBxB,gBAAgB;IACnDoB,MAAMF;IACNG,WAAW9B;IACX+B,SAAS;IACTC,YAAYN;AACd,GAAE;AAEF,8BAA8B,GAC9B,OAAO,MAAMQ,2BAA2BzB,gBAAgB;IACtDoB,MAAMF;IACNG,WAAW7B;IACX8B,SAAS;IACTC,YAAYN;AACd,GAAE;AAEF,2EAA2E,GAC3E,OAAO,MAAMS,8BAA8BP,2BAA0B;AAErE,2EAA2E,GAC3E,OAAO,SAASQ,uBAAuBC,GAA0B;IAC/D,MAAMC,SAASzC,yBAAyBwC,IAAIC,MAAM;IAClD,IAAI,OAAOA,WAAW,UAAU,OAAOV,2BAA2BW,SAAS;IAC3E,IAAID,OAAOE,MAAM,KAAK,WAAW,OAAOP,sBAAsBM,SAAS;IACvE,IAAID,OAAOE,MAAM,KAAK,cAAc,OAAON,yBAAyBK,SAAS;IAC7E,OAAOX,2BAA2BW,SAAS;AAC7C;AAWA,MAAME,MAAM,CAACC,QAA4B,OAAOA,UAAU,WAAWA,MAAMC,IAAI,KAAK;AAEpF,sEAAsE,GACtE,MAAMC,QAAQ,CAAIF,QAChBG,KAAKC,KAAK,CAACD,KAAKE,SAAS,CAACL;AAE5B,kEAAkE,GAClE,eAAeM,UAAUC,SAAoB,EAAEZ,GAAU;QAQ1Ca;IAPb,IAAI,CAACb,IAAIc,MAAM,EAAE,OAAO;QAAEC,SAASpC;IAAyB;IAC5D,MAAMqC,WAAW,MAAMJ,UAAUK,UAAU,CAAC,SAASC,GAAG,CAAClB,IAAIc,MAAM,EAAEK,GAAG;IACxE,MAAMN,OAAOG,SAASI,MAAM,GAAIJ,SAASK,IAAI,KAAiC;IAC9E,wEAAwE;IACxE,wEAAwE;IACxE,oBAAoB;IACpB,IAAI,CAACR,QAAQA,IAAI,CAAC,QAAQ,KAAKb,IAAIsB,KAAK,EAAE,OAAO;QAAEP,SAASnC;IAA8B;IAC1F,MAAM2C,OAAOV,YAAAA,IAAI,CAAC,MAAM,YAAXA,YAAe,CAAC;IAC7B,MAAMW,YAAYpB,IAAIS,IAAI,CAAC,YAAY,KAAK;IAC5C,OAAO;QACLC,QAAQd,IAAIc,MAAM;QAClBU;QACAC,MAAMrB,IAAImB,GAAG,CAAC,QAAQ,KAAKnB,IAAIS,IAAI,CAAC,cAAc,KAAKW,aAAa;IACtE;AACF;AAEA,+DAA+D,GAC/D,eAAeE,eAAed,SAAoB,EAAEE,MAAc;IAChE,MAAME,WAAW,MAAMJ,UACpBK,UAAU,CAAC,SACXC,GAAG,CAACJ,QACJG,UAAU,CAAC,qBACXU,MAAM,CAAC,QACPC,KAAK,CAAC7E,8BACNoE,GAAG;IACN,OAAOH,SAASa,IAAI,CACjBC,GAAG,CAAC,CAACZ,MAAS,CAAA;YAAEa,IAAIb,IAAIa,EAAE;YAAEN,MAAMrB,IAAIc,IAAIC,GAAG,CAAC;QAAS,CAAA,GACvDa,MAAM,CAAC,CAACC,WAAaA,SAASR,IAAI,EAClCS,IAAI,CAAC,CAACC,GAAGC,IAAMD,EAAEV,IAAI,CAACY,aAAa,CAACD,EAAEX,IAAI;AAC/C;AAEA,gFAAgF,GAChF,eAAea,iBAAiB1B,SAAoB,EAAEE,MAAc,EAAEyB,SAAiB;QAOxElB;IANb,MAAML,WAAW,MAAMJ,UAAUK,UAAU,CAAC,SAASC,GAAG,CAACJ,QAAQG,UAAU,CAAC,YAAYC,GAAG,CAACqB,WAAWpB,GAAG;IAC1G,MAAME,OAAOL,SAASI,MAAM,GAAIJ,SAASK,IAAI,KAAiC;IAC9E,IAAI,CAACA,QAAQA,IAAI,CAAC,YAAY,EAAE,OAAO;IACvC,MAAMI,OAAOrB,IAAIiB,IAAI,CAAC,OAAO;IAC7B,IAAI,CAACI,MAAM,OAAO;IAClB,MAAMe,OAAOnB,IAAI,CAAC,OAAO;IACzB,MAAME,OAAOF,YAAAA,IAAI,CAAC,MAAM,YAAXA,YAAe,CAAC;IAC7B,MAAMoB,YAAYC,MAAMC,OAAO,CAACtB,IAAI,CAAC,YAAY,IAAIA,IAAI,CAAC,YAAY,GAAG,EAAE;IAC3E,OAAO;QACLU,IAAIQ;QACJd;QACAe,MAAM,AAACrF,iBAAwCyF,QAAQ,CAACJ,QAASA,OAAyB;QAC1FK,MAAMzC,IAAIiB,IAAI,CAAC,cAAc,EAAEyB,KAAK,CAAC,GAAG5F;QACxC6F,MAAM,AAACL,CAAAA,MAAMC,OAAO,CAACtB,IAAI,CAAC,OAAO,IAAIA,IAAI,CAAC,OAAO,GAAG,EAAE,AAAD,EAAGS,GAAG,CAAC1B,KAAK4B,MAAM,CAACgB;QACxEC,aAAa,AAACP,CAAAA,MAAMC,OAAO,CAACtB,IAAI,CAAC,cAAc,IAAIA,IAAI,CAAC,cAAc,GAAG,EAAE,AAAD,EAAGS,GAAG,CAAC1B,KAAK4B,MAAM,CAACgB;QAC7FE,SAAS,AAACR,CAAAA,MAAMC,OAAO,CAACtB,IAAI,CAAC,UAAU,IAAIA,IAAI,CAAC,UAAU,GAAG,EAAE,AAAD,EAC3DyB,KAAK,CAAC,GAAG9F,wBACT8E,GAAG,CAAC,CAACqB;YACJ,MAAMC,SAAUD,iBAAAA,SAAU,CAAC;YAC3B,OAAO;gBACL1B,MAAMrB,IAAIgD,MAAM,CAAC,OAAO;gBACxBC,QAAQ,AAACX,CAAAA,MAAMC,OAAO,CAACS,MAAM,CAAC,SAAS,IAAIA,MAAM,CAAC,SAAS,GAAG,EAAE,AAAD,EAC5DtB,GAAG,CAAC1B,KACJ4B,MAAM,CAACgB,SACPF,KAAK,CAAC,GAAG7F;YACd;QACF,GACC+E,MAAM,CAAC,CAACmB,SAAWA,OAAO1B,IAAI;QACjC6B,UAAUlD,IAAIqC,SAAS,CAAC,EAAE,KAAKrC,IAAIiB,IAAI,CAAC,WAAW,KAAK;QACxDkC,UAAUnD,IAAImB,GAAG,CAAC,QAAQ;QAC1BiC,gBAAgBpD,IAAImB,GAAG,CAAC,cAAc;IACxC;AACF;AAEA,SAASkC,QAAQC,OAAyB;;IACxC,eAAOA,QAAQC,QAAQ,oBAAhBD,QAAQC,QAAQ,MAAhBD,SAAmB5F,oCAAqBJ,eAAeI;AAChE;AAEA,4EAA4E,GAC5E,SAAS8F,OAAOC,IAAe,EAAE9B,EAAU,EAAE+B,KAAa,EAAEC,QAAgB;IAC1E,OAAO;QACLC,UAAU;QACVjC;QACAjB,QAAQ+C,KAAK/C,MAAM;QACnBmD,eAAeJ,KAAKrC,SAAS;QAC7BsC;QACAC,UAAUxD,MAAMwD;IAClB;AACF;AAaA,wEAAwE,GACxE,eAAeG,iBACbR,OAAoD,EACpDvE,KAAa,EACb0E,IAAe,EACfM,OAAuB,EACvBC,IAA2B;;IAE3B,MAAM,EAAEpE,GAAG,EAAEY,SAAS,EAAEyD,MAAM,EAAE,GAAGX;IACnC,MAAMY,aAAa,MAAM5C,eAAed,WAAWiD,KAAK/C,MAAM;IAC9D,IAAIyD,QAA4B;IAChC,IAAIC,QAAQ;IACZ,IAAIL,QAAQb,QAAQ,EAAE;YACfc;QAAL,IAAI,EAACA,oBAAAA,KAAKK,WAAW,YAAhBL,oBAAoBlG,oBAAoBiB,QAAQ;YACnD,MAAMuF,OAAO,MAAMlG,mBACjBoC,WACA;gBAAEP,OAAO8D,QAAQb,QAAQ;gBAAExC,QAAQ+C,KAAK/C,MAAM;gBAAEQ,OAAOtB,IAAIsB,KAAK;YAAC,GACjE8C,KAAKI,KAAK;YAEZD,QAAQG,KAAKC,MAAM;YACnBH,QAAQE,KAAKC,MAAM,KAAK,SAASD,KAAKF,KAAK,GAAG;QAChD,OAAO;YACLD,QAAQ;QACV;IACF;IACA,MAAMK,aAAa,MAAM3G,sBAAsB;QAC7C4G,OAAOhB,KAAKpC,IAAI;QAChB0C;QACAG;QACAC,OAAOvB,QAAQwB;QACfA;QACArF;QACAM,WAAWF,2BAA2BE,SAAS,CAACN;OAC5CkF,SAAS;QAAEA;IAAO,IAAI,CAAC;IAE7B,MAAMhB,SAASuB,WAAWD,MAAM,KAAK,OAAOC,WAAWvE,KAAK,GAAG;IAC/D,MAAMyE,QAAQ,IAAIC,IAAIT,WAAWxC,GAAG,CAAC,CAACG,WAAa;YAACA,SAASF,EAAE;YAAEE,SAASR,IAAI;SAAC;IAC/E,MAAMuD,OAAO/F,sBAAsB,CAACsF,MAAM;IAC1C,OAAO;QACLK;QACAb,UAAU;YACRkB,MAAM;YACNd,SAAS;gBAAEpC,IAAIoC,QAAQpC,EAAE;gBAAEN,MAAM0C,QAAQ1C,IAAI;YAAC;YAC9C4B;YACAiB,YAAY,SAACjB,0BAAAA,OAAQJ,WAAW,mBAAI,EAAE,EAAEnB,GAAG,CAAC,CAACC;oBAAoB+C;uBAAZ;oBAAE/C;oBAAIN,IAAI,GAAEqD,aAAAA,MAAM3D,GAAG,CAACY,eAAV+C,aAAiB/C;gBAAG;;YACrFmD,mBAAmBf,QAAQjB,OAAO,CAACpB,GAAG,CAAC,CAACqB,SAAWA,OAAO1B,IAAI;YAC9D0D,MAAM9B,SAAS/F,cAAc+F,OAAO+B,WAAW,IAAI,EAAE;YACrDb;YACAc,SAAS;YACTC,OAAON,OAAO;gBAACA;aAAK,GAAG,EAAE;QAC3B;IACF;AACF;AAEA,kEAAkE,GAClE,OAAO,SAASO,wBAAwBnB,OAA8B,CAAC,CAAC;IACtE,OAAO,OAAOV;QACZ,MAAM,EAAE1D,GAAG,EAAEY,SAAS,EAAEyD,MAAM,EAAE,GAAGX;QACnC,MAAMvE,QAAQsE,QAAQC;QACtB,MAAMzD,SAASzC,yBAAyBwC,IAAIC,MAAM;QAClD,IAAI,OAAOA,WAAW,UAAU,OAAO,aAAK3B,iBAAiBa;YAAQ4B,SAASd;;QAC9E,MAAM4D,OAAO,MAAMlD,UAAUC,WAAWZ;QACxC,IAAI,aAAa6D,MAAM,OAAO,aAAKvF,iBAAiBa;YAAQ4B,SAAS8C,KAAK9C,OAAO;;QAEjF,IAAId,OAAOE,MAAM,KAAK,WAAW;YAC/B,MAAM,EAAEyE,UAAU,EAAEb,QAAQ,EAAE,GAAG,MAAMG,iBAAiBR,SAASvE,OAAO0E,MAAM5D,OAAOkE,OAAO,EAAEC;YAC9F,MAAMoB,QAAQnH,kBAAkBuG;YAChC,IAAIA,WAAWD,MAAM,KAAK,WAAW,OAAO,aAAKa;gBAAOC,SAAS;;YACjE,IAAIb,WAAWD,MAAM,KAAK,eAAe,OAAO,aAAKa;gBAAOzE,SAAS6D,WAAWc,OAAO;;YACvF,OAAO,aACFF;gBACHG,SAAS;oBAAC/B,OAAOC,MAAMxG,uBAAuBuI,IAAI,CAAC3F,OAAOkE,OAAO,CAACpC,EAAE,GAAG,CAAC,eAAe,EAAE9B,OAAOkE,OAAO,CAAC1C,IAAI,EAAE,EAAEsC;iBAAU;;QAE9H;QAEA,IAAI9D,OAAOE,MAAM,KAAK,QAAQ;gBACdH;YAAd,MAAM6F,OAAO,EAAC7F,eAAAA,IAAI2F,OAAO,YAAX3F,eAAe,EAAE,EAAEgC,MAAM,CAAC,CAAC8D;oBAAUvI;uBAAAA,EAAAA,wBAAAA,qBAAqBuI,2BAArBvI,sBAA6B0H,IAAI,MAAK;eAAQc,MAAM;YACvG,MAAMxD,YAAYtC,OAAO+F,UAAU,CAACH,KAAK;YACzC,IAAI,CAACtD,WAAW,OAAOjE,iBAAiBa;YACxC,MAAM8G,OAAOJ,OAAO,IAAI5F,OAAO+F,UAAU,CAACD,MAAM;YAChD,MAAM5B,UAAU,MAAM7B,iBAAiB1B,WAAWiD,KAAK/C,MAAM,EAAEyB;YAC/D,IAAI,CAAC4B,SAAS;gBACZ,MAAMkB,UAAiC;oBACrCJ,MAAM;oBACNd,SAAS;wBAAEpC,IAAIQ;wBAAWd,MAAMc;oBAAU;oBAC1Cc,QAAQ;oBACRiB,YAAY,EAAE;oBACdY,mBAAmB,EAAE;oBACrBC,MAAM,EAAE;oBACRZ,OAAO;oBACPc,SAAStG;oBACTuG,OAAO,EAAE;gBACX;gBACA,OAAO,aACFhH,iBAAiBa,OAAO;oBACzBwG,SAAS;wBAAC/B,OAAOC,MAAMxG,uBAAuBuI,IAAI,CAACrD,YAAY,CAAC,eAAe,EAAEA,WAAW,EAAE8C;qBAAS;gBACzG;oBACAa,UAAUD;;YAEd;YACA,MAAM,EAAErB,UAAU,EAAEb,QAAQ,EAAE,GAAG,MAAMG,iBAAiBR,SAASvE,OAAO0E,MAAMM,SAASC;YACvF,MAAMoB,QAAQnH,kBAAkBuG;YAChC,kEAAkE;YAClE,sEAAsE;YACtE,8CAA8C;YAC9C,MAAMuB,WACJvB,WAAWD,MAAM,KAAK,OAClBZ,WACA,aACKA;gBACHsB,SAAST,WAAWD,MAAM,KAAK,gBAAgBC,WAAWc,OAAO,GAAG1G;;YAE5E,OAAO,aACFwG;gBACHG,SAAS;oBAAC/B,OAAOC,MAAMxG,uBAAuBuI,IAAI,CAACrD,YAAY,CAAC,eAAe,EAAE4B,QAAQ1C,IAAI,EAAE,EAAE0E;iBAAU;gBAC3GD,UAAUD;;QAEd;QAEA,IAAIhG,OAAOE,MAAM,KAAK,WAAW;YAC/B,MAAMyE,aAAa,MAAM7G,kBAAkB;gBACzC8G,OAAOhB,KAAKpC,IAAI;gBAChB2E,OAAOpG,IAAIoG,KAAK;gBAChBjH;gBACAM,WAAWG,sBAAsBH,SAAS,CAACN;eACvCkF,SAAS;gBAAEA;YAAO,IAAI,CAAC;YAE7B,MAAMmB,QAAQnH,kBAAkBuG;YAChC,IAAIA,WAAWD,MAAM,KAAK,WAAW,OAAO,aAAKa;gBAAOC,SAAS;;YACjE,IAAIb,WAAWD,MAAM,KAAK,eAAe,OAAO,aAAKa;gBAAOzE,SAAS6D,WAAWc,OAAO;;YACvF,MAAM3B,WAA8B;gBAAEkB,MAAM;gBAAWoB,UAAUzB,WAAWvE,KAAK;gBAAEiF,OAAO,EAAE;YAAC;YAC7F,OAAO,aACFE;gBACHG,SAAS;oBACP/B,OACEC,MACAxG,uBAAuBiJ,OAAO,EAC9B,CAAC,oBAAoB,EAAE1B,WAAWvE,KAAK,CAAC0F,MAAM,EAAE,EAChDhC;iBAEH;;QAEL;QAEA,MAAMwC,WAAW,MAAM7E,eAAed,WAAWiD,KAAK/C,MAAM;QAC5D,MAAM8D,aAAa,MAAM5G,qBAAqB;YAC5C6G,OAAOhB,KAAKpC,IAAI;YAChB2E,OAAOpG,IAAIoG,KAAK;YAChBI,uBAAuBD,SAASzE,GAAG,CAAC,CAACG,WAAaA,SAASR,IAAI;YAC/DtC;YACAM,WAAWI,yBAAyBJ,SAAS,CAACN;WAC1CkF,SAAS;YAAEA;QAAO,IAAI,CAAC;QAE7B,MAAMmB,QAAQnH,kBAAkBuG;QAChC,IAAIA,WAAWD,MAAM,KAAK,WAAW,OAAO,aAAKa;YAAOC,SAAS;;QACjE,IAAIb,WAAWD,MAAM,KAAK,eAAe,OAAO,aAAKa;YAAOzE,SAAS6D,WAAWc,OAAO;;QACvF,MAAM3B,WAAiC;YAAEkB,MAAM;WAAiBL,WAAWvE,KAAK;YAAEiF,OAAO,EAAE;;QAC3F,OAAO,aACFE;YACHG,SAAS;gBAAC/B,OAAOC,MAAMxG,uBAAuBiH,UAAU,EAAE,qCAAqCP;aAAU;;IAE7G;AACF;AAEA,OAAO,MAAM0C,uBAAuBlB,0BAAyB;AAE7D;;;;;CAKC,GACD,OAAO,MAAMmB,yBAAyC,OAAOhD;QAQ9C;IAPb,MAAMzD,SAASzC,yBAAyBkG,QAAQzD,MAAM;IACtD,IAAI,OAAOA,WAAW,UAAU,OAAO;QAAE0E,QAAQ;QAAKgC,OAAO1G;IAAO;IACpE,IAAI,CAACyD,QAAQ5C,MAAM,EAAE,OAAO;QAAE6D,QAAQ;QAAKgC,OAAOhI;IAAyB;IAC3E,MAAMiI,QAAQ,MAAM/J,oBAAoB6G,QAAQ5C,MAAM;IACtD,IAAI,CAAC8F,SAASA,UAAUlD,QAAQpC,KAAK,EAAE,OAAO;QAAEqD,QAAQ;QAAKgC,OAAO/H;IAA8B;IAClG,MAAMiI,MAAMnD,QAAQmD,GAAG;IACvB,IAAI,CAAClK,iBAAiBkK,KAAK,aAAa,OAAO;QAAElC,QAAQ;QAAKgC,OAAO9H;IAA8B;IACnG,MAAMgC,QAAO,QAAA,AAAC,CAAA,MAAM6C,QAAQ9C,SAAS,CAACK,UAAU,CAAC,SAASC,GAAG,CAACwC,QAAQ5C,MAAM,EAAEK,GAAG,EAAC,EAAGE,IAAI,cAA5E,QAAkF;IAC/F,MAAMyF,WAAW,MAAMhK,mCAAmC;QAACsC;KAAmB,EAAE;QAC9EkC,OAAOoC,QAAQpC,KAAK;QACpByF,eAAe;IACjB;IACA,IAAI,CAACD,SAASlE,QAAQ,CAACxD,uBAAuB,CAACxC,oBAAoBiK,KAAKhG,MAAMzB,qBAAqB;QACjG,OAAO;YAAEuF,QAAQ;YAAKgC,OAAO7H;QAA8B;IAC7D;IACA,OAAO;AACT,EAAC;AAED;;;CAGC,GACD,OAAO,SAASkI;IACdvI,kBAAkB,YAAYgI,sBAAsB;QAClDvG,WAAWJ,4BAA4BI,SAAS;QAChD+G,cAAclH;IAChB;IACArB,wBAAwB,YAAYtB;IACpCe,uBAAuB,YAAYuI;AACrC"}

package/src/lib/jobs/ai-job-seo-budget.d.ts

@@ -0,0 +1,52 @@
+/**
+ * @license
+ * Copyright 2026 Aglyn LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+/**
+ * The time an SEO step needs (AGL-3035), kept apart from the step: the machine
+ * registers the SEO step as it loads and defers the step itself to the first
+ * SEO job, so what it registers must be readable without loading the page
+ * readers, the audit and the doctrine behind the step.
+ */
+/**
+ * Output budgets. A batch's largest answer — every page with a title,
+ * description, heading and image descriptions at their limits — and the site
+ * proposal's are measured in `ai-job-seo-step.spec.ts`.
+ */
+export declare const AI_SEO_FIXES_MAX_TOKENS = 4000;
+export declare const AI_SEO_SITE_MAX_TOKENS = 1500;
+/**
+ * ASSUMED: how long an audit reads the site before it asks anything — every
+ * published page's version, up to 150 of them ten at a time, with the site's
+ * screens and shared layouts. The first pass reads it and then runs a unit of
+ * generated work, so the read is part of a pass's time.
+ */
+export declare const AI_SEO_AUDIT_READS_MS = 10000;
+/**
+ * The SEO step's time: whichever generation a run makes — a listing, an
+ * audit's site-wide proposal or a batch of its fixes, the largest of whose
+ * ceilings decides — answered and re-asked on the tier `job.seo` is served
+ * from, after the audit's read of the site. Each is written from the pages'
+ * own text with no site inventory, so no run makes a lookup round.
+ */
+export declare const AI_JOB_SEO_STEP_BUDGET: import("./ai-job-budget").AiJobStepBudget;
+/** The least time one SEO pass needs before it starts. */
+export declare const AI_JOB_SEO_STEP_MINIMUM_MS: number;
+/**
+ * One SEO generation's ceiling on the model a job runs: the most of `cap`
+ * whose worst case fits the least time the step registers, so a slower tier
+ * asks a batch of fixes for less rather than outrun the pass.
+ */
+export declare function aiSeoGenerationMaxTokens(model: string, cap: number): number;

package/src/lib/jobs/ai-job-seo-budget.js

@@ -0,0 +1,63 @@
+/**
+ * @license
+ * Copyright 2026 Aglyn LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */ import { AI_STEP_TIERS } from "../providers/catalog.js";
+import { AI_ROUTING_TABLE } from "../providers/routing.js";
+import { aiGenerationMaxTokensWithin, aiJobStepBudget } from "./ai-job-budget.js";
+/**
+ * The time an SEO step needs (AGL-3035), kept apart from the step: the machine
+ * registers the SEO step as it loads and defers the step itself to the first
+ * SEO job, so what it registers must be readable without loading the page
+ * readers, the audit and the doctrine behind the step.
+ */ /**
+ * Output budgets. A batch's largest answer — every page with a title,
+ * description, heading and image descriptions at their limits — and the site
+ * proposal's are measured in `ai-job-seo-step.spec.ts`.
+ */ export const AI_SEO_FIXES_MAX_TOKENS = 4000;
+export const AI_SEO_SITE_MAX_TOKENS = 1500;
+/**
+ * ASSUMED: how long an audit reads the site before it asks anything — every
+ * published page's version, up to 150 of them ten at a time, with the site's
+ * screens and shared layouts. The first pass reads it and then runs a unit of
+ * generated work, so the read is part of a pass's time.
+ */ export const AI_SEO_AUDIT_READS_MS = 10000;
+/**
+ * The SEO step's time: whichever generation a run makes — a listing, an
+ * audit's site-wide proposal or a batch of its fixes, the largest of whose
+ * ceilings decides — answered and re-asked on the tier `job.seo` is served
+ * from, after the audit's read of the site. Each is written from the pages'
+ * own text with no site inventory, so no run makes a lookup round.
+ */ export const AI_JOB_SEO_STEP_BUDGET = aiJobStepBudget({
+    tier: AI_STEP_TIERS['job.seo'],
+    maxTokens: Math.max(AI_ROUTING_TABLE['job.seo'].maxTokens, AI_SEO_SITE_MAX_TOKENS, AI_SEO_FIXES_MAX_TOKENS),
+    lookups: 0,
+    ownReadsMs: AI_SEO_AUDIT_READS_MS
+});
+/** The least time one SEO pass needs before it starts. */ export const AI_JOB_SEO_STEP_MINIMUM_MS = AI_JOB_SEO_STEP_BUDGET.minimumMs;
+/**
+ * One SEO generation's ceiling on the model a job runs: the most of `cap`
+ * whose worst case fits the least time the step registers, so a slower tier
+ * asks a batch of fixes for less rather than outrun the pass.
+ */ export function aiSeoGenerationMaxTokens(model, cap) {
+    return aiGenerationMaxTokensWithin({
+        budgetMs: AI_JOB_SEO_STEP_MINIMUM_MS,
+        model,
+        cap,
+        lookups: 0,
+        ownReadsMs: AI_SEO_AUDIT_READS_MS
+    });
+}
+
+//# sourceMappingURL=ai-job-seo-budget.js.map

package/src/lib/jobs/ai-job-seo-budget.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../../../libs/plugins/ai/src/lib/jobs/ai-job-seo-budget.ts"],"sourcesContent":["/**\n * @license\n * Copyright 2026 Aglyn LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { AI_STEP_TIERS } from '../providers/catalog'\nimport { AI_ROUTING_TABLE } from '../providers/routing'\nimport { aiGenerationMaxTokensWithin, aiJobStepBudget } from './ai-job-budget'\n\n/**\n * The time an SEO step needs (AGL-3035), kept apart from the step: the machine\n * registers the SEO step as it loads and defers the step itself to the first\n * SEO job, so what it registers must be readable without loading the page\n * readers, the audit and the doctrine behind the step.\n */\n\n/**\n * Output budgets. A batch's largest answer — every page with a title,\n * description, heading and image descriptions at their limits — and the site\n * proposal's are measured in `ai-job-seo-step.spec.ts`.\n */\nexport const AI_SEO_FIXES_MAX_TOKENS = 4_000\nexport const AI_SEO_SITE_MAX_TOKENS = 1_500\n\n/**\n * ASSUMED: how long an audit reads the site before it asks anything — every\n * published page's version, up to 150 of them ten at a time, with the site's\n * screens and shared layouts. The first pass reads it and then runs a unit of\n * generated work, so the read is part of a pass's time.\n */\nexport const AI_SEO_AUDIT_READS_MS = 10_000\n\n/**\n * The SEO step's time: whichever generation a run makes — a listing, an\n * audit's site-wide proposal or a batch of its fixes, the largest of whose\n * ceilings decides — answered and re-asked on the tier `job.seo` is served\n * from, after the audit's read of the site. Each is written from the pages'\n * own text with no site inventory, so no run makes a lookup round.\n */\nexport const AI_JOB_SEO_STEP_BUDGET = aiJobStepBudget({\n  tier: AI_STEP_TIERS['job.seo'],\n  maxTokens: Math.max(AI_ROUTING_TABLE['job.seo'].maxTokens, AI_SEO_SITE_MAX_TOKENS, AI_SEO_FIXES_MAX_TOKENS),\n  lookups: 0,\n  ownReadsMs: AI_SEO_AUDIT_READS_MS,\n})\n\n/** The least time one SEO pass needs before it starts. */\nexport const AI_JOB_SEO_STEP_MINIMUM_MS = AI_JOB_SEO_STEP_BUDGET.minimumMs\n\n/**\n * One SEO generation's ceiling on the model a job runs: the most of `cap`\n * whose worst case fits the least time the step registers, so a slower tier\n * asks a batch of fixes for less rather than outrun the pass.\n */\nexport function aiSeoGenerationMaxTokens(model: string, cap: number): number {\n  return aiGenerationMaxTokensWithin({\n    budgetMs: AI_JOB_SEO_STEP_MINIMUM_MS,\n    model,\n    cap,\n    lookups: 0,\n    ownReadsMs: AI_SEO_AUDIT_READS_MS,\n  })\n}\n"],"names":["AI_STEP_TIERS","AI_ROUTING_TABLE","aiGenerationMaxTokensWithin","aiJobStepBudget","AI_SEO_FIXES_MAX_TOKENS","AI_SEO_SITE_MAX_TOKENS","AI_SEO_AUDIT_READS_MS","AI_JOB_SEO_STEP_BUDGET","tier","maxTokens","Math","max","lookups","ownReadsMs","AI_JOB_SEO_STEP_MINIMUM_MS","minimumMs","aiSeoGenerationMaxTokens","model","cap","budgetMs"],"mappings":"AAAA;;;;;;;;;;;;;;;CAeC,GAED,SAASA,aAAa,QAAQ,0BAAsB;AACpD,SAASC,gBAAgB,QAAQ,0BAAsB;AACvD,SAASC,2BAA2B,EAAEC,eAAe,QAAQ,qBAAiB;AAE9E;;;;;CAKC,GAED;;;;CAIC,GACD,OAAO,MAAMC,0BAA0B,KAAK;AAC5C,OAAO,MAAMC,yBAAyB,KAAK;AAE3C;;;;;CAKC,GACD,OAAO,MAAMC,wBAAwB,MAAM;AAE3C;;;;;;CAMC,GACD,OAAO,MAAMC,yBAAyBJ,gBAAgB;IACpDK,MAAMR,aAAa,CAAC,UAAU;IAC9BS,WAAWC,KAAKC,GAAG,CAACV,gBAAgB,CAAC,UAAU,CAACQ,SAAS,EAAEJ,wBAAwBD;IACnFQ,SAAS;IACTC,YAAYP;AACd,GAAE;AAEF,wDAAwD,GACxD,OAAO,MAAMQ,6BAA6BP,uBAAuBQ,SAAS,CAAA;AAE1E;;;;CAIC,GACD,OAAO,SAASC,yBAAyBC,KAAa,EAAEC,GAAW;IACjE,OAAOhB,4BAA4B;QACjCiB,UAAUL;QACVG;QACAC;QACAN,SAAS;QACTC,YAAYP;IACd;AACF"}

package/src/lib/jobs/ai-job-seo-step.d.ts

@@ -0,0 +1,145 @@
+/**
+ * @license
+ * Copyright 2026 Aglyn LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+import { type LlmsTxtCollection, type LlmsTxtPage } from '@aglyn/aglyn/app-utils/llms-txt';
+import { type SeoListingFieldKey } from '@aglyn/aglyn/app-utils/seo-listing-fields';
+import type { AiJobOutput } from '../model/ai-jobs.types';
+import { type AiSeoAuditReport, type AiSeoPageFix, type AiSeoSiteFormField } from '../model/ai-seo';
+import type { AiSystemBlock } from '../runtime/ai-runtime';
+import { type AiSeoAuditPage } from '../runtime/seo-audit';
+import { type AiSeoBatchAnswer, type AiSeoBatchPage } from '../tools/ai-seo-tool';
+import { AI_SEO_FIXES_MAX_TOKENS, AI_SEO_SITE_MAX_TOKENS } from './ai-job-seo-budget';
+import type { AiJobStepRunner } from './ai-job-text-step';
+/**
+ * The `seo` step (AGL-2910): search listings and a site audit, as proposals.
+ *
+ * `inputs.target` says what the job is about:
+ *
+ * - `screen` — one page's listing, written from the version the person is
+ *   looking at (`screenId`, `versionId`), for the page's SEO card;
+ * - `product` — one product's listing, from the name and description the
+ *   product editor handed over (`name`, `text`), for the product editor;
+ * - `site` — the audit of every published page the sitemap lists, with a
+ *   proposed fix per finding, structured data for the site's entity, and the
+ *   agent guidance `/llms.txt` leads with.
+ *
+ * ## It writes nothing
+ *
+ * Like every runner, this reads, asks and returns. A listing is served
+ * straight from the screen document, the structured data and `/llms.txt`
+ * from the host document, and a page's content from its published version,
+ * so the values ride on the job's outputs and nothing else: a person puts
+ * them in the page's SEO card or the site SEO form and saves them there, and
+ * content fixes become a new version only through the apply door.
+ *
+ * ## An audit, a unit at a time
+ *
+ * The first pass reads the site — every published page's version and the
+ * shared layouts, for the links between them — scores it without a model,
+ * records the report, and runs the first unit of generated work. Each later
+ * pass runs one more unit: the site-wide proposal, then the page fixes in
+ * batches. Every pass is one reservation and one provider exchange, and it
+ * asks the machine to continue until nothing is left, so a large site is a
+ * few beats of work rather than one request that cannot finish.
+ */
+export declare const AI_SEO_NO_SITE_COPY = "This SEO job names a site this workspace does not have.";
+export declare const AI_SEO_NO_PAGE_COPY = "This page is no longer on the site.";
+export declare const AI_SEO_NO_TARGET_COPY = "This SEO job does not say what to write about.";
+export declare const AI_SEO_NO_PRODUCT_COPY = "Give the product a name before writing its listing.";
+/** Shared layouts an audit reads for the links in a site's navigation. */
+export declare const AI_SEO_LAYOUT_SCAN_LIMIT = 20;
+/** How much of each page a batch of fixes carries. */
+export declare const AI_SEO_BATCH_PAGE_TEXT_CHARS = 700;
+/**
+ * Output budgets, declared with the step's time (`ai-job-seo-budget.ts`,
+ * AGL-3035). A batch's largest answer — every page with a title, description,
+ * heading and image descriptions at their limits — and the site proposal's are
+ * measured in `ai-job-seo-step.spec.ts`.
+ */
+export { AI_SEO_FIXES_MAX_TOKENS, AI_SEO_SITE_MAX_TOKENS };
+type Firestore = FirebaseFirestore.Firestore;
+/** The host document fields this step reads. */
+export interface SeoHostDocument {
+    orgId?: string;
+    displayName?: string;
+    subdomain?: string | null;
+    cname?: string | null;
+    screens?: Record<string, string>;
+    errorScreens?: Record<string, string>;
+    notFoundScreenId?: string | null;
+    seo?: {
+        title?: string;
+        description?: string;
+        discourageSearchEngines?: boolean;
+        entity?: {
+            type?: unknown;
+            name?: string;
+            description?: string;
+            email?: string;
+            telephone?: string;
+            contactType?: string;
+        };
+        agent?: {
+            whenToUse?: string;
+            howToUse?: string;
+        };
+    };
+}
+/**
+ * The fields a listing job writes: the ones the editor named (`inputs.fields`,
+ * comma-separated) that the target's editor holds, or all of those.
+ */
+export declare function aiSeoRequestedFields(raw: unknown, allowed: readonly SeoListingFieldKey[]): SeoListingFieldKey[];
+export interface AiSeoScannedPage extends AiSeoAuditPage {
+    /** The page's node map as audited. */
+    nodes: Record<string, unknown> | null;
+}
+export interface AiSeoSiteScan {
+    pages: AiSeoScannedPage[];
+    skipped: number;
+    notes: string[];
+}
+/**
+ * Read the site the way its sitemap lists it: every screen the routing map
+ * publishes, less the template screens, the status pages and every screen
+ * that is not public — through the same shared predicates the tenant's
+ * `sitemap.xml` and `/llms.txt` apply, so the audit covers exactly the pages
+ * a crawler is handed. Then each page's published version, and the shared
+ * layouts, for the links that decide which pages nothing points to.
+ */
+export declare function scanAiSeoSite(firestore: Firestore, hostId: string, host: SeoHostDocument, rawKeywords: unknown): Promise<AiSeoSiteScan>;
+/** One unit of generated work an audit still owes. */
+export type AiSeoAuditUnit = {
+    kind: 'site';
+} | {
+    kind: 'batch';
+    batch: number;
+    of: number;
+    screenIds: string[];
+};
+/** The units an audit owes after the outputs recorded so far, in the order they run. */
+export declare function aiSeoPendingUnits(report: AiSeoAuditReport, outputs: readonly Pick<AiJobOutput, 'id'>[]): AiSeoAuditUnit[];
+export declare const AI_SEO_SITE_INSTRUCTIONS: AiSystemBlock[];
+/** The site SEO form fields blank on the site now. */
+export declare function aiSeoBlankSiteFields(host: SeoHostDocument): Set<AiSeoSiteFormField>;
+/** `/llms.txt` as it reads with `values` saved over what the site stores now. */
+export declare function aiSeoLlmsPreview(host: SeoHostDocument, values: Partial<Record<AiSeoSiteFormField, string>>, pages: readonly LlmsTxtPage[], collections: readonly LlmsTxtCollection[]): string;
+export declare const AI_SEO_FIXES_INSTRUCTIONS: AiSystemBlock[];
+/** The fixes one page gets: the model's values, its content fixes, and the guidance no fix can give. */
+export declare function aiSeoPageFixFor(page: AiSeoBatchPage, answer: AiSeoBatchAnswer | null): AiSeoPageFix;
+/** The user turn for one batch: each page's findings, what it shows now, and its text. */
+export declare function aiSeoFixesPrompt(pages: readonly AiSeoBatchPage[], titlesElsewhere: readonly string[]): string;
+export declare const runAiJobSeoStep: AiJobStepRunner;