@lavalogic/scoria 0.37.44 → 0.37.46

package/dist/Helpers/Datamatrix.js

@@ -1,291 +1,291 @@
-/** https://github.com/datalog/datamatrix-svg under MIT license */
-'use strict';
-export function DATAMatrix(r) {
-	var e = [],
-		n = 0,
-		t = 0,
-		f = function (r, n) {
-			((e[n] = e[n] || []), (e[n][r] = 1));
-		},
-		o = function (r) {
-			for (var e = [], n = r.length, t = 0; t < n; t++) {
-				var f = r.charCodeAt(t),
-					o = t + 1 < n ? r.charCodeAt(t + 1) : 0;
-				f > 47 && f < 58 && o > 47 && o < 58
-					? (e.push(10 * (f - 48) + o + 82), t++)
-					: f > 127
-						? (e.push(235), e.push((f - 127) & 255))
-						: e.push(f + 1);
-			}
-			return e;
-		},
-		h = function (r, e) {
-			var n,
-				t,
-				f = 0,
-				h = 0,
-				i = r.length,
-				u = [e[0]],
-				a = function (r) {
-					((h = 40 * h + r), 2 == f++ && (u.push(++h >> 8), u.push(255 & h), (f = h = 0)));
-				};
-			for (n = 0; n < i && (0 != f || n != i - 1); n++) {
-				var s = r.charCodeAt(n);
-				for (s > 127 && 238 != u[0] && (a(1), a(30), (s -= 128)), t = 1; s > e[t]; t += 3);
-				var l = e[t + 1];
-				if (8 == l || (9 == l && 0 == f && n == i - 1)) return [];
-				if (l < 5 && 2 == f && n == i - 1) break;
-				(l < 5 && a(l), a(s - e[t + 2]));
-			}
-			return (
-				2 == f && 238 !== u[0] && a(0),
-				u.push(254),
-				(f > 0 || n < i) && (u = u.concat(o(r.substr(n - f)))),
-				u
-			);
-		},
-		i = function (r, e) {
-			r = unescape(encodeURI(r));
-			var i = o(r),
-				u = i.length,
-				a = h(
-					r,
-					[
-						230, 31, 0, 0, 32, 9, 29, 47, 1, 33, 57, 9, 44, 64, 1, 43, 90, 9, 51, 95, 1, 69, 127, 2,
-						96, 255, 1, 0,
-					]
-				),
-				s = a.length;
-			(s > 0 && s < u && ((i = a), (u = s)),
-				(s = (a = h(
-					r,
-					[
-						239, 31, 0, 0, 32, 9, 29, 47, 1, 33, 57, 9, 44, 64, 1, 43, 90, 2, 64, 95, 1, 69, 122, 9,
-						83, 127, 2, 96, 255, 1, 0,
-					]
-				)).length) > 0 &&
-					s < u &&
-					((i = a), (u = s)),
-				(s = (a = h(
-					r,
-					[
-						238, 12, 8, 0, 13, 9, 13, 31, 8, 0, 32, 9, 29, 41, 8, 0, 42, 9, 41, 47, 8, 0, 57, 9, 44,
-						64, 8, 0, 90, 9, 51, 255, 8, 0,
-					]
-				)).length) > 0 &&
-					s < u &&
-					((i = a), (u = s)),
-				(s = (a = (function (r) {
-					for (
-						var e, n = r.length, t = (n + 1) & -4, f = 0, h = t > 0 ? [240] : [], i = 0;
-						i < t;
-						i++
-					) {
-						if (i < t - 1) {
-							if ((e = r.charCodeAt(i)) < 32 || e > 94) return [];
-						} else e = 31;
-						((f = 64 * f + (63 & e)),
-							3 == (3 & i) && (h.push(f >> 16), h.push((f >> 8) & 255), h.push(255 & f), (f = 0)));
-					}
-					return t > n ? h : h.concat(o(r.substr(0 == t ? 0 : t - 1)));
-				})(r)).length) > 0 &&
-					s < u &&
-					((i = a), (u = s)),
-				(s = (a = (function (r) {
-					var e = [231],
-						n = r.length;
-					(250 < n && e.push((37 + ((n / 250) | 0)) & 255),
-						e.push(((n % 250) + ((149 * (e.length + 1)) % 255) + 1) & 255));
-					for (var t = 0; t < n; t++)
-						e.push((r.charCodeAt(t) + ((149 * (e.length + 1)) % 255) + 1) & 255);
-					return e;
-				})(r)).length) > 0 &&
-					s < u &&
-					((i = a), (u = s)));
-			var l,
-				c,
-				p,
-				v,
-				g,
-				d,
-				w,
-				A,
-				m = 1,
-				C = 1,
-				b = -1,
-				y = 1,
-				M = new Array(70),
-				x = new Array(70),
-				z = new Array(256),
-				E = new Array(255);
-			if (e && u < 50) {
-				a = [16, 7, 28, 11, 24, 14, 32, 18, 32, 24, 44, 28];
-				do {
-					s = ((c = a[++b]) * (l = 6 + (12 & b))) / 8;
-				} while (s - a[++b] < u);
-				c > 25 && (m = 2);
-			} else {
-				((c = l = 6),
-					(g = 2),
-					(a = [
-						5, 7, 10, 12, 14, 18, 20, 24, 28, 36, 42, 48, 56, 68, 84, 112, 144, 192, 224, 272, 336,
-						408, 496, 620,
-					]));
-				do {
-					if (++b == a.length) return [0, 0];
-					(c > 11 * g && (g = (4 + g) & 12), (s = ((c = l += g) * l) >> 3));
-				} while (s - a[b] < u);
-				(c > 27 && (C = m = 2 * ((c / 54) | 0) + 2), s > 255 && (y = 2 * (s >> 9) + 2));
-			}
-			for (p = c / m, v = l / C, u < s - (A = a[b]) && (i[u++] = 129); u < s - A; )
-				i[u++] = (((149 * u) % 253) + 130) % 254;
-			for (A /= y, b = 1, g = 0; g < 255; g++)
-				((E[g] = b), (z[b] = g), (b += b) > 255 && (b ^= 301));
-			for (M[A] = 0, g = 1; g <= A; g++)
-				for (M[(b = A - g)] = 1; b < A; b++) M[b] = M[b + 1] ^ E[(z[M[b]] + g) % 255];
-			for (d = 0; d < y; d++) {
-				for (g = 0; g <= A; g++) x[g] = 0;
-				for (g = d; g < u; g += y)
-					for (b = 0, j = x[0] ^ i[g]; b < A; b++)
-						x[b] = x[b + 1] ^ (j ? E[(z[M[b]] + z[j]) % 255] : 0);
-				for (g = 0; g < A; g++) i[u + d + g * y] = x[g];
-			}
-			for (g = 0; g < l + 2 * C; g += v + 2)
-				for (b = 0; b < c + 2 * m; b++) (f(b, g + v + 1), 0 == (1 & b) && f(b, g));
-			for (g = 0; g < c + 2 * m; g += p + 2)
-				for (b = 0; b < l; b++)
-					(f(g, b + 2 * ((b / v) | 0) + 1), 1 == (1 & b) && f(g + p + 1, b + 2 * ((b / v) | 0)));
-			for (
-				A = 2, d = 0, w = 4, y = [0, 0, -1, 0, -2, 0, 0, -1, -1, -1, -2, -1, -1, -2, -2, -2], g = 0;
-				g < s;
-				w -= A, d += A
-			) {
-				if (w == l - 3 && -1 == d)
-					a = [c, 6 - l, c, 5 - l, c, 4 - l, c, 3 - l, c - 1, 3 - l, 3, 2, 2, 2, 1, 2];
-				else if (w == l + 1 && 1 == d && 0 == (7 & c) && 6 == (7 & l))
-					a = [
-						c - 2,
-						-l,
-						c - 3,
-						-l,
-						c - 4,
-						-l,
-						c - 2,
-						-1 - l,
-						c - 3,
-						-1 - l,
-						c - 4,
-						-1 - l,
-						c - 2,
-						-2,
-						-1,
-						-2,
-					];
-				else {
-					if (0 == w && d == c - 2 && 3 & c) continue;
-					if (w < 0 || d >= c || w >= l || d < 0)
-						for (w += 2 + (A = -A) / 2, d += 2 - A / 2; w < 0 || d >= c || w >= l || d < 0; )
-							((w -= A), (d += A));
-					if (w == l - 2 && 0 == d && 3 & c)
-						a = [
-							c - 1,
-							3 - l,
-							c - 1,
-							2 - l,
-							c - 2,
-							2 - l,
-							c - 3,
-							2 - l,
-							c - 4,
-							2 - l,
-							0,
-							1,
-							0,
-							0,
-							0,
-							-1,
-						];
-					else if (w == l - 2 && 0 == d && 4 == (7 & c))
-						a = [
-							c - 1,
-							5 - l,
-							c - 1,
-							4 - l,
-							c - 1,
-							3 - l,
-							c - 1,
-							2 - l,
-							c - 2,
-							2 - l,
-							0,
-							1,
-							0,
-							0,
-							0,
-							-1,
-						];
-					else {
-						if (1 == w && d == c - 1 && 0 == (7 & c) && 6 == (7 & l)) continue;
-						a = y;
-					}
-				}
-				for (u = i[g++], b = 0; u > 0; b += 2, u >>= 1)
-					if (1 & u) {
-						var j = d + a[b],
-							k = w + a[b + 1];
-						(j < 0 && ((j += c), (k += 4 - ((c + 4) & 7))),
-							k < 0 && ((k += l), (j += 4 - ((l + 4) & 7))),
-							f(j + 2 * ((j / p) | 0) + 1, k + 2 * ((k / v) | 0) + 1));
-					}
-			}
-			for (g = c; 3 & g; g--) f(g, g);
-			((n = c + 2 * m), (t = l + 2 * C));
-		};
-	return (function () {
-		function f(r) {
-			return /^#[0-9a-f]{3}(?:[0-9a-f]{3})?$/i.test(r);
-		}
-		function o(r, e) {
-			for (var n in ((r = document.createElementNS(g, r)), e || {})) r.setAttribute(n, e[n]);
-			return r;
-		}
-		var h,
-			u,
-			a,
-			s,
-			l,
-			c,
-			p,
-			v = Math.abs,
-			g = 'http://www.w3.org/2000/svg',
-			d = '',
-			w = 'string' == typeof r ? { msg: r } : r || {},
-			A = w.pal || ['#000'],
-			m = v(w.dim) || 256,
-			C = [1, 0, 0, 1, (p = (p = v(w.pad)) > -1 ? p : 0), p],
-			b = f((b = A[0])) ? b : '#000',
-			y = f((y = A[1])) ? y : 0,
-			M = w.vrb ? 0 : 1;
-		for (i(w.msg || '', w.rct), l = n + 2 * p, c = t + 2 * p, a = t; a--; )
-			for (s = 0, u = n; u--; )
-				e[a][u] &&
-					(M
-						? (s++,
-							e[a][u - 1] || ((d += 'M' + u + ',' + a + 'h' + s + 'v1h-' + s + 'v-1z'), (s = 0)))
-						: (d += 'M' + u + ',' + a + 'h1v1h-1v-1z'));
-		return (
-			(h = o('svg', {
-				viewBox: [0, 0, l, c].join(' '),
-				width: ((m / c) * l) | 0,
-				height: m,
-				fill: b,
-				'shape-rendering': 'crispEdges',
-				xmlns: g,
-				version: '1.1',
-			})),
-			y && h.appendChild(o('path', { fill: y, d: 'M0,0v' + c + 'h' + l + 'V0H0Z' })),
-			h.appendChild(o('path', { transform: 'matrix(' + C + ')', d: d })),
-			h
-		);
-	})();
-}
+/** https://github.com/datalog/datamatrix-svg under MIT license */
+'use strict';
+export function DATAMatrix(r) {
+	var e = [],
+		n = 0,
+		t = 0,
+		f = function (r, n) {
+			((e[n] = e[n] || []), (e[n][r] = 1));
+		},
+		o = function (r) {
+			for (var e = [], n = r.length, t = 0; t < n; t++) {
+				var f = r.charCodeAt(t),
+					o = t + 1 < n ? r.charCodeAt(t + 1) : 0;
+				f > 47 && f < 58 && o > 47 && o < 58
+					? (e.push(10 * (f - 48) + o + 82), t++)
+					: f > 127
+						? (e.push(235), e.push((f - 127) & 255))
+						: e.push(f + 1);
+			}
+			return e;
+		},
+		h = function (r, e) {
+			var n,
+				t,
+				f = 0,
+				h = 0,
+				i = r.length,
+				u = [e[0]],
+				a = function (r) {
+					((h = 40 * h + r), 2 == f++ && (u.push(++h >> 8), u.push(255 & h), (f = h = 0)));
+				};
+			for (n = 0; n < i && (0 != f || n != i - 1); n++) {
+				var s = r.charCodeAt(n);
+				for (s > 127 && 238 != u[0] && (a(1), a(30), (s -= 128)), t = 1; s > e[t]; t += 3);
+				var l = e[t + 1];
+				if (8 == l || (9 == l && 0 == f && n == i - 1)) return [];
+				if (l < 5 && 2 == f && n == i - 1) break;
+				(l < 5 && a(l), a(s - e[t + 2]));
+			}
+			return (
+				2 == f && 238 !== u[0] && a(0),
+				u.push(254),
+				(f > 0 || n < i) && (u = u.concat(o(r.substr(n - f)))),
+				u
+			);
+		},
+		i = function (r, e) {
+			r = unescape(encodeURI(r));
+			var i = o(r),
+				u = i.length,
+				a = h(
+					r,
+					[
+						230, 31, 0, 0, 32, 9, 29, 47, 1, 33, 57, 9, 44, 64, 1, 43, 90, 9, 51, 95, 1, 69, 127, 2,
+						96, 255, 1, 0,
+					]
+				),
+				s = a.length;
+			(s > 0 && s < u && ((i = a), (u = s)),
+				(s = (a = h(
+					r,
+					[
+						239, 31, 0, 0, 32, 9, 29, 47, 1, 33, 57, 9, 44, 64, 1, 43, 90, 2, 64, 95, 1, 69, 122, 9,
+						83, 127, 2, 96, 255, 1, 0,
+					]
+				)).length) > 0 &&
+					s < u &&
+					((i = a), (u = s)),
+				(s = (a = h(
+					r,
+					[
+						238, 12, 8, 0, 13, 9, 13, 31, 8, 0, 32, 9, 29, 41, 8, 0, 42, 9, 41, 47, 8, 0, 57, 9, 44,
+						64, 8, 0, 90, 9, 51, 255, 8, 0,
+					]
+				)).length) > 0 &&
+					s < u &&
+					((i = a), (u = s)),
+				(s = (a = (function (r) {
+					for (
+						var e, n = r.length, t = (n + 1) & -4, f = 0, h = t > 0 ? [240] : [], i = 0;
+						i < t;
+						i++
+					) {
+						if (i < t - 1) {
+							if ((e = r.charCodeAt(i)) < 32 || e > 94) return [];
+						} else e = 31;
+						((f = 64 * f + (63 & e)),
+							3 == (3 & i) && (h.push(f >> 16), h.push((f >> 8) & 255), h.push(255 & f), (f = 0)));
+					}
+					return t > n ? h : h.concat(o(r.substr(0 == t ? 0 : t - 1)));
+				})(r)).length) > 0 &&
+					s < u &&
+					((i = a), (u = s)),
+				(s = (a = (function (r) {
+					var e = [231],
+						n = r.length;
+					(250 < n && e.push((37 + ((n / 250) | 0)) & 255),
+						e.push(((n % 250) + ((149 * (e.length + 1)) % 255) + 1) & 255));
+					for (var t = 0; t < n; t++)
+						e.push((r.charCodeAt(t) + ((149 * (e.length + 1)) % 255) + 1) & 255);
+					return e;
+				})(r)).length) > 0 &&
+					s < u &&
+					((i = a), (u = s)));
+			var l,
+				c,
+				p,
+				v,
+				g,
+				d,
+				w,
+				A,
+				m = 1,
+				C = 1,
+				b = -1,
+				y = 1,
+				M = new Array(70),
+				x = new Array(70),
+				z = new Array(256),
+				E = new Array(255);
+			if (e && u < 50) {
+				a = [16, 7, 28, 11, 24, 14, 32, 18, 32, 24, 44, 28];
+				do {
+					s = ((c = a[++b]) * (l = 6 + (12 & b))) / 8;
+				} while (s - a[++b] < u);
+				c > 25 && (m = 2);
+			} else {
+				((c = l = 6),
+					(g = 2),
+					(a = [
+						5, 7, 10, 12, 14, 18, 20, 24, 28, 36, 42, 48, 56, 68, 84, 112, 144, 192, 224, 272, 336,
+						408, 496, 620,
+					]));
+				do {
+					if (++b == a.length) return [0, 0];
+					(c > 11 * g && (g = (4 + g) & 12), (s = ((c = l += g) * l) >> 3));
+				} while (s - a[b] < u);
+				(c > 27 && (C = m = 2 * ((c / 54) | 0) + 2), s > 255 && (y = 2 * (s >> 9) + 2));
+			}
+			for (p = c / m, v = l / C, u < s - (A = a[b]) && (i[u++] = 129); u < s - A; )
+				i[u++] = (((149 * u) % 253) + 130) % 254;
+			for (A /= y, b = 1, g = 0; g < 255; g++)
+				((E[g] = b), (z[b] = g), (b += b) > 255 && (b ^= 301));
+			for (M[A] = 0, g = 1; g <= A; g++)
+				for (M[(b = A - g)] = 1; b < A; b++) M[b] = M[b + 1] ^ E[(z[M[b]] + g) % 255];
+			for (d = 0; d < y; d++) {
+				for (g = 0; g <= A; g++) x[g] = 0;
+				for (g = d; g < u; g += y)
+					for (b = 0, j = x[0] ^ i[g]; b < A; b++)
+						x[b] = x[b + 1] ^ (j ? E[(z[M[b]] + z[j]) % 255] : 0);
+				for (g = 0; g < A; g++) i[u + d + g * y] = x[g];
+			}
+			for (g = 0; g < l + 2 * C; g += v + 2)
+				for (b = 0; b < c + 2 * m; b++) (f(b, g + v + 1), 0 == (1 & b) && f(b, g));
+			for (g = 0; g < c + 2 * m; g += p + 2)
+				for (b = 0; b < l; b++)
+					(f(g, b + 2 * ((b / v) | 0) + 1), 1 == (1 & b) && f(g + p + 1, b + 2 * ((b / v) | 0)));
+			for (
+				A = 2, d = 0, w = 4, y = [0, 0, -1, 0, -2, 0, 0, -1, -1, -1, -2, -1, -1, -2, -2, -2], g = 0;
+				g < s;
+				w -= A, d += A
+			) {
+				if (w == l - 3 && -1 == d)
+					a = [c, 6 - l, c, 5 - l, c, 4 - l, c, 3 - l, c - 1, 3 - l, 3, 2, 2, 2, 1, 2];
+				else if (w == l + 1 && 1 == d && 0 == (7 & c) && 6 == (7 & l))
+					a = [
+						c - 2,
+						-l,
+						c - 3,
+						-l,
+						c - 4,
+						-l,
+						c - 2,
+						-1 - l,
+						c - 3,
+						-1 - l,
+						c - 4,
+						-1 - l,
+						c - 2,
+						-2,
+						-1,
+						-2,
+					];
+				else {
+					if (0 == w && d == c - 2 && 3 & c) continue;
+					if (w < 0 || d >= c || w >= l || d < 0)
+						for (w += 2 + (A = -A) / 2, d += 2 - A / 2; w < 0 || d >= c || w >= l || d < 0; )
+							((w -= A), (d += A));
+					if (w == l - 2 && 0 == d && 3 & c)
+						a = [
+							c - 1,
+							3 - l,
+							c - 1,
+							2 - l,
+							c - 2,
+							2 - l,
+							c - 3,
+							2 - l,
+							c - 4,
+							2 - l,
+							0,
+							1,
+							0,
+							0,
+							0,
+							-1,
+						];
+					else if (w == l - 2 && 0 == d && 4 == (7 & c))
+						a = [
+							c - 1,
+							5 - l,
+							c - 1,
+							4 - l,
+							c - 1,
+							3 - l,
+							c - 1,
+							2 - l,
+							c - 2,
+							2 - l,
+							0,
+							1,
+							0,
+							0,
+							0,
+							-1,
+						];
+					else {
+						if (1 == w && d == c - 1 && 0 == (7 & c) && 6 == (7 & l)) continue;
+						a = y;
+					}
+				}
+				for (u = i[g++], b = 0; u > 0; b += 2, u >>= 1)
+					if (1 & u) {
+						var j = d + a[b],
+							k = w + a[b + 1];
+						(j < 0 && ((j += c), (k += 4 - ((c + 4) & 7))),
+							k < 0 && ((k += l), (j += 4 - ((l + 4) & 7))),
+							f(j + 2 * ((j / p) | 0) + 1, k + 2 * ((k / v) | 0) + 1));
+					}
+			}
+			for (g = c; 3 & g; g--) f(g, g);
+			((n = c + 2 * m), (t = l + 2 * C));
+		};
+	return (function () {
+		function f(r) {
+			return /^#[0-9a-f]{3}(?:[0-9a-f]{3})?$/i.test(r);
+		}
+		function o(r, e) {
+			for (var n in ((r = document.createElementNS(g, r)), e || {})) r.setAttribute(n, e[n]);
+			return r;
+		}
+		var h,
+			u,
+			a,
+			s,
+			l,
+			c,
+			p,
+			v = Math.abs,
+			g = 'http://www.w3.org/2000/svg',
+			d = '',
+			w = 'string' == typeof r ? { msg: r } : r || {},
+			A = w.pal || ['#000'],
+			m = v(w.dim) || 256,
+			C = [1, 0, 0, 1, (p = (p = v(w.pad)) > -1 ? p : 0), p],
+			b = f((b = A[0])) ? b : '#000',
+			y = f((y = A[1])) ? y : 0,
+			M = w.vrb ? 0 : 1;
+		for (i(w.msg || '', w.rct), l = n + 2 * p, c = t + 2 * p, a = t; a--; )
+			for (s = 0, u = n; u--; )
+				e[a][u] &&
+					(M
+						? (s++,
+							e[a][u - 1] || ((d += 'M' + u + ',' + a + 'h' + s + 'v1h-' + s + 'v-1z'), (s = 0)))
+						: (d += 'M' + u + ',' + a + 'h1v1h-1v-1z'));
+		return (
+			(h = o('svg', {
+				viewBox: [0, 0, l, c].join(' '),
+				width: ((m / c) * l) | 0,
+				height: m,
+				fill: b,
+				'shape-rendering': 'crispEdges',
+				xmlns: g,
+				version: '1.1',
+			})),
+			y && h.appendChild(o('path', { fill: y, d: 'M0,0v' + c + 'h' + l + 'V0H0Z' })),
+			h.appendChild(o('path', { transform: 'matrix(' + C + ')', d: d })),
+			h
+		);
+	})();
+}

