cmpstr 2.0.2 → 3.0.0

package/dist/esm/utils/DeepMerge.js

@@ -0,0 +1,139 @@
+// CmpStr v3.0.0 dev-1a82e20-250612 by Paul Köhler @komed3 / MIT License
+/**
+ * Deep Merge Utility
+ * src/utils/DeepMerge.ts
+ *
+ * This module provides utility functions for deep merging objects, getting values by path,
+ * and setting values by path in a deeply nested object structure.
+ *
+ * It supports dot and bracket notation (e.g. `a.b[0].c`) as well as escaped keys.
+ *
+ * Included functions:
+ *  - `get`:   Retrieve a deeply nested value by path
+ *  - `set`:   Assign a value to a nested path
+ *  - `merge`: Deeply merge two objects
+ *  - `has`:   Check whether a path exists
+ *  - `rmv`:   Delete a value at a path
+ *
+ * @module Utils/DeepMerge
+ * @author Paul Köhler
+ * @license MIT
+ */
+/**
+ * Parse a path string into an array of keys.
+ *
+ * @param {string} p - The path string, e.g. `a.b.c` or `a[0].b`
+ * @returns {(string|number)[]} - An array of keys, e.g. `['a', 'b', 'c']` or `['a', 0, 'b']`
+ */
+const parse = (p) =>
+  p
+    .replace(/\[(\d+)]/g, '.$1')
+    .split('.')
+    .map((s) => (/^\d+$/.test(s) ? +s : s));
+/**
+ * Deeply get a value from an object by a path string.
+ *
+ * @template T - The type of the object to get the value from
+ * @param {T} t - The object to get the value from
+ * @param {string} path - The path string, e.g. `a.b.c`
+ * @param {any} fallback - The default value to return if the path does not exist
+ * @returns {T|R|undefined} - The value at the specified path, otherwise the default value
+ */
+function get(t, path, fallback) {
+  return parse(path).reduce((o, k) => o?.[k] ?? fallback, t);
+}
+/**
+ * Deeply set a value in an object by a path string.
+ *
+ * @template T - The type of the object to get the value from
+ * @param {T} t - The object to set the value in
+ * @param {string} path - The path string, e.g. `a.b.c`
+ * @param {any} value - The value to set at the specified path
+ * @returns {T} - The modified object with the value set at the specified path
+ * @throws {Error} - Throws an error if the key is not a valid identifier
+ */
+function set(t, path, value) {
+  // If the path is empty, return the value
+  if (path === '') return value;
+  // Split the path into the first key and the rest of the path
+  const [k, ...r] = parse(path);
+  // Throw an error if the key is not a valid identifier
+  if (t !== undefined && (typeof t !== 'object' || t === null))
+    throw Error(`cannot set property <${k}> of <${JSON.stringify(t)}>`);
+  // Assign the value to the specified key in the object
+  return Object.assign(
+    t ?? (typeof k === 'number' ? [] : Object.create(null)),
+    { [k]: set(t?.[k], r.join('.'), value) }
+  );
+}
+/**
+ * Deeply merge two objects, where the second object overrides the first.
+ *
+ * @template T - The type of the object to get the value from
+ * @param {T} t - The target object to merge into
+ * @param {T} o - The source object to merge from
+ * @param {boolean} [mergeUndefined=false] - Whether to merge undefined values
+ * @returns {T} - The merged object
+ */
+function merge(
+  t = Object.create(null),
+  o = Object.create(null),
+  mergeUndefined = false
+) {
+  // Iterate over the keys of the source object and merge them into the target object
+  return (
+    Object.keys(o).forEach((k) => {
+      const val = o[k];
+      // If the value is undefined and mergeUndefined is false, skip it
+      if (!mergeUndefined && val === undefined) return;
+      // Skip dangerous property names to prevent prototype pollution
+      if (k === '__proto__' || k === 'constructor') return;
+      // If the value is an object and not an array, recursively merge it
+      t[k] =
+        typeof val === 'object' && !Array.isArray(val)
+          ? merge(
+              typeof t[k] === 'object' && !Array.isArray(t[k])
+                ? t[k]
+                : Object.create(null),
+              val
+            )
+          : val;
+    }),
+    t
+  );
+}
+/**
+ * Delete a value at a specified path in an object.
+ *
+ * @template T - The type of the object to get the value from
+ * @param {T} t - The object to delete the value from
+ * @param {string} path - The path string, e.g. `a.b.c`
+ * @param {boolean} [preserveEmpty=false] - Whether to preserve empty objects/arrays
+ * @returns {T} - The modified object with the value deleted at the specified path
+ */
+function rmv(t, path, preserveEmpty = false) {
+  const r = (o, k, i = 0) => {
+    const key = k[i];
+    // Delete the key if it is not an object or if it is the last key in the path
+    if (!o || typeof o !== 'object') return false;
+    if (i === k.length - 1) return delete o[key];
+    if (!r(o[key], k, i + 1)) return false;
+    // If preserveEmpty is false, check if the object or array is empty
+    if (!preserveEmpty) {
+      const val = o[key];
+      // If the value is an empty array or object, delete the key
+      if (
+        typeof val === 'object' &&
+        ((Array.isArray(val) && val.every((v) => v == null)) ||
+          (!Array.isArray(val) && Object.keys(val).length === 0))
+      )
+        delete o[key];
+    }
+    return true;
+  };
+  r(t, parse(path));
+  return t;
+}
+
+export { get, merge, rmv, set };
+//# sourceMappingURL=DeepMerge.js.map

