@treely/strapi-slices 7.15.2 → 7.16.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.
@@ -22,6 +22,9 @@ import useEmblaCarousel from 'embla-carousel-react';
22
22
  import AutoScroll from 'embla-carousel-auto-scroll';
23
23
  import useSWRInfinite from 'swr/infinite';
24
24
 
25
+ function _OverloadYield(e, d) {
26
+ this.v = e, this.k = d;
27
+ }
25
28
  function asyncGeneratorStep(n, t, e, r, o, a, c) {
26
29
  try {
27
30
  var i = n[a](c),
@@ -65,309 +68,249 @@ function _objectWithoutPropertiesLoose(r, e) {
65
68
  }
66
69
  return t;
67
70
  }
68
- function _regeneratorRuntime() {
69
- _regeneratorRuntime = function () {
70
- return e;
71
- };
72
- var t,
73
- e = {},
74
- r = Object.prototype,
75
- n = r.hasOwnProperty,
76
- o = Object.defineProperty || function (t, e, r) {
77
- t[e] = r.value;
78
- },
79
- i = "function" == typeof Symbol ? Symbol : {},
80
- a = i.iterator || "@@iterator",
81
- c = i.asyncIterator || "@@asyncIterator",
82
- u = i.toStringTag || "@@toStringTag";
83
- function define(t, e, r) {
84
- return Object.defineProperty(t, e, {
85
- value: r,
86
- enumerable: !0,
87
- configurable: !0,
88
- writable: !0
89
- }), t[e];
90
- }
91
- try {
92
- define({}, "");
93
- } catch (t) {
94
- define = function (t, e, r) {
95
- return t[e] = r;
96
- };
97
- }
98
- function wrap(t, e, r, n) {
99
- var i = e && e.prototype instanceof Generator ? e : Generator,
100
- a = Object.create(i.prototype),
101
- c = new Context(n || []);
102
- return o(a, "_invoke", {
103
- value: makeInvokeMethod(t, r, c)
104
- }), a;
105
- }
106
- function tryCatch(t, e, r) {
107
- try {
108
- return {
109
- type: "normal",
110
- arg: t.call(e, r)
111
- };
112
- } catch (t) {
113
- return {
114
- type: "throw",
115
- arg: t
71
+ function _regenerator() {
72
+ /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/babel/babel/blob/main/packages/babel-helpers/LICENSE */
73
+ var e,
74
+ t,
75
+ r = "function" == typeof Symbol ? Symbol : {},
76
+ n = r.iterator || "@@iterator",
77
+ o = r.toStringTag || "@@toStringTag";
78
+ function i(r, n, o, i) {
79
+ var c = n && n.prototype instanceof Generator ? n : Generator,
80
+ u = Object.create(c.prototype);
81
+ return _regeneratorDefine(u, "_invoke", function (r, n, o) {
82
+ var i,
83
+ c,
84
+ u,
85
+ f = 0,
86
+ p = o || [],
87
+ y = !1,
88
+ G = {
89
+ p: 0,
90
+ n: 0,
91
+ v: e,
92
+ a: d,
93
+ f: d.bind(e, 4),
94
+ d: function (t, r) {
95
+ return i = t, c = 0, u = e, G.n = r, a;
96
+ }
97
+ };
98
+ function d(r, n) {
99
+ for (c = r, u = n, t = 0; !y && f && !o && t < p.length; t++) {
100
+ var o,
101
+ i = p[t],
102
+ d = G.p,
103
+ l = i[2];
104
+ r > 3 ? (o = l === n) && (u = i[(c = i[4]) ? 5 : (c = 3, 3)], i[4] = i[5] = e) : i[0] <= d && ((o = r < 2 && d < i[1]) ? (c = 0, G.v = n, G.n = i[1]) : d < l && (o = r < 3 || i[0] > n || n > l) && (i[4] = r, i[5] = n, G.n = l, c = 0));
105
+ }
106
+ if (o || r > 1) return a;
107
+ throw y = !0, n;
108
+ }
109
+ return function (o, p, l) {
110
+ if (f > 1) throw TypeError("Generator is already running");
111
+ for (y && 1 === p && d(p, l), c = p, u = l; (t = c < 2 ? e : u) || !y;) {
112
+ i || (c ? c < 3 ? (c > 1 && (G.n = -1), d(c, u)) : G.n = u : G.v = u);
113
+ try {
114
+ if (f = 2, i) {
115
+ if (c || (o = "next"), t = i[o]) {
116
+ if (!(t = t.call(i, u))) throw TypeError("iterator result is not an object");
117
+ if (!t.done) return t;
118
+ u = t.value, c < 2 && (c = 0);
119
+ } else 1 === c && (t = i.return) && t.call(i), c < 2 && (u = TypeError("The iterator does not provide a '" + o + "' method"), c = 1);
120
+ i = e;
121
+ } else if ((t = (y = G.n < 0) ? u : r.call(n, G)) !== a) break;
122
+ } catch (t) {
123
+ i = e, c = 1, u = t;
124
+ } finally {
125
+ f = 1;
126
+ }
127
+ }
128
+ return {
129
+ value: t,
130
+ done: y
131
+ };
116
132
  };
117
- }
133
+ }(r, o, i), !0), u;
118
134
  }
119
- e.wrap = wrap;
120
- var h = "suspendedStart",
121
- l = "suspendedYield",
122
- f = "executing",
123
- s = "completed",
124
- y = {};
135
+ var a = {};
125
136
  function Generator() {}
126
137
  function GeneratorFunction() {}
127
138
  function GeneratorFunctionPrototype() {}
128
- var p = {};
129
- define(p, a, function () {
139
+ t = Object.getPrototypeOf;
140
+ var c = [][n] ? t(t([][n]())) : (_regeneratorDefine(t = {}, n, function () {
141
+ return this;
142
+ }), t),
143
+ u = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(c);
144
+ function f(e) {
145
+ return Object.setPrototypeOf ? Object.setPrototypeOf(e, GeneratorFunctionPrototype) : (e.__proto__ = GeneratorFunctionPrototype, _regeneratorDefine(e, o, "GeneratorFunction")), e.prototype = Object.create(u), e;
146
+ }
147
+ return GeneratorFunction.prototype = GeneratorFunctionPrototype, _regeneratorDefine(u, "constructor", GeneratorFunctionPrototype), _regeneratorDefine(GeneratorFunctionPrototype, "constructor", GeneratorFunction), GeneratorFunction.displayName = "GeneratorFunction", _regeneratorDefine(GeneratorFunctionPrototype, o, "GeneratorFunction"), _regeneratorDefine(u), _regeneratorDefine(u, o, "Generator"), _regeneratorDefine(u, n, function () {
130
148
  return this;
149
+ }), _regeneratorDefine(u, "toString", function () {
150
+ return "[object Generator]";
151
+ }), (_regenerator = function () {
152
+ return {
153
+ w: i,
154
+ m: f
155
+ };
156
+ })();
157
+ }
158
+ function _regeneratorAsync(n, e, r, t, o) {
159
+ var a = _regeneratorAsyncGen(n, e, r, t, o);
160
+ return a.next().then(function (n) {
161
+ return n.done ? n.value : a.next();
131
162
  });
132
- var d = Object.getPrototypeOf,
133
- v = d && d(d(values([])));
134
- v && v !== r && n.call(v, a) && (p = v);
135
- var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p);
136
- function defineIteratorMethods(t) {
137
- ["next", "throw", "return"].forEach(function (e) {
138
- define(t, e, function (t) {
139
- return this._invoke(e, t);
163
+ }
164
+ function _regeneratorAsyncGen(r, e, t, o, n) {
165
+ return new _regeneratorAsyncIterator(_regenerator().w(r, e, t, o), n || Promise);
166
+ }
167
+ function _regeneratorAsyncIterator(t, e) {
168
+ function n(r, o, i, f) {
169
+ try {
170
+ var c = t[r](o),
171
+ u = c.value;
172
+ return u instanceof _OverloadYield ? e.resolve(u.v).then(function (t) {
173
+ n("next", t, i, f);
174
+ }, function (t) {
175
+ n("throw", t, i, f);
176
+ }) : e.resolve(u).then(function (t) {
177
+ c.value = t, i(c);
178
+ }, function (t) {
179
+ return n("throw", t, i, f);
140
180
  });
141
- });
181
+ } catch (t) {
182
+ f(t);
183
+ }
142
184
  }
143
- function AsyncIterator(t, e) {
144
- function invoke(r, o, i, a) {
145
- var c = tryCatch(t[r], t, o);
146
- if ("throw" !== c.type) {
147
- var u = c.arg,
148
- h = u.value;
149
- return h && "object" == typeof h && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) {
150
- invoke("next", t, i, a);
151
- }, function (t) {
152
- invoke("throw", t, i, a);
153
- }) : e.resolve(h).then(function (t) {
154
- u.value = t, i(u);
155
- }, function (t) {
156
- return invoke("throw", t, i, a);
157
- });
158
- }
159
- a(c.arg);
185
+ var r;
186
+ this.next || (_regeneratorDefine(_regeneratorAsyncIterator.prototype), _regeneratorDefine(_regeneratorAsyncIterator.prototype, "function" == typeof Symbol && Symbol.asyncIterator || "@asyncIterator", function () {
187
+ return this;
188
+ })), _regeneratorDefine(this, "_invoke", function (t, o, i) {
189
+ function f() {
190
+ return new e(function (e, r) {
191
+ n(t, i, e, r);
192
+ });
160
193
  }
161
- var r;
162
- o(this, "_invoke", {
163
- value: function (t, n) {
164
- function callInvokeWithMethodAndArg() {
165
- return new e(function (e, r) {
166
- invoke(t, n, e, r);
167
- });
168
- }
169
- return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg();
170
- }
171
- });
194
+ return r = r ? r.then(f, f) : f();
195
+ }, !0);
196
+ }
197
+ function _regeneratorDefine(e, r, n, t) {
198
+ var i = Object.defineProperty;
199
+ try {
200
+ i({}, "", {});
201
+ } catch (e) {
202
+ i = 0;
172
203
  }
173
- function makeInvokeMethod(e, r, n) {
174
- var o = h;
175
- return function (i, a) {
176
- if (o === f) throw Error("Generator is already running");
177
- if (o === s) {
178
- if ("throw" === i) throw a;
179
- return {
180
- value: t,
181
- done: !0
204
+ _regeneratorDefine = function (e, r, n, t) {
205
+ function o(r, n) {
206
+ _regeneratorDefine(e, r, function (e) {
207
+ return this._invoke(r, n, e);
208
+ });
209
+ }
210
+ r ? i ? i(e, r, {
211
+ value: n,
212
+ enumerable: !t,
213
+ configurable: !t,
214
+ writable: !t
215
+ }) : e[r] = n : (o("next", 0), o("throw", 1), o("return", 2));
216
+ }, _regeneratorDefine(e, r, n, t);
217
+ }
218
+ function _regeneratorKeys(e) {
219
+ var n = Object(e),
220
+ r = [];
221
+ for (var t in n) r.unshift(t);
222
+ return function e() {
223
+ for (; r.length;) if ((t = r.pop()) in n) return e.value = t, e.done = !1, e;
224
+ return e.done = !0, e;
225
+ };
226
+ }
227
+ function _regeneratorValues(e) {
228
+ if (null != e) {
229
+ var t = e["function" == typeof Symbol && Symbol.iterator || "@@iterator"],
230
+ r = 0;
231
+ if (t) return t.call(e);
232
+ if ("function" == typeof e.next) return e;
233
+ if (!isNaN(e.length)) return {
234
+ next: function () {
235
+ return e && r >= e.length && (e = void 0), {
236
+ value: e && e[r++],
237
+ done: !e
182
238
  };
183
239
  }
184
- for (n.method = i, n.arg = a;;) {
185
- var c = n.delegate;
186
- if (c) {
187
- var u = maybeInvokeDelegate(c, n);
188
- if (u) {
189
- if (u === y) continue;
190
- return u;
191
- }
192
- }
193
- if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) {
194
- if (o === h) throw o = s, n.arg;
195
- n.dispatchException(n.arg);
196
- } else "return" === n.method && n.abrupt("return", n.arg);
197
- o = f;
198
- var p = tryCatch(e, r, n);
199
- if ("normal" === p.type) {
200
- if (o = n.done ? s : l, p.arg === y) continue;
201
- return {
202
- value: p.arg,
203
- done: n.done
204
- };
205
- }
206
- "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg);
207
- }
208
- };
209
- }
210
- function maybeInvokeDelegate(e, r) {
211
- var n = r.method,
212
- o = e.iterator[n];
213
- if (o === t) return r.delegate = null, "throw" === n && e.iterator.return && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y;
214
- var i = tryCatch(o, e.iterator, r.arg);
215
- if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y;
216
- var a = i.arg;
217
- return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y);
218
- }
219
- function pushTryEntry(t) {
220
- var e = {
221
- tryLoc: t[0]
222
240
  };
223
- 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e);
224
241
  }
225
- function resetTryEntry(t) {
226
- var e = t.completion || {};
227
- e.type = "normal", delete e.arg, t.completion = e;
228
- }
229
- function Context(t) {
230
- this.tryEntries = [{
231
- tryLoc: "root"
232
- }], t.forEach(pushTryEntry, this), this.reset(!0);
242
+ throw new TypeError(typeof e + " is not iterable");
243
+ }
244
+ function _taggedTemplateLiteralLoose(e, t) {
245
+ return t || (t = e.slice(0)), e.raw = t, e;
246
+ }
247
+ function _regeneratorRuntime() {
248
+
249
+ var r = _regenerator(),
250
+ e = r.m(_regeneratorRuntime),
251
+ t = (Object.getPrototypeOf ? Object.getPrototypeOf(e) : e.__proto__).constructor;
252
+ function n(r) {
253
+ var e = "function" == typeof r && r.constructor;
254
+ return !!e && (e === t || "GeneratorFunction" === (e.displayName || e.name));
233
255
  }
234
- function values(e) {
235
- if (e || "" === e) {
236
- var r = e[a];
237
- if (r) return r.call(e);
238
- if ("function" == typeof e.next) return e;
239
- if (!isNaN(e.length)) {
240
- var o = -1,
241
- i = function next() {
242
- for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next;
243
- return next.value = t, next.done = !0, next;
244
- };
245
- return i.next = i;
256
+ var o = {
257
+ throw: 1,
258
+ return: 2,
259
+ break: 3,
260
+ continue: 3
261
+ };
262
+ function a(r) {
263
+ var e, t;
264
+ return function (n) {
265
+ e || (e = {
266
+ stop: function () {
267
+ return t(n.a, 2);
268
+ },
269
+ catch: function () {
270
+ return n.v;
271
+ },
272
+ abrupt: function (r, e) {
273
+ return t(n.a, o[r], e);
274
+ },
275
+ delegateYield: function (r, o, a) {
276
+ return e.resultName = o, t(n.d, _regeneratorValues(r), a);
277
+ },
278
+ finish: function (r) {
279
+ return t(n.f, r);
280
+ }
281
+ }, t = function (r, t, o) {
282
+ n.p = e.prev, n.n = e.next;
283
+ try {
284
+ return r(t, o);
285
+ } finally {
286
+ e.next = n.n;
287
+ }
288
+ }), e.resultName && (e[e.resultName] = n.v, e.resultName = void 0), e.sent = n.v, e.next = n.n;
289
+ try {
290
+ return r.call(this, e);
291
+ } finally {
292
+ n.p = e.prev, n.n = e.next;
246
293
  }
247
- }
248
- throw new TypeError(typeof e + " is not iterable");
294
+ };
249
295
  }
250
- return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", {
251
- value: GeneratorFunctionPrototype,
252
- configurable: !0
253
- }), o(GeneratorFunctionPrototype, "constructor", {
254
- value: GeneratorFunction,
255
- configurable: !0
256
- }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) {
257
- var e = "function" == typeof t && t.constructor;
258
- return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name));
259
- }, e.mark = function (t) {
260
- return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t;
261
- }, e.awrap = function (t) {
296
+ return (_regeneratorRuntime = function () {
262
297
  return {
263
- __await: t
264
- };
265
- }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () {
266
- return this;
267
- }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) {
268
- void 0 === i && (i = Promise);
269
- var a = new AsyncIterator(wrap(t, r, n, o), i);
270
- return e.isGeneratorFunction(r) ? a : a.next().then(function (t) {
271
- return t.done ? t.value : a.next();
272
- });
273
- }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () {
274
- return this;
275
- }), define(g, "toString", function () {
276
- return "[object Generator]";
277
- }), e.keys = function (t) {
278
- var e = Object(t),
279
- r = [];
280
- for (var n in e) r.push(n);
281
- return r.reverse(), function next() {
282
- for (; r.length;) {
283
- var t = r.pop();
284
- if (t in e) return next.value = t, next.done = !1, next;
285
- }
286
- return next.done = !0, next;
298
+ wrap: function (e, t, n, o) {
299
+ return r.w(a(e), t, n, o && o.reverse());
300
+ },
301
+ isGeneratorFunction: n,
302
+ mark: r.m,
303
+ awrap: function (r, e) {
304
+ return new _OverloadYield(r, e);
305
+ },
306
+ AsyncIterator: _regeneratorAsyncIterator,
307
+ async: function (r, e, t, o, u) {
308
+ return (n(e) ? _regeneratorAsyncGen : _regeneratorAsync)(a(r), e, t, o, u);
309
+ },
310
+ keys: _regeneratorKeys,
311
+ values: _regeneratorValues
287
312
  };
288
- }, e.values = values, Context.prototype = {
289
- constructor: Context,
290
- reset: function (e) {
291
- if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t);
292
- },
293
- stop: function () {
294
- this.done = !0;
295
- var t = this.tryEntries[0].completion;
296
- if ("throw" === t.type) throw t.arg;
297
- return this.rval;
298
- },
299
- dispatchException: function (e) {
300
- if (this.done) throw e;
301
- var r = this;
302
- function handle(n, o) {
303
- return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o;
304
- }
305
- for (var o = this.tryEntries.length - 1; o >= 0; --o) {
306
- var i = this.tryEntries[o],
307
- a = i.completion;
308
- if ("root" === i.tryLoc) return handle("end");
309
- if (i.tryLoc <= this.prev) {
310
- var c = n.call(i, "catchLoc"),
311
- u = n.call(i, "finallyLoc");
312
- if (c && u) {
313
- if (this.prev < i.catchLoc) return handle(i.catchLoc, !0);
314
- if (this.prev < i.finallyLoc) return handle(i.finallyLoc);
315
- } else if (c) {
316
- if (this.prev < i.catchLoc) return handle(i.catchLoc, !0);
317
- } else {
318
- if (!u) throw Error("try statement without catch or finally");
319
- if (this.prev < i.finallyLoc) return handle(i.finallyLoc);
320
- }
321
- }
322
- }
323
- },
324
- abrupt: function (t, e) {
325
- for (var r = this.tryEntries.length - 1; r >= 0; --r) {
326
- var o = this.tryEntries[r];
327
- if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) {
328
- var i = o;
329
- break;
330
- }
331
- }
332
- i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null);
333
- var a = i ? i.completion : {};
334
- return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a);
335
- },
336
- complete: function (t, e) {
337
- if ("throw" === t.type) throw t.arg;
338
- return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y;
339
- },
340
- finish: function (t) {
341
- for (var e = this.tryEntries.length - 1; e >= 0; --e) {
342
- var r = this.tryEntries[e];
343
- if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y;
344
- }
345
- },
346
- catch: function (t) {
347
- for (var e = this.tryEntries.length - 1; e >= 0; --e) {
348
- var r = this.tryEntries[e];
349
- if (r.tryLoc === t) {
350
- var n = r.completion;
351
- if ("throw" === n.type) {
352
- var o = n.arg;
353
- resetTryEntry(r);
354
- }
355
- return o;
356
- }
357
- }
358
- throw Error("illegal catch attempt");
359
- },
360
- delegateYield: function (e, r, n) {
361
- return this.delegate = {
362
- iterator: values(e),
363
- resultName: r,
364
- nextLoc: n
365
- }, "next" === this.method && (this.arg = t), y;
366
- }
367
- }, e;
368
- }
369
- function _taggedTemplateLiteralLoose(e, t) {
370
- return t || (t = e.slice(0)), e.raw = t, e;
313
+ })();
371
314
  }
372
315
 
373
316
  var STRAPI_URI = process.env.NEXT_PUBLIC_STRAPI_URI || 'http://127.0.0.1:1337';
@@ -7208,6 +7151,16 @@ var Events = function Events(_ref) {
7208
7151
  }))))));
7209
7152
  };
7210
7153
 
7154
+ var Redirect = function Redirect(_ref) {
7155
+ var slice = _ref.slice;
7156
+ var router = useRouter();
7157
+ useEffect(function () {
7158
+ // When using `replace`, the current browser history entry will be replaced
7159
+ router.replace(slice.url);
7160
+ }, [slice.url]);
7161
+ return React.createElement(React.Fragment, null);
7162
+ };
7163
+
7211
7164
  var SliceRenderer = function SliceRenderer(_ref) {
7212
7165
  var slices = _ref.slices,
7213
7166
  blogPosts = _ref.blogPosts,
@@ -7428,6 +7381,11 @@ var SliceRenderer = function SliceRenderer(_ref) {
7428
7381
  key: slice.__component + "-" + slice.id,
7429
7382
  slice: slice
7430
7383
  });
7384
+ case 'sections.redirect':
7385
+ return React.createElement(Redirect, {
7386
+ key: slice.__component + "-" + slice.id,
7387
+ slice: slice
7388
+ });
7431
7389
  default:
7432
7390
  if (CustomSlice) {
7433
7391
  return React.createElement(CustomSlice, {