@rebasepro/server-postgres 0.24.0 → 0.24.1-canary.g19596ef

package/dist/security/rls-enforcement.d.ts

@@ -31,8 +31,9 @@ import { REBASE_USER_ROLE } from "@rebasepro/common";
  *     SELECT/INSERT/UPDATE/DELETE grants (+ default privileges so future
  *     tables stay covered).
  *  3. {@link applyAuthContext} — per-transaction: set the `app.*` GUCs the
- *     policies read (`rebase.uid()` etc.) and `SET LOCAL ROLE rebase_user` so
- *     RLS binds. Transaction-scoped, so it composes with poolers.
+ *     policies read (`rebase.uid()` etc.) and the transaction-local role
+ *     `rebase_user` so RLS binds, in one statement. Transaction-scoped, so it
+ *     composes with poolers.
  *
  * Provisioning runs from the framework's own bootstrap/migrate (which already
  * self-creates the `auth` schema and functions) — enforcement is default-on,
@@ -203,11 +204,38 @@ export declare function appRoleSetupInstructions(connectionRole: string, schemas
  * connection cannot create it.
  */
 export declare function ensureAppRole(run: RawSqlRunner, schemas: string[]): Promise<void>;
+/**
+ * The grant tier of {@link ensureAppRole} on its own: `USAGE` on each existing
+ * schema in `schemas`, DML on its tables and `USAGE, SELECT` on its
+ * sequences, the default privileges that cover what this role creates later,
+ * and Rebase's own tables taken back — for a role and membership already
+ * provisioned.
+ *
+ * Every statement is issued only when the catalogue says it would change
+ * something. They used to run unconditionally, twice per boot (at connect, and
+ * again in the final posture check): a `GRANT … ON ALL TABLES` rewrites every
+ * table's `pg_class` row whether or not the ACL changes, which invalidates
+ * every table's cached plans on every connection, and the internal-table sweep
+ * ran 23 `REVOKE`s per schema. A boot against a database whose grants already
+ * hold now reads one catalogue query and writes nothing; one that is missing
+ * any of them runs exactly the statements it always ran.
+ *
+ * Table owners (the expected non-superuser posture) can always grant on their
+ * own objects, so this needs no extra privilege.
+ */
+export declare function ensureAppRoleGrants(run: RawSqlRunner, schemas: string[]): Promise<void>;
+/**
+ * Rebase's own RLS-off tables in `schema` that a `revokeInternalTableAccess`
+ * sweep would change — the user role holds a privilege on them, or their ACL
+ * has never been written. One read; the sweep it narrows is one `DO` per
+ * table name.
+ */
+export declare function internalTablesGrantedToUserRole(run: RawSqlRunner, schema: string): Promise<string[]>;
 /**
  * Apply the authenticated context to a transaction: the `app.*` GUCs that RLS
  * policies read via `rebase.uid()` / `rebase.roles()` / `rebase.jwt()`, and — when
- * `userRole` is set — `SET LOCAL ROLE` so RLS binds every statement in this
- * transaction (reads *and* writes).
+ * `userRole` is set — the `LOCAL` role switch, in the same statement, so RLS
+ * binds every statement in this transaction (reads *and* writes).
  *
  * GUCs are set with `is_local = true` and the role switch is `LOCAL`: both
  * reset at commit/rollback, so pooled connections are never polluted.

package/dist/services/BranchService.d.ts

@@ -61,6 +61,13 @@ export declare class BranchService {
      * pane into a failure with a "Try again" that can never succeed.
      */
     private assertBranchingSupported;
+    /**
+     * Whether the `rebase.branches` registry exists. A database that has never
+     * had a branch made on it may not have it, and reading it there is an
+     * empty answer, not an error — nor a reason to create it. The CLI's `list`
+     * and `info` ask this rather than running the DDL that creates it.
+     */
+    hasBranchRegistry(): Promise<boolean>;
     /**
      * Ensure the `rebase.branches` metadata table exists in the default database.
      * Idempotent — safe to call on every startup.

package/dist/services/FetchService.d.ts

@@ -1,5 +1,5 @@
 import { SQL } from "drizzle-orm";
-import { PgTable } from "drizzle-orm/pg-core";
+import { AnyPgColumn, PgTable } from "drizzle-orm/pg-core";
 import { FilterValues, OrderByTuple, LogicalCondition } from "@rebasepro/types";
 import type { IncludeSpec, VectorSearchParams } from "@rebasepro/types";
 import { RelationService } from "./RelationService.js";
@@ -218,6 +218,18 @@ export declare class FetchService {
      * no related row, so a typo in an `include` looked like empty data.
      */
     private resolveIncludeLevel;
+    /**
+     * Resolve every level of an include tree against the collections, without
+     * loading anything — the 400 for an unknown relation, decided before the
+     * read rather than by it.
+     *
+     * {@link loadIncludes} resolves a level only once it has rows to load it
+     * onto. On its own that made the refusal depend on the data: a typo in
+     * `include` against an empty table, under a filter that matched nothing,
+     * or below a relation that loaded no rows answered 200, and the same
+     * request became a 400 the first time a row matched.
+     */
+    private assertIncludeResolvable;
     /**
      * The extra `WHERE` an include's own `where`/`logical` puts on the target.
      *
@@ -227,14 +239,25 @@ export declare class FetchService {
      */
     private includeNarrowing;
     /**
-     * Sort, cap and project the rows of ONE to-many relation, per parent.
+     * Refuse a `count` the loader cannot serve honestly, before anything runs.
      *
-     * `orderBy` and `limit` are applied here rather than in SQL because a limit
-     * on a batched relation load is *per parent*, and expressing that needs a
-     * LATERAL or a window function per relation kind — four of them, each with
-     * its own join shape. The rows were already narrowed by
-     * {@link includeNarrowing} in SQL, so what this sorts and cuts is the set
-     * the caller asked for and not the table.
+     * - On a to-one relation: there is nothing to count past a row or none,
+     *   and answering 0 or 1 under `_count` would invent a shape for it.
+     * - On a collection with a property named `_count`: the total would be
+     *   written over that column's value. A silent overwrite answers 200 with
+     *   the column gone, so it is a 400 naming why.
+     */
+    private assertCountsAllowed;
+    /**
+     * Cap and project the rows of ONE relation, per parent.
+     *
+     * The order and the limit are Postgres's: the batch loader ranks each
+     * parent's related rows by the include's `orderBy` and reads back only the
+     * ones within its `limit` (see
+     * {@link RelationService.batchFetchRelatedEntitiesMany}), so `rows`
+     * arrives sorted and already cut. The slice here is what holds the limit
+     * where a `via` chain reaches one target along two paths — those rows share
+     * a rank — and it costs nothing where nothing is left to cut.
      */
     private shapeRelatedRows;
     /**
@@ -646,6 +669,33 @@ export declare class FetchService {
         /** See `FetchCollectionProps.withDeleted`. */
         withDeleted?: WithDeleted;
     }): Promise<Record<string, unknown> | null>;
