@iress-oss/ids-components 6.0.1 → 6.2.0

package/dist/helpers/label-value/highlightQueryInLabel.js

@@ -1,2 +1,378 @@
-import { t as e } from "../../highlightQueryInLabel-BLIy9JHT.js";
-export { e as highlightQueryInLabel };
+import { n as e, t } from "../../rolldown-runtime-3b4jIN3o.js";
+import { jsx as n } from "react/jsx-runtime";
+//#region ../../node_modules/fuzzysort/fuzzysort.js
+var r = /* @__PURE__ */ t(((e, t) => {
+	((e, n) => {
+		typeof define == "function" && define.amd ? define([], n) : typeof t == "object" && t.exports ? t.exports = n() : e.fuzzysort = n();
+	})(e, (e) => {
+		var t = (e, t) => {
+			if (!e || !t) return F;
+			var n = p(e);
+			j(t) || (t = f(t));
+			var r = n.bitflags;
+			return (r & t._bitflags) === r ? h(n, t) : F;
+		}, n = (e, t, n) => {
+			if (!e) return n?.all ? m(t, n) : P;
+			var r = p(e), i = r.bitflags, a = r.containsSpace, o = u(n?.threshold || 0), c = n?.limit || M, l = 0, d = 0, g = t.length;
+			function _(e) {
+				l < c ? (L.add(e), ++l) : (++d, e._score > L.peek()._score && L.replaceTop(e));
+			}
+			if (n?.key) for (var v = n.key, y = 0; y < g; ++y) {
+				var b = t[y], x = A(b, v);
+				if (x && (j(x) || (x = f(x)), (i & x._bitflags) === i)) {
+					var S = h(r, x);
+					S !== F && (S._score < o || (S.obj = b, _(S)));
+				}
+			}
+			else if (n?.keys) {
+				var C = n.keys, w = C.length;
+				outer: for (var y = 0; y < g; ++y) {
+					for (var b = t[y], T = 0, R = 0; R < w; ++R) {
+						var v = C[R], x = A(b, v);
+						if (!x) {
+							O[R] = I;
+							continue;
+						}
+						j(x) || (x = f(x)), O[R] = x, T |= x._bitflags;
+					}
+					if ((i & T) === i) {
+						if (a) for (let e = 0; e < r.spaceSearches.length; e++) E[e] = N;
+						for (var R = 0; R < w; ++R) {
+							if (x = O[R], x === I) {
+								k[R] = I;
+								continue;
+							}
+							if (k[R] = h(r, x, !1, a), k[R] === F) {
+								k[R] = I;
+								continue;
+							}
+							if (a) for (let e = 0; e < r.spaceSearches.length; e++) {
+								if (D[e] > -1e3 && E[e] > N) {
+									var z = (E[e] + D[e]) / 4;
+									z > E[e] && (E[e] = z);
+								}
+								D[e] > E[e] && (E[e] = D[e]);
+							}
+						}
+						if (a) {
+							for (let e = 0; e < r.spaceSearches.length; e++) if (E[e] === N) continue outer;
+						} else {
+							var B = !1;
+							for (let e = 0; e < w; e++) if (k[e]._score !== N) {
+								B = !0;
+								break;
+							}
+							if (!B) continue;
+						}
+						var V = new s(w);
+						for (let e = 0; e < w; e++) V[e] = k[e];
+						if (a) {
+							var H = 0;
+							for (let e = 0; e < r.spaceSearches.length; e++) H += E[e];
+						} else {
+							var H = N;
+							for (let e = 0; e < w; e++) {
+								var S = V[e];
+								if (S._score > -1e3 && H > N) {
+									var z = (H + S._score) / 4;
+									z > H && (H = z);
+								}
+								S._score > H && (H = S._score);
+							}
+						}
+						if (V.obj = b, V._score = H, n?.scoreFn) {
+							if (H = n.scoreFn(V), !H) continue;
+							H = u(H), V._score = H;
+						}
+						H < o || _(V);
+					}
+				}
+			} else for (var y = 0; y < g; ++y) {
+				var x = t[y];
+				if (x && (j(x) || (x = f(x)), (i & x._bitflags) === i)) {
+					var S = h(r, x);
+					S !== F && (S._score < o || _(S));
+				}
+			}
+			if (l === 0) return P;
+			for (var U = Array(l), y = l - 1; y >= 0; --y) U[y] = L.poll();
+			return U.total = l + d, U;
+		}, r = (e, t = "<b>", n = "</b>") => {
+			for (var r = typeof t == "function" ? t : void 0, i = e.target, a = i.length, o = e.indexes, s = "", c = 0, l = 0, u = !1, d = [], f = 0; f < a; ++f) {
+				var p = i[f];
+				if (o[l] === f) {
+					if (++l, u || (u = !0, r ? (d.push(s), s = "") : s += t), l === o.length) {
+						r ? (s += p, d.push(r(s, c++)), s = "", d.push(i.substr(f + 1))) : s += p + n + i.substr(f + 1);
+						break;
+					}
+				} else u && (u = !1, r ? (d.push(r(s, c++)), s = "") : s += n);
+				s += p;
+			}
+			return r ? d : s;
+		}, i = (e) => {
+			typeof e == "number" ? e = "" + e : typeof e != "string" && (e = "");
+			var t = v(e);
+			return c(e, {
+				_targetLower: t._lower,
+				_targetLowerCodes: t.lowerCodes,
+				_bitflags: t.bitflags
+			});
+		}, a = () => {
+			x.clear(), S.clear();
+		};
+		class o {
+			get indexes() {
+				return this._indexes.slice(0, this._indexes.len).sort((e, t) => e - t);
+			}
+			set indexes(e) {
+				return this._indexes = e;
+			}
+			highlight(e, t) {
+				return r(this, e, t);
+			}
+			get score() {
+				return l(this._score);
+			}
+			set score(e) {
+				this._score = u(e);
+			}
+		}
+		class s extends Array {
+			get score() {
+				return l(this._score);
+			}
+			set score(e) {
+				this._score = u(e);
+			}
+		}
+		var c = (e, t) => {
+			let n = new o();
+			return n.target = e, n.obj = t.obj ?? F, n._score = t._score ?? N, n._indexes = t._indexes ?? [], n._targetLower = t._targetLower ?? "", n._targetLowerCodes = t._targetLowerCodes ?? F, n._nextBeginningIndexes = t._nextBeginningIndexes ?? F, n._bitflags = t._bitflags ?? 0, n;
+		}, l = (e) => e === N ? 0 : e > 1 ? e : Math.E ** (((-e + 1) ** .04307 - 1) * -2), u = (e) => e === 0 ? N : e > 1 ? e : 1 - (Math.log(e) / -2 + 1) ** (1 / .04307), d = (e) => {
+			typeof e == "number" ? e = "" + e : typeof e != "string" && (e = ""), e = e.trim();
+			var t = v(e), n = [];
+			if (t.containsSpace) {
+				var r = e.split(/\s+/);
+				r = [...new Set(r)];
+				for (var i = 0; i < r.length; i++) if (r[i] !== "") {
+					var a = v(r[i]);
+					n.push({
+						lowerCodes: a.lowerCodes,
+						_lower: r[i].toLowerCase(),
+						containsSpace: !1
+					});
+				}
+			}
+			return {
+				lowerCodes: t.lowerCodes,
+				_lower: t._lower,
+				containsSpace: t.containsSpace,
+				bitflags: t.bitflags,
+				spaceSearches: n
+			};
+		}, f = (e) => {
+			if (e.length > 999) return i(e);
+			var t = x.get(e);
+			return t === void 0 ? (t = i(e), x.set(e, t), t) : t;
+		}, p = (e) => {
+			if (e.length > 999) return d(e);
+			var t = S.get(e);
+			return t === void 0 ? (t = d(e), S.set(e, t), t) : t;
+		}, m = (e, t) => {
+			var n = [];
+			n.total = e.length;
+			var r = t?.limit || M;
+			if (t?.key) for (var i = 0; i < e.length; i++) {
+				var a = e[i], o = A(a, t.key);
+				if (o != F) {
+					j(o) || (o = f(o));
+					var l = c(o.target, {
+						_score: o._score,
+						obj: a
+					});
+					if (n.push(l), n.length >= r) return n;
+				}
+			}
+			else if (t?.keys) for (var i = 0; i < e.length; i++) {
+				for (var a = e[i], u = new s(t.keys.length), d = t.keys.length - 1; d >= 0; --d) {
+					var o = A(a, t.keys[d]);
+					if (!o) {
+						u[d] = I;
+						continue;
+					}
+					j(o) || (o = f(o)), o._score = N, o._indexes.len = 0, u[d] = o;
+				}
+				if (u.obj = a, u._score = N, n.push(u), n.length >= r) return n;
+			}
+			else for (var i = 0; i < e.length; i++) {
+				var o = e[i];
+				if (o != F && (j(o) || (o = f(o)), o._score = N, o._indexes.len = 0, n.push(o), n.length >= r)) return n;
+			}
+			return n;
+		}, h = (e, t, n = !1, r = !1) => {
+			if (n === !1 && e.containsSpace) return g(e, t, r);
+			for (var i = e._lower, a = e.lowerCodes, s = a[0], c = t._targetLowerCodes, l = a.length, u = c.length, d = 0, f = 0, p = 0;;) {
+				var m = s === c[f];
+				if (m) {
+					if (C[p++] = f, ++d, d === l) break;
+					s = a[d];
+				}
+				if (++f, f >= u) return F;
+			}
+			var d = 0, h = !1, _ = 0, v = t._nextBeginningIndexes;
+			v === F && (v = t._nextBeginningIndexes = b(t.target)), f = C[0] === 0 ? 0 : v[C[0] - 1];
+			var y = 0;
+			if (f !== u) for (;;) if (f >= u) {
+				if (d <= 0 || (++y, y > 200)) break;
+				--d;
+				var x = w[--_];
+				f = v[x];
+			} else {
+				var m = a[d] === c[f];
+				if (m) {
+					if (w[_++] = f, ++d, d === l) {
+						h = !0;
+						break;
+					}
+					++f;
+				} else f = v[f];
+			}
+			var S = l <= 1 ? -1 : t._targetLower.indexOf(i, C[0]), T = !!~S, E = T ? S === 0 || t._nextBeginningIndexes[S - 1] === S : !1;
+			if (T && !E) {
+				for (var D = 0; D < v.length; D = v[D]) if (!(D <= S)) {
+					for (var O = 0; O < l && a[O] === t._targetLowerCodes[D + O]; O++);
+					if (O === l) {
+						S = D, E = !0;
+						break;
+					}
+				}
+			}
+			var k = (e) => {
+				for (var t = 0, n = 0, r = 1; r < l; ++r) e[r] - e[r - 1] !== 1 && (t -= e[r], ++n);
+				var i = e[l - 1] - e[0] - (l - 1);
+				if (t -= (12 + i) * n, e[0] !== 0 && (t -= e[0] * e[0] * .2), !h) t *= 1e3;
+				else {
+					for (var a = 1, r = v[0]; r < u; r = v[r]) ++a;
+					a > 24 && (t *= (a - 24) * 10);
+				}
+				return t -= (u - l) / 2, T && (t /= 1 + l * l * 1), E && (t /= 1 + l * l * 1), t -= (u - l) / 2, t;
+			};
+			if (!h) {
+				if (T) for (var D = 0; D < l; ++D) C[D] = S + D;
+				var A = C, j = k(A);
+			} else if (E) {
+				for (var D = 0; D < l; ++D) C[D] = S + D;
+				var A = C, j = k(C);
+			} else var A = w, j = k(w);
+			t._score = j;
+			for (var D = 0; D < l; ++D) t._indexes[D] = A[D];
+			t._indexes.len = l;
+			let M = new o();
+			return M.target = t.target, M._score = t._score, M._indexes = t._indexes, M;
+		}, g = (e, t, n) => {
+			for (var r = /* @__PURE__ */ new Set(), i = 0, a = F, o = 0, s = e.spaceSearches, c = s.length, l = 0, u = () => {
+				for (let e = l - 1; e >= 0; e--) t._nextBeginningIndexes[T[e * 2 + 0]] = T[e * 2 + 1];
+			}, d = !1, f = 0; f < c; ++f) {
+				D[f] = N;
+				var p = s[f];
+				if (a = h(p, t), n) {
+					if (a === F) continue;
+					d = !0;
+				} else if (a === F) return u(), F;
+				if (f !== c - 1) {
+					var m = a._indexes, g = !0;
+					for (let e = 0; e < m.len - 1; e++) if (m[e + 1] - m[e] !== 1) {
+						g = !1;
+						break;
+					}
+					if (g) {
+						var _ = m[m.len - 1] + 1, v = t._nextBeginningIndexes[_ - 1];
+						for (let e = _ - 1; e >= 0 && v === t._nextBeginningIndexes[e]; e--) t._nextBeginningIndexes[e] = _, T[l * 2 + 0] = e, T[l * 2 + 1] = v, l++;
+					}
+				}
+				i += a._score / c, D[f] = a._score / c, a._indexes[0] < o && (i -= (o - a._indexes[0]) * 2), o = a._indexes[0];
+				for (var y = 0; y < a._indexes.len; ++y) r.add(a._indexes[y]);
+			}
+			if (n && !d) return F;
+			u();
+			var b = h(e, t, !0);
+			if (b !== F && b._score > i) {
+				if (n) for (var f = 0; f < c; ++f) D[f] = b._score / c;
+				return b;
+			}
+			n && (a = t), a._score = i;
+			var f = 0;
+			for (let e of r) a._indexes[f++] = e;
+			return a._indexes.len = f, a;
+		}, _ = (e) => e.replace(/\p{Script=Latin}+/gu, (e) => e.normalize("NFD")).replace(/[\u0300-\u036f]/g, ""), v = (e) => {
+			e = _(e);
+			for (var t = e.length, n = e.toLowerCase(), r = [], i = 0, a = !1, o = 0; o < t; ++o) {
+				var s = r[o] = n.charCodeAt(o);
+				if (s === 32) {
+					a = !0;
+					continue;
+				}
+				var c = s >= 97 && s <= 122 ? s - 97 : s >= 48 && s <= 57 ? 26 : s <= 127 ? 30 : 31;
+				i |= 1 << c;
+			}
+			return {
+				lowerCodes: r,
+				bitflags: i,
+				containsSpace: a,
+				_lower: n
+			};
+		}, y = (e) => {
+			for (var t = e.length, n = [], r = 0, i = !1, a = !1, o = 0; o < t; ++o) {
+				var s = e.charCodeAt(o), c = s >= 65 && s <= 90, l = c || s >= 97 && s <= 122 || s >= 48 && s <= 57, u = c && !i || !a || !l;
+				i = c, a = l, u && (n[r++] = o);
+			}
+			return n;
+		}, b = (e) => {
+			e = _(e);
+			for (var t = e.length, n = y(e), r = [], i = n[0], a = 0, o = 0; o < t; ++o) i > o ? r[o] = i : (i = n[++a], r[o] = i === void 0 ? t : i);
+			return r;
+		}, x = /* @__PURE__ */ new Map(), S = /* @__PURE__ */ new Map(), C = [], w = [], T = [], E = [], D = [], O = [], k = [], A = (e, t) => {
+			var n = e[t];
+			if (n !== void 0) return n;
+			if (typeof t == "function") return t(e);
+			var r = t;
+			Array.isArray(t) || (r = t.split("."));
+			for (var i = r.length, a = -1; e && ++a < i;) e = e[r[a]];
+			return e;
+		}, j = (e) => typeof e == "object" && typeof e._bitflags == "number", M = Infinity, N = -M, P = [];
+		P.total = 0;
+		var F = null, I = i(""), L = ((e) => {
+			var t = [], n = 0, r = {}, i = (e) => {
+				for (var r = 0, i = t[r], a = 1; a < n;) {
+					var o = a + 1;
+					r = a, o < n && t[o]._score < t[a]._score && (r = o), t[r - 1 >> 1] = t[r], a = 1 + (r << 1);
+				}
+				for (var s = r - 1 >> 1; r > 0 && i._score < t[s]._score; s = (r = s) - 1 >> 1) t[r] = t[s];
+				t[r] = i;
+			};
+			return r.add = ((e) => {
+				var r = n;
+				t[n++] = e;
+				for (var i = r - 1 >> 1; r > 0 && e._score < t[i]._score; i = (r = i) - 1 >> 1) t[r] = t[i];
+				t[r] = e;
+			}), r.poll = ((e) => {
+				if (n !== 0) {
+					var r = t[0];
+					return t[0] = t[--n], i(), r;
+				}
+			}), r.peek = ((e) => {
+				if (n !== 0) return t[0];
+			}), r.replaceTop = ((e) => {
+				t[0] = e, i();
+			}), r;
+		})();
+		return {
+			single: t,
+			go: n,
+			prepare: i,
+			cleanup: a
+		};
+	});
+})), i = /* @__PURE__ */ e(r(), 1), a = (e, t, r = "b") => i.default.single(t, e)?.highlight((e, t) => /* @__PURE__ */ n(r, { children: e }, t)) ?? e;
+//#endregion
+export { a as highlightQueryInLabel, r as t };

