@rio-cloud/rio-uikit 2.5.1 → 3.0.0-beta.1

package/utils/hidePiiData.js

@@ -1,164 +1,129 @@
-const S = "data-pii", A = "data-original-pii", x = "data-obfuscated-pii", T = (e) => {
-  for (let n = e.length - 1; n > 0; n--) {
-    const s = Math.floor(Math.random() * (n + 1)), t = e[n];
-    e[n] = e[s], e[s] = t;
-  }
-}, D = (e) => /[A-Za-z0-9]/.test(e), b = (e) => {
-  const n = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
-  let s = "";
-  for (let t = 0; t < e; t++)
-    s += n.charAt(Math.floor(Math.random() * n.length)).toLocaleLowerCase();
-  return s;
-}, w = (e, n = 6) => e.length >= n ? e : e + b(n - e.length), _ = (e) => {
-  const n = "0123456789";
-  let s = "";
-  for (let t = 0; t < e; t++)
-    s += n.charAt(Math.floor(Math.random() * n.length));
-  return s;
-}, I = (e, n = 6) => e.length >= n ? e : e + _(n - e.length), P = (e) => {
-  const n = e.length, s = e.split(""), t = [], r = [];
-  for (const i of s)
-    D(i) ? t.push(i) : r.push(i);
-  if (t.length === 0 || n >= 2 && t.length === 1)
-    return e;
-  T(t), T(r);
-  const h = Math.max(0, n - 2);
-  if (r.length > h)
-    return e;
-  const a = new Array(n);
-  a[0] = t.pop(), a[n - 1] = t.pop();
-  const l = [];
-  for (let i = 1; i <= n - 2; i++)
-    l.push(i);
-  T(l);
-  let f = 0;
-  for (const i of r)
-    a[l[f++]] = i;
-  for (const i of t)
-    a[l[f++]] = i;
-  return a.join("");
-}, M = (e) => {
-  const [n, s] = e.split("@"), t = n.replace(/[^A-Za-z0-9]/g, ""), r = s.replace(/[^A-Za-z0-9]/g, ""), h = w(t, 6), a = N(h, !1), l = N(r, !1);
-  return `${a}@${l}.${(() => {
-    try {
-      const p = (typeof navigator < "u" && (navigator.languages?.[0] || navigator.language) || "" || "").replace("_", "-");
-      if (!p)
-        return "com";
-      const o = p.split("-");
-      return (o[1] || o[0] || "").slice(0, 2).toLocaleLowerCase() || "com";
-    } catch {
-      return "com";
-    }
-  })()}`;
-}, C = (e) => {
-  const n = e.startsWith("+") && e.slice(1).match(/^\d{1,3}/)?.[0] || "", s = e.replace(/\D/g, ""), t = n ? s.slice(n.length) : s;
-  if (t.length < 4)
-    return e;
-  const r = I(t, 6), h = P(r);
-  let a = 0, l = n.length, f = !!n;
-  return e.replace(/\d/g, (i) => {
-    if (f) {
-      if (l > 0)
-        return l -= 1, l === 0 && (f = !1), i;
-      f = !1;
-    }
-    return h[a++] || "0";
-  });
-}, N = (e, n = !0) => {
-  if (e.length < 2)
-    return e;
-  const s = e.replace(/[^A-Za-z]/g, ""), t = w(s, 6), r = P(t);
-  return n ? r.charAt(0).toUpperCase() + r.slice(1).toLowerCase() : r;
-}, y = (e) => {
-  const n = /(^|[^A-Za-z0-9])(\+?\d(?:[ \t\-()]*\d){6,})(?=$|[^A-Za-z0-9])/g;
-  return e.replace(
-    n,
-    (t, r, h) => r + C(h)
-  ).replace(/\S+/g, (t) => {
-    if (/^[^@]+@[^@]+$/.test(t))
-      return M(t);
-    if (/^\+?[0-9][0-9\s\-()]{3,}$/.test(t))
-      return C(t);
-    if (!/[A-Za-z]/.test(t))
-      return t;
-    const r = t.length < 6 ? t + b(6 - t.length) : t;
-    return N(r);
-  });
-}, v = (e, n) => {
-  const s = e instanceof Element ? [e] : Array.from(e);
-  for (const t of s) {
-    t.setAttribute(S, "hidden");
-    const r = (t.textContent || "").trim();
-    if (t.matches?.("input") || t.tagName === "INPUT") {
-      const o = t, c = o.value || "";
-      if (typeof n == "string" && n.length > 0) {
-        t.setAttribute(A, c), o.value = n, t.setAttribute(x, o.value);
-        continue;
-      }
-      if (t.setAttribute(A, c), c.trim().length > 0) {
-        const d = y(c);
-        d !== c && (o.value = d), t.setAttribute(x, o.value);
-      }
-      continue;
-    }
-    const h = (o, c) => {
-      if (o.children.length === 1) {
-        const g = o.children[0];
-        if (g && g.children.length === 0) {
-          g.textContent = c;
-          return;
-        }
-      }
-      const u = document.createTreeWalker(o, NodeFilter.SHOW_TEXT, null), d = [];
-      let m = u.nextNode();
-      for (; m; ) {
-        const g = m;
-        (g.nodeValue || "").trim().length > 0 && d.push(g), m = u.nextNode();
-      }
-      if (d.length === 0) {
-        o.textContent = c;
-        return;
-      }
-      d[0].nodeValue = c;
-      for (let g = 1; g < d.length; g++)
-        d[g].nodeValue = "";
-    };
-    if (typeof n == "string" && n.length > 0) {
-      r && t.setAttribute(A, r), h(t, n), t.setAttribute(x, (t.textContent || "").trim());
-      continue;
-    }
-    let a = !1;
-    const l = document.createTreeWalker(t, NodeFilter.SHOW_TEXT, null);
-    let f = l.nextNode();
-    for (; f; ) {
-      const o = f, c = String(o.textContent || "");
-      if (/^\s*$/.test(c)) {
-        const m = l.nextNode();
-        o.remove(), f = m;
-        continue;
-      }
-      const u = c.replace(/\s+/g, " ");
-      if (u.trim().length > 0) {
-        const m = y(u);
-        m !== u && (o.textContent = m, a = !0);
-      }
-      f = l.nextNode();
-    }
-    const i = Array.from(t.childNodes).filter((o) => o.nodeType === Node.TEXT_NODE);
-    for (let o = 0; o < i.length - 1; o++) {
-      const c = i[o], u = i[o + 1];
-      if (c.textContent?.trim() && u.textContent?.trim()) {
-        const d = document.createTextNode(" ");
-        c.parentNode?.insertBefore(d, u);
-      }
-    }
-    const p = (t.textContent || "").trim();
-    a && p && (t.setAttribute(x, p), r && t.setAttribute("data-original-pii", r));
-  }
+//#region src/utils/hidePiiData.ts
+var e = "data-original-pii", t = "data-obfuscated-pii", n = (e) => {
+	for (let t = e.length - 1; t > 0; t--) {
+		let n = Math.floor(Math.random() * (t + 1)), r = e[t];
+		e[t] = e[n], e[n] = r;
+	}
+}, r = (e) => /[A-Za-z0-9]/.test(e), i = (e) => {
+	let t = "";
+	for (let n = 0; n < e; n++) t += "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz".charAt(Math.floor(Math.random() * 52)).toLocaleLowerCase();
+	return t;
+}, a = (e, t = 6) => e.length >= t ? e : e + i(t - e.length), o = (e) => {
+	let t = "";
+	for (let n = 0; n < e; n++) t += "0123456789".charAt(Math.floor(Math.random() * 10));
+	return t;
+}, s = (e, t = 6) => e.length >= t ? e : e + o(t - e.length), c = (e) => {
+	let t = e.length, i = e.split(""), a = [], o = [];
+	for (let e of i) r(e) ? a.push(e) : o.push(e);
+	if (a.length === 0 || t >= 2 && a.length === 1) return e;
+	n(a), n(o);
+	let s = Math.max(0, t - 2);
+	if (o.length > s) return e;
+	let c = Array(t);
+	c[0] = a.pop(), c[t - 1] = a.pop();
+	let l = [];
+	for (let e = 1; e <= t - 2; e++) l.push(e);
+	n(l);
+	let u = 0;
+	for (let e of o) c[l[u++]] = e;
+	for (let e of a) c[l[u++]] = e;
+	return c.join("");
+}, l = (e) => {
+	let [t, n] = e.split("@"), r = t.replace(/[^A-Za-z0-9]/g, ""), i = n.replace(/[^A-Za-z0-9]/g, "");
+	return `${d(a(r, 6), !1)}@${d(i, !1)}.${(() => {
+		try {
+			let e = (typeof navigator < "u" && (navigator.languages?.[0] || navigator.language) || "").replace("_", "-");
+			if (!e) return "com";
+			let t = e.split("-");
+			return (t[1] || t[0] || "").slice(0, 2).toLocaleLowerCase() || "com";
+		} catch {
+			return "com";
+		}
+	})()}`;
+}, u = (e) => {
+	let t = e.startsWith("+") && e.slice(1).match(/^\d{1,3}/)?.[0] || "", n = e.replace(/\D/g, ""), r = t ? n.slice(t.length) : n;
+	if (r.length < 4) return e;
+	let i = c(s(r, 6)), a = 0, o = t.length, l = !!t;
+	return e.replace(/\d/g, (e) => {
+		if (l) {
+			if (o > 0) return --o, o === 0 && (l = !1), e;
+			l = !1;
+		}
+		return i[a++] || "0";
+	});
+}, d = (e, t = !0) => {
+	if (e.length < 2) return e;
+	let n = c(a(e.replace(/[^A-Za-z]/g, ""), 6));
+	return t ? n.charAt(0).toUpperCase() + n.slice(1).toLowerCase() : n;
+}, f = (e) => e.replace(/(^|[^A-Za-z0-9])(\+?\d(?:[ \t\-()]*\d){6,})(?=$|[^A-Za-z0-9])/g, (e, t, n) => t + u(n)).replace(/\S+/g, (e) => /^[^@]+@[^@]+$/.test(e) ? l(e) : /^\+?[0-9][0-9\s\-()]{3,}$/.test(e) ? u(e) : /[A-Za-z]/.test(e) ? d(e.length < 6 ? e + i(6 - e.length) : e) : e), p = (n, r) => {
+	let i = n instanceof Element ? [n] : Array.from(n);
+	for (let n of i) {
+		n.setAttribute("data-pii", "hidden");
+		let i = (n.textContent || "").trim();
+		if (n.matches?.("input") || n.tagName === "INPUT") {
+			let i = n, a = i.value || "";
+			if (typeof r == "string" && r.length > 0) {
+				n.setAttribute(e, a), i.value = r, n.setAttribute(t, i.value);
+				continue;
+			}
+			if (n.setAttribute(e, a), a.trim().length > 0) {
+				let e = f(a);
+				e !== a && (i.value = e), n.setAttribute(t, i.value);
+			}
+			continue;
+		}
+		let a = (e, t) => {
+			if (e.children.length === 1) {
+				let n = e.children[0];
+				if (n && n.children.length === 0) {
+					n.textContent = t;
+					return;
+				}
+			}
+			let n = document.createTreeWalker(e, NodeFilter.SHOW_TEXT, null), r = [], i = n.nextNode();
+			for (; i;) {
+				let e = i;
+				(e.nodeValue || "").trim().length > 0 && r.push(e), i = n.nextNode();
+			}
+			if (r.length === 0) {
+				e.textContent = t;
+				return;
+			}
+			r[0].nodeValue = t;
+			for (let e = 1; e < r.length; e++) r[e].nodeValue = "";
+		};
+		if (typeof r == "string" && r.length > 0) {
+			i && n.setAttribute(e, i), a(n, r), n.setAttribute(t, (n.textContent || "").trim());
+			continue;
+		}
+		let o = !1, s = document.createTreeWalker(n, NodeFilter.SHOW_TEXT, null), c = s.nextNode();
+		for (; c;) {
+			let e = c, t = String(e.textContent || "");
+			if (/^\s*$/.test(t)) {
+				let t = s.nextNode();
+				e.remove(), c = t;
+				continue;
+			}
+			let n = t.replace(/\s+/g, " ");
+			if (n.trim().length > 0) {
+				let t = f(n);
+				t !== n && (e.textContent = t, o = !0);
+			}
+			c = s.nextNode();
+		}
+		let l = Array.from(n.childNodes).filter((e) => e.nodeType === Node.TEXT_NODE);
+		for (let e = 0; e < l.length - 1; e++) {
+			let t = l[e], n = l[e + 1];
+			if (t.textContent?.trim() && n.textContent?.trim()) {
+				let e = document.createTextNode(" ");
+				t.parentNode?.insertBefore(e, n);
+			}
+		}
+		let u = (n.textContent || "").trim();
+		o && u && (n.setAttribute(t, u), i && n.setAttribute("data-original-pii", i));
+	}
 };
-export {
-  v as hidePiiData,
-  y as shufflePii,
-  N as shuffleText
-};
-//# sourceMappingURL=hidePiiData.js.map
+//#endregion
+export { p as hidePiiData, f as shufflePii, d as shuffleText };
+
+//# sourceMappingURL=hidePiiData.js.map

package/utils/hidePiiData.js.map

@@ -1 +1 @@
-{"version":3,"file":"hidePiiData.js","sources":["../../src/utils/hidePiiData.ts"],"sourcesContent":["/****\n * hidePiiData.ts\n *\n * Purpose\n * -------\n * Utilities for anonymizing Personally Identifiable Information (PII) in rendered DOM content.\n * The main entry point is `hidePiiData`, which shuffles visible text inside a target element.\n *\n * Integration / Activation\n * -----------------------\n * Activation can be toggled with **Ctrl+Shift+U / Cmd+Shift+U**, or by setting the\n * `<html>` attribute `data-hide-pii=\"shuffle\"`. When activated, new or changed content\n * marked with `data-pii=\"visible\"` is processed by this module.\n * This file does not attach observers by itself. It only exposes pure DOM utilities.\n *\n * High level behavior\n * -------------------\n * 1. Tokenize text on whitespace while preserving the original whitespace.\n * 2. For email tokens, clean punctuation, pad each part to at least six characters,\n *    shuffle both parts independently, and rejoin with `@`.\n * 3. For normal tokens shorter than six characters, pad with random alphanumerics before shuffling.\n * 4. Preserve capitalization pattern for simple Name like tokens (e.g. `Alice`) after shuffling.\n *\n * Data attributes used\n * --------------------\n * - `data-pii=\"visible\"` marks elements that should be anonymized.\n * - `data-pii=\"hidden\"` is written to elements that have already been processed to help external code introspect state.\n * - `data-hide-pii=\"shuffle\"` on `<html>` is used by an external observer to decide when to call `hidePiiData`.\n */\n\nconst ATTR_DATA_PII = 'data-pii';\nconst ATTR_ORIGINAL_PII = 'data-original-pii';\nconst ATTR_OBFUSCATED_PII = 'data-obfuscated-pii';\n\n/**\n * In place Fisher Yates shuffle.\n * Randomizes the order of the given array using `Math.random()`.\n * This is sufficient for UI anonymization but is not cryptographically secure.\n */\nconst fyShuffle = <T>(arr: T[]): void => {\n    for (let i = arr.length - 1; i > 0; i--) {\n        const j = Math.floor(Math.random() * (i + 1));\n        const tmp = arr[i];\n        arr[i] = arr[j];\n        arr[j] = tmp;\n    }\n};\n\n/** Returns true if (A-Z, a-z, 0-9). */\nconst isTextOrNumber = (el: string): boolean => /[A-Za-z0-9]/.test(el);\n\n/**\n * Generate a random ASCII alphanumeric string of length `n`.\n * Used to pad very short tokens before shuffling to increase anonymity.\n */\nconst addRandomCharacter = (el: number): string => {\n    const chars = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz';\n    let out = '';\n    for (let i = 0; i < el; i++) {\n        out += chars.charAt(Math.floor(Math.random() * chars.length)).toLocaleLowerCase();\n    }\n    return out;\n};\n\n/**\n * Ensure a minimum length by appending random alphanumerics when `s` is shorter than `minLen`.\n * Defaults to 6 which balances privacy and UI density.\n */\nconst ensureMinLength = (el: string, minLen = 6): string => {\n    if (el.length >= minLen) {\n        return el;\n    }\n    return el + addRandomCharacter(minLen - el.length);\n};\n\n/** Generate a random numeric string of length `n`. */\nconst randomDigits = (n: number): string => {\n    const digits = '0123456789';\n    let out = '';\n    for (let i = 0; i < n; i++) {\n        out += digits.charAt(Math.floor(Math.random() * digits.length));\n    }\n    return out;\n};\n\n/** Ensure a minimum length by appending random digits (for phone numbers). */\nconst ensureMinDigits = (s: string, minLen = 6): string => {\n    if (s.length >= minLen) {\n        return s;\n    }\n    return s + randomDigits(minLen - s.length);\n};\n\n/**\n * Shuffle a token while trying to keep an alphanumeric character at both boundaries.\n *\n * Why boundaries matter\n * ---------------------\n * Many UI layouts expect words to begin and end with letters or digits. By forcing\n * alphanumeric characters to the first and last positions when possible, we avoid\n * odd leading punctuation or trailing punctuation that could break alignment or\n * cause misleading visual cues.\n *\n * Rules\n * -----\n * - If there are no alphanumerics, the original string is returned unchanged.\n * - If there is only one alphanumeric and length is at least 2, it also returns unchanged,\n *   since we cannot satisfy both boundaries.\n * - Non alphanumeric characters are placed only in interior positions.\n */\nconst shuffle = (el: string): string => {\n    const n = el.length;\n    const chars = el.split('');\n\n    // Separate alphanumeric and non-alphanumeric characters\n    const alnums: string[] = [];\n    const nonAlnums: string[] = [];\n\n    for (const char of chars) {\n        if (isTextOrNumber(char)) {\n            alnums.push(char);\n        } else {\n            nonAlnums.push(char);\n        }\n    }\n\n    // If we cannot satisfy the boundary rule, keep original\n    if (alnums.length === 0) {\n        return el;\n    }\n\n    if (n >= 2 && alnums.length === 1) {\n        return el; // cannot put alnum at both ends\n    }\n\n    fyShuffle(alnums);\n    fyShuffle(nonAlnums);\n\n    // If there are more non alphanumerics than interior slots, bail out to keep boundaries valid\n    const interiorSlots = Math.max(0, n - 2);\n    if (nonAlnums.length > interiorSlots) {\n        return el;\n    }\n\n    // Build output with alnum at boundaries\n    const out: string[] = new Array(n);\n    out[0] = alnums.pop() as string; // left boundary alnum (safe due to earlier guard)\n    out[n - 1] = alnums.pop() as string; // right boundary alnum\n\n    // Fill interior positions randomly with remaining characters\n    const interiorPositions: number[] = [];\n    for (let i = 1; i <= n - 2; i++) {\n        interiorPositions.push(i);\n    }\n    fyShuffle(interiorPositions);\n\n    let k = 0;\n    for (const char of nonAlnums) {\n        out[interiorPositions[k++]] = char; // place all non-alnums inside\n    }\n    for (const char of alnums) {\n        out[interiorPositions[k++]] = char; // then remaining alnums\n    }\n\n    return out.join('');\n};\n\n/**\n * Shuffle an email address in a privacy aware way.\n *\n * Steps\n * -----\n * 1. Split on `@` into local and domain.\n * 2. Remove any non alphanumeric characters from both parts (drop dots and dashes).\n * 3. Pad each part to a minimum of six characters to avoid very short outputs.\n * 4. Shuffle the local and domain parts independently and rejoin with `@`.\n *\n * Rationale\n * ---------\n * Emails often contain structure that makes simple shuffling ineffective. By stripping\n * punctuation and enforcing a minimum length, we reduce the chance of hinting at the\n * original identity while still returning something that looks like an email.\n */\nconst shuffleEmail = (email: string): string => {\n    const [local, domain] = email.split('@');\n    // Remove all non-alphanumeric characters from both parts\n    const cleanName = local.replace(/[^A-Za-z0-9]/g, '');\n    const cleanDomain = domain.replace(/[^A-Za-z0-9]/g, '');\n    const paddedName = ensureMinLength(cleanName, 6);\n    const shuffledName = shuffleText(paddedName, false);\n    const shuffledDomain = shuffleText(cleanDomain, false);\n\n    /**\n     * Get a two-letter locale suffix based on the user's browser locale.\n     * Prefers the region subtag (e.g., \"en-US\" -> \"US\"). Falls back to the language\n     * subtag (e.g., \"de\" -> \"DE\"). Returns \"XX\" if unavailable.\n     */\n    const getLocaleSuffix = (): string => {\n        try {\n            const langRaw =\n                typeof navigator !== 'undefined' ? navigator.languages?.[0] || navigator.language || '' : '';\n            const lang = (langRaw || '').replace('_', '-');\n            if (!lang) {\n                return 'com';\n            }\n            const parts = lang.split('-');\n            const region = parts[1] || parts[0];\n            const code = (region || '').slice(0, 2).toLocaleLowerCase();\n            return code || 'com';\n        } catch {\n            return 'com';\n        }\n    };\n\n    return `${shuffledName}@${shuffledDomain}.${getLocaleSuffix()}`;\n};\n\n/**\n * Shuffle a phone number while preserving its structure.\n * Removes non-digits, pads if too short, shuffles digits, then reinserts formatting.\n */\nconst shufflePhone = (phone: string): string => {\n    const countryPrefix = phone.startsWith('+') ? phone.slice(1).match(/^\\d{1,3}/)?.[0] || '' : '';\n\n    // Extract all digits and split into country code vs. rest\n    const allDigits = phone.replace(/\\D/g, '');\n    const restDigits = countryPrefix ? allDigits.slice(countryPrefix.length) : allDigits;\n\n    if (restDigits.length < 4) {\n        return phone; // too short to anonymize meaningfully beyond the country code\n    }\n\n    // Pad and shuffle only the rest (not the country code)\n    const paddedRest = ensureMinDigits(restDigits, 6);\n    const shuffledRest = shuffle(paddedRest);\n\n    // Reinsert digits into original format:\n    // - Keep the first `countryPrefix.length` digits after '+' unchanged\n    // - Replace subsequent digits with shuffledRest\n    let i = 0; // index into shuffledRest\n    let prefixLeft = countryPrefix.length;\n    let inPrefixBlock = !!countryPrefix; // true if we saw leading '+' and have prefix digits to preserve\n\n    return phone.replace(/\\d/g, phoneNumber => {\n        if (inPrefixBlock) {\n            // We are preserving digits immediately after the leading '+'\n            // Once we consume `prefixLeft` digits, we stop preserving\n            if (prefixLeft > 0) {\n                prefixLeft -= 1;\n                if (prefixLeft === 0) {\n                    inPrefixBlock = false;\n                }\n                return phoneNumber; // keep country code digit as-is\n            }\n            inPrefixBlock = false;\n        }\n        // Replace with next shuffled digit (fallback '0' if exhausted, though length should suffice)\n        return shuffledRest[i++] || '0';\n    });\n};\n\n/**\n * Shuffle text while preserving whitespace.\n *\n * Behavior\n * --------\n * - Tokenization uses `\\S+` to process non whitespace runs and preserves the original whitespace.\n * - Email like tokens are handled by `shuffleEmail`.\n * - Non email tokens shorter than six characters are padded with random alphanumerics before shuffling.\n * - For simple Name like tokens (regex `^[A-Z][a-z]+$`), capitalization is preserved after shuffling.\n */\nexport const shuffleText = (str: string, preserveCase = true): string => {\n    if (str.length < 2) {\n        return str;\n    }\n\n    const lettersOnly = str.replace(/[^A-Za-z]/g, '');\n    const paddedToken = ensureMinLength(lettersOnly, 6);\n    const shuffled = shuffle(paddedToken);\n\n    if (preserveCase) {\n        return shuffled.charAt(0).toUpperCase() + shuffled.slice(1).toLowerCase();\n    }\n\n    return shuffled;\n};\n\nexport const shufflePii = (text: string): string => {\n    // First pass: handle phone numbers that may span multiple tokens (spaces, dashes, parentheses)\n    const phoneSeq = /(^|[^A-Za-z0-9])(\\+?\\d(?:[ \\t\\-()]*\\d){6,})(?=$|[^A-Za-z0-9])/g;\n    const withPhonesShuffled = text.replace(\n        phoneSeq,\n        (_m: string, pre: string, num: string) => pre + shufflePhone(num)\n    );\n\n    // Second pass: token-wise processing for remaining tokens\n    return withPhonesShuffled.replace(/\\S+/g, (token: string): string => {\n        // Email detected: delegate to email specific logic\n        if (/^[^@]+@[^@]+$/.test(token)) {\n            return shuffleEmail(token);\n        }\n\n        // Phone number detected (single-token formats): delegate to phone logic\n        if (/^\\+?[0-9][0-9\\s\\-()]{3,}$/.test(token)) {\n            return shufflePhone(token);\n        }\n\n        // If the token has no letters at all, leave it unchanged (avoid turning digits into letters)\n        if (!/[A-Za-z]/.test(token)) {\n            return token;\n        }\n\n        // Enforce a minimum token length for short text tokens\n        const paddedToken = token.length < 6 ? token + addRandomCharacter(6 - token.length) : token;\n        const shuffled = shuffleText(paddedToken);\n        return shuffled;\n    });\n};\n\n/**\n * Shuffle text nodes or input values inside the provided element(s).\n *\n * Parameters\n * ----------\n * - `target`: either a single `Element` or a `NodeListOf<Element>`.\n * - `forceResult`: optional string to override output directly.\n *\n * How it works\n * ------------\n * - Marks each processed element with `data-pii=\"hidden\"`.\n * - If the element is an `<input>`, it shuffles the `value` string and writes it back.\n * - For non input elements, it walks text nodes with a `TreeWalker` and replaces the node values\n *   with their shuffled variants.\n *\n * Performance notes\n * -----------------\n * - Work is proportional to the number of text nodes in `target`.\n * - Avoid calling this repeatedly on large subtrees without batching.\n */\nexport const hidePiiData = (target: Element | NodeListOf<Element>, forceResult?: string): void => {\n    const elements: Element[] = target instanceof Element ? [target] : Array.from(target);\n\n    for (const el of elements) {\n        // Mark the element as processed so other parts of the app can detect its state\n        el.setAttribute(ATTR_DATA_PII, 'hidden');\n\n        const beforeText = (el.textContent || '').trim();\n\n        // If the selected element is an <input>, shuffle its value instead of text nodes\n        if (el.matches?.('input') || el.tagName === 'INPUT') {\n            const input = el as HTMLInputElement;\n            const val = input.value || '';\n\n            if (typeof forceResult === 'string' && forceResult.length > 0) {\n                el.setAttribute(ATTR_ORIGINAL_PII, val);\n                input.value = forceResult;\n                el.setAttribute(ATTR_OBFUSCATED_PII, input.value);\n                continue;\n            }\n\n            el.setAttribute(ATTR_ORIGINAL_PII, val);\n            const trimmed = val.trim();\n\n            if (trimmed.length > 0) {\n                const shuffled = shufflePii(val);\n                if (shuffled !== val) {\n                    input.value = shuffled;\n                }\n                el.setAttribute(ATTR_OBFUSCATED_PII, input.value);\n            }\n            continue; // skip text-node processing for inputs\n        }\n\n        // Helper: safely apply a forced text replacement without destroying markup\n        const applyForcedText = (root: Element, value: string): void => {\n            // Case 1: Exactly one element child that itself has no element children\n            // e.g. <td><span>Text</span></td> -> replace span textContent only\n            if (root.children.length === 1) {\n                const onlyChild = root.children[0] as Element;\n                if (onlyChild && onlyChild.children.length === 0) {\n                    onlyChild.textContent = value;\n                    return;\n                }\n            }\n\n            // Case 2: Replace text nodes directly while preserving structure\n            const walker = document.createTreeWalker(root, NodeFilter.SHOW_TEXT, null);\n            const textNodes: Text[] = [];\n            let n = walker.nextNode();\n            while (n) {\n                const t = n as Text;\n                if ((t.nodeValue || '').trim().length > 0) {\n                    textNodes.push(t);\n                }\n                n = walker.nextNode();\n            }\n\n            if (textNodes.length === 0) {\n                // As a last resort, fall back to setting textContent (no visible text nodes found)\n                root.textContent = value;\n                return;\n            }\n\n            // Put the forced value into the first non-empty text node,\n            // and clear the remainder to avoid duplicated content\n            textNodes[0].nodeValue = value;\n            for (let i = 1; i < textNodes.length; i++) {\n                textNodes[i].nodeValue = '';\n            }\n        };\n\n        if (typeof forceResult === 'string' && forceResult.length > 0) {\n            if (beforeText) {\n                el.setAttribute(ATTR_ORIGINAL_PII, beforeText);\n            }\n            applyForcedText(el, forceResult);\n            el.setAttribute(ATTR_OBFUSCATED_PII, (el.textContent || '').trim());\n            continue;\n        }\n\n        let anyTextChanged = false;\n\n        // Walk only text nodes to avoid touching markup and attributes\n        const walker = document.createTreeWalker(el, NodeFilter.SHOW_TEXT, null);\n        let node = walker.nextNode();\n\n        while (node) {\n            const txtNode = node as Text;\n            const original = String(txtNode.textContent || '');\n\n            // Whitespace fix 1/2: If the text node contains only whitespace, remove it entirely\n            if (/^\\s*$/.test(original)) {\n                const nextNode = walker.nextNode();\n                txtNode.remove();\n                node = nextNode;\n                continue;\n            }\n\n            // Normalize all whitespace in non-empty text nodes to a single space\n            const normalized = original.replace(/\\s+/g, ' ');\n            const trimmed = normalized.trim();\n\n            if (trimmed.length > 0) {\n                const shuffled = shufflePii(normalized);\n                if (shuffled !== normalized) {\n                    txtNode.textContent = shuffled;\n                    anyTextChanged = true;\n                }\n            }\n            node = walker.nextNode();\n        }\n\n        // Whitespace fix 2/2: Restore spacing between adjacent text nodes\n        const directTextNodes = Array.from(el.childNodes).filter(n => n.nodeType === Node.TEXT_NODE);\n        for (let i = 0; i < directTextNodes.length - 1; i++) {\n            const current = directTextNodes[i] as Text;\n            const next = directTextNodes[i + 1] as Text;\n            if (current.textContent?.trim() && next.textContent?.trim()) {\n                const spacer = document.createTextNode(' ');\n                current.parentNode?.insertBefore(spacer, next);\n            }\n        }\n\n        const currentText = (el.textContent || '').trim();\n        if (anyTextChanged && currentText) {\n            el.setAttribute(ATTR_OBFUSCATED_PII, currentText);\n\n            if (beforeText) {\n                el.setAttribute('data-original-pii', beforeText);\n            }\n        }\n    }\n};\n"],"names":["ATTR_DATA_PII","ATTR_ORIGINAL_PII","ATTR_OBFUSCATED_PII","fyShuffle","arr","i","j","tmp","isTextOrNumber","el","addRandomCharacter","chars","out","ensureMinLength","minLen","randomDigits","n","digits","ensureMinDigits","s","shuffle","alnums","nonAlnums","char","interiorSlots","interiorPositions","k","shuffleEmail","email","local","domain","cleanName","cleanDomain","paddedName","shuffledName","shuffleText","shuffledDomain","lang","parts","shufflePhone","phone","countryPrefix","allDigits","restDigits","paddedRest","shuffledRest","prefixLeft","inPrefixBlock","phoneNumber","str","preserveCase","lettersOnly","paddedToken","shuffled","shufflePii","text","phoneSeq","_m","pre","num","token","hidePiiData","target","forceResult","elements","beforeText","input","val","applyForcedText","root","value","onlyChild","walker","textNodes","t","anyTextChanged","node","txtNode","original","nextNode","normalized","directTextNodes","current","next","spacer","currentText"],"mappings":"AA8BA,MAAMA,IAAgB,YAChBC,IAAoB,qBACpBC,IAAsB,uBAOtBC,IAAY,CAAIC,MAAmB;AACrC,WAASC,IAAID,EAAI,SAAS,GAAGC,IAAI,GAAGA,KAAK;AACrC,UAAMC,IAAI,KAAK,MAAM,KAAK,YAAYD,IAAI,EAAE,GACtCE,IAAMH,EAAIC,CAAC;AACjB,IAAAD,EAAIC,CAAC,IAAID,EAAIE,CAAC,GACdF,EAAIE,CAAC,IAAIC;AAAA,EACb;AACJ,GAGMC,IAAiB,CAACC,MAAwB,cAAc,KAAKA,CAAE,GAM/DC,IAAqB,CAACD,MAAuB;AAC/C,QAAME,IAAQ;AACd,MAAIC,IAAM;AACV,WAASP,IAAI,GAAGA,IAAII,GAAIJ;AACpB,IAAAO,KAAOD,EAAM,OAAO,KAAK,MAAM,KAAK,OAAA,IAAWA,EAAM,MAAM,CAAC,EAAE,kBAAA;AAElE,SAAOC;AACX,GAMMC,IAAkB,CAACJ,GAAYK,IAAS,MACtCL,EAAG,UAAUK,IACNL,IAEJA,IAAKC,EAAmBI,IAASL,EAAG,MAAM,GAI/CM,IAAe,CAACC,MAAsB;AACxC,QAAMC,IAAS;AACf,MAAIL,IAAM;AACV,WAASP,IAAI,GAAGA,IAAIW,GAAGX;AACnB,IAAAO,KAAOK,EAAO,OAAO,KAAK,MAAM,KAAK,OAAA,IAAWA,EAAO,MAAM,CAAC;AAElE,SAAOL;AACX,GAGMM,IAAkB,CAACC,GAAWL,IAAS,MACrCK,EAAE,UAAUL,IACLK,IAEJA,IAAIJ,EAAaD,IAASK,EAAE,MAAM,GAoBvCC,IAAU,CAACX,MAAuB;AACpC,QAAM,IAAIA,EAAG,QACPE,IAAQF,EAAG,MAAM,EAAE,GAGnBY,IAAmB,CAAA,GACnBC,IAAsB,CAAA;AAE5B,aAAWC,KAAQZ;AACf,IAAIH,EAAee,CAAI,IACnBF,EAAO,KAAKE,CAAI,IAEhBD,EAAU,KAAKC,CAAI;AAS3B,MAJIF,EAAO,WAAW,KAIlB,KAAK,KAAKA,EAAO,WAAW;AAC5B,WAAOZ;AAGX,EAAAN,EAAUkB,CAAM,GAChBlB,EAAUmB,CAAS;AAGnB,QAAME,IAAgB,KAAK,IAAI,GAAG,IAAI,CAAC;AACvC,MAAIF,EAAU,SAASE;AACnB,WAAOf;AAIX,QAAMG,IAAgB,IAAI,MAAM,CAAC;AACjC,EAAAA,EAAI,CAAC,IAAIS,EAAO,IAAA,GAChBT,EAAI,IAAI,CAAC,IAAIS,EAAO,IAAA;AAGpB,QAAMI,IAA8B,CAAA;AACpC,WAAS,IAAI,GAAG,KAAK,IAAI,GAAG;AACxB,IAAAA,EAAkB,KAAK,CAAC;AAE5B,EAAAtB,EAAUsB,CAAiB;AAE3B,MAAIC,IAAI;AACR,aAAWH,KAAQD;AACf,IAAAV,EAAIa,EAAkBC,GAAG,CAAC,IAAIH;AAElC,aAAWA,KAAQF;AACf,IAAAT,EAAIa,EAAkBC,GAAG,CAAC,IAAIH;AAGlC,SAAOX,EAAI,KAAK,EAAE;AACtB,GAkBMe,IAAe,CAACC,MAA0B;AAC5C,QAAM,CAACC,GAAOC,CAAM,IAAIF,EAAM,MAAM,GAAG,GAEjCG,IAAYF,EAAM,QAAQ,iBAAiB,EAAE,GAC7CG,IAAcF,EAAO,QAAQ,iBAAiB,EAAE,GAChDG,IAAapB,EAAgBkB,GAAW,CAAC,GACzCG,IAAeC,EAAYF,GAAY,EAAK,GAC5CG,IAAiBD,EAAYH,GAAa,EAAK;AAwBrD,SAAO,GAAGE,CAAY,IAAIE,CAAc,KAjBhB,MAAc;AAClC,QAAI;AAGA,YAAMC,KADF,OAAO,YAAc,QAAc,UAAU,YAAY,CAAC,KAAK,UAAU,aAAY,MAChE,IAAI,QAAQ,KAAK,GAAG;AAC7C,UAAI,CAACA;AACD,eAAO;AAEX,YAAMC,IAAQD,EAAK,MAAM,GAAG;AAG5B,cAFeC,EAAM,CAAC,KAAKA,EAAM,CAAC,KACV,IAAI,MAAM,GAAG,CAAC,EAAE,kBAAA,KACzB;AAAA,IACnB,QAAQ;AACJ,aAAO;AAAA,IACX;AAAA,EACJ,IAE6D;AACjE,GAMMC,IAAe,CAACC,MAA0B;AAC5C,QAAMC,IAAgBD,EAAM,WAAW,GAAG,KAAIA,EAAM,MAAM,CAAC,EAAE,MAAM,UAAU,IAAI,CAAC,KAAK,IAGjFE,IAAYF,EAAM,QAAQ,OAAO,EAAE,GACnCG,IAAaF,IAAgBC,EAAU,MAAMD,EAAc,MAAM,IAAIC;AAE3E,MAAIC,EAAW,SAAS;AACpB,WAAOH;AAIX,QAAMI,IAAa1B,EAAgByB,GAAY,CAAC,GAC1CE,IAAezB,EAAQwB,CAAU;AAKvC,MAAIvC,IAAI,GACJyC,IAAaL,EAAc,QAC3BM,IAAgB,CAAC,CAACN;AAEtB,SAAOD,EAAM,QAAQ,OAAO,CAAAQ,MAAe;AACvC,QAAID,GAAe;AAGf,UAAID,IAAa;AACb,eAAAA,KAAc,GACVA,MAAe,MACfC,IAAgB,KAEbC;AAEX,MAAAD,IAAgB;AAAA,IACpB;AAEA,WAAOF,EAAaxC,GAAG,KAAK;AAAA,EAChC,CAAC;AACL,GAYa8B,IAAc,CAACc,GAAaC,IAAe,OAAiB;AACrE,MAAID,EAAI,SAAS;AACb,WAAOA;AAGX,QAAME,IAAcF,EAAI,QAAQ,cAAc,EAAE,GAC1CG,IAAcvC,EAAgBsC,GAAa,CAAC,GAC5CE,IAAWjC,EAAQgC,CAAW;AAEpC,SAAIF,IACOG,EAAS,OAAO,CAAC,EAAE,gBAAgBA,EAAS,MAAM,CAAC,EAAE,YAAA,IAGzDA;AACX,GAEaC,IAAa,CAACC,MAAyB;AAEhD,QAAMC,IAAW;AAOjB,SAN2BD,EAAK;AAAA,IAC5BC;AAAA,IACA,CAACC,GAAYC,GAAaC,MAAgBD,IAAMnB,EAAaoB,CAAG;AAAA,EAAA,EAI1C,QAAQ,QAAQ,CAACC,MAA0B;AAEjE,QAAI,gBAAgB,KAAKA,CAAK;AAC1B,aAAOjC,EAAaiC,CAAK;AAI7B,QAAI,4BAA4B,KAAKA,CAAK;AACtC,aAAOrB,EAAaqB,CAAK;AAI7B,QAAI,CAAC,WAAW,KAAKA,CAAK;AACtB,aAAOA;AAIX,UAAMR,IAAcQ,EAAM,SAAS,IAAIA,IAAQlD,EAAmB,IAAIkD,EAAM,MAAM,IAAIA;AAEtF,WADiBzB,EAAYiB,CAAW;AAAA,EAE5C,CAAC;AACL,GAsBaS,IAAc,CAACC,GAAuCC,MAA+B;AAC9F,QAAMC,IAAsBF,aAAkB,UAAU,CAACA,CAAM,IAAI,MAAM,KAAKA,CAAM;AAEpF,aAAWrD,KAAMuD,GAAU;AAEvB,IAAAvD,EAAG,aAAaT,GAAe,QAAQ;AAEvC,UAAMiE,KAAcxD,EAAG,eAAe,IAAI,KAAA;AAG1C,QAAIA,EAAG,UAAU,OAAO,KAAKA,EAAG,YAAY,SAAS;AACjD,YAAMyD,IAAQzD,GACR0D,IAAMD,EAAM,SAAS;AAE3B,UAAI,OAAOH,KAAgB,YAAYA,EAAY,SAAS,GAAG;AAC3D,QAAAtD,EAAG,aAAaR,GAAmBkE,CAAG,GACtCD,EAAM,QAAQH,GACdtD,EAAG,aAAaP,GAAqBgE,EAAM,KAAK;AAChD;AAAA,MACJ;AAKA,UAHAzD,EAAG,aAAaR,GAAmBkE,CAAG,GACtBA,EAAI,KAAA,EAER,SAAS,GAAG;AACpB,cAAMd,IAAWC,EAAWa,CAAG;AAC/B,QAAId,MAAac,MACbD,EAAM,QAAQb,IAElB5C,EAAG,aAAaP,GAAqBgE,EAAM,KAAK;AAAA,MACpD;AACA;AAAA,IACJ;AAGA,UAAME,IAAkB,CAACC,GAAeC,MAAwB;AAG5D,UAAID,EAAK,SAAS,WAAW,GAAG;AAC5B,cAAME,IAAYF,EAAK,SAAS,CAAC;AACjC,YAAIE,KAAaA,EAAU,SAAS,WAAW,GAAG;AAC9C,UAAAA,EAAU,cAAcD;AACxB;AAAA,QACJ;AAAA,MACJ;AAGA,YAAME,IAAS,SAAS,iBAAiBH,GAAM,WAAW,WAAW,IAAI,GACnEI,IAAoB,CAAA;AAC1B,UAAIzD,IAAIwD,EAAO,SAAA;AACf,aAAOxD,KAAG;AACN,cAAM0D,IAAI1D;AACV,SAAK0D,EAAE,aAAa,IAAI,KAAA,EAAO,SAAS,KACpCD,EAAU,KAAKC,CAAC,GAEpB1D,IAAIwD,EAAO,SAAA;AAAA,MACf;AAEA,UAAIC,EAAU,WAAW,GAAG;AAExB,QAAAJ,EAAK,cAAcC;AACnB;AAAA,MACJ;AAIA,MAAAG,EAAU,CAAC,EAAE,YAAYH;AACzB,eAASjE,IAAI,GAAGA,IAAIoE,EAAU,QAAQpE;AAClC,QAAAoE,EAAUpE,CAAC,EAAE,YAAY;AAAA,IAEjC;AAEA,QAAI,OAAO0D,KAAgB,YAAYA,EAAY,SAAS,GAAG;AAC3D,MAAIE,KACAxD,EAAG,aAAaR,GAAmBgE,CAAU,GAEjDG,EAAgB3D,GAAIsD,CAAW,GAC/BtD,EAAG,aAAaP,IAAsBO,EAAG,eAAe,IAAI,MAAM;AAClE;AAAA,IACJ;AAEA,QAAIkE,IAAiB;AAGrB,UAAMH,IAAS,SAAS,iBAAiB/D,GAAI,WAAW,WAAW,IAAI;AACvE,QAAImE,IAAOJ,EAAO,SAAA;AAElB,WAAOI,KAAM;AACT,YAAMC,IAAUD,GACVE,IAAW,OAAOD,EAAQ,eAAe,EAAE;AAGjD,UAAI,QAAQ,KAAKC,CAAQ,GAAG;AACxB,cAAMC,IAAWP,EAAO,SAAA;AACxB,QAAAK,EAAQ,OAAA,GACRD,IAAOG;AACP;AAAA,MACJ;AAGA,YAAMC,IAAaF,EAAS,QAAQ,QAAQ,GAAG;AAG/C,UAFgBE,EAAW,KAAA,EAEf,SAAS,GAAG;AACpB,cAAM3B,IAAWC,EAAW0B,CAAU;AACtC,QAAI3B,MAAa2B,MACbH,EAAQ,cAAcxB,GACtBsB,IAAiB;AAAA,MAEzB;AACA,MAAAC,IAAOJ,EAAO,SAAA;AAAA,IAClB;AAGA,UAAMS,IAAkB,MAAM,KAAKxE,EAAG,UAAU,EAAE,OAAO,CAAAO,MAAKA,EAAE,aAAa,KAAK,SAAS;AAC3F,aAASX,IAAI,GAAGA,IAAI4E,EAAgB,SAAS,GAAG5E,KAAK;AACjD,YAAM6E,IAAUD,EAAgB5E,CAAC,GAC3B8E,IAAOF,EAAgB5E,IAAI,CAAC;AAClC,UAAI6E,EAAQ,aAAa,KAAA,KAAUC,EAAK,aAAa,QAAQ;AACzD,cAAMC,IAAS,SAAS,eAAe,GAAG;AAC1C,QAAAF,EAAQ,YAAY,aAAaE,GAAQD,CAAI;AAAA,MACjD;AAAA,IACJ;AAEA,UAAME,KAAe5E,EAAG,eAAe,IAAI,KAAA;AAC3C,IAAIkE,KAAkBU,MAClB5E,EAAG,aAAaP,GAAqBmF,CAAW,GAE5CpB,KACAxD,EAAG,aAAa,qBAAqBwD,CAAU;AAAA,EAG3D;AACJ;"}
+{"version":3,"file":"hidePiiData.js","names":[],"sources":["../../src/utils/hidePiiData.ts"],"sourcesContent":["/****\n * hidePiiData.ts\n *\n * Purpose\n * -------\n * Utilities for anonymizing Personally Identifiable Information (PII) in rendered DOM content.\n * The main entry point is `hidePiiData`, which shuffles visible text inside a target element.\n *\n * Integration / Activation\n * -----------------------\n * Activation can be toggled with **Ctrl+Shift+U / Cmd+Shift+U**, or by setting the\n * `<html>` attribute `data-hide-pii=\"shuffle\"`. When activated, new or changed content\n * marked with `data-pii=\"visible\"` is processed by this module.\n * This file does not attach observers by itself. It only exposes pure DOM utilities.\n *\n * High level behavior\n * -------------------\n * 1. Tokenize text on whitespace while preserving the original whitespace.\n * 2. For email tokens, clean punctuation, pad each part to at least six characters,\n *    shuffle both parts independently, and rejoin with `@`.\n * 3. For normal tokens shorter than six characters, pad with random alphanumerics before shuffling.\n * 4. Preserve capitalization pattern for simple Name like tokens (e.g. `Alice`) after shuffling.\n *\n * Data attributes used\n * --------------------\n * - `data-pii=\"visible\"` marks elements that should be anonymized.\n * - `data-pii=\"hidden\"` is written to elements that have already been processed to help external code introspect state.\n * - `data-hide-pii=\"shuffle\"` on `<html>` is used by an external observer to decide when to call `hidePiiData`.\n */\n\nconst ATTR_DATA_PII = 'data-pii';\nconst ATTR_ORIGINAL_PII = 'data-original-pii';\nconst ATTR_OBFUSCATED_PII = 'data-obfuscated-pii';\n\n/**\n * In place Fisher Yates shuffle.\n * Randomizes the order of the given array using `Math.random()`.\n * This is sufficient for UI anonymization but is not cryptographically secure.\n */\nconst fyShuffle = <T>(arr: T[]): void => {\n    for (let i = arr.length - 1; i > 0; i--) {\n        const j = Math.floor(Math.random() * (i + 1));\n        const tmp = arr[i];\n        arr[i] = arr[j];\n        arr[j] = tmp;\n    }\n};\n\n/** Returns true if (A-Z, a-z, 0-9). */\nconst isTextOrNumber = (el: string): boolean => /[A-Za-z0-9]/.test(el);\n\n/**\n * Generate a random ASCII alphanumeric string of length `n`.\n * Used to pad very short tokens before shuffling to increase anonymity.\n */\nconst addRandomCharacter = (el: number): string => {\n    const chars = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz';\n    let out = '';\n    for (let i = 0; i < el; i++) {\n        out += chars.charAt(Math.floor(Math.random() * chars.length)).toLocaleLowerCase();\n    }\n    return out;\n};\n\n/**\n * Ensure a minimum length by appending random alphanumerics when `s` is shorter than `minLen`.\n * Defaults to 6 which balances privacy and UI density.\n */\nconst ensureMinLength = (el: string, minLen = 6): string => {\n    if (el.length >= minLen) {\n        return el;\n    }\n    return el + addRandomCharacter(minLen - el.length);\n};\n\n/** Generate a random numeric string of length `n`. */\nconst randomDigits = (n: number): string => {\n    const digits = '0123456789';\n    let out = '';\n    for (let i = 0; i < n; i++) {\n        out += digits.charAt(Math.floor(Math.random() * digits.length));\n    }\n    return out;\n};\n\n/** Ensure a minimum length by appending random digits (for phone numbers). */\nconst ensureMinDigits = (s: string, minLen = 6): string => {\n    if (s.length >= minLen) {\n        return s;\n    }\n    return s + randomDigits(minLen - s.length);\n};\n\n/**\n * Shuffle a token while trying to keep an alphanumeric character at both boundaries.\n *\n * Why boundaries matter\n * ---------------------\n * Many UI layouts expect words to begin and end with letters or digits. By forcing\n * alphanumeric characters to the first and last positions when possible, we avoid\n * odd leading punctuation or trailing punctuation that could break alignment or\n * cause misleading visual cues.\n *\n * Rules\n * -----\n * - If there are no alphanumerics, the original string is returned unchanged.\n * - If there is only one alphanumeric and length is at least 2, it also returns unchanged,\n *   since we cannot satisfy both boundaries.\n * - Non alphanumeric characters are placed only in interior positions.\n */\nconst shuffle = (el: string): string => {\n    const n = el.length;\n    const chars = el.split('');\n\n    // Separate alphanumeric and non-alphanumeric characters\n    const alnums: string[] = [];\n    const nonAlnums: string[] = [];\n\n    for (const char of chars) {\n        if (isTextOrNumber(char)) {\n            alnums.push(char);\n        } else {\n            nonAlnums.push(char);\n        }\n    }\n\n    // If we cannot satisfy the boundary rule, keep original\n    if (alnums.length === 0) {\n        return el;\n    }\n\n    if (n >= 2 && alnums.length === 1) {\n        return el; // cannot put alnum at both ends\n    }\n\n    fyShuffle(alnums);\n    fyShuffle(nonAlnums);\n\n    // If there are more non alphanumerics than interior slots, bail out to keep boundaries valid\n    const interiorSlots = Math.max(0, n - 2);\n    if (nonAlnums.length > interiorSlots) {\n        return el;\n    }\n\n    // Build output with alnum at boundaries\n    const out: string[] = new Array(n);\n    out[0] = alnums.pop() as string; // left boundary alnum (safe due to earlier guard)\n    out[n - 1] = alnums.pop() as string; // right boundary alnum\n\n    // Fill interior positions randomly with remaining characters\n    const interiorPositions: number[] = [];\n    for (let i = 1; i <= n - 2; i++) {\n        interiorPositions.push(i);\n    }\n    fyShuffle(interiorPositions);\n\n    let k = 0;\n    for (const char of nonAlnums) {\n        out[interiorPositions[k++]] = char; // place all non-alnums inside\n    }\n    for (const char of alnums) {\n        out[interiorPositions[k++]] = char; // then remaining alnums\n    }\n\n    return out.join('');\n};\n\n/**\n * Shuffle an email address in a privacy aware way.\n *\n * Steps\n * -----\n * 1. Split on `@` into local and domain.\n * 2. Remove any non alphanumeric characters from both parts (drop dots and dashes).\n * 3. Pad each part to a minimum of six characters to avoid very short outputs.\n * 4. Shuffle the local and domain parts independently and rejoin with `@`.\n *\n * Rationale\n * ---------\n * Emails often contain structure that makes simple shuffling ineffective. By stripping\n * punctuation and enforcing a minimum length, we reduce the chance of hinting at the\n * original identity while still returning something that looks like an email.\n */\nconst shuffleEmail = (email: string): string => {\n    const [local, domain] = email.split('@');\n    // Remove all non-alphanumeric characters from both parts\n    const cleanName = local.replace(/[^A-Za-z0-9]/g, '');\n    const cleanDomain = domain.replace(/[^A-Za-z0-9]/g, '');\n    const paddedName = ensureMinLength(cleanName, 6);\n    const shuffledName = shuffleText(paddedName, false);\n    const shuffledDomain = shuffleText(cleanDomain, false);\n\n    /**\n     * Get a two-letter locale suffix based on the user's browser locale.\n     * Prefers the region subtag (e.g., \"en-US\" -> \"US\"). Falls back to the language\n     * subtag (e.g., \"de\" -> \"DE\"). Returns \"XX\" if unavailable.\n     */\n    const getLocaleSuffix = (): string => {\n        try {\n            const langRaw =\n                typeof navigator !== 'undefined' ? navigator.languages?.[0] || navigator.language || '' : '';\n            const lang = (langRaw || '').replace('_', '-');\n            if (!lang) {\n                return 'com';\n            }\n            const parts = lang.split('-');\n            const region = parts[1] || parts[0];\n            const code = (region || '').slice(0, 2).toLocaleLowerCase();\n            return code || 'com';\n        } catch {\n            return 'com';\n        }\n    };\n\n    return `${shuffledName}@${shuffledDomain}.${getLocaleSuffix()}`;\n};\n\n/**\n * Shuffle a phone number while preserving its structure.\n * Removes non-digits, pads if too short, shuffles digits, then reinserts formatting.\n */\nconst shufflePhone = (phone: string): string => {\n    const countryPrefix = phone.startsWith('+') ? phone.slice(1).match(/^\\d{1,3}/)?.[0] || '' : '';\n\n    // Extract all digits and split into country code vs. rest\n    const allDigits = phone.replace(/\\D/g, '');\n    const restDigits = countryPrefix ? allDigits.slice(countryPrefix.length) : allDigits;\n\n    if (restDigits.length < 4) {\n        return phone; // too short to anonymize meaningfully beyond the country code\n    }\n\n    // Pad and shuffle only the rest (not the country code)\n    const paddedRest = ensureMinDigits(restDigits, 6);\n    const shuffledRest = shuffle(paddedRest);\n\n    // Reinsert digits into original format:\n    // - Keep the first `countryPrefix.length` digits after '+' unchanged\n    // - Replace subsequent digits with shuffledRest\n    let i = 0; // index into shuffledRest\n    let prefixLeft = countryPrefix.length;\n    let inPrefixBlock = !!countryPrefix; // true if we saw leading '+' and have prefix digits to preserve\n\n    return phone.replace(/\\d/g, phoneNumber => {\n        if (inPrefixBlock) {\n            // We are preserving digits immediately after the leading '+'\n            // Once we consume `prefixLeft` digits, we stop preserving\n            if (prefixLeft > 0) {\n                prefixLeft -= 1;\n                if (prefixLeft === 0) {\n                    inPrefixBlock = false;\n                }\n                return phoneNumber; // keep country code digit as-is\n            }\n            inPrefixBlock = false;\n        }\n        // Replace with next shuffled digit (fallback '0' if exhausted, though length should suffice)\n        return shuffledRest[i++] || '0';\n    });\n};\n\n/**\n * Shuffle text while preserving whitespace.\n *\n * Behavior\n * --------\n * - Tokenization uses `\\S+` to process non whitespace runs and preserves the original whitespace.\n * - Email like tokens are handled by `shuffleEmail`.\n * - Non email tokens shorter than six characters are padded with random alphanumerics before shuffling.\n * - For simple Name like tokens (regex `^[A-Z][a-z]+$`), capitalization is preserved after shuffling.\n */\nexport const shuffleText = (str: string, preserveCase = true): string => {\n    if (str.length < 2) {\n        return str;\n    }\n\n    const lettersOnly = str.replace(/[^A-Za-z]/g, '');\n    const paddedToken = ensureMinLength(lettersOnly, 6);\n    const shuffled = shuffle(paddedToken);\n\n    if (preserveCase) {\n        return shuffled.charAt(0).toUpperCase() + shuffled.slice(1).toLowerCase();\n    }\n\n    return shuffled;\n};\n\nexport const shufflePii = (text: string): string => {\n    // First pass: handle phone numbers that may span multiple tokens (spaces, dashes, parentheses)\n    const phoneSeq = /(^|[^A-Za-z0-9])(\\+?\\d(?:[ \\t\\-()]*\\d){6,})(?=$|[^A-Za-z0-9])/g;\n    const withPhonesShuffled = text.replace(\n        phoneSeq,\n        (_m: string, pre: string, num: string) => pre + shufflePhone(num)\n    );\n\n    // Second pass: token-wise processing for remaining tokens\n    return withPhonesShuffled.replace(/\\S+/g, (token: string): string => {\n        // Email detected: delegate to email specific logic\n        if (/^[^@]+@[^@]+$/.test(token)) {\n            return shuffleEmail(token);\n        }\n\n        // Phone number detected (single-token formats): delegate to phone logic\n        if (/^\\+?[0-9][0-9\\s\\-()]{3,}$/.test(token)) {\n            return shufflePhone(token);\n        }\n\n        // If the token has no letters at all, leave it unchanged (avoid turning digits into letters)\n        if (!/[A-Za-z]/.test(token)) {\n            return token;\n        }\n\n        // Enforce a minimum token length for short text tokens\n        const paddedToken = token.length < 6 ? token + addRandomCharacter(6 - token.length) : token;\n        const shuffled = shuffleText(paddedToken);\n        return shuffled;\n    });\n};\n\n/**\n * Shuffle text nodes or input values inside the provided element(s).\n *\n * Parameters\n * ----------\n * - `target`: either a single `Element` or a `NodeListOf<Element>`.\n * - `forceResult`: optional string to override output directly.\n *\n * How it works\n * ------------\n * - Marks each processed element with `data-pii=\"hidden\"`.\n * - If the element is an `<input>`, it shuffles the `value` string and writes it back.\n * - For non input elements, it walks text nodes with a `TreeWalker` and replaces the node values\n *   with their shuffled variants.\n *\n * Performance notes\n * -----------------\n * - Work is proportional to the number of text nodes in `target`.\n * - Avoid calling this repeatedly on large subtrees without batching.\n */\nexport const hidePiiData = (target: Element | NodeListOf<Element>, forceResult?: string): void => {\n    const elements: Element[] = target instanceof Element ? [target] : Array.from(target);\n\n    for (const el of elements) {\n        // Mark the element as processed so other parts of the app can detect its state\n        el.setAttribute(ATTR_DATA_PII, 'hidden');\n\n        const beforeText = (el.textContent || '').trim();\n\n        // If the selected element is an <input>, shuffle its value instead of text nodes\n        if (el.matches?.('input') || el.tagName === 'INPUT') {\n            const input = el as HTMLInputElement;\n            const val = input.value || '';\n\n            if (typeof forceResult === 'string' && forceResult.length > 0) {\n                el.setAttribute(ATTR_ORIGINAL_PII, val);\n                input.value = forceResult;\n                el.setAttribute(ATTR_OBFUSCATED_PII, input.value);\n                continue;\n            }\n\n            el.setAttribute(ATTR_ORIGINAL_PII, val);\n            const trimmed = val.trim();\n\n            if (trimmed.length > 0) {\n                const shuffled = shufflePii(val);\n                if (shuffled !== val) {\n                    input.value = shuffled;\n                }\n                el.setAttribute(ATTR_OBFUSCATED_PII, input.value);\n            }\n            continue; // skip text-node processing for inputs\n        }\n\n        // Helper: safely apply a forced text replacement without destroying markup\n        const applyForcedText = (root: Element, value: string): void => {\n            // Case 1: Exactly one element child that itself has no element children\n            // e.g. <td><span>Text</span></td> -> replace span textContent only\n            if (root.children.length === 1) {\n                const onlyChild = root.children[0] as Element;\n                if (onlyChild && onlyChild.children.length === 0) {\n                    onlyChild.textContent = value;\n                    return;\n                }\n            }\n\n            // Case 2: Replace text nodes directly while preserving structure\n            const walker = document.createTreeWalker(root, NodeFilter.SHOW_TEXT, null);\n            const textNodes: Text[] = [];\n            let n = walker.nextNode();\n            while (n) {\n                const t = n as Text;\n                if ((t.nodeValue || '').trim().length > 0) {\n                    textNodes.push(t);\n                }\n                n = walker.nextNode();\n            }\n\n            if (textNodes.length === 0) {\n                // As a last resort, fall back to setting textContent (no visible text nodes found)\n                root.textContent = value;\n                return;\n            }\n\n            // Put the forced value into the first non-empty text node,\n            // and clear the remainder to avoid duplicated content\n            textNodes[0].nodeValue = value;\n            for (let i = 1; i < textNodes.length; i++) {\n                textNodes[i].nodeValue = '';\n            }\n        };\n\n        if (typeof forceResult === 'string' && forceResult.length > 0) {\n            if (beforeText) {\n                el.setAttribute(ATTR_ORIGINAL_PII, beforeText);\n            }\n            applyForcedText(el, forceResult);\n            el.setAttribute(ATTR_OBFUSCATED_PII, (el.textContent || '').trim());\n            continue;\n        }\n\n        let anyTextChanged = false;\n\n        // Walk only text nodes to avoid touching markup and attributes\n        const walker = document.createTreeWalker(el, NodeFilter.SHOW_TEXT, null);\n        let node = walker.nextNode();\n\n        while (node) {\n            const txtNode = node as Text;\n            const original = String(txtNode.textContent || '');\n\n            // Whitespace fix 1/2: If the text node contains only whitespace, remove it entirely\n            if (/^\\s*$/.test(original)) {\n                const nextNode = walker.nextNode();\n                txtNode.remove();\n                node = nextNode;\n                continue;\n            }\n\n            // Normalize all whitespace in non-empty text nodes to a single space\n            const normalized = original.replace(/\\s+/g, ' ');\n            const trimmed = normalized.trim();\n\n            if (trimmed.length > 0) {\n                const shuffled = shufflePii(normalized);\n                if (shuffled !== normalized) {\n                    txtNode.textContent = shuffled;\n                    anyTextChanged = true;\n                }\n            }\n            node = walker.nextNode();\n        }\n\n        // Whitespace fix 2/2: Restore spacing between adjacent text nodes\n        const directTextNodes = Array.from(el.childNodes).filter(n => n.nodeType === Node.TEXT_NODE);\n        for (let i = 0; i < directTextNodes.length - 1; i++) {\n            const current = directTextNodes[i] as Text;\n            const next = directTextNodes[i + 1] as Text;\n            if (current.textContent?.trim() && next.textContent?.trim()) {\n                const spacer = document.createTextNode(' ');\n                current.parentNode?.insertBefore(spacer, next);\n            }\n        }\n\n        const currentText = (el.textContent || '').trim();\n        if (anyTextChanged && currentText) {\n            el.setAttribute(ATTR_OBFUSCATED_PII, currentText);\n\n            if (beforeText) {\n                el.setAttribute('data-original-pii', beforeText);\n            }\n        }\n    }\n};\n"],"mappings":";AA8BA,IACM,IAAoB,qBACpB,IAAsB,uBAOtB,KAAgB,MAAmB;CACrC,KAAK,IAAI,IAAI,EAAI,SAAS,GAAG,IAAI,GAAG,KAAK;EACrC,IAAM,IAAI,KAAK,MAAM,KAAK,OAAO,KAAK,IAAI,EAAE,GACtC,IAAM,EAAI;EAEhB,AADA,EAAI,KAAK,EAAI,IACb,EAAI,KAAK;CACb;AACJ,GAGM,KAAkB,MAAwB,cAAc,KAAK,CAAE,GAM/D,KAAsB,MAAuB;CAC/C,IACI,IAAM;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAI,KACpB,KAAO,uDAAM,OAAO,KAAK,MAAM,KAAK,OAAO,IAAI,EAAY,CAAC,CAAC,CAAC,kBAAkB;CAEpF,OAAO;AACX,GAMM,KAAmB,GAAY,IAAS,MACtC,EAAG,UAAU,IACN,IAEJ,IAAK,EAAmB,IAAS,EAAG,MAAM,GAI/C,KAAgB,MAAsB;CACxC,IACI,IAAM;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACnB,KAAO,aAAO,OAAO,KAAK,MAAM,KAAK,OAAO,IAAI,EAAa,CAAC;CAElE,OAAO;AACX,GAGM,KAAmB,GAAW,IAAS,MACrC,EAAE,UAAU,IACL,IAEJ,IAAI,EAAa,IAAS,EAAE,MAAM,GAoBvC,KAAW,MAAuB;CACpC,IAAM,IAAI,EAAG,QACP,IAAQ,EAAG,MAAM,EAAE,GAGnB,IAAmB,CAAC,GACpB,IAAsB,CAAC;CAE7B,KAAK,IAAM,KAAQ,GACf,AAAI,EAAe,CAAI,IACnB,EAAO,KAAK,CAAI,IAEhB,EAAU,KAAK,CAAI;CAS3B,IAJI,EAAO,WAAW,KAIlB,KAAK,KAAK,EAAO,WAAW,GAC5B,OAAO;CAIX,AADA,EAAU,CAAM,GAChB,EAAU,CAAS;CAGnB,IAAM,IAAgB,KAAK,IAAI,GAAG,IAAI,CAAC;CACvC,IAAI,EAAU,SAAS,GACnB,OAAO;CAIX,IAAM,IAAoB,MAAM,CAAC;CAEjC,AADA,EAAI,KAAK,EAAO,IAAI,GACpB,EAAI,IAAI,KAAK,EAAO,IAAI;CAGxB,IAAM,IAA8B,CAAC;CACrC,KAAK,IAAI,IAAI,GAAG,KAAK,IAAI,GAAG,KACxB,EAAkB,KAAK,CAAC;CAE5B,EAAU,CAAiB;CAE3B,IAAI,IAAI;CACR,KAAK,IAAM,KAAQ,GACf,EAAI,EAAkB,QAAQ;CAElC,KAAK,IAAM,KAAQ,GACf,EAAI,EAAkB,QAAQ;CAGlC,OAAO,EAAI,KAAK,EAAE;AACtB,GAkBM,KAAgB,MAA0B;CAC5C,IAAM,CAAC,GAAO,KAAU,EAAM,MAAM,GAAG,GAEjC,IAAY,EAAM,QAAQ,iBAAiB,EAAE,GAC7C,IAAc,EAAO,QAAQ,iBAAiB,EAAE;CA2BtD,OAAO,GAzBc,EADF,EAAgB,GAAW,CACb,GAAY,EAyBnC,EAAa,GAxBA,EAAY,GAAa,EAwBtB,EAAe,UAjBH;EAClC,IAAI;GAGA,IAAM,KADF,OAAO,YAAc,QAAc,UAAU,YAAY,MAAM,UAAU,aACpD,GAAA,CAAI,QAAQ,KAAK,GAAG;GAC7C,IAAI,CAAC,GACD,OAAO;GAEX,IAAM,IAAQ,EAAK,MAAM,GAAG;GAG5B,QAFe,EAAM,MAAM,EAAM,MACT,GAAA,CAAI,MAAM,GAAG,CAAC,CAAC,CAAC,kBACjC,KAAQ;EACnB,QAAQ;GACJ,OAAO;EACX;CACJ,EAE4C,CAAgB;AAChE,GAMM,KAAgB,MAA0B;CAC5C,IAAM,IAAgB,EAAM,WAAW,GAAG,KAAI,EAAM,MAAM,CAAC,CAAC,CAAC,MAAM,UAAU,CAAC,GAAG,MAAW,IAGtF,IAAY,EAAM,QAAQ,OAAO,EAAE,GACnC,IAAa,IAAgB,EAAU,MAAM,EAAc,MAAM,IAAI;CAE3E,IAAI,EAAW,SAAS,GACpB,OAAO;CAKX,IAAM,IAAe,EADF,EAAgB,GAAY,CAClB,CAAU,GAKnC,IAAI,GACJ,IAAa,EAAc,QAC3B,IAAgB,CAAC,CAAC;CAEtB,OAAO,EAAM,QAAQ,QAAO,MAAe;EACvC,IAAI,GAAe;GAGf,IAAI,IAAa,GAKb,OAJA,KACI,MAAe,MACf,IAAgB,KAEb;GAEX,IAAgB;EACpB;EAEA,OAAO,EAAa,QAAQ;CAChC,CAAC;AACL,GAYa,KAAe,GAAa,IAAe,OAAiB;CACrE,IAAI,EAAI,SAAS,GACb,OAAO;CAKX,IAAM,IAAW,EADG,EADA,EAAI,QAAQ,cAAc,EACV,GAAa,CACxB,CAAW;CAMpC,OAJI,IACO,EAAS,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,EAAS,MAAM,CAAC,CAAC,CAAC,YAAY,IAGrE;AACX,GAEa,KAAc,MAGI,EAAK,QAC5B,mEACC,GAAY,GAAa,MAAgB,IAAM,EAAa,CAAG,CAI7D,CAAA,CAAmB,QAAQ,SAAS,MAEnC,gBAAgB,KAAK,CAAK,IACnB,EAAa,CAAK,IAIzB,4BAA4B,KAAK,CAAK,IAC/B,EAAa,CAAK,IAIxB,WAAW,KAAK,CAAK,IAMT,EADG,EAAM,SAAS,IAAI,IAAQ,EAAmB,IAAI,EAAM,MAAM,IAAI,CAE/E,IANI,CAOd,GAuBQ,KAAe,GAAuC,MAA+B;CAC9F,IAAM,IAAsB,aAAkB,UAAU,CAAC,CAAM,IAAI,MAAM,KAAK,CAAM;CAEpF,KAAK,IAAM,KAAM,GAAU;EAEvB,EAAG,aAAa,YAAe,QAAQ;EAEvC,IAAM,KAAc,EAAG,eAAe,GAAA,CAAI,KAAK;EAG/C,IAAI,EAAG,UAAU,OAAO,KAAK,EAAG,YAAY,SAAS;GACjD,IAAM,IAAQ,GACR,IAAM,EAAM,SAAS;GAE3B,IAAI,OAAO,KAAgB,YAAY,EAAY,SAAS,GAAG;IAG3D,AAFA,EAAG,aAAa,GAAmB,CAAG,GACtC,EAAM,QAAQ,GACd,EAAG,aAAa,GAAqB,EAAM,KAAK;IAChD;GACJ;GAKA,IAHA,EAAG,aAAa,GAAmB,CAAG,GACtB,EAAI,KAEhB,CAAA,CAAQ,SAAS,GAAG;IACpB,IAAM,IAAW,EAAW,CAAG;IAI/B,AAHI,MAAa,MACb,EAAM,QAAQ,IAElB,EAAG,aAAa,GAAqB,EAAM,KAAK;GACpD;GACA;EACJ;EAGA,IAAM,KAAmB,GAAe,MAAwB;GAG5D,IAAI,EAAK,SAAS,WAAW,GAAG;IAC5B,IAAM,IAAY,EAAK,SAAS;IAChC,IAAI,KAAa,EAAU,SAAS,WAAW,GAAG;KAC9C,EAAU,cAAc;KACxB;IACJ;GACJ;GAGA,IAAM,IAAS,SAAS,iBAAiB,GAAM,WAAW,WAAW,IAAI,GACnE,IAAoB,CAAC,GACvB,IAAI,EAAO,SAAS;GACxB,OAAO,IAAG;IACN,IAAM,IAAI;IAIV,CAHK,EAAE,aAAa,GAAA,CAAI,KAAK,CAAC,CAAC,SAAS,KACpC,EAAU,KAAK,CAAC,GAEpB,IAAI,EAAO,SAAS;GACxB;GAEA,IAAI,EAAU,WAAW,GAAG;IAExB,EAAK,cAAc;IACnB;GACJ;GAIA,EAAU,EAAE,CAAC,YAAY;GACzB,KAAK,IAAI,IAAI,GAAG,IAAI,EAAU,QAAQ,KAClC,EAAU,EAAE,CAAC,YAAY;EAEjC;EAEA,IAAI,OAAO,KAAgB,YAAY,EAAY,SAAS,GAAG;GAK3D,AAJI,KACA,EAAG,aAAa,GAAmB,CAAU,GAEjD,EAAgB,GAAI,CAAW,GAC/B,EAAG,aAAa,IAAsB,EAAG,eAAe,GAAA,CAAI,KAAK,CAAC;GAClE;EACJ;EAEA,IAAI,IAAiB,IAGf,IAAS,SAAS,iBAAiB,GAAI,WAAW,WAAW,IAAI,GACnE,IAAO,EAAO,SAAS;EAE3B,OAAO,IAAM;GACT,IAAM,IAAU,GACV,IAAW,OAAO,EAAQ,eAAe,EAAE;GAGjD,IAAI,QAAQ,KAAK,CAAQ,GAAG;IACxB,IAAM,IAAW,EAAO,SAAS;IAEjC,AADA,EAAQ,OAAO,GACf,IAAO;IACP;GACJ;GAGA,IAAM,IAAa,EAAS,QAAQ,QAAQ,GAAG;GAG/C,IAFgB,EAAW,KAEvB,CAAA,CAAQ,SAAS,GAAG;IACpB,IAAM,IAAW,EAAW,CAAU;IACtC,AAAI,MAAa,MACb,EAAQ,cAAc,GACtB,IAAiB;GAEzB;GACA,IAAO,EAAO,SAAS;EAC3B;EAGA,IAAM,IAAkB,MAAM,KAAK,EAAG,UAAU,CAAC,CAAC,QAAO,MAAK,EAAE,aAAa,KAAK,SAAS;EAC3F,KAAK,IAAI,IAAI,GAAG,IAAI,EAAgB,SAAS,GAAG,KAAK;GACjD,IAAM,IAAU,EAAgB,IAC1B,IAAO,EAAgB,IAAI;GACjC,IAAI,EAAQ,aAAa,KAAK,KAAK,EAAK,aAAa,KAAK,GAAG;IACzD,IAAM,IAAS,SAAS,eAAe,GAAG;IAC1C,EAAQ,YAAY,aAAa,GAAQ,CAAI;GACjD;EACJ;EAEA,IAAM,KAAe,EAAG,eAAe,GAAA,CAAI,KAAK;EAChD,AAAI,KAAkB,MAClB,EAAG,aAAa,GAAqB,CAAW,GAE5C,KACA,EAAG,aAAa,qBAAqB,CAAU;CAG3D;AACJ"}

package/utils/iconNames.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Checks whether an icon value points to an external SVG instead of a UIKIT icon name.
+ */
+export declare const isSvgIcon: (icon: string) => boolean;
+/**
+ * Normalizes short, canonical, intermediate and legacy icon names to the canonical `icon-*` namespace.
+ * Additional classes following the icon name are preserved.
+ */
+export declare const normalizeIconName: (icon: string) => string;

package/utils/iconNames.js

@@ -0,0 +1,6 @@
+//#region src/utils/iconNames.ts
+var e = (e) => e.includes(".svg"), t = (t) => !t || e(t) ? t : `icon-${t.replace(/^(?:uikit-icon|rioglyph|icon)-/, "")}`;
+//#endregion
+export { e as isSvgIcon, t as normalizeIconName };
+
+//# sourceMappingURL=iconNames.js.map

package/utils/iconNames.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"iconNames.js","names":[],"sources":["../../src/utils/iconNames.ts"],"sourcesContent":["/**\n * Checks whether an icon value points to an external SVG instead of a UIKIT icon name.\n */\nexport const isSvgIcon = (icon: string) => icon.includes('.svg');\n\n/**\n * Normalizes short, canonical, intermediate and legacy icon names to the canonical `icon-*` namespace.\n * Additional classes following the icon name are preserved.\n */\nexport const normalizeIconName = (icon: string) => {\n    if (!icon || isSvgIcon(icon)) {\n        return icon;\n    }\n\n    const iconName = icon.replace(/^(?:uikit-icon|rioglyph|icon)-/, '');\n    return `icon-${iconName}`;\n};\n"],"mappings":";AAGA,IAAa,KAAa,MAAiB,EAAK,SAAS,MAAM,GAMlD,KAAqB,MAC1B,CAAC,KAAQ,EAAU,CAAI,IAChB,IAIJ,QADU,EAAK,QAAQ,kCAAkC,EACjD"}

