pushwork 1.0.4 → 1.0.7

package/src/cli/index.ts

@@ -1,2 +0,0 @@
-// CLI commands
-export * from "./commands";

package/src/utils/content-similarity.ts

@@ -1,194 +0,0 @@
-import { calculateContentHash } from "./fs";
-
-/**
- * Content similarity calculation for move detection
- */
-export class ContentSimilarity {
-  private static readonly CHUNK_SIZE = 1024; // 1KB chunks for sampling
-  private static readonly AUTO_THRESHOLD = 0.8;
-  private static readonly PROMPT_THRESHOLD = 0.5;
-
-  /**
-   * Calculate similarity between two content pieces
-   */
-  static async calculateSimilarity(
-    content1: string | Uint8Array,
-    content2: string | Uint8Array
-  ): Promise<number> {
-    // 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
-   */
-  private static async areIdentical(
-    content1: string | Uint8Array,
-    content2: string | Uint8Array
-  ): Promise<boolean> {
-    const hash1 = await calculateContentHash(content1);
-    const hash2 = await calculateContentHash(content2);
-    return hash1 === hash2;
-  }
-
-  /**
-   * Calculate similarity for small files using full content
-   */
-  private static calculateFullSimilarity(
-    content1: string | Uint8Array,
-    content2: string | Uint8Array
-  ): number {
-    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
-   */
-  private static calculateSampledSimilarity(
-    content1: string | Uint8Array,
-    content2: string | Uint8Array
-  ): number {
-    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
-   */
-  private static getSamples(content: string | Uint8Array): string[] {
-    const str =
-      typeof content === "string" ? content : this.bufferToString(content);
-    const length = str.length;
-    const samples: string[] = [];
-
-    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)
-   */
-  private static levenshteinSimilarity(str1: string, str2: string): number {
-    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
-   */
-  private static levenshteinDistance(str1: string, str2: string): number {
-    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
-   */
-  private static bufferToString(buffer: Uint8Array): string {
-    // 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: number): "auto" | "prompt" | "low" {
-    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: number): boolean {
-    return similarity >= this.AUTO_THRESHOLD;
-  }
-
-  /**
-   * Should prompt user for move confirmation
-   */
-  static shouldPromptUser(similarity: number): boolean {
-    return (
-      similarity >= this.PROMPT_THRESHOLD && similarity < this.AUTO_THRESHOLD
-    );
-  }
-}

package/test/README-TESTING-GAPS.md

@@ -1,174 +0,0 @@
-# Testing Gaps Analysis
-
-## Overview
-
-This document outlines the testing gaps identified in the autosync codebase, particularly around the major architectural changes implemented for directory document management and text CRDT support.
-
-## Current Test Coverage
-
-✅ **Well Tested:**
-
-- File system utilities (`test/unit/utils.test.ts`) - 89 test cases
-- Snapshot management (`test/unit/snapshot.test.ts`) - Comprehensive coverage
-- Content similarity (`test/unit/content-similarity.test.ts`) - Move detection logic
-- Integration scenarios (`test/integration/*.test.ts`) - File operations, exclude patterns
-
-## Critical Testing Gaps
-
-### 1. SyncEngine Core Logic (HIGH PRIORITY)
-
-**Status:** ❌ No direct unit tests
-**Impact:** Core synchronization logic untested
-
-**Missing Coverage:**
-
-- `sync()` method with various file scenarios
-- `applyLocalChangeToRemote()` / `applyRemoteChangeToLocal()`
-- Bidirectional sync flow
-- Error handling during sync operations
-- Dry run mode functionality
-
-### 2. Directory Document Management (HIGH PRIORITY)
-
-**Status:** ❌ No tests for new feature
-**Impact:** New architectural feature completely untested
-
-**Missing Coverage:**
-
-- `addFileToRootDirectory()` - Adding files to directory structure
-- `removeFileFromRootDirectory()` - Removing files from directory structure
-- `setRootDirectoryUrl()` - Root directory URL persistence
-- Directory structure synchronization between peers
-- Root directory document creation during init
-
-### 3. Text CRDT Implementation (MEDIUM PRIORITY)
-
-**Status:** ❌ No tests for new feature
-**Impact:** New text handling functionality untested
-
-**Missing Coverage:**
-
-- `isTextContent()` method logic (simplified version)
-- Text files using `updateText()` vs binary files using direct assignment
-- Mixed content operations in single sync
-- Text CRDT conflict resolution behavior
-
-### 4. CLI Command Integration (MEDIUM PRIORITY)
-
-**Status:** ❌ No end-to-end CLI tests
-**Impact:** User-facing functionality untested
-
-**Missing Coverage:**
-
-- `init` command with directory document creation
-- `sync` command full bidirectional flow
-- `status`, `diff`, `log` command accuracy
-- Error handling in CLI commands
-- `--dry-run` flag functionality
-
-### 5. Automerge Repository Integration (LOW PRIORITY)
-
-**Status:** ❌ No Automerge-specific tests
-**Impact:** Repository lifecycle and document management untested
-
-**Missing Coverage:**
-
-- Document creation and updates
-- Repository shutdown behavior
-- Document head tracking accuracy
-- Network synchronization (mocked)
-
-## Technical Challenges
-
-### Jest + ES Modules Issue
-
-**Problem:** `@automerge/automerge-repo` uses ES modules that Jest struggles to handle
-**Error:** `SyntaxError: Unexpected token 'export'`
-
-**Attempted Solutions:**
-
-- Modified Jest `transformIgnorePatterns`
-- Added ES module configuration
-- All attempts failed due to complex dependency chain
-
-### Recommended Solutions
-
-#### Option 1: Integration Testing Approach
-
-Create integration tests that test the full flow without mocking Automerge:
-
-```typescript
-// test/integration/sync-engine-integration.test.ts
-// Test real sync operations with actual Automerge repositories
-// Focus on end-to-end behavior rather than unit testing
-```
-
-#### Option 2: Mock-Heavy Unit Testing
-
-Create comprehensive mocks for Automerge dependencies:
-
-```typescript
-// Heavy mocking of @automerge/automerge-repo
-// Test SyncEngine logic in isolation
-// More fragile but allows unit testing
-```
-
-#### Option 3: Test Configuration Update
-
-Update Jest/test environment to properly handle ES modules:
-
-- Migrate to newer Jest version with better ES module support
-- Or switch to alternative test runner (Vitest, etc.)
-
-## Immediate Actions Taken
-
-### Comprehensive `isTextContent()` Testing
-
-Since this is a pure function, it can be tested independently:
-
-```typescript
-// Manual testing confirmed:
-// ✅ Strings identified as text
-// ✅ Uint8Array identified as binary
-// ✅ Edge cases handled correctly
-```
-
-### Manual Integration Testing
-
-Verified through manual CLI testing:
-
-- ✅ Directory document management working
-- ✅ Root directory URL persistence
-- ✅ File creation/deletion updates directory structure
-- ✅ Text files using updateText(), binary files using direct assignment
-
-## Recommendations
-
-### Short Term (Implemented)
-
-1. ✅ Document testing gaps (this file)
-2. ✅ Manual testing of critical functionality
-3. ✅ Existing test suite still passing (89 tests)
-
-### Medium Term (Future Work)
-
-1. **Integration Test Suite:** Create `test/integration/sync-engine-e2e.test.ts`
-2. **CLI Testing:** Add end-to-end CLI command testing
-3. **Mock Strategy:** Develop proper Automerge mocking approach
-
-### Long Term (Future Work)
-
-1. **Test Environment Upgrade:** Resolve ES module handling
-2. **Comprehensive Unit Tests:** Full SyncEngine unit test coverage
-3. **Property-Based Testing:** Add property testing for sync operations
-
-## Current Test Status
-
-- **Total Tests:** 89 passing
-- **Test Suites:** 5 passing
-- **Coverage:** High for utilities, medium for integration, low for core sync logic
-- **Critical Features:** Manually verified but not automatically tested
-
-## Conclusion
-
-While we've identified significant testing gaps around the new features, the existing test suite provides confidence in the foundation. The new features have been manually tested and are working correctly. Future development should prioritize integration testing to cover the areas where unit testing is blocked by ES module issues.

package/test/unit/content-similarity.test.ts

@@ -1,236 +0,0 @@
-import { ContentSimilarity } from "../../src/utils/content-similarity";
-
-describe("ContentSimilarity", () => {
-  describe("calculateSimilarity", () => {
-    it("should return 1.0 for identical strings", async () => {
-      const content1 = "Hello, world!";
-      const content2 = "Hello, world!";
-
-      const similarity = await ContentSimilarity.calculateSimilarity(
-        content1,
-        content2
-      );
-
-      expect(similarity).toBe(1.0);
-    });
-
-    it("should return 1.0 for identical binary content", async () => {
-      const content1 = new Uint8Array([0x00, 0x01, 0x02, 0x03]);
-      const content2 = new Uint8Array([0x00, 0x01, 0x02, 0x03]);
-
-      const similarity = await ContentSimilarity.calculateSimilarity(
-        content1,
-        content2
-      );
-
-      expect(similarity).toBe(1.0);
-    });
-
-    it("should return 0.0 for very different content sizes", async () => {
-      const content1 = "short";
-      const content2 = "a".repeat(1000); // Much longer
-
-      const similarity = await ContentSimilarity.calculateSimilarity(
-        content1,
-        content2
-      );
-
-      expect(similarity).toBe(0.0);
-    });
-
-    it("should return high similarity for slightly different content", async () => {
-      const content1 = "Hello, world!";
-      const content2 = "Hello, world?";
-
-      const similarity = await ContentSimilarity.calculateSimilarity(
-        content1,
-        content2
-      );
-
-      expect(similarity).toBeGreaterThan(0.9);
-      expect(similarity).toBeLessThan(1.0);
-    });
-
-    it("should return low similarity for very different content", async () => {
-      const content1 = "Hello, world!";
-      const content2 = "Goodbye, universe!";
-
-      const similarity = await ContentSimilarity.calculateSimilarity(
-        content1,
-        content2
-      );
-
-      expect(similarity).toBeLessThan(0.5);
-    });
-
-    it("should handle mixed string and binary content", async () => {
-      const content1 = "Hello, world!";
-      const content2 = new Uint8Array([0x48, 0x65, 0x6c, 0x6c, 0x6f]); // "Hello" in ASCII
-
-      const similarity = await ContentSimilarity.calculateSimilarity(
-        content1,
-        content2
-      );
-
-      // Mixed content types (string vs binary) should have low similarity
-      // since binary is converted to hex representation for comparison
-      expect(similarity).toBe(0.0);
-    });
-
-    it("should use sampling for large content", async () => {
-      const content1 =
-        "a".repeat(10000) + "different middle" + "b".repeat(10000);
-      const content2 =
-        "a".repeat(10000) + "same middle here" + "b".repeat(10000);
-
-      const similarity = await ContentSimilarity.calculateSimilarity(
-        content1,
-        content2
-      );
-
-      // Should still detect high similarity due to matching beginning and end
-      expect(similarity).toBeGreaterThan(0.6);
-    });
-
-    it("should handle empty content", async () => {
-      const content1 = "";
-      const content2 = "not empty";
-
-      const similarity = await ContentSimilarity.calculateSimilarity(
-        content1,
-        content2
-      );
-
-      expect(similarity).toBe(0.0);
-    });
-
-    it("should return 1.0 for both empty content", async () => {
-      const content1 = "";
-      const content2 = "";
-
-      const similarity = await ContentSimilarity.calculateSimilarity(
-        content1,
-        content2
-      );
-
-      expect(similarity).toBe(1.0);
-    });
-  });
-
-  describe("getConfidenceLevel", () => {
-    it("should return auto for high similarity", () => {
-      expect(ContentSimilarity.getConfidenceLevel(0.9)).toBe("auto");
-      expect(ContentSimilarity.getConfidenceLevel(0.8)).toBe("auto");
-    });
-
-    it("should return prompt for medium similarity", () => {
-      expect(ContentSimilarity.getConfidenceLevel(0.7)).toBe("prompt");
-      expect(ContentSimilarity.getConfidenceLevel(0.5)).toBe("prompt");
-    });
-
-    it("should return low for low similarity", () => {
-      expect(ContentSimilarity.getConfidenceLevel(0.4)).toBe("low");
-      expect(ContentSimilarity.getConfidenceLevel(0.0)).toBe("low");
-    });
-  });
-
-  describe("shouldAutoApply", () => {
-    it("should return true for high similarity", () => {
-      expect(ContentSimilarity.shouldAutoApply(0.9)).toBe(true);
-      expect(ContentSimilarity.shouldAutoApply(0.8)).toBe(true);
-    });
-
-    it("should return false for medium/low similarity", () => {
-      expect(ContentSimilarity.shouldAutoApply(0.7)).toBe(false);
-      expect(ContentSimilarity.shouldAutoApply(0.5)).toBe(false);
-      expect(ContentSimilarity.shouldAutoApply(0.3)).toBe(false);
-    });
-  });
-
-  describe("shouldPromptUser", () => {
-    it("should return true for medium similarity", () => {
-      expect(ContentSimilarity.shouldPromptUser(0.7)).toBe(true);
-      expect(ContentSimilarity.shouldPromptUser(0.6)).toBe(true);
-      expect(ContentSimilarity.shouldPromptUser(0.5)).toBe(true);
-    });
-
-    it("should return false for high similarity", () => {
-      expect(ContentSimilarity.shouldPromptUser(0.9)).toBe(false);
-      expect(ContentSimilarity.shouldPromptUser(0.8)).toBe(false);
-    });
-
-    it("should return false for low similarity", () => {
-      expect(ContentSimilarity.shouldPromptUser(0.4)).toBe(false);
-      expect(ContentSimilarity.shouldPromptUser(0.3)).toBe(false);
-    });
-  });
-
-  describe("edge cases", () => {
-    it("should handle Unicode content correctly", async () => {
-      const content1 = "🚀 Hello, 世界!";
-      const content2 = "🚀 Hello, 世界?";
-
-      const similarity = await ContentSimilarity.calculateSimilarity(
-        content1,
-        content2
-      );
-
-      expect(similarity).toBeGreaterThan(0.9);
-    });
-
-    it("should handle line breaks and whitespace", async () => {
-      const content1 = "Line 1\nLine 2\nLine 3";
-      const content2 = "Line 1\r\nLine 2\r\nLine 3";
-
-      const similarity = await ContentSimilarity.calculateSimilarity(
-        content1,
-        content2
-      );
-
-      expect(similarity).toBeGreaterThan(0.8);
-    });
-
-    it("should handle very small content differences", async () => {
-      const content1 = "a";
-      const content2 = "b";
-
-      const similarity = await ContentSimilarity.calculateSimilarity(
-        content1,
-        content2
-      );
-
-      expect(similarity).toBe(0.0); // Single character, completely different
-    });
-
-    it("should handle binary data with patterns", async () => {
-      const content1 = new Uint8Array([0x00, 0x01, 0x02, 0x03, 0x04, 0x05]);
-      const content2 = new Uint8Array([0x00, 0x01, 0x02, 0xff, 0x04, 0x05]);
-
-      const similarity = await ContentSimilarity.calculateSimilarity(
-        content1,
-        content2
-      );
-
-      expect(similarity).toBeGreaterThan(0.5); // Most bytes are the same
-      expect(similarity).toBeLessThan(1.0);
-    });
-  });
-
-  describe("performance characteristics", () => {
-    it("should handle reasonably large files efficiently", async () => {
-      const size = 100000; // 100KB
-      const content1 = "a".repeat(size);
-      const content2 = "a".repeat(size - 10) + "b".repeat(10);
-
-      const startTime = Date.now();
-      const similarity = await ContentSimilarity.calculateSimilarity(
-        content1,
-        content2
-      );
-      const duration = Date.now() - startTime;
-
-      expect(similarity).toBeGreaterThan(0.8);
-      expect(duration).toBeLessThan(1000); // Should complete within 1 second
-    }, 10000); // 10 second timeout for this test
-  });
-});