From 9650d8a2436c7543970729db744442b0d5197a7d Mon Sep 17 00:00:00 2001
From: necobot <bot@mattuy.top>
Date: Sat, 25 Jul 2026 16:40:44 +0800
Subject: [PATCH 1/2] =?UTF-8?q?feat:=20=E6=89=A9=E5=A4=A7=E4=BD=93?=
 =?UTF-8?q?=E9=87=8F=E5=8F=82=E6=95=B0=E8=8C=83=E5=9B=B4?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 src/main.ts        |  9 ++++++++-
 src/mosaic.test.ts | 16 ++++++++++++++++
 2 files changed, 24 insertions(+), 1 deletion(-)

diff --git a/src/main.ts b/src/main.ts
index 77870ab..a73e164 100644
--- a/src/main.ts
+++ b/src/main.ts
@@ -86,7 +86,14 @@ app.innerHTML = `
               <output id="volume-value">100%</output>
             </span>
             <span class="control__hint">结果相对原文的总长度</span>
-            <input id="volume-control" type="range" min="85" max="115" value="100" />
+            <input
+              id="volume-control"
+              type="range"
+              min="10"
+              max="1000"
+              step="10"
+              value="100"
+            />
           </label>
 
           <label class="control" for="disorder-control">
diff --git a/src/mosaic.test.ts b/src/mosaic.test.ts
index dd0bb1a..9f780b7 100644
--- a/src/mosaic.test.ts
+++ b/src/mosaic.test.ts
@@ -74,6 +74,22 @@ describe('generateMosaic', () => {
     expect(ratio).toBeLessThanOrEqual(1.03)
   })
 
+  it('支持将体量压缩到 10% 或膨胀到 1000%', () => {
+    const compressed = generateMosaic(SOURCE, [], {
+      volume: 10,
+      disorder: 0,
+      seed: 42,
+    })
+    const expanded = generateMosaic(SOURCE, [], {
+      volume: 1000,
+      disorder: 0,
+      seed: 42,
+    })
+
+    expect(compressed.outputLength).toBe(Math.round(compressed.inputLength * 0.1))
+    expect(expanded.outputLength).toBe(expanded.inputLength * 10)
+  })
+
   it('相同种子可复现，不同种子会重新侵蚀', () => {
     const candidates = selectKeywords(SOURCE, 14, 1)
     const first = generateMosaic(SOURCE, candidates, {
-- 
2.52.0


From 143823f953392d5c30f0ba28ec10512366f8d11a Mon Sep 17 00:00:00 2001
From: necobot <bot@mattuy.top>
Date: Sat, 25 Jul 2026 16:41:47 +0800
Subject: [PATCH 2/2] =?UTF-8?q?fix:=20=E8=AE=A9=E6=98=BE=E5=BD=B1=E5=8F=82?=
 =?UTF-8?q?=E6=95=B0=E8=A6=86=E7=9B=96=E5=AE=8C=E6=95=B4=E8=8C=83=E5=9B=B4?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 src/main.ts        |  4 ++--
 src/mosaic.test.ts |  8 ++++++++
 src/mosaic.ts      | 14 +++++++-------
 3 files changed, 17 insertions(+), 9 deletions(-)

diff --git a/src/main.ts b/src/main.ts
index a73e164..22e1b47 100644
--- a/src/main.ts
+++ b/src/main.ts
@@ -74,10 +74,10 @@ app.innerHTML = `
           <label class="control" for="retention-control">
             <span class="control__heading">
               <span>显影</span>
-              <output id="retention-value">14%</output>
+              <output id="retention-value">15%</output>
             </span>
             <span class="control__hint">留下多少原文词语</span>
-            <input id="retention-control" type="range" min="5" max="40" value="14" />
+            <input id="retention-control" type="range" min="0" max="100" value="15" />
           </label>
 
           <label class="control" for="volume-control">
diff --git a/src/mosaic.test.ts b/src/mosaic.test.ts
index 9f780b7..82627a6 100644
--- a/src/mosaic.test.ts
+++ b/src/mosaic.test.ts
@@ -36,6 +36,14 @@ describe('selectKeywords', () => {
 
     expect(candidates.some((candidate) => candidate.selected)).toBe(true)
   })
+
+  it('显影 0% 不保留词语，100% 保留全部候选词', () => {
+    const hidden = selectKeywords(SOURCE, 0, 1)
+    const revealed = selectKeywords(SOURCE, 100, 1)
+
+    expect(hidden.some((candidate) => candidate.selected)).toBe(false)
+    expect(revealed.every((candidate) => candidate.selected)).toBe(true)
+  })
 })
 
 describe('generateMosaic', () => {
diff --git a/src/mosaic.ts b/src/mosaic.ts
index 113490e..dcce973 100644
--- a/src/mosaic.ts
+++ b/src/mosaic.ts
@@ -345,13 +345,13 @@ export function selectKeywords(
     return candidates
   }
 
-  const desiredCount = Math.min(
-    candidates.length,
-    Math.max(
-      candidates.length >= 4 ? 2 : 1,
-      Math.round(candidates.length * (retention / 100)),
-    ),
-  )
+  const desiredCount =
+    retention <= 0
+      ? 0
+      : Math.min(
+          candidates.length,
+          Math.max(1, Math.ceil(candidates.length * (retention / 100))),
+        )
   const ranked = [...candidates].sort(
     (left, right) => right.score - left.score || left.start - right.start,
   )
-- 
2.52.0