@bjornpagen/bumbledb-log 0.20.2 → 1.0.0

package/dist/vector.js

@@ -1,87 +0,0 @@
-/**
- * The per-braid generation map. Sum, domination, checkpoint order, and
- * apply's increment live here. Overflow is a refusal of `sum` and of
- * nowhere else.
- */
-import { U64_MAX } from "#bytes.ts";
-import { generation } from "#keys.ts";
-const Overflow = { tag: "overflow" };
-/** Applied counts keyed by braid. Any vector is a legal restore point. */
-class Vector {
-    #counts;
-    constructor(entries = []) {
-        const counts = new Map();
-        for (const [braid, g] of [...entries].sort(function byBraid(left, right) {
-            if (left[0] < right[0]) {
-                return -1;
-            }
-            if (left[0] > right[0]) {
-                return 1;
-            }
-            return 0;
-        })) {
-            counts.set(braid, g);
-        }
-        this.#counts = counts;
-    }
-    static from(map) {
-        return new Vector(map);
-    }
-    /** The wholeness arithmetic. The one overflow site. */
-    sum() {
-        let acc = 0n;
-        for (const g of this.#counts.values()) {
-            const next = acc + g;
-            if (next > U64_MAX) {
-                return Overflow;
-            }
-            acc = next;
-        }
-        return acc;
-    }
-    /** Pointwise `this[braid] >= other[braid]`; an absent braid is zero. */
-    dominates(other) {
-        for (const [braid, g] of other.#counts) {
-            if (this.at(braid) < g) {
-                return false;
-            }
-        }
-        return true;
-    }
-    /** The total order the manifest CAS installs. */
-    order(other) {
-        const left = this.sum();
-        const right = other.sum();
-        const leftOverflow = typeof left !== "bigint";
-        const rightOverflow = typeof right !== "bigint";
-        if (leftOverflow && rightOverflow) {
-            return "equal";
-        }
-        if (leftOverflow) {
-            return "after";
-        }
-        if (rightOverflow) {
-            return "before";
-        }
-        if (left < right) {
-            return "before";
-        }
-        if (left > right) {
-            return "after";
-        }
-        return "equal";
-    }
-    /** The applied count for `braid`; absent is zero. */
-    at(braid) {
-        return generation(this.#counts.get(braid) ?? 0n);
-    }
-    /** Apply's one mutation: this braid's count advances by one. */
-    advance(braid) {
-        const next = new Map(this.#counts);
-        const current = next.get(braid) ?? 0n;
-        next.set(braid, current === U64_MAX ? U64_MAX : current + 1n);
-        return new Vector(next);
-    }
-}
-export { Overflow, Vector };
-//# sourceMappingURL=vector.js.map

package/dist/vector.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"vector.js","sourceRoot":"","sources":["../src/vector.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAA;AAGnC,OAAO,EAAE,UAAU,EAAE,MAAM,UAAU,CAAA;AAErC,MAAM,QAAQ,GAAG,EAAE,GAAG,EAAE,UAAU,EAAW,CAAA;AAK7C,0EAA0E;AAC1E,MAAM,MAAM;IACF,OAAO,CAAoB;IAEpC,YAAY,OAAO,GAAuC,EAAE;QAC3D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAiB,CAAA;QACvC,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,SAAS,OAAO,CAAC,IAAI,EAAE,KAAK;YACtE,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;gBACxB,OAAO,CAAC,CAAC,CAAA;YACV,CAAC;YACD,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;gBACxB,OAAO,CAAC,CAAA;YACT,CAAC;YACD,OAAO,CAAC,CAAA;QACT,CAAC,CAAC,EAAE,CAAC;YACJ,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA;QACrB,CAAC;QACD,IAAI,CAAC,OAAO,GAAG,MAAM,CAAA;IACtB,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,GAA+B;QAC1C,OAAO,IAAI,MAAM,CAAC,GAAG,CAAC,CAAA;IACvB,CAAC;IAED,uDAAuD;IACvD,GAAG;QACF,IAAI,GAAG,GAAG,EAAE,CAAA;QACZ,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,MAAM,IAAI,GAAG,GAAG,GAAG,CAAC,CAAA;YACpB,IAAI,IAAI,GAAG,OAAO,EAAE,CAAC;gBACpB,OAAO,QAAQ,CAAA;YAChB,CAAC;YACD,GAAG,GAAG,IAAI,CAAA;QACX,CAAC;QACD,OAAO,GAAG,CAAA;IACX,CAAC;IAED,wEAAwE;IACxE,SAAS,CAAC,KAAa;QACtB,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YACxC,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;gBACxB,OAAO,KAAK,CAAA;YACb,CAAC;QACF,CAAC;QACD,OAAO,IAAI,CAAA;IACZ,CAAC;IAED,iDAAiD;IACjD,KAAK,CAAC,KAAa;QAClB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;QACvB,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,CAAA;QACzB,MAAM,YAAY,GAAG,OAAO,IAAI,KAAK,QAAQ,CAAA;QAC7C,MAAM,aAAa,GAAG,OAAO,KAAK,KAAK,QAAQ,CAAA;QAC/C,IAAI,YAAY,IAAI,aAAa,EAAE,CAAC;YACnC,OAAO,OAAO,CAAA;QACf,CAAC;QACD,IAAI,YAAY,EAAE,CAAC;YAClB,OAAO,OAAO,CAAA;QACf,CAAC;QACD,IAAI,aAAa,EAAE,CAAC;YACnB,OAAO,QAAQ,CAAA;QAChB,CAAC;QACD,IAAI,IAAI,GAAG,KAAK,EAAE,CAAC;YAClB,OAAO,QAAQ,CAAA;QAChB,CAAC;QACD,IAAI,IAAI,GAAG,KAAK,EAAE,CAAC;YAClB,OAAO,OAAO,CAAA;QACf,CAAC;QACD,OAAO,OAAO,CAAA;IACf,CAAC;IAED,qDAAqD;IACrD,EAAE,CAAC,KAAY;QACd,OAAO,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAA;IACjD,CAAC;IAED,gEAAgE;IAChE,OAAO,CAAC,KAAY;QACnB,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QAClC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAA;QACrC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,KAAK,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,GAAG,EAAE,CAAC,CAAA;QAC7D,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,CAAA;IACxB,CAAC;CACD;AAGD,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAA"}

package/dist/writer.d.ts

@@ -1,106 +0,0 @@
-/**
- * The writer (60): a replica plus the right to create log objects. Role
- * is a field on the handle. `openWriter(options)` births the store;
- * `openWriter(replica)` wraps a born replica and settles an inherited
- * pending without drawing id leases. A replica never births —
- * ManifestMissing is its refusal. One commit path and one loss path: a
- * lost slot's byte-equal occupant is an ambiguous PUT absorbed; anything
- * else discards the local directory, re-opens through the replica to the
- * current tip, and re-judges the recorded ops once — the verdict IS a
- * serial execution, performed. Each loop iteration races once at the
- * then-tip, so a historical loss is structurally uncountable, and bounded
- * live-tip losses surface as ErrContention carrying the terminal
- * re-judgment's own violation or the racing tip.
- */
-import { type Admission, type Fact, type FreshKeys, type FreshRange, type MemberRelation, type MutationReport, type SchemaRelations } from "@bjornpagen/bumbledb";
-import type { Digest32 } from "./bytes.js";
-import type { Braid, Theory } from "./descriptor.js";
-import type { Generation } from "./keys.js";
-import type { CheckpointFacts } from "./manifest.js";
-import type { OpenReplicaOptions, Replica } from "./replica.js";
-import type { ObjectStore } from "./store.js";
-type Durability = "published" | "local-pending";
-/** Where an accepted commit landed on its braid: the slot (the braid
- *  position — never the store-wide sum) and how durable the batch is. */
-interface Landing {
-    readonly slot: Generation;
-    readonly durability: Durability;
-}
-/** The accepted payload of `commit`: the body's value plus the landing. */
-interface CommitReceipt<R> extends Landing {
-    readonly value: R;
-    readonly braid: Braid;
-}
-/** The empty commit is not a commit: a body that records no ops names no
- *  braid, so the refusal is its own outcome — never a slot, never a
- *  thrown surprise. The body's value rides out, the way an abandoned
- *  write's payload does in the engine. */
-interface EmptyCommit<R> {
-    readonly tag: "empty";
-    readonly value: R;
-}
-/** The engine's Admission sum carrying the log's receipt in its accepted
- *  arm; the rejected arm is the engine's violations, shell and payload. */
-type Commit<Rels extends SchemaRelations, R> = Admission<Rels, CommitReceipt<R>> | EmptyCommit<R>;
-/** One braid's verdict inside a split commit: the engine's Admission
- *  carrying the landing, beside the braid it judged. */
-interface BraidOutcome<Rels extends SchemaRelations> {
-    readonly braid: Braid;
-    readonly admission: Admission<Rels, Landing>;
-}
-type CommitSplit<Rels extends SchemaRelations, R> = {
-    readonly tag: "split";
-    readonly value: R;
-    readonly outcomes: readonly BraidOutcome<Rels>[];
-} | EmptyCommit<R>;
-/**
- * The recorder: the engine `WriteTx`'s write surface, verbatim — insert,
- * delete, and reserve carry the engine's own signatures, so a write-only
- * body typechecks against both dialects. `contains`/`get` are absent by
- * law: the journaled dialect is a pure recorder, and change is judged at
- * commit, so a report's `changed` is 0n at record time. Reservations
- * never appear in the log; the resulting inserts carry concrete values.
- */
-interface Batch<Rels extends SchemaRelations> {
-    insert<Rel extends MemberRelation<Rels>>(relation: Rel, facts: Iterable<Fact<Rel>>): MutationReport;
-    delete<Rel extends MemberRelation<Rels>>(relation: Rel, facts: Iterable<Fact<Rel>>): MutationReport;
-    reserve<Rel extends MemberRelation<Rels>>(relation: Rel, field: FreshKeys<Rel> & string, count: bigint): FreshRange;
-}
-/** Ownership of a slot, read from the winner's header. */
-interface Deposition {
-    readonly braid: Braid;
-    readonly slot: Generation;
-    readonly resident: bigint;
-    readonly usurper: bigint;
-}
-interface Writer<Rels extends SchemaRelations> {
-    readonly role: "writer";
-    readonly replica: Replica<Rels>;
-    deposition(): Deposition | null;
-    commit<R>(body: (batch: Batch<Rels>) => R | Promise<R>): Promise<Commit<Rels, R>>;
-    commitSplit<R>(body: (batch: Batch<Rels>) => R | Promise<R>): Promise<CommitSplit<Rels, R>>;
-}
-type PublishRefusal = "manifest-missing" | "manifest" | "checkpoint-doc-missing" | "checkpoint";
-type Published = {
-    readonly tag: "replaced";
-} | {
-    readonly tag: "kept";
-    readonly incumbent: Digest32;
-} | {
-    readonly tag: "refused";
-    readonly reason: PublishRefusal;
-};
-/**
- * Publishes `candidate` under the checkpoint order. The digest is the
- * blake3 of the full bytes, `prev` included. A scratch lease
- * `{dir}/~lease/ckpt-scratch` names the candidate for the publish
- * window; a crash leaves that lease and a successor sweep reclaims
- * it. `Kept` and every refused publish delete the candidate's `ckpt`
- * pair.
- */
-declare function publishCheckpoint(store: ObjectStore, prefix: string, dir: string, theory: Theory, candidate: CheckpointFacts, mdb: Uint8Array): Promise<Published>;
-declare function openWriter<Rels extends SchemaRelations>(replica: Replica<Rels>): Promise<Writer<Rels>>;
-declare function openWriter<Rels extends SchemaRelations>(options: OpenReplicaOptions<Rels>): Promise<Writer<Rels>>;
-export type { Batch, BraidOutcome, Commit, CommitReceipt, CommitSplit, Deposition, Durability, EmptyCommit, Landing, Writer };
-export { openWriter, publishCheckpoint };
-//# sourceMappingURL=writer.d.ts.map

package/dist/writer.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"writer.d.ts","sourceRoot":"","sources":["../src/writer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAKH,OAAO,EACN,KAAK,SAAS,EACd,KAAK,IAAI,EAET,KAAK,SAAS,EACd,KAAK,UAAU,EAGf,KAAK,cAAc,EACnB,KAAK,cAAc,EAEnB,KAAK,eAAe,EAEpB,MAAM,sBAAsB,CAAA;AAG7B,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAA;AAKzC,OAAO,KAAK,EAAE,KAAK,EAAgB,MAAM,EAAE,MAAM,gBAAgB,CAAA;AAajE,OAAO,KAAK,EAAE,UAAU,EAAY,MAAM,UAAU,CAAA;AAYpD,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,cAAc,CAAA;AAEnD,OAAO,KAAK,EAAQ,kBAAkB,EAAE,OAAO,EAAE,MAAM,aAAa,CAAA;AAmBpE,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,WAAW,CAAA;AAkB5C,KAAK,UAAU,GAAG,WAAW,GAAG,eAAe,CAAA;AAE/C;yEACyE;AACzE,UAAU,OAAO;IAChB,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAA;IACzB,QAAQ,CAAC,UAAU,EAAE,UAAU,CAAA;CAC/B;AAED,2EAA2E;AAC3E,UAAU,aAAa,CAAC,CAAC,CAAE,SAAQ,OAAO;IACzC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAA;IACjB,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAA;CACrB;AAED;;;0CAG0C;AAC1C,UAAU,WAAW,CAAC,CAAC;IACtB,QAAQ,CAAC,GAAG,EAAE,OAAO,CAAA;IACrB,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAA;CACjB;AAED;2EAC2E;AAC3E,KAAK,MAAM,CAAC,IAAI,SAAS,eAAe,EAAE,CAAC,IAAI,SAAS,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;AAEjG;wDACwD;AACxD,UAAU,YAAY,CAAC,IAAI,SAAS,eAAe;IAClD,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAA;IACrB,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,IAAI,EAAE,OAAO,CAAC,CAAA;CAC5C;AAED,KAAK,WAAW,CAAC,IAAI,SAAS,eAAe,EAAE,CAAC,IAC7C;IAAE,QAAQ,CAAC,GAAG,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;IAAC,QAAQ,CAAC,QAAQ,EAAE,SAAS,YAAY,CAAC,IAAI,CAAC,EAAE,CAAA;CAAE,GAC9F,WAAW,CAAC,CAAC,CAAC,CAAA;AAEjB;;;;;;;GAOG;AACH,UAAU,KAAK,CAAC,IAAI,SAAS,eAAe;IAC3C,MAAM,CAAC,GAAG,SAAS,cAAc,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,cAAc,CAAA;IACnG,MAAM,CAAC,GAAG,SAAS,cAAc,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,cAAc,CAAA;IACnG,OAAO,CAAC,GAAG,SAAS,cAAc,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,CAAC,GAAG,CAAC,GAAG,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,UAAU,CAAA;CACnH;AAED,0DAA0D;AAC1D,UAAU,UAAU;IACnB,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAA;IACrB,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAA;IACzB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;CACxB;AAED,UAAU,MAAM,CAAC,IAAI,SAAS,eAAe;IAC5C,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAA;IACvB,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,CAAA;IAC/B,UAAU,IAAI,UAAU,GAAG,IAAI,CAAA;IAC/B,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAA;IACjF,WAAW,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAA;CAC3F;AAwjBD,KAAK,cAAc,GAAG,kBAAkB,GAAG,UAAU,GAAG,wBAAwB,GAAG,YAAY,CAAA;AAE/F,KAAK,SAAS,GACX;IAAE,QAAQ,CAAC,GAAG,EAAE,UAAU,CAAA;CAAE,GAC5B;IAAE,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,SAAS,EAAE,QAAQ,CAAA;CAAE,GACtD;IAAE,QAAQ,CAAC,GAAG,EAAE,SAAS,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,cAAc,CAAA;CAAE,CAAA;AA6F/D;;;;;;;GAOG;AACH,iBAAe,iBAAiB,CAC/B,KAAK,EAAE,WAAW,EAClB,MAAM,EAAE,MAAM,EACd,GAAG,EAAE,MAAM,EACX,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,eAAe,EAC1B,GAAG,EAAE,UAAU,GACb,OAAO,CAAC,SAAS,CAAC,CAmBpB;AAkFD,iBAAe,UAAU,CAAC,IAAI,SAAS,eAAe,EAAE,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAA;AACtG,iBAAe,UAAU,CAAC,IAAI,SAAS,eAAe,EAAE,OAAO,EAAE,kBAAkB,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAA;AAWjH,YAAY,EACX,KAAK,EACL,YAAY,EACZ,MAAM,EACN,aAAa,EACb,WAAW,EACX,UAAU,EACV,UAAU,EACV,WAAW,EACX,OAAO,EACP,MAAM,EACN,CAAA;AACD,OAAO,EAAE,UAAU,EAAE,iBAAiB,EAAE,CAAA"}