@preventive/compare 1.0.0 → 1.0.1

package/compare.d.ts

@@ -1,5 +1,3 @@
-// Hand-written against compare.js; a change to either belongs with the other.
-
 import type { Block } from '@preventive/diff'
 
 // An entry of a tree, in the shape tar has it: what @preventive/archive's

package/names.d.ts

@@ -1,5 +1,3 @@
-// Hand-written against names.js; a change to either belongs with the other.
-
 import type { Block } from '@preventive/diff'
 
 // How each text is parsed, by the extension of the file it is: `mjs` a

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@preventive/compare",
-  "version": "1.0.0",
+  "version": "1.0.1",
   "description": "Two file trees compared as git diff compares them, with their line change sets and the patch git writes; and minified JavaScript compared with its layout and its renamed names set aside, each step checked to hide no change",
   "type": "module",
   "main": "./compare.js",

package/pretty.d.ts

@@ -1,5 +1,3 @@
-// Hand-written against pretty.js; a change to either belongs with the other.
-
 // `text` formatted by oxfmt as a file with `extension`, changing what is written
 // no more than layout needs (keys keep their quotes, no trailing commas or arrow
 // parentheses are added, template literals stay), the copy used only where checks

package/src/renames.js

@@ -70,11 +70,12 @@ function familyKeys(path) {
 }
 
 // Whether either file of a pair by path has a candidate that is a rename by
-// itself and scores at least halfway from the pair's score to 100%.
+// itself and scores at least halfway from the pair's score to 100%: sizes too
+// far apart for that go unread.
 function outdone({ pairs, used, scoreOf }, { remaining, open }, { s, d, score }, minimum) {
   const better = Math.max(minimum, score + Math.trunc((MAX_SCORE - score) / 2))
-  return open.some((o) => o !== d && !pairs.has(o) && scoreOf(s, o, minimum) >= better)
-    || remaining.some((r) => r !== s && !used.has(r) && scoreOf(r, d, minimum) >= better)
+  return open.some((o) => o !== d && !pairs.has(o) && scoreOf(s, o, better) >= better)
+    || remaining.some((r) => r !== s && !used.has(r) && scoreOf(r, d, better) >= better)
 }
 
 // Paths a build changes: however a pair scores, the best of a file's partners.
@@ -115,11 +116,11 @@ function familyRenames(context, left, weigh, minimum) {
   }
 }
 
-// Renames told by path, which git does not look for. Past the rename limit no
-// other candidate is scored, so none can be better.
+// Renames told by path, which git does not look for. Under -M100%, or past the
+// rename limit, no other candidate is scored, so none can be better.
 function pathRenames(context, minimum, limit) {
   const left = unpaired(context)
-  const weigh = left.remaining.length * left.open.length <= limit * limit
+  const weigh = minimum < MAX_SCORE && left.remaining.length * left.open.length <= limit * limit
   buildRenames(context, left, weigh, minimum)
   familyRenames(context, left, weigh, minimum)
 }