+    /**
+     * {@link fetchOneForRest}'s read of a row an INSERT just wrote, taken from
+     * the INSERT's own `RETURNING` instead of a second statement — or
+     * `undefined` when the two could answer differently.
+     *
+     * A write answers with `fetchOneForRest(slug, id, undefined, …, { withDeleted: true })`
+     * (see `PersistService.save`): the row's visible columns, rendered by
+     * `toRestRow`. For a row the statement itself wrote, with nothing written
+     * after it, `RETURNING` those same columns is that row — the same values
+     * through the same column decoders, in the same order, rendered the same
+     * way. Two things narrow the read and not the statement, and either one
+     * keeps the read:
+     *
+     *  - a `beforeQuery` adds conditions to the read (and runs application
+     *    code): a row outside them is no answer today, and would be one from
+     *    `RETURNING`;
+     *  - per-field read access, which projects the read for the viewer.
+     *
+     * Row-level security is the same either way. `INSERT … RETURNING` holds
+     * the new row to the table's SELECT policies and refuses one they hide
+     * (42501) — which the INSERT's `RETURNING <key>` already did, so returning
+     * more columns changes nothing about who may write or read what.
+     */
+    insertReturning(collectionPath: string): {
+        columns: Record<string, AnyPgColumn>;
+        render: (returned: Record<string, unknown>) => Record<string, unknown>;
+    } | undefined;
     /**
      * Fetch raw rows without any relation processing (for REST fast path)
      */

