pushwork 1.1.6 → 1.2.2

package/dist/utils/content-similarity.js

@@ -1,155 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.ContentSimilarity = void 0;
-const fs_1 = require("./fs");
-/**
- * Content similarity calculation for move detection
- */
-class ContentSimilarity {
-    /**
-     * Calculate similarity between two content pieces
-     */
-    static async calculateSimilarity(content1, content2) {
-        // Quick early exit for identical content
-        if (await this.areIdentical(content1, content2)) {
-            return 1.0;
-        }
-        // Size-based quick rejection
-        const size1 = typeof content1 === "string" ? content1.length : content1.length;
-        const size2 = typeof content2 === "string" ? content2.length : content2.length;
-        const sizeDiff = Math.abs(size1 - size2) / Math.max(size1, size2);
-        if (sizeDiff > 0.5) {
-            return 0.0; // Too different in size
-        }
-        // For small files, use full content comparison
-        if (size1 < this.CHUNK_SIZE * 4 && size2 < this.CHUNK_SIZE * 4) {
-            return this.calculateFullSimilarity(content1, content2);
-        }
-        // For large files, use sampling
-        return this.calculateSampledSimilarity(content1, content2);
-    }
-    /**
-     * Check if two content pieces are identical
-     */
-    static async areIdentical(content1, content2) {
-        const hash1 = await (0, fs_1.calculateContentHash)(content1);
-        const hash2 = await (0, fs_1.calculateContentHash)(content2);
-        return hash1 === hash2;
-    }
-    /**
-     * Calculate similarity for small files using full content
-     */
-    static calculateFullSimilarity(content1, content2) {
-        const str1 = typeof content1 === "string" ? content1 : this.bufferToString(content1);
-        const str2 = typeof content2 === "string" ? content2 : this.bufferToString(content2);
-        return this.levenshteinSimilarity(str1, str2);
-    }
-    /**
-     * Calculate similarity for large files using sampling
-     */
-    static calculateSampledSimilarity(content1, content2) {
-        const samples1 = this.getSamples(content1);
-        const samples2 = this.getSamples(content2);
-        let totalSimilarity = 0;
-        let comparisons = 0;
-        for (let i = 0; i < Math.min(samples1.length, samples2.length); i++) {
-            totalSimilarity += this.levenshteinSimilarity(samples1[i], samples2[i]);
-            comparisons++;
-        }
-        return comparisons > 0 ? totalSimilarity / comparisons : 0;
-    }
-    /**
-     * Get representative samples from content
-     */
-    static getSamples(content) {
-        const str = typeof content === "string" ? content : this.bufferToString(content);
-        const length = str.length;
-        const samples = [];
-        if (length <= this.CHUNK_SIZE) {
-            samples.push(str);
-            return samples;
-        }
-        // Beginning
-        samples.push(str.slice(0, this.CHUNK_SIZE));
-        // Middle
-        const midStart = Math.floor(length / 2) - Math.floor(this.CHUNK_SIZE / 2);
-        samples.push(str.slice(midStart, midStart + this.CHUNK_SIZE));
-        // End
-        samples.push(str.slice(-this.CHUNK_SIZE));
-        return samples;
-    }
-    /**
-     * Calculate Levenshtein similarity (0-1 scale)
-     */
-    static levenshteinSimilarity(str1, str2) {
-        if (str1 === str2)
-            return 1.0;
-        if (str1.length === 0 || str2.length === 0)
-            return 0.0;
-        const distance = this.levenshteinDistance(str1, str2);
-        const maxLength = Math.max(str1.length, str2.length);
-        return 1 - distance / maxLength;
-    }
-    /**
-     * Calculate Levenshtein distance
-     */
-    static levenshteinDistance(str1, str2) {
-        const matrix = Array(str2.length + 1)
-            .fill(null)
-            .map(() => Array(str1.length + 1).fill(null));
-        for (let i = 0; i <= str1.length; i++)
-            matrix[0][i] = i;
-        for (let j = 0; j <= str2.length; j++)
-            matrix[j][0] = j;
-        for (let j = 1; j <= str2.length; j++) {
-            for (let i = 1; i <= str1.length; i++) {
-                const indicator = str1[i - 1] === str2[j - 1] ? 0 : 1;
-                matrix[j][i] = Math.min(matrix[j][i - 1] + 1, // deletion
-                matrix[j - 1][i] + 1, // insertion
-                matrix[j - 1][i - 1] + indicator // substitution
-                );
-            }
-        }
-        return matrix[str2.length][str1.length];
-    }
-    /**
-     * Convert buffer to string for comparison
-     */
-    static bufferToString(buffer) {
-        // For binary content, use hex representation for comparison
-        return Array.from(buffer)
-            .map((b) => b.toString(16).padStart(2, "0"))
-            .join("");
-    }
-    /**
-     * Determine confidence level based on similarity score
-     */
-    static getConfidenceLevel(similarity) {
-        if (similarity >= this.AUTO_THRESHOLD) {
-            return "auto";
-        }
-        else if (similarity >= this.PROMPT_THRESHOLD) {
-            return "prompt";
-        }
-        else {
-            return "low";
-        }
-    }
-    /**
-     * Should auto-apply move based on similarity
-     */
-    static shouldAutoApply(similarity) {
-        return similarity >= this.AUTO_THRESHOLD;
-    }
-    /**
-     * Should prompt user for move confirmation
-     */
-    static shouldPromptUser(similarity) {
-        return (similarity >= this.PROMPT_THRESHOLD && similarity < this.AUTO_THRESHOLD);
-    }
-}
-exports.ContentSimilarity = ContentSimilarity;
-ContentSimilarity.CHUNK_SIZE = 1024; // 1KB chunks for sampling
-ContentSimilarity.AUTO_THRESHOLD = 0.8;
-ContentSimilarity.PROMPT_THRESHOLD = 0.5;
-//# sourceMappingURL=content-similarity.js.map

