@xylabs/aries 0.1.1

package/dist/actions/hash/algorithms/chromaprint.mjs

@@ -0,0 +1,205 @@
+// src/actions/hash/lib/hamming.ts
+function popcount32(value) {
+  let v = Math.trunc(value);
+  v = v - (v >>> 1 & 1431655765);
+  v = (v & 858993459) + (v >>> 2 & 858993459);
+  v = v + (v >>> 4) & 252645135;
+  return v * 16843009 >>> 24 & 255;
+}
+
+// src/actions/hash/lib/runBinary.ts
+import { spawn } from "child_process";
+async function runBinary(options) {
+  const maxBytes = options.maxBytes ?? 64 * 1024 * 1024;
+  return await new Promise((resolve, reject) => {
+    const child = spawn(options.binary, [...options.args ?? []], { stdio: ["pipe", "pipe", "pipe"] });
+    const stdoutChunks = [];
+    let stdoutBytes = 0;
+    let stderr = "";
+    let killedForOverflow = false;
+    child.stdout.on("data", (chunk) => {
+      stdoutBytes += chunk.length;
+      if (stdoutBytes > maxBytes) {
+        if (!killedForOverflow) {
+          killedForOverflow = true;
+          child.kill("SIGKILL");
+        }
+        return;
+      }
+      stdoutChunks.push(chunk);
+    });
+    child.stderr.on("data", (chunk) => {
+      stderr += chunk.toString("utf8");
+    });
+    child.on("error", (err) => reject(err));
+    child.on("close", (code) => {
+      if (killedForOverflow) {
+        reject(new Error(`${options.binary} stdout exceeded ${maxBytes} bytes`));
+        return;
+      }
+      const exitCode = code ?? -1;
+      const stdout = Buffer.concat(stdoutChunks);
+      if (exitCode !== 0) {
+        const tail = stderr.trim().split(/\r?\n/).slice(-3).join("\n");
+        reject(new Error(`${options.binary} exited ${exitCode}${tail.length > 0 ? `: ${tail}` : ""}`));
+        return;
+      }
+      resolve({
+        stdout,
+        stderr,
+        exitCode
+      });
+    });
+    if (options.stdin === void 0) {
+      child.stdin.end();
+    } else {
+      child.stdin.end(options.stdin);
+    }
+  });
+}
+
+// src/actions/hash/lib/which.ts
+import { spawn as spawn2 } from "child_process";
+async function which(binary) {
+  return await new Promise((resolve) => {
+    const cmd = process.platform === "win32" ? "where" : "command";
+    const args = process.platform === "win32" ? [binary] : ["-v", binary];
+    const child = spawn2(cmd, args, { shell: process.platform !== "win32" });
+    let stdout = "";
+    child.stdout.on("data", (chunk) => {
+      stdout += chunk.toString("utf8");
+    });
+    child.on("error", () => resolve(null));
+    child.on("close", (code) => {
+      if (code === 0) {
+        const path = stdout.split(/\r?\n/).find((line) => line.trim().length > 0)?.trim() ?? null;
+        resolve(path);
+      } else {
+        resolve(null);
+      }
+    });
+  });
+}
+async function requireBinary(req) {
+  const path = await which(req.binary);
+  if (path !== null) return path;
+  const lines = [`${req.binary} binary not found on PATH. Install with:`];
+  if (req.install.brew !== void 0) lines.push(`  macOS:   brew install ${req.install.brew}`);
+  if (req.install.apt !== void 0) lines.push(`  Debian:  apt install ${req.install.apt}`);
+  if (req.install.choco !== void 0) lines.push(`  Windows: choco install ${req.install.choco}`);
+  throw new Error(lines.join("\n"));
+}
+
+// src/actions/hash/lib/withTempfile.ts
+import { randomBytes } from "crypto";
+import { rm, writeFile } from "fs/promises";
+import OS from "os";
+import PATH from "path";
+async function withTempfile(bytes, extension, fn) {
+  const ext = extension !== void 0 && extension.length > 0 ? `.${extension}` : "";
+  const path = PATH.join(OS.tmpdir(), `aries-hash-${randomBytes(8).toString("hex")}${ext}`);
+  await writeFile(path, bytes);
+  try {
+    return await fn(path);
+  } finally {
+    await rm(path, { force: true });
+  }
+}
+
+// src/actions/hash/algorithms/chromaprint.ts
+var FPCALC_BIN = {
+  binary: "fpcalc",
+  install: {
+    brew: "chromaprint",
+    apt: "libchromaprint-tools",
+    choco: "chromaprint"
+  }
+};
+async function runFpcalc(path) {
+  await requireBinary(FPCALC_BIN);
+  const { stdout } = await runBinary({ binary: "fpcalc", args: ["-raw", "-json", path] });
+  const parsed = JSON.parse(stdout.toString("utf8"));
+  if (typeof parsed.duration !== "number" || !Array.isArray(parsed.fingerprint)) {
+    throw new TypeError("fpcalc returned unexpected JSON shape.");
+  }
+  return {
+    algorithm: "chromaprint",
+    duration: parsed.duration,
+    fingerprint: parsed.fingerprint
+  };
+}
+function parseChromaprintHash(raw) {
+  let parsed;
+  try {
+    parsed = JSON.parse(raw);
+  } catch {
+    throw new Error("chromaprint hash must be a JSON document produced by `aries hash --algorithm chromaprint`.");
+  }
+  const obj = parsed;
+  if (obj.algorithm !== "chromaprint" || typeof obj.duration !== "number" || !Array.isArray(obj.fingerprint)) {
+    throw new Error("chromaprint hash JSON missing required fields (algorithm, duration, fingerprint).");
+  }
+  return obj;
+}
+function compareFingerprints(a, b) {
+  if (a.length === 0 || b.length === 0) {
+    return {
+      similarity: 0,
+      distance: Number.NaN,
+      offset: 0
+    };
+  }
+  const span = Math.min(a.length, b.length);
+  const maxOffset = Math.max(a.length, b.length) - span;
+  let best = {
+    similarity: 0,
+    distance: 32 * span,
+    offset: 0
+  };
+  for (let offset = -maxOffset; offset <= maxOffset; offset++) {
+    const aStart = Math.max(0, -offset);
+    const bStart = Math.max(0, offset);
+    const overlap = Math.min(a.length - aStart, b.length - bStart);
+    if (overlap < Math.max(8, span / 4)) continue;
+    let bits = 0;
+    for (let i = 0; i < overlap; i++) {
+      bits += popcount32(a[aStart + i] ^ b[bStart + i]);
+    }
+    const similarity = 1 - bits / (32 * overlap);
+    if (similarity > best.similarity) {
+      best = {
+        similarity,
+        distance: bits,
+        offset
+      };
+    }
+  }
+  return best;
+}
+var chromaprintAlgorithm = {
+  name: "chromaprint",
+  family: "audio",
+  inputType: "audio",
+  requires: [FPCALC_BIN],
+  async hash(input) {
+    const fp = input.path === void 0 ? input.bytes === void 0 ? null : await withTempfile(input.bytes, "audio.bin", async (path) => await runFpcalc(path)) : await runFpcalc(input.path);
+    if (fp === null) {
+      throw new Error("chromaprint requires bytes or a path.");
+    }
+    return JSON.stringify(fp);
+  },
+  async compare(a, b) {
+    const fpA = parseChromaprintHash(a);
+    const fpB = parseChromaprintHash(b);
+    const result = compareFingerprints(fpA.fingerprint, fpB.fingerprint);
+    return {
+      similarity: result.similarity,
+      distance: Number.isFinite(result.distance) ? result.distance : void 0,
+      metric: "chromaprint-windowed-hamming"
+    };
+  }
+};
+export {
+  chromaprintAlgorithm
+};
+//# sourceMappingURL=chromaprint.mjs.map

