@skalar-saas/design-system 0.3.0 → 0.3.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/{index-CBxiL0XI.js → index-BbIqrSUv.js} +10 -10
- package/dist/{index-CmeHm3Gj.cjs.map → index-BbIqrSUv.js.map} +1 -1
- package/dist/{index-CmeHm3Gj.cjs → index-Bev29pQU.cjs} +3 -3
- package/dist/index-Bev29pQU.cjs.map +1 -0
- package/dist/{index-CmdJGpQx.cjs → index-DLG3xG90.cjs} +2 -2
- package/dist/{index-CmdJGpQx.cjs.map → index-DLG3xG90.cjs.map} +1 -1
- package/dist/{index-CvwqVp9Z.js → index-DzePicPK.js} +2 -2
- package/dist/{index-CvwqVp9Z.js.map → index-DzePicPK.js.map} +1 -1
- package/dist/index.js +1 -1
- package/dist/index.mjs +1 -1
- package/package.json +1 -1
- package/dist/index-CBxiL0XI.js.map +0 -1
|
@@ -4930,7 +4930,7 @@ const w4 = {
|
|
|
4930
4930
|
)
|
|
4931
4931
|
] }) })
|
|
4932
4932
|
}
|
|
4933
|
-
), k4 = A.lazy(() => import("./index-
|
|
4933
|
+
), k4 = A.lazy(() => import("./index-DzePicPK.js")), ig = ({ children: e }) => /* @__PURE__ */ s(g6, { fallback: /* @__PURE__ */ s("span", { children: e }), children: /* @__PURE__ */ s(k4, { children: e }) }), T4 = A.memo(({
|
|
4934
4934
|
messages: e,
|
|
4935
4935
|
showTypingIndicator: t = !1,
|
|
4936
4936
|
children: r,
|
|
@@ -8238,14 +8238,14 @@ function dg(e, t) {
|
|
|
8238
8238
|
return e.filter((n) => n.parentId != null && r.includes(n.parentId) ? (n.children?.length && r.push(n.id), !1) : !0);
|
|
8239
8239
|
}
|
|
8240
8240
|
function TA(e, t, r, n, a, i) {
|
|
8241
|
-
const o = e.findIndex(({ id:
|
|
8242
|
-
let
|
|
8243
|
-
i != null && (
|
|
8244
|
-
const
|
|
8245
|
-
let
|
|
8246
|
-
return p >=
|
|
8247
|
-
function
|
|
8248
|
-
return
|
|
8241
|
+
const o = e.findIndex(({ id: C }) => C === r), l = e.findIndex(({ id: C }) => C === t), c = e[l], u = s3(e, l, o), d = u[o - 1], f = u[o + 1], h = Math.round(n / a), p = c.depth + h, g = !!d && d.kind !== "section" && d.kind !== "divider";
|
|
8242
|
+
let v = d ? g ? d.depth + 1 : d.depth : 0;
|
|
8243
|
+
i != null && (v = Math.min(v, i));
|
|
8244
|
+
const m = f ? f.depth : 0;
|
|
8245
|
+
let y = p;
|
|
8246
|
+
return p >= v ? y = v : p < m && (y = m), { depth: y, maxDepth: v, minDepth: m, parentId: x() };
|
|
8247
|
+
function x() {
|
|
8248
|
+
return y === 0 || !d ? null : y === d.depth ? d.parentId : y > d.depth ? d.id : u.slice(0, o).reverse().find((N) => N.depth === y)?.parentId ?? null;
|
|
8249
8249
|
}
|
|
8250
8250
|
}
|
|
8251
8251
|
const nU = ({
|
|
@@ -39750,4 +39750,4 @@ export {
|
|
|
39750
39750
|
yO as y,
|
|
39751
39751
|
jr as z
|
|
39752
39752
|
};
|
|
39753
|
-
//# sourceMappingURL=index-
|
|
39753
|
+
//# sourceMappingURL=index-BbIqrSUv.js.map
|