@treely/strapi-slices 7.15.1 → 7.16.0
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/slices/Redirect/Redirect.d.ts +7 -0
- package/dist/slices/Redirect/index.d.ts +2 -0
- package/dist/strapi-slices.cjs.development.js +247 -287
- 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 +247 -287
- package/dist/strapi-slices.esm.js.map +1 -1
- package/package.json +1 -1
- package/src/components/SliceRenderer/SliceRenderer.tsx +5 -0
- package/src/components/portfolio/ProjectInfo/ProjectInfo.tsx +39 -33
- package/src/slices/Redirect/Rediect.test.tsx +33 -0
- package/src/slices/Redirect/Redirect.tsx +17 -0
- package/src/slices/Redirect/index.ts +3 -0
|
@@ -21,7 +21,11 @@ import { Formik, Form, Field } from 'formik';
|
|
|
21
21
|
import useEmblaCarousel from 'embla-carousel-react';
|
|
22
22
|
import AutoScroll from 'embla-carousel-auto-scroll';
|
|
23
23
|
import useSWRInfinite from 'swr/infinite';
|
|
24
|
+
import { redirect, RedirectType } from 'next/navigation';
|
|
24
25
|
|
|
26
|
+
function _OverloadYield(e, d) {
|
|
27
|
+
this.v = e, this.k = d;
|
|
28
|
+
}
|
|
25
29
|
function asyncGeneratorStep(n, t, e, r, o, a, c) {
|
|
26
30
|
try {
|
|
27
31
|
var i = n[a](c),
|
|
@@ -65,309 +69,249 @@ function _objectWithoutPropertiesLoose(r, e) {
|
|
|
65
69
|
}
|
|
66
70
|
return t;
|
|
67
71
|
}
|
|
68
|
-
function
|
|
69
|
-
|
|
70
|
-
|
|
71
|
-
|
|
72
|
-
|
|
73
|
-
|
|
74
|
-
|
|
75
|
-
|
|
76
|
-
|
|
77
|
-
|
|
78
|
-
|
|
79
|
-
|
|
80
|
-
|
|
81
|
-
|
|
82
|
-
|
|
83
|
-
|
|
84
|
-
|
|
85
|
-
|
|
86
|
-
|
|
87
|
-
|
|
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
|
-
|
|
72
|
+
function _regenerator() {
|
|
73
|
+
/*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/babel/babel/blob/main/packages/babel-helpers/LICENSE */
|
|
74
|
+
var e,
|
|
75
|
+
t,
|
|
76
|
+
r = "function" == typeof Symbol ? Symbol : {},
|
|
77
|
+
n = r.iterator || "@@iterator",
|
|
78
|
+
o = r.toStringTag || "@@toStringTag";
|
|
79
|
+
function i(r, n, o, i) {
|
|
80
|
+
var c = n && n.prototype instanceof Generator ? n : Generator,
|
|
81
|
+
u = Object.create(c.prototype);
|
|
82
|
+
return _regeneratorDefine(u, "_invoke", function (r, n, o) {
|
|
83
|
+
var i,
|
|
84
|
+
c,
|
|
85
|
+
u,
|
|
86
|
+
f = 0,
|
|
87
|
+
p = o || [],
|
|
88
|
+
y = !1,
|
|
89
|
+
G = {
|
|
90
|
+
p: 0,
|
|
91
|
+
n: 0,
|
|
92
|
+
v: e,
|
|
93
|
+
a: d,
|
|
94
|
+
f: d.bind(e, 4),
|
|
95
|
+
d: function (t, r) {
|
|
96
|
+
return i = t, c = 0, u = e, G.n = r, a;
|
|
97
|
+
}
|
|
98
|
+
};
|
|
99
|
+
function d(r, n) {
|
|
100
|
+
for (c = r, u = n, t = 0; !y && f && !o && t < p.length; t++) {
|
|
101
|
+
var o,
|
|
102
|
+
i = p[t],
|
|
103
|
+
d = G.p,
|
|
104
|
+
l = i[2];
|
|
105
|
+
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));
|
|
106
|
+
}
|
|
107
|
+
if (o || r > 1) return a;
|
|
108
|
+
throw y = !0, n;
|
|
109
|
+
}
|
|
110
|
+
return function (o, p, l) {
|
|
111
|
+
if (f > 1) throw TypeError("Generator is already running");
|
|
112
|
+
for (y && 1 === p && d(p, l), c = p, u = l; (t = c < 2 ? e : u) || !y;) {
|
|
113
|
+
i || (c ? c < 3 ? (c > 1 && (G.n = -1), d(c, u)) : G.n = u : G.v = u);
|
|
114
|
+
try {
|
|
115
|
+
if (f = 2, i) {
|
|
116
|
+
if (c || (o = "next"), t = i[o]) {
|
|
117
|
+
if (!(t = t.call(i, u))) throw TypeError("iterator result is not an object");
|
|
118
|
+
if (!t.done) return t;
|
|
119
|
+
u = t.value, c < 2 && (c = 0);
|
|
120
|
+
} else 1 === c && (t = i.return) && t.call(i), c < 2 && (u = TypeError("The iterator does not provide a '" + o + "' method"), c = 1);
|
|
121
|
+
i = e;
|
|
122
|
+
} else if ((t = (y = G.n < 0) ? u : r.call(n, G)) !== a) break;
|
|
123
|
+
} catch (t) {
|
|
124
|
+
i = e, c = 1, u = t;
|
|
125
|
+
} finally {
|
|
126
|
+
f = 1;
|
|
127
|
+
}
|
|
128
|
+
}
|
|
129
|
+
return {
|
|
130
|
+
value: t,
|
|
131
|
+
done: y
|
|
132
|
+
};
|
|
116
133
|
};
|
|
117
|
-
}
|
|
134
|
+
}(r, o, i), !0), u;
|
|
118
135
|
}
|
|
119
|
-
|
|
120
|
-
var h = "suspendedStart",
|
|
121
|
-
l = "suspendedYield",
|
|
122
|
-
f = "executing",
|
|
123
|
-
s = "completed",
|
|
124
|
-
y = {};
|
|
136
|
+
var a = {};
|
|
125
137
|
function Generator() {}
|
|
126
138
|
function GeneratorFunction() {}
|
|
127
139
|
function GeneratorFunctionPrototype() {}
|
|
128
|
-
|
|
129
|
-
|
|
140
|
+
t = Object.getPrototypeOf;
|
|
141
|
+
var c = [][n] ? t(t([][n]())) : (_regeneratorDefine(t = {}, n, function () {
|
|
142
|
+
return this;
|
|
143
|
+
}), t),
|
|
144
|
+
u = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(c);
|
|
145
|
+
function f(e) {
|
|
146
|
+
return Object.setPrototypeOf ? Object.setPrototypeOf(e, GeneratorFunctionPrototype) : (e.__proto__ = GeneratorFunctionPrototype, _regeneratorDefine(e, o, "GeneratorFunction")), e.prototype = Object.create(u), e;
|
|
147
|
+
}
|
|
148
|
+
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
149
|
return this;
|
|
150
|
+
}), _regeneratorDefine(u, "toString", function () {
|
|
151
|
+
return "[object Generator]";
|
|
152
|
+
}), (_regenerator = function () {
|
|
153
|
+
return {
|
|
154
|
+
w: i,
|
|
155
|
+
m: f
|
|
156
|
+
};
|
|
157
|
+
})();
|
|
158
|
+
}
|
|
159
|
+
function _regeneratorAsync(n, e, r, t, o) {
|
|
160
|
+
var a = _regeneratorAsyncGen(n, e, r, t, o);
|
|
161
|
+
return a.next().then(function (n) {
|
|
162
|
+
return n.done ? n.value : a.next();
|
|
131
163
|
});
|
|
132
|
-
|
|
133
|
-
|
|
134
|
-
|
|
135
|
-
|
|
136
|
-
|
|
137
|
-
|
|
138
|
-
|
|
139
|
-
|
|
164
|
+
}
|
|
165
|
+
function _regeneratorAsyncGen(r, e, t, o, n) {
|
|
166
|
+
return new _regeneratorAsyncIterator(_regenerator().w(r, e, t, o), n || Promise);
|
|
167
|
+
}
|
|
168
|
+
function _regeneratorAsyncIterator(t, e) {
|
|
169
|
+
function n(r, o, i, f) {
|
|
170
|
+
try {
|
|
171
|
+
var c = t[r](o),
|
|
172
|
+
u = c.value;
|
|
173
|
+
return u instanceof _OverloadYield ? e.resolve(u.v).then(function (t) {
|
|
174
|
+
n("next", t, i, f);
|
|
175
|
+
}, function (t) {
|
|
176
|
+
n("throw", t, i, f);
|
|
177
|
+
}) : e.resolve(u).then(function (t) {
|
|
178
|
+
c.value = t, i(c);
|
|
179
|
+
}, function (t) {
|
|
180
|
+
return n("throw", t, i, f);
|
|
140
181
|
});
|
|
141
|
-
})
|
|
182
|
+
} catch (t) {
|
|
183
|
+
f(t);
|
|
184
|
+
}
|
|
142
185
|
}
|
|
143
|
-
|
|
144
|
-
|
|
145
|
-
|
|
146
|
-
|
|
147
|
-
|
|
148
|
-
|
|
149
|
-
|
|
150
|
-
|
|
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);
|
|
186
|
+
var r;
|
|
187
|
+
this.next || (_regeneratorDefine(_regeneratorAsyncIterator.prototype), _regeneratorDefine(_regeneratorAsyncIterator.prototype, "function" == typeof Symbol && Symbol.asyncIterator || "@asyncIterator", function () {
|
|
188
|
+
return this;
|
|
189
|
+
})), _regeneratorDefine(this, "_invoke", function (t, o, i) {
|
|
190
|
+
function f() {
|
|
191
|
+
return new e(function (e, r) {
|
|
192
|
+
n(t, i, e, r);
|
|
193
|
+
});
|
|
160
194
|
}
|
|
161
|
-
|
|
162
|
-
|
|
163
|
-
|
|
164
|
-
|
|
165
|
-
|
|
166
|
-
|
|
167
|
-
|
|
168
|
-
|
|
169
|
-
|
|
170
|
-
}
|
|
171
|
-
});
|
|
195
|
+
return r = r ? r.then(f, f) : f();
|
|
196
|
+
}, !0);
|
|
197
|
+
}
|
|
198
|
+
function _regeneratorDefine(e, r, n, t) {
|
|
199
|
+
var i = Object.defineProperty;
|
|
200
|
+
try {
|
|
201
|
+
i({}, "", {});
|
|
202
|
+
} catch (e) {
|
|
203
|
+
i = 0;
|
|
172
204
|
}
|
|
173
|
-
function
|
|
174
|
-
|
|
175
|
-
|
|
176
|
-
|
|
177
|
-
|
|
178
|
-
|
|
179
|
-
|
|
180
|
-
|
|
181
|
-
|
|
205
|
+
_regeneratorDefine = function (e, r, n, t) {
|
|
206
|
+
function o(r, n) {
|
|
207
|
+
_regeneratorDefine(e, r, function (e) {
|
|
208
|
+
return this._invoke(r, n, e);
|
|
209
|
+
});
|
|
210
|
+
}
|
|
211
|
+
r ? i ? i(e, r, {
|
|
212
|
+
value: n,
|
|
213
|
+
enumerable: !t,
|
|
214
|
+
configurable: !t,
|
|
215
|
+
writable: !t
|
|
216
|
+
}) : e[r] = n : (o("next", 0), o("throw", 1), o("return", 2));
|
|
217
|
+
}, _regeneratorDefine(e, r, n, t);
|
|
218
|
+
}
|
|
219
|
+
function _regeneratorKeys(e) {
|
|
220
|
+
var n = Object(e),
|
|
221
|
+
r = [];
|
|
222
|
+
for (var t in n) r.unshift(t);
|
|
223
|
+
return function e() {
|
|
224
|
+
for (; r.length;) if ((t = r.pop()) in n) return e.value = t, e.done = !1, e;
|
|
225
|
+
return e.done = !0, e;
|
|
226
|
+
};
|
|
227
|
+
}
|
|
228
|
+
function _regeneratorValues(e) {
|
|
229
|
+
if (null != e) {
|
|
230
|
+
var t = e["function" == typeof Symbol && Symbol.iterator || "@@iterator"],
|
|
231
|
+
r = 0;
|
|
232
|
+
if (t) return t.call(e);
|
|
233
|
+
if ("function" == typeof e.next) return e;
|
|
234
|
+
if (!isNaN(e.length)) return {
|
|
235
|
+
next: function () {
|
|
236
|
+
return e && r >= e.length && (e = void 0), {
|
|
237
|
+
value: e && e[r++],
|
|
238
|
+
done: !e
|
|
182
239
|
};
|
|
183
240
|
}
|
|
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
241
|
};
|
|
209
242
|
}
|
|
210
|
-
|
|
211
|
-
|
|
212
|
-
|
|
213
|
-
|
|
214
|
-
|
|
215
|
-
|
|
216
|
-
|
|
217
|
-
|
|
218
|
-
|
|
219
|
-
|
|
220
|
-
|
|
221
|
-
|
|
222
|
-
|
|
223
|
-
1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e);
|
|
224
|
-
}
|
|
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);
|
|
243
|
+
throw new TypeError(typeof e + " is not iterable");
|
|
244
|
+
}
|
|
245
|
+
function _taggedTemplateLiteralLoose(e, t) {
|
|
246
|
+
return t || (t = e.slice(0)), e.raw = t, e;
|
|
247
|
+
}
|
|
248
|
+
function _regeneratorRuntime() {
|
|
249
|
+
|
|
250
|
+
var r = _regenerator(),
|
|
251
|
+
e = r.m(_regeneratorRuntime),
|
|
252
|
+
t = (Object.getPrototypeOf ? Object.getPrototypeOf(e) : e.__proto__).constructor;
|
|
253
|
+
function n(r) {
|
|
254
|
+
var e = "function" == typeof r && r.constructor;
|
|
255
|
+
return !!e && (e === t || "GeneratorFunction" === (e.displayName || e.name));
|
|
233
256
|
}
|
|
234
|
-
|
|
235
|
-
|
|
236
|
-
|
|
237
|
-
|
|
238
|
-
|
|
239
|
-
|
|
240
|
-
|
|
241
|
-
|
|
242
|
-
|
|
243
|
-
|
|
244
|
-
|
|
245
|
-
|
|
257
|
+
var o = {
|
|
258
|
+
throw: 1,
|
|
259
|
+
return: 2,
|
|
260
|
+
break: 3,
|
|
261
|
+
continue: 3
|
|
262
|
+
};
|
|
263
|
+
function a(r) {
|
|
264
|
+
var e, t;
|
|
265
|
+
return function (n) {
|
|
266
|
+
e || (e = {
|
|
267
|
+
stop: function () {
|
|
268
|
+
return t(n.a, 2);
|
|
269
|
+
},
|
|
270
|
+
catch: function () {
|
|
271
|
+
return n.v;
|
|
272
|
+
},
|
|
273
|
+
abrupt: function (r, e) {
|
|
274
|
+
return t(n.a, o[r], e);
|
|
275
|
+
},
|
|
276
|
+
delegateYield: function (r, o, a) {
|
|
277
|
+
return e.resultName = o, t(n.d, _regeneratorValues(r), a);
|
|
278
|
+
},
|
|
279
|
+
finish: function (r) {
|
|
280
|
+
return t(n.f, r);
|
|
281
|
+
}
|
|
282
|
+
}, t = function (r, t, o) {
|
|
283
|
+
n.p = e.prev, n.n = e.next;
|
|
284
|
+
try {
|
|
285
|
+
return r(t, o);
|
|
286
|
+
} finally {
|
|
287
|
+
e.next = n.n;
|
|
288
|
+
}
|
|
289
|
+
}), e.resultName && (e[e.resultName] = n.v, e.resultName = void 0), e.sent = n.v, e.next = n.n;
|
|
290
|
+
try {
|
|
291
|
+
return r.call(this, e);
|
|
292
|
+
} finally {
|
|
293
|
+
n.p = e.prev, n.n = e.next;
|
|
246
294
|
}
|
|
247
|
-
}
|
|
248
|
-
throw new TypeError(typeof e + " is not iterable");
|
|
295
|
+
};
|
|
249
296
|
}
|
|
250
|
-
return
|
|
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) {
|
|
297
|
+
return (_regeneratorRuntime = function () {
|
|
262
298
|
return {
|
|
263
|
-
|
|
264
|
-
|
|
265
|
-
|
|
266
|
-
|
|
267
|
-
|
|
268
|
-
|
|
269
|
-
|
|
270
|
-
|
|
271
|
-
|
|
272
|
-
|
|
273
|
-
|
|
274
|
-
|
|
275
|
-
|
|
276
|
-
|
|
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;
|
|
299
|
+
wrap: function (e, t, n, o) {
|
|
300
|
+
return r.w(a(e), t, n, o && o.reverse());
|
|
301
|
+
},
|
|
302
|
+
isGeneratorFunction: n,
|
|
303
|
+
mark: r.m,
|
|
304
|
+
awrap: function (r, e) {
|
|
305
|
+
return new _OverloadYield(r, e);
|
|
306
|
+
},
|
|
307
|
+
AsyncIterator: _regeneratorAsyncIterator,
|
|
308
|
+
async: function (r, e, t, o, u) {
|
|
309
|
+
return (n(e) ? _regeneratorAsyncGen : _regeneratorAsync)(a(r), e, t, o, u);
|
|
310
|
+
},
|
|
311
|
+
keys: _regeneratorKeys,
|
|
312
|
+
values: _regeneratorValues
|
|
287
313
|
};
|
|
288
|
-
}
|
|
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;
|
|
314
|
+
})();
|
|
371
315
|
}
|
|
372
316
|
|
|
373
317
|
var STRAPI_URI = process.env.NEXT_PUBLIC_STRAPI_URI || 'http://127.0.0.1:1337';
|
|
@@ -5597,7 +5541,7 @@ var ProjectInfo = function ProjectInfo(_ref) {
|
|
|
5597
5541
|
columns: [1, null, null, 2],
|
|
5598
5542
|
spacingX: "10",
|
|
5599
5543
|
spacingY: "8"
|
|
5600
|
-
}, project.averageSellableAmountPerYear
|
|
5544
|
+
}, project.averageSellableAmountPerYear > 0 ? React.createElement(Tooltip, {
|
|
5601
5545
|
label: formatMessage({
|
|
5602
5546
|
id: 'features.projectInfo.properties.projectVolume.toolTip'
|
|
5603
5547
|
})
|
|
@@ -5613,17 +5557,19 @@ var ProjectInfo = function ProjectInfo(_ref) {
|
|
|
5613
5557
|
})
|
|
5614
5558
|
}),
|
|
5615
5559
|
caption: subtitles.averageSellableAmountPerYearSubtitle
|
|
5616
|
-
})))
|
|
5560
|
+
}))) : React.createElement(Box, null, React.createElement(CreditsAvailableBadge, {
|
|
5561
|
+
status: project.creditAvailability
|
|
5562
|
+
})), project.riskBuffer && React.createElement(Box, null, React.createElement(LabelTextPair, {
|
|
5617
5563
|
label: formatMessage({
|
|
5618
5564
|
id: 'features.projectInfo.properties.riskBuffer'
|
|
5619
5565
|
}),
|
|
5620
5566
|
text: formatNumber(project.riskBuffer / 100, FORMAT_AS_PERCENT_CONFIG),
|
|
5621
5567
|
caption: subtitles.riskBufferSubtitle
|
|
5622
|
-
}))), React.createElement(Box, {
|
|
5568
|
+
}))), project.averageSellableAmountPerYear > 0 ? React.createElement(Box, {
|
|
5623
5569
|
mt: "2"
|
|
5624
5570
|
}, React.createElement(CreditsAvailableBadge, {
|
|
5625
5571
|
status: project.creditAvailability
|
|
5626
|
-
})));
|
|
5572
|
+
})) : React.createElement(React.Fragment, null));
|
|
5627
5573
|
};
|
|
5628
5574
|
|
|
5629
5575
|
var DocumentsDownloadList = function DocumentsDownloadList(_ref) {
|
|
@@ -7206,6 +7152,15 @@ var Events = function Events(_ref) {
|
|
|
7206
7152
|
}))))));
|
|
7207
7153
|
};
|
|
7208
7154
|
|
|
7155
|
+
var Redirect = function Redirect(_ref) {
|
|
7156
|
+
var slice = _ref.slice;
|
|
7157
|
+
useEffect(function () {
|
|
7158
|
+
// When using `replace`, the current browser history entry will be replaced
|
|
7159
|
+
redirect(slice.url, RedirectType.replace);
|
|
7160
|
+
}, [slice.url]);
|
|
7161
|
+
return React.createElement(React.Fragment, null);
|
|
7162
|
+
};
|
|
7163
|
+
|
|
7209
7164
|
var SliceRenderer = function SliceRenderer(_ref) {
|
|
7210
7165
|
var slices = _ref.slices,
|
|
7211
7166
|
blogPosts = _ref.blogPosts,
|
|
@@ -7426,6 +7381,11 @@ var SliceRenderer = function SliceRenderer(_ref) {
|
|
|
7426
7381
|
key: slice.__component + "-" + slice.id,
|
|
7427
7382
|
slice: slice
|
|
7428
7383
|
});
|
|
7384
|
+
case 'sections.redirect':
|
|
7385
|
+
return React.createElement(Redirect, {
|
|
7386
|
+
key: slice.__component + "-" + slice.id,
|
|
7387
|
+
slice: slice
|
|
7388
|
+
});
|
|
7429
7389
|
default:
|
|
7430
7390
|
if (CustomSlice) {
|
|
7431
7391
|
return React.createElement(CustomSlice, {
|