@plumix/core 0.1.0

package/dist/rpc/procedures/entry/schemas.js

@@ -0,0 +1,171 @@
+import * as v from "valibot";
+import { entryInsertSchema } from "../../../db/schema/entries.js";
+import { slugSchema } from "../../schemas.js";
+import { idParam, metaInputSchema } from "../../validation.js";
+export const MAX_CONTENT_BYTES = 1_000_000;
+const MAX_EXCERPT_LENGTH = 600;
+// 200 covers WordPress's practical ceiling many times over while still
+// bounding pathological payloads on the record-validate path.
+const MAX_TERMS_PER_TAXONOMY = 200;
+const trimmedText = (max) => v.pipe(v.string(), v.trim(), v.minLength(1), v.maxLength(max));
+// Content is a ProseMirror JSON document. The public renderer's walker
+// allowlists node types on render, so the RPC only rejects obvious
+// garbage (non-objects). Byte-size cap is enforced in the handler via
+// `assertContentWithinByteCap` after a single serialize.
+const contentSchema = v.nullable(v.record(v.string(), v.unknown()));
+const excerptSchema = v.nullable(v.pipe(v.string(), v.maxLength(MAX_EXCERPT_LENGTH)));
+const serverControlledKeys = [
+    "id",
+    "authorId",
+    "publishedAt",
+    "createdAt",
+    "updatedAt",
+];
+const userSuppliableFields = v.omit(entryInsertSchema, serverControlledKeys);
+// termTaxonomy → ordered term ids. Empty array clears all assignments for that
+// termTaxonomy. Taxonomy keys not in the map are untouched.
+const postTermsSchema = v.record(v.pipe(v.string(), v.trim(), v.minLength(1), v.maxLength(100), v.regex(/^[a-zA-Z0-9_-]+$/, "termTaxonomy must be kebab/snake ASCII")), v.pipe(v.array(idParam), v.maxLength(MAX_TERMS_PER_TAXONOMY)));
+export const entryCreateInputSchema = v.object({
+    ...userSuppliableFields.entries,
+    type: v.optional(trimmedText(100), "post"),
+    title: trimmedText(300),
+    slug: slugSchema,
+    content: v.optional(contentSchema),
+    excerpt: v.optional(excerptSchema),
+    status: v.optional(userSuppliableFields.entries.status, "draft"),
+    parentId: v.optional(v.nullable(idParam)),
+    sortOrder: v.optional(v.pipe(v.number(), v.integer(), v.minValue(0)), 0),
+    terms: v.optional(postTermsSchema),
+    meta: v.optional(metaInputSchema),
+    /** Target publish time; required (and must be future) when `status: "scheduled"`. */
+    publishedAt: v.optional(v.date()),
+});
+export const entryUpdateInputSchema = v.object({
+    id: idParam,
+    title: v.optional(trimmedText(300)),
+    slug: v.optional(slugSchema),
+    content: v.optional(contentSchema),
+    excerpt: v.optional(excerptSchema),
+    status: v.optional(userSuppliableFields.entries.status),
+    parentId: v.optional(v.nullable(idParam)),
+    sortOrder: v.optional(v.pipe(v.number(), v.integer(), v.minValue(0))),
+    terms: v.optional(postTermsSchema),
+    meta: v.optional(metaInputSchema),
+    /** Target publish time; required (and must be future) when `status: "scheduled"`. */
+    publishedAt: v.optional(v.date()),
+    /**
+     * Optimistic-concurrency token: the live entry's `updatedAt` at the
+     * moment the caller loaded it. When provided, the server rejects
+     * with `CONFLICT { reason: "stale_expected_updated_at" }` if another
+     * write landed in between. Absent ⇒ legacy last-write-wins.
+     */
+    expectedLiveUpdatedAt: v.optional(v.date()),
+    /**
+     * Routes the write between the live row and the caller's autosave
+     * row. `'draft'` is only valid when the entry is currently published
+     * AND the type opts into `supports: ['autosave']`; otherwise the
+     * handler rejects with `BAD_REQUEST { reason: "autosave_unsupported" }`.
+     * Omitted ⇒ legacy `'live'` semantics for backwards compatibility.
+     */
+    saveAs: v.optional(v.picklist(["draft", "live"])),
+});
+// Upper bound on the term-slug list per termTaxonomy clause. Mirrors the
+// per-termTaxonomy guard on `entry.update` — admin UIs don't reasonably issue
+// queries beyond this, and the cap protects the generated `IN (?, ?, …)`
+// subquery from pathological input lengths.
+const MAX_TERM_SLUGS_PER_TAXONOMY = 50;
+const taxonomyNameSchema = v.pipe(v.string(), v.trim(), v.minLength(1), v.maxLength(100), v.regex(/^[a-zA-Z0-9_-]+$/, "termTaxonomy must be kebab/snake ASCII"));
+const termSlugSchema = v.pipe(v.string(), v.trim(), v.minLength(1), v.maxLength(200));
+// Whitelist of columns the caller is allowed to sort by. Keys are the
+// wire-level names (snake_case, matching DB columns) so the API surface
+// stays stable even if we rename the drizzle TS fields later. The handler
+// maps these to column references.
+export const ENTRY_LIST_ORDER_COLUMNS = [
+    "updated_at",
+    "published_at",
+    "title",
+    "sort_order",
+];
+export const entryListInputSchema = v.object({
+    type: v.optional(trimmedText(100)),
+    /**
+     * Status filter. Accepts a single status or a list — WP admin views
+     * like "Drafts + Pending" need arrays. When omitted, the handler
+     * excludes `trash` by default (WP's "All" semantics — trash is its
+     * own view, not part of the flat list). Pass `["trash"]` explicitly
+     * to see trashed entries.
+     */
+    status: v.optional(v.union([
+        userSuppliableFields.entries.status,
+        v.pipe(v.array(userSuppliableFields.entries.status), v.minLength(1)),
+    ])),
+    /**
+     * Filter by the entry's `authorId`. Admin "Mine" filter passes the
+     * session user's id here; future UIs can surface an author dropdown.
+     */
+    authorId: v.optional(idParam),
+    /**
+     * Filter by parent post id for hierarchical types (pages, etc.).
+     * - `null` → only top-level entries (parent_id IS NULL).
+     * - a number → only direct children of that post.
+     * - omitted → no filter, flat list across all depths.
+     */
+    parentId: v.optional(v.nullable(idParam)),
+    /**
+     * Free-text search across `title`, `content`, and `excerpt`. Whitespace
+     * separates terms (all AND-ed), `"quoted phrases"` stay whole, and a
+     * leading `-` on a bare term excludes matches (WordPress semantics).
+     * Capped at 200 chars to bound the LIKE workload per row.
+     */
+    search: v.optional(v.pipe(v.string(), v.trim(), v.maxLength(200))),
+    /**
+     * Taxonomy clauses, keyed by termTaxonomy name. Each value is a list of term
+     * slugs the post must be associated with in that termTaxonomy. Within one
+     * termTaxonomy the match is OR (any listed slug); across termTaxonomies the
+     * match is AND (every specified termTaxonomy must contribute a match).
+     * Matches the default semantics of WordPress's `tax_query`.
+     *
+     * Empty slug arrays are no-ops for that termTaxonomy.
+     */
+    termTaxonomies: v.optional(v.record(taxonomyNameSchema, v.pipe(v.array(termSlugSchema), v.maxLength(MAX_TERM_SLUGS_PER_TAXONOMY)))),
+    /**
+     * Column to sort by. Whitelisted — arbitrary values are rejected so a
+     * malicious caller can't probe the schema. `id` is always applied as a
+     * stable tiebreaker by the handler, not exposed here.
+     */
+    orderBy: v.optional(v.picklist(ENTRY_LIST_ORDER_COLUMNS), "updated_at"),
+    order: v.optional(v.picklist(["asc", "desc"]), "desc"),
+    limit: v.optional(v.pipe(v.number(), v.integer(), v.minValue(1), v.maxValue(100)), 20),
+    offset: v.optional(v.pipe(v.number(), v.integer(), v.minValue(0)), 0),
+});
+export const entryGetInputSchema = v.object({
+    id: idParam,
+    /**
+     * When `true`, the handler overlays the caller's autosave (if any)
+     * onto the live row and decorates the result with `_preview`
+     * metadata. Gated by `edit_own` / `edit_any` since previewing a
+     * pending draft is an editor concern.
+     */
+    preview: v.optional(v.boolean()),
+});
+export const entryTrashInputSchema = v.object({ id: idParam });
+export const entryRestoreInputSchema = v.object({ id: idParam });
+export const entryDeletePermanentInputSchema = v.object({ id: idParam });
+export const entryDuplicateInputSchema = v.object({ id: idParam });
+export const entryCreatePreviewLinkInputSchema = v.object({ id: idParam });
+export const entryRefreshBlockLoaderInputSchema = v.object({
+    id: idParam,
+    blockId: v.pipe(v.string(), v.minLength(1)),
+});
+// Bulk action input. Capped at 100 ids per call so a single batched
+// `WHERE id IN (…)` stays bounded; the admin selects a page at a time.
+const bulkIdsSchema = v.object({
+    ids: v.pipe(v.array(idParam), v.minLength(1), v.maxLength(100)),
+});
+export const entryTrashManyInputSchema = bulkIdsSchema;
+export const entryRestoreManyInputSchema = bulkIdsSchema;
+export const entryDeletePermanentManyInputSchema = bulkIdsSchema;
+export const entryRecentActivityInputSchema = v.object({
+    limit: v.optional(v.pipe(v.number(), v.integer(), v.minValue(1), v.maxValue(50)), 10),
+});
+//# sourceMappingURL=schemas.js.map

