@progress/kendo-vue-inputs 6.5.0-develop.4 → 6.5.0-develop.6
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/cdn/js/kendo-vue-inputs.js +1 -1
- package/index.d.mts +38 -7
- package/index.d.ts +38 -7
- package/input-separator/InputSeparator.js +1 -1
- package/input-separator/InputSeparator.mjs +16 -5
- package/numerictextbox/NumericTextBox.js +1 -1
- package/numerictextbox/NumericTextBox.mjs +72 -69
- package/numerictextbox/utils/main.js +1 -1
- package/numerictextbox/utils/main.mjs +93 -93
- package/package-metadata.js +1 -1
- package/package-metadata.mjs +2 -2
- package/package.json +9 -9
|
@@ -5,64 +5,64 @@
|
|
|
5
5
|
* Licensed under commercial license. See LICENSE.md in the package root for more information
|
|
6
6
|
*-------------------------------------------------------------------------------------------
|
|
7
7
|
*/
|
|
8
|
-
const
|
|
9
|
-
const r =
|
|
8
|
+
const Q = 11111111111111e-7, ae = 0.31111111111111117, de = 1, Y = 1, w = 0, m = /\d/, ee = 15, Ne = (t, n) => t !== void 0 ? t : n, p = (t, n, r) => t === null && t === void 0 ? "" : typeof t == "string" ? t : r.formatNumber(t, n), H = (t) => (String(t).split(".")[1] || "").length, ne = (t, n) => Math.max(H(t), H(n)), ge = (t) => Math.min(t, ee), te = (t, n) => {
|
|
9
|
+
const r = ge(n);
|
|
10
10
|
return parseFloat(t.toFixed(r));
|
|
11
|
-
}, Ne = (t, n, r, e, u, o, a) => {
|
|
12
|
-
const s = ee(t || 0, r || 0), i = te(ne((t || 0) + (r || 0), s), e, u);
|
|
13
|
-
n.eventValue = i, n.currentLooseValue = p(i, o, a), n.selectionStart = n.selectionEnd = D(n.currentLooseValue, m);
|
|
14
11
|
}, Ie = (t, n, r, e, u, o, a) => {
|
|
15
|
-
const s =
|
|
16
|
-
n.eventValue = i, n.currentLooseValue = p(i, o, a), n.selectionStart = n.selectionEnd =
|
|
17
|
-
},
|
|
12
|
+
const s = ne(t || 0, r || 0), i = re(te((t || 0) + (r || 0), s), e, u);
|
|
13
|
+
n.eventValue = i, n.currentLooseValue = p(i, o, a), n.selectionStart = n.selectionEnd = R(n.currentLooseValue, m);
|
|
14
|
+
}, Ce = (t, n, r, e, u, o, a) => {
|
|
15
|
+
const s = ne(t || 0, r || 0), i = re(te((t || 0) - (r || 0), s), e, u);
|
|
16
|
+
n.eventValue = i, n.currentLooseValue = p(i, o, a), n.selectionStart = n.selectionEnd = R(n.currentLooseValue, m);
|
|
17
|
+
}, re = (t, n, r) => t == null ? t : !(t > 1 || t < 1 || t === 1) || r !== void 0 && n !== void 0 && r < n ? null : (r !== void 0 && t > r && (t = r), n !== void 0 && t < n && (t = n), t), fe = (t, n) => {
|
|
18
18
|
const r = n.findIndex(([u, o]) => !!o && t.indexOf(o) === t.length - o.length);
|
|
19
19
|
if (r === -1)
|
|
20
20
|
return -1;
|
|
21
21
|
const e = n[r][1];
|
|
22
22
|
return t.length - e.length;
|
|
23
|
-
},
|
|
23
|
+
}, me = (t, n) => {
|
|
24
24
|
const r = n.findIndex(([u, o]) => !!u && t.indexOf(u) === 0);
|
|
25
25
|
return r === -1 ? -1 : n[r][0].length;
|
|
26
|
-
},
|
|
27
|
-
const e =
|
|
26
|
+
}, Ve = (t, n, r) => {
|
|
27
|
+
const e = fe(t, n);
|
|
28
28
|
if (e !== -1 && r.selectionStart > e) {
|
|
29
29
|
r.selectionStart = r.selectionEnd = e;
|
|
30
30
|
return;
|
|
31
31
|
}
|
|
32
32
|
r.selectionStart > t.length && (r.selectionStart = r.selectionEnd = t.length);
|
|
33
|
-
const u =
|
|
33
|
+
const u = me(t, n);
|
|
34
34
|
u !== -1 && r.selectionStart < u && (r.selectionStart = r.selectionEnd = u), r.selectionStart === -1 && (r.selectionStart = r.selectionEnd = 0);
|
|
35
|
-
},
|
|
36
|
-
t.selectionStart = t.selectionEnd = n,
|
|
35
|
+
}, b = (t, n, r, e) => {
|
|
36
|
+
t.selectionStart = t.selectionEnd = n, Ve(r, e, t);
|
|
37
37
|
}, A = (t, n, r, e) => {
|
|
38
|
-
t.eventValue = e.parseNumber(t.prevLooseValue, n), t.currentLooseValue = t.prevLooseValue, t.valueIsCorrected = !0,
|
|
39
|
-
},
|
|
38
|
+
t.eventValue = e.parseNumber(t.prevLooseValue, n), t.currentLooseValue = t.prevLooseValue, t.valueIsCorrected = !0, b(t, t.selectionStart, t.currentLooseValue, r);
|
|
39
|
+
}, _ = (t, n, r) => n.split(t).length !== r.split(t).length && n.length === r.length + t.length, pe = (t, n) => {
|
|
40
40
|
const r = String(t.currentLooseValue), e = String(t.prevLooseValue);
|
|
41
|
-
return
|
|
42
|
-
},
|
|
41
|
+
return _(n.minusSign, r, e) || _("-", r, e) || _("−", r, e);
|
|
42
|
+
}, xe = (t, n) => {
|
|
43
43
|
const r = String(t.currentLooseValue), e = String(t.prevLooseValue);
|
|
44
44
|
return r.indexOf(n.minusSign) === -1 && e.indexOf(n.minusSign) !== -1;
|
|
45
|
-
},
|
|
46
|
-
const r = n.formatNumber(
|
|
45
|
+
}, be = (t, n) => String(t.currentLooseValue).split(n.decimal).length > 2, he = (t, n) => {
|
|
46
|
+
const r = n.formatNumber(Q, t), e = n.formatNumber(-11111111111111e-7, t), u = n.formatNumber(w, t), o = n.formatNumber(Y, t), a = O(r), s = O(e), i = O(u), l = O(o), I = P(r), C = P(e), x = P(u), h = P(o);
|
|
47
47
|
return {
|
|
48
48
|
positiveInfo: [a, I],
|
|
49
|
-
negativeInfo: [s,
|
|
49
|
+
negativeInfo: [s, C],
|
|
50
50
|
zeroInfo: [i, x],
|
|
51
|
-
oneInfo: [l,
|
|
51
|
+
oneInfo: [l, h]
|
|
52
52
|
};
|
|
53
|
-
},
|
|
54
|
-
const r = n.formatNumber(
|
|
55
|
-
return [r, e, u, o].map((l) => l.replace(s, "")).join("").split("").filter((l, I,
|
|
56
|
-
},
|
|
53
|
+
}, Le = (t, n) => {
|
|
54
|
+
const r = n.formatNumber(Q, t), e = n.formatNumber(-11111111111111e-7, t), u = n.formatNumber(w, t), o = n.formatNumber(Y, t), a = n.numberSymbols(), s = new RegExp(`[\\d\\${a.decimal}${a.group}]`, "g");
|
|
55
|
+
return [r, e, u, o].map((l) => l.replace(s, "")).join("").split("").filter((l, I, C) => C.indexOf(l) === I).join("");
|
|
56
|
+
}, B = (t, n) => {
|
|
57
57
|
const r = t.indexOf(n.decimal);
|
|
58
|
-
return r > -1 ? r :
|
|
59
|
-
},
|
|
60
|
-
const n =
|
|
61
|
-
return
|
|
62
|
-
},
|
|
58
|
+
return r > -1 ? r : R(t, m);
|
|
59
|
+
}, T = (t) => t.split("").reverse().join(""), R = (t, n) => t.length - T(t).search(n), O = (t) => t.split(t[t.search(m)])[0], P = (t) => {
|
|
60
|
+
const n = T(t);
|
|
61
|
+
return T(n.split(n[n.search(m)])[0]);
|
|
62
|
+
}, $ = (t, n) => t.search(n), J = (t, n) => {
|
|
63
63
|
const r = t.indexOf(n);
|
|
64
64
|
return r > -1 ? t.length - r - 1 : 0;
|
|
65
|
-
},
|
|
65
|
+
}, K = (t, n, r, e, u) => {
|
|
66
66
|
const o = t.replace(u, "")[0] === "0", a = n.replace(u, "")[0] === "0";
|
|
67
67
|
if (o && !a)
|
|
68
68
|
return r - 1;
|
|
@@ -80,101 +80,101 @@ const K = 11111111111111e-7, le = 0.31111111111111117, ae = 1, Q = 1, Y = 0, m =
|
|
|
80
80
|
...t
|
|
81
81
|
}, {
|
|
82
82
|
prevLooseValue: u
|
|
83
|
-
} = e, o = r.numberSymbols(), a =
|
|
83
|
+
} = e, o = r.numberSymbols(), a = Le(n, r), s = String(e.currentLooseValue), i = String(u), l = new RegExp(`[^\\d\\${o.decimal}]`, "g"), I = new RegExp(`[^\\d\\${o.decimal}\\${o.group}]`, "g"), C = new RegExp(`[\\d\\${o.decimal}\\${o.group}]`), x = s.replace(l, ""), h = $(s, m), E = h === -1 ? -1 : R(s, m), oe = s.indexOf(o.decimal), G = (s.substring(0, h) + s.substring(h, E).replace(I, "") + s.substring(E, s.length)).split("").filter((V) => a.indexOf(V) !== -1 || V.search(C) !== -1).join(""), U = r.formatNumber(ae, n).replace(l, ""), j = U.indexOf(o.decimal), N = j > -1 ? U.length - j - 1 : 0, v = r.formatNumber(de, n).replace(l, ""), X = v.indexOf(o.decimal), D = X > -1 ? v.length - X - 1 : 0, {
|
|
84
84
|
positiveInfo: se,
|
|
85
|
-
negativeInfo:
|
|
86
|
-
zeroInfo:
|
|
87
|
-
oneInfo:
|
|
88
|
-
} =
|
|
85
|
+
negativeInfo: ue,
|
|
86
|
+
zeroInfo: ce,
|
|
87
|
+
oneInfo: ie
|
|
88
|
+
} = he(n, r), g = [se, ue, ce, ie], le = g.findIndex((V) => V.findIndex((L) => !!L) !== -1) !== 1, M = s.length > 0 && s.length < i.length, Z = typeof n == "string" && n[0] === "p" && s && s.indexOf(o.percentSign) === -1;
|
|
89
89
|
if (!e.isPaste) {
|
|
90
90
|
if (s === "")
|
|
91
91
|
return e.eventValue = null, e.currentLooseValue = "", e;
|
|
92
92
|
if (e.currentLooseValue === o.minusSign && r.formatNumber(-0, n) !== i)
|
|
93
|
-
return e.eventValue = -0, e.currentLooseValue = p(e.eventValue, n, r),
|
|
94
|
-
if (Ve(e, o)) {
|
|
95
|
-
const f = r.parseNumber(u, n);
|
|
96
|
-
e.eventValue = -(f !== null ? f : 0), e.currentLooseValue = p(e.eventValue, n, r);
|
|
97
|
-
const c = T(e.currentLooseValue, m), d = T(i, m);
|
|
98
|
-
return L(e, e.selectionEnd - 1 + (c - d), e.currentLooseValue, g), e;
|
|
99
|
-
}
|
|
100
|
-
if (pe(e, o))
|
|
101
|
-
return e.eventValue = r.parseNumber(e.currentLooseValue, n), L(e, e.selectionStart, e.currentLooseValue, g), e;
|
|
93
|
+
return e.eventValue = -0, e.currentLooseValue = p(e.eventValue, n, r), b(e, B(e.currentLooseValue, o), e.currentLooseValue, g), e;
|
|
102
94
|
if (e.currentLooseValue === o.decimal) {
|
|
103
95
|
e.eventValue = 0;
|
|
104
96
|
const f = p(e.eventValue, n, r);
|
|
105
|
-
if (
|
|
106
|
-
const c =
|
|
97
|
+
if (D === 0 && N > 0) {
|
|
98
|
+
const c = R(f, m);
|
|
107
99
|
e.currentLooseValue = f.substring(0, c) + o.decimal + f.substring(c);
|
|
108
100
|
} else
|
|
109
101
|
e.currentLooseValue = f;
|
|
110
|
-
return
|
|
102
|
+
return b(e, B(e.currentLooseValue, o) + 1, e.currentLooseValue, g), e;
|
|
103
|
+
}
|
|
104
|
+
if (pe(e, o)) {
|
|
105
|
+
const f = r.parseNumber(u, n);
|
|
106
|
+
e.eventValue = -(f !== null ? f : 0), e.currentLooseValue = p(e.eventValue, n, r);
|
|
107
|
+
const c = $(e.currentLooseValue, m), d = $(i, m);
|
|
108
|
+
return b(e, e.selectionEnd - 1 + (c - d), e.currentLooseValue, g), e;
|
|
111
109
|
}
|
|
112
110
|
if (xe(e, o))
|
|
111
|
+
return e.eventValue = r.parseNumber(e.currentLooseValue, n), b(e, e.selectionStart, e.currentLooseValue, g), e;
|
|
112
|
+
if (be(e, o))
|
|
113
113
|
return A(e, n, g, r), e;
|
|
114
|
-
if (
|
|
114
|
+
if (Z)
|
|
115
115
|
return e.eventValue = r.parseNumber(s, n) / 100, e.currentLooseValue = p(e.eventValue, n, r), e;
|
|
116
|
-
if (String(e.currentLooseValue).replace(/[^\d]/g, "").length >
|
|
117
|
-
const
|
|
118
|
-
return c && d ?
|
|
116
|
+
if (String(e.currentLooseValue).replace(/[^\d]/g, "").length > ee || x !== s && s && le && g.findIndex(([c, d]) => {
|
|
117
|
+
const F = s.indexOf(c), z = s.indexOf(d), S = F === 0, W = z === s.length - d.length, k = F + c.length !== h && h !== -1 && s[F + c.length] !== o.decimal, q = z !== E && E !== -1 && s[z - 1] !== o.decimal;
|
|
118
|
+
return c && d ? k || q ? !1 : S && W : c ? k ? !1 : S : d ? q ? !1 : W : !1;
|
|
119
119
|
}) === -1)
|
|
120
120
|
return A(e, n, g, r), e;
|
|
121
121
|
if (x[x.length - 1] === o.decimal && N > 0)
|
|
122
|
-
return e.eventValue = r.parseNumber(s, n), e.currentLooseValue =
|
|
123
|
-
if (e.currentLooseValue && u && (a + o.decimal + o.group).split("").findIndex((c) => s.split("").filter((d) => d === c).length < i.split("").filter((d) => d === c).length && s.length + 1 === i.length ? !(c === o.decimal &&
|
|
122
|
+
return e.eventValue = r.parseNumber(s, n), e.currentLooseValue = G, e;
|
|
123
|
+
if (e.currentLooseValue && u && (a + o.decimal + o.group).split("").findIndex((c) => s.split("").filter((d) => d === c).length < i.split("").filter((d) => d === c).length && s.length + 1 === i.length ? !(c === o.decimal && J(i.replace(l, ""), o.decimal) === 0) : !1) > -1)
|
|
124
124
|
return e.eventValue = r.parseNumber(t.prevLooseValue, n), e.currentLooseValue = t.prevLooseValue, e;
|
|
125
|
-
const
|
|
126
|
-
if (
|
|
125
|
+
const L = J(x, o.decimal), y = x[x.length - 1] === "0";
|
|
126
|
+
if (M && y && L < D)
|
|
127
127
|
return e.eventValue = r.parseNumber(e.currentLooseValue, n), e.currentLooseValue = p(e.eventValue, n, r), e;
|
|
128
|
-
if (
|
|
129
|
-
const f = s.substring(0,
|
|
130
|
-
if (
|
|
128
|
+
if (L > 0) {
|
|
129
|
+
const f = s.substring(0, oe);
|
|
130
|
+
if (y && (!f || i.indexOf(f) !== 0)) {
|
|
131
131
|
e.eventValue = r.parseNumber(e.currentLooseValue, n);
|
|
132
132
|
const c = p(e.eventValue, n, r);
|
|
133
|
-
return
|
|
133
|
+
return b(e, K(s, c, e.selectionEnd, M, l), c, g), e.currentLooseValue = c, e;
|
|
134
134
|
}
|
|
135
|
-
if (
|
|
136
|
-
const c = s.indexOf(o.decimal), d = s.substring(0, c) + s.substring(c, c + 1 + N) + s.substring(
|
|
137
|
-
return e.eventValue = r.parseNumber(d, n), e.currentLooseValue = d,
|
|
135
|
+
if (L > N) {
|
|
136
|
+
const c = s.indexOf(o.decimal), d = s.substring(0, c) + s.substring(c, c + 1 + N) + s.substring(E, String(e.currentLooseValue).length);
|
|
137
|
+
return e.eventValue = r.parseNumber(d, n), e.currentLooseValue = d, b(e, e.selectionStart, d, g), e;
|
|
138
138
|
}
|
|
139
|
-
if (
|
|
140
|
-
return e.eventValue = r.parseNumber(e.currentLooseValue, n), e.currentLooseValue =
|
|
141
|
-
if (
|
|
139
|
+
if (D !== N && L <= N && y)
|
|
140
|
+
return e.eventValue = r.parseNumber(e.currentLooseValue, n), e.currentLooseValue = G, e;
|
|
141
|
+
if (L < D)
|
|
142
142
|
return e.eventValue = r.parseNumber(e.currentLooseValue, n), e.currentLooseValue = p(e.eventValue, n, r), e;
|
|
143
143
|
}
|
|
144
144
|
}
|
|
145
|
-
if (e.eventValue = r.parseNumber(e.currentLooseValue, n),
|
|
145
|
+
if (e.eventValue = r.parseNumber(e.currentLooseValue, n), Z && (e.eventValue = e.eventValue / 100), typeof e.eventValue == "number") {
|
|
146
146
|
const V = p(e.eventValue, n, r);
|
|
147
|
-
s.length === 1 ?
|
|
147
|
+
s.length === 1 ? b(e, B(V, o), V, g) : b(e, K(s, V, e.selectionEnd, M, l), V, g), e.currentLooseValue = V;
|
|
148
148
|
} else
|
|
149
149
|
e.currentLooseValue = p(r.parseNumber(x), n, r);
|
|
150
150
|
return e;
|
|
151
151
|
};
|
|
152
152
|
export {
|
|
153
|
-
|
|
154
|
-
|
|
153
|
+
K as changeBasedSelection,
|
|
154
|
+
Ce as decreaseValue,
|
|
155
155
|
p as formatValue,
|
|
156
|
-
|
|
157
|
-
|
|
158
|
-
|
|
159
|
-
|
|
160
|
-
|
|
161
|
-
|
|
162
|
-
|
|
163
|
-
|
|
164
|
-
|
|
165
|
-
|
|
166
|
-
|
|
167
|
-
|
|
168
|
-
|
|
169
|
-
|
|
170
|
-
|
|
171
|
-
|
|
172
|
-
|
|
173
|
-
|
|
174
|
-
|
|
175
|
-
|
|
156
|
+
H as fractionLength,
|
|
157
|
+
J as getDecimalCount,
|
|
158
|
+
$ as getFirstNumberIndex,
|
|
159
|
+
he as getFormatPrefixSufix,
|
|
160
|
+
Le as getFormatSymbols,
|
|
161
|
+
B as getInitialPosition,
|
|
162
|
+
R as getLastNumberIndex,
|
|
163
|
+
fe as getMaxCursorPosition,
|
|
164
|
+
me as getMinCursorPosition,
|
|
165
|
+
O as getPrefix,
|
|
166
|
+
Ne as getStateOrPropsValue,
|
|
167
|
+
P as getSuffix,
|
|
168
|
+
Ie as increaseValue,
|
|
169
|
+
be as isDecimalDuplicated,
|
|
170
|
+
pe as isMinusSymbolAdded,
|
|
171
|
+
xe as isMinusSymbolRemoved,
|
|
172
|
+
ge as limitPrecision,
|
|
173
|
+
Ve as rangeSelection,
|
|
174
|
+
re as rangeValue,
|
|
175
|
+
T as reverseString,
|
|
176
176
|
Ee as sanitizeNumber,
|
|
177
177
|
A as setInvalid,
|
|
178
|
-
|
|
179
|
-
|
|
178
|
+
b as setSelection,
|
|
179
|
+
te as toFixedPrecision
|
|
180
180
|
};
|
package/package-metadata.js
CHANGED
|
@@ -5,4 +5,4 @@
|
|
|
5
5
|
* Licensed under commercial license. See LICENSE.md in the package root for more information
|
|
6
6
|
*-------------------------------------------------------------------------------------------
|
|
7
7
|
*/
|
|
8
|
-
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e={name:"@progress/kendo-vue-inputs",productName:"Kendo UI for Vue",productCode:"KENDOUIVUE",productCodes:["KENDOUIVUE"],publishDate:
|
|
8
|
+
"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e={name:"@progress/kendo-vue-inputs",productName:"Kendo UI for Vue",productCode:"KENDOUIVUE",productCodes:["KENDOUIVUE"],publishDate: 1754054534,version:"6.5.0-develop.6",licensingDocsUrl:"https://www.telerik.com/kendo-vue-ui/my-license/?utm_medium=product&utm_source=kendovue&utm_campaign=kendo-ui-vue-purchase-license-keys-warning"};exports.packageMetadata=e;
|
package/package-metadata.mjs
CHANGED
|
@@ -10,8 +10,8 @@ const e = {
|
|
|
10
10
|
productName: "Kendo UI for Vue",
|
|
11
11
|
productCode: "KENDOUIVUE",
|
|
12
12
|
productCodes: ["KENDOUIVUE"],
|
|
13
|
-
publishDate:
|
|
14
|
-
version: "6.5.0-develop.
|
|
13
|
+
publishDate: 1754054534,
|
|
14
|
+
version: "6.5.0-develop.6",
|
|
15
15
|
licensingDocsUrl: "https://www.telerik.com/kendo-vue-ui/my-license/?utm_medium=product&utm_source=kendovue&utm_campaign=kendo-ui-vue-purchase-license-keys-warning"
|
|
16
16
|
};
|
|
17
17
|
export {
|
package/package.json
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "@progress/kendo-vue-inputs",
|
|
3
|
-
"version": "6.5.0-develop.
|
|
3
|
+
"version": "6.5.0-develop.6",
|
|
4
4
|
"description": "TODO",
|
|
5
5
|
"author": "Progress",
|
|
6
6
|
"license": "SEE LICENSE IN LICENSE.md",
|
|
@@ -20,13 +20,13 @@
|
|
|
20
20
|
"peerDependencies": {
|
|
21
21
|
"@progress/kendo-drawing": "^1.21.1",
|
|
22
22
|
"@progress/kendo-licensing": "^1.4.0",
|
|
23
|
-
"@progress/kendo-vue-animation": "6.5.0-develop.
|
|
24
|
-
"@progress/kendo-vue-buttons": "6.5.0-develop.
|
|
25
|
-
"@progress/kendo-vue-common": "6.5.0-develop.
|
|
26
|
-
"@progress/kendo-vue-dialogs": "6.5.0-develop.
|
|
27
|
-
"@progress/kendo-vue-intl": "6.5.0-develop.
|
|
28
|
-
"@progress/kendo-vue-labels": "6.5.0-develop.
|
|
29
|
-
"@progress/kendo-vue-popup": "6.5.0-develop.
|
|
23
|
+
"@progress/kendo-vue-animation": "6.5.0-develop.6",
|
|
24
|
+
"@progress/kendo-vue-buttons": "6.5.0-develop.6",
|
|
25
|
+
"@progress/kendo-vue-common": "6.5.0-develop.6",
|
|
26
|
+
"@progress/kendo-vue-dialogs": "6.5.0-develop.6",
|
|
27
|
+
"@progress/kendo-vue-intl": "6.5.0-develop.6",
|
|
28
|
+
"@progress/kendo-vue-labels": "6.5.0-develop.6",
|
|
29
|
+
"@progress/kendo-vue-popup": "6.5.0-develop.6",
|
|
30
30
|
"@progress/kendo-svg-icons": "^4.0.0",
|
|
31
31
|
"vue": "^3.0.2"
|
|
32
32
|
},
|
|
@@ -49,7 +49,7 @@
|
|
|
49
49
|
"package": {
|
|
50
50
|
"productName": "Kendo UI for Vue",
|
|
51
51
|
"productCode": "KENDOUIVUE",
|
|
52
|
-
"publishDate":
|
|
52
|
+
"publishDate": 1754054534,
|
|
53
53
|
"licensingDocsUrl": "https://www.telerik.com/kendo-vue-ui/my-license/?utm_medium=product&utm_source=kendovue&utm_campaign=kendo-ui-vue-purchase-license-keys-warning"
|
|
54
54
|
}
|
|
55
55
|
},
|