eyeling 1.6.0 → 1.6.1

package/eyeling.js

@@ -2438,6 +2438,11 @@ function listAppendSplit(parts, resElems, subst) {
   return out;
 }
 
+function numEqualTerm(t, n, eps = 1e-9) {
+  const v = parseNum(t);
+  return v !== null && Math.abs(v - n) < eps;
+}
+
 // ============================================================================
 // Backward proof & builtins mutual recursion — declarations first
 // ============================================================================
@@ -2809,7 +2814,7 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen) {
           s2[g.o.name] = new Literal(formatNum(cVal));
           return [s2];
         }
-        if (g.o instanceof Literal && g.o.value === formatNum(cVal)) {
+        if (numEqualTerm(g.o, cVal)) {
           return [{ ...subst }];
         }
       }
@@ -2874,7 +2879,7 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen) {
         s2[g.o.name] = new Literal(formatNum(cVal));
         return [s2];
       }
-      if (g.o instanceof Literal && g.o.value === formatNum(cVal)) {
+      if (numEqualTerm(g.o, cVal)) {
         return [{ ...subst }];
       }
     }
@@ -2891,7 +2896,7 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen) {
         s2[g.o.name] = new Literal(formatNum(cVal));
         return [s2];
       }
-      if (g.o instanceof Literal && g.o.value === formatNum(cVal)) {
+      if (numEqualTerm(g.o, cVal)) {
         return [{ ...subst }];
       }
     }
@@ -2909,7 +2914,7 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen) {
           s2[g.o.name] = new Literal(formatNum(cVal));
           return [s2];
         }
-        if (g.o instanceof Literal && g.o.value === formatNum(cVal)) {
+        if (numEqualTerm(g.o, cVal)) {
           return [{ ...subst }];
         }
       }
@@ -2928,7 +2933,7 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen) {
           s2[g.o.name] = new Literal(formatNum(cVal));
           return [s2];
         }
-        if (g.o instanceof Literal && g.o.value === formatNum(cVal)) {
+        if (numEqualTerm(g.o, cVal)) {
           return [{ ...subst }];
         }
       }
@@ -2947,7 +2952,7 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen) {
           s2[g.o.name] = new Literal(formatNum(cVal));
           return [s2];
         }
-        if (g.o instanceof Literal && g.o.value === formatNum(cVal)) {
+        if (numEqualTerm(g.o, cVal)) {
           return [{ ...subst }];
         }
       }
@@ -2967,7 +2972,7 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen) {
           s2[g.o.name] = new Literal(formatNum(cVal));
           return [s2];
         }
-        if (g.o instanceof Literal && g.o.value === formatNum(cVal)) {
+        if (numEqualTerm(g.o, cVal)) {
           return [{ ...subst }];
         }
       }
@@ -2987,7 +2992,7 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen) {
           s2[g.o.name] = new Literal(formatNum(cVal));
           return [s2];
         }
-        if (g.o instanceof Literal && g.o.value === formatNum(cVal)) {
+        if (numEqualTerm(g.o, cVal)) {
           return [{ ...subst }];
         }
       }
@@ -3046,7 +3051,7 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen) {
           s2[g.o.name] = new Literal(formatNum(cVal));
           return [s2];
         }
-        if (g.o instanceof Literal && g.o.value === formatNum(cVal)) {
+        if (numEqualTerm(g.o, cVal)) {
           return [{ ...subst }];
         }
       }
@@ -3065,7 +3070,7 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen) {
           s2[g.o.name] = new Literal(formatNum(cVal));
           return [s2];
         }
-        if (g.o instanceof Literal && g.o.value === formatNum(cVal)) {
+        if (numEqualTerm(g.o, cVal)) {
           return [{ ...subst }];
         }
       }
@@ -3084,7 +3089,7 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen) {
           s2[g.o.name] = new Literal(formatNum(cVal));
           return [s2];
         }
-        if (g.o instanceof Literal && g.o.value === formatNum(cVal)) {
+        if (numEqualTerm(g.o, cVal)) {
           return [{ ...subst }];
         }
       }