package/dist/helpers/label-value/highlightQueryInLabelValue.js

@@ -1,4 +1,4 @@
-import { t as e } from "../../highlightQueryInLabel-BLIy9JHT.js";
+import { highlightQueryInLabel as e } from "./highlightQueryInLabel.js";
 //#region src/helpers/label-value/highlightQueryInLabelValue.ts
 var t = (t, n, r) => ({
 	...t,

package/dist/helpers/label-value/searchLabelValues.js

@@ -1,7 +1,8 @@
-import { n as e, r as t } from "../../highlightQueryInLabel-BLIy9JHT.js";
+import { n as e } from "../../rolldown-runtime-3b4jIN3o.js";
+import { t } from "./highlightQueryInLabel.js";
 import { highlightQueryInLabelValue as n } from "./highlightQueryInLabelValue.js";
 //#region src/helpers/label-value/searchLabelValues.ts
-var r = /* @__PURE__ */ t(e(), 1), i = (e, t, i, a = !0) => r.default.go(e, t, {
+var r = /* @__PURE__ */ e(t(), 1), i = (e, t, i, a = !0) => r.default.go(e, t, {
 	key: "label",
 	limit: i,
 	threshold: -5e3,

package/dist/helpers/styling/iressCss.js

@@ -1,4 +1,4 @@
-import { t as e } from "../../css-D3KwXbP0.js";
+import { t as e } from "../../css-R34N3rft.js";
 //#region src/helpers/styling/iressCss.ts
 var t = (t) => e(t);
 //#endregion

package/dist/hooks/useBreakpoint.js

@@ -1,4 +1,4 @@
-import { n as e, t } from "../constants-D0UW4Ewm.js";
+import { n as e, t } from "../constants-DJz-xntC.js";
 import { useSyncExternalStore as n } from "react";
 //#region src/hooks/useBreakpoint.ts
 var r = () => t.find((t) => window.matchMedia(e[t].mediaQuery)?.matches) ?? t[0], i = () => t[0], a = (n) => {

package/dist/hooks/useResponsiveProps.js

@@ -1,4 +1,4 @@
-import { t as e } from "../constants-D0UW4Ewm.js";
+import { t as e } from "../constants-DJz-xntC.js";
 import { useBreakpoint as t } from "./useBreakpoint.js";
 import { useMemo as n } from "react";
 //#region src/hooks/useResponsiveProps.ts