package/dist/rpc/procedures/entry/schemas.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"schemas.js","sourceRoot":"","sources":["../../../../src/rpc/procedures/entry/schemas.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,CAAC,MAAM,SAAS,CAAC;AAE7B,OAAO,EAAE,iBAAiB,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAC9C,OAAO,EAAE,OAAO,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAE/D,MAAM,CAAC,MAAM,iBAAiB,GAAG,SAAS,CAAC;AAC3C,MAAM,kBAAkB,GAAG,GAAG,CAAC;AAC/B,uEAAuE;AACvE,8DAA8D;AAC9D,MAAM,sBAAsB,GAAG,GAAG,CAAC;AAEnC,MAAM,WAAW,GAAG,CAAC,GAAW,EAAE,EAAE,CAClC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;AAEjE,uEAAuE;AACvE,mEAAmE;AACnE,sEAAsE;AACtE,yDAAyD;AACzD,MAAM,aAAa,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;AACpE,MAAM,aAAa,GAAG,CAAC,CAAC,QAAQ,CAC9B,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,kBAAkB,CAAC,CAAC,CACpD,CAAC;AAEF,MAAM,oBAAoB,GAAG;IAC3B,IAAI;IACJ,UAAU;IACV,aAAa;IACb,WAAW;IACX,WAAW;CACH,CAAC;AAEX,MAAM,oBAAoB,GAAG,CAAC,CAAC,IAAI,CAAC,iBAAiB,EAAE,oBAAoB,CAAC,CAAC;AAE7E,+EAA+E;AAC/E,4DAA4D;AAC5D,MAAM,eAAe,GAAG,CAAC,CAAC,MAAM,CAC9B,CAAC,CAAC,IAAI,CACJ,CAAC,CAAC,MAAM,EAAE,EACV,CAAC,CAAC,IAAI,EAAE,EACR,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EACd,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,EAChB,CAAC,CAAC,KAAK,CAAC,kBAAkB,EAAE,wCAAwC,CAAC,CACtE,EACD,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,sBAAsB,CAAC,CAAC,CAC9D,CAAC;AAEF,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC7C,GAAG,oBAAoB,CAAC,OAAO;IAC/B,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC;IAC1C,KAAK,EAAE,WAAW,CAAC,GAAG,CAAC;IACvB,IAAI,EAAE,UAAU;IAChB,OAAO,EAAE,CAAC,CAAC,QAAQ,CAAC,aAAa,CAAC;IAClC,OAAO,EAAE,CAAC,CAAC,QAAQ,CAAC,aAAa,CAAC;IAClC,MAAM,EAAE,CAAC,CAAC,QAAQ,CAAC,oBAAoB,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC;IAChE,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;IACzC,SAAS,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACxE,KAAK,EAAE,CAAC,CAAC,QAAQ,CAAC,eAAe,CAAC;IAClC,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,eAAe,CAAC;IACjC,qFAAqF;IACrF,WAAW,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;CAClC,CAAC,CAAC;AAEH,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC7C,EAAE,EAAE,OAAO;IACX,KAAK,EAAE,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IACnC,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC;IAC5B,OAAO,EAAE,CAAC,CAAC,QAAQ,CAAC,aAAa,CAAC;IAClC,OAAO,EAAE,CAAC,CAAC,QAAQ,CAAC,aAAa,CAAC;IAClC,MAAM,EAAE,CAAC,CAAC,QAAQ,CAAC,oBAAoB,CAAC,OAAO,CAAC,MAAM,CAAC;IACvD,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;IACzC,SAAS,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IACrE,KAAK,EAAE,CAAC,CAAC,QAAQ,CAAC,eAAe,CAAC;IAClC,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,eAAe,CAAC;IACjC,qFAAqF;IACrF,WAAW,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IACjC;;;;;OAKG;IACH,qBAAqB,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC3C;;;;;;OAMG;IACH,MAAM,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,OAAO,EAAE,MAAM,CAAU,CAAC,CAAC;CAC3D,CAAC,CAAC;AAEH,yEAAyE;AACzE,8EAA8E;AAC9E,yEAAyE;AACzE,4CAA4C;AAC5C,MAAM,2BAA2B,GAAG,EAAE,CAAC;AAEvC,MAAM,kBAAkB,GAAG,CAAC,CAAC,IAAI,CAC/B,CAAC,CAAC,MAAM,EAAE,EACV,CAAC,CAAC,IAAI,EAAE,EACR,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EACd,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,EAChB,CAAC,CAAC,KAAK,CAAC,kBAAkB,EAAE,wCAAwC,CAAC,CACtE,CAAC;AAEF,MAAM,cAAc,GAAG,CAAC,CAAC,IAAI,CAC3B,CAAC,CAAC,MAAM,EAAE,EACV,CAAC,CAAC,IAAI,EAAE,EACR,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EACd,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CACjB,CAAC;AAEF,sEAAsE;AACtE,wEAAwE;AACxE,0EAA0E;AAC1E,mCAAmC;AACnC,MAAM,CAAC,MAAM,wBAAwB,GAAG;IACtC,YAAY;IACZ,cAAc;IACd,OAAO;IACP,YAAY;CACJ,CAAC;AAGX,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC3C,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAClC;;;;;;OAMG;IACH,MAAM,EAAE,CAAC,CAAC,QAAQ,CAChB,CAAC,CAAC,KAAK,CAAC;QACN,oBAAoB,CAAC,OAAO,CAAC,MAAM;QACnC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,oBAAoB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;KACrE,CAAC,CACH;IACD;;;OAGG;IACH,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC;IAC7B;;;;;OAKG;IACH,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;IACzC;;;;;OAKG;IACH,MAAM,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;IAClE;;;;;;;;OAQG;IACH,cAAc,EAAE,CAAC,CAAC,QAAQ,CACxB,CAAC,CAAC,MAAM,CACN,kBAAkB,EAClB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,2BAA2B,CAAC,CAAC,CAC1E,CACF;IACD;;;;OAIG;IACH,OAAO,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,wBAAwB,CAAC,EAAE,YAAY,CAAC;IACvE,KAAK,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,MAAM,CAAU,CAAC,EAAE,MAAM,CAAC;IAC/D,KAAK,EAAE,CAAC,CAAC,QAAQ,CACf,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAC/D,EAAE,CACH;IACD,MAAM,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;CACtE,CAAC,CAAC;AAEH,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC1C,EAAE,EAAE,OAAO;IACX;;;;;OAKG;IACH,OAAO,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;CACjC,CAAC,CAAC;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;AAC/D,MAAM,CAAC,MAAM,uBAAuB,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;AACjE,MAAM,CAAC,MAAM,+BAA+B,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;AACzE,MAAM,CAAC,MAAM,yBAAyB,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;AACnE,MAAM,CAAC,MAAM,iCAAiC,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;AAE3E,MAAM,CAAC,MAAM,kCAAkC,GAAG,CAAC,CAAC,MAAM,CAAC;IACzD,EAAE,EAAE,OAAO;IACX,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;CAC5C,CAAC,CAAC;AAEH,oEAAoE;AACpE,uEAAuE;AACvE,MAAM,aAAa,GAAG,CAAC,CAAC,MAAM,CAAC;IAC7B,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;CAChE,CAAC,CAAC;AACH,MAAM,CAAC,MAAM,yBAAyB,GAAG,aAAa,CAAC;AACvD,MAAM,CAAC,MAAM,2BAA2B,GAAG,aAAa,CAAC;AACzD,MAAM,CAAC,MAAM,mCAAmC,GAAG,aAAa,CAAC;AAEjE,MAAM,CAAC,MAAM,8BAA8B,GAAG,CAAC,CAAC,MAAM,CAAC;IACrD,KAAK,EAAE,CAAC,CAAC,QAAQ,CACf,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,EAC9D,EAAE,CACH;CACF,CAAC,CAAC"}