package/index.js

@@ -19,9 +19,7 @@ function reason(opt = {}, n3_input = '') {
   // default: proof comments OFF for API output (machine-friendly)
   // set { proofComments: true } to keep them
   const proofComments =
-    (typeof opt.proofComments === 'boolean') ? opt.proofComments :
-    (typeof opt.noProofComments === 'boolean') ? !opt.noProofComments :
-    false;
+    typeof opt.proofComments === 'boolean' ? opt.proofComments : typeof opt.noProofComments === 'boolean' ? !opt.noProofComments : false;
 
   if (!proofComments) args.push('--no-proof-comments'); // CLI already supports this :contentReference[oaicite:1]{index=1}
 
@@ -58,4 +56,3 @@ function reason(opt = {}, n3_input = '') {
 module.exports = { reason };
 // small interop nicety for ESM default import
 module.exports.default = module.exports;
-

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "eyeling",
-  "version": "1.6.0",
+  "version": "1.6.1",
   "description": "A minimal Notation3 (N3) reasoner in JavaScript.",
   "main": "./index.js",
   "keywords": [

package/test/api.test.js

@@ -4,9 +4,7 @@ const assert = require('node:assert/strict');
 const { reason } = require('..');
 
 const TTY = process.stdout.isTTY;
-const C = TTY
-  ? { g: '\x1b[32m', r: '\x1b[31m', y: '\x1b[33m', dim: '\x1b[2m', n: '\x1b[0m' }
-  : { g: '', r: '', y: '', dim: '', n: '' };
+const C = TTY ? { g: '\x1b[32m', r: '\x1b[31m', y: '\x1b[33m', dim: '\x1b[2m', n: '\x1b[0m' } : { g: '', r: '', y: '', dim: '', n: '' };
 
 function ok(msg) {
   console.log(`${C.g}OK${C.n} ${msg}`);
@@ -352,10 +350,7 @@ ${U('a')} ${U('p')} ${U('b')}.
     name: '17 heavier reachability: branching graph reach closure',
     opt: { proofComments: false, maxBuffer: 200 * 1024 * 1024 },
     input: reachabilityGraphN3(12),
-    expect: [
-      new RegExp(`${EX}g0>\\s+<${EX}reach>\\s+<${EX}g12>\\s*\\.`),
-      new RegExp(`${EX}g2>\\s+<${EX}reach>\\s+<${EX}g10>\\s*\\.`),
-    ],
+    expect: [new RegExp(`${EX}g0>\\s+<${EX}reach>\\s+<${EX}g12>\\s*\\.`), new RegExp(`${EX}g2>\\s+<${EX}reach>\\s+<${EX}g10>\\s*\\.`)],
   },
   {
     name: '18 heavier taxonomy: diamond subclass inference',
@@ -383,10 +378,7 @@ ${U('a')} ${U('p')} ${U('b')}.
     name: '21 heavier equivalence: sameAs propagation (with symmetric sameAs)',
     opt: { proofComments: false },
     input: sameAsN3(),
-    expect: [
-      new RegExp(`${EX}b>\\s+<${EX}p>\\s+<${EX}o>\\s*\\.`),
-      new RegExp(`${EX}b>\\s+<${EX}sameAs>\\s+<${EX}a>\\s*\\.`),
-    ],
+    expect: [new RegExp(`${EX}b>\\s+<${EX}p>\\s+<${EX}o>\\s*\\.`), new RegExp(`${EX}b>\\s+<${EX}sameAs>\\s+<${EX}a>\\s*\\.`)],
   },
   {
     name: '22 heavier closure: transitive property via generic rule',
@@ -398,10 +390,7 @@ ${U('c')} ${U('sub')} ${U('d')}.
 ${U('d')} ${U('sub')} ${U('e')}.
 ${transitiveClosureN3('sub')}
 `,
-    expect: [
-      new RegExp(`${EX}a>\\s+<${EX}sub>\\s+<${EX}e>\\s*\\.`),
-      new RegExp(`${EX}b>\\s+<${EX}sub>\\s+<${EX}d>\\s*\\.`),
-    ],
+    expect: [new RegExp(`${EX}a>\\s+<${EX}sub>\\s+<${EX}e>\\s*\\.`), new RegExp(`${EX}b>\\s+<${EX}sub>\\s+<${EX}d>\\s*\\.`)],
   },
   {
     name: '23 heavier social: symmetric + reachFriend closure',
@@ -416,10 +405,7 @@ ${transitiveClosureN3('sub')}
     name: '24 heavier volume: 400 facts, simple rewrite rule p -> q',
     opt: { proofComments: false, maxBuffer: 200 * 1024 * 1024 },
     input: bigFactsN3(400),
-    expect: [
-      new RegExp(`${EX}x>\\s+<${EX}q>\\s+<${EX}o0>\\s*\\.`),
-      new RegExp(`${EX}x>\\s+<${EX}q>\\s+<${EX}o399>\\s*\\.`),
-    ],
+    expect: [new RegExp(`${EX}x>\\s+<${EX}q>\\s+<${EX}o0>\\s*\\.`), new RegExp(`${EX}x>\\s+<${EX}q>\\s+<${EX}o399>\\s*\\.`)],
   },
   {
     name: '25 heavier negative entailment: batch + forbidden => false (expect exit 2)',
@@ -505,10 +491,7 @@ ${U('c')} ${U('p')} ${U('d')}.
 
 { ?s ${U('p')} ?o. } => { ?s ${U('q')} ?o. }.
 `,
-    expect: [
-      new RegExp(`${EX}a>\\s+<${EX}q>\\s+<${EX}b>\\s*\\.`),
-      new RegExp(`${EX}c>\\s+<${EX}q>\\s+<${EX}d>\\s*\\.`),
-    ],
+    expect: [new RegExp(`${EX}a>\\s+<${EX}q>\\s+<${EX}b>\\s*\\.`), new RegExp(`${EX}c>\\s+<${EX}q>\\s+<${EX}d>\\s*\\.`)],
   },
 
   {
@@ -554,10 +537,7 @@ ${U('s')} ${U('p')} ${U('o')}.
 
 { ${U('s')} ${U('p')} ${U('o')}. } => { ${U('s')} ${U('q')} ${U('o')}. ${U('s')} ${U('r')} ${U('o')}. }.
 `,
-    expect: [
-      new RegExp(`${EX}s>\\s+<${EX}q>\\s+<${EX}o>\\s*\\.`),
-      new RegExp(`${EX}s>\\s+<${EX}r>\\s+<${EX}o>\\s*\\.`),
-    ],
+    expect: [new RegExp(`${EX}s>\\s+<${EX}q>\\s+<${EX}o>\\s*\\.`), new RegExp(`${EX}s>\\s+<${EX}r>\\s+<${EX}o>\\s*\\.`)],
   },
 
   {
@@ -637,56 +617,61 @@ world"""@en.`,
     expect: [new RegExp(`${EX}s>\\s+<${EX}q>\\s+(?:"""Hello[\\s\\S]*?world"""@en|"Hello\\\\nworld"@en)\\s*\\.`)],
   },
 
-  { name: '44 syntax: "<-" in predicate position swaps subject and object',
+  {
+    name: '44 syntax: "<-" in predicate position swaps subject and object',
     opt: { proofComments: false },
     input: ` { ?s ${U('p')} ?o } => { ?s ${U('q')} ?o }.
 ${U('a')} <-${U('p')} ${U('b')}.`,
     expect: [new RegExp(`${EX}b>\\s+<${EX}q>\\s+<${EX}a>\\s*\\.`)],
   },
 
-  { name: '45 syntax: "<-" works inside blank node property lists ([ ... ])',
+  {
+    name: '45 syntax: "<-" works inside blank node property lists ([ ... ])',
     opt: { proofComments: false },
     input: ` ${U('s')} ${U('p')} [ <-${U('r')} ${U('o')} ].
 { ${U('o')} ${U('r')} ?x } => { ?x ${U('q')} ${U('k')} }.`,
     expect: [new RegExp(`_:b1\\s+<${EX}q>\\s+<${EX}k>\\s*\\.`)],
   },
 
-  { name: '46 syntax: N3 resource paths (! / ^) expand to blank-node triples (forward chain)',
+  {
+    name: '46 syntax: N3 resource paths (! / ^) expand to blank-node triples (forward chain)',
     opt: { proofComments: false },
     input: ` ${U('joe')}!${U('hasAddress')}!${U('hasCity')} ${U('name')} "Metropolis".
 { ${U('joe')} ${U('hasAddress')} ?a } => { ?a ${U('q')} "addr" }.
 { ?a ${U('hasCity')} ?c } => { ?c ${U('q')} "city" }.
 `,
-    expect: [
-      new RegExp(`_:b1\\s+<${EX}q>\\s+"addr"\\s*\\.`),
-      new RegExp(`_:b2\\s+<${EX}q>\\s+"city"\\s*\\.`),
-    ],
+    expect: [new RegExp(`_:b1\\s+<${EX}q>\\s+"addr"\\s*\\.`), new RegExp(`_:b2\\s+<${EX}q>\\s+"city"\\s*\\.`)],
   },
 
-  { name: '47 syntax: N3 resource paths support reverse steps (^) in the chain',
+  {
+    name: '47 syntax: N3 resource paths support reverse steps (^) in the chain',
     opt: { proofComments: false },
     input: ` ${U('joe')}!${U('hasMother')}^${U('hasMother')} ${U('knows')} ${U('someone')}.
 { ?sib ${U('hasMother')} ?mom. ${U('joe')} ${U('hasMother')} ?mom } => { ?sib ${U('q')} ${U('joe')} }.
 `,
-    expect: [
-      new RegExp(`_:b2\\s+<${EX}q>\\s+<${EX}joe>\\s*\\.`),
-    ],
+    expect: [new RegExp(`_:b2\\s+<${EX}q>\\s+<${EX}joe>\\s*\\.`)],
   },
 
-  { name: '48 rdf:first: works on list terms (alias of list:first)',
-    opt: { proofComments: false }, input: ` { ( ${U('a')} ${U('b')} ${U('c')} ) rdf:first ?x. } => { ${U('s')} ${U('first')} ?x. }.
+  {
+    name: '48 rdf:first: works on list terms (alias of list:first)',
+    opt: { proofComments: false },
+    input: ` { ( ${U('a')} ${U('b')} ${U('c')} ) rdf:first ?x. } => { ${U('s')} ${U('first')} ?x. }.
 `,
     expect: [new RegExp(`${EX}s>\\s+<${EX}first>\\s+<${EX}a>\\s*\\.`)],
   },
 
-  { name: '49 rdf:rest: works on list terms (alias of list:rest)',
-    opt: { proofComments: false }, input: ` { ( ${U('a')} ${U('b')} ${U('c')} ) rdf:rest ?r. ?r rdf:first ?y. } => { ${U('s')} ${U('second')} ?y. }.
+  {
+    name: '49 rdf:rest: works on list terms (alias of list:rest)',
+    opt: { proofComments: false },
+    input: ` { ( ${U('a')} ${U('b')} ${U('c')} ) rdf:rest ?r. ?r rdf:first ?y. } => { ${U('s')} ${U('second')} ?y. }.
 `,
     expect: [new RegExp(`${EX}s>\\s+<${EX}second>\\s+<${EX}b>\\s*\\.`)],
   },
 
-  { name: '50 rdf collection materialization: rdf:first/rdf:rest triples become list terms',
-    opt: { proofComments: false }, input: ` ${U('s')} ${U('p')} _:l1.
+  {
+    name: '50 rdf collection materialization: rdf:first/rdf:rest triples become list terms',
+    opt: { proofComments: false },
+    input: ` ${U('s')} ${U('p')} _:l1.
 _:l1 rdf:first ${U('a')}.
 _:l1 rdf:rest _:l2.
 _:l2 rdf:first ${U('b')}.
@@ -741,7 +726,7 @@ let failed = 0;
         fail(
           `Expected exit code ${tc.expectErrorCode}, got: ${e && e.code != null ? e.code : 'unknown'}\n${
             e && e.stderr ? e.stderr : e && e.stack ? e.stack : String(e)
-          }`
+          }`,
         );
         failed++;
         continue;
@@ -761,7 +746,8 @@ let failed = 0;
 
   console.log('');
   const suiteMs = Date.now() - suiteStart;
-  console.log(`${C.y}==${C.n} Total elapsed: ${suiteMs} ms`);
+  console.log(`${C.y}==${C.n} Total elapsed: ${suiteMs} ms (${(suiteMs / 1000).toFixed(2)} s)`);
+
   if (failed === 0) {
     ok(`All API tests passed (${passed}/${cases.length})`);
     process.exit(0);
@@ -770,4 +756,3 @@ let failed = 0;
     process.exit(1);
   }
 })();
-

package/test/examples.test.js

@@ -7,13 +7,18 @@ const path = require('node:path');
 const cp = require('node:child_process');
 
 const TTY = process.stdout.isTTY;
-const C = TTY
-  ? { g: '\x1b[32m', r: '\x1b[31m', y: '\x1b[33m', dim: '\x1b[2m', n: '\x1b[0m' }
-  : { g: '', r: '', y: '', dim: '', n: '' };
+const C = TTY ? { g: '\x1b[32m', r: '\x1b[31m', y: '\x1b[33m', dim: '\x1b[2m', n: '\x1b[0m' } : { g: '', r: '', y: '', dim: '', n: '' };
+const msTag = (ms) => `${C.dim}(${ms} ms)${C.n}`;
 
-function ok(msg)   { console.log(`${C.g}OK${C.n}  ${msg}`); }
-function fail(msg) { console.error(`${C.r}FAIL${C.n} ${msg}`); }
-function info(msg) { console.log(`${C.y}==${C.n} ${msg}`); }
+function ok(msg) {
+  console.log(`${C.g}OK${C.n}  ${msg}`);
+}
+function fail(msg) {
+  console.error(`${C.r}FAIL${C.n} ${msg}`);
+}
+function info(msg) {
+  console.log(`${C.y}==${C.n} ${msg}`);
+}
 
 function run(cmd, args, opts = {}) {
   return cp.spawnSync(cmd, args, {
@@ -57,7 +62,9 @@ function mkTmpDir() {
 }
 
 function rmrf(p) {
-  try { fs.rmSync(p, { recursive: true, force: true }); } catch {}
+  try {
+    fs.rmSync(p, { recursive: true, force: true });
+  } catch {}
 }
 
 function showDiff({ IN_GIT, examplesDir, expectedPath, generatedPath, relExpectedPosix }) {
@@ -103,13 +110,12 @@ function main() {
 
   const IN_GIT = inGitWorktree(root);
 
-  const files = fs.readdirSync(examplesDir)
-    .filter(f => f.endsWith('.n3'))
+  const files = fs
+    .readdirSync(examplesDir)
+    .filter((f) => f.endsWith('.n3'))
     .sort((a, b) => a.localeCompare(b));
 
-  info(
-    `Running ${files.length} examples tests (${IN_GIT ? 'git worktree mode' : 'npm-installed mode'})`
-  );
+  info(`Running ${files.length} examples tests (${IN_GIT ? 'git worktree mode' : 'npm-installed mode'})`);
   console.log(`${C.dim}${getEyelingVersion(nodePath, eyelingJsPath, root)}; node ${process.version}${C.n}`);
 
   if (files.length === 0) {
@@ -138,7 +144,7 @@ function main() {
       n3Text = fs.readFileSync(filePath, 'utf8');
     } catch (e) {
       const ms = Date.now() - start;
-      fail(`${idx} ${file} (${ms} ms)`);
+      fail(`${idx} ${file} ${msTag(ms)}`);
       fail(`Cannot read input: ${e.message}`);
       failed++;
       continue;
@@ -154,7 +160,7 @@ function main() {
       // npm-installed / no .git: never modify output/ in node_modules
       if (!fs.existsSync(expectedPath)) {
         const ms = Date.now() - start;
-        fail(`${idx} ${file} (${ms} ms)`);
+        fail(`${idx} ${file} ${msTag(ms)}`);
         fail(`Missing expected output/${file}`);
         failed++;
         continue;
@@ -170,12 +176,12 @@ function main() {
       cwd: examplesDir,
       stdio: ['ignore', outFd, 'pipe'], // stdout -> file, stderr captured
       maxBuffer: 200 * 1024 * 1024,
-      encoding: 'utf8'
+      encoding: 'utf8',
     });
 
     fs.closeSync(outFd);
 
-    const rc = (r.status == null) ? 1 : r.status;
+    const rc = r.status == null ? 1 : r.status;
 
     const ms = Date.now() - start;
 
@@ -183,28 +189,28 @@ function main() {
     let diffOk = false;
     if (IN_GIT) {
       const d = run('git', ['diff', '--quiet', '--', relExpectedPosix], { cwd: examplesDir });
-      diffOk = (d.status === 0);
+      diffOk = d.status === 0;
     } else {
       if (hasGit()) {
         const d = run('git', ['diff', '--no-index', '--quiet', expectedPath, generatedPath], { cwd: examplesDir });
-        diffOk = (d.status === 0);
+        diffOk = d.status === 0;
       } else {
         const d = run('diff', ['-u', expectedPath, generatedPath], { cwd: examplesDir });
-        diffOk = (d.status === 0);
+        diffOk = d.status === 0;
       }
     }
 
-    const rcOk = (rc === expectedRc);
+    const rcOk = rc === expectedRc;
 
     if (diffOk && rcOk) {
       if (expectedRc === 0) {
-        ok(`${idx} ${file} (${ms} ms)`);
+        ok(`${idx} ${file} ${msTag(ms)}`);
       } else {
-        ok(`${idx} ${file} (expected exit ${expectedRc}, ${ms} ms)`);
+        ok(`${idx} ${file} (expected exit ${expectedRc}) ${msTag(ms)}`);
       }
       passed++;
     } else {
-      fail(`${idx} ${file} (${ms} ms)`);
+      fail(`${idx} ${file} ${msTag(ms)}`);
       if (!rcOk) {
         fail(`Exit code ${rc}, expected ${expectedRc}`);
       }
@@ -242,4 +248,3 @@ function main() {
 }
 
 main();
-

package/test/package.test.js

@@ -7,19 +7,29 @@ const path = require('node:path');
 const cp = require('node:child_process');
 
 const TTY = process.stdout.isTTY;
-const C = TTY
-  ? { g: '\x1b[32m', r: '\x1b[31m', y: '\x1b[33m', dim: '\x1b[2m', n: '\x1b[0m' }
-  : { g: '', r: '', y: '', dim: '', n: '' };
+const C = TTY ? { g: '\x1b[32m', r: '\x1b[31m', y: '\x1b[33m', dim: '\x1b[2m', n: '\x1b[0m' } : { g: '', r: '', y: '', dim: '', n: '' };
 
-function info(msg) { console.log(`${C.y}==${C.n} ${msg}`); }
-function ok(msg)   { console.log(`${C.g}OK${C.n}  ${msg}`); }
-function fail(msg) { console.error(`${C.r}FAIL${C.n} ${msg}`); }
+function info(msg) {
+  console.log(`${C.y}==${C.n} ${msg}`);
+}
+function ok(msg) {
+  console.log(`${C.g}OK${C.n}  ${msg}`);
+}
+function fail(msg) {
+  console.error(`${C.r}FAIL${C.n} ${msg}`);
+}
 
-function isWin() { return process.platform === 'win32'; }
-function npmCmd() { return isWin() ? 'npm.cmd' : 'npm'; }
+function isWin() {
+  return process.platform === 'win32';
+}
+function npmCmd() {
+  return isWin() ? 'npm.cmd' : 'npm';
+}
 
 function rmrf(p) {
-  try { fs.rmSync(p, { recursive: true, force: true }); } catch {}
+  try {
+    fs.rmSync(p, { recursive: true, force: true });
+  } catch {}
 }
 
 function run(cmd, args, opts = {}) {
@@ -49,7 +59,10 @@ function runChecked(cmd, args, opts = {}) {
 function packTarball(root) {
   // `npm pack --silent` prints the filename (usually one line)
   const res = runChecked(npmCmd(), ['pack', '--silent'], { cwd: root });
-  const out = String(res.stdout || '').trim().split(/\r?\n/).filter(Boolean);
+  const out = String(res.stdout || '')
+    .trim()
+    .split(/\r?\n/)
+    .filter(Boolean);
   if (out.length === 0) throw new Error('npm pack produced no output');
   return out[out.length - 1].trim(); // tarball filename in root
 }
@@ -97,9 +110,7 @@ function main() {
     ok('API works');
 
     info('CLI smoke test');
-    const bin = isWin()
-      ? path.join(tmp, 'node_modules', '.bin', 'eyeling.cmd')
-      : path.join(tmp, 'node_modules', '.bin', 'eyeling');
+    const bin = isWin() ? path.join(tmp, 'node_modules', '.bin', 'eyeling.cmd') : path.join(tmp, 'node_modules', '.bin', 'eyeling');
     runChecked(bin, ['-v'], { cwd: tmp, stdio: 'inherit' });
     ok('CLI works');
 
@@ -121,7 +132,9 @@ function main() {
     if (tgzInRoot) {
       const maybe = path.join(root, tgzInRoot);
       if (fs.existsSync(maybe)) {
-        try { fs.unlinkSync(maybe); } catch {}
+        try {
+          fs.unlinkSync(maybe);
+        } catch {}
       }
     }
     cleanup();
@@ -129,4 +142,3 @@ function main() {
 }
 
 main();
-

package/test/packlist.test.js

@@ -5,13 +5,17 @@ const cp = require('node:child_process');
 const fs = require('node:fs');
 
 const TTY = process.stdout.isTTY;
-const C = TTY
-  ? { g: '\x1b[32m', r: '\x1b[31m', y: '\x1b[33m', n: '\x1b[0m' }
-  : { g: '', r: '', y: '', n: '' };
+const C = TTY ? { g: '\x1b[32m', r: '\x1b[31m', y: '\x1b[33m', n: '\x1b[0m' } : { g: '', r: '', y: '', n: '' };
 
-function ok(msg) { console.log(`${C.g}OK${C.n} ${msg}`); }
-function info(msg) { console.log(`${C.y}${msg}${C.n}`); }
-function fail(msg) { console.error(`${C.r}FAIL${C.n} ${msg}`); }
+function ok(msg) {
+  console.log(`${C.g}OK${C.n} ${msg}`);
+}
+function info(msg) {
+  console.log(`${C.y}${msg}${C.n}`);
+}
+function fail(msg) {
+  console.error(`${C.r}FAIL${C.n} ${msg}`);
+}
 
 try {
   info('Checking packlist + metadata…');
@@ -37,21 +41,15 @@ try {
   }
 
   const pack = JSON.parse(packJson)[0];
-  const paths = new Set(pack.files.map(f => f.path));
+  const paths = new Set(pack.files.map((f) => f.path));
 
-  const mustHave = [
-    'package.json',
-    'README.md',
-    'LICENSE.md',
-    'eyeling.js',
-    'index.js',
-  ];
+  const mustHave = ['package.json', 'README.md', 'LICENSE.md', 'eyeling.js', 'index.js'];
 
   for (const p of mustHave) assert.ok(paths.has(p), `missing from npm pack: ${p}`);
 
   assert.ok(
-    [...paths].some(p => p.startsWith('examples/output/')),
-    'missing from npm pack: examples/output/*'
+    [...paths].some((p) => p.startsWith('examples/output/')),
+    'missing from npm pack: examples/output/*',
   );
 
   ok('packlist + metadata sanity checks passed');
@@ -59,4 +57,3 @@ try {
   fail(e && e.stack ? e.stack : String(e));
   process.exit(1);
 }
-