@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.
- package/README.md +2 -0
- package/dist/__mocks__/next/navigation.d.ts +7 -0
- package/dist/__mocks__/next/router.d.ts +1 -0
- package/dist/slices/Redirect/Redirect.d.ts +7 -0
- package/dist/slices/Redirect/index.d.ts +2 -0
- package/dist/strapi-slices.cjs.development.js +241 -283
- package/dist/strapi-slices.cjs.development.js.map +1 -1
- package/dist/strapi-slices.cjs.production.min.js +1 -1
- package/dist/strapi-slices.cjs.production.min.js.map +1 -1
- package/dist/strapi-slices.esm.js +241 -283
- package/dist/strapi-slices.esm.js.map +1 -1
- package/package.json +1 -1
- package/src/components/SliceRenderer/SliceRenderer.tsx +5 -0
- package/src/slices/Redirect/Rediect.test.tsx +30 -0
- package/src/slices/Redirect/Redirect.tsx +18 -0
- package/src/slices/Redirect/index.ts +3 -0
package/README.md
CHANGED
|
@@ -41,6 +41,9 @@ var useEmblaCarousel__default = /*#__PURE__*/_interopDefault(useEmblaCarousel);
|
|
|
41
41
|
var AutoScroll__default = /*#__PURE__*/_interopDefault(AutoScroll);
|
|
42
42
|
var useSWRInfinite__default = /*#__PURE__*/_interopDefault(useSWRInfinite);
|
|
43
43
|
|
|
44
|
+
function _OverloadYield(e, d) {
|
|
45
|
+
this.v = e, this.k = d;
|
|
46
|
+
}
|
|
44
47
|
function asyncGeneratorStep(n, t, e, r, o, a, c) {
|
|
45
48
|
try {
|
|
46
49
|
var i = n[a](c),
|
|
@@ -84,309 +87,249 @@ function _objectWithoutPropertiesLoose(r, e) {
|
|
|
84
87
|
}
|
|
85
88
|
return t;
|
|
86
89
|
}
|
|
87
|
-
function
|
|
88
|
-
|
|
89
|
-
|
|
90
|
-
|
|
91
|
-
|
|
92
|
-
|
|
93
|
-
|
|
94
|
-
|
|
95
|
-
|
|
96
|
-
|
|
97
|
-
|
|
98
|
-
|
|
99
|
-
|
|
100
|
-
|
|
101
|
-
|
|
102
|
-
|
|
103
|
-
|
|
104
|
-
|
|
105
|
-
|
|
106
|
-
|
|
107
|
-
|
|
108
|
-
|
|
109
|
-
|
|
110
|
-
|
|
111
|
-
|
|
112
|
-
|
|
113
|
-
|
|
114
|
-
|
|
115
|
-
|
|
116
|
-
|
|
117
|
-
|
|
118
|
-
|
|
119
|
-
|
|
120
|
-
|
|
121
|
-
|
|
122
|
-
|
|
123
|
-
|
|
124
|
-
|
|
125
|
-
|
|
126
|
-
|
|
127
|
-
|
|
128
|
-
|
|
129
|
-
|
|
130
|
-
|
|
131
|
-
|
|
132
|
-
|
|
133
|
-
|
|
134
|
-
|
|
90
|
+
function _regenerator() {
|
|
91
|
+
/*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/babel/babel/blob/main/packages/babel-helpers/LICENSE */
|
|
92
|
+
var e,
|
|
93
|
+
t,
|
|
94
|
+
r = "function" == typeof Symbol ? Symbol : {},
|
|
95
|
+
n = r.iterator || "@@iterator",
|
|
96
|
+
o = r.toStringTag || "@@toStringTag";
|
|
97
|
+
function i(r, n, o, i) {
|
|
98
|
+
var c = n && n.prototype instanceof Generator ? n : Generator,
|
|
99
|
+
u = Object.create(c.prototype);
|
|
100
|
+
return _regeneratorDefine(u, "_invoke", function (r, n, o) {
|
|
101
|
+
var i,
|
|
102
|
+
c,
|
|
103
|
+
u,
|
|
104
|
+
f = 0,
|
|
105
|
+
p = o || [],
|
|
106
|
+
y = !1,
|
|
107
|
+
G = {
|
|
108
|
+
p: 0,
|
|
109
|
+
n: 0,
|
|
110
|
+
v: e,
|
|
111
|
+
a: d,
|
|
112
|
+
f: d.bind(e, 4),
|
|
113
|
+
d: function (t, r) {
|
|
114
|
+
return i = t, c = 0, u = e, G.n = r, a;
|
|
115
|
+
}
|
|
116
|
+
};
|
|
117
|
+
function d(r, n) {
|
|
118
|
+
for (c = r, u = n, t = 0; !y && f && !o && t < p.length; t++) {
|
|
119
|
+
var o,
|
|
120
|
+
i = p[t],
|
|
121
|
+
d = G.p,
|
|
122
|
+
l = i[2];
|
|
123
|
+
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));
|
|
124
|
+
}
|
|
125
|
+
if (o || r > 1) return a;
|
|
126
|
+
throw y = !0, n;
|
|
127
|
+
}
|
|
128
|
+
return function (o, p, l) {
|
|
129
|
+
if (f > 1) throw TypeError("Generator is already running");
|
|
130
|
+
for (y && 1 === p && d(p, l), c = p, u = l; (t = c < 2 ? e : u) || !y;) {
|
|
131
|
+
i || (c ? c < 3 ? (c > 1 && (G.n = -1), d(c, u)) : G.n = u : G.v = u);
|
|
132
|
+
try {
|
|
133
|
+
if (f = 2, i) {
|
|
134
|
+
if (c || (o = "next"), t = i[o]) {
|
|
135
|
+
if (!(t = t.call(i, u))) throw TypeError("iterator result is not an object");
|
|
136
|
+
if (!t.done) return t;
|
|
137
|
+
u = t.value, c < 2 && (c = 0);
|
|
138
|
+
} else 1 === c && (t = i.return) && t.call(i), c < 2 && (u = TypeError("The iterator does not provide a '" + o + "' method"), c = 1);
|
|
139
|
+
i = e;
|
|
140
|
+
} else if ((t = (y = G.n < 0) ? u : r.call(n, G)) !== a) break;
|
|
141
|
+
} catch (t) {
|
|
142
|
+
i = e, c = 1, u = t;
|
|
143
|
+
} finally {
|
|
144
|
+
f = 1;
|
|
145
|
+
}
|
|
146
|
+
}
|
|
147
|
+
return {
|
|
148
|
+
value: t,
|
|
149
|
+
done: y
|
|
150
|
+
};
|
|
135
151
|
};
|
|
136
|
-
}
|
|
152
|
+
}(r, o, i), !0), u;
|
|
137
153
|
}
|
|
138
|
-
|
|
139
|
-
var h = "suspendedStart",
|
|
140
|
-
l = "suspendedYield",
|
|
141
|
-
f = "executing",
|
|
142
|
-
s = "completed",
|
|
143
|
-
y = {};
|
|
154
|
+
var a = {};
|
|
144
155
|
function Generator() {}
|
|
145
156
|
function GeneratorFunction() {}
|
|
146
157
|
function GeneratorFunctionPrototype() {}
|
|
147
|
-
|
|
148
|
-
|
|
158
|
+
t = Object.getPrototypeOf;
|
|
159
|
+
var c = [][n] ? t(t([][n]())) : (_regeneratorDefine(t = {}, n, function () {
|
|
160
|
+
return this;
|
|
161
|
+
}), t),
|
|
162
|
+
u = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(c);
|
|
163
|
+
function f(e) {
|
|
164
|
+
return Object.setPrototypeOf ? Object.setPrototypeOf(e, GeneratorFunctionPrototype) : (e.__proto__ = GeneratorFunctionPrototype, _regeneratorDefine(e, o, "GeneratorFunction")), e.prototype = Object.create(u), e;
|
|
165
|
+
}
|
|
166
|
+
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 () {
|
|
149
167
|
return this;
|
|
168
|
+
}), _regeneratorDefine(u, "toString", function () {
|
|
169
|
+
return "[object Generator]";
|
|
170
|
+
}), (_regenerator = function () {
|
|
171
|
+
return {
|
|
172
|
+
w: i,
|
|
173
|
+
m: f
|
|
174
|
+
};
|
|
175
|
+
})();
|
|
176
|
+
}
|
|
177
|
+
function _regeneratorAsync(n, e, r, t, o) {
|
|
178
|
+
var a = _regeneratorAsyncGen(n, e, r, t, o);
|
|
179
|
+
return a.next().then(function (n) {
|
|
180
|
+
return n.done ? n.value : a.next();
|
|
150
181
|
});
|
|
151
|
-
|
|
152
|
-
|
|
153
|
-
|
|
154
|
-
|
|
155
|
-
|
|
156
|
-
|
|
157
|
-
|
|
158
|
-
|
|
182
|
+
}
|
|
183
|
+
function _regeneratorAsyncGen(r, e, t, o, n) {
|
|
184
|
+
return new _regeneratorAsyncIterator(_regenerator().w(r, e, t, o), n || Promise);
|
|
185
|
+
}
|
|
186
|
+
function _regeneratorAsyncIterator(t, e) {
|
|
187
|
+
function n(r, o, i, f) {
|
|
188
|
+
try {
|
|
189
|
+
var c = t[r](o),
|
|
190
|
+
u = c.value;
|
|
191
|
+
return u instanceof _OverloadYield ? e.resolve(u.v).then(function (t) {
|
|
192
|
+
n("next", t, i, f);
|
|
193
|
+
}, function (t) {
|
|
194
|
+
n("throw", t, i, f);
|
|
195
|
+
}) : e.resolve(u).then(function (t) {
|
|
196
|
+
c.value = t, i(c);
|
|
197
|
+
}, function (t) {
|
|
198
|
+
return n("throw", t, i, f);
|
|
159
199
|
});
|
|
160
|
-
})
|
|
200
|
+
} catch (t) {
|
|
201
|
+
f(t);
|
|
202
|
+
}
|
|
161
203
|
}
|
|
162
|
-
|
|
163
|
-
|
|
164
|
-
|
|
165
|
-
|
|
166
|
-
|
|
167
|
-
|
|
168
|
-
|
|
169
|
-
|
|
170
|
-
}, function (t) {
|
|
171
|
-
invoke("throw", t, i, a);
|
|
172
|
-
}) : e.resolve(h).then(function (t) {
|
|
173
|
-
u.value = t, i(u);
|
|
174
|
-
}, function (t) {
|
|
175
|
-
return invoke("throw", t, i, a);
|
|
176
|
-
});
|
|
177
|
-
}
|
|
178
|
-
a(c.arg);
|
|
204
|
+
var r;
|
|
205
|
+
this.next || (_regeneratorDefine(_regeneratorAsyncIterator.prototype), _regeneratorDefine(_regeneratorAsyncIterator.prototype, "function" == typeof Symbol && Symbol.asyncIterator || "@asyncIterator", function () {
|
|
206
|
+
return this;
|
|
207
|
+
})), _regeneratorDefine(this, "_invoke", function (t, o, i) {
|
|
208
|
+
function f() {
|
|
209
|
+
return new e(function (e, r) {
|
|
210
|
+
n(t, i, e, r);
|
|
211
|
+
});
|
|
179
212
|
}
|
|
180
|
-
|
|
181
|
-
|
|
182
|
-
|
|
183
|
-
|
|
184
|
-
|
|
185
|
-
|
|
186
|
-
|
|
187
|
-
|
|
188
|
-
|
|
189
|
-
}
|
|
190
|
-
});
|
|
213
|
+
return r = r ? r.then(f, f) : f();
|
|
214
|
+
}, !0);
|
|
215
|
+
}
|
|
216
|
+
function _regeneratorDefine(e, r, n, t) {
|
|
217
|
+
var i = Object.defineProperty;
|
|
218
|
+
try {
|
|
219
|
+
i({}, "", {});
|
|
220
|
+
} catch (e) {
|
|
221
|
+
i = 0;
|
|
191
222
|
}
|
|
192
|
-
function
|
|
193
|
-
|
|
194
|
-
|
|
195
|
-
|
|
196
|
-
|
|
197
|
-
|
|
198
|
-
|
|
199
|
-
|
|
200
|
-
|
|
223
|
+
_regeneratorDefine = function (e, r, n, t) {
|
|
224
|
+
function o(r, n) {
|
|
225
|
+
_regeneratorDefine(e, r, function (e) {
|
|
226
|
+
return this._invoke(r, n, e);
|
|
227
|
+
});
|
|
228
|
+
}
|
|
229
|
+
r ? i ? i(e, r, {
|
|
230
|
+
value: n,
|
|
231
|
+
enumerable: !t,
|
|
232
|
+
configurable: !t,
|
|
233
|
+
writable: !t
|
|
234
|
+
}) : e[r] = n : (o("next", 0), o("throw", 1), o("return", 2));
|
|
235
|
+
}, _regeneratorDefine(e, r, n, t);
|
|
236
|
+
}
|
|
237
|
+
function _regeneratorKeys(e) {
|
|
238
|
+
var n = Object(e),
|
|
239
|
+
r = [];
|
|
240
|
+
for (var t in n) r.unshift(t);
|
|
241
|
+
return function e() {
|
|
242
|
+
for (; r.length;) if ((t = r.pop()) in n) return e.value = t, e.done = !1, e;
|
|
243
|
+
return e.done = !0, e;
|
|
244
|
+
};
|
|
245
|
+
}
|
|
246
|
+
function _regeneratorValues(e) {
|
|
247
|
+
if (null != e) {
|
|
248
|
+
var t = e["function" == typeof Symbol && Symbol.iterator || "@@iterator"],
|
|
249
|
+
r = 0;
|
|
250
|
+
if (t) return t.call(e);
|
|
251
|
+
if ("function" == typeof e.next) return e;
|
|
252
|
+
if (!isNaN(e.length)) return {
|
|
253
|
+
next: function () {
|
|
254
|
+
return e && r >= e.length && (e = void 0), {
|
|
255
|
+
value: e && e[r++],
|
|
256
|
+
done: !e
|
|
201
257
|
};
|
|
202
258
|
}
|
|
203
|
-
for (n.method = i, n.arg = a;;) {
|
|
204
|
-
var c = n.delegate;
|
|
205
|
-
if (c) {
|
|
206
|
-
var u = maybeInvokeDelegate(c, n);
|
|
207
|
-
if (u) {
|
|
208
|
-
if (u === y) continue;
|
|
209
|
-
return u;
|
|
210
|
-
}
|
|
211
|
-
}
|
|
212
|
-
if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) {
|
|
213
|
-
if (o === h) throw o = s, n.arg;
|
|
214
|
-
n.dispatchException(n.arg);
|
|
215
|
-
} else "return" === n.method && n.abrupt("return", n.arg);
|
|
216
|
-
o = f;
|
|
217
|
-
var p = tryCatch(e, r, n);
|
|
218
|
-
if ("normal" === p.type) {
|
|
219
|
-
if (o = n.done ? s : l, p.arg === y) continue;
|
|
220
|
-
return {
|
|
221
|
-
value: p.arg,
|
|
222
|
-
done: n.done
|
|
223
|
-
};
|
|
224
|
-
}
|
|
225
|
-
"throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg);
|
|
226
|
-
}
|
|
227
|
-
};
|
|
228
|
-
}
|
|
229
|
-
function maybeInvokeDelegate(e, r) {
|
|
230
|
-
var n = r.method,
|
|
231
|
-
o = e.iterator[n];
|
|
232
|
-
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;
|
|
233
|
-
var i = tryCatch(o, e.iterator, r.arg);
|
|
234
|
-
if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y;
|
|
235
|
-
var a = i.arg;
|
|
236
|
-
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);
|
|
237
|
-
}
|
|
238
|
-
function pushTryEntry(t) {
|
|
239
|
-
var e = {
|
|
240
|
-
tryLoc: t[0]
|
|
241
259
|
};
|
|
242
|
-
1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e);
|
|
243
260
|
}
|
|
244
|
-
|
|
245
|
-
|
|
246
|
-
|
|
247
|
-
|
|
248
|
-
|
|
249
|
-
|
|
250
|
-
|
|
251
|
-
|
|
261
|
+
throw new TypeError(typeof e + " is not iterable");
|
|
262
|
+
}
|
|
263
|
+
function _taggedTemplateLiteralLoose(e, t) {
|
|
264
|
+
return t || (t = e.slice(0)), e.raw = t, e;
|
|
265
|
+
}
|
|
266
|
+
function _regeneratorRuntime() {
|
|
267
|
+
|
|
268
|
+
var r = _regenerator(),
|
|
269
|
+
e = r.m(_regeneratorRuntime),
|
|
270
|
+
t = (Object.getPrototypeOf ? Object.getPrototypeOf(e) : e.__proto__).constructor;
|
|
271
|
+
function n(r) {
|
|
272
|
+
var e = "function" == typeof r && r.constructor;
|
|
273
|
+
return !!e && (e === t || "GeneratorFunction" === (e.displayName || e.name));
|
|
252
274
|
}
|
|
253
|
-
|
|
254
|
-
|
|
255
|
-
|
|
256
|
-
|
|
257
|
-
|
|
258
|
-
|
|
259
|
-
|
|
260
|
-
|
|
261
|
-
|
|
262
|
-
|
|
263
|
-
|
|
264
|
-
|
|
275
|
+
var o = {
|
|
276
|
+
throw: 1,
|
|
277
|
+
return: 2,
|
|
278
|
+
break: 3,
|
|
279
|
+
continue: 3
|
|
280
|
+
};
|
|
281
|
+
function a(r) {
|
|
282
|
+
var e, t;
|
|
283
|
+
return function (n) {
|
|
284
|
+
e || (e = {
|
|
285
|
+
stop: function () {
|
|
286
|
+
return t(n.a, 2);
|
|
287
|
+
},
|
|
288
|
+
catch: function () {
|
|
289
|
+
return n.v;
|
|
290
|
+
},
|
|
291
|
+
abrupt: function (r, e) {
|
|
292
|
+
return t(n.a, o[r], e);
|
|
293
|
+
},
|
|
294
|
+
delegateYield: function (r, o, a) {
|
|
295
|
+
return e.resultName = o, t(n.d, _regeneratorValues(r), a);
|
|
296
|
+
},
|
|
297
|
+
finish: function (r) {
|
|
298
|
+
return t(n.f, r);
|
|
299
|
+
}
|
|
300
|
+
}, t = function (r, t, o) {
|
|
301
|
+
n.p = e.prev, n.n = e.next;
|
|
302
|
+
try {
|
|
303
|
+
return r(t, o);
|
|
304
|
+
} finally {
|
|
305
|
+
e.next = n.n;
|
|
306
|
+
}
|
|
307
|
+
}), e.resultName && (e[e.resultName] = n.v, e.resultName = void 0), e.sent = n.v, e.next = n.n;
|
|
308
|
+
try {
|
|
309
|
+
return r.call(this, e);
|
|
310
|
+
} finally {
|
|
311
|
+
n.p = e.prev, n.n = e.next;
|
|
265
312
|
}
|
|
266
|
-
}
|
|
267
|
-
throw new TypeError(typeof e + " is not iterable");
|
|
313
|
+
};
|
|
268
314
|
}
|
|
269
|
-
return
|
|
270
|
-
value: GeneratorFunctionPrototype,
|
|
271
|
-
configurable: !0
|
|
272
|
-
}), o(GeneratorFunctionPrototype, "constructor", {
|
|
273
|
-
value: GeneratorFunction,
|
|
274
|
-
configurable: !0
|
|
275
|
-
}), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) {
|
|
276
|
-
var e = "function" == typeof t && t.constructor;
|
|
277
|
-
return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name));
|
|
278
|
-
}, e.mark = function (t) {
|
|
279
|
-
return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t;
|
|
280
|
-
}, e.awrap = function (t) {
|
|
315
|
+
return (_regeneratorRuntime = function () {
|
|
281
316
|
return {
|
|
282
|
-
|
|
283
|
-
|
|
284
|
-
|
|
285
|
-
|
|
286
|
-
|
|
287
|
-
|
|
288
|
-
|
|
289
|
-
|
|
290
|
-
|
|
291
|
-
|
|
292
|
-
|
|
293
|
-
|
|
294
|
-
|
|
295
|
-
|
|
296
|
-
}), e.keys = function (t) {
|
|
297
|
-
var e = Object(t),
|
|
298
|
-
r = [];
|
|
299
|
-
for (var n in e) r.push(n);
|
|
300
|
-
return r.reverse(), function next() {
|
|
301
|
-
for (; r.length;) {
|
|
302
|
-
var t = r.pop();
|
|
303
|
-
if (t in e) return next.value = t, next.done = !1, next;
|
|
304
|
-
}
|
|
305
|
-
return next.done = !0, next;
|
|
317
|
+
wrap: function (e, t, n, o) {
|
|
318
|
+
return r.w(a(e), t, n, o && o.reverse());
|
|
319
|
+
},
|
|
320
|
+
isGeneratorFunction: n,
|
|
321
|
+
mark: r.m,
|
|
322
|
+
awrap: function (r, e) {
|
|
323
|
+
return new _OverloadYield(r, e);
|
|
324
|
+
},
|
|
325
|
+
AsyncIterator: _regeneratorAsyncIterator,
|
|
326
|
+
async: function (r, e, t, o, u) {
|
|
327
|
+
return (n(e) ? _regeneratorAsyncGen : _regeneratorAsync)(a(r), e, t, o, u);
|
|
328
|
+
},
|
|
329
|
+
keys: _regeneratorKeys,
|
|
330
|
+
values: _regeneratorValues
|
|
306
331
|
};
|
|
307
|
-
}
|
|
308
|
-
constructor: Context,
|
|
309
|
-
reset: function (e) {
|
|
310
|
-
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);
|
|
311
|
-
},
|
|
312
|
-
stop: function () {
|
|
313
|
-
this.done = !0;
|
|
314
|
-
var t = this.tryEntries[0].completion;
|
|
315
|
-
if ("throw" === t.type) throw t.arg;
|
|
316
|
-
return this.rval;
|
|
317
|
-
},
|
|
318
|
-
dispatchException: function (e) {
|
|
319
|
-
if (this.done) throw e;
|
|
320
|
-
var r = this;
|
|
321
|
-
function handle(n, o) {
|
|
322
|
-
return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o;
|
|
323
|
-
}
|
|
324
|
-
for (var o = this.tryEntries.length - 1; o >= 0; --o) {
|
|
325
|
-
var i = this.tryEntries[o],
|
|
326
|
-
a = i.completion;
|
|
327
|
-
if ("root" === i.tryLoc) return handle("end");
|
|
328
|
-
if (i.tryLoc <= this.prev) {
|
|
329
|
-
var c = n.call(i, "catchLoc"),
|
|
330
|
-
u = n.call(i, "finallyLoc");
|
|
331
|
-
if (c && u) {
|
|
332
|
-
if (this.prev < i.catchLoc) return handle(i.catchLoc, !0);
|
|
333
|
-
if (this.prev < i.finallyLoc) return handle(i.finallyLoc);
|
|
334
|
-
} else if (c) {
|
|
335
|
-
if (this.prev < i.catchLoc) return handle(i.catchLoc, !0);
|
|
336
|
-
} else {
|
|
337
|
-
if (!u) throw Error("try statement without catch or finally");
|
|
338
|
-
if (this.prev < i.finallyLoc) return handle(i.finallyLoc);
|
|
339
|
-
}
|
|
340
|
-
}
|
|
341
|
-
}
|
|
342
|
-
},
|
|
343
|
-
abrupt: function (t, e) {
|
|
344
|
-
for (var r = this.tryEntries.length - 1; r >= 0; --r) {
|
|
345
|
-
var o = this.tryEntries[r];
|
|
346
|
-
if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) {
|
|
347
|
-
var i = o;
|
|
348
|
-
break;
|
|
349
|
-
}
|
|
350
|
-
}
|
|
351
|
-
i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null);
|
|
352
|
-
var a = i ? i.completion : {};
|
|
353
|
-
return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a);
|
|
354
|
-
},
|
|
355
|
-
complete: function (t, e) {
|
|
356
|
-
if ("throw" === t.type) throw t.arg;
|
|
357
|
-
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;
|
|
358
|
-
},
|
|
359
|
-
finish: function (t) {
|
|
360
|
-
for (var e = this.tryEntries.length - 1; e >= 0; --e) {
|
|
361
|
-
var r = this.tryEntries[e];
|
|
362
|
-
if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y;
|
|
363
|
-
}
|
|
364
|
-
},
|
|
365
|
-
catch: function (t) {
|
|
366
|
-
for (var e = this.tryEntries.length - 1; e >= 0; --e) {
|
|
367
|
-
var r = this.tryEntries[e];
|
|
368
|
-
if (r.tryLoc === t) {
|
|
369
|
-
var n = r.completion;
|
|
370
|
-
if ("throw" === n.type) {
|
|
371
|
-
var o = n.arg;
|
|
372
|
-
resetTryEntry(r);
|
|
373
|
-
}
|
|
374
|
-
return o;
|
|
375
|
-
}
|
|
376
|
-
}
|
|
377
|
-
throw Error("illegal catch attempt");
|
|
378
|
-
},
|
|
379
|
-
delegateYield: function (e, r, n) {
|
|
380
|
-
return this.delegate = {
|
|
381
|
-
iterator: values(e),
|
|
382
|
-
resultName: r,
|
|
383
|
-
nextLoc: n
|
|
384
|
-
}, "next" === this.method && (this.arg = t), y;
|
|
385
|
-
}
|
|
386
|
-
}, e;
|
|
387
|
-
}
|
|
388
|
-
function _taggedTemplateLiteralLoose(e, t) {
|
|
389
|
-
return t || (t = e.slice(0)), e.raw = t, e;
|
|
332
|
+
})();
|
|
390
333
|
}
|
|
391
334
|
|
|
392
335
|
var STRAPI_URI = process.env.NEXT_PUBLIC_STRAPI_URI || 'http://127.0.0.1:1337';
|
|
@@ -7227,6 +7170,16 @@ var Events = function Events(_ref) {
|
|
|
7227
7170
|
}))))));
|
|
7228
7171
|
};
|
|
7229
7172
|
|
|
7173
|
+
var Redirect = function Redirect(_ref) {
|
|
7174
|
+
var slice = _ref.slice;
|
|
7175
|
+
var router$1 = router.useRouter();
|
|
7176
|
+
React.useEffect(function () {
|
|
7177
|
+
// When using `replace`, the current browser history entry will be replaced
|
|
7178
|
+
router$1.replace(slice.url);
|
|
7179
|
+
}, [slice.url]);
|
|
7180
|
+
return React__default.default.createElement(React__default.default.Fragment, null);
|
|
7181
|
+
};
|
|
7182
|
+
|
|
7230
7183
|
var SliceRenderer = function SliceRenderer(_ref) {
|
|
7231
7184
|
var slices = _ref.slices,
|
|
7232
7185
|
blogPosts = _ref.blogPosts,
|
|
@@ -7447,6 +7400,11 @@ var SliceRenderer = function SliceRenderer(_ref) {
|
|
|
7447
7400
|
key: slice.__component + "-" + slice.id,
|
|
7448
7401
|
slice: slice
|
|
7449
7402
|
});
|
|
7403
|
+
case 'sections.redirect':
|
|
7404
|
+
return React__default.default.createElement(Redirect, {
|
|
7405
|
+
key: slice.__component + "-" + slice.id,
|
|
7406
|
+
slice: slice
|
|
7407
|
+
});
|
|
7450
7408
|
default:
|
|
7451
7409
|
if (CustomSlice) {
|
|
7452
7410
|
return React__default.default.createElement(CustomSlice, {
|