package/dist/rpc/procedures/entry/search-terms.d.ts

@@ -0,0 +1,45 @@
+/**
+ * Query tokenizer + LIKE-escape for post search.
+ *
+ * Mirrors WordPress's default search parsing shape (see
+ * https://developer.wordpress.org/reference/classes/wp_query/parse_search/):
+ *
+ * - Double-quoted substrings become a single phrase term, verbatim
+ *   (whitespace preserved, wildcards NOT interpreted).
+ * - Bare tokens split on whitespace, each is its own term.
+ * - A leading `-` on a bare token flags exclusion (NOT LIKE). Inside
+ *   quotes, `-` is literal.
+ * - Stopwords / sentence-mode fallback from WP are deliberately skipped —
+ *   they're English-biased and can be added later via a search plugin.
+ *
+ * The handler side joins terms with AND and joins column matches for each
+ * term with OR (`title OR content OR excerpt`). This module owns the
+ * parsing and escaping only; it doesn't construct SQL.
+ */
+export interface SearchTerm {
+    /** The plain substring to match (unescaped, unquoted). */
+    readonly value: string;
+    /** True for `-term`: wrap the column-OR clause in NOT (…). */
+    readonly exclude: boolean;
+}
+/**
+ * Tokenize a raw search string into phrases and terms.
+ *
+ * - Quoted phrases (`"a b"`) become a single term; the outer quotes are
+ *   stripped, inner content is preserved verbatim. An unterminated opening
+ *   quote consumes to end of input — matches WP's tolerant behavior.
+ * - Bare runs of non-whitespace are individual terms.
+ * - A leading `-` on a bare term marks exclusion; a bare `-` with no
+ *   following characters is dropped.
+ * - Empty / whitespace-only input yields an empty array.
+ */
+export declare function tokenizeSearchQuery(raw: string): readonly SearchTerm[];
+/**
+ * Escape a raw term for use inside a SQL `LIKE` pattern.
+ *
+ * The handler pairs each `LIKE ?` with `ESCAPE '\\'`, so this function
+ * backslash-escapes the three wildcard characters `\ % _`. Without this,
+ * a user searching for `50%` would match every post.
+ */
+export declare function escapeLikePattern(term: string): string;
+//# sourceMappingURL=search-terms.d.ts.map