package/dist/esm/utils/DeepMerge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DeepMerge.js","sources":["../../../src/utils/DeepMerge.ts"],"sourcesContent":[null],"names":[],"mappings":";AAAA,CAAA,CAAA;;;;;;;;;;;;;;;;;;;AAmBG,CAAA,CAAA;AAIH,CAAA,CAAA;;;;;AAKG,CAAA,CAAA;AACH,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAK,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAG,CAAE,CAAS;EACrB;IAAC,CAAC,CAAO,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAE,WAAW,CAAE,CAAA,CAAA,CAAA,CAAA,CAAA,CAAK;IAAE,CAAC,KAAK,CAAE,CAAA,CAAA,CAAG;IAAE,CAAC,GAAG,EAAE,EAAC,CAAI,CAAA,CAAA,EAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAC,CAAI,CAAA,CAAA,CAAA,CAAE,CAAC,CAAE,GAAG,CAAC,CAAC,CAAG,CAAA,CAAA,CAAC,CAAE,CACtF;AAED,CAAA,CAAA;;;;;;;;AAQG,CAAA,CAAA;SACa,GAAG,CACf,CAAI,EAAE,CAAY,CAAA,CAAA,CAAA,CAAA,CAAE,QAAc,CAAA,CAAA;CAGlC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,KAAK,CAAE,CAAA,CAAA,CAAA,CAAI,CAAE,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAE,CAAE,CAAC,EAAE,CAAC,CAAA,CAAA,CAAA,CAAA,CAAM,CAAC,CAAI,CAAA,CAAA,CAAC,CAAE,CAAI,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAQ,CAAE,CAAA,CAAC,CAAE;AAEtE;AAkBA,CAAA,CAAA;;;;;;;;;AASG,CAAA,CAAA;SACa,GAAG,CACf,CAAI,EAAE,CAAY,CAAA,CAAA,CAAA,CAAA,CAAE,KAAU,CAAA,CAAA;;CAI9B,CAAA,CAAA,CAAA,CAAA,CAAK,CAAI,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAK,CAAE,CAAA,CAAG,CAAA,OAAO,CAAK,CAAA,CAAA,CAAA,CAAA;;CAG/B,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAE,CAAC,CAAE,CAAA,CAAA,CAAA,CAAG,CAAC,CAAE,CAA0B,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAK,CAAE,CAAA,CAAA,CAAA,CAAI,CAAE;;AAGxD,CAAA,CAAA,CAAK,CAAA,CAAA,CAAA,CAAC,CAAK,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAS,CAAM,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAC,CAAA,CAAA,CAAA,CAAA,CAAK,CAAQ,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAI,CAAC,CAAA,CAAA,CAAA,CAAA,CAAK,IAAI,CAAE;AAAG,CAAA,CAAA,CAAA,CAAA,MAAM,CAAK,CAAA,CAAA,CAAA,CAAA,CACzE,CAAwB,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAC,CAAU,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,EAAA,CAAI,CAAA,CAAA,CAAA,CAAC,SAAS,CAAE,CAAC,CAAG,CAAA,CAAA,CAAG,CAC7D;;CAGD,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,MAAM,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM;IAAE,CAAC,CAAA,CAAA,CAAA,CAAA,CAAM,OAAO,CAAC,CAAA,CAAA,CAAA,CAAA,CAAK,QAAQ,CAAG,CAAA,CAAA,CAAA,CAAE,GAAG,CAAM,CAAA,CAAA,CAAA,CAAA,CAAA,CAAC,MAAM,CAAE,CAAA,CAAA,CAAA,CAAI,CAAE,CAAE;AAC7E,CAAA,CAAA,CAAA,EAAA,CAAA,CAAE,CAAC,CAAA,CAAA,CAAI,CAAG,CAAA,CAAA,CAAE,CAAC,CAAI,CAAA,CAAA,CAAC,CAAE,CAAA,CAAE,CAAC,CAAC,CAAA,CAAA,CAAA,CAAI,CAAE,CAAG,CAAA,CAAA,CAAE,EAAE,CAAK,CAAA,CAAA,CAAA,CAAA;AAC7C,CAAA,CAAA,CAAO;AAEZ;AAEA,CAAA,CAAA;;;;;;;;AAQG,CAAA,CAAA;AACG,CAAU,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAK;EACjB,CAAA,CAAA,CAAA,CAAmB,MAAM,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAE,CAAA,CAAA,CAAA,CAAI,CAAE;AAAA,EACxC,CAAmB,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAE,CAAA,CAAA,CAAA,CAAI,CAAE;AACxC,EAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,EAA0B,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA;AAAK,CAAA,CAAA;;CAI/B,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA;IAAO,CAAM,CAAA,CAAA,CAAA,CAAA,CAAA,CAAC,CAAI,CAAA,CAAA,CAAA,CAAE,CAAC,CAAE,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,EAAE,EAAC,CAAG,CAAA,CAAA,CAAA;AAEjC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,MAAM,CAAG,CAAA,CAAA,CAAA,CAAA,CAAG,CAAC,CAAE,CAAC,CAAE;;AAGlB,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,IAAK,CAAE,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAc,CAAI,CAAA,CAAA,CAAA,CAAA,CAAA,CAAG,KAAK,CAAS,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,EAAG,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA;;AAG7C,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,IAAK,CAAC,CAAA,CAAA,CAAA,CAAA,CAAK,WAAW,CAAI,CAAA,CAAA,CAAA,CAAC,KAAK,CAAa,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,EAAG,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA;;AAG9C,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAU,CAAE,CAAC,CAAE;QAAG,CAAO,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAG,CAAK,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAQ,IAAI,CAAE,CAAA,CAAA,CAAA,CAAA,CAAK,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAE,CAAG,CAAA,CAAA;YAC7D,KAAK;cAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAC,CAAE,CAAC,CAAE,CAAK,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAQ,CAAI,CAAA,CAAA,CAAA,CAAE,KAAK,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAE,CAAC,CAAE,CAAC,CAAE;AACzD,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAE,CAAC,CAAE,CAAC;AAAE,gBAAG,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAE,CAAA,CAAA,CAAA,CAAI,CAAE;AAAA,cAAE,CAAG,CAAA;;YACvC,CAAG,CAAA,CAAA;CAEZ,CAAA,CAAA,CAAA,CAAA,CAAE;IAAE;GAAC;AAEV;AAEA,CAAA,CAAA;;;;;;;;AAQG,CAAA,CAAA;AACG,CAAU,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAG,CACf,CAAI,CAAA,CAAE,IAAY,CAAE,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,EAAyB,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAK,CAAA,CAAA;CAGlD,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAC,CAAA,CAAA,CAAG,CAAE,CAAM,CAAE,CAAA,CAAwB,CAAE,CAAA,CAAC,CAAG,CAAA,CAAA,CAAC,CAAe,CAAA,CAAA,CAAA,CAAA;AAE9D,CAAA,CAAA,CAAA,CAAA,MAAM,CAAG,CAAA,CAAA,CAAA,CAAA,CAAoB,CAAC,CAAE,CAAC,CAAE;;AAGnC,CAAA,CAAA,CAAA,CAAA,IAAK,CAAE,CAAC,IAAI,CAAO,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAC,KAAK,CAAQ,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAG,CAAA,OAAO,CAAK,CAAA,CAAA,CAAA,CAAA;AAChD,CAAA,CAAA,CAAA,CAAA,IAAK,CAAC,CAAA,CAAA,CAAA,CAAA,CAAK,CAAC,CAAC,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,GAAG,CAAC,CAAG,CAAA,CAAO,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAC,CAAE,GAAG,CAAE;AAChD,CAAA,CAAA,CAAA,CAAA,CAAK,CAAA,CAAA,CAAA,CAAE,CAAC,CAAE,CAAC,CAAE,CAAA,CAAA,CAAG,CAAE,CAAA,CAAE,CAAC,CAAA,CAAE,CAAC,CAAA,CAAA,CAAG,CAAC,CAAE,CAAG,CAAA,OAAO,CAAK,CAAA,CAAA,CAAA,CAAA;;CAG7C,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAK,CAAE,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAa,CAAG,CAAA;AAEnB,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,MAAM,CAAG,CAAA,CAAA,CAAA,CAAA,CAAQ,CAAC,CAAE,GAAG,CAAE;;CAGzB,CAAA,CAAA,CAAA,CAAA,GAAA;AAAA,CAAA,CAAA,CAAA,CAAA,CAAA,GAAK,OAAO,CAAG,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAK,QAAQ,CACxB,CAAA;AAAA,QAAA,CAAA,CAAE,CAAK,CAAA,CAAA,CAAA,CAAA,CAAC,CAAO,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAE,GAAG,CAAE,CAAA,CAAA,CAAA,CAAI,CAAG,CAAA,CAAA,CAAC,CAAK,CAAA,CAAA,CAAA,CAAA,EAAE,EAAC,CAAI,CAAA,CAAA,CAAA,CAAC,CAAI,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAI,CAAE,CAAA,CAAA,CAAA;AACrD,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAE,CAAE,CAAK,CAAA,CAAA,CAAA,CAAA,CAAC,OAAO,CAAE,CAAA,CAAA,CAAG,CAAE,CAAI,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAM,CAAC,CAAI,CAAA,CAAA,CAAA,CAAE,GAAG,CAAE,CAAC,MAAM,CAAK,CAAA,CAAA,CAAA,CAAA,CAAC,CAAE;AAC7D,CAAA,CAAA,CAAA,CAAA,CAAA;AAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAO,CAAA,CAAA,CAAA,CAAA,CAAA,CAAA,CAAC,CAAE,CAAA,CAAA,CAAG,CAAE;;AAIvB,CAAA,CAAA,CAAA,CAAA,OAAO,CAAI,CAAA,CAAA,CAAA;AAEf,CAAC,CAAA,CAAA;CAED,CAAA,CAAC,CAAE,CAAC,CAAA,CAAE,KAAK,CAAE,CAAA,CAAA,CAAA,CAAI,CAAE,CAAE;AAErB,CAAA,CAAA,OAAO,CAAC;AAEZ;;;"}

