network-ai 5.10.2 → 5.11.0

package/dist/esm/lib/coverage-reporter.js

@@ -0,0 +1,177 @@
+"use strict";
+/**
+ * CoverageReporter — Lightweight code coverage reporting without external deps
+ *
+ * Integrates with Node.js built-in V8 coverage (`NODE_V8_COVERAGE`).
+ * Parses V8 coverage JSON output into a structured report with file-level
+ * line and function coverage metrics. Supports thresholds and reporters.
+ *
+ * Usage:
+ *   // Run tests with V8 coverage:
+ *   // NODE_V8_COVERAGE=./coverage npx ts-node test.ts
+ *
+ *   const reporter = new CoverageReporter({ coverageDir: './coverage' });
+ *   const report = await reporter.collect();
+ *   reporter.printSummary(report);
+ *   reporter.enforce(report, { linePct: 80, branchPct: 70 });
+ *
+ * @module CoverageReporter
+ * @version 1.0.0
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.CoverageReporter = void 0;
+const promises_1 = require("fs/promises");
+const path_1 = require("path");
+// ============================================================================
+// REPORTER
+// ============================================================================
+/**
+ * CoverageReporter — Collects and reports V8 code coverage data.
+ */
+class CoverageReporter {
+    config;
+    constructor(config) {
+        this.config = {
+            coverageDir: (0, path_1.resolve)(config.coverageDir),
+            projectRoot: config.projectRoot ?? process.cwd(),
+            include: config.include ?? ['.ts', '.js'],
+            exclude: config.exclude ?? ['node_modules', 'test-', 'dist/'],
+        };
+    }
+    /**
+     * Collect coverage data from V8 coverage directory.
+     */
+    async collect() {
+        const files = [];
+        const coverageFiles = await this.findCoverageFiles();
+        for (const cf of coverageFiles) {
+            const raw = await (0, promises_1.readFile)(cf, 'utf-8');
+            const data = JSON.parse(raw);
+            for (const script of data.result) {
+                if (!this.shouldInclude(script.url))
+                    continue;
+                const relPath = this.toRelativePath(script.url);
+                const existing = files.find((f) => f.file === relPath);
+                if (existing)
+                    continue; // Deduplicate
+                const totalFunctions = script.functions.length;
+                const coveredFunctions = script.functions.filter((fn) => fn.ranges.some((r) => r.count > 0)).length;
+                let totalRanges = 0;
+                let coveredRanges = 0;
+                for (const fn of script.functions) {
+                    for (const range of fn.ranges) {
+                        totalRanges++;
+                        if (range.count > 0)
+                            coveredRanges++;
+                    }
+                }
+                files.push({
+                    file: relPath,
+                    totalFunctions,
+                    coveredFunctions,
+                    functionPct: totalFunctions > 0 ? round((coveredFunctions / totalFunctions) * 100) : 100,
+                    totalRanges,
+                    coveredRanges,
+                    rangePct: totalRanges > 0 ? round((coveredRanges / totalRanges) * 100) : 100,
+                });
+            }
+        }
+        files.sort((a, b) => a.file.localeCompare(b.file));
+        const totalFns = files.reduce((s, f) => s + f.totalFunctions, 0);
+        const coveredFns = files.reduce((s, f) => s + f.coveredFunctions, 0);
+        const totalRng = files.reduce((s, f) => s + f.totalRanges, 0);
+        const coveredRng = files.reduce((s, f) => s + f.coveredRanges, 0);
+        return {
+            files,
+            totalFunctionPct: totalFns > 0 ? round((coveredFns / totalFns) * 100) : 100,
+            totalRangePct: totalRng > 0 ? round((coveredRng / totalRng) * 100) : 100,
+            fileCount: files.length,
+            generatedAt: Date.now(),
+        };
+    }
+    /**
+     * Print a summary table to console.
+     */
+    printSummary(report) {
+        const header = 'File'.padEnd(50) + 'Functions'.padEnd(15) + 'Ranges';
+        console.log('─'.repeat(75));
+        console.log(header);
+        console.log('─'.repeat(75));
+        for (const f of report.files) {
+            const name = f.file.length > 48 ? '…' + f.file.slice(-47) : f.file;
+            const fnCol = `${f.coveredFunctions}/${f.totalFunctions} (${f.functionPct}%)`.padEnd(15);
+            const rgCol = `${f.coveredRanges}/${f.totalRanges} (${f.rangePct}%)`;
+            console.log(name.padEnd(50) + fnCol + rgCol);
+        }
+        console.log('─'.repeat(75));
+        console.log(`Total: ${report.fileCount} files | ` +
+            `Functions: ${report.totalFunctionPct}% | ` +
+            `Ranges: ${report.totalRangePct}%`);
+        console.log('─'.repeat(75));
+    }
+    /**
+     * Enforce coverage thresholds. Throws if below threshold.
+     */
+    enforce(report, thresholds) {
+        const failures = [];
+        if (thresholds.functionPct !== undefined && report.totalFunctionPct < thresholds.functionPct) {
+            failures.push(`Function coverage ${report.totalFunctionPct}% below threshold ${thresholds.functionPct}%`);
+        }
+        if (thresholds.rangePct !== undefined && report.totalRangePct < thresholds.rangePct) {
+            failures.push(`Range coverage ${report.totalRangePct}% below threshold ${thresholds.rangePct}%`);
+        }
+        if (thresholds.perFileFunctionPct !== undefined) {
+            for (const f of report.files) {
+                if (f.functionPct < thresholds.perFileFunctionPct) {
+                    failures.push(`${f.file}: function coverage ${f.functionPct}% below per-file threshold ${thresholds.perFileFunctionPct}%`);
+                }
+            }
+        }
+        if (failures.length > 0) {
+            throw new Error(`Coverage thresholds not met:\n${failures.join('\n')}`);
+        }
+    }
+    // --------------------------------------------------------------------------
+    // Internal
+    // --------------------------------------------------------------------------
+    async findCoverageFiles() {
+        const results = [];
+        try {
+            const entries = await (0, promises_1.readdir)(this.config.coverageDir);
+            for (const entry of entries) {
+                if (entry.endsWith('.json')) {
+                    results.push((0, path_1.join)(this.config.coverageDir, entry));
+                }
+            }
+        }
+        catch {
+            // Directory doesn't exist or not readable
+        }
+        return results;
+    }
+    shouldInclude(url) {
+        if (!url || url.startsWith('node:'))
+            return false;
+        const hasInclude = this.config.include.some((p) => url.includes(p));
+        const hasExclude = this.config.exclude.some((p) => url.includes(p));
+        return hasInclude && !hasExclude;
+    }
+    toRelativePath(url) {
+        let path = url;
+        // Strip file:// prefix
+        if (path.startsWith('file://')) {
+            path = path.slice(7);
+        }
+        // On Windows, strip leading slash before drive letter
+        if (/^\/[A-Za-z]:/.test(path)) {
+            path = path.slice(1);
+        }
+        return (0, path_1.relative)(this.config.projectRoot, path).replace(/\\/g, '/');
+    }
+}
+exports.CoverageReporter = CoverageReporter;
+/** Round to 1 decimal */
+function round(n) {
+    return Math.round(n * 10) / 10;
+}
+//# sourceMappingURL=coverage-reporter.js.map