package/dist/rpc/procedures/entry/search-terms.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"search-terms.d.ts","sourceRoot":"","sources":["../../../../src/rpc/procedures/entry/search-terms.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAOH,MAAM,WAAW,UAAU;IACzB,0DAA0D;IAC1D,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,8DAA8D;IAC9D,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;CAC3B;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,MAAM,GAAG,SAAS,UAAU,EAAE,CA8BtE;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAEtD"}

package/dist/rpc/procedures/entry/search-terms.js

@@ -0,0 +1,79 @@
+/**
+ * Query tokenizer + LIKE-escape for post search.
+ *
+ * Mirrors WordPress's default search parsing shape (see
+ * https://developer.wordpress.org/reference/classes/wp_query/parse_search/):
+ *
+ * - Double-quoted substrings become a single phrase term, verbatim
+ *   (whitespace preserved, wildcards NOT interpreted).
+ * - Bare tokens split on whitespace, each is its own term.
+ * - A leading `-` on a bare token flags exclusion (NOT LIKE). Inside
+ *   quotes, `-` is literal.
+ * - Stopwords / sentence-mode fallback from WP are deliberately skipped —
+ *   they're English-biased and can be added later via a search plugin.
+ *
+ * The handler side joins terms with AND and joins column matches for each
+ * term with OR (`title OR content OR excerpt`). This module owns the
+ * parsing and escaping only; it doesn't construct SQL.
+ */
+// Unicode-aware: matches NBSP, em-space, etc. Shared between the outer
+// skip and the inner token-end scan so a non-ASCII whitespace char can
+// never produce an empty token + stuck cursor (earlier regression).
+const WHITESPACE = /\s/;
+/**
+ * Tokenize a raw search string into phrases and terms.
+ *
+ * - Quoted phrases (`"a b"`) become a single term; the outer quotes are
+ *   stripped, inner content is preserved verbatim. An unterminated opening
+ *   quote consumes to end of input — matches WP's tolerant behavior.
+ * - Bare runs of non-whitespace are individual terms.
+ * - A leading `-` on a bare term marks exclusion; a bare `-` with no
+ *   following characters is dropped.
+ * - Empty / whitespace-only input yields an empty array.
+ */
+export function tokenizeSearchQuery(raw) {
+    const terms = [];
+    let i = 0;
+    while (i < raw.length) {
+        const ch = raw.charAt(i);
+        if (WHITESPACE.test(ch)) {
+            i++;
+            continue;
+        }
+        if (ch === '"') {
+            const end = raw.indexOf('"', i + 1);
+            const close = end === -1 ? raw.length : end;
+            const inner = raw.slice(i + 1, close);
+            if (inner.length > 0)
+                terms.push({ value: inner, exclude: false });
+            i = close + 1;
+            continue;
+        }
+        let j = i;
+        while (j < raw.length && !WHITESPACE.test(raw.charAt(j)))
+            j++;
+        const token = raw.slice(i, j);
+        i = j;
+        if (token.length === 0)
+            continue;
+        if (token.startsWith("-")) {
+            const rest = token.slice(1);
+            if (rest.length > 0)
+                terms.push({ value: rest, exclude: true });
+            continue;
+        }
+        terms.push({ value: token, exclude: false });
+    }
+    return terms;
+}
+/**
+ * Escape a raw term for use inside a SQL `LIKE` pattern.
+ *
+ * The handler pairs each `LIKE ?` with `ESCAPE '\\'`, so this function
+ * backslash-escapes the three wildcard characters `\ % _`. Without this,
+ * a user searching for `50%` would match every post.
+ */
+export function escapeLikePattern(term) {
+    return term.replace(/[\\%_]/g, "\\$&");
+}
+//# sourceMappingURL=search-terms.js.map

package/dist/rpc/procedures/entry/search-terms.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"search-terms.js","sourceRoot":"","sources":["../../../../src/rpc/procedures/entry/search-terms.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,uEAAuE;AACvE,uEAAuE;AACvE,oEAAoE;AACpE,MAAM,UAAU,GAAG,IAAI,CAAC;AASxB;;;;;;;;;;GAUG;AACH,MAAM,UAAU,mBAAmB,CAAC,GAAW;IAC7C,MAAM,KAAK,GAAiB,EAAE,CAAC;IAC/B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC;QACtB,MAAM,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACxB,CAAC,EAAE,CAAC;YACJ,SAAS;QACX,CAAC;QACD,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACf,MAAM,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YACpC,MAAM,KAAK,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC;YAC5C,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;YACtC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;YACnE,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;YACd,SAAS;QACX,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CAAC,GAAG,GAAG,CAAC,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAAE,CAAC,EAAE,CAAC;QAC9D,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9B,CAAC,GAAG,CAAC,CAAC;QACN,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACjC,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;YAChE,SAAS;QACX,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;IAC/C,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAY;IAC5C,OAAO,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;AACzC,CAAC"}

