convertor/tests/transfer/chunk-upload.test.ts
Your Name 5322f85721 feat: 實作全域檔案傳輸機制與 .tar 封裝規範
## 主要變更

### 新增全域檔案傳輸模組 (src/transfer/)
- constants.ts: 定義傳輸常數(10MB 門檻、5MB chunk 大小)
- types.ts: 傳輸類型定義
- uploadManager.ts: 後端上傳管理器(支援直傳與 chunk)
- downloadManager.ts: 後端下載管理器(支援直傳與 chunk)
- archiveManager.ts: 封裝管理器(僅允許 .tar)
- index.ts: 統一匯出

### 新增 API 端點
- uploadChunk.tsx: Chunk 上傳 API
- downloadChunk.tsx: Chunk 下載 API

### 前端更新
- public/script.js: 整合智慧傳輸策略(≤10MB 直傳,>10MB chunk)
- public/transfer.js: 前端傳輸管理模組

### 轉換器更新
- mineru.ts: 改用 .tar 格式(不壓縮),禁止 .tar.gz
- download.tsx: 使用統一的封裝管理器

### 測試
- tests/transfer/: 完整傳輸機制測試套件
- tests/converters/mineru.test.ts: 更新以符合 .tar 規範

### 文件
- README.md: 新增檔案傳輸機制說明

## 設計原則
- 檔案 ≤10MB:直接傳輸
- 檔案 >10MB:使用 5MB chunks 分段傳輸
- 多檔輸出:僅允許 .tar 封裝(禁止 .tar.gz/.zip)
- 引擎層不感知 chunk(僅傳輸層處理)
2026-01-21 13:58:01 +08:00

178 lines
6.3 KiB
TypeScript
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