package/dist/esm/lib/coverage-reporter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"coverage-reporter.js","sourceRoot":"","sources":["../../../lib/coverage-reporter.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;GAkBG;;;AAEH,0CAAgD;AAChD,+BAA+C;AAmF/C,+EAA+E;AAC/E,WAAW;AACX,+EAA+E;AAE/E;;GAEG;AACH,MAAa,gBAAgB;IACV,MAAM,CAAmC;IAE1D,YAAY,MAA8B;QACxC,IAAI,CAAC,MAAM,GAAG;YACZ,WAAW,EAAE,IAAA,cAAO,EAAC,MAAM,CAAC,WAAW,CAAC;YACxC,WAAW,EAAE,MAAM,CAAC,WAAW,IAAI,OAAO,CAAC,GAAG,EAAE;YAChD,OAAO,EAAE,MAAM,CAAC,OAAO,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC;YACzC,OAAO,EAAE,MAAM,CAAC,OAAO,IAAI,CAAC,cAAc,EAAE,OAAO,EAAE,OAAO,CAAC;SAC9D,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,OAAO;QACX,MAAM,KAAK,GAAmB,EAAE,CAAC;QACjC,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAErD,KAAK,MAAM,EAAE,IAAI,aAAa,EAAE,CAAC;YAC/B,MAAM,GAAG,GAAG,MAAM,IAAA,mBAAQ,EAAC,EAAE,EAAE,OAAO,CAAC,CAAC;YACxC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAmB,CAAC;YAE/C,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBACjC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC;oBAAE,SAAS;gBAE9C,MAAM,OAAO,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBAChD,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC;gBACvD,IAAI,QAAQ;oBAAE,SAAS,CAAC,cAAc;gBAEtC,MAAM,cAAc,GAAG,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC;gBAC/C,MAAM,gBAAgB,GAAG,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CACtD,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CACnC,CAAC,MAAM,CAAC;gBAET,IAAI,WAAW,GAAG,CAAC,CAAC;gBACpB,IAAI,aAAa,GAAG,CAAC,CAAC;gBACtB,KAAK,MAAM,EAAE,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;oBAClC,KAAK,MAAM,KAAK,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;wBAC9B,WAAW,EAAE,CAAC;wBACd,IAAI,KAAK,CAAC,KAAK,GAAG,CAAC;4BAAE,aAAa,EAAE,CAAC;oBACvC,CAAC;gBACH,CAAC;gBAED,KAAK,CAAC,IAAI,CAAC;oBACT,IAAI,EAAE,OAAO;oBACb,cAAc;oBACd,gBAAgB;oBAChB,WAAW,EAAE,cAAc,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,gBAAgB,GAAG,cAAc,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG;oBACxF,WAAW;oBACX,aAAa;oBACb,QAAQ,EAAE,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,aAAa,GAAG,WAAW,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG;iBAC7E,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAEnD,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;QACjE,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,gBAAgB,EAAE,CAAC,CAAC,CAAC;QACrE,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QAC9D,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;QAElE,OAAO;YACL,KAAK;YACL,gBAAgB,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,UAAU,GAAG,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG;YAC3E,aAAa,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,UAAU,GAAG,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG;YACxE,SAAS,EAAE,KAAK,CAAC,MAAM;YACvB,WAAW,EAAE,IAAI,CAAC,GAAG,EAAE;SACxB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,MAAsB;QACjC,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC;QACrE,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5B,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpB,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QAE5B,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YACnE,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,gBAAgB,IAAI,CAAC,CAAC,cAAc,KAAK,CAAC,CAAC,WAAW,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACzF,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,aAAa,IAAI,CAAC,CAAC,WAAW,KAAK,CAAC,CAAC,QAAQ,IAAI,CAAC;YACrE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,KAAK,GAAG,KAAK,CAAC,CAAC;QAC/C,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5B,OAAO,CAAC,GAAG,CACT,UAAU,MAAM,CAAC,SAAS,WAAW;YACrC,cAAc,MAAM,CAAC,gBAAgB,MAAM;YAC3C,WAAW,MAAM,CAAC,aAAa,GAAG,CACnC,CAAC;QACF,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,MAAsB,EAAE,UAA8B;QAC5D,MAAM,QAAQ,GAAa,EAAE,CAAC;QAE9B,IAAI,UAAU,CAAC,WAAW,KAAK,SAAS,IAAI,MAAM,CAAC,gBAAgB,GAAG,UAAU,CAAC,WAAW,EAAE,CAAC;YAC7F,QAAQ,CAAC,IAAI,CACX,qBAAqB,MAAM,CAAC,gBAAgB,qBAAqB,UAAU,CAAC,WAAW,GAAG,CAC3F,CAAC;QACJ,CAAC;QAED,IAAI,UAAU,CAAC,QAAQ,KAAK,SAAS,IAAI,MAAM,CAAC,aAAa,GAAG,UAAU,CAAC,QAAQ,EAAE,CAAC;YACpF,QAAQ,CAAC,IAAI,CACX,kBAAkB,MAAM,CAAC,aAAa,qBAAqB,UAAU,CAAC,QAAQ,GAAG,CAClF,CAAC;QACJ,CAAC;QAED,IAAI,UAAU,CAAC,kBAAkB,KAAK,SAAS,EAAE,CAAC;YAChD,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;gBAC7B,IAAI,CAAC,CAAC,WAAW,GAAG,UAAU,CAAC,kBAAkB,EAAE,CAAC;oBAClD,QAAQ,CAAC,IAAI,CACX,GAAG,CAAC,CAAC,IAAI,uBAAuB,CAAC,CAAC,WAAW,8BAA8B,UAAU,CAAC,kBAAkB,GAAG,CAC5G,CAAC;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,KAAK,CAAC,iCAAiC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC1E,CAAC;IACH,CAAC;IAED,6EAA6E;IAC7E,WAAW;IACX,6EAA6E;IAErE,KAAK,CAAC,iBAAiB;QAC7B,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,MAAM,IAAA,kBAAO,EAAC,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;YACvD,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;gBAC5B,IAAI,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;oBAC5B,OAAO,CAAC,IAAI,CAAC,IAAA,WAAI,EAAC,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC,CAAC;gBACrD,CAAC;YACH,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,0CAA0C;QAC5C,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAEO,aAAa,CAAC,GAAW;QAC/B,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,OAAO,CAAC;YAAE,OAAO,KAAK,CAAC;QAClD,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,OAAO,UAAU,IAAI,CAAC,UAAU,CAAC;IACnC,CAAC;IAEO,cAAc,CAAC,GAAW;QAChC,IAAI,IAAI,GAAG,GAAG,CAAC;QACf,uBAAuB;QACvB,IAAI,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC;YAC/B,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC;QACD,sDAAsD;QACtD,IAAI,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9B,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC;QACD,OAAO,IAAA,eAAQ,EAAC,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACrE,CAAC;CACF;AAxKD,4CAwKC;AAED,yBAAyB;AACzB,SAAS,KAAK,CAAC,CAAS;IACtB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;AACjC,CAAC"}