package/dist/utils/content-similarity.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"content-similarity.js","sourceRoot":"","sources":["../../src/utils/content-similarity.ts"],"names":[],"mappings":";;;AAAA,6BAA4C;AAE5C;;GAEG;AACH,MAAa,iBAAiB;IAK5B;;OAEG;IACH,MAAM,CAAC,KAAK,CAAC,mBAAmB,CAC9B,QAA6B,EAC7B,QAA6B;QAE7B,yCAAyC;QACzC,IAAI,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC;YAChD,OAAO,GAAG,CAAC;QACb,CAAC;QAED,6BAA6B;QAC7B,MAAM,KAAK,GACT,OAAO,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC;QACnE,MAAM,KAAK,GACT,OAAO,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC;QACnE,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAElE,IAAI,QAAQ,GAAG,GAAG,EAAE,CAAC;YACnB,OAAO,GAAG,CAAC,CAAC,wBAAwB;QACtC,CAAC;QAED,+CAA+C;QAC/C,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;YAC/D,OAAO,IAAI,CAAC,uBAAuB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAC1D,CAAC;QAED,gCAAgC;QAChC,OAAO,IAAI,CAAC,0BAA0B,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IAC7D,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,KAAK,CAAC,YAAY,CAC/B,QAA6B,EAC7B,QAA6B;QAE7B,MAAM,KAAK,GAAG,MAAM,IAAA,yBAAoB,EAAC,QAAQ,CAAC,CAAC;QACnD,MAAM,KAAK,GAAG,MAAM,IAAA,yBAAoB,EAAC,QAAQ,CAAC,CAAC;QACnD,OAAO,KAAK,KAAK,KAAK,CAAC;IACzB,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,uBAAuB,CACpC,QAA6B,EAC7B,QAA6B;QAE7B,MAAM,IAAI,GACR,OAAO,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;QAC1E,MAAM,IAAI,GACR,OAAO,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;QAE1E,OAAO,IAAI,CAAC,qBAAqB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAChD,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,0BAA0B,CACvC,QAA6B,EAC7B,QAA6B;QAE7B,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QAE3C,IAAI,eAAe,GAAG,CAAC,CAAC;QACxB,IAAI,WAAW,GAAG,CAAC,CAAC;QAEpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACpE,eAAe,IAAI,IAAI,CAAC,qBAAqB,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACxE,WAAW,EAAE,CAAC;QAChB,CAAC;QAED,OAAO,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,eAAe,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,UAAU,CAAC,OAA4B;QACpD,MAAM,GAAG,GACP,OAAO,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QACvE,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC;QAC1B,MAAM,OAAO,GAAa,EAAE,CAAC;QAE7B,IAAI,MAAM,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YAC9B,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClB,OAAO,OAAO,CAAC;QACjB,CAAC;QAED,YAAY;QACZ,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QAE5C,SAAS;QACT,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;QAC1E,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QAE9D,MAAM;QACN,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QAE1C,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,qBAAqB,CAAC,IAAY,EAAE,IAAY;QAC7D,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,GAAG,CAAC;QAC9B,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,GAAG,CAAC;QAEvD,MAAM,QAAQ,GAAG,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACtD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAErD,OAAO,CAAC,GAAG,QAAQ,GAAG,SAAS,CAAC;IAClC,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,mBAAmB,CAAC,IAAY,EAAE,IAAY;QAC3D,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;aAClC,IAAI,CAAC,IAAI,CAAC;aACV,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAEhD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAExD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,MAAM,SAAS,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtD,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CACrB,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,WAAW;gBACjC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,YAAY;gBAClC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,eAAe;iBACjD,CAAC;YACJ,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC1C,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,cAAc,CAAC,MAAkB;QAC9C,4DAA4D;QAC5D,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC;aACtB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;aAC3C,IAAI,CAAC,EAAE,CAAC,CAAC;IACd,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,kBAAkB,CAAC,UAAkB;QAC1C,IAAI,UAAU,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;YACtC,OAAO,MAAM,CAAC;QAChB,CAAC;aAAM,IAAI,UAAU,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;YAC/C,OAAO,QAAQ,CAAC;QAClB,CAAC;aAAM,CAAC;YACN,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,eAAe,CAAC,UAAkB;QACvC,OAAO,UAAU,IAAI,IAAI,CAAC,cAAc,CAAC;IAC3C,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,gBAAgB,CAAC,UAAkB;QACxC,OAAO,CACL,UAAU,IAAI,IAAI,CAAC,gBAAgB,IAAI,UAAU,GAAG,IAAI,CAAC,cAAc,CACxE,CAAC;IACJ,CAAC;;AA3LH,8CA4LC;AA3LyB,4BAAU,GAAG,IAAI,CAAC,CAAC,0BAA0B;AAC7C,gCAAc,GAAG,GAAG,CAAC;AACrB,kCAAgB,GAAG,GAAG,CAAC"}