package/dist/esm/utils/DiffChecker.js

@@ -0,0 +1,498 @@
+// CmpStr v3.0.0 dev-1a82e20-250612 by Paul Köhler @komed3 / MIT License
+/**
+ * DiffChecker Utility
+ * src/utils/DiffChecker.ts
+ *
+ * The DiffChecker class provides a robust and efficient utility for comparing two
+ * texts and extracting their differences (full lines or word mode). It supports
+ * context-aware grouping of changes, unified diff output (with CLI color or ASCII
+ * markup), and detailed change magnitude metrics. The class is highly configurable,
+ * allowing users to choose the diff granularity, case sensitivity, context lines,
+ * grouping, and output style. It is suitable for text comparison, code review
+ * tools, document versioning, and any application requiring precise and human-
+ * readable difference reporting.
+ *
+ * Features:
+ *  - Line and word-based diffing
+ *  - Case-insensitive comparison option
+ *  - Context lines and grouping of adjacent changes
+ *  - Unified diff output (ASCII or colored CLI)
+ *  - Highlighting of changed segments within lines
+ *  - Change magnitude calculation (relative to group or line)
+ *  - Expand-all mode for full file context
+ *
+ * @module Utils/DiffChecker
+ * @author Paul Köhler (komed3)
+ * @license MIT
+ */
+/**
+ * The DiffChecker class provides methods to compare two texts and generate
+ * structured diffs, grouped diffs, and unified diff outputs.
+ */
+class DiffChecker {
+  // Original input texts and options
+  a;
+  b;
+  options;
+  // Computed diff entries and groups
+  entries = [];
+  grouped = [];
+  // Flag to indicate if the diff has already been computed
+  diffRun = false;
+  /**
+   * Constructs a new DiffChecker instance for comparing two texts.
+   *
+   * @param {string} a - The first (original) text
+   * @param {string} b - The second (modified) text
+   * @param {DiffOptions} [opt] - Optional diff configuration
+   */
+  constructor(a, b, opt = {}) {
+    // Set the two texts to compare
+    (this.a = a), (this.b = b);
+    // Merge default with user-provided options
+    this.options = {
+      ...{
+        mode: 'word',
+        caseInsensitive: false,
+        contextLines: 1,
+        groupedLines: true,
+        expandLines: false,
+        showChangeMagnitude: true,
+        maxMagnitudeSymbols: 5,
+        lineBreak: '\n'
+      },
+      ...opt
+    };
+    // Run the diff computation immediately
+    this.computeDiff();
+  }
+  /**
+   * Splits both input texts into arrays of lines and returns them
+   * with the maximum line count.
+   *
+   * @returns { linesA: string[], linesB: string[], maxLen: number }
+   */
+  text2lines() {
+    // Trim and split the input texts into lines
+    const linesA = this.a.trim().split(/\r?\n/);
+    const linesB = this.b.trim().split(/\r?\n/);
+    return { linesA, linesB, maxLen: Math.max(linesA.length, linesB.length) };
+  }
+  /**
+   * Tokenizes a string according to the current diff mode (line or word).
+   *
+   * @param {string} input - The string to tokenize
+   * @returns {string[]} - Array of tokens
+   */
+  tokenize(input) {
+    const { mode } = this.options;
+    switch (mode) {
+      // Tokenize by lines
+      case 'line':
+        return [input];
+      // Tokenize by words
+      case 'word':
+        return input.split(/\s+/);
+    }
+  }
+  /**
+   * Concatenates an array of tokens back into a string, respecting the diff mode.
+   *
+   * @param {string[]} input - Array of tokens
+   * @returns {string} - Concatenated string
+   */
+  concat(input) {
+    const { mode } = this.options;
+    return input.join(mode === 'word' ? ' ' : '');
+  }
+  /**
+   * Computes the diff between the two input texts and populates the
+   * entries and grouped arrays.
+   */
+  computeDiff() {
+    if (!this.diffRun) {
+      // Get the lines from both texts
+      const { linesA, linesB, maxLen } = this.text2lines();
+      // Loop through each line and compare them
+      for (let i = 0; i < maxLen; i++) {
+        const a = linesA[i] || '';
+        const b = linesB[i] || '';
+        // Perform line diffing
+        this.lineDiff(a, b, i);
+      }
+      // Find groups of adjacent changes
+      this.findGroups();
+      // Set the diff run flag to true
+      this.diffRun = true;
+    }
+  }
+  /**
+   * Compares two lines and records their differences at the configured granularity.
+   *
+   * @param {string} a - Line from the first text
+   * @param {string} b - Line from the second text
+   * @param {number} line - Line number
+   */
+  lineDiff(a, b, line) {
+    const { mode, caseInsensitive } = this.options;
+    const baseLen = Math.max(a.length, b.length);
+    let A = a,
+      B = b;
+    // If case-insensitive mode is enabled, convert both lines to lowercase
+    if (caseInsensitive) (A = a.toLowerCase()), (B = b.toLowerCase());
+    let diffs = [];
+    let delSize = 0,
+      insSize = 0;
+    if (mode === 'line') {
+      // For line mode, compare the entire lines directly
+      if (A !== B) {
+        diffs.push({
+          posA: 0,
+          posB: 0,
+          del: a,
+          ins: b,
+          size: b.length - a.length
+        });
+        delSize = a.length;
+        insSize = b.length;
+      }
+    } else {
+      // For word mode, find precise diffs between tokenized lines
+      diffs = this.preciseDiff(a, A, b, B);
+      // Calculate total sizes of deletions and insertions
+      for (const d of diffs)
+        (delSize += d.del.length), (insSize += d.ins.length);
+    }
+    if (diffs.length) {
+      // Add the diff entry for this line
+      this.entries.push({
+        line,
+        diffs,
+        delSize,
+        insSize,
+        baseLen,
+        totalSize: insSize - delSize,
+        magnitude: this.magnitude(delSize, insSize, baseLen)
+      });
+    }
+  }
+  /**
+   * Finds all minimal diff blocks between two tokenized strings,
+   * returning original text and positions.
+   *
+   * @param {string} a - Original line (case preserved)
+   * @param {string} A - Original line (possibly lowercased)
+   * @param {string} b - Modified line (case preserved)
+   * @param {string} B - Modified line (possibly lowercased)
+   * @returns {DiffEntry[]} - Array of diff entries for this line
+   */
+  preciseDiff(a, A, b, B) {
+    // Helper function to calculate positions of tokens in the original text
+    const posIndex = (t) =>
+      t.reduce(
+        (p, _, i) => (p.push(i ? p[i - 1] + t[i - 1].length + 1 : 0), p),
+        []
+      );
+    // Original and tokenized arrays, their lengths and position arrays
+    const origA = this.tokenize(a);
+    const origB = this.tokenize(b);
+    const tokenA = this.tokenize(A);
+    const tokenB = this.tokenize(B);
+    const lenA = tokenA.length;
+    const lenB = tokenB.length;
+    const posArrA = posIndex(origA);
+    const posArrB = posIndex(origB);
+    // Find all matching blocks (LCS)
+    const matches = [];
+    let ai = 0,
+      bi = 0;
+    while (ai < lenA && bi < lenB) {
+      // If tokens match, find the length of the match
+      if (tokenA[ai] === tokenB[bi]) {
+        let len = 1;
+        // Extend the match as long as tokens continue to match
+        while (
+          ai + len < lenA &&
+          bi + len < lenB &&
+          tokenA[ai + len] === tokenB[bi + len]
+        )
+          len++;
+        matches.push({ ai, bi, len });
+        (ai += len), (bi += len);
+      } else {
+        let found = false;
+        // Look ahead for next sync point (greedy, but avoids long tails)
+        for (let offset = 1; offset <= 3 && !found; offset++) {
+          // Check if the next token in A matches the current token in B
+          if (ai + offset < lenA && tokenA[ai + offset] === tokenB[bi]) {
+            matches.push({ ai: ai + offset, bi, len: 1 });
+            (ai += offset + 1), (bi += 1), (found = true);
+          }
+          // Check if the next token in B matches the current token in A
+          else if (bi + offset < lenB && tokenA[ai] === tokenB[bi + offset]) {
+            matches.push({ ai, bi: bi + offset, len: 1 });
+            (ai += 1), (bi += offset + 1), (found = true);
+          }
+        }
+        // If no match was found, advance both pointers by one
+        if (!found) ai++, bi++;
+      }
+    }
+    // Walk through tokens and emit diffs between matches
+    const diffs = [];
+    let i = 0,
+      j = 0;
+    for (const m of matches) {
+      // If there are unmatched tokens before the match, record them
+      if (i < m.ai || j < m.bi) {
+        // Slice the original arrays to get the unmatched tokens
+        const delArr = origA.slice(i, m.ai);
+        const insArr = origB.slice(j, m.bi);
+        // Push the diff entry for unmatched tokens
+        diffs.push({
+          posA: posArrA[i] ?? 0,
+          posB: posArrB[j] ?? 0,
+          del: this.concat(delArr),
+          ins: this.concat(insArr),
+          size: insArr.join('').length - delArr.join('').length
+        });
+      }
+      // Advance to after the match
+      (i = m.ai + m.len), (j = m.bi + m.len);
+    }
+    // Tail diffs after the last match
+    if (i < lenA || j < lenB) {
+      // Slice the original arrays to get the unmatched tokens
+      const delArr = origA.slice(i);
+      const insArr = origB.slice(j);
+      // Push the diff entry for unmatched tokens at the end
+      diffs.push({
+        posA: posArrA[i] ?? 0,
+        posB: posArrB[j] ?? 0,
+        del: this.concat(delArr),
+        ins: this.concat(insArr),
+        size: insArr.join('').length - delArr.join('').length
+      });
+    }
+    // Remove empty diffs
+    return diffs.filter((d) => d.del.length > 0 || d.ins.length > 0);
+  }
+  /**
+   * Groups adjacent changed lines together, including context lines,
+   * and calculates group metrics.
+   */
+  findGroups() {
+    const { contextLines } = this.options;
+    // Helper function to add a group to the grouped array
+    const addGroup = (group, start, end) => {
+      // Calculate total sizes and base length for the group
+      const [delSize, insSize, totalSize, baseLen] = [
+        'delSize',
+        'insSize',
+        'totalSize',
+        'baseLen'
+      ].map((k) => group.reduce((sum, e) => sum + e[k], 0));
+      // Push the group to the grouped array
+      this.grouped.push({
+        start,
+        end,
+        delSize,
+        insSize,
+        totalSize,
+        line: group[0].line,
+        entries: group,
+        magnitude: this.magnitude(delSize, insSize, baseLen)
+      });
+    };
+    let group = [];
+    let start = 0,
+      end = 0;
+    // Iterate through each diff entry to find groups
+    for (const entry of this.entries) {
+      const s = Math.max(0, entry.line - contextLines);
+      const e = entry.line + contextLines;
+      // If the group is empty or the current entry is adjacent to the last one
+      if (!group.length || s <= end + 1) {
+        // If this is the first entry, set the start position
+        if (!group.length) start = s;
+        end = Math.max(end, e);
+        group.push(entry);
+      } else {
+        // If the group is not empty, finalize it and start a new one
+        addGroup(group, start, end);
+        (group = [entry]), (start = s), (end = e);
+      }
+    }
+    // If there is a remaining group, finalize it
+    if (group.length) addGroup(group, start, end);
+  }
+  /**
+   * Calculates the change magnitude string for a group or line.
+   *
+   * @param {number} del - Number of deleted characters
+   * @param {number} ins - Number of inserted characters
+   * @param {number} baseLen - Base length for normalization
+   * @returns {string} - Magnitude string (e.g. "++-")
+   */
+  magnitude(del, ins, baseLen) {
+    const { maxMagnitudeSymbols } = this.options;
+    const total = del + ins;
+    // If there are no changes or base length is zero, return empty string
+    if (total === 0 || baseLen === 0) return '';
+    // Calculate the length of the magnitude string based on the full length
+    const magLen = Math.min(
+      maxMagnitudeSymbols,
+      Math.max(Math.round((total / baseLen) * maxMagnitudeSymbols), 1)
+    );
+    // Calculate the number of plus and minus symbols
+    const plus = Math.round((ins / total) * magLen);
+    const minus = magLen - plus;
+    // Return the magnitude string with plus and minus symbols
+    return '+'.repeat(plus) + '-'.repeat(minus);
+  }
+  /**
+   * Generates a unified diff output as a string, with optional CLI coloring.
+   *
+   * @param {boolean} cli - If true, use CLI colors; otherwise, ASCII markup
+   * @returns {string} - Unified diff output
+   */
+  output(cli) {
+    const {
+      mode,
+      contextLines,
+      groupedLines,
+      expandLines,
+      showChangeMagnitude,
+      lineBreak
+    } = this.options;
+    // Get the lines and maximum length from the input texts
+    const { linesA, linesB, maxLen } = this.text2lines();
+    const linePad = Math.max(4, maxLen.toString().length);
+    // Helper functions for coloring and formatting (ASCII or CLI colored)
+    const highlight = (s, ansi) => (cli ? `\x1b[${ansi}m${s}\x1b[0m` : s);
+    const cy = (s) => highlight(s, '36');
+    const gy = (s) => highlight(s, '90');
+    const gn = (s) => highlight(s, '32');
+    const rd = (s) => highlight(s, '31');
+    const ye = (s) => highlight(s, '33');
+    const del = (s) => (cli ? `\x1b[37;41m${s}\x1b[31;49m` : `-[${s}]`);
+    const ins = (s) => (cli ? `\x1b[37;42m${s}\x1b[32;49m` : `+[${s}]`);
+    // Function to output a block of lines with optional header
+    const block = (start, end, forced, headerEntry) => {
+      // If there is a header entry, output the header
+      if (headerEntry) header(headerEntry);
+      // Loop through the range and output lines
+      for (let i = start; i <= end; i++) line(i, forced ?? i);
+      out.push('');
+    };
+    // Function to output a header for a group or line
+    const header = (e) => {
+      out.push(
+        `${' '.repeat(linePad)}   ${cy(`@@ -${e.line + 1},${e.delSize} +${e.line + 1},${e.insSize} @@`)} ${showChangeMagnitude ? ye(e.magnitude) : ''}`
+      );
+    };
+    // Function to output a single line with optional diff highlighting
+    const line = (i, forced) => {
+      // If the line exists in either text, output it
+      if (linesA[i] || linesB[i]) {
+        // Find the diff entry for this line, if it exists
+        const entry = this.entries.find((e) => e.line === i);
+        // Format the line number with padding
+        const lineNo = (i + 1).toString().padStart(linePad, ' ');
+        if (entry && forced === i) {
+          // If there is an entry, output the line with diff highlighting
+          out.push(
+            `${lineNo} ${rd(`- ${mark(linesA[i], entry.diffs, 'del')}`)}`
+          );
+          out.push(
+            `${' '.repeat(linePad)} ${gn(`+ ${mark(linesB[i], entry.diffs, 'ins')}`)}`
+          );
+        } else {
+          // If no entry, just output the line without diff (context lines)
+          out.push(`${lineNo}   ${gy(linesA[i])}`);
+        }
+      }
+    };
+    // Function to mark changes in a line based on the diffs
+    const mark = (line, diffs, type) => {
+      // If there are no diffs or the mode is line, return the line as is
+      if (!diffs.length || mode === 'line') return line;
+      let res = '',
+        idx = 0;
+      // Loop through each diff entry and apply the changes
+      for (const d of diffs) {
+        // Get the position and value based on the type
+        const pos = type === 'del' ? d.posA : d.posB;
+        const val = type === 'del' ? d.del : d.ins;
+        // If the value is empty, skip it
+        if (!val) continue;
+        // Add the unchanged part of the line before the change
+        if (pos > idx) res += line.slice(idx, pos);
+        // Add the changed part of the line with appropriate formatting
+        res += type === 'del' ? del(val) : ins(val);
+        idx = pos + val.length;
+      }
+      // Return the marked line with any remaining unchanged part
+      return res + line.slice(idx);
+    };
+    let out = [''];
+    switch (true) {
+      // For expandLines, output the entire file context
+      case expandLines:
+        block(0, maxLen);
+        break;
+      // For groupedLines, output each group with its start and end
+      case groupedLines:
+        for (const group of this.grouped)
+          block(group.start, group.end, undefined, group);
+        break;
+      // For individual lines, output each entry with context lines
+      default:
+        for (const entry of this.entries)
+          block(
+            entry.line - contextLines,
+            entry.line + contextLines,
+            entry.line,
+            entry
+          );
+        break;
+    }
+    // Output the final diff as a string (ASCII or CLI colored)
+    return out.join(lineBreak);
+  }
+  /**
+   * Returns the structured diff as an array of DiffLine objects.
+   *
+   * @returns {DiffLine[]} - Array of line-level diffs
+   */
+  getStructuredDiff() {
+    return this.entries;
+  }
+  /**
+   * Returns the grouped diff as an array of DiffGroup objects.
+   *
+   * @returns {DiffGroup[]} - Array of grouped diffs
+   */
+  getGroupedDiff() {
+    return this.grouped;
+  }
+  /**
+   * Returns the unified diff as a plain ASCII string.
+   *
+   * @returns {string} - Unified diff (ASCII)
+   */
+  getASCIIDiff() {
+    return this.output(false);
+  }
+  /**
+   * Returns the unified diff as a CLI-colored string.
+   *
+   * @returns {string} - Unified diff (CLI colors)
+   */
+  getCLIDiff() {
+    return this.output(true);
+  }
+}
+
+export { DiffChecker };
+//# sourceMappingURL=DiffChecker.js.map