package/dist/esm/lib/crdt.js

@@ -0,0 +1,141 @@
+"use strict";
+/**
+ * CRDT (Conflict-free Replicated Data Type) Primitives
+ *
+ * Provides vector clocks and merge logic that allow multiple `CrdtBackend`
+ * instances (on different processes or machines) to synchronize without
+ * coordination and converge to the same state.
+ *
+ * Vector clock semantics:
+ *   - Each node tracks its own logical time as an integer counter.
+ *   - On every write, the node increments its own counter.
+ *   - "Happens-before" (A → B): every component of A's clock is ≤ B's,
+ *     and at least one is strictly less.
+ *   - "Concurrent" (A ∥ B): neither happened-before the other.
+ *   - Conflict resolution for concurrent writes: last-write-wins by
+ *     wall-clock timestamp; lexicographically larger nodeId as tiebreaker
+ *     for identical timestamps (deterministic, independent of arrival order).
+ *
+ * @module CRDT
+ * @version 1.0.0
+ * @license MIT
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.tickClock = tickClock;
+exports.mergeClock = mergeClock;
+exports.happensBefore = happensBefore;
+exports.isConcurrent = isConcurrent;
+exports.compareClock = compareClock;
+exports.mergeEntry = mergeEntry;
+// ============================================================================
+// CLOCK OPERATIONS
+// ============================================================================
+/**
+ * Increment a node's counter in a vector clock.
+ * Returns a new clock — does not mutate the input.
+ *
+ * @example
+ * ```typescript
+ * const c0 = {};
+ * const c1 = tickClock(c0, 'node-a'); // { 'node-a': 1 }
+ * const c2 = tickClock(c1, 'node-a'); // { 'node-a': 2 }
+ * ```
+ */
+function tickClock(clock, nodeId) {
+    return { ...clock, [nodeId]: (clock[nodeId] ?? 0) + 1 };
+}
+/**
+ * Merge two vector clocks by taking the component-wise maximum.
+ * Returns a new clock — does not mutate the inputs.
+ *
+ * @example
+ * ```typescript
+ * const a = { 'node-a': 3, 'node-b': 1 };
+ * const b = { 'node-a': 1, 'node-b': 4 };
+ * mergeClock(a, b); // { 'node-a': 3, 'node-b': 4 }
+ * ```
+ */
+function mergeClock(a, b) {
+    const result = { ...a };
+    for (const [node, counter] of Object.entries(b)) {
+        result[node] = Math.max(result[node] ?? 0, counter);
+    }
+    return result;
+}
+/**
+ * Returns `true` if clock `a` happened-before clock `b`.
+ *
+ * Every component of `a` must be ≤ the corresponding component of `b`,
+ * and at least one component of `a` must be strictly less than `b`.
+ */
+function happensBefore(a, b) {
+    const allNodes = new Set([...Object.keys(a), ...Object.keys(b)]);
+    let hasStrictlyLess = false;
+    for (const node of allNodes) {
+        const aVal = a[node] ?? 0;
+        const bVal = b[node] ?? 0;
+        if (aVal > bVal)
+            return false; // a is NOT ≤ b — cannot happen-before
+        if (aVal < bVal)
+            hasStrictlyLess = true;
+    }
+    return hasStrictlyLess;
+}
+/**
+ * Returns `true` if `a` and `b` are concurrent — neither happened-before
+ * the other. Both clocks have components where each is strictly greater
+ * than the other.
+ */
+function isConcurrent(a, b) {
+    return !happensBefore(a, b) && !happensBefore(b, a);
+}
+/**
+ * Compare two vector clocks.
+ *
+ * Returns:
+ *   -1  if `a` happened-before `b`
+ *    1  if `b` happened-before `a`
+ *    0  if concurrent or identical
+ */
+function compareClock(a, b) {
+    if (happensBefore(a, b))
+        return -1;
+    if (happensBefore(b, a))
+        return 1;
+    return 0;
+}
+// ============================================================================
+// CRDT MERGE
+// ============================================================================
+/**
+ * Merge two `CrdtEntry` values for the same key, returning the winner.
+ *
+ * Resolution order:
+ *   1. Causal order — if one entry happened-before the other, the later one wins.
+ *   2. Timestamp tiebreak — for concurrent entries, the later wall-clock
+ *      `timestamp` wins.
+ *   3. NodeId tiebreak — for identical timestamps, the lexicographically
+ *      larger `nodeId` wins (deterministic, node-independent).
+ *
+ * Tombstones (`deleted: true`) participate normally in this ordering —
+ * a delete recorded at a later vector clock will win over a live write.
+ *
+ * @example
+ * ```typescript
+ * const winner = mergeEntry(entryFromNodeA, entryFromNodeB);
+ * ```
+ */
+function mergeEntry(a, b) {
+    const order = compareClock(a.vectorClock, b.vectorClock);
+    if (order === -1)
+        return b; // a happened-before b → b wins
+    if (order === 1)
+        return a; // b happened-before a → a wins
+    // Concurrent — tiebreak by timestamp, then nodeId
+    const aTime = new Date(a.timestamp).getTime();
+    const bTime = new Date(b.timestamp).getTime();
+    if (aTime !== bTime)
+        return aTime > bTime ? a : b;
+    return a.nodeId >= b.nodeId ? a : b;
+}
+//# sourceMappingURL=crdt.js.map

