@carbon/themes 11.54.0 → 11.55.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/es/index.js +230 -252
- package/lib/index.js +230 -252
- package/package.json +6 -6
- package/src/tokens/Token.js +2 -1
- package/umd/index.js +230 -252
package/umd/index.js
CHANGED
|
@@ -8,6 +8,9 @@
|
|
|
8
8
|
|
|
9
9
|
var Color__default = /*#__PURE__*/_interopDefaultLegacy(Color);
|
|
10
10
|
|
|
11
|
+
function _OverloadYield(e, d) {
|
|
12
|
+
this.v = e, this.k = d;
|
|
13
|
+
}
|
|
11
14
|
function _arrayLikeToArray(r, a) {
|
|
12
15
|
(null == a || a > r.length) && (a = r.length);
|
|
13
16
|
for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e];
|
|
@@ -113,274 +116,180 @@
|
|
|
113
116
|
}
|
|
114
117
|
return e;
|
|
115
118
|
}
|
|
116
|
-
function
|
|
117
|
-
|
|
118
|
-
|
|
119
|
-
|
|
120
|
-
|
|
121
|
-
|
|
122
|
-
|
|
123
|
-
|
|
124
|
-
|
|
125
|
-
|
|
126
|
-
|
|
127
|
-
|
|
128
|
-
|
|
129
|
-
|
|
130
|
-
|
|
131
|
-
|
|
132
|
-
|
|
133
|
-
|
|
134
|
-
|
|
135
|
-
|
|
136
|
-
|
|
137
|
-
|
|
138
|
-
|
|
139
|
-
|
|
140
|
-
|
|
141
|
-
};
|
|
142
|
-
}
|
|
143
|
-
function h(r, e, n, o) {
|
|
144
|
-
var i = e && e.prototype instanceof Generator ? e : Generator,
|
|
145
|
-
a = Object.create(i.prototype);
|
|
146
|
-
return c(a, "_invoke", function (r, e, n) {
|
|
147
|
-
var o = 1;
|
|
148
|
-
return function (i, a) {
|
|
149
|
-
if (3 === o) throw Error("Generator is already running");
|
|
150
|
-
if (4 === o) {
|
|
151
|
-
if ("throw" === i) throw a;
|
|
152
|
-
return {
|
|
153
|
-
value: t,
|
|
154
|
-
done: !0
|
|
155
|
-
};
|
|
156
|
-
}
|
|
157
|
-
for (n.method = i, n.arg = a;;) {
|
|
158
|
-
var u = n.delegate;
|
|
159
|
-
if (u) {
|
|
160
|
-
var c = d(u, n);
|
|
161
|
-
if (c) {
|
|
162
|
-
if (c === f) continue;
|
|
163
|
-
return c;
|
|
164
|
-
}
|
|
119
|
+
function _regenerator() {
|
|
120
|
+
/*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/babel/babel/blob/main/packages/babel-helpers/LICENSE */
|
|
121
|
+
var e,
|
|
122
|
+
t,
|
|
123
|
+
r = "function" == typeof Symbol ? Symbol : {},
|
|
124
|
+
n = r.iterator || "@@iterator",
|
|
125
|
+
o = r.toStringTag || "@@toStringTag";
|
|
126
|
+
function i(r, n, o, i) {
|
|
127
|
+
var c = n && n.prototype instanceof Generator ? n : Generator,
|
|
128
|
+
u = Object.create(c.prototype);
|
|
129
|
+
return _regeneratorDefine(u, "_invoke", function (r, n, o) {
|
|
130
|
+
var i,
|
|
131
|
+
c,
|
|
132
|
+
u,
|
|
133
|
+
f = 0,
|
|
134
|
+
p = o || [],
|
|
135
|
+
y = !1,
|
|
136
|
+
G = {
|
|
137
|
+
p: 0,
|
|
138
|
+
n: 0,
|
|
139
|
+
v: e,
|
|
140
|
+
a: d,
|
|
141
|
+
f: d.bind(e, 4),
|
|
142
|
+
d: function (t, r) {
|
|
143
|
+
return i = t, c = 0, u = e, G.n = r, a;
|
|
165
144
|
}
|
|
166
|
-
|
|
167
|
-
|
|
168
|
-
|
|
169
|
-
|
|
170
|
-
|
|
171
|
-
|
|
172
|
-
|
|
173
|
-
|
|
174
|
-
|
|
175
|
-
|
|
176
|
-
|
|
177
|
-
|
|
145
|
+
};
|
|
146
|
+
function d(r, n) {
|
|
147
|
+
for (c = r, u = n, t = 0; !y && f && !o && t < p.length; t++) {
|
|
148
|
+
var o,
|
|
149
|
+
i = p[t],
|
|
150
|
+
d = G.p,
|
|
151
|
+
l = i[2];
|
|
152
|
+
r > 3 ? (o = l === n) && (c = i[4] || 3, u = i[5] === e ? i[3] : i[5], i[4] = 3, 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));
|
|
153
|
+
}
|
|
154
|
+
if (o || r > 1) return a;
|
|
155
|
+
throw y = !0, n;
|
|
156
|
+
}
|
|
157
|
+
return function (o, p, l) {
|
|
158
|
+
if (f > 1) throw TypeError("Generator is already running");
|
|
159
|
+
for (y && 1 === p && d(p, l), c = p, u = l; (t = c < 2 ? e : u) || !y;) {
|
|
160
|
+
i || (c ? c < 3 ? (c > 1 && (G.n = -1), d(c, u)) : G.n = u : G.v = u);
|
|
161
|
+
try {
|
|
162
|
+
if (f = 2, i) {
|
|
163
|
+
if (c || (o = "next"), t = i[o]) {
|
|
164
|
+
if (!(t = t.call(i, u))) throw TypeError("iterator result is not an object");
|
|
165
|
+
if (!t.done) return t;
|
|
166
|
+
u = t.value, c < 2 && (c = 0);
|
|
167
|
+
} else 1 === c && (t = i.return) && t.call(i), c < 2 && (u = TypeError("The iterator does not provide a '" + o + "' method"), c = 1);
|
|
168
|
+
i = e;
|
|
169
|
+
} else if ((t = (y = G.n < 0) ? u : r.call(n, G)) !== a) break;
|
|
170
|
+
} catch (t) {
|
|
171
|
+
i = e, c = 1, u = t;
|
|
172
|
+
} finally {
|
|
173
|
+
f = 1;
|
|
178
174
|
}
|
|
179
|
-
"throw" === h.type && (o = 4, n.method = "throw", n.arg = h.arg);
|
|
180
175
|
}
|
|
176
|
+
return {
|
|
177
|
+
value: t,
|
|
178
|
+
done: y
|
|
179
|
+
};
|
|
181
180
|
};
|
|
182
|
-
}(r,
|
|
183
|
-
}
|
|
184
|
-
function s(t, r, e) {
|
|
185
|
-
try {
|
|
186
|
-
return {
|
|
187
|
-
type: "normal",
|
|
188
|
-
arg: t.call(r, e)
|
|
189
|
-
};
|
|
190
|
-
} catch (t) {
|
|
191
|
-
return {
|
|
192
|
-
type: "throw",
|
|
193
|
-
arg: t
|
|
194
|
-
};
|
|
195
|
-
}
|
|
181
|
+
}(r, o, i), !0), u;
|
|
196
182
|
}
|
|
197
|
-
|
|
198
|
-
var f = {};
|
|
183
|
+
var a = {};
|
|
199
184
|
function Generator() {}
|
|
200
185
|
function GeneratorFunction() {}
|
|
201
186
|
function GeneratorFunctionPrototype() {}
|
|
202
|
-
|
|
203
|
-
c(
|
|
187
|
+
t = Object.getPrototypeOf;
|
|
188
|
+
var c = [][n] ? t(t([][n]())) : (_regeneratorDefine(t = {}, n, function () {
|
|
189
|
+
return this;
|
|
190
|
+
}), t),
|
|
191
|
+
u = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(c);
|
|
192
|
+
function f(e) {
|
|
193
|
+
return Object.setPrototypeOf ? Object.setPrototypeOf(e, GeneratorFunctionPrototype) : (e.__proto__ = GeneratorFunctionPrototype, _regeneratorDefine(e, o, "GeneratorFunction")), e.prototype = Object.create(u), e;
|
|
194
|
+
}
|
|
195
|
+
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 () {
|
|
204
196
|
return this;
|
|
197
|
+
}), _regeneratorDefine(u, "toString", function () {
|
|
198
|
+
return "[object Generator]";
|
|
199
|
+
}), (_regenerator = function () {
|
|
200
|
+
return {
|
|
201
|
+
w: i,
|
|
202
|
+
m: f
|
|
203
|
+
};
|
|
204
|
+
})();
|
|
205
|
+
}
|
|
206
|
+
function _regeneratorAsync(n, e, r, t, o) {
|
|
207
|
+
var a = _regeneratorAsyncGen(n, e, r, t, o);
|
|
208
|
+
return a.next().then(function (n) {
|
|
209
|
+
return n.done ? n.value : a.next();
|
|
205
210
|
});
|
|
206
|
-
|
|
207
|
-
|
|
208
|
-
|
|
209
|
-
|
|
210
|
-
|
|
211
|
-
|
|
212
|
-
|
|
213
|
-
|
|
211
|
+
}
|
|
212
|
+
function _regeneratorAsyncGen(r, e, t, o, n) {
|
|
213
|
+
return new _regeneratorAsyncIterator(_regenerator().w(r, e, t, o), n || Promise);
|
|
214
|
+
}
|
|
215
|
+
function _regeneratorAsyncIterator(t, e) {
|
|
216
|
+
function n(r, o, i, f) {
|
|
217
|
+
try {
|
|
218
|
+
var c = t[r](o),
|
|
219
|
+
u = c.value;
|
|
220
|
+
return u instanceof _OverloadYield ? e.resolve(u.v).then(function (t) {
|
|
221
|
+
n("next", t, i, f);
|
|
222
|
+
}, function (t) {
|
|
223
|
+
n("throw", t, i, f);
|
|
224
|
+
}) : e.resolve(u).then(function (t) {
|
|
225
|
+
c.value = t, i(c);
|
|
226
|
+
}, function (t) {
|
|
227
|
+
return n("throw", t, i, f);
|
|
214
228
|
});
|
|
215
|
-
})
|
|
216
|
-
|
|
217
|
-
function AsyncIterator(t, r) {
|
|
218
|
-
function e(o, i, a, u) {
|
|
219
|
-
var c = s(t[o], t, i);
|
|
220
|
-
if ("throw" !== c.type) {
|
|
221
|
-
var h = c.arg,
|
|
222
|
-
f = h.value;
|
|
223
|
-
return f && "object" == typeof f && n.call(f, "__await") ? r.resolve(f.__await).then(function (t) {
|
|
224
|
-
e("next", t, a, u);
|
|
225
|
-
}, function (t) {
|
|
226
|
-
e("throw", t, a, u);
|
|
227
|
-
}) : r.resolve(f).then(function (t) {
|
|
228
|
-
h.value = t, a(h);
|
|
229
|
-
}, function (t) {
|
|
230
|
-
return e("throw", t, a, u);
|
|
231
|
-
});
|
|
232
|
-
}
|
|
233
|
-
u(c.arg);
|
|
229
|
+
} catch (t) {
|
|
230
|
+
f(t);
|
|
234
231
|
}
|
|
235
|
-
var o;
|
|
236
|
-
c(this, "_invoke", function (t, n) {
|
|
237
|
-
function i() {
|
|
238
|
-
return new r(function (r, o) {
|
|
239
|
-
e(t, n, r, o);
|
|
240
|
-
});
|
|
241
|
-
}
|
|
242
|
-
return o = o ? o.then(i, i) : i();
|
|
243
|
-
}, !0);
|
|
244
|
-
}
|
|
245
|
-
function d(r, e) {
|
|
246
|
-
var n = e.method,
|
|
247
|
-
o = r.i[n];
|
|
248
|
-
if (o === t) return e.delegate = null, "throw" === n && r.i.return && (e.method = "return", e.arg = t, d(r, e), "throw" === e.method) || "return" !== n && (e.method = "throw", e.arg = new TypeError("The iterator does not provide a '" + n + "' method")), f;
|
|
249
|
-
var i = s(o, r.i, e.arg);
|
|
250
|
-
if ("throw" === i.type) return e.method = "throw", e.arg = i.arg, e.delegate = null, f;
|
|
251
|
-
var a = i.arg;
|
|
252
|
-
return a ? a.done ? (e[r.r] = a.value, e.next = r.n, "return" !== e.method && (e.method = "next", e.arg = t), e.delegate = null, f) : a : (e.method = "throw", e.arg = new TypeError("iterator result is not an object"), e.delegate = null, f);
|
|
253
|
-
}
|
|
254
|
-
function w(t) {
|
|
255
|
-
this.tryEntries.push(t);
|
|
256
|
-
}
|
|
257
|
-
function m(r) {
|
|
258
|
-
var e = r[4] || {};
|
|
259
|
-
e.type = "normal", e.arg = t, r[4] = e;
|
|
260
|
-
}
|
|
261
|
-
function Context(t) {
|
|
262
|
-
this.tryEntries = [[-1]], t.forEach(w, this), this.reset(!0);
|
|
263
232
|
}
|
|
264
|
-
|
|
265
|
-
|
|
266
|
-
|
|
267
|
-
|
|
268
|
-
|
|
269
|
-
|
|
270
|
-
|
|
271
|
-
|
|
272
|
-
for (; ++o < r.length;) if (n.call(r, o)) return e.value = r[o], e.done = !1, e;
|
|
273
|
-
return e.value = t, e.done = !0, e;
|
|
274
|
-
};
|
|
275
|
-
return a.next = a;
|
|
276
|
-
}
|
|
233
|
+
var r;
|
|
234
|
+
this.next || (_regeneratorDefine(_regeneratorAsyncIterator.prototype), _regeneratorDefine(_regeneratorAsyncIterator.prototype, "function" == typeof Symbol && Symbol.asyncIterator || "@asyncIterator", function () {
|
|
235
|
+
return this;
|
|
236
|
+
})), _regeneratorDefine(this, "_invoke", function (t, o, i) {
|
|
237
|
+
function f() {
|
|
238
|
+
return new e(function (e, r) {
|
|
239
|
+
n(t, i, e, r);
|
|
240
|
+
});
|
|
277
241
|
}
|
|
278
|
-
|
|
242
|
+
return r = r ? r.then(f, f) : f();
|
|
243
|
+
}, !0);
|
|
244
|
+
}
|
|
245
|
+
function _regeneratorDefine(e, r, n, t) {
|
|
246
|
+
var i = Object.defineProperty;
|
|
247
|
+
try {
|
|
248
|
+
i({}, "", {});
|
|
249
|
+
} catch (e) {
|
|
250
|
+
i = 0;
|
|
279
251
|
}
|
|
280
|
-
|
|
281
|
-
|
|
282
|
-
|
|
283
|
-
|
|
284
|
-
|
|
285
|
-
|
|
286
|
-
|
|
287
|
-
|
|
288
|
-
|
|
289
|
-
|
|
290
|
-
|
|
291
|
-
}), r.AsyncIterator = AsyncIterator, r.async = function (t, e, n, o, i) {
|
|
292
|
-
void 0 === i && (i = Promise);
|
|
293
|
-
var a = new AsyncIterator(h(t, e, n, o), i);
|
|
294
|
-
return r.isGeneratorFunction(e) ? a : a.next().then(function (t) {
|
|
295
|
-
return t.done ? t.value : a.next();
|
|
296
|
-
});
|
|
297
|
-
}, g(v), c(v, u, "Generator"), c(v, i, function () {
|
|
298
|
-
return this;
|
|
299
|
-
}), c(v, "toString", function () {
|
|
300
|
-
return "[object Generator]";
|
|
301
|
-
}), r.keys = function (t) {
|
|
302
|
-
var r = Object(t),
|
|
303
|
-
e = [];
|
|
304
|
-
for (var n in r) e.unshift(n);
|
|
305
|
-
return function t() {
|
|
306
|
-
for (; e.length;) if ((n = e.pop()) in r) return t.value = n, t.done = !1, t;
|
|
307
|
-
return t.done = !0, t;
|
|
308
|
-
};
|
|
309
|
-
}, r.values = x, Context.prototype = {
|
|
310
|
-
constructor: Context,
|
|
311
|
-
reset: function (r) {
|
|
312
|
-
if (this.prev = this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(m), !r) for (var e in this) "t" === e.charAt(0) && n.call(this, e) && !isNaN(+e.slice(1)) && (this[e] = t);
|
|
313
|
-
},
|
|
314
|
-
stop: function () {
|
|
315
|
-
this.done = !0;
|
|
316
|
-
var t = this.tryEntries[0][4];
|
|
317
|
-
if ("throw" === t.type) throw t.arg;
|
|
318
|
-
return this.rval;
|
|
319
|
-
},
|
|
320
|
-
dispatchException: function (r) {
|
|
321
|
-
if (this.done) throw r;
|
|
322
|
-
var e = this;
|
|
323
|
-
function n(t) {
|
|
324
|
-
a.type = "throw", a.arg = r, e.next = t;
|
|
325
|
-
}
|
|
326
|
-
for (var o = e.tryEntries.length - 1; o >= 0; --o) {
|
|
327
|
-
var i = this.tryEntries[o],
|
|
328
|
-
a = i[4],
|
|
329
|
-
u = this.prev,
|
|
330
|
-
c = i[1],
|
|
331
|
-
h = i[2];
|
|
332
|
-
if (-1 === i[0]) return n("end"), !1;
|
|
333
|
-
if (!c && !h) throw Error("try statement without catch or finally");
|
|
334
|
-
if (null != i[0] && i[0] <= u) {
|
|
335
|
-
if (u < c) return this.method = "next", this.arg = t, n(c), !0;
|
|
336
|
-
if (u < h) return n(h), !1;
|
|
337
|
-
}
|
|
338
|
-
}
|
|
339
|
-
},
|
|
340
|
-
abrupt: function (t, r) {
|
|
341
|
-
for (var e = this.tryEntries.length - 1; e >= 0; --e) {
|
|
342
|
-
var n = this.tryEntries[e];
|
|
343
|
-
if (n[0] > -1 && n[0] <= this.prev && this.prev < n[2]) {
|
|
344
|
-
var o = n;
|
|
345
|
-
break;
|
|
346
|
-
}
|
|
347
|
-
}
|
|
348
|
-
o && ("break" === t || "continue" === t) && o[0] <= r && r <= o[2] && (o = null);
|
|
349
|
-
var i = o ? o[4] : {};
|
|
350
|
-
return i.type = t, i.arg = r, o ? (this.method = "next", this.next = o[2], f) : this.complete(i);
|
|
351
|
-
},
|
|
352
|
-
complete: function (t, r) {
|
|
353
|
-
if ("throw" === t.type) throw t.arg;
|
|
354
|
-
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 && r && (this.next = r), f;
|
|
355
|
-
},
|
|
356
|
-
finish: function (t) {
|
|
357
|
-
for (var r = this.tryEntries.length - 1; r >= 0; --r) {
|
|
358
|
-
var e = this.tryEntries[r];
|
|
359
|
-
if (e[2] === t) return this.complete(e[4], e[3]), m(e), f;
|
|
360
|
-
}
|
|
361
|
-
},
|
|
362
|
-
catch: function (t) {
|
|
363
|
-
for (var r = this.tryEntries.length - 1; r >= 0; --r) {
|
|
364
|
-
var e = this.tryEntries[r];
|
|
365
|
-
if (e[0] === t) {
|
|
366
|
-
var n = e[4];
|
|
367
|
-
if ("throw" === n.type) {
|
|
368
|
-
var o = n.arg;
|
|
369
|
-
m(e);
|
|
370
|
-
}
|
|
371
|
-
return o;
|
|
372
|
-
}
|
|
252
|
+
_regeneratorDefine = function (e, r, n, t) {
|
|
253
|
+
if (r) i ? i(e, r, {
|
|
254
|
+
value: n,
|
|
255
|
+
enumerable: !t,
|
|
256
|
+
configurable: !t,
|
|
257
|
+
writable: !t
|
|
258
|
+
}) : e[r] = n;else {
|
|
259
|
+
function o(r, n) {
|
|
260
|
+
_regeneratorDefine(e, r, function (e) {
|
|
261
|
+
return this._invoke(r, n, e);
|
|
262
|
+
});
|
|
373
263
|
}
|
|
374
|
-
|
|
375
|
-
},
|
|
376
|
-
delegateYield: function (r, e, n) {
|
|
377
|
-
return this.delegate = {
|
|
378
|
-
i: x(r),
|
|
379
|
-
r: e,
|
|
380
|
-
n: n
|
|
381
|
-
}, "next" === this.method && (this.arg = t), f;
|
|
264
|
+
o("next", 0), o("throw", 1), o("return", 2);
|
|
382
265
|
}
|
|
383
|
-
}, r;
|
|
266
|
+
}, _regeneratorDefine(e, r, n, t);
|
|
267
|
+
}
|
|
268
|
+
function _regeneratorKeys(e) {
|
|
269
|
+
var n = Object(e),
|
|
270
|
+
r = [];
|
|
271
|
+
for (var t in n) r.unshift(t);
|
|
272
|
+
return function e() {
|
|
273
|
+
for (; r.length;) if ((t = r.pop()) in n) return e.value = t, e.done = !1, e;
|
|
274
|
+
return e.done = !0, e;
|
|
275
|
+
};
|
|
276
|
+
}
|
|
277
|
+
function _regeneratorValues(e) {
|
|
278
|
+
if (null != e) {
|
|
279
|
+
var t = e["function" == typeof Symbol && Symbol.iterator || "@@iterator"],
|
|
280
|
+
r = 0;
|
|
281
|
+
if (t) return t.call(e);
|
|
282
|
+
if ("function" == typeof e.next) return e;
|
|
283
|
+
if (!isNaN(e.length)) return {
|
|
284
|
+
next: function () {
|
|
285
|
+
return e && r >= e.length && (e = void 0), {
|
|
286
|
+
value: e && e[r++],
|
|
287
|
+
done: !e
|
|
288
|
+
};
|
|
289
|
+
}
|
|
290
|
+
};
|
|
291
|
+
}
|
|
292
|
+
throw new TypeError(typeof e + " is not iterable");
|
|
384
293
|
}
|
|
385
294
|
function _toConsumableArray(r) {
|
|
386
295
|
return _arrayWithoutHoles(r) || _iterableToArray(r) || _unsupportedIterableToArray(r) || _nonIterableSpread();
|
|
@@ -406,6 +315,74 @@
|
|
|
406
315
|
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;
|
|
407
316
|
}
|
|
408
317
|
}
|
|
318
|
+
function _regeneratorRuntime() {
|
|
319
|
+
|
|
320
|
+
var r = _regenerator(),
|
|
321
|
+
e = r.m(_regeneratorRuntime),
|
|
322
|
+
t = (Object.getPrototypeOf ? Object.getPrototypeOf(e) : e.__proto__).constructor;
|
|
323
|
+
function n(r) {
|
|
324
|
+
var e = "function" == typeof r && r.constructor;
|
|
325
|
+
return !!e && (e === t || "GeneratorFunction" === (e.displayName || e.name));
|
|
326
|
+
}
|
|
327
|
+
var o = {
|
|
328
|
+
throw: 1,
|
|
329
|
+
return: 2,
|
|
330
|
+
break: 3,
|
|
331
|
+
continue: 3
|
|
332
|
+
};
|
|
333
|
+
function a(r) {
|
|
334
|
+
var e, t;
|
|
335
|
+
return function (n) {
|
|
336
|
+
e || (e = {
|
|
337
|
+
stop: function () {
|
|
338
|
+
return t(n.a, 2);
|
|
339
|
+
},
|
|
340
|
+
catch: function () {
|
|
341
|
+
return n.v;
|
|
342
|
+
},
|
|
343
|
+
abrupt: function (r, e) {
|
|
344
|
+
return t(n.a, o[r], e);
|
|
345
|
+
},
|
|
346
|
+
delegateYield: function (r, o, a) {
|
|
347
|
+
return e.resultName = o, t(n.d, _regeneratorValues(r), a);
|
|
348
|
+
},
|
|
349
|
+
finish: function (r) {
|
|
350
|
+
return t(n.f, r);
|
|
351
|
+
}
|
|
352
|
+
}, t = function (r, t, o) {
|
|
353
|
+
n.p = e.prev, n.n = e.next;
|
|
354
|
+
try {
|
|
355
|
+
return r(t, o);
|
|
356
|
+
} finally {
|
|
357
|
+
e.next = n.n;
|
|
358
|
+
}
|
|
359
|
+
}), e.resultName && (e[e.resultName] = n.v, e.resultName = void 0), e.sent = n.v, e.next = n.n;
|
|
360
|
+
try {
|
|
361
|
+
return r.call(this, e);
|
|
362
|
+
} finally {
|
|
363
|
+
n.p = e.prev, n.n = e.next;
|
|
364
|
+
}
|
|
365
|
+
};
|
|
366
|
+
}
|
|
367
|
+
return (_regeneratorRuntime = function () {
|
|
368
|
+
return {
|
|
369
|
+
wrap: function (e, t, n, o) {
|
|
370
|
+
return r.w(a(e), t, n, o && o.reverse());
|
|
371
|
+
},
|
|
372
|
+
isGeneratorFunction: n,
|
|
373
|
+
mark: r.m,
|
|
374
|
+
awrap: function (r, e) {
|
|
375
|
+
return new _OverloadYield(r, e);
|
|
376
|
+
},
|
|
377
|
+
AsyncIterator: _regeneratorAsyncIterator,
|
|
378
|
+
async: function (r, e, t, o, u) {
|
|
379
|
+
return (n(e) ? _regeneratorAsyncGen : _regeneratorAsync)(a(r), e, t, o, u);
|
|
380
|
+
},
|
|
381
|
+
keys: _regeneratorKeys,
|
|
382
|
+
values: _regeneratorValues
|
|
383
|
+
};
|
|
384
|
+
})();
|
|
385
|
+
}
|
|
409
386
|
|
|
410
387
|
/**
|
|
411
388
|
* Adjust a given token's lightness by a specified percentage
|
|
@@ -4805,7 +4782,7 @@
|
|
|
4805
4782
|
});
|
|
4806
4783
|
|
|
4807
4784
|
/**
|
|
4808
|
-
* Copyright IBM Corp. 2018,
|
|
4785
|
+
* Copyright IBM Corp. 2018, 2025
|
|
4809
4786
|
*
|
|
4810
4787
|
* This source code is licensed under the Apache-2.0 license found in the
|
|
4811
4788
|
* LICENSE file in the root directory of this source tree.
|
|
@@ -4816,6 +4793,7 @@
|
|
|
4816
4793
|
* that it applies to like border or background, along with a state if the
|
|
4817
4794
|
* token should only be used for specific states like hover or focus.
|
|
4818
4795
|
*/
|
|
4796
|
+
// eslint-disable-next-line @typescript-eslint/no-extraneous-class
|
|
4819
4797
|
var Token = /*#__PURE__*/function () {
|
|
4820
4798
|
function Token(name, properties, state) {
|
|
4821
4799
|
_classCallCheck(this, Token);
|