@voltro/plugin-cdc-out 0.55.0 → 0.57.0

package/dist/index.d.ts

@@ -6,14 +6,6 @@ import { Schema } from 'effect';
 import { TableLike } from '@voltro/database';
 import { VoltroPlugin } from '@voltro/protocol';
 
-/**
- * Deterministic JSON — object keys sorted at every depth, so two replicas
- * that decoded the same row into differently-ordered objects still digest
- * identically. `Date`s normalise to ISO (a binlog reader hands back `Date`s
- * where a NOTIFY payload hands back strings), `undefined` to null.
- */
-export declare const canonicalJson: (value: unknown) => string;
-
 /**
  * Thrown at plugin-construction time (= `app.config.ts` load = boot) when the
  * cdc-out config is malformed: no sinks, a sink without `deliver`, a duplicate
@@ -216,20 +208,6 @@ export declare interface CdcSink {
     readonly outboundHost?: string;
 }
 
-/** The content half of a change identity — equal iff two replicas are looking
- *  at the same change (or at two changes with byte-identical images, which the
- *  occurrence counter then separates). */
-export declare const changeDigest: (input: {
-    readonly pipe: string;
-    readonly op: "insert" | "update" | "delete";
-    readonly key: string;
-    readonly next: Record<string, unknown> | null;
-    readonly prev: Record<string, unknown> | null;
-}) => string;
-
-/** Compose the durable identity written to `_voltro_cdcout_claims.changeKey`. */
-export declare const composeChangeKey: (digest: string, occurrence: number) => string;
-
 /** Passed to `deliver` — abort fires when the attempt times out
  *  (`deliveryTimeoutMs`) so an HTTP sink can cancel its request. */
 export declare interface DeliverContext {
@@ -330,39 +308,6 @@ export declare const nextClaimId: () => string;
  *  change tap, so ids carry commit order (uuidv7 is monotonic per process). */
 export declare const nextOutboxId: () => string;
 
-/**
- * How many times this replica has already seen each digest inside the dedup
- * window. Bounded on BOTH axes — a per-change map with no ceiling is an
- * unbounded table in memory:
- *   * by time — entries untouched for `windowMs` are pruned, and
- *   * by size — `maxEntries` oldest-first, so a burst of unique changes can't
- *     grow it without limit.
- *
- * `windowMs` MUST be longer than the lifetime of a claim row in the database.
- * That ordering is the invariant: if a claim outlived the counter that
- * produced it, the next sighting of that digest would restart at occurrence 0,
- * collide with the retained claim, and be dropped as a duplicate it is not.
- */
-export declare class OccurrenceCounter {
-    #private;
-    constructor(opts: {
-        readonly windowMs: number;
-        readonly maxEntries: number;
-    });
-    get size(): number;
-    /** Record a sighting and return its occurrence index (0 for the first). */
-    next(digest: string, nowMs: number): number;
-    /**
-     * Align this replica with the fleet from the claims already recorded in the
-     * database — the counters of a process that booted mid-window would
-     * otherwise restart at 0 and re-key changes the incumbents have already
-     * keyed. Call ONCE, before the first observed change is keyed.
-     */
-    seedFromChangeKeys(changeKeys: Iterable<string>, nowMs: number): void;
-    /** Drop entries whose last sighting is older than the window. */
-    prune(nowMs: number): void;
-}
-
 export declare interface OutboxRow {
     readonly id: string;
     readonly pipe: string;
@@ -386,12 +331,6 @@ export declare const outboxRowFor: (mapped: MappedChange, pipe: string, nowMs: n
 
 export declare type OutboxStatus = 'pending' | 'delivering' | 'delivered' | 'dead';
 
-/** Split a stored `changeKey` back into its two halves (`null` when malformed). */
-export declare const parseChangeKey: (changeKey: string) => {
-    digest: string;
-    occurrence: number;
-} | null;
-
 /** Pipe identity — `<instance>:<table>:<sink name>` (the outbox `pipe` column). */
 export declare const pipeKey: (instanceName: string, config: SinkConfig) => string;