package/dist/rpc/procedures/entry/terms.d.ts

@@ -0,0 +1,61 @@
+import type { AppContext } from "../../../context/app.js";
+interface TermPatchThrowers {
+    taxonomyNotFound(taxonomy: string): never;
+    forbidden(capability: string): never;
+    termTaxonomyMismatch(): never;
+}
+interface TermsPatchErrorMap {
+    NOT_FOUND(opts: {
+        data: {
+            kind: string;
+            id: string | number;
+        };
+    }): Error;
+    FORBIDDEN(opts: {
+        data: {
+            capability: string;
+        };
+    }): Error;
+    CONFLICT(opts: {
+        data: {
+            reason: string;
+        };
+    }): Error;
+}
+/**
+ * Build the standard guard-callback bundle entry create / update both
+ * pass to `assertTermsPatchValid`: NOT_FOUND for unknown taxonomies,
+ * FORBIDDEN for missing assign capability, CONFLICT for cross-taxonomy
+ * mismatch. Centralizes the rpc-error shapes shared between the two
+ * procedures so a future error-payload tweak only changes here.
+ */
+export declare function buildTermsPatchGuards(errors: TermsPatchErrorMap): TermPatchThrowers;
+/**
+ * Validate a `terms` patch from an entry create/update payload:
+ * - every taxonomy must be registered with core
+ * - the caller must hold `term:<taxonomy>:assign` for each taxonomy
+ *   that appears in the patch
+ * - each (taxonomy, termId) pair must reference an existing term in
+ *   that taxonomy (catches cross-taxonomy id reuse and stale ids)
+ *
+ * Pure validation — no writes happen here. Callers run this before
+ * inserting the entry row so a bad patch fails up-front rather than
+ * leaving an orphaned entry behind.
+ */
+export declare function assertTermsPatchValid(context: AppContext, termsPatch: Record<string, readonly number[]>, throwers: TermPatchThrowers): Promise<void>;
+/**
+ * Replace `entry_term` rows for every (entryId, taxonomy) pair in the
+ * patch. Each taxonomy is rewritten independently — taxonomies absent
+ * from the patch keep their existing assignments. An empty array
+ * clears the taxonomy's assignments without touching the others.
+ */
+export declare function applyTermPatch(context: AppContext, entryId: number, termsPatch: Record<string, readonly number[]>): Promise<void>;
+/**
+ * Load the assigned term ids per taxonomy for an entry, shaped for
+ * the wire as `{ [taxonomy]: number[] }`. Empty taxonomies are
+ * omitted; ordering matches the `entry_term.sortOrder` the editor
+ * persisted.
+ */
+export declare function loadEntryTerms(context: AppContext, entryId: number): Promise<Record<string, number[]>>;
+export {};
+//# sourceMappingURL=terms.d.ts.map

package/dist/rpc/procedures/entry/terms.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"terms.d.ts","sourceRoot":"","sources":["../../../../src/rpc/procedures/entry/terms.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,yBAAyB,CAAC;AAQ1D,UAAU,iBAAiB;IACzB,gBAAgB,CAAC,QAAQ,EAAE,MAAM,GAAG,KAAK,CAAC;IAC1C,SAAS,CAAC,UAAU,EAAE,MAAM,GAAG,KAAK,CAAC;IACrC,oBAAoB,IAAI,KAAK,CAAC;CAC/B;AAED,UAAU,kBAAkB;IAC1B,SAAS,CAAC,IAAI,EAAE;QAAE,IAAI,EAAE;YAAE,IAAI,EAAE,MAAM,CAAC;YAAC,EAAE,EAAE,MAAM,GAAG,MAAM,CAAA;SAAE,CAAA;KAAE,GAAG,KAAK,CAAC;IACxE,SAAS,CAAC,IAAI,EAAE;QAAE,IAAI,EAAE;YAAE,UAAU,EAAE,MAAM,CAAA;SAAE,CAAA;KAAE,GAAG,KAAK,CAAC;IACzD,QAAQ,CAAC,IAAI,EAAE;QAAE,IAAI,EAAE;YAAE,MAAM,EAAE,MAAM,CAAA;SAAE,CAAA;KAAE,GAAG,KAAK,CAAC;CACrD;AAED;;;;;;GAMG;AACH,wBAAgB,qBAAqB,CACnC,MAAM,EAAE,kBAAkB,GACzB,iBAAiB,CAcnB;AAED;;;;;;;;;;;GAWG;AACH,wBAAsB,qBAAqB,CACzC,OAAO,EAAE,UAAU,EACnB,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,EAC7C,QAAQ,EAAE,iBAAiB,GAC1B,OAAO,CAAC,IAAI,CAAC,CAoBf;AAED;;;;;GAKG;AACH,wBAAsB,cAAc,CAClC,OAAO,EAAE,UAAU,EACnB,OAAO,EAAE,MAAM,EACf,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,GAC5C,OAAO,CAAC,IAAI,CAAC,CAsCf;AAED;;;;;GAKG;AACH,wBAAsB,cAAc,CAClC,OAAO,EAAE,UAAU,EACnB,OAAO,EAAE,MAAM,GACd,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,CAuBnC"}

package/dist/rpc/procedures/entry/terms.js