package/dist/utils/node-polyfills.d.ts

@@ -1,9 +0,0 @@
-/**
- * Polyfills for browser APIs required by @automerge/automerge-subduction.
- * Must be imported before any subduction code.
- *
- * The Subduction WASM module uses IndexedDB for key persistence
- * (via WebCryptoSigner). In Node.js we provide a fake-indexeddb polyfill.
- */
-import "fake-indexeddb/auto";
-//# sourceMappingURL=node-polyfills.d.ts.map

package/dist/utils/node-polyfills.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"node-polyfills.d.ts","sourceRoot":"","sources":["../../src/utils/node-polyfills.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,OAAO,qBAAqB,CAAC"}

package/dist/utils/node-polyfills.js

@@ -1,9 +0,0 @@
-/**
- * Polyfills for browser APIs required by @automerge/automerge-subduction.
- * Must be imported before any subduction code.
- *
- * The Subduction WASM module uses IndexedDB for key persistence
- * (via WebCryptoSigner). In Node.js we provide a fake-indexeddb polyfill.
- */
-import "fake-indexeddb/auto";
-//# sourceMappingURL=node-polyfills.js.map

package/dist/utils/node-polyfills.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"node-polyfills.js","sourceRoot":"","sources":["../../src/utils/node-polyfills.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,OAAO,qBAAqB,CAAC"}