@handsontable/react-wrapper 0.0.0-next-bd5a1b3-20260401 → 0.0.0-next-299c9ee-20260402
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/commonjs/react-handsontable.js +273 -195
- package/dist/react-handsontable.js +275 -188
- package/dist/react-handsontable.js.map +1 -1
- package/dist/react-handsontable.min.js +2 -2
- package/dist/react-handsontable.min.js.map +1 -1
- package/es/react-handsontable.mjs +273 -195
- package/helpers.d.ts +8 -0
- package/package.json +5 -6
|
@@ -14,6 +14,201 @@ var React__default = /*#__PURE__*/_interopDefaultCompat(React);
|
|
|
14
14
|
var ReactDOM__default = /*#__PURE__*/_interopDefaultCompat(ReactDOM);
|
|
15
15
|
var Handsontable__default = /*#__PURE__*/_interopDefaultCompat(Handsontable);
|
|
16
16
|
|
|
17
|
+
function _arrayLikeToArray(r, a) {
|
|
18
|
+
(null == a || a > r.length) && (a = r.length);
|
|
19
|
+
for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e];
|
|
20
|
+
return n;
|
|
21
|
+
}
|
|
22
|
+
function _arrayWithHoles(r) {
|
|
23
|
+
if (Array.isArray(r)) return r;
|
|
24
|
+
}
|
|
25
|
+
function _arrayWithoutHoles(r) {
|
|
26
|
+
if (Array.isArray(r)) return _arrayLikeToArray(r);
|
|
27
|
+
}
|
|
28
|
+
function _assertThisInitialized(e) {
|
|
29
|
+
if (void 0 === e) throw new ReferenceError("this hasn't been initialised - super() hasn't been called");
|
|
30
|
+
return e;
|
|
31
|
+
}
|
|
32
|
+
function _callSuper(t, o, e) {
|
|
33
|
+
return o = _getPrototypeOf(o), _possibleConstructorReturn(t, _isNativeReflectConstruct() ? Reflect.construct(o, e || [], _getPrototypeOf(t).constructor) : o.apply(t, e));
|
|
34
|
+
}
|
|
35
|
+
function _classCallCheck(a, n) {
|
|
36
|
+
if (!(a instanceof n)) throw new TypeError("Cannot call a class as a function");
|
|
37
|
+
}
|
|
38
|
+
function _defineProperties(e, r) {
|
|
39
|
+
for (var t = 0; t < r.length; t++) {
|
|
40
|
+
var o = r[t];
|
|
41
|
+
o.enumerable = o.enumerable || false, o.configurable = true, "value" in o && (o.writable = true), Object.defineProperty(e, _toPropertyKey(o.key), o);
|
|
42
|
+
}
|
|
43
|
+
}
|
|
44
|
+
function _createClass(e, r, t) {
|
|
45
|
+
return r && _defineProperties(e.prototype, r), t && _defineProperties(e, t), Object.defineProperty(e, "prototype", {
|
|
46
|
+
writable: false
|
|
47
|
+
}), e;
|
|
48
|
+
}
|
|
49
|
+
function _defineProperty(e, r, t) {
|
|
50
|
+
return (r = _toPropertyKey(r)) in e ? Object.defineProperty(e, r, {
|
|
51
|
+
value: t,
|
|
52
|
+
enumerable: true,
|
|
53
|
+
configurable: true,
|
|
54
|
+
writable: true
|
|
55
|
+
}) : e[r] = t, e;
|
|
56
|
+
}
|
|
57
|
+
function _extends() {
|
|
58
|
+
return _extends = Object.assign ? Object.assign.bind() : function (n) {
|
|
59
|
+
for (var e = 1; e < arguments.length; e++) {
|
|
60
|
+
var t = arguments[e];
|
|
61
|
+
for (var r in t) ({}).hasOwnProperty.call(t, r) && (n[r] = t[r]);
|
|
62
|
+
}
|
|
63
|
+
return n;
|
|
64
|
+
}, _extends.apply(null, arguments);
|
|
65
|
+
}
|
|
66
|
+
function _getPrototypeOf(t) {
|
|
67
|
+
return _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function (t) {
|
|
68
|
+
return t.__proto__ || Object.getPrototypeOf(t);
|
|
69
|
+
}, _getPrototypeOf(t);
|
|
70
|
+
}
|
|
71
|
+
function _inherits(t, e) {
|
|
72
|
+
if ("function" != typeof e && null !== e) throw new TypeError("Super expression must either be null or a function");
|
|
73
|
+
t.prototype = Object.create(e && e.prototype, {
|
|
74
|
+
constructor: {
|
|
75
|
+
value: t,
|
|
76
|
+
writable: true,
|
|
77
|
+
configurable: true
|
|
78
|
+
}
|
|
79
|
+
}), Object.defineProperty(t, "prototype", {
|
|
80
|
+
writable: false
|
|
81
|
+
}), e && _setPrototypeOf(t, e);
|
|
82
|
+
}
|
|
83
|
+
function _isNativeReflectConstruct() {
|
|
84
|
+
try {
|
|
85
|
+
var t = !Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {}));
|
|
86
|
+
} catch (t) {}
|
|
87
|
+
return (_isNativeReflectConstruct = function () {
|
|
88
|
+
return !!t;
|
|
89
|
+
})();
|
|
90
|
+
}
|
|
91
|
+
function _iterableToArray(r) {
|
|
92
|
+
if ("undefined" != typeof Symbol && null != r[Symbol.iterator] || null != r["@@iterator"]) return Array.from(r);
|
|
93
|
+
}
|
|
94
|
+
function _iterableToArrayLimit(r, l) {
|
|
95
|
+
var t = null == r ? null : "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"];
|
|
96
|
+
if (null != t) {
|
|
97
|
+
var e,
|
|
98
|
+
n,
|
|
99
|
+
i,
|
|
100
|
+
u,
|
|
101
|
+
a = [],
|
|
102
|
+
f = true,
|
|
103
|
+
o = false;
|
|
104
|
+
try {
|
|
105
|
+
if (i = (t = t.call(r)).next, 0 === l) ; else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0);
|
|
106
|
+
} catch (r) {
|
|
107
|
+
o = true, n = r;
|
|
108
|
+
} finally {
|
|
109
|
+
try {
|
|
110
|
+
if (!f && null != t.return && (u = t.return(), Object(u) !== u)) return;
|
|
111
|
+
} finally {
|
|
112
|
+
if (o) throw n;
|
|
113
|
+
}
|
|
114
|
+
}
|
|
115
|
+
return a;
|
|
116
|
+
}
|
|
117
|
+
}
|
|
118
|
+
function _nonIterableRest() {
|
|
119
|
+
throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
120
|
+
}
|
|
121
|
+
function _nonIterableSpread() {
|
|
122
|
+
throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
123
|
+
}
|
|
124
|
+
function ownKeys(e, r) {
|
|
125
|
+
var t = Object.keys(e);
|
|
126
|
+
if (Object.getOwnPropertySymbols) {
|
|
127
|
+
var o = Object.getOwnPropertySymbols(e);
|
|
128
|
+
r && (o = o.filter(function (r) {
|
|
129
|
+
return Object.getOwnPropertyDescriptor(e, r).enumerable;
|
|
130
|
+
})), t.push.apply(t, o);
|
|
131
|
+
}
|
|
132
|
+
return t;
|
|
133
|
+
}
|
|
134
|
+
function _objectSpread2(e) {
|
|
135
|
+
for (var r = 1; r < arguments.length; r++) {
|
|
136
|
+
var t = null != arguments[r] ? arguments[r] : {};
|
|
137
|
+
r % 2 ? ownKeys(Object(t), true).forEach(function (r) {
|
|
138
|
+
_defineProperty(e, r, t[r]);
|
|
139
|
+
}) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) {
|
|
140
|
+
Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r));
|
|
141
|
+
});
|
|
142
|
+
}
|
|
143
|
+
return e;
|
|
144
|
+
}
|
|
145
|
+
function _objectWithoutProperties(e, t) {
|
|
146
|
+
if (null == e) return {};
|
|
147
|
+
var o,
|
|
148
|
+
r,
|
|
149
|
+
i = _objectWithoutPropertiesLoose(e, t);
|
|
150
|
+
if (Object.getOwnPropertySymbols) {
|
|
151
|
+
var n = Object.getOwnPropertySymbols(e);
|
|
152
|
+
for (r = 0; r < n.length; r++) o = n[r], -1 === t.indexOf(o) && {}.propertyIsEnumerable.call(e, o) && (i[o] = e[o]);
|
|
153
|
+
}
|
|
154
|
+
return i;
|
|
155
|
+
}
|
|
156
|
+
function _objectWithoutPropertiesLoose(r, e) {
|
|
157
|
+
if (null == r) return {};
|
|
158
|
+
var t = {};
|
|
159
|
+
for (var n in r) if ({}.hasOwnProperty.call(r, n)) {
|
|
160
|
+
if (-1 !== e.indexOf(n)) continue;
|
|
161
|
+
t[n] = r[n];
|
|
162
|
+
}
|
|
163
|
+
return t;
|
|
164
|
+
}
|
|
165
|
+
function _possibleConstructorReturn(t, e) {
|
|
166
|
+
if (e && ("object" == typeof e || "function" == typeof e)) return e;
|
|
167
|
+
if (void 0 !== e) throw new TypeError("Derived constructors may only return object or undefined");
|
|
168
|
+
return _assertThisInitialized(t);
|
|
169
|
+
}
|
|
170
|
+
function _setPrototypeOf(t, e) {
|
|
171
|
+
return _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function (t, e) {
|
|
172
|
+
return t.__proto__ = e, t;
|
|
173
|
+
}, _setPrototypeOf(t, e);
|
|
174
|
+
}
|
|
175
|
+
function _slicedToArray(r, e) {
|
|
176
|
+
return _arrayWithHoles(r) || _iterableToArrayLimit(r, e) || _unsupportedIterableToArray(r, e) || _nonIterableRest();
|
|
177
|
+
}
|
|
178
|
+
function _toConsumableArray(r) {
|
|
179
|
+
return _arrayWithoutHoles(r) || _iterableToArray(r) || _unsupportedIterableToArray(r) || _nonIterableSpread();
|
|
180
|
+
}
|
|
181
|
+
function _toPrimitive(t, r) {
|
|
182
|
+
if ("object" != typeof t || !t) return t;
|
|
183
|
+
var e = t[Symbol.toPrimitive];
|
|
184
|
+
if (void 0 !== e) {
|
|
185
|
+
var i = e.call(t, r);
|
|
186
|
+
if ("object" != typeof i) return i;
|
|
187
|
+
throw new TypeError("@@toPrimitive must return a primitive value.");
|
|
188
|
+
}
|
|
189
|
+
return (String )(t);
|
|
190
|
+
}
|
|
191
|
+
function _toPropertyKey(t) {
|
|
192
|
+
var i = _toPrimitive(t, "string");
|
|
193
|
+
return "symbol" == typeof i ? i : i + "";
|
|
194
|
+
}
|
|
195
|
+
function _typeof(o) {
|
|
196
|
+
"@babel/helpers - typeof";
|
|
197
|
+
|
|
198
|
+
return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) {
|
|
199
|
+
return typeof o;
|
|
200
|
+
} : function (o) {
|
|
201
|
+
return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o;
|
|
202
|
+
}, _typeof(o);
|
|
203
|
+
}
|
|
204
|
+
function _unsupportedIterableToArray(r, a) {
|
|
205
|
+
if (r) {
|
|
206
|
+
if ("string" == typeof r) return _arrayLikeToArray(r, a);
|
|
207
|
+
var t = {}.toString.call(r).slice(8, -1);
|
|
208
|
+
return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0;
|
|
209
|
+
}
|
|
210
|
+
}
|
|
211
|
+
|
|
17
212
|
var bulkComponentContainer = null;
|
|
18
213
|
|
|
19
214
|
/**
|
|
@@ -197,219 +392,98 @@ function getContainerAttributesProps(props) {
|
|
|
197
392
|
function isCSR() {
|
|
198
393
|
return typeof window !== 'undefined';
|
|
199
394
|
}
|
|
395
|
+
function isObjectLike(value) {
|
|
396
|
+
return _typeof(value) === 'object' && value !== null;
|
|
397
|
+
}
|
|
398
|
+
function isPlainObject(value) {
|
|
399
|
+
if (!isObjectLike(value)) {
|
|
400
|
+
return false;
|
|
401
|
+
}
|
|
402
|
+
var prototype = Object.getPrototypeOf(value);
|
|
403
|
+
return prototype === Object.prototype || prototype === null;
|
|
404
|
+
}
|
|
405
|
+
function isArray(value) {
|
|
406
|
+
return Array.isArray(value);
|
|
407
|
+
}
|
|
200
408
|
|
|
201
409
|
/**
|
|
202
|
-
*
|
|
410
|
+
* Deep-compare plain objects and arrays used by wrapper settings.
|
|
203
411
|
*
|
|
204
|
-
* @param
|
|
205
|
-
* @param
|
|
412
|
+
* @param {unknown} previousValue Previous value.
|
|
413
|
+
* @param {unknown} currentValue Current value.
|
|
414
|
+
* @returns {boolean} `true` if values are equivalent.
|
|
206
415
|
*/
|
|
207
|
-
function
|
|
208
|
-
|
|
209
|
-
|
|
210
|
-
if (notInitialRender.current) {
|
|
211
|
-
return effect();
|
|
212
|
-
} else {
|
|
213
|
-
notInitialRender.current = true;
|
|
214
|
-
}
|
|
215
|
-
}, deps);
|
|
216
|
-
}
|
|
217
|
-
|
|
218
|
-
function _arrayLikeToArray(r, a) {
|
|
219
|
-
(null == a || a > r.length) && (a = r.length);
|
|
220
|
-
for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e];
|
|
221
|
-
return n;
|
|
222
|
-
}
|
|
223
|
-
function _arrayWithHoles(r) {
|
|
224
|
-
if (Array.isArray(r)) return r;
|
|
225
|
-
}
|
|
226
|
-
function _arrayWithoutHoles(r) {
|
|
227
|
-
if (Array.isArray(r)) return _arrayLikeToArray(r);
|
|
228
|
-
}
|
|
229
|
-
function _assertThisInitialized(e) {
|
|
230
|
-
if (void 0 === e) throw new ReferenceError("this hasn't been initialised - super() hasn't been called");
|
|
231
|
-
return e;
|
|
232
|
-
}
|
|
233
|
-
function _callSuper(t, o, e) {
|
|
234
|
-
return o = _getPrototypeOf(o), _possibleConstructorReturn(t, _isNativeReflectConstruct() ? Reflect.construct(o, e || [], _getPrototypeOf(t).constructor) : o.apply(t, e));
|
|
235
|
-
}
|
|
236
|
-
function _classCallCheck(a, n) {
|
|
237
|
-
if (!(a instanceof n)) throw new TypeError("Cannot call a class as a function");
|
|
238
|
-
}
|
|
239
|
-
function _defineProperties(e, r) {
|
|
240
|
-
for (var t = 0; t < r.length; t++) {
|
|
241
|
-
var o = r[t];
|
|
242
|
-
o.enumerable = o.enumerable || false, o.configurable = true, "value" in o && (o.writable = true), Object.defineProperty(e, _toPropertyKey(o.key), o);
|
|
416
|
+
function areEquivalentSettingsValue(previousValue, currentValue) {
|
|
417
|
+
if (previousValue === currentValue) {
|
|
418
|
+
return true;
|
|
243
419
|
}
|
|
244
|
-
|
|
245
|
-
|
|
246
|
-
|
|
247
|
-
writable: false
|
|
248
|
-
}), e;
|
|
249
|
-
}
|
|
250
|
-
function _defineProperty(e, r, t) {
|
|
251
|
-
return (r = _toPropertyKey(r)) in e ? Object.defineProperty(e, r, {
|
|
252
|
-
value: t,
|
|
253
|
-
enumerable: true,
|
|
254
|
-
configurable: true,
|
|
255
|
-
writable: true
|
|
256
|
-
}) : e[r] = t, e;
|
|
257
|
-
}
|
|
258
|
-
function _extends() {
|
|
259
|
-
return _extends = Object.assign ? Object.assign.bind() : function (n) {
|
|
260
|
-
for (var e = 1; e < arguments.length; e++) {
|
|
261
|
-
var t = arguments[e];
|
|
262
|
-
for (var r in t) ({}).hasOwnProperty.call(t, r) && (n[r] = t[r]);
|
|
420
|
+
if (previousValue instanceof RegExp || currentValue instanceof RegExp) {
|
|
421
|
+
if (!(previousValue instanceof RegExp) || !(currentValue instanceof RegExp)) {
|
|
422
|
+
return false;
|
|
263
423
|
}
|
|
264
|
-
return
|
|
265
|
-
}
|
|
266
|
-
|
|
267
|
-
|
|
268
|
-
|
|
269
|
-
return t.__proto__ || Object.getPrototypeOf(t);
|
|
270
|
-
}, _getPrototypeOf(t);
|
|
271
|
-
}
|
|
272
|
-
function _inherits(t, e) {
|
|
273
|
-
if ("function" != typeof e && null !== e) throw new TypeError("Super expression must either be null or a function");
|
|
274
|
-
t.prototype = Object.create(e && e.prototype, {
|
|
275
|
-
constructor: {
|
|
276
|
-
value: t,
|
|
277
|
-
writable: true,
|
|
278
|
-
configurable: true
|
|
424
|
+
return previousValue.source === currentValue.source && previousValue.flags === currentValue.flags;
|
|
425
|
+
}
|
|
426
|
+
if (isArray(previousValue) && isArray(currentValue)) {
|
|
427
|
+
if (previousValue.length !== currentValue.length) {
|
|
428
|
+
return false;
|
|
279
429
|
}
|
|
280
|
-
|
|
281
|
-
|
|
282
|
-
|
|
283
|
-
}
|
|
284
|
-
function _isNativeReflectConstruct() {
|
|
285
|
-
try {
|
|
286
|
-
var t = !Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {}));
|
|
287
|
-
} catch (t) {}
|
|
288
|
-
return (_isNativeReflectConstruct = function () {
|
|
289
|
-
return !!t;
|
|
290
|
-
})();
|
|
291
|
-
}
|
|
292
|
-
function _iterableToArray(r) {
|
|
293
|
-
if ("undefined" != typeof Symbol && null != r[Symbol.iterator] || null != r["@@iterator"]) return Array.from(r);
|
|
294
|
-
}
|
|
295
|
-
function _iterableToArrayLimit(r, l) {
|
|
296
|
-
var t = null == r ? null : "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"];
|
|
297
|
-
if (null != t) {
|
|
298
|
-
var e,
|
|
299
|
-
n,
|
|
300
|
-
i,
|
|
301
|
-
u,
|
|
302
|
-
a = [],
|
|
303
|
-
f = true,
|
|
304
|
-
o = false;
|
|
305
|
-
try {
|
|
306
|
-
if (i = (t = t.call(r)).next, 0 === l) ; else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0);
|
|
307
|
-
} catch (r) {
|
|
308
|
-
o = true, n = r;
|
|
309
|
-
} finally {
|
|
310
|
-
try {
|
|
311
|
-
if (!f && null != t.return && (u = t.return(), Object(u) !== u)) return;
|
|
312
|
-
} finally {
|
|
313
|
-
if (o) throw n;
|
|
430
|
+
for (var index = 0; index < previousValue.length; index++) {
|
|
431
|
+
if (!areEquivalentSettingsValue(previousValue[index], currentValue[index])) {
|
|
432
|
+
return false;
|
|
314
433
|
}
|
|
315
434
|
}
|
|
316
|
-
return
|
|
435
|
+
return true;
|
|
317
436
|
}
|
|
318
|
-
|
|
319
|
-
|
|
320
|
-
throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
321
|
-
}
|
|
322
|
-
function _nonIterableSpread() {
|
|
323
|
-
throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
324
|
-
}
|
|
325
|
-
function ownKeys(e, r) {
|
|
326
|
-
var t = Object.keys(e);
|
|
327
|
-
if (Object.getOwnPropertySymbols) {
|
|
328
|
-
var o = Object.getOwnPropertySymbols(e);
|
|
329
|
-
r && (o = o.filter(function (r) {
|
|
330
|
-
return Object.getOwnPropertyDescriptor(e, r).enumerable;
|
|
331
|
-
})), t.push.apply(t, o);
|
|
437
|
+
if (isArray(previousValue) || isArray(currentValue)) {
|
|
438
|
+
return false;
|
|
332
439
|
}
|
|
333
|
-
|
|
334
|
-
|
|
335
|
-
function _objectSpread2(e) {
|
|
336
|
-
for (var r = 1; r < arguments.length; r++) {
|
|
337
|
-
var t = null != arguments[r] ? arguments[r] : {};
|
|
338
|
-
r % 2 ? ownKeys(Object(t), true).forEach(function (r) {
|
|
339
|
-
_defineProperty(e, r, t[r]);
|
|
340
|
-
}) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) {
|
|
341
|
-
Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r));
|
|
342
|
-
});
|
|
440
|
+
if (!isObjectLike(previousValue) || !isObjectLike(currentValue)) {
|
|
441
|
+
return false;
|
|
343
442
|
}
|
|
344
|
-
|
|
345
|
-
|
|
346
|
-
function _objectWithoutProperties(e, t) {
|
|
347
|
-
if (null == e) return {};
|
|
348
|
-
var o,
|
|
349
|
-
r,
|
|
350
|
-
i = _objectWithoutPropertiesLoose(e, t);
|
|
351
|
-
if (Object.getOwnPropertySymbols) {
|
|
352
|
-
var n = Object.getOwnPropertySymbols(e);
|
|
353
|
-
for (r = 0; r < n.length; r++) o = n[r], -1 === t.indexOf(o) && {}.propertyIsEnumerable.call(e, o) && (i[o] = e[o]);
|
|
443
|
+
if (!isPlainObject(previousValue) || !isPlainObject(currentValue)) {
|
|
444
|
+
return false;
|
|
354
445
|
}
|
|
355
|
-
|
|
356
|
-
|
|
357
|
-
|
|
358
|
-
|
|
359
|
-
var t = {};
|
|
360
|
-
for (var n in r) if ({}.hasOwnProperty.call(r, n)) {
|
|
361
|
-
if (-1 !== e.indexOf(n)) continue;
|
|
362
|
-
t[n] = r[n];
|
|
446
|
+
var previousKeys = Object.keys(previousValue);
|
|
447
|
+
var currentKeys = Object.keys(currentValue);
|
|
448
|
+
if (previousKeys.length !== currentKeys.length) {
|
|
449
|
+
return false;
|
|
363
450
|
}
|
|
364
|
-
|
|
365
|
-
|
|
366
|
-
|
|
367
|
-
|
|
368
|
-
|
|
369
|
-
|
|
370
|
-
|
|
371
|
-
|
|
372
|
-
return _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function (t, e) {
|
|
373
|
-
return t.__proto__ = e, t;
|
|
374
|
-
}, _setPrototypeOf(t, e);
|
|
375
|
-
}
|
|
376
|
-
function _slicedToArray(r, e) {
|
|
377
|
-
return _arrayWithHoles(r) || _iterableToArrayLimit(r, e) || _unsupportedIterableToArray(r, e) || _nonIterableRest();
|
|
378
|
-
}
|
|
379
|
-
function _toConsumableArray(r) {
|
|
380
|
-
return _arrayWithoutHoles(r) || _iterableToArray(r) || _unsupportedIterableToArray(r) || _nonIterableSpread();
|
|
381
|
-
}
|
|
382
|
-
function _toPrimitive(t, r) {
|
|
383
|
-
if ("object" != typeof t || !t) return t;
|
|
384
|
-
var e = t[Symbol.toPrimitive];
|
|
385
|
-
if (void 0 !== e) {
|
|
386
|
-
var i = e.call(t, r);
|
|
387
|
-
if ("object" != typeof i) return i;
|
|
388
|
-
throw new TypeError("@@toPrimitive must return a primitive value.");
|
|
451
|
+
for (var _i = 0, _previousKeys = previousKeys; _i < _previousKeys.length; _i++) {
|
|
452
|
+
var key = _previousKeys[_i];
|
|
453
|
+
if (!Object.prototype.hasOwnProperty.call(currentValue, key)) {
|
|
454
|
+
return false;
|
|
455
|
+
}
|
|
456
|
+
if (!areEquivalentSettingsValue(previousValue[key], currentValue[key])) {
|
|
457
|
+
return false;
|
|
458
|
+
}
|
|
389
459
|
}
|
|
390
|
-
return
|
|
460
|
+
return true;
|
|
391
461
|
}
|
|
392
|
-
function _toPropertyKey(t) {
|
|
393
|
-
var i = _toPrimitive(t, "string");
|
|
394
|
-
return "symbol" == typeof i ? i : i + "";
|
|
395
|
-
}
|
|
396
|
-
function _typeof(o) {
|
|
397
|
-
"@babel/helpers - typeof";
|
|
398
462
|
|
|
399
|
-
|
|
400
|
-
|
|
401
|
-
|
|
402
|
-
|
|
403
|
-
|
|
404
|
-
|
|
405
|
-
function
|
|
406
|
-
|
|
407
|
-
|
|
408
|
-
|
|
409
|
-
|
|
410
|
-
|
|
463
|
+
/**
|
|
464
|
+
* A variant of useEffect hook that does not trigger on initial mount, only updates
|
|
465
|
+
*
|
|
466
|
+
* @param effect Effect function
|
|
467
|
+
* @param deps Effect dependencies
|
|
468
|
+
*/
|
|
469
|
+
function useUpdateEffect(effect, deps) {
|
|
470
|
+
var notInitialRender = React__default["default"].useRef(false);
|
|
471
|
+
React.useEffect(function () {
|
|
472
|
+
if (notInitialRender.current) {
|
|
473
|
+
return effect();
|
|
474
|
+
} else {
|
|
475
|
+
notInitialRender.current = true;
|
|
476
|
+
}
|
|
477
|
+
}, deps);
|
|
411
478
|
}
|
|
412
479
|
|
|
480
|
+
/**
|
|
481
|
+
* Only `dataSchema` and `columns` use deep comparison when diffing props for `updateSettings(false)`.
|
|
482
|
+
* Other object settings (for example `mergeCells`, `cell`, `nestedHeaders`, hooks) stay on strict
|
|
483
|
+
* reference equality so we avoid expensive deep walks and accidental false positives where functions
|
|
484
|
+
* or class instances would not compare meaningfully by keys alone.
|
|
485
|
+
*/
|
|
486
|
+
var DEEP_COMPARABLE_SETTINGS = ['dataSchema', 'columns'];
|
|
413
487
|
var SettingsMapper = /*#__PURE__*/function () {
|
|
414
488
|
function SettingsMapper() {
|
|
415
489
|
_classCallCheck(this, SettingsMapper);
|
|
@@ -435,6 +509,10 @@ var SettingsMapper = /*#__PURE__*/function () {
|
|
|
435
509
|
_ref$initOnlySettingK = _ref.initOnlySettingKeys,
|
|
436
510
|
initOnlySettingKeys = _ref$initOnlySettingK === void 0 ? [] : _ref$initOnlySettingK;
|
|
437
511
|
var shouldSkipProp = function shouldSkipProp(key) {
|
|
512
|
+
if (!isInit && DEEP_COMPARABLE_SETTINGS.includes(key)) {
|
|
513
|
+
return areEquivalentSettingsValue(prevProps[key], properties[key]);
|
|
514
|
+
}
|
|
515
|
+
|
|
438
516
|
// Omit settings that can be set only during initialization and are intentionally modified.
|
|
439
517
|
if (!isInit && initOnlySettingKeys.includes(key)) {
|
|
440
518
|
return prevProps[key] === properties[key];
|
|
@@ -998,7 +1076,7 @@ var HotColumn = function HotColumn(props) {
|
|
|
998
1076
|
}, editorPortal);
|
|
999
1077
|
};
|
|
1000
1078
|
|
|
1001
|
-
var version="0.0.0-next-
|
|
1079
|
+
var version="0.0.0-next-299c9ee-20260402";
|
|
1002
1080
|
|
|
1003
1081
|
/**
|
|
1004
1082
|
* Component used to manage the renderer component portals.
|