@@ -0,0 +1,128 @@
+import { and, eq, inArray } from "../../../db/index.js";
+import { entryTerm } from "../../../db/schema/entry_term.js";
+import { terms } from "../../../db/schema/terms.js";
+/**
+ * Build the standard guard-callback bundle entry create / update both
+ * pass to `assertTermsPatchValid`: NOT_FOUND for unknown taxonomies,
+ * FORBIDDEN for missing assign capability, CONFLICT for cross-taxonomy
+ * mismatch. Centralizes the rpc-error shapes shared between the two
+ * procedures so a future error-payload tweak only changes here.
+ */
+export function buildTermsPatchGuards(errors) {
+    return {
+        taxonomyNotFound: (taxonomy) => {
+            throw errors.NOT_FOUND({
+                data: { kind: "termTaxonomy", id: taxonomy },
+            });
+        },
+        forbidden: (capability) => {
+            throw errors.FORBIDDEN({ data: { capability } });
+        },
+        termTaxonomyMismatch: () => {
+            throw errors.CONFLICT({ data: { reason: "term_taxonomy_mismatch" } });
+        },
+    };
+}
+/**
+ * Validate a `terms` patch from an entry create/update payload:
+ * - every taxonomy must be registered with core
+ * - the caller must hold `term:<taxonomy>:assign` for each taxonomy
+ *   that appears in the patch
+ * - each (taxonomy, termId) pair must reference an existing term in
+ *   that taxonomy (catches cross-taxonomy id reuse and stale ids)
+ *
+ * Pure validation — no writes happen here. Callers run this before
+ * inserting the entry row so a bad patch fails up-front rather than
+ * leaving an orphaned entry behind.
+ */
+export async function assertTermsPatchValid(context, termsPatch, throwers) {
+    for (const taxonomy of Object.keys(termsPatch)) {
+        if (!context.plugins.termTaxonomies.has(taxonomy)) {
+            throwers.taxonomyNotFound(taxonomy);
+        }
+        if (!context.auth.can(`term:${taxonomy}:assign`)) {
+            throwers.forbidden(`term:${taxonomy}:assign`);
+        }
+    }
+    for (const [taxonomy, termIds] of Object.entries(termsPatch)) {
+        const unique = Array.from(new Set(termIds));
+        if (unique.length === 0)
+            continue;
+        const rows = await context.db
+            .select({ id: terms.id })
+            .from(terms)
+            .where(and(eq(terms.taxonomy, taxonomy), inArray(terms.id, unique)));
+        if (rows.length !== unique.length) {
+            throwers.termTaxonomyMismatch();
+        }
+    }
+}
+/**
+ * Replace `entry_term` rows for every (entryId, taxonomy) pair in the
+ * patch. Each taxonomy is rewritten independently — taxonomies absent
+ * from the patch keep their existing assignments. An empty array
+ * clears the taxonomy's assignments without touching the others.
+ */
+export async function applyTermPatch(context, entryId, termsPatch) {
+    for (const [taxonomy, termIds] of Object.entries(termsPatch)) {
+        const unique = Array.from(new Set(termIds));
+        // Scope the delete to rows whose term belongs to this taxonomy — saves a
+        // per-term round-trip and avoids accidentally wiping another taxonomy's
+        // rows in the same entry_term table.
+        const existingAssignments = await context.db
+            .select({ termId: entryTerm.termId })
+            .from(entryTerm)
+            .innerJoin(terms, eq(entryTerm.termId, terms.id))
+            .where(and(eq(entryTerm.entryId, entryId), eq(terms.taxonomy, taxonomy)));
+        if (existingAssignments.length > 0) {
+            const ids = existingAssignments.map((r) => r.termId);
+            await context.db
+                .delete(entryTerm)
+                .where(and(eq(entryTerm.entryId, entryId), inArray(entryTerm.termId, ids)));
+        }
+        if (unique.length > 0) {
+            // onConflictDoNothing handles the race where a concurrent write beat us
+            // to inserting the same (entryId, termId) row — the desired end state
+            // (row exists) is reached regardless of which request inserted it.
+            await context.db
+                .insert(entryTerm)
+                .values(unique.map((termId, index) => ({
+                entryId,
+                termId,
+                sortOrder: index,
+            })))
+                .onConflictDoNothing({
+                target: [entryTerm.entryId, entryTerm.termId],
+            });
+        }
+    }
+}
+/**
+ * Load the assigned term ids per taxonomy for an entry, shaped for
+ * the wire as `{ [taxonomy]: number[] }`. Empty taxonomies are
+ * omitted; ordering matches the `entry_term.sortOrder` the editor
+ * persisted.
+ */
+export async function loadEntryTerms(context, entryId) {
+    const rows = await context.db
+        .select({
+        taxonomy: terms.taxonomy,
+        termId: entryTerm.termId,
+        sortOrder: entryTerm.sortOrder,
+    })
+        .from(entryTerm)
+        .innerJoin(terms, eq(entryTerm.termId, terms.id))
+        .where(eq(entryTerm.entryId, entryId));
+    const grouped = {};
+    for (const row of rows) {
+        const bucket = (grouped[row.taxonomy] ??= []);
+        bucket.push({ termId: row.termId, sortOrder: row.sortOrder });
+    }
+    const out = {};
+    for (const [taxonomy, items] of Object.entries(grouped)) {
+        items.sort((a, b) => a.sortOrder - b.sortOrder);
+        out[taxonomy] = items.map((i) => i.termId);
+    }
+    return out;
+}
+//# sourceMappingURL=terms.js.map