package/utils/init/checkForReleaseVersion.js

@@ -1,17 +1,16 @@
-import { version as t } from "../../version.js";
-import { getConsoleStyle as i } from "./styledLogs.js";
-const r = "https://uikit.developers.rio.cloud/versionsList.json", a = async () => {
-  const s = (e) => console.log("%c%s", i(), e);
-  try {
-    const e = await fetch(r), { latest_release: o } = await e.json();
-    o > t && s(
-      `🆕 You are using version ${t} of the UIKIT while the latest released version is ${o}. Please consider updating asap.`
-    );
-  } catch {
-    s("Failed to fetch UIKIT version list.");
-  }
+import { version as e } from "../../version.js";
+import { getConsoleStyle as t } from "./styledLogs.js";
+//#region src/utils/init/checkForReleaseVersion.ts
+var n = "https://uikit.developers.rio.cloud/versionsList.json", r = async () => {
+	let r = (e) => console.log("%c%s", t(), e);
+	try {
+		let { latest_release: t } = await (await fetch(n)).json();
+		t > "3.0.0-beta.1" && r(`🆕 You are using version ${e} of the UIKIT while the latest released version is ${t}. Please consider updating asap.`);
+	} catch {
+		r("Failed to fetch UIKIT version list.");
+	}
 };
-export {
-  a as checkForReleaseVersion
-};
-//# sourceMappingURL=checkForReleaseVersion.js.map
+//#endregion
+export { r as checkForReleaseVersion };
+
+//# sourceMappingURL=checkForReleaseVersion.js.map

package/utils/init/checkForReleaseVersion.js.map

@@ -1 +1 @@
-{"version":3,"file":"checkForReleaseVersion.js","sources":["../../../src/utils/init/checkForReleaseVersion.ts"],"sourcesContent":["import { version } from '../../version';\nimport { getConsoleStyle } from './styledLogs';\n\nconst versionsListUrl = 'https://uikit.developers.rio.cloud/versionsList.json';\n\nexport const checkForReleaseVersion = async () => {\n    const logStyled = (message: string) => console.log('%c%s', getConsoleStyle(), message);\n\n    try {\n        const response = await fetch(versionsListUrl);\n        const { latest_release } = await response.json();\n\n        if (latest_release > version) {\n            logStyled(\n                `🆕 You are using version ${version} of the UIKIT while the latest released version is ` +\n                    `${latest_release}. Please consider updating asap.`\n            );\n        }\n    } catch {\n        logStyled('Failed to fetch UIKIT version list.');\n    }\n};\n"],"names":["versionsListUrl","checkForReleaseVersion","logStyled","message","getConsoleStyle","response","latest_release","version"],"mappings":";;AAGA,MAAMA,IAAkB,wDAEXC,IAAyB,YAAY;AAC9C,QAAMC,IAAY,CAACC,MAAoB,QAAQ,IAAI,QAAQC,EAAA,GAAmBD,CAAO;AAErF,MAAI;AACA,UAAME,IAAW,MAAM,MAAML,CAAe,GACtC,EAAE,gBAAAM,EAAA,IAAmB,MAAMD,EAAS,KAAA;AAE1C,IAAIC,IAAiBC,KACjBL;AAAA,MACI,4BAA4BK,CAAO,sDAC5BD,CAAc;AAAA,IAAA;AAAA,EAGjC,QAAQ;AACJ,IAAAJ,EAAU,qCAAqC;AAAA,EACnD;AACJ;"}
+{"version":3,"file":"checkForReleaseVersion.js","names":[],"sources":["../../../src/utils/init/checkForReleaseVersion.ts"],"sourcesContent":["import { version } from '../../version';\nimport { getConsoleStyle } from './styledLogs';\n\nconst versionsListUrl = 'https://uikit.developers.rio.cloud/versionsList.json';\n\nexport const checkForReleaseVersion = async () => {\n    const logStyled = (message: string) => console.log('%c%s', getConsoleStyle(), message);\n\n    try {\n        const response = await fetch(versionsListUrl);\n        const { latest_release } = await response.json();\n\n        if (latest_release > version) {\n            logStyled(\n                `🆕 You are using version ${version} of the UIKIT while the latest released version is ` +\n                    `${latest_release}. Please consider updating asap.`\n            );\n        }\n    } catch {\n        logStyled('Failed to fetch UIKIT version list.');\n    }\n};\n"],"mappings":";;;AAGA,IAAM,IAAkB,wDAEX,IAAyB,YAAY;CAC9C,IAAM,KAAa,MAAoB,QAAQ,IAAI,QAAQ,EAAgB,GAAG,CAAO;CAErF,IAAI;EAEA,IAAM,EAAE,sBAAmB,OAAM,MADV,MAAM,CAAe,EAAA,CACF,KAAK;EAE/C,AAAI,IAAA,kBACA,EACI,4BAA4B,EAAQ,qDAC7B,EAAe,iCAC1B;CAER,QAAQ;EACJ,EAAU,qCAAqC;CACnD;AACJ"}

package/utils/init/doNotUseTailwind.js

@@ -1,47 +1,39 @@
-import { getConsoleStyle as o } from "./styledLogs.js";
-const a = async () => {
-  const e = document.querySelectorAll('link[rel="stylesheet"]');
-  for (const n of e)
-    try {
-      if ((await (await fetch(n.href)).text()).includes("--tw"))
-        return !0;
-    } catch (t) {
-      console.warn(`Failed to fetch CSS file: ${n.href}`, t);
-    }
-  const i = document.querySelectorAll("style");
-  for (const n of i)
-    if (n.textContent?.includes("--tw"))
-      return !0;
-  return !1;
-};
-let s = !1;
+import { getConsoleStyle as e } from "./styledLogs.js";
+//#region src/utils/init/doNotUseTailwind.ts
+var t = async () => {
+	let e = document.querySelectorAll("link[rel=\"stylesheet\"]");
+	for (let t of e) try {
+		if ((await (await fetch(t.href)).text()).includes("--tw")) return !0;
+	} catch (e) {
+		console.warn(`Failed to fetch CSS file: ${t.href}`, e);
+	}
+	let t = document.querySelectorAll("style");
+	for (let e of t) if (e.textContent?.includes("--tw")) return !0;
+	return !1;
+}, n = !1;
 (async () => {
-  try {
-    s = await a();
-  } catch (e) {
-    console.error("Error during Tailwind detection:", e);
-  }
-})();
-setInterval(() => {
-  if (s) {
-    const e = [
-      "TAILWIND DETECTED!!!",
-      "Using Tailwind CSS in combination with the RIO UIKIT is strongly discouraged because it can lead to significant design and development issues.",
-      "The RIO UIKIT is a component-driven design system with carefully crafted styles to ensure consistent branding and user experience.",
-      "Tailwind CSS, as a utility-first framework, introduces inline styling that can conflict with the RIO UIKIT’s predefined component styles.",
-      "This can result in overridden styles, broken layouts, inconsistent spacings, inconsistent design language, and increased maintenance complexity.",
-      "Tailwind’s global reset styles may also disrupt the base styles of the RIO UIKIT, causing unintended visual changes.",
-      "Furthermore, mixing the two systems creates unnecessary redundancy, increases CSS bundle size, and complicates debugging and future updates.",
-      "To ensure a cohesive, maintainable, and professional design system, it is essential to rely solely on the RIO UIKIT and its customization options rather than introducing conflicting styling frameworks.",
-      `WE MAY TECHNICALLY DISABLE TAILWIND FUNCTIONALITY IN THE FUTURE.
-PLEASE DO NOT USE TAILWIND!`
-    ].join(`
-
-`);
-    console.warn("%c%s", o(), e);
-  }
+	try {
+		n = await t();
+	} catch (e) {
+		console.error("Error during Tailwind detection:", e);
+	}
+})(), setInterval(() => {
+	if (n) {
+		let t = [
+			"TAILWIND DETECTED!!!",
+			"Using Tailwind CSS in combination with the RIO UIKIT is strongly discouraged because it can lead to significant design and development issues.",
+			"The RIO UIKIT is a component-driven design system with carefully crafted styles to ensure consistent branding and user experience.",
+			"Tailwind CSS, as a utility-first framework, introduces inline styling that can conflict with the RIO UIKIT’s predefined component styles.",
+			"This can result in overridden styles, broken layouts, inconsistent spacings, inconsistent design language, and increased maintenance complexity.",
+			"Tailwind’s global reset styles may also disrupt the base styles of the RIO UIKIT, causing unintended visual changes.",
+			"Furthermore, mixing the two systems creates unnecessary redundancy, increases CSS bundle size, and complicates debugging and future updates.",
+			"To ensure a cohesive, maintainable, and professional design system, it is essential to rely solely on the RIO UIKIT and its customization options rather than introducing conflicting styling frameworks.",
+			"WE MAY TECHNICALLY DISABLE TAILWIND FUNCTIONALITY IN THE FUTURE.\nPLEASE DO NOT USE TAILWIND!"
+		].join("\n\n");
+		console.warn("%c%s", e(), t);
+	}
 }, 1e4);
-export {
-  a as doNotUseTailwind
-};
-//# sourceMappingURL=doNotUseTailwind.js.map
+//#endregion
+export { t as doNotUseTailwind };
+
+//# sourceMappingURL=doNotUseTailwind.js.map

package/utils/init/doNotUseTailwind.js.map

@@ -1 +1 @@
-{"version":3,"file":"doNotUseTailwind.js","sources":["../../../src/utils/init/doNotUseTailwind.ts"],"sourcesContent":["import { getConsoleStyle } from './styledLogs';\n\nexport const doNotUseTailwind = async () => {\n    // Detect Tailwind CSS in linked stylesheets\n    const links = document.querySelectorAll('link[rel=\"stylesheet\"]') as NodeListOf<HTMLLinkElement>;\n    for (const link of links) {\n        try {\n            const response = await fetch(link.href);\n            const cssText = await response.text();\n\n            if (cssText.includes('--tw')) {\n                return true; // Tailwind detected\n            }\n        } catch (error) {\n            console.warn(`Failed to fetch CSS file: ${link.href}`, error);\n        }\n    }\n\n    // Detect Tailwind CSS in <style> tags\n    const styleTags = document.querySelectorAll('style') as NodeListOf<HTMLStyleElement>;\n    for (const style of styleTags) {\n        if (style.textContent?.includes('--tw')) {\n            return true; // Tailwind detected\n        }\n    }\n\n    return false; // Tailwind not detected\n};\n\n// Global flag to track if Tailwind has been detected\nlet tailwindDetected = false;\n\n// Initial detection of Tailwind CSS\n(async () => {\n    try {\n        tailwindDetected = await doNotUseTailwind();\n    } catch (error) {\n        console.error('Error during Tailwind detection:', error);\n    }\n})();\n\n// Repeatedly log messages every 10 seconds if Tailwind was detected\nsetInterval(() => {\n    if (tailwindDetected) {\n        const message = [\n            'TAILWIND DETECTED!!!',\n            'Using Tailwind CSS in combination with the RIO UIKIT is strongly discouraged because it can lead to significant design and development issues.',\n            'The RIO UIKIT is a component-driven design system with carefully crafted styles to ensure consistent branding and user experience.',\n            'Tailwind CSS, as a utility-first framework, introduces inline styling that can conflict with the RIO UIKIT’s predefined component styles.',\n            'This can result in overridden styles, broken layouts, inconsistent spacings, inconsistent design language, and increased maintenance complexity.',\n            'Tailwind’s global reset styles may also disrupt the base styles of the RIO UIKIT, causing unintended visual changes.',\n            'Furthermore, mixing the two systems creates unnecessary redundancy, increases CSS bundle size, and complicates debugging and future updates.',\n            'To ensure a cohesive, maintainable, and professional design system, it is essential to rely solely on the RIO UIKIT and its customization options rather than introducing conflicting styling frameworks.',\n            'WE MAY TECHNICALLY DISABLE TAILWIND FUNCTIONALITY IN THE FUTURE.\\nPLEASE DO NOT USE TAILWIND!',\n        ].join('\\n\\n');\n        console.warn('%c%s', getConsoleStyle(), message);\n    }\n}, 10_000);\n"],"names":["doNotUseTailwind","links","link","error","styleTags","style","tailwindDetected","message","getConsoleStyle"],"mappings":";AAEO,MAAMA,IAAmB,YAAY;AAExC,QAAMC,IAAQ,SAAS,iBAAiB,wBAAwB;AAChE,aAAWC,KAAQD;AACf,QAAI;AAIA,WAFgB,OADC,MAAM,MAAMC,EAAK,IAAI,GACP,KAAA,GAEnB,SAAS,MAAM;AACvB,eAAO;AAAA,IAEf,SAASC,GAAO;AACZ,cAAQ,KAAK,6BAA6BD,EAAK,IAAI,IAAIC,CAAK;AAAA,IAChE;AAIJ,QAAMC,IAAY,SAAS,iBAAiB,OAAO;AACnD,aAAWC,KAASD;AAChB,QAAIC,EAAM,aAAa,SAAS,MAAM;AAClC,aAAO;AAIf,SAAO;AACX;AAGA,IAAIC,IAAmB;AAAA,CAGtB,YAAY;AACT,MAAI;AACA,IAAAA,IAAmB,MAAMN,EAAA;AAAA,EAC7B,SAASG,GAAO;AACZ,YAAQ,MAAM,oCAAoCA,CAAK;AAAA,EAC3D;AACJ,GAAA;AAGA,YAAY,MAAM;AACd,MAAIG,GAAkB;AAClB,UAAMC,IAAU;AAAA,MACZ;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAAA,IAAA,EACF,KAAK;AAAA;AAAA,CAAM;AACb,YAAQ,KAAK,QAAQC,EAAA,GAAmBD,CAAO;AAAA,EACnD;AACJ,GAAG,GAAM;"}
+{"version":3,"file":"doNotUseTailwind.js","names":[],"sources":["../../../src/utils/init/doNotUseTailwind.ts"],"sourcesContent":["import { getConsoleStyle } from './styledLogs';\n\nexport const doNotUseTailwind = async () => {\n    // Detect Tailwind CSS in linked stylesheets\n    const links = document.querySelectorAll('link[rel=\"stylesheet\"]') as NodeListOf<HTMLLinkElement>;\n    for (const link of links) {\n        try {\n            const response = await fetch(link.href);\n            const cssText = await response.text();\n\n            if (cssText.includes('--tw')) {\n                return true; // Tailwind detected\n            }\n        } catch (error) {\n            console.warn(`Failed to fetch CSS file: ${link.href}`, error);\n        }\n    }\n\n    // Detect Tailwind CSS in <style> tags\n    const styleTags = document.querySelectorAll('style') as NodeListOf<HTMLStyleElement>;\n    for (const style of styleTags) {\n        if (style.textContent?.includes('--tw')) {\n            return true; // Tailwind detected\n        }\n    }\n\n    return false; // Tailwind not detected\n};\n\n// Global flag to track if Tailwind has been detected\nlet tailwindDetected = false;\n\n// Initial detection of Tailwind CSS\n(async () => {\n    try {\n        tailwindDetected = await doNotUseTailwind();\n    } catch (error) {\n        console.error('Error during Tailwind detection:', error);\n    }\n})();\n\n// Repeatedly log messages every 10 seconds if Tailwind was detected\nsetInterval(() => {\n    if (tailwindDetected) {\n        const message = [\n            'TAILWIND DETECTED!!!',\n            'Using Tailwind CSS in combination with the RIO UIKIT is strongly discouraged because it can lead to significant design and development issues.',\n            'The RIO UIKIT is a component-driven design system with carefully crafted styles to ensure consistent branding and user experience.',\n            'Tailwind CSS, as a utility-first framework, introduces inline styling that can conflict with the RIO UIKIT’s predefined component styles.',\n            'This can result in overridden styles, broken layouts, inconsistent spacings, inconsistent design language, and increased maintenance complexity.',\n            'Tailwind’s global reset styles may also disrupt the base styles of the RIO UIKIT, causing unintended visual changes.',\n            'Furthermore, mixing the two systems creates unnecessary redundancy, increases CSS bundle size, and complicates debugging and future updates.',\n            'To ensure a cohesive, maintainable, and professional design system, it is essential to rely solely on the RIO UIKIT and its customization options rather than introducing conflicting styling frameworks.',\n            'WE MAY TECHNICALLY DISABLE TAILWIND FUNCTIONALITY IN THE FUTURE.\\nPLEASE DO NOT USE TAILWIND!',\n        ].join('\\n\\n');\n        console.warn('%c%s', getConsoleStyle(), message);\n    }\n}, 10_000);\n"],"mappings":";;AAEA,IAAa,IAAmB,YAAY;CAExC,IAAM,IAAQ,SAAS,iBAAiB,0BAAwB;CAChE,KAAK,IAAM,KAAQ,GACf,IAAI;EAIA,KAAI,OAFkB,MADC,MAAM,EAAK,IAAI,EAAA,CACP,KAAK,EAAA,CAExB,SAAS,MAAM,GACvB,OAAO;CAEf,SAAS,GAAO;EACZ,QAAQ,KAAK,6BAA6B,EAAK,QAAQ,CAAK;CAChE;CAIJ,IAAM,IAAY,SAAS,iBAAiB,OAAO;CACnD,KAAK,IAAM,KAAS,GAChB,IAAI,EAAM,aAAa,SAAS,MAAM,GAClC,OAAO;CAIf,OAAO;AACX,GAGI,IAAmB;CAGtB,YAAY;CACT,IAAI;EACA,IAAmB,MAAM,EAAiB;CAC9C,SAAS,GAAO;EACZ,QAAQ,MAAM,oCAAoC,CAAK;CAC3D;AACJ,EAAA,CAAG,GAGH,kBAAkB;CACd,IAAI,GAAkB;EAClB,IAAM,IAAU;GACZ;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;EACJ,CAAC,CAAC,KAAK,MAAM;EACb,QAAQ,KAAK,QAAQ,EAAgB,GAAG,CAAO;CACnD;AACJ,GAAG,GAAM"}