package/dist/esm/lib/crdt.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"crdt.js","sourceRoot":"","sources":["../../../lib/crdt.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;;AA4CH,8BAEC;AAaD,gCAMC;AAQD,sCAUC;AAOD,oCAEC;AAUD,oCAIC;AAwBD,gCAUC;AA/GD,+EAA+E;AAC/E,mBAAmB;AACnB,+EAA+E;AAE/E;;;;;;;;;;GAUG;AACH,SAAgB,SAAS,CAAC,KAAkB,EAAE,MAAc;IAC1D,OAAO,EAAE,GAAG,KAAK,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;AAC1D,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAgB,UAAU,CAAC,CAAc,EAAE,CAAc;IACvD,MAAM,MAAM,GAAgB,EAAE,GAAG,CAAC,EAAE,CAAC;IACrC,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;QAChD,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,OAAO,CAAC,CAAC;IACtD,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;GAKG;AACH,SAAgB,aAAa,CAAC,CAAc,EAAE,CAAc;IAC1D,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,IAAI,eAAe,GAAG,KAAK,CAAC;IAC5B,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1B,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1B,IAAI,IAAI,GAAG,IAAI;YAAE,OAAO,KAAK,CAAC,CAAO,sCAAsC;QAC3E,IAAI,IAAI,GAAG,IAAI;YAAE,eAAe,GAAG,IAAI,CAAC;IAC1C,CAAC;IACD,OAAO,eAAe,CAAC;AACzB,CAAC;AAED;;;;GAIG;AACH,SAAgB,YAAY,CAAC,CAAc,EAAE,CAAc;IACzD,OAAO,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACtD,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,YAAY,CAAC,CAAc,EAAE,CAAc;IACzD,IAAI,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC,CAAC;IACnC,IAAI,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC;IAClC,OAAO,CAAC,CAAC;AACX,CAAC;AAED,+EAA+E;AAC/E,aAAa;AACb,+EAA+E;AAE/E;;;;;;;;;;;;;;;;;GAiBG;AACH,SAAgB,UAAU,CAAC,CAAY,EAAE,CAAY;IACnD,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC;IACzD,IAAI,KAAK,KAAK,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC,CAAG,+BAA+B;IAC7D,IAAI,KAAK,KAAK,CAAC;QAAG,OAAO,CAAC,CAAC,CAAG,+BAA+B;IAE7D,kDAAkD;IAClD,MAAM,KAAK,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,CAAC;IAC9C,MAAM,KAAK,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,CAAC;IAC9C,IAAI,KAAK,KAAK,KAAK;QAAE,OAAO,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClD,OAAO,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACtC,CAAC"}