feat: stricter fuzzy search with gap penalties and score threshold

- penalize scattered matches (2 points per skipped char)
- fail fast if token > target
- enforce min score of 60/150 to reduce noise

Author: lolwierd

CHANGELOG.md

@@ -4,6 +4,13 @@ All notable changes to this project are documented in this file.
 
 ## [Unreleased]
 
+## [0.5.0] - 2026-02-21
+
+### Changed
+
+- **Stricter Fuzzy Search**: The search algorithm now penalizes scattered matches (large gaps between matched characters) and enforces a minimum quality score. This significantly reduces noise in search results, preventing irrelevant entries from appearing just because they contain the query letters widely separated.
+- Optimized search performance by failing fast when query tokens are longer than the target text.
+
 ## [0.4.0] - 2026-02-21
 
 ### Added

Sources/CBManager/ClipboardSearch.swift

@@ -81,6 +81,8 @@ enum ClipboardSearch {
 
     private static func subsequenceScore(_ token: String, in target: String) -> Int? {
         guard !token.isEmpty else { return nil }
+        // Optimization: if token is longer than target, fail immediately
+        if token.count > target.count { return nil }
 
         var tokenIndex = token.startIndex
         var targetIndex = target.startIndex
@@ -104,6 +106,10 @@ enum ClipboardSearch {
             }
         }
 
-        return max(1, 140 - min(gapPenalty, 120))
+        // Stricter penalty: 2 points per skipped character.
+        // Base score: 150.
+        // Threshold: 60.
+        let score = 150 - (gapPenalty * 2)
+        return score > 60 ? score : nil
     }
 }