package/dist/rpc/procedures/entry/terms.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"terms.js","sourceRoot":"","sources":["../../../../src/rpc/procedures/entry/terms.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,OAAO,EAAE,MAAM,sBAAsB,CAAC;AACxD,OAAO,EAAE,SAAS,EAAE,MAAM,kCAAkC,CAAC;AAC7D,OAAO,EAAE,KAAK,EAAE,MAAM,6BAA6B,CAAC;AAiBpD;;;;;;GAMG;AACH,MAAM,UAAU,qBAAqB,CACnC,MAA0B;IAE1B,OAAO;QACL,gBAAgB,EAAE,CAAC,QAAQ,EAAE,EAAE;YAC7B,MAAM,MAAM,CAAC,SAAS,CAAC;gBACrB,IAAI,EAAE,EAAE,IAAI,EAAE,cAAc,EAAE,EAAE,EAAE,QAAQ,EAAE;aAC7C,CAAC,CAAC;QACL,CAAC;QACD,SAAS,EAAE,CAAC,UAAU,EAAE,EAAE;YACxB,MAAM,MAAM,CAAC,SAAS,CAAC,EAAE,IAAI,EAAE,EAAE,UAAU,EAAE,EAAE,CAAC,CAAC;QACnD,CAAC;QACD,oBAAoB,EAAE,GAAG,EAAE;YACzB,MAAM,MAAM,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,wBAAwB,EAAE,EAAE,CAAC,CAAC;QACxE,CAAC;KACF,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CACzC,OAAmB,EACnB,UAA6C,EAC7C,QAA2B;IAE3B,KAAK,MAAM,QAAQ,IAAI,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;QAC/C,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAClD,QAAQ,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;QACtC,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,QAAQ,SAAS,CAAC,EAAE,CAAC;YACjD,QAAQ,CAAC,SAAS,CAAC,QAAQ,QAAQ,SAAS,CAAC,CAAC;QAChD,CAAC;IACH,CAAC;IACD,KAAK,MAAM,CAAC,QAAQ,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;QAC7D,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5C,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAClC,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,EAAE;aAC1B,MAAM,CAAC,EAAE,EAAE,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC;aACxB,IAAI,CAAC,KAAK,CAAC;aACX,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;QACvE,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC;YAClC,QAAQ,CAAC,oBAAoB,EAAE,CAAC;QAClC,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,OAAmB,EACnB,OAAe,EACf,UAA6C;IAE7C,KAAK,MAAM,CAAC,QAAQ,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;QAC7D,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5C,yEAAyE;QACzE,wEAAwE;QACxE,qCAAqC;QACrC,MAAM,mBAAmB,GAAG,MAAM,OAAO,CAAC,EAAE;aACzC,MAAM,CAAC,EAAE,MAAM,EAAE,SAAS,CAAC,MAAM,EAAE,CAAC;aACpC,IAAI,CAAC,SAAS,CAAC;aACf,SAAS,CAAC,KAAK,EAAE,EAAE,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;aAChD,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC5E,IAAI,mBAAmB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACnC,MAAM,GAAG,GAAG,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YACrD,MAAM,OAAO,CAAC,EAAE;iBACb,MAAM,CAAC,SAAS,CAAC;iBACjB,KAAK,CACJ,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CACpE,CAAC;QACN,CAAC;QAED,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,wEAAwE;YACxE,sEAAsE;YACtE,mEAAmE;YACnE,MAAM,OAAO,CAAC,EAAE;iBACb,MAAM,CAAC,SAAS,CAAC;iBACjB,MAAM,CACL,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;gBAC7B,OAAO;gBACP,MAAM;gBACN,SAAS,EAAE,KAAK;aACjB,CAAC,CAAC,CACJ;iBACA,mBAAmB,CAAC;gBACnB,MAAM,EAAE,CAAC,SAAS,CAAC,OAAO,EAAE,SAAS,CAAC,MAAM,CAAC;aAC9C,CAAC,CAAC;QACP,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,OAAmB,EACnB,OAAe;IAEf,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,EAAE;SAC1B,MAAM,CAAC;QACN,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,MAAM,EAAE,SAAS,CAAC,MAAM;QACxB,SAAS,EAAE,SAAS,CAAC,SAAS;KAC/B,CAAC;SACD,IAAI,CAAC,SAAS,CAAC;SACf,SAAS,CAAC,KAAK,EAAE,EAAE,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;SAChD,KAAK,CAAC,EAAE,CAAC,SAAS,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;IAEzC,MAAM,OAAO,GAA4D,EAAE,CAAC;IAC5E,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,MAAM,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;QAC9C,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,EAAE,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC;IAChE,CAAC;IAED,MAAM,GAAG,GAA6B,EAAE,CAAC;IACzC,KAAK,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;QACxD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;QAChD,GAAG,CAAC,QAAQ,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IAC7C,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/rpc/procedures/entry/trash.d.ts

@@ -0,0 +1,90 @@
+export declare const trash: import("@orpc/server").DecoratedProcedure<import("@orpc/server").MergedInitialContext<import("../../../index.js").AppContextBase<typeof import("../../../db/schema/index.js")> & import("../../../index.js").AppContextExtensions & Record<never, never>, import("../../../index.js").AppContextBase<typeof import("../../../db/schema/index.js")> & import("../../../index.js").AppContextExtensions & Record<never, never>, import("../../../index.js").AppContext>, import("@orpc/server").MergedCurrentContext<import("../../../index.js").AppContext, import("../../../index.js").AuthenticatedAppContext<typeof import("../../../db/schema/index.js")>>, import("valibot").ObjectSchema<{
+    readonly id: import("valibot").SchemaWithPipe<readonly [import("valibot").NumberSchema<undefined>, import("valibot").IntegerAction<number, undefined>, import("valibot").MinValueAction<number, 1, undefined>, import("valibot").MaxValueAction<number, number, undefined>]>;
+}, undefined>, import("@orpc/server").Schema<{
+    id: number;
+    meta: Record<string, unknown>;
+    createdAt: Date;
+    updatedAt: Date;
+    type: string;
+    parentId: number | null;
+    title: string;
+    slug: string;
+    content: import("../../../index.js").EntryContent | null;
+    excerpt: string | null;
+    status: "draft" | "published" | "scheduled" | "trash";
+    authorId: number;
+    sortOrder: number;
+    publishedAt: Date | null;
+}, {
+    id: number;
+    meta: Record<string, unknown>;
+    createdAt: Date;
+    updatedAt: Date;
+    type: string;
+    parentId: number | null;
+    title: string;
+    slug: string;
+    content: import("../../../index.js").EntryContent | null;
+    excerpt: string | null;
+    status: "draft" | "published" | "scheduled" | "trash";
+    authorId: number;
+    sortOrder: number;
+    publishedAt: Date | null;
+}>, import("@orpc/server").MergedErrorMap<Record<never, never>, {
+    readonly UNAUTHORIZED: {
+        readonly message: "Authentication required";
+    };
+    readonly BAD_REQUEST: {
+        readonly message: "Invalid input";
+        readonly data: import("valibot").ObjectSchema<{
+            readonly reason: import("valibot").StringSchema<undefined>;
+        }, undefined>;
+    };
+    readonly FORBIDDEN: {
+        readonly message: "Permission denied";
+        readonly data: import("valibot").ObjectSchema<{
+            readonly capability: import("valibot").StringSchema<undefined>;
+        }, undefined>;
+    };
+    readonly NOT_FOUND: {
+        readonly message: "Resource not found";
+        readonly data: import("valibot").ObjectSchema<{
+            readonly kind: import("valibot").StringSchema<undefined>;
+            readonly id: import("valibot").UnionSchema<[import("valibot").StringSchema<undefined>, import("valibot").NumberSchema<undefined>], undefined>;
+        }, undefined>;
+    };
+    readonly CONFLICT: {
+        readonly message: "Resource conflict";
+        readonly data: import("valibot").ObjectSchema<{
+            readonly reason: import("valibot").StringSchema<undefined>;
+            readonly key: import("valibot").OptionalSchema<import("valibot").StringSchema<undefined>, undefined>;
+        }, undefined>;
+    };
+    readonly PAYLOAD_TOO_LARGE: {
+        readonly message: "Payload too large";
+        readonly data: import("valibot").ObjectSchema<{
+            readonly limit: import("valibot").NumberSchema<undefined>;
+            readonly received: import("valibot").OptionalSchema<import("valibot").NumberSchema<undefined>, undefined>;
+        }, undefined>;
+    };
+    readonly UNSUPPORTED_MEDIA_TYPE: {
+        readonly message: "Unsupported media type";
+        readonly data: import("valibot").ObjectSchema<{
+            readonly mime: import("valibot").StringSchema<undefined>;
+        }, undefined>;
+    };
+    readonly INVALID_BLOCK_CONTENT: {
+        readonly message: "Block content failed registry validation";
+        readonly data: import("valibot").ObjectSchema<{
+            readonly issues: import("valibot").ArraySchema<import("valibot").ObjectSchema<{
+                readonly code: import("valibot").StringSchema<undefined>;
+                readonly message: import("valibot").StringSchema<undefined>;
+                readonly path: import("valibot").StringSchema<undefined>;
+                readonly nodeName: import("valibot").OptionalSchema<import("valibot").StringSchema<undefined>, undefined>;
+                readonly attributeName: import("valibot").OptionalSchema<import("valibot").StringSchema<undefined>, undefined>;
+                readonly markName: import("valibot").OptionalSchema<import("valibot").StringSchema<undefined>, undefined>;
+            }, undefined>, undefined>;
+        }, undefined>;
+    };
+}>, Record<never, never>>;
+//# sourceMappingURL=trash.d.ts.map

package/dist/rpc/procedures/entry/trash.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"trash.d.ts","sourceRoot":"","sources":["../../../../src/rpc/procedures/entry/trash.ts"],"names":[],"mappings":"AAWA,eAAO,MAAM,KAAK;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;yBA8Bd,CAAC"}