package/dist/services/PersistService.d.ts

@@ -75,6 +75,21 @@ export declare class PersistService {
      * for why a zero-row write cannot be reported as success.
      */
     private explainZeroRowWrite;
+    /**
+     * Lock one row against every other write to it until this transaction
+     * ends: `FOR NO KEY UPDATE`, the lock an UPDATE of it takes anyway.
+     *
+     * For a conditional write (`If-Match`): taken before the row is read and
+     * compared, so a write that lands meanwhile is either already committed and
+     * read, or waits for this one. Without it two writes carrying the same tag
+     * both read the old row, both passed, and the second overwrote the first.
+     *
+     * Under row-level security the lock reads through the caller's UPDATE
+     * policies as well as their SELECT ones, so a row they may read but not
+     * update is simply not locked — and their write is refused by the database
+     * all the same. A nested address locks the row it ends in.
+     */
+    lockRow(collectionPath: string, id: string | number): Promise<void>;
     /**
      * Delete an row by ID
      */

package/dist/services/RelationService.d.ts

@@ -1,5 +1,5 @@
 import { SQL } from "drizzle-orm";
-import { PgTable } from "drizzle-orm/pg-core";
+import { AnyPgColumn, PgTable } from "drizzle-orm/pg-core";
 import { DrizzleClient } from "../interfaces.js";
 import { CollectionConfig, FilterValues, OrderByTuple, ResolvedRelation, ResolvedHasMany, ResolvedHasOne } from "@rebasepro/types";
 import { PostgresCollectionRegistry } from "../collections/PostgresCollectionRegistry.js";
@@ -34,6 +34,52 @@ export declare function joinStepCondition(currentTable: PgTable, joinTable: PgTa
 } | {
     missing: string;
 };
+/**
+ * What an include asks of ONE to-many relation's rows, per parent: how many,
+ * and in what order. See {@link RelationService.batchFetchRelatedEntitiesMany}.
+ */
+export interface RelatedRowWindow {
+    /** Rows to keep per parent. */
+    limit?: number;
+    /** Their order, by the target's own columns. */
+    orderBy?: OrderByTuple[];
+    /**
+     * Filled, when given and a `limit` is set, with each parent's number of
+     * matching related rows *before* the limit — what `include: { x: { limit,
+     * count: true } }` serves under `_count`. Counted in the ranking subquery,
+     * so it is the same statement, the same conditions and the same RLS
+     * context as the rows. A parent with no related row is absent (zero).
+     * Without a limit nothing is cut, and the caller counts what it got.
+     */
+    totals?: Map<string, number>;
+}
+/**
+ * How the batch loaders render a target row.
+ *
+ * - `"admin"` — the view model the admin panel reads: declared types parsed
+ *   (`parseDataFromServer`), the target's own to-one relations as
+ *   `{ __type: "relation" }` refs, undeclared columns dropped.
+ * - `"rest"` — the row the target's own route serves (`toRestRow`): what an
+ *   `include` embeds. The REST contract is that a developer never sees a ref,
+ *   and an included row is rendered exactly as the same row is at the top
+ *   level.
+ */
+export type RelatedRowStyle = "admin" | "rest";
+/**
+ * The order one parent's related rows come in: the include's own keys, then
+ * the target's key ascending.
+ *
+ * The key ascending is the order an unordered batch read handed rows back in
+ * on an append-only table, and so the rows a `limit` with no `orderBy` kept —
+ * stated now rather than left to the plan. A key that names no column of the
+ * target sorts nothing, as it sorted nothing when the sort ran over the
+ * returned rows in JavaScript; the caller's field access on it was already
+ * judged at the route.
+ *
+ * NULLs go where a top-level `orderBy` puts them: the stated placement, else
+ * Postgres's own (last ascending, first descending).
+ */
+export declare function relatedRowOrder(targetTable: PgTable, targetKeys: AnyPgColumn[], orderBy: OrderByTuple[] | undefined): SQL[];
 /**
  * Service for handling all relation-related operations.
  * Handles fetching, updating, and managing row relations.
@@ -119,6 +165,21 @@ export declare class RelationService {
      * nobody was comparing.
      */
     private toRelatedRow;
+    /**
+     * A target row as its own REST route serves it, for the `"rest"` style.
+     *
+     * The loaders read the target with `SELECT *`, so the columns a REST read
+     * never selects — a generated search vector — are dropped first; then
+     * `toRestRow` renders the rest, which applies the target's field access.
+     * Built once per batch: the hidden set is a property of the table.
+     *
+     * It replaces a second pass. An include used to render each target row as
+     * the admin's view model (`parseDataFromServer`, which also minted a
+     * `{ __type: "relation" }` ref for the target's own to-one relations) and
+     * then re-render that for REST: 3.4 µs a row against 1.4 µs for the row
+     * itself, and an envelope in a response whose contract has none.
+     */
+    private restRendering;
     /**
      * The junction row's own columns, as the caller may see them.
      *
@@ -242,13 +303,37 @@ export declare class RelationService {
      * the rows that come back, because filtering afterwards reads every related
      * row of every parent in order to discard most of them.
      */
-    batchFetchRelatedEntities(parentCollectionPath: string, parentIds: (string | number)[], _relationKey: string, relation: ResolvedRelation, narrow?: SQL): Promise<Map<string, RelatedRow<Record<string, unknown>>>>;
+    batchFetchRelatedEntities(parentCollectionPath: string, parentIds: (string | number)[], _relationKey: string, relation: ResolvedRelation, narrow?: SQL, options?: {
+        /** How each target row is rendered; see {@link RelatedRowStyle}. */
+        style?: RelatedRowStyle;
+        /**
+         * The parent rows themselves, in `parentIds` order, when the caller
+         * holds them. A `belongsTo` reads each one's foreign key off its
+         * row rather than selecting it again.
+         */
+        parentRows?: Record<string, unknown>[];
+    }): Promise<Map<string, RelatedRow<Record<string, unknown>>>>;
     /**
      * Batch fetch many-cardinality related rows for multiple parent rows.
      * Returns a Map<parentId, RelatedRow[]> instead of Map<parentId, RelatedRow>.
      * Uses a single SQL query with IN clause to avoid N+1.
+     *
+     * `window` is an include's own `limit` and `orderBy`, and both are applied
+     * by Postgres. A limit is *per parent*, so it is a rank within each
+     * parent's rows rather than a `LIMIT`: a subquery ranks the keys of every
+     * matching row — under the same relation condition, `narrow`, soft delete
+     * and `beforeQuery` the unlimited read applies — and the read joins back to
+     * the ones ranked within the limit. It used to read every related row of
+     * every parent and cut the list in JavaScript: 200 rows served out of
+     * 200,000 read, parsed and rendered for `{ messages: { limit: 2 } }` on a
+     * page of 100 threads. Rows come back in the window's order, so the
+     * per-parent lists are already sorted.
      */
     batchFetchRelatedEntitiesMany(parentCollectionPath: string, parentIds: (string | number)[], _relationKey: string, relation: ResolvedRelation, 
     /** An extra condition on the target — see {@link batchFetchRelatedEntities}. */
-    narrow?: SQL): Promise<Map<string, RelatedRow<Record<string, unknown>>[]>>;
+    narrow?: SQL, window?: RelatedRowWindow, 
+    /** `style` — how each target row is rendered; see {@link RelatedRowStyle}. */
+    options?: {
+        style?: RelatedRowStyle;
+    }): Promise<Map<string, RelatedRow<Record<string, unknown>>[]>>;
 }