package/dist/Helpers/Helpers.svelte.d.ts

@@ -42,10 +42,8 @@ export declare const vowels: SvelteSet<string>;
  */
 export declare function generateWeakId<T extends string>(): T;
 /**
- * @deprecated - use `generateWeakId`; the short form trades collision
- * resistance for brevity and is NOT suitable for security tokens. The
- * rename is part of the SecureUUIDs follow-up; this alias is preserved
- * to avoid breaking existing consumers in the same release.
+ * @deprecated use `generateWeakId`. This short-form id trades collision
+ * resistance for brevity and is NOT suitable for security tokens.
  */
 export declare function generateShortUUID<T extends string>(): T;
 /**
@@ -135,6 +133,51 @@ export declare function SQLFriendlyWithLocalTime(date: InputDate | InputDateWith
  * timestamps consistently across scoria.
  */
 export declare const localTimeFormat: Intl.DateTimeFormat;
+/**
+ * Default locale used by {@link formatDate} / {@link formatDateTime}
+ * when a caller does not pass one explicitly. UK English — a 24-hour
+ * clock and `DD/MM/YYYY` day-first ordering.
+ */
+export declare const defaultDateLocale = "en-GB";
+/**
+ * Canonical date + time display formatter. Use this anywhere a
+ * timestamp is shown to a user — table cells, cards, modals, headers —
+ * so every surface formats identically.
+ *
+ * The optional `locale` (a BCP-47 tag such as `'en-GB'`, `'en-US'`,
+ * `'de-DE'`) selects the display conventions: it drives the
+ * day/month/year ordering and separators — `en-GB` → `19/05/2026,
+ * 14:30`, `en-US` → `05/19/2026, 14:30`. It defaults to
+ * {@link defaultDateLocale}. The clock is always 24-hour and the
+ * timezone is the runtime-resolved one regardless of locale.
+ *
+ * - `Date` values format directly.
+ * - `string` / `number` values are parsed via `new Date(...)`. An
+ *   unparseable string is returned unchanged (so a non-date value is
+ *   not silently blanked); an unparseable number yields `''`.
+ * - `null` / `undefined` / empty string yield `''`.
+ *
+ * For a time-only render use {@link localTimeFormat}; for a date with
+ * no time use {@link formatDate}; for the SQL-backend serialisation
+ * shapes use {@link SQLFriendly} / {@link SQLFriendlyWithLocalTime}.
+ */
+export declare function formatDateTime(value: Date | string | number | null | undefined, locale?: string): string;
+/**
+ * Canonical date-only display formatter. Use this for values that carry
+ * no meaningful time component — due dates, expiry dates, pod-line date
+ * attributes — so every surface formats identically. When the value
+ * also has a time the user needs to see, use {@link formatDateTime}.
+ *
+ * The optional `locale` works exactly as in {@link formatDateTime} — it
+ * selects the day/month/year ordering and separators and defaults to
+ * {@link defaultDateLocale}.
+ *
+ * Parsing and null-handling match {@link formatDateTime}: a `Date`
+ * formats directly; `string` / `number` are parsed via `new Date(...)`;
+ * an unparseable string is returned unchanged; `null` / `undefined` /
+ * empty string yield `''`.
+ */
+export declare function formatDate(value: Date | string | number | null | undefined, locale?: string): string;
 /**
  * Barcode-scanner helper. Wire as an `onkeydown` on **buttons and
  * other non-text focusable elements** that should yield focus when a