package/dist/rpc/procedures/entry/trash.js

@@ -0,0 +1,27 @@
+import { eq } from "../../../db/index.js";
+import { entries } from "../../../db/schema/entries.js";
+import { authenticated } from "../../authenticated.js";
+import { base } from "../../base.js";
+import { entryDeletableGuards, fireEntryTrashed, loadDeletableEntry, } from "./lifecycle.js";
+import { entryTrashInputSchema } from "./schemas.js";
+export const trash = base
+    .use(authenticated)
+    .input(entryTrashInputSchema)
+    .handler(async ({ input, context, errors }) => {
+    const filtered = await context.hooks.applyFilter("rpc:entry.trash:input", input);
+    const existing = await loadDeletableEntry(context, filtered.id, entryDeletableGuards(errors));
+    if (existing.status === "trash") {
+        return context.hooks.applyFilter("rpc:entry.trash:output", existing);
+    }
+    const [trashed] = await context.db
+        .update(entries)
+        .set({ status: "trash" })
+        .where(eq(entries.id, existing.id))
+        .returning();
+    if (!trashed) {
+        throw errors.CONFLICT({ data: { reason: "trash_failed" } });
+    }
+    await fireEntryTrashed(context, trashed);
+    return context.hooks.applyFilter("rpc:entry.trash:output", trashed);
+});
+//# sourceMappingURL=trash.js.map

package/dist/rpc/procedures/entry/trash.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"trash.js","sourceRoot":"","sources":["../../../../src/rpc/procedures/entry/trash.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,EAAE,EAAE,MAAM,sBAAsB,CAAC;AAC1C,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AACrC,OAAO,EACL,oBAAoB,EACpB,gBAAgB,EAChB,kBAAkB,GACnB,MAAM,gBAAgB,CAAC;AACxB,OAAO,EAAE,qBAAqB,EAAE,MAAM,cAAc,CAAC;AAErD,MAAM,CAAC,MAAM,KAAK,GAAG,IAAI;KACtB,GAAG,CAAC,aAAa,CAAC;KAClB,KAAK,CAAC,qBAAqB,CAAC;KAC5B,OAAO,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE;IAC5C,MAAM,QAAQ,GAAG,MAAM,OAAO,CAAC,KAAK,CAAC,WAAW,CAC9C,uBAAuB,EACvB,KAAK,CACN,CAAC;IAEF,MAAM,QAAQ,GAAG,MAAM,kBAAkB,CACvC,OAAO,EACP,QAAQ,CAAC,EAAE,EACX,oBAAoB,CAAC,MAAM,CAAC,CAC7B,CAAC;IAEF,IAAI,QAAQ,CAAC,MAAM,KAAK,OAAO,EAAE,CAAC;QAChC,OAAO,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,wBAAwB,EAAE,QAAQ,CAAC,CAAC;IACvE,CAAC;IAED,MAAM,CAAC,OAAO,CAAC,GAAG,MAAM,OAAO,CAAC,EAAE;SAC/B,MAAM,CAAC,OAAO,CAAC;SACf,GAAG,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;SACxB,KAAK,CAAC,EAAE,CAAC,OAAO,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;SAClC,SAAS,EAAE,CAAC;IACf,IAAI,CAAC,OAAO,EAAE,CAAC;QACb,MAAM,MAAM,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,cAAc,EAAE,EAAE,CAAC,CAAC;IAC9D,CAAC;IAED,MAAM,gBAAgB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IACzC,OAAO,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,wBAAwB,EAAE,OAAO,CAAC,CAAC;AACtE,CAAC,CAAC,CAAC"}