package/dist/actions/hash/algorithms/chromaprint.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../src/actions/hash/lib/hamming.ts","../../../../src/actions/hash/lib/runBinary.ts","../../../../src/actions/hash/lib/which.ts","../../../../src/actions/hash/lib/withTempfile.ts","../../../../src/actions/hash/algorithms/chromaprint.ts"],"sourcesContent":["/**\n * Population count for an 8-bit value (number of set bits).\n */\nfunction popcount8(byte: number): number {\n  let count = 0\n  let value = byte & 0xff\n  while (value !== 0) {\n    count += value & 1\n    value >>>= 1\n  }\n  return count\n}\n\n/**\n * Hamming distance between two equal-length lowercase-hex strings.\n * Throws when the lengths differ.\n */\nexport function hammingHex(a: string, b: string): number {\n  if (a.length !== b.length) {\n    throw new Error(`Hash length mismatch: ${a.length} vs ${b.length}`)\n  }\n  if (a.length % 2 !== 0) {\n    throw new Error(`Hash hex length must be even, got ${a.length}`)\n  }\n  let dist = 0\n  for (let i = 0; i < a.length; i += 2) {\n    const xa = Number.parseInt(a.slice(i, i + 2), 16)\n    const xb = Number.parseInt(b.slice(i, i + 2), 16)\n    if (Number.isNaN(xa) || Number.isNaN(xb)) {\n      throw new TypeError(`Invalid hex at position ${i}: '${a.slice(i, i + 2)}' / '${b.slice(i, i + 2)}'`)\n    }\n    dist += popcount8(xa ^ xb)\n  }\n  return dist\n}\n\n/**\n * Bit-length of an even-length hex string.\n */\nexport function bitLengthHex(hex: string): number {\n  return (hex.length / 2) * 8\n}\n\n/**\n * Population count for a 32-bit unsigned value (number of set bits).\n * Uses the parallel-prefix bit trick.\n */\nexport function popcount32(value: number): number {\n  let v = Math.trunc(value)\n  v = v - ((v >>> 1) & 0x55_55_55_55)\n  v = (v & 0x33_33_33_33) + ((v >>> 2) & 0x33_33_33_33)\n  v = (v + (v >>> 4)) & 0x0f_0f_0f_0f\n  return ((v * 0x01_01_01_01) >>> 24) & 0xff\n}\n","import { spawn } from 'node:child_process'\n\nexport interface RunBinaryOptions {\n  binary: string\n  args?: readonly string[]\n  /** When provided, written to the child's stdin and stdin is closed. */\n  stdin?: Buffer\n  /** When true, the child's stdout is captured as a Buffer. Otherwise as utf8. */\n  binaryOutput?: boolean\n  /** Cap stdout capture at this many bytes. Default 64 MiB. */\n  maxBytes?: number\n}\n\nexport interface RunBinaryResult {\n  stdout: Buffer\n  stderr: string\n  exitCode: number\n}\n\n/**\n * Spawn a binary, optionally write to its stdin, and capture stdout/stderr.\n * Throws if the child exits non-zero.\n */\nexport async function runBinary(options: RunBinaryOptions): Promise<RunBinaryResult> {\n  const maxBytes = options.maxBytes ?? 64 * 1024 * 1024\n  return await new Promise((resolve, reject) => {\n    const child = spawn(options.binary, [...(options.args ?? [])], { stdio: ['pipe', 'pipe', 'pipe'] })\n\n    const stdoutChunks: Buffer[] = []\n    let stdoutBytes = 0\n    let stderr = ''\n    let killedForOverflow = false\n\n    child.stdout.on('data', (chunk: Buffer) => {\n      stdoutBytes += chunk.length\n      if (stdoutBytes > maxBytes) {\n        if (!killedForOverflow) {\n          killedForOverflow = true\n          child.kill('SIGKILL')\n        }\n        return\n      }\n      stdoutChunks.push(chunk)\n    })\n    child.stderr.on('data', (chunk: Buffer) => {\n      stderr += chunk.toString('utf8')\n    })\n\n    child.on('error', err => reject(err))\n    child.on('close', (code) => {\n      if (killedForOverflow) {\n        reject(new Error(`${options.binary} stdout exceeded ${maxBytes} bytes`))\n        return\n      }\n      const exitCode = code ?? -1\n      const stdout = Buffer.concat(stdoutChunks)\n      if (exitCode !== 0) {\n        const tail = stderr.trim().split(/\\r?\\n/).slice(-3).join('\\n')\n        reject(new Error(`${options.binary} exited ${exitCode}${tail.length > 0 ? `: ${tail}` : ''}`))\n        return\n      }\n      resolve({\n        stdout, stderr, exitCode,\n      })\n    })\n\n    if (options.stdin === undefined) {\n      child.stdin.end()\n    } else {\n      child.stdin.end(options.stdin)\n    }\n  })\n}\n","import { spawn } from 'node:child_process'\n\nimport type { RequiredBinary } from '../algorithms/types.ts'\n\n/**\n * Resolve a binary name to its absolute path on the user's PATH.\n * Returns null if not found.\n */\nexport async function which(binary: string): Promise<string | null> {\n  return await new Promise((resolve) => {\n    const cmd = process.platform === 'win32' ? 'where' : 'command'\n    const args = process.platform === 'win32' ? [binary] : ['-v', binary]\n    const child = spawn(cmd, args, { shell: process.platform !== 'win32' })\n\n    let stdout = ''\n    child.stdout.on('data', (chunk: Buffer) => {\n      stdout += chunk.toString('utf8')\n    })\n    child.on('error', () => resolve(null))\n    child.on('close', (code) => {\n      if (code === 0) {\n        const path = stdout.split(/\\r?\\n/).find(line => line.trim().length > 0)?.trim() ?? null\n        resolve(path)\n      } else {\n        resolve(null)\n      }\n    })\n  })\n}\n\n/**\n * Throw a clearly-actionable error when a required binary is missing.\n */\nexport async function requireBinary(req: RequiredBinary): Promise<string> {\n  const path = await which(req.binary)\n  if (path !== null) return path\n  const lines = [`${req.binary} binary not found on PATH. Install with:`]\n  if (req.install.brew !== undefined) lines.push(`  macOS:   brew install ${req.install.brew}`)\n  if (req.install.apt !== undefined) lines.push(`  Debian:  apt install ${req.install.apt}`)\n  if (req.install.choco !== undefined) lines.push(`  Windows: choco install ${req.install.choco}`)\n  throw new Error(lines.join('\\n'))\n}\n","import { randomBytes } from 'node:crypto'\nimport { rm, writeFile } from 'node:fs/promises'\nimport OS from 'node:os'\nimport PATH from 'node:path'\n\n/**\n * Write a buffer to a tempfile, run `fn` with its path, and unlink afterwards.\n * `extension` is included in the filename when provided (no leading dot).\n */\nexport async function withTempfile<T>(\n  bytes: Buffer,\n  extension: string | undefined,\n  fn: (path: string) => Promise<T>,\n): Promise<T> {\n  const ext = extension !== undefined && extension.length > 0 ? `.${extension}` : ''\n  const path = PATH.join(OS.tmpdir(), `aries-hash-${randomBytes(8).toString('hex')}${ext}`)\n  await writeFile(path, bytes)\n  try {\n    return await fn(path)\n  } finally {\n    await rm(path, { force: true })\n  }\n}\n","import { popcount32 } from '../lib/hamming.ts'\nimport { runBinary } from '../lib/runBinary.ts'\nimport { requireBinary } from '../lib/which.ts'\nimport { withTempfile } from '../lib/withTempfile.ts'\nimport type { Algorithm, RequiredBinary } from './types.ts'\n\nconst FPCALC_BIN: RequiredBinary = {\n  binary: 'fpcalc',\n  install: {\n    brew: 'chromaprint',\n    apt: 'libchromaprint-tools',\n    choco: 'chromaprint',\n  },\n}\n\ninterface ChromaprintFingerprint {\n  algorithm: 'chromaprint'\n  duration: number\n  fingerprint: number[]\n}\n\ninterface FpcalcJsonRaw {\n  duration: number\n  fingerprint: number[]\n}\n\nasync function runFpcalc(path: string): Promise<ChromaprintFingerprint> {\n  await requireBinary(FPCALC_BIN)\n  // -raw: output the fingerprint as a comma-separated list of 32-bit integers.\n  // -json: combine with -raw to get JSON whose `fingerprint` is an int[].\n  const { stdout } = await runBinary({ binary: 'fpcalc', args: ['-raw', '-json', path] })\n  const parsed = JSON.parse(stdout.toString('utf8')) as FpcalcJsonRaw\n  if (typeof parsed.duration !== 'number' || !Array.isArray(parsed.fingerprint)) {\n    throw new TypeError('fpcalc returned unexpected JSON shape.')\n  }\n  return {\n    algorithm: 'chromaprint',\n    duration: parsed.duration,\n    fingerprint: parsed.fingerprint,\n  }\n}\n\nfunction parseChromaprintHash(raw: string): ChromaprintFingerprint {\n  let parsed: unknown\n  try {\n    parsed = JSON.parse(raw)\n  } catch {\n    throw new Error('chromaprint hash must be a JSON document produced by `aries hash --algorithm chromaprint`.')\n  }\n  const obj = parsed as Partial<ChromaprintFingerprint>\n  if (obj.algorithm !== 'chromaprint' || typeof obj.duration !== 'number' || !Array.isArray(obj.fingerprint)) {\n    throw new Error('chromaprint hash JSON missing required fields (algorithm, duration, fingerprint).')\n  }\n  return obj as ChromaprintFingerprint\n}\n\n/**\n * Compare two chromaprint fingerprints by windowed Hamming distance over their 32-bit\n * frame integers. We slide one fingerprint over the other to find the best alignment\n * offset; bits matching across the overlap → similarity, lower is better.\n */\nfunction compareFingerprints(a: number[], b: number[]): { similarity: number; distance: number; offset: number } {\n  if (a.length === 0 || b.length === 0) {\n    return {\n      similarity: 0, distance: Number.NaN, offset: 0,\n    }\n  }\n\n  const span = Math.min(a.length, b.length)\n  const maxOffset = Math.max(a.length, b.length) - span\n  let best = {\n    similarity: 0,\n    distance: 32 * span,\n    offset: 0,\n  }\n\n  for (let offset = -maxOffset; offset <= maxOffset; offset++) {\n    const aStart = Math.max(0, -offset)\n    const bStart = Math.max(0, offset)\n    const overlap = Math.min(a.length - aStart, b.length - bStart)\n    if (overlap < Math.max(8, span / 4)) continue\n    let bits = 0\n    for (let i = 0; i < overlap; i++) {\n      bits += popcount32(a[aStart + i] ^ b[bStart + i])\n    }\n    const similarity = 1 - bits / (32 * overlap)\n    if (similarity > best.similarity) {\n      best = {\n        similarity, distance: bits, offset,\n      }\n    }\n  }\n  return best\n}\n\nexport const chromaprintAlgorithm: Algorithm = {\n  name: 'chromaprint',\n  family: 'audio',\n  inputType: 'audio',\n  requires: [FPCALC_BIN],\n  async hash(input) {\n    const fp = input.path === undefined\n      ? input.bytes === undefined\n        ? null\n        : await withTempfile(input.bytes, 'audio.bin', async path => await runFpcalc(path))\n      : await runFpcalc(input.path)\n    if (fp === null) {\n      throw new Error('chromaprint requires bytes or a path.')\n    }\n    return JSON.stringify(fp)\n  },\n  async compare(a, b) {\n    const fpA = parseChromaprintHash(a)\n    const fpB = parseChromaprintHash(b)\n    const result = compareFingerprints(fpA.fingerprint, fpB.fingerprint)\n    return {\n      similarity: result.similarity,\n      distance: Number.isFinite(result.distance) ? result.distance : undefined,\n      metric: 'chromaprint-windowed-hamming',\n    }\n  },\n}\n"],"mappings":";AA+CO,SAAS,WAAW,OAAuB;AAChD,MAAI,IAAI,KAAK,MAAM,KAAK;AACxB,MAAI,KAAM,MAAM,IAAK;AACrB,OAAK,IAAI,cAAmB,MAAM,IAAK;AACvC,MAAK,KAAK,MAAM,KAAM;AACtB,SAAS,IAAI,aAAmB,KAAM;AACxC;;;ACrDA,SAAS,aAAa;AAuBtB,eAAsB,UAAU,SAAqD;AACnF,QAAM,WAAW,QAAQ,YAAY,KAAK,OAAO;AACjD,SAAO,MAAM,IAAI,QAAQ,CAAC,SAAS,WAAW;AAC5C,UAAM,QAAQ,MAAM,QAAQ,QAAQ,CAAC,GAAI,QAAQ,QAAQ,CAAC,CAAE,GAAG,EAAE,OAAO,CAAC,QAAQ,QAAQ,MAAM,EAAE,CAAC;AAElG,UAAM,eAAyB,CAAC;AAChC,QAAI,cAAc;AAClB,QAAI,SAAS;AACb,QAAI,oBAAoB;AAExB,UAAM,OAAO,GAAG,QAAQ,CAAC,UAAkB;AACzC,qBAAe,MAAM;AACrB,UAAI,cAAc,UAAU;AAC1B,YAAI,CAAC,mBAAmB;AACtB,8BAAoB;AACpB,gBAAM,KAAK,SAAS;AAAA,QACtB;AACA;AAAA,MACF;AACA,mBAAa,KAAK,KAAK;AAAA,IACzB,CAAC;AACD,UAAM,OAAO,GAAG,QAAQ,CAAC,UAAkB;AACzC,gBAAU,MAAM,SAAS,MAAM;AAAA,IACjC,CAAC;AAED,UAAM,GAAG,SAAS,SAAO,OAAO,GAAG,CAAC;AACpC,UAAM,GAAG,SAAS,CAAC,SAAS;AAC1B,UAAI,mBAAmB;AACrB,eAAO,IAAI,MAAM,GAAG,QAAQ,MAAM,oBAAoB,QAAQ,QAAQ,CAAC;AACvE;AAAA,MACF;AACA,YAAM,WAAW,QAAQ;AACzB,YAAM,SAAS,OAAO,OAAO,YAAY;AACzC,UAAI,aAAa,GAAG;AAClB,cAAM,OAAO,OAAO,KAAK,EAAE,MAAM,OAAO,EAAE,MAAM,EAAE,EAAE,KAAK,IAAI;AAC7D,eAAO,IAAI,MAAM,GAAG,QAAQ,MAAM,WAAW,QAAQ,GAAG,KAAK,SAAS,IAAI,KAAK,IAAI,KAAK,EAAE,EAAE,CAAC;AAC7F;AAAA,MACF;AACA,cAAQ;AAAA,QACN;AAAA,QAAQ;AAAA,QAAQ;AAAA,MAClB,CAAC;AAAA,IACH,CAAC;AAED,QAAI,QAAQ,UAAU,QAAW;AAC/B,YAAM,MAAM,IAAI;AAAA,IAClB,OAAO;AACL,YAAM,MAAM,IAAI,QAAQ,KAAK;AAAA,IAC/B;AAAA,EACF,CAAC;AACH;;;ACxEA,SAAS,SAAAA,cAAa;AAQtB,eAAsB,MAAM,QAAwC;AAClE,SAAO,MAAM,IAAI,QAAQ,CAAC,YAAY;AACpC,UAAM,MAAM,QAAQ,aAAa,UAAU,UAAU;AACrD,UAAM,OAAO,QAAQ,aAAa,UAAU,CAAC,MAAM,IAAI,CAAC,MAAM,MAAM;AACpE,UAAM,QAAQA,OAAM,KAAK,MAAM,EAAE,OAAO,QAAQ,aAAa,QAAQ,CAAC;AAEtE,QAAI,SAAS;AACb,UAAM,OAAO,GAAG,QAAQ,CAAC,UAAkB;AACzC,gBAAU,MAAM,SAAS,MAAM;AAAA,IACjC,CAAC;AACD,UAAM,GAAG,SAAS,MAAM,QAAQ,IAAI,CAAC;AACrC,UAAM,GAAG,SAAS,CAAC,SAAS;AAC1B,UAAI,SAAS,GAAG;AACd,cAAM,OAAO,OAAO,MAAM,OAAO,EAAE,KAAK,UAAQ,KAAK,KAAK,EAAE,SAAS,CAAC,GAAG,KAAK,KAAK;AACnF,gBAAQ,IAAI;AAAA,MACd,OAAO;AACL,gBAAQ,IAAI;AAAA,MACd;AAAA,IACF,CAAC;AAAA,EACH,CAAC;AACH;AAKA,eAAsB,cAAc,KAAsC;AACxE,QAAM,OAAO,MAAM,MAAM,IAAI,MAAM;AACnC,MAAI,SAAS,KAAM,QAAO;AAC1B,QAAM,QAAQ,CAAC,GAAG,IAAI,MAAM,0CAA0C;AACtE,MAAI,IAAI,QAAQ,SAAS,OAAW,OAAM,KAAK,2BAA2B,IAAI,QAAQ,IAAI,EAAE;AAC5F,MAAI,IAAI,QAAQ,QAAQ,OAAW,OAAM,KAAK,0BAA0B,IAAI,QAAQ,GAAG,EAAE;AACzF,MAAI,IAAI,QAAQ,UAAU,OAAW,OAAM,KAAK,4BAA4B,IAAI,QAAQ,KAAK,EAAE;AAC/F,QAAM,IAAI,MAAM,MAAM,KAAK,IAAI,CAAC;AAClC;;;ACzCA,SAAS,mBAAmB;AAC5B,SAAS,IAAI,iBAAiB;AAC9B,OAAO,QAAQ;AACf,OAAO,UAAU;AAMjB,eAAsB,aACpB,OACA,WACA,IACY;AACZ,QAAM,MAAM,cAAc,UAAa,UAAU,SAAS,IAAI,IAAI,SAAS,KAAK;AAChF,QAAM,OAAO,KAAK,KAAK,GAAG,OAAO,GAAG,cAAc,YAAY,CAAC,EAAE,SAAS,KAAK,CAAC,GAAG,GAAG,EAAE;AACxF,QAAM,UAAU,MAAM,KAAK;AAC3B,MAAI;AACF,WAAO,MAAM,GAAG,IAAI;AAAA,EACtB,UAAE;AACA,UAAM,GAAG,MAAM,EAAE,OAAO,KAAK,CAAC;AAAA,EAChC;AACF;;;AChBA,IAAM,aAA6B;AAAA,EACjC,QAAQ;AAAA,EACR,SAAS;AAAA,IACP,MAAM;AAAA,IACN,KAAK;AAAA,IACL,OAAO;AAAA,EACT;AACF;AAaA,eAAe,UAAU,MAA+C;AACtE,QAAM,cAAc,UAAU;AAG9B,QAAM,EAAE,OAAO,IAAI,MAAM,UAAU,EAAE,QAAQ,UAAU,MAAM,CAAC,QAAQ,SAAS,IAAI,EAAE,CAAC;AACtF,QAAM,SAAS,KAAK,MAAM,OAAO,SAAS,MAAM,CAAC;AACjD,MAAI,OAAO,OAAO,aAAa,YAAY,CAAC,MAAM,QAAQ,OAAO,WAAW,GAAG;AAC7E,UAAM,IAAI,UAAU,wCAAwC;AAAA,EAC9D;AACA,SAAO;AAAA,IACL,WAAW;AAAA,IACX,UAAU,OAAO;AAAA,IACjB,aAAa,OAAO;AAAA,EACtB;AACF;AAEA,SAAS,qBAAqB,KAAqC;AACjE,MAAI;AACJ,MAAI;AACF,aAAS,KAAK,MAAM,GAAG;AAAA,EACzB,QAAQ;AACN,UAAM,IAAI,MAAM,4FAA4F;AAAA,EAC9G;AACA,QAAM,MAAM;AACZ,MAAI,IAAI,cAAc,iBAAiB,OAAO,IAAI,aAAa,YAAY,CAAC,MAAM,QAAQ,IAAI,WAAW,GAAG;AAC1G,UAAM,IAAI,MAAM,mFAAmF;AAAA,EACrG;AACA,SAAO;AACT;AAOA,SAAS,oBAAoB,GAAa,GAAuE;AAC/G,MAAI,EAAE,WAAW,KAAK,EAAE,WAAW,GAAG;AACpC,WAAO;AAAA,MACL,YAAY;AAAA,MAAG,UAAU,OAAO;AAAA,MAAK,QAAQ;AAAA,IAC/C;AAAA,EACF;AAEA,QAAM,OAAO,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM;AACxC,QAAM,YAAY,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM,IAAI;AACjD,MAAI,OAAO;AAAA,IACT,YAAY;AAAA,IACZ,UAAU,KAAK;AAAA,IACf,QAAQ;AAAA,EACV;AAEA,WAAS,SAAS,CAAC,WAAW,UAAU,WAAW,UAAU;AAC3D,UAAM,SAAS,KAAK,IAAI,GAAG,CAAC,MAAM;AAClC,UAAM,SAAS,KAAK,IAAI,GAAG,MAAM;AACjC,UAAM,UAAU,KAAK,IAAI,EAAE,SAAS,QAAQ,EAAE,SAAS,MAAM;AAC7D,QAAI,UAAU,KAAK,IAAI,GAAG,OAAO,CAAC,EAAG;AACrC,QAAI,OAAO;AACX,aAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,cAAQ,WAAW,EAAE,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;AAAA,IAClD;AACA,UAAM,aAAa,IAAI,QAAQ,KAAK;AACpC,QAAI,aAAa,KAAK,YAAY;AAChC,aAAO;AAAA,QACL;AAAA,QAAY,UAAU;AAAA,QAAM;AAAA,MAC9B;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEO,IAAM,uBAAkC;AAAA,EAC7C,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,UAAU,CAAC,UAAU;AAAA,EACrB,MAAM,KAAK,OAAO;AAChB,UAAM,KAAK,MAAM,SAAS,SACtB,MAAM,UAAU,SACd,OACA,MAAM,aAAa,MAAM,OAAO,aAAa,OAAM,SAAQ,MAAM,UAAU,IAAI,CAAC,IAClF,MAAM,UAAU,MAAM,IAAI;AAC9B,QAAI,OAAO,MAAM;AACf,YAAM,IAAI,MAAM,uCAAuC;AAAA,IACzD;AACA,WAAO,KAAK,UAAU,EAAE;AAAA,EAC1B;AAAA,EACA,MAAM,QAAQ,GAAG,GAAG;AAClB,UAAM,MAAM,qBAAqB,CAAC;AAClC,UAAM,MAAM,qBAAqB,CAAC;AAClC,UAAM,SAAS,oBAAoB,IAAI,aAAa,IAAI,WAAW;AACnE,WAAO;AAAA,MACL,YAAY,OAAO;AAAA,MACnB,UAAU,OAAO,SAAS,OAAO,QAAQ,IAAI,OAAO,WAAW;AAAA,MAC/D,QAAQ;AAAA,IACV;AAAA,EACF;AACF;","names":["spawn"]}

package/dist/actions/hash/algorithms/dhash.mjs

@@ -0,0 +1,75 @@
+// src/actions/hash/algorithms/dhash.ts
+import { readFile } from "fs/promises";
+import sharp from "sharp";
+
+// src/actions/hash/lib/hamming.ts
+function popcount8(byte) {
+  let count = 0;
+  let value = byte & 255;
+  while (value !== 0) {
+    count += value & 1;
+    value >>>= 1;
+  }
+  return count;
+}
+function hammingHex(a, b) {
+  if (a.length !== b.length) {
+    throw new Error(`Hash length mismatch: ${a.length} vs ${b.length}`);
+  }
+  if (a.length % 2 !== 0) {
+    throw new Error(`Hash hex length must be even, got ${a.length}`);
+  }
+  let dist = 0;
+  for (let i = 0; i < a.length; i += 2) {
+    const xa = Number.parseInt(a.slice(i, i + 2), 16);
+    const xb = Number.parseInt(b.slice(i, i + 2), 16);
+    if (Number.isNaN(xa) || Number.isNaN(xb)) {
+      throw new TypeError(`Invalid hex at position ${i}: '${a.slice(i, i + 2)}' / '${b.slice(i, i + 2)}'`);
+    }
+    dist += popcount8(xa ^ xb);
+  }
+  return dist;
+}
+
+// src/actions/hash/algorithms/dhash.ts
+var dhashAlgorithm = {
+  name: "dhash",
+  family: "perceptual-image",
+  inputType: "image",
+  async hash(input) {
+    const source = input.bytes ?? (input.path === void 0 ? void 0 : await readFile(input.path));
+    if (source === void 0) {
+      throw new Error("dhash requires bytes or a path.");
+    }
+    const raw = await sharp(source).resize(9, 8, { fit: "fill" }).grayscale().raw().toBuffer();
+    if (raw.length !== 9 * 8) {
+      throw new Error(`dhash unexpected raw buffer length ${raw.length}`);
+    }
+    let bits = "";
+    for (let row = 0; row < 8; row++) {
+      for (let col = 0; col < 8; col++) {
+        const left = raw[row * 9 + col];
+        const right = raw[row * 9 + col + 1];
+        bits += left > right ? "1" : "0";
+      }
+    }
+    let hex = "";
+    for (let i = 0; i < bits.length; i += 4) {
+      hex += Number.parseInt(bits.slice(i, i + 4), 2).toString(16);
+    }
+    return hex;
+  },
+  async compare(a, b) {
+    const dist = hammingHex(a, b);
+    const bits = a.length / 2 * 8;
+    return {
+      distance: dist,
+      similarity: 1 - dist / bits,
+      metric: `hamming-${bits}`
+    };
+  }
+};
+export {
+  dhashAlgorithm
+};
+//# sourceMappingURL=dhash.mjs.map

package/dist/actions/hash/algorithms/dhash.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../src/actions/hash/algorithms/dhash.ts","../../../../src/actions/hash/lib/hamming.ts"],"sourcesContent":["import { readFile } from 'node:fs/promises'\n\nimport sharp from 'sharp'\n\nimport { hammingHex } from '../lib/hamming.ts'\nimport type { Algorithm } from './types.ts'\n\n/**\n * dHash (difference hash): resize to 9×8 grayscale, then for each row produce 8 bits\n * representing whether pixel[i] > pixel[i+1]. 8 rows × 8 bits = 64 bits → 16 hex chars.\n */\nexport const dhashAlgorithm: Algorithm = {\n  name: 'dhash',\n  family: 'perceptual-image',\n  inputType: 'image',\n  async hash(input) {\n    const source = input.bytes ?? (input.path === undefined ? undefined : await readFile(input.path))\n    if (source === undefined) {\n      throw new Error('dhash requires bytes or a path.')\n    }\n    const raw = await sharp(source)\n      .resize(9, 8, { fit: 'fill' })\n      .grayscale()\n      .raw()\n      .toBuffer()\n    if (raw.length !== 9 * 8) {\n      throw new Error(`dhash unexpected raw buffer length ${raw.length}`)\n    }\n    let bits = ''\n    for (let row = 0; row < 8; row++) {\n      for (let col = 0; col < 8; col++) {\n        const left = raw[row * 9 + col]\n        const right = raw[row * 9 + col + 1]\n        bits += left > right ? '1' : '0'\n      }\n    }\n    let hex = ''\n    for (let i = 0; i < bits.length; i += 4) {\n      hex += Number.parseInt(bits.slice(i, i + 4), 2).toString(16)\n    }\n    return hex\n  },\n  async compare(a, b) {\n    const dist = hammingHex(a, b)\n    const bits = (a.length / 2) * 8\n    return {\n      distance: dist, similarity: 1 - dist / bits, metric: `hamming-${bits}`,\n    }\n  },\n}\n","/**\n * Population count for an 8-bit value (number of set bits).\n */\nfunction popcount8(byte: number): number {\n  let count = 0\n  let value = byte & 0xff\n  while (value !== 0) {\n    count += value & 1\n    value >>>= 1\n  }\n  return count\n}\n\n/**\n * Hamming distance between two equal-length lowercase-hex strings.\n * Throws when the lengths differ.\n */\nexport function hammingHex(a: string, b: string): number {\n  if (a.length !== b.length) {\n    throw new Error(`Hash length mismatch: ${a.length} vs ${b.length}`)\n  }\n  if (a.length % 2 !== 0) {\n    throw new Error(`Hash hex length must be even, got ${a.length}`)\n  }\n  let dist = 0\n  for (let i = 0; i < a.length; i += 2) {\n    const xa = Number.parseInt(a.slice(i, i + 2), 16)\n    const xb = Number.parseInt(b.slice(i, i + 2), 16)\n    if (Number.isNaN(xa) || Number.isNaN(xb)) {\n      throw new TypeError(`Invalid hex at position ${i}: '${a.slice(i, i + 2)}' / '${b.slice(i, i + 2)}'`)\n    }\n    dist += popcount8(xa ^ xb)\n  }\n  return dist\n}\n\n/**\n * Bit-length of an even-length hex string.\n */\nexport function bitLengthHex(hex: string): number {\n  return (hex.length / 2) * 8\n}\n\n/**\n * Population count for a 32-bit unsigned value (number of set bits).\n * Uses the parallel-prefix bit trick.\n */\nexport function popcount32(value: number): number {\n  let v = Math.trunc(value)\n  v = v - ((v >>> 1) & 0x55_55_55_55)\n  v = (v & 0x33_33_33_33) + ((v >>> 2) & 0x33_33_33_33)\n  v = (v + (v >>> 4)) & 0x0f_0f_0f_0f\n  return ((v * 0x01_01_01_01) >>> 24) & 0xff\n}\n"],"mappings":";AAAA,SAAS,gBAAgB;AAEzB,OAAO,WAAW;;;ACClB,SAAS,UAAU,MAAsB;AACvC,MAAI,QAAQ;AACZ,MAAI,QAAQ,OAAO;AACnB,SAAO,UAAU,GAAG;AAClB,aAAS,QAAQ;AACjB,eAAW;AAAA,EACb;AACA,SAAO;AACT;AAMO,SAAS,WAAW,GAAW,GAAmB;AACvD,MAAI,EAAE,WAAW,EAAE,QAAQ;AACzB,UAAM,IAAI,MAAM,yBAAyB,EAAE,MAAM,OAAO,EAAE,MAAM,EAAE;AAAA,EACpE;AACA,MAAI,EAAE,SAAS,MAAM,GAAG;AACtB,UAAM,IAAI,MAAM,qCAAqC,EAAE,MAAM,EAAE;AAAA,EACjE;AACA,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,GAAG;AACpC,UAAM,KAAK,OAAO,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE;AAChD,UAAM,KAAK,OAAO,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE;AAChD,QAAI,OAAO,MAAM,EAAE,KAAK,OAAO,MAAM,EAAE,GAAG;AACxC,YAAM,IAAI,UAAU,2BAA2B,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC,GAAG;AAAA,IACrG;AACA,YAAQ,UAAU,KAAK,EAAE;AAAA,EAC3B;AACA,SAAO;AACT;;;ADvBO,IAAM,iBAA4B;AAAA,EACvC,MAAM;AAAA,EACN,QAAQ;AAAA,EACR,WAAW;AAAA,EACX,MAAM,KAAK,OAAO;AAChB,UAAM,SAAS,MAAM,UAAU,MAAM,SAAS,SAAY,SAAY,MAAM,SAAS,MAAM,IAAI;AAC/F,QAAI,WAAW,QAAW;AACxB,YAAM,IAAI,MAAM,iCAAiC;AAAA,IACnD;AACA,UAAM,MAAM,MAAM,MAAM,MAAM,EAC3B,OAAO,GAAG,GAAG,EAAE,KAAK,OAAO,CAAC,EAC5B,UAAU,EACV,IAAI,EACJ,SAAS;AACZ,QAAI,IAAI,WAAW,IAAI,GAAG;AACxB,YAAM,IAAI,MAAM,sCAAsC,IAAI,MAAM,EAAE;AAAA,IACpE;AACA,QAAI,OAAO;AACX,aAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,eAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,cAAM,OAAO,IAAI,MAAM,IAAI,GAAG;AAC9B,cAAM,QAAQ,IAAI,MAAM,IAAI,MAAM,CAAC;AACnC,gBAAQ,OAAO,QAAQ,MAAM;AAAA,MAC/B;AAAA,IACF;AACA,QAAI,MAAM;AACV,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,GAAG;AACvC,aAAO,OAAO,SAAS,KAAK,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,SAAS,EAAE;AAAA,IAC7D;AACA,WAAO;AAAA,EACT;AAAA,EACA,MAAM,QAAQ,GAAG,GAAG;AAClB,UAAM,OAAO,WAAW,GAAG,CAAC;AAC5B,UAAM,OAAQ,EAAE,SAAS,IAAK;AAC9B,WAAO;AAAA,MACL,UAAU;AAAA,MAAM,YAAY,IAAI,OAAO;AAAA,MAAM,QAAQ,WAAW,IAAI;AAAA,IACtE;AAAA,EACF;AACF;","names":[]}