/**
* Contents.CN Chunk 上傳整合測試
*
* 測試大檔 chunk 上傳的完整流程
*/
import { test, expect, describe, beforeEach, afterEach } from "bun:test";
import { mkdirSync, existsSync, writeFileSync, rmSync, readFileSync, statSync } from "node:fs";
import { join } from "node:path";
import {
handleChunkUpload,
uploadSessionManager,
calculateChunkCount,
} from "../../src/transfer/uploadManager";
import { CHUNK_SIZE_BYTES } from "../../src/transfer/constants";
const testDir = "./test-output-chunk-upload";
describe("Chunk 上傳整合測試", () => {
beforeEach(() => {
if (!existsSync(testDir)) {
mkdirSync(testDir, { recursive: true });
}
});
afterEach(() => {
if (existsSync(testDir)) {
rmSync(testDir, { recursive: true, force: true });
}
});
test("多 chunk 上傳應正確合併", async () => {
const uploadId = "test-chunked-upload-1";
const fileName = "large-file.bin";
const userId = "test-user";
const jobId = "test-job";
// 建立測試資料(模擬 15MB 檔案,分 3 個 chunks
const chunkSize = 5 * 1024; // 使用較小的 chunk 以便測試
const chunk1 = Buffer.alloc(chunkSize, "A");
const chunk2 = Buffer.alloc(chunkSize, "B");
const chunk3 = Buffer.alloc(chunkSize, "C");
const totalSize = chunkSize * 3;
const totalChunks = 3;
const baseTempDir = join(testDir, "temp");
const targetDir = join(testDir, "uploads");
mkdirSync(baseTempDir, { recursive: true });
mkdirSync(targetDir, { recursive: true });
// 上傳 chunk 1
const result1 = await handleChunkUpload(
uploadId, 0, totalChunks, chunk1, fileName, totalSize,
userId, jobId, baseTempDir, targetDir
);
expect(result1.success).toBe(true);
expect(result1.completed).toBe(false);
expect(result1.received_chunks).toContain(0);
// 上傳 chunk 2
const result2 = await handleChunkUpload(
uploadId, 1, totalChunks, chunk2, fileName, totalSize,
userId, jobId, baseTempDir, targetDir
);
expect(result2.success).toBe(true);
expect(result2.completed).toBe(false);
// 上傳 chunk 3最後一個
const result3 = await handleChunkUpload(
uploadId, 2, totalChunks, chunk3, fileName, totalSize,
userId, jobId, baseTempDir, targetDir
);
expect(result3.success).toBe(true);
expect(result3.completed).toBe(true);
expect(result3.file_path).toBeDefined();
// 驗證合併後的檔案
const mergedFile = join(targetDir, fileName);
expect(existsSync(mergedFile)).toBe(true);
const mergedContent = readFileSync(mergedFile);
expect(mergedContent.length).toBe(totalSize);
// 驗證內容正確性
const expectedContent = Buffer.concat([chunk1, chunk2, chunk3]);
expect(mergedContent.equals(expectedContent)).toBe(true);
});
test("亂序上傳 chunks 也應正確合併", async () => {
const uploadId = "test-chunked-upload-2";
const fileName = "out-of-order.bin";
const userId = "test-user";
const jobId = "test-job";
const chunkSize = 1024;
const chunk0 = Buffer.alloc(chunkSize, "0");
const chunk1 = Buffer.alloc(chunkSize, "1");
const chunk2 = Buffer.alloc(chunkSize, "2");
const chunk3 = Buffer.alloc(chunkSize, "3");
const totalSize = chunkSize * 4;
const totalChunks = 4;
const baseTempDir = join(testDir, "temp2");
const targetDir = join(testDir, "uploads2");
mkdirSync(baseTempDir, { recursive: true });
mkdirSync(targetDir, { recursive: true });
// 亂序上傳3, 1, 0, 2
await handleChunkUpload(uploadId, 3, totalChunks, chunk3, fileName, totalSize, userId, jobId, baseTempDir, targetDir);
await handleChunkUpload(uploadId, 1, totalChunks, chunk1, fileName, totalSize, userId, jobId, baseTempDir, targetDir);
await handleChunkUpload(uploadId, 0, totalChunks, chunk0, fileName, totalSize, userId, jobId, baseTempDir, targetDir);
const finalResult = await handleChunkUpload(uploadId, 2, totalChunks, chunk2, fileName, totalSize, userId, jobId, baseTempDir, targetDir);
expect(finalResult.success).toBe(true);
expect(finalResult.completed).toBe(true);
// 驗證檔案順序正確
const mergedFile = join(targetDir, fileName);
const mergedContent = readFileSync(mergedFile);
// 即使亂序上傳,合併後應該按正確順序
const expectedContent = Buffer.concat([chunk0, chunk1, chunk2, chunk3]);
expect(mergedContent.equals(expectedContent)).toBe(true);
});
test("重複上傳相同 chunk 應被處理", async () => {
const uploadId = "test-chunked-upload-3";
const fileName = "duplicate-chunk.bin";
const userId = "test-user";
const jobId = "test-job";
const chunkSize = 512;
const chunk0 = Buffer.alloc(chunkSize, "X");
const chunk1 = Buffer.alloc(chunkSize, "Y");
const totalSize = chunkSize * 2;
const totalChunks = 2;
const baseTempDir = join(testDir, "temp3");
const targetDir = join(testDir, "uploads3");
mkdirSync(baseTempDir, { recursive: true });
mkdirSync(targetDir, { recursive: true });
// 上傳 chunk 0
await handleChunkUpload(uploadId, 0, totalChunks, chunk0, fileName, totalSize, userId, jobId, baseTempDir, targetDir);
// 重複上傳 chunk 0
await handleChunkUpload(uploadId, 0, totalChunks, chunk0, fileName, totalSize, userId, jobId, baseTempDir, targetDir);
// 上傳 chunk 1
const result = await handleChunkUpload(uploadId, 1, totalChunks, chunk1, fileName, totalSize, userId, jobId, baseTempDir, targetDir);
expect(result.success).toBe(true);
expect(result.completed).toBe(true);
// 驗證檔案大小正確(不應該因為重複上傳而變大)
const mergedFile = join(targetDir, fileName);
const stats = statSync(mergedFile);
expect(stats.size).toBe(totalSize);
});
});
describe("Chunk 數量計算測試", () => {
test("應正確計算不同大小檔案的 chunk 數量", () => {
const chunkSize = CHUNK_SIZE_BYTES;
// 剛好 1 個 chunk
expect(calculateChunkCount(chunkSize)).toBe(1);
// 多 1 byte 需要 2 個 chunks
expect(calculateChunkCount(chunkSize + 1)).toBe(2);
// 50MB 需要 10 個 chunks
expect(calculateChunkCount(50 * 1024 * 1024)).toBe(10);
// 1 byte 需要 1 個 chunk
expect(calculateChunkCount(1)).toBe(1);
});
});