@pibit.ai/cure-design-system 0.6.39 → 0.6.41
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.d.ts +2 -1
- package/dist/index.d.ts.map +1 -1
- package/dist/index.js +707 -691
- package/dist/node_modules/framer-motion/dist/es/components/Reorder/namespace.js +6 -0
- package/dist/patterns/filter-group/index.d.ts +1 -0
- package/dist/patterns/filter-group/index.d.ts.map +1 -1
- package/dist/primitives/hierarchical-select/HierarchicalSelect.d.ts +6 -0
- package/dist/primitives/hierarchical-select/HierarchicalSelect.d.ts.map +1 -0
- package/dist/primitives/hierarchical-select/HierarchicalSelect.js +156 -0
- package/dist/primitives/hierarchical-select/components/HierarchicalItem.d.ts +6 -0
- package/dist/primitives/hierarchical-select/components/HierarchicalItem.d.ts.map +1 -0
- package/dist/primitives/hierarchical-select/components/HierarchicalItem.js +102 -0
- package/dist/primitives/hierarchical-select/components/HighlightedText.d.ts +6 -0
- package/dist/primitives/hierarchical-select/components/HighlightedText.d.ts.map +1 -0
- package/dist/primitives/hierarchical-select/components/HighlightedText.js +22 -0
- package/dist/primitives/hierarchical-select/components/index.d.ts +6 -0
- package/dist/primitives/hierarchical-select/components/index.d.ts.map +1 -0
- package/dist/primitives/hierarchical-select/index.d.ts +11 -0
- package/dist/primitives/hierarchical-select/index.d.ts.map +1 -0
- package/dist/primitives/hierarchical-select/types/index.d.ts +109 -0
- package/dist/primitives/hierarchical-select/types/index.d.ts.map +1 -0
- package/dist/primitives/hierarchical-select/utils/normalize.d.ts +18 -0
- package/dist/primitives/hierarchical-select/utils/normalize.d.ts.map +1 -0
- package/dist/primitives/hierarchical-select/utils/search.d.ts +17 -0
- package/dist/primitives/hierarchical-select/utils/search.d.ts.map +1 -0
- package/dist/primitives/hierarchical-select/utils/search.js +24 -0
- package/dist/primitives/hierarchical-select/utils/selection.d.ts +37 -0
- package/dist/primitives/hierarchical-select/utils/selection.d.ts.map +1 -0
- package/dist/primitives/hierarchical-select/utils/selection.js +126 -0
- package/dist/styles/components.css +1 -1
- package/package.json +1 -1
|
@@ -0,0 +1,126 @@
|
|
|
1
|
+
function g(t, e) {
|
|
2
|
+
var s;
|
|
3
|
+
return ((s = t.items.get(e)) == null ? void 0 : s.disabled) === !0;
|
|
4
|
+
}
|
|
5
|
+
function C(t, e) {
|
|
6
|
+
return e.filter((s) => !g(t, s));
|
|
7
|
+
}
|
|
8
|
+
function S(t, e, s) {
|
|
9
|
+
var p;
|
|
10
|
+
const c = e.childrenMap.get(t) || [];
|
|
11
|
+
if (c.length === 0) {
|
|
12
|
+
const n = e.items.get(t);
|
|
13
|
+
return g(e, t), n != null && n.selected ? "selected" : "unselected";
|
|
14
|
+
}
|
|
15
|
+
if (g(e, t)) return "unselected";
|
|
16
|
+
let l = C(e, c);
|
|
17
|
+
if (s && (l = l.filter((n) => s.has(n))), l.length === 0)
|
|
18
|
+
return (p = e.items.get(t)) != null && p.selected ? "selected" : "unselected";
|
|
19
|
+
const d = l.map((n) => S(n, e, s)), u = d.every((n) => n === "selected"), h = d.every((n) => n === "unselected");
|
|
20
|
+
return u ? "selected" : h ? "unselected" : "indeterminate";
|
|
21
|
+
}
|
|
22
|
+
function E(t, e, s) {
|
|
23
|
+
if (g(e, t))
|
|
24
|
+
return e;
|
|
25
|
+
const c = new Map(e.items), d = S(t, e, s) !== "selected", u = /* @__PURE__ */ new Set(), h = (o) => {
|
|
26
|
+
const i = e.childrenMap.get(o) || [];
|
|
27
|
+
i.length > 0 && u.add(o), i.forEach((a) => {
|
|
28
|
+
if (!g(e, a) && (!s || s.has(a))) {
|
|
29
|
+
const M = c.get(a), w = e.childrenMap.get(a) || [];
|
|
30
|
+
M && (w.length === 0 ? c.set(a, { ...M, selected: d }) : u.add(a)), h(a);
|
|
31
|
+
}
|
|
32
|
+
});
|
|
33
|
+
}, p = c.get(t), n = e.childrenMap.get(t) || [];
|
|
34
|
+
p && (n.length === 0 ? g(e, t) || c.set(t, { ...p, selected: d }) : u.add(t)), h(t);
|
|
35
|
+
const r = Array.from(u).sort((o, i) => {
|
|
36
|
+
const a = e.depthMap.get(o) ?? 0;
|
|
37
|
+
return (e.depthMap.get(i) ?? 0) - a;
|
|
38
|
+
});
|
|
39
|
+
for (const o of r) {
|
|
40
|
+
const i = c.get(o);
|
|
41
|
+
if (i) {
|
|
42
|
+
const a = S(o, { ...e, items: c });
|
|
43
|
+
c.set(o, {
|
|
44
|
+
...i,
|
|
45
|
+
selected: a !== "unselected"
|
|
46
|
+
});
|
|
47
|
+
}
|
|
48
|
+
}
|
|
49
|
+
let f = e.parentMap.get(t);
|
|
50
|
+
for (; f; ) {
|
|
51
|
+
const o = c.get(f);
|
|
52
|
+
if (o) {
|
|
53
|
+
const i = S(f, { ...e, items: c });
|
|
54
|
+
c.set(f, {
|
|
55
|
+
...o,
|
|
56
|
+
selected: i !== "unselected"
|
|
57
|
+
});
|
|
58
|
+
}
|
|
59
|
+
f = e.parentMap.get(f) ?? null;
|
|
60
|
+
}
|
|
61
|
+
return { ...e, items: c };
|
|
62
|
+
}
|
|
63
|
+
function y(t) {
|
|
64
|
+
const e = /* @__PURE__ */ new Set();
|
|
65
|
+
return t.items.forEach((s, c) => {
|
|
66
|
+
s.hasChildren && e.add(c);
|
|
67
|
+
}), e;
|
|
68
|
+
}
|
|
69
|
+
function m(t, e) {
|
|
70
|
+
const s = [];
|
|
71
|
+
return t.items.forEach((c, l) => {
|
|
72
|
+
!c.hasChildren && !c.disabled && (!e || e.has(l)) && s.push(l);
|
|
73
|
+
}), s;
|
|
74
|
+
}
|
|
75
|
+
function A(t, e) {
|
|
76
|
+
var l;
|
|
77
|
+
const s = m(t, e);
|
|
78
|
+
if (s.length === 0) return "unselected";
|
|
79
|
+
let c = 0;
|
|
80
|
+
for (const d of s)
|
|
81
|
+
(l = t.items.get(d)) != null && l.selected && c++;
|
|
82
|
+
return c === 0 ? "unselected" : c === s.length ? "selected" : "indeterminate";
|
|
83
|
+
}
|
|
84
|
+
function B(t, e) {
|
|
85
|
+
const c = A(t, e) !== "selected", l = new Map(t.items), d = m(t, e);
|
|
86
|
+
for (const n of d) {
|
|
87
|
+
const r = l.get(n);
|
|
88
|
+
r && !r.disabled && l.set(n, { ...r, selected: c });
|
|
89
|
+
}
|
|
90
|
+
const u = /* @__PURE__ */ new Set();
|
|
91
|
+
for (const n of d) {
|
|
92
|
+
let r = t.parentMap.get(n);
|
|
93
|
+
for (; r; )
|
|
94
|
+
u.add(r), r = t.parentMap.get(r) ?? null;
|
|
95
|
+
}
|
|
96
|
+
const h = Array.from(u).sort((n, r) => {
|
|
97
|
+
const f = t.depthMap.get(n) ?? 0;
|
|
98
|
+
return (t.depthMap.get(r) ?? 0) - f;
|
|
99
|
+
}), p = { ...t, items: l };
|
|
100
|
+
for (const n of h) {
|
|
101
|
+
const r = l.get(n);
|
|
102
|
+
if (r) {
|
|
103
|
+
const f = S(n, p);
|
|
104
|
+
l.set(n, {
|
|
105
|
+
...r,
|
|
106
|
+
selected: f !== "unselected"
|
|
107
|
+
});
|
|
108
|
+
}
|
|
109
|
+
}
|
|
110
|
+
return { ...t, items: l };
|
|
111
|
+
}
|
|
112
|
+
function P(t) {
|
|
113
|
+
let e = 0;
|
|
114
|
+
return t.items.forEach((s) => {
|
|
115
|
+
!s.hasChildren && s.selected && e++;
|
|
116
|
+
}), e;
|
|
117
|
+
}
|
|
118
|
+
export {
|
|
119
|
+
P as countSelectedItems,
|
|
120
|
+
y as getAllParentIds,
|
|
121
|
+
A as getSelectAllState,
|
|
122
|
+
S as getSelectionState,
|
|
123
|
+
m as getVisibleLeafIds,
|
|
124
|
+
B as toggleSelectAll,
|
|
125
|
+
E as toggleSelection
|
|
126
|
+
};
|