package/dist/services/cdc/CdcListener.d.ts

@@ -1,12 +1,13 @@
 import { type PgNotifyListenerStatus } from "../pg-notify-listener.js";
 /**
  * A single database change captured by the CDC triggers and delivered over the
- * `rebase_cdc` NOTIFY channel.
+ * `rebase_cdc` NOTIFY channel — one row of a notification, which may name many.
  */
 export interface CdcChangeEvent {
     schema: string;
     table: string;
-    op: "INSERT" | "UPDATE" | "DELETE";
+    /** `TRUNCATE` changed every row, and `row` is empty. */
+    op: "INSERT" | "UPDATE" | "DELETE" | "TRUNCATE";
     /**
      * The changed row's identity, by column: its key, and for a junction table
      * the two ids naming the child list (from NEW for insert/update, OLD for
@@ -18,10 +19,20 @@ export interface CdcChangeEvent {
     truncated?: boolean;
 }
 /**
- * Parse a `rebase_cdc` NOTIFY payload. Returns `null` for anything malformed so
- * a single bad message can never crash the listener.
+ * Parse a `rebase_cdc` NOTIFY payload into the changes it names, one per row.
+ * Returns `null` for anything malformed so a single bad message can never
+ * crash the listener.
+ *
+ * Reads every shape a capture trigger sends, whichever version installed it —
+ * during a rolling deploy the database's triggers and this instance need not
+ * be the same version:
+ *  - `{ schema, table, op, row }` — one row: the row trigger, and a statement
+ *    that changed one row;
+ *  - `{ schema, table, op, cols, keys }` — a statement's rows in a batch. With
+ *    one column a key is the value; with several, an array in `cols` order;
+ *  - `{ schema, table, op: "TRUNCATE" }`.
  */
-export declare function parseCdcPayload(payload: string): CdcChangeEvent | null;
+export declare function parseCdcPayload(payload: string): CdcChangeEvent[] | null;
 /**
  * Dedicated Postgres LISTEN client for database-level CDC.
  *
@@ -38,7 +49,7 @@ export declare class CdcListener {
      *        drop. Every change committed in the gap was notified to nobody, so
      *        this is where subscribers are told to look again.
      */
-    constructor(connectionString: string, onEvent: (event: CdcChangeEvent) => void | Promise<void>, onReconnect?: () => void);
+    constructor(connectionString: string, onEvents: (events: CdcChangeEvent[]) => void | Promise<void>, onReconnect?: () => void, applicationName?: string);
     /**
      * Connect and begin listening. Idempotent.
      *

package/dist/services/cdc/trigger-cdc.d.ts

@@ -6,9 +6,13 @@ import type { RawSqlRunner } from "../../security/rls-enforcement.js";
  * — like Supabase Realtime — sees *every* commit regardless of how it was made.
  * When logical replication is unavailable (managed Postgres without
  * `wal_level=logical`, no replication privilege, no `REPLICA IDENTITY`), this
- * trigger-based fallback provides the same guarantee at the row level:
+ * trigger-based fallback provides the same guarantee:
  *
- *   AFTER INSERT/UPDATE/DELETE trigger  →  pg_notify('rebase_cdc', payload)
+ *   AFTER INSERT/UPDATE/DELETE/TRUNCATE statement trigger  →  pg_notify('rebase_cdc', payload)
+ *
+ * once per statement, naming the changed rows by key in batches of about a
+ * thousand — a 1M-row UPDATE is ~1,000 notifications, where a row trigger sent
+ * a million into Postgres's shared notification queue, to every instance.
  *
  * A single dedicated LISTEN client per backend instance consumes the channel
  * (see {@link CdcListener}) and feeds the change into the existing
@@ -21,24 +25,88 @@ import type { RawSqlRunner } from "../../security/rls-enforcement.js";
  */
 /** Postgres NOTIFY channel carrying database-level change events. */
 export declare const CDC_CHANNEL = "rebase_cdc";
-/** Schema-qualified name of the generic trigger function. */
+/**
+ * Schema-qualified name of the row-level trigger function: one notification
+ * per changed row. What every version before statement-level capture attached
+ * everywhere, and still what a partitioned or foreign table gets — see
+ * {@link levelForRelkind}.
+ */
 export declare const CDC_TRIGGER_FUNCTION = "rebase.rebase_cdc_notify";
-/** Name of the per-table trigger (unqualified — triggers are namespaced by table). */
+/**
+ * Schema-qualified name of the statement-level trigger function: one
+ * notification per ~1,000 changed rows. See {@link buildCdcFunctionSql}.
+ *
+ * A function of its own rather than a new body for the row function, because
+ * an instance of an older version replaces the row function's body every time
+ * it boots: a statement trigger calling it would then run a row trigger's body,
+ * for every write, until the next boot of this version.
+ */
+export declare const CDC_STATEMENT_FUNCTION = "rebase.rebase_cdc_notify_statement";
+/** Name of the per-table row-level trigger (unqualified — triggers are namespaced by table). */
 export declare const CDC_TRIGGER_NAME = "rebase_cdc_trigger";
+/** How a table is instrumented: one notification per statement's ~1,000 rows, or one per row. */
+export type CdcTriggerLevel = "statement" | "row";
+/** One trigger this module creates, as `pg_trigger` describes it. */
+interface CdcTriggerSpec {
+    name: string;
+    /** The function it calls. */
+    fn: "row" | "statement";
+    /** `CREATE TRIGGER` between the name and `ON`. */
+    timing: string;
+    /** `CREATE TRIGGER` between the table and `EXECUTE`. */
+    forEach: string;
+    /** `tgtype`: ROW (1), BEFORE (2), INSERT (4), DELETE (8), UPDATE (16), TRUNCATE (32), INSTEAD (64). */
+    type: number;
+    /** `tgnewtable` / `tgoldtable`: the transition tables it captures. */
+    newTable: string | null;
+    oldTable: string | null;
+}
+/**
+ * The statement-level triggers a plain table gets. One per event, because
+ * Postgres refuses transition tables on a trigger with more than one event.
+ * The TRUNCATE one is new with them: a row trigger never fires on `TRUNCATE`,
+ * so a truncated table used to be announced to nobody.
+ */
+export declare const CDC_STATEMENT_TRIGGERS: readonly CdcTriggerSpec[];
+/**
+ * The level a table is instrumented at, by `pg_class.relkind`.
+ *
+ * A plain table gets statement triggers. A partitioned table keeps the row
+ * trigger: Postgres clones a row trigger onto every partition, so a write made
+ * straight to a partition is still captured, while a statement trigger on the
+ * parent fires only for statements against the parent. A foreign table
+ * cannot have transition tables at all.
+ */
+export declare const levelForRelkind: (relkind: string | null | undefined) => CdcTriggerLevel;
+/**
+ * How long after a boot first converts a table from the row trigger, the
+ * statement triggers still announce every change one row per notification.
+ *
+ * The triggers are the database's, and an instance of the previous version
+ * still running beside this one — a rolling deploy, a rollback — reads the
+ * same channel with a parser that knows one row per notification: given a
+ * batch it sees no key, so its lists refetch but its single-row and
+ * many-to-many subscribers hear nothing. While any such instance may be up,
+ * the statement triggers speak its protocol; after this window they batch.
+ * Every version that batches reads both. A boot of the older version re-attaches its row trigger (it
+ * creates a missing one), and the next boot of this one converts it back and
+ * re-opens the window, so a rollback is covered the same way.
+ */
+export declare const CDC_ROW_COMPAT_MS: number;
 /**
- * SQL that (re)creates the generic CDC trigger function. Safe to run repeatedly:
+ * SQL that (re)creates both CDC trigger functions. Safe to run repeatedly:
  * `CREATE OR REPLACE` updates in place without dropping dependent triggers —
- * which is also how a database instrumented by an older version gets this body
- * on its next boot, for every table at once, re-attached or not.
- *
- * The function emits `{ schema, table, op, row }`, and `row` is an **identity,
- * never the tuple**. Postgres puts no privilege on `LISTEN`: any role that can
- * connect can listen on this channel, whatever it may `SELECT`. When `row` was
- * `to_jsonb(NEW)`, a login with no grant on anything received every changed row
- * of every instrumented table — `password_hash` and verification tokens from
- * the auth table included — past RLS and column grants. The consumer never
- * read anything but the key: every subscriber re-reads the row under its own
- * scope.
+ * which is also how a database instrumented by an older version gets these
+ * bodies on its next boot, for every table at once, re-attached or not.
+ *
+ * Both functions emit `{ schema, table, op, ... }`, and the rows are named by
+ * **identity, never the tuple**. Postgres puts no privilege on `LISTEN`: any
+ * role that can connect can listen on this channel, whatever it may `SELECT`.
+ * When `row` was `to_jsonb(NEW)`, a login with no grant on anything received
+ * every changed row of every instrumented table — `password_hash` and
+ * verification tokens from the auth table included — past RLS and column
+ * grants. The consumer never read anything but the key: every subscriber
+ * re-reads the row under its own scope.
  *
  * The identity is, in order:
  *  - the columns the trigger was attached with (`TG_ARGV`) — the key the
@@ -49,18 +117,26 @@ export declare const CDC_TRIGGER_NAME = "rebase_cdc_trigger";
  *    maps any more;
  *  - otherwise `id`, if the table has one, and else nothing: a change the
  *    consumer can only treat as collection-wide.
+ *
+ * `compatUntil` is the end of the window in which the statement function
+ * still sends one row per notification — see {@link CDC_ROW_COMPAT_MS}. A
+ * timestamp, or `-infinity` for none.
  */
-export declare function buildCdcFunctionSql(): string;
+export declare function buildCdcFunctionSql(options?: {
+    compatUntil?: string;
+}): string;
 /**
- * SQL that (re)attaches the CDC trigger to a single table. `DROP ... IF EXISTS`
- * before `CREATE` keeps it idempotent and picks up any function signature change.
+ * SQL that (re)attaches the CDC triggers to a single table, at `level`.
+ * Every trigger this module owns is dropped first, whichever level it was
+ * created at, so a table moves between levels — a row trigger left by an
+ * older version becomes the statement triggers — in one transaction, with no
+ * moment at which a write is announced by neither.
  *
- * `identityColumns` are what the payload names the changed row by — see
+ * `identityColumns` are what the payload names the changed rows by — see
  * {@link buildCdcFunctionSql}. Passed as trigger arguments, so one shared
- * function serves every table without a catalogue read per row. Empty means
- * "the primary key".
+ * function serves every table. Empty means "the primary key".
  */
-export declare function buildCdcTriggerSql(schema: string, table: string, identityColumns?: readonly string[]): string;
+export declare function buildCdcTriggerSql(schema: string, table: string, identityColumns?: readonly string[], level?: CdcTriggerLevel): string;
 export interface CdcTableRef {
     schema: string;
     table: string;
@@ -80,7 +156,7 @@ export interface ProvisionResult {
     }>;
 }
 /**
- * Replace an already-installed trigger function with the current body, and
+ * Replace the already-installed trigger functions with the current bodies, and
  * install nothing where there is none.
  *
  * For a process that owns the schema but is not provisioning capture on this
@@ -88,15 +164,63 @@ export interface ProvisionResult {
  * earlier boot attached keep firing whether anything consumes them or not, so
  * a database instrumented by a version whose function put whole rows on the
  * channel kept doing so, for every login that cares to `LISTEN`, until capture
- * was switched back on. Returns whether a function was there to replace.
+ * was switched back on. The statement function keeps its compatibility
+ * window. Returns whether a function was there to replace.
  */
 export declare function refreshInstalledCdcFunction(run: RawSqlRunner): Promise<boolean>;
 /**
- * Idempotently install the CDC trigger function and per-table triggers.
+ * Take change capture off the database: detach every capture trigger and drop
+ * both functions. Returns how many triggers were attached.
+ *
+ * For `REALTIME_CDC=off`. Capture switched off used to leave the triggers in
+ * place, so every write to every instrumented table still ran one and sent a
+ * notification on a channel nothing listened to. Nothing depends on them once
+ * capture is off: a process without capture announces its own writes on the
+ * cross-instance channel, and the instances that serve realtime listen there.
+ *
+ * `DROP FUNCTION … CASCADE` takes the triggers with it in one statement. It
+ * waits for each table's lock like any trigger DDL, so it runs with the boot's
+ * lock budget and is retried on a lock timeout; a database still contended
+ * after that keeps its triggers and the caller reports it.
+ */
+export declare function removeTriggerCdc(run: RawSqlRunner): Promise<number>;
+/**
+ * What a boot that does not provision capture does with capture an earlier
+ * boot installed.
+ *
+ *  - `capture: "off"` — `REALTIME_CDC=off` — removes it ({@link removeTriggerCdc}).
+ *  - `capture: "not-provisioned"` — capture is wanted but this boot could not
+ *    install it (no direct URL, `auto` fell back) — leaves the triggers and
+ *    brings the functions up to date ({@link refreshInstalledCdcFunction}),
+ *    since they keep firing.
+ */
+export declare function settleInstalledCapture(run: RawSqlRunner, options: {
+    capture: "off" | "not-provisioned";
+}): Promise<{
+    removed: number;
+} | {
+    refreshed: boolean;
+}>;
+/**
+ * Idempotently install the CDC trigger functions and per-table triggers.
+ *
+ * A plain table gets the statement-level triggers, a partitioned or foreign
+ * one the row trigger ({@link levelForRelkind}). A table whose triggers are
+ * already exactly the ones this would create — same function, same events,
+ * enabled, same identity arguments — is left alone; one with a trigger
+ * missing, disabled, attached with different arguments or at the other level
+ * is (re-)attached, all of it in one transaction.
+ *
+ * Converting a table from a row trigger an older version attached opens the
+ * statement function's compatibility window ({@link CDC_ROW_COMPAT_MS}): the
+ * instances that attached it may still be listening.
  *
  * Runs as the owner (server) connection at bootstrap. A table that does not yet
  * exist in the database (schema drift) is skipped with a warning rather than
  * aborting the whole install, so one un-migrated collection cannot disable CDC
  * for the rest.
  */
-export declare function provisionTriggerCdc(run: RawSqlRunner, tables: CdcTableRef[]): Promise<ProvisionResult>;
+export declare function provisionTriggerCdc(run: RawSqlRunner, tables: CdcTableRef[], options?: {
+    now?: number;
+}): Promise<ProvisionResult>;
+export {};

package/dist/services/channel-bus/index.d.ts

@@ -36,7 +36,7 @@ export interface ChannelBusDeps {
  * transports this package knows how to construct, so honouring it there would
  * mean silently discarding the object the application handed us.
  */
-export declare function resolveChannelBusSetting(configured?: ChannelBusSetting): ChannelBusSetting;
+export declare function resolveChannelBusSetting(configured?: ChannelBusSetting, env?: NodeJS.ProcessEnv): ChannelBusSetting;
 /**
  * Produce the bus a setting asks for.
  *

package/dist/services/channel-history.d.ts

@@ -79,10 +79,21 @@ export interface RetainedAnnouncement {
 export declare class ChannelHistoryStore {
     private db;
     private rules;
-    /** Resolved rule per channel name, so the match runs once per channel. */
-    private resolved;
-    /** Channel → timestamp of its last prune, for {@link PRUNE_THROTTLE_MS}. */
+    /**
+     * Each rule with its retention resolved, once. Matched per call rather
+     * than cached per channel name: a cache keyed by the names clients invent
+     * grew by every one of them for the life of the process, and matching a
+     * handful of prefixes costs less than the hashing a lookup does.
+     */
+    private resolvedRules;
+    /**
+     * Channel → timestamp of its last prune, for {@link PRUNE_THROTTLE_MS}.
+     * An entry older than the window throttles nothing, so they are swept once
+     * a window: the map holds the channels pruned recently, not every channel
+     * ever pruned.
+     */
     private lastPruned;
+    private nextPruneSweepAt;
     private tablesReady;
     constructor(db: NodePgDatabase<Record<string, unknown>>, rules?: ChannelRetentionRule[]);
     /** Whether any channel retains anything at all. */
@@ -140,6 +151,6 @@ export declare class ChannelHistoryStore {
      * volume, which is what makes retention affordable on a hot channel.
      */
     prune(channel: string, retention: ResolvedRetention): Promise<number>;
-    /** Forget throttle and match caches. Called on shutdown. */
+    /** Forget the prune throttle. Called on shutdown. */
     clear(): void;
 }

package/dist/services/collection-helpers.d.ts

@@ -143,6 +143,21 @@ export declare function requirePrimaryKeys(collection: CollectionConfig, registr
  * @param collectionPath named in the error.
  */
 export declare function primaryKeyColumns(table: PgTable, primaryKeys: PrimaryKeyInfo[], collectionPath: string): AnyPgColumn[];
+/**
+ * The column a `joinPath` step names, on a table that may key it either way.
+ *
+ * A `JoinStep` is written in database terms — `on: { from: "author_id" }` —
+ * because there is no collection to translate through: the step names a raw
+ * table. A table the boot reads back out of the catalogue is keyed by the
+ * *wire* name, `authorId`, while a hand-written Drizzle schema may key it by
+ * the column name. Looking the step's name up as a key therefore found
+ * nothing on every booted table, and a `via` relation loaded nothing at all.
+ *
+ * The key first, as the step may already name one; then the column whose SQL
+ * name it is. `undefined` when the table has neither, which the caller turns
+ * into an error naming the step.
+ */
+export declare function columnNamed(table: PgTable, name: string): AnyPgColumn | undefined;
 /**
  * The column on the *source* table that a `hasOne`/`hasMany` link points at.
  *