1;!function(){try { var e="undefined"!=typeof globalThis?globalThis:"undefined"!=typeof global?global:"undefined"!=typeof window?window:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&((e._debugIds|| (e._debugIds={}))[n]="b0465181-0754-5fb3-7f45-4c57f8fdfe36")}catch(e){}}(); 2(globalThis["TURBOPACK"] || (globalThis["TURBOPACK"] = [])).push([typeof document === "object" ? document.currentScript : undefined, 3467034, ((__turbopack_context__, module, exports) => { 4 5(function() { 6 var e = { 7 675: function(e, r) { 8 "use strict"; 9 r.byteLength = byteLength; 10 r.toByteArray = toByteArray; 11 r.fromByteArray = fromByteArray; 12 var t = []; 13 var f = []; 14 var n = typeof Uint8Array !== "undefined" ? Uint8Array : Array; 15 var i = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; 16 for(var o = 0, u = i.length; o < u; ++o){ 17 t[o] = i[o]; 18 f[i.charCodeAt(o)] = o; 19 } 20 f["-".charCodeAt(0)] = 62; 21 f["_".charCodeAt(0)] = 63; 22 function getLens(e) { 23 var r = e.length; 24 if (r % 4 > 0) { 25 throw new Error("Invalid string. Length must be a multiple of 4"); 26 } 27 var t = e.indexOf("="); 28 if (t === -1) t = r; 29 var f = t === r ? 0 : 4 - t % 4; 30 return [ 31 t, 32 f 33 ]; 34 } 35 function byteLength(e) { 36 var r = getLens(e); 37 var t = r[0]; 38 var f = r[1]; 39 return (t + f) * 3 / 4 - f; 40 } 41 function _byteLength(e, r, t) { 42 return (r + t) * 3 / 4 - t; 43 } 44 function toByteArray(e) { 45 var r; 46 var t = getLens(e); 47 var i = t[0]; 48 var o = t[1]; 49 var u = new n(_byteLength(e, i, o)); 50 var a = 0; 51 var s = o > 0 ? i - 4 : i; 52 var h; 53 for(h = 0; h < s; h += 4){ 54 r = f[e.charCodeAt(h)] << 18 | f[e.charCodeAt(h + 1)] << 12 | f[e.charCodeAt(h + 2)] << 6 | f[e.charCodeAt(h + 3)]; 55 u[a++] = r >> 16 & 255; 56 u[a++] = r >> 8 & 255; 57 u[a++] = r & 255; 58 } 59 if (o === 2) { 60 r = f[e.charCodeAt(h)] << 2 | f[e.charCodeAt(h + 1)] >> 4; 61 u[a++] = r & 255; 62 } 63 if (o === 1) { 64 r = f[e.charCodeAt(h)] << 10 | f[e.charCodeAt(h + 1)] << 4 | f[e.charCodeAt(h + 2)] >> 2; 65 u[a++] = r >> 8 & 255; 66 u[a++] = r & 255; 67 } 68 return u; 69 } 70 function tripletToBase64(e) { 71 return t[e >> 18 & 63] + t[e >> 12 & 63] + t[e >> 6 & 63] + t[e & 63]; 72 } 73 function encodeChunk(e, r, t) { 74 var f; 75 var n = []; 76 for(var i = r; i < t; i += 3){ 77 f = (e[i] << 16 & 16711680) + (e[i + 1] << 8 & 65280) + (e[i + 2] & 255); 78 n.push(tripletToBase64(f)); 79 } 80 return n.join(""); 81 } 82 function fromByteArray(e) { 83 var r; 84 var f = e.length; 85 var n = f % 3; 86 var i = []; 87 var o = 16383; 88 for(var u = 0, a = f - n; u < a; u += o){ 89 i.push(encodeChunk(e, u, u + o > a ? a : u + o)); 90 } 91 if (n === 1) { 92 r = e[f - 1]; 93 i.push(t[r >> 2] + t[r << 4 & 63] + "=="); 94 } else if (n === 2) { 95 r = (e[f - 2] << 8) + e[f - 1]; 96 i.push(t[r >> 10] + t[r >> 4 & 63] + t[r << 2 & 63] + "="); 97 } 98 return i.join(""); 99 } 100 }, 101 72: function(e, r, t) { 102 "use strict"; 103 /*! 104 * The buffer module from node.js, for the browser. 105 * 106 * @author Feross Aboukhadijeh <https://feross.org> 107 * @license MIT 108 */ var f = t(675); 109 var n = t(783); 110 var i = typeof Symbol === "function" && typeof Symbol.for === "function" ? Symbol.for("nodejs.util.inspect.custom") : null; 111 r.Buffer = Buffer; 112 r.SlowBuffer = SlowBuffer; 113 r.INSPECT_MAX_BYTES = 50; 114 var o = 2147483647; 115 r.kMaxLength = o; 116 Buffer.TYPED_ARRAY_SUPPORT = typedArraySupport(); 117 if (!Buffer.TYPED_ARRAY_SUPPORT && typeof console !== "undefined" && typeof console.error === "function") { 118 console.error("This browser lacks typed array (Uint8Array) support which is required by " + "`buffer` v5.x. Use `buffer` v4.x if you require old browser support."); 119 } 120 function typedArraySupport() { 121 try { 122 var e = new Uint8Array(1); 123 var r = { 124 foo: function() { 125 return 42; 126 } 127 }; 128 Object.setPrototypeOf(r, Uint8Array.prototype); 129 Object.setPrototypeOf(e, r); 130 return e.foo() === 42; 131 } catch (e) { 132 return false;
vendor: 8,811 bytes, lines 133-343
133 } 134 } 135 Object.defineProperty(Buffer.prototype, "parent", { 136 enumerable: true, 137 get: function() { 138 if (!Buffer.isBuffer(this)) return undefined; 139 return this.buffer; 140 } 141 }); 142 Object.defineProperty(Buffer.prototype, "offset", { 143 enumerable: true, 144 get: function() { 145 if (!Buffer.isBuffer(this)) return undefined; 146 return this.byteOffset; 147 } 148 }); 149 function createBuffer(e) { 150 if (e > o) { 151 throw new RangeError('The value "' + e + '" is invalid for option "size"'); 152 } 153 var r = new Uint8Array(e); 154 Object.setPrototypeOf(r, Buffer.prototype); 155 return r; 156 } 157 function Buffer(e, r, t) { 158 if (typeof e === "number") { 159 if (typeof r === "string") { 160 throw new TypeError('The "string" argument must be of type string. Received type number'); 161 } 162 return allocUnsafe(e); 163 } 164 return from(e, r, t); 165 } 166 Buffer.poolSize = 8192; 167 function from(e, r, t) { 168 if (typeof e === "string") { 169 return fromString(e, r); 170 } 171 if (ArrayBuffer.isView(e)) { 172 return fromArrayLike(e); 173 } 174 if (e == null) { 175 throw new TypeError("The first argument must be one of type string, Buffer, ArrayBuffer, Array, " + "or Array-like Object. Received type " + typeof e); 176 } 177 if (isInstance(e, ArrayBuffer) || e && isInstance(e.buffer, ArrayBuffer)) { 178 return fromArrayBuffer(e, r, t); 179 } 180 if (typeof SharedArrayBuffer !== "undefined" && (isInstance(e, SharedArrayBuffer) || e && isInstance(e.buffer, SharedArrayBuffer))) { 181 return fromArrayBuffer(e, r, t); 182 } 183 if (typeof e === "number") { 184 throw new TypeError('The "value" argument must not be of type number. Received type number'); 185 } 186 var f = e.valueOf && e.valueOf(); 187 if (f != null && f !== e) { 188 return Buffer.from(f, r, t); 189 } 190 var n = fromObject(e); 191 if (n) return n; 192 if (typeof Symbol !== "undefined" && Symbol.toPrimitive != null && typeof e[Symbol.toPrimitive] === "function") { 193 return Buffer.from(e[Symbol.toPrimitive]("string"), r, t); 194 } 195 throw new TypeError("The first argument must be one of type string, Buffer, ArrayBuffer, Array, " + "or Array-like Object. Received type " + typeof e); 196 } 197 Buffer.from = function(e, r, t) { 198 return from(e, r, t); 199 }; 200 Object.setPrototypeOf(Buffer.prototype, Uint8Array.prototype); 201 Object.setPrototypeOf(Buffer, Uint8Array); 202 function assertSize(e) { 203 if (typeof e !== "number") { 204 throw new TypeError('"size" argument must be of type number'); 205 } else if (e < 0) { 206 throw new RangeError('The value "' + e + '" is invalid for option "size"'); 207 } 208 } 209 function alloc(e, r, t) { 210 assertSize(e); 211 if (e <= 0) { 212 return createBuffer(e); 213 } 214 if (r !== undefined) { 215 return typeof t === "string" ? createBuffer(e).fill(r, t) : createBuffer(e).fill(r); 216 } 217 return createBuffer(e); 218 } 219 Buffer.alloc = function(e, r, t) { 220 return alloc(e, r, t); 221 }; 222 function allocUnsafe(e) { 223 assertSize(e); 224 return createBuffer(e < 0 ? 0 : checked(e) | 0); 225 } 226 Buffer.allocUnsafe = function(e) { 227 return allocUnsafe(e); 228 }; 229 Buffer.allocUnsafeSlow = function(e) { 230 return allocUnsafe(e); 231 }; 232 function fromString(e, r) { 233 if (typeof r !== "string" || r === "") { 234 r = "utf8"; 235 } 236 if (!Buffer.isEncoding(r)) { 237 throw new TypeError("Unknown encoding: " + r); 238 } 239 var t = byteLength(e, r) | 0; 240 var f = createBuffer(t); 241 var n = f.write(e, r); 242 if (n !== t) { 243 f = f.slice(0, n); 244 } 245 return f; 246 } 247 function fromArrayLike(e) { 248 var r = e.length < 0 ? 0 : checked(e.length) | 0; 249 var t = createBuffer(r); 250 for(var f = 0; f < r; f += 1){ 251 t[f] = e[f] & 255; 252 } 253 return t; 254 } 255 function fromArrayBuffer(e, r, t) { 256 if (r < 0 || e.byteLength < r) { 257 throw new RangeError('"offset" is outside of buffer bounds'); 258 } 259 if (e.byteLength < r + (t || 0)) { 260 throw new RangeError('"length" is outside of buffer bounds'); 261 } 262 var f; 263 if (r === undefined && t === undefined) { 264 f = new Uint8Array(e); 265 } else if (t === undefined) { 266 f = new Uint8Array(e, r); 267 } else { 268 f = new Uint8Array(e, r, t); 269 } 270 Object.setPrototypeOf(f, Buffer.prototype); 271 return f; 272 } 273 function fromObject(e) { 274 if (Buffer.isBuffer(e)) { 275 var r = checked(e.length) | 0; 276 var t = createBuffer(r); 277 if (t.length === 0) { 278 return t; 279 } 280 e.copy(t, 0, 0, r); 281 return t; 282 } 283 if (e.length !== undefined) { 284 if (typeof e.length !== "number" || numberIsNaN(e.length)) { 285 return createBuffer(0); 286 } 287 return fromArrayLike(e); 288 } 289 if (e.type === "Buffer" && Array.isArray(e.data)) { 290 return fromArrayLike(e.data); 291 } 292 } 293 function checked(e) { 294 if (e >= o) { 295 throw new RangeError("Attempt to allocate Buffer larger than maximum " + "size: 0x" + o.toString(16) + " bytes"); 296 } 297 return e | 0; 298 } 299 function SlowBuffer(e) { 300 if (+e != e) { 301 e = 0; 302 } 303 return Buffer.alloc(+e); 304 } 305 Buffer.isBuffer = function isBuffer(e) { 306 return e != null && e._isBuffer === true && e !== Buffer.prototype; 307 }; 308 Buffer.compare = function compare(e, r) { 309 if (isInstance(e, Uint8Array)) e = Buffer.from(e, e.offset, e.byteLength); 310 if (isInstance(r, Uint8Array)) r = Buffer.from(r, r.offset, r.byteLength); 311 if (!Buffer.isBuffer(e) || !Buffer.isBuffer(r)) { 312 throw new TypeError('The "buf1", "buf2" arguments must be one of type Buffer or Uint8Array'); 313 } 314 if (e === r) return 0; 315 var t = e.length; 316 var f = r.length; 317 for(var n = 0, i = Math.min(t, f); n < i; ++n){ 318 if (e[n] !== r[n]) { 319 t = e[n]; 320 f = r[n]; 321 break; 322 } 323 } 324 if (t < f) return -1; 325 if (f < t) return 1; 326 return 0; 327 }; 328 Buffer.isEncoding = function isEncoding(e) { 329 switch(String(e).toLowerCase()){ 330 case "hex": 331 case "utf8": 332 case "utf-8": 333 case "ascii": 334 case "latin1": 335 case "binary": 336 case "base64": 337 case "ucs2": 338 case "ucs-2": 339 case "utf16le": 340 case "utf-16le": 341 return true; 342 default: 343 return false;
vendor: 2,940 bytes, lines 344-418
344 } 345 }; 346 Buffer.concat = function concat(e, r) { 347 if (!Array.isArray(e)) { 348 throw new TypeError('"list" argument must be an Array of Buffers'); 349 } 350 if (e.length === 0) { 351 return Buffer.alloc(0); 352 } 353 var t; 354 if (r === undefined) { 355 r = 0; 356 for(t = 0; t < e.length; ++t){ 357 r += e[t].length; 358 } 359 } 360 var f = Buffer.allocUnsafe(r); 361 var n = 0; 362 for(t = 0; t < e.length; ++t){ 363 var i = e[t]; 364 if (isInstance(i, Uint8Array)) { 365 i = Buffer.from(i); 366 } 367 if (!Buffer.isBuffer(i)) { 368 throw new TypeError('"list" argument must be an Array of Buffers'); 369 } 370 i.copy(f, n); 371 n += i.length; 372 } 373 return f; 374 }; 375 function byteLength(e, r) { 376 if (Buffer.isBuffer(e)) { 377 return e.length; 378 } 379 if (ArrayBuffer.isView(e) || isInstance(e, ArrayBuffer)) { 380 return e.byteLength; 381 } 382 if (typeof e !== "string") { 383 throw new TypeError('The "string" argument must be one of type string, Buffer, or ArrayBuffer. ' + "Received type " + typeof e); 384 } 385 var t = e.length; 386 var f = arguments.length > 2 && arguments[2] === true; 387 if (!f && t === 0) return 0; 388 var n = false; 389 for(;;){ 390 switch(r){ 391 case "ascii": 392 case "latin1": 393 case "binary": 394 return t; 395 case "utf8": 396 case "utf-8": 397 return utf8ToBytes(e).length; 398 case "ucs2": 399 case "ucs-2": 400 case "utf16le": 401 case "utf-16le": 402 return t * 2; 403 case "hex": 404 return t >>> 1; 405 case "base64": 406 return base64ToBytes(e).length; 407 default: 408 if (n) { 409 return f ? -1 : utf8ToBytes(e).length; 410 } 411 r = ("" + r).toLowerCase(); 412 n = true; 413 } 414 } 415 } 416 Buffer.byteLength = byteLength; 417 function slowToString(e, r, t) { 418 var f = false;
vendor: 29,518 bytes, lines 419-1168
419 if (r === undefined || r < 0) { 420 r = 0; 421 } 422 if (r > this.length) { 423 return ""; 424 } 425 if (t === undefined || t > this.length) { 426 t = this.length; 427 } 428 if (t <= 0) { 429 return ""; 430 } 431 t >>>= 0; 432 r >>>= 0; 433 if (t <= r) { 434 return ""; 435 } 436 if (!e) e = "utf8"; 437 while(true){ 438 switch(e){ 439 case "hex": 440 return hexSlice(this, r, t); 441 case "utf8": 442 case "utf-8": 443 return utf8Slice(this, r, t); 444 case "ascii": 445 return asciiSlice(this, r, t); 446 case "latin1": 447 case "binary": 448 return latin1Slice(this, r, t); 449 case "base64": 450 return base64Slice(this, r, t); 451 case "ucs2": 452 case "ucs-2": 453 case "utf16le": 454 case "utf-16le": 455 return utf16leSlice(this, r, t); 456 default: 457 if (f) throw new TypeError("Unknown encoding: " + e); 458 e = (e + "").toLowerCase(); 459 f = true; 460 } 461 } 462 } 463 Buffer.prototype._isBuffer = true; 464 function swap(e, r, t) { 465 var f = e[r]; 466 e[r] = e[t]; 467 e[t] = f; 468 } 469 Buffer.prototype.swap16 = function swap16() { 470 var e = this.length; 471 if (e % 2 !== 0) { 472 throw new RangeError("Buffer size must be a multiple of 16-bits"); 473 } 474 for(var r = 0; r < e; r += 2){ 475 swap(this, r, r + 1); 476 } 477 return this; 478 }; 479 Buffer.prototype.swap32 = function swap32() { 480 var e = this.length; 481 if (e % 4 !== 0) { 482 throw new RangeError("Buffer size must be a multiple of 32-bits"); 483 } 484 for(var r = 0; r < e; r += 4){ 485 swap(this, r, r + 3); 486 swap(this, r + 1, r + 2); 487 } 488 return this; 489 }; 490 Buffer.prototype.swap64 = function swap64() { 491 var e = this.length; 492 if (e % 8 !== 0) { 493 throw new RangeError("Buffer size must be a multiple of 64-bits"); 494 } 495 for(var r = 0; r < e; r += 8){ 496 swap(this, r, r + 7); 497 swap(this, r + 1, r + 6); 498 swap(this, r + 2, r + 5); 499 swap(this, r + 3, r + 4); 500 } 501 return this; 502 }; 503 Buffer.prototype.toString = function toString() { 504 var e = this.length; 505 if (e === 0) return ""; 506 if (arguments.length === 0) return utf8Slice(this, 0, e); 507 return slowToString.apply(this, arguments); 508 }; 509 Buffer.prototype.toLocaleString = Buffer.prototype.toString; 510 Buffer.prototype.equals = function equals(e) { 511 if (!Buffer.isBuffer(e)) throw new TypeError("Argument must be a Buffer"); 512 if (this === e) return true; 513 return Buffer.compare(this, e) === 0; 514 }; 515 Buffer.prototype.inspect = function inspect() { 516 var e = ""; 517 var t = r.INSPECT_MAX_BYTES; 518 e = this.toString("hex", 0, t).replace(/(.{2})/g, "$1 ").trim(); 519 if (this.length > t) e += " ... "; 520 return "<Buffer " + e + ">"; 521 }; 522 if (i) { 523 Buffer.prototype[i] = Buffer.prototype.inspect; 524 } 525 Buffer.prototype.compare = function compare(e, r, t, f, n) { 526 if (isInstance(e, Uint8Array)) { 527 e = Buffer.from(e, e.offset, e.byteLength); 528 } 529 if (!Buffer.isBuffer(e)) { 530 throw new TypeError('The "target" argument must be one of type Buffer or Uint8Array. ' + "Received type " + typeof e); 531 } 532 if (r === undefined) { 533 r = 0; 534 } 535 if (t === undefined) { 536 t = e ? e.length : 0; 537 } 538 if (f === undefined) { 539 f = 0; 540 } 541 if (n === undefined) { 542 n = this.length; 543 } 544 if (r < 0 || t > e.length || f < 0 || n > this.length) { 545 throw new RangeError("out of range index"); 546 } 547 if (f >= n && r >= t) { 548 return 0; 549 } 550 if (f >= n) { 551 return -1; 552 } 553 if (r >= t) { 554 return 1; 555 } 556 r >>>= 0; 557 t >>>= 0; 558 f >>>= 0; 559 n >>>= 0; 560 if (this === e) return 0; 561 var i = n - f; 562 var o = t - r; 563 var u = Math.min(i, o); 564 var a = this.slice(f, n); 565 var s = e.slice(r, t); 566 for(var h = 0; h < u; ++h){ 567 if (a[h] !== s[h]) { 568 i = a[h]; 569 o = s[h]; 570 break; 571 } 572 } 573 if (i < o) return -1; 574 if (o < i) return 1; 575 return 0; 576 }; 577 function bidirectionalIndexOf(e, r, t, f, n) { 578 if (e.length === 0) return -1; 579 if (typeof t === "string") { 580 f = t; 581 t = 0; 582 } else if (t > 2147483647) { 583 t = 2147483647; 584 } else if (t < -2147483648) { 585 t = -2147483648; 586 } 587 t = +t; 588 if (numberIsNaN(t)) { 589 t = n ? 0 : e.length - 1; 590 } 591 if (t < 0) t = e.length + t; 592 if (t >= e.length) { 593 if (n) return -1; 594 else t = e.length - 1; 595 } else if (t < 0) { 596 if (n) t = 0; 597 else return -1; 598 } 599 if (typeof r === "string") { 600 r = Buffer.from(r, f); 601 } 602 if (Buffer.isBuffer(r)) { 603 if (r.length === 0) { 604 return -1; 605 } 606 return arrayIndexOf(e, r, t, f, n); 607 } else if (typeof r === "number") { 608 r = r & 255; 609 if (typeof Uint8Array.prototype.indexOf === "function") { 610 if (n) { 611 return Uint8Array.prototype.indexOf.call(e, r, t); 612 } else { 613 return Uint8Array.prototype.lastIndexOf.call(e, r, t); 614 } 615 } 616 return arrayIndexOf(e, [ 617 r 618 ], t, f, n); 619 } 620 throw new TypeError("val must be string, number or Buffer"); 621 } 622 function arrayIndexOf(e, r, t, f, n) { 623 var i = 1; 624 var o = e.length; 625 var u = r.length; 626 if (f !== undefined) { 627 f = String(f).toLowerCase(); 628 if (f === "ucs2" || f === "ucs-2" || f === "utf16le" || f === "utf-16le") { 629 if (e.length < 2 || r.length < 2) { 630 return -1; 631 } 632 i = 2; 633 o /= 2; 634 u /= 2; 635 t /= 2; 636 } 637 } 638 function read(e, r) { 639 if (i === 1) { 640 return e[r]; 641 } else { 642 return e.readUInt16BE(r * i); 643 } 644 } 645 var a; 646 if (n) { 647 var s = -1; 648 for(a = t; a < o; a++){ 649 if (read(e, a) === read(r, s === -1 ? 0 : a - s)) { 650 if (s === -1) s = a; 651 if (a - s + 1 === u) return s * i; 652 } else { 653 if (s !== -1) a -= a - s; 654 s = -1; 655 } 656 } 657 } else { 658 if (t + u > o) t = o - u; 659 for(a = t; a >= 0; a--){ 660 var h = true; 661 for(var c = 0; c < u; c++){ 662 if (read(e, a + c) !== read(r, c)) { 663 h = false; 664 break; 665 } 666 } 667 if (h) return a; 668 } 669 } 670 return -1; 671 } 672 Buffer.prototype.includes = function includes(e, r, t) { 673 return this.indexOf(e, r, t) !== -1; 674 }; 675 Buffer.prototype.indexOf = function indexOf(e, r, t) { 676 return bidirectionalIndexOf(this, e, r, t, true); 677 }; 678 Buffer.prototype.lastIndexOf = function lastIndexOf(e, r, t) { 679 return bidirectionalIndexOf(this, e, r, t, false); 680 }; 681 function hexWrite(e, r, t, f) { 682 t = Number(t) || 0; 683 var n = e.length - t; 684 if (!f) { 685 f = n; 686 } else { 687 f = Number(f); 688 if (f > n) { 689 f = n; 690 } 691 } 692 var i = r.length; 693 if (f > i / 2) { 694 f = i / 2; 695 } 696 for(var o = 0; o < f; ++o){ 697 var u = parseInt(r.substr(o * 2, 2), 16); 698 if (numberIsNaN(u)) return o; 699 e[t + o] = u; 700 } 701 return o; 702 } 703 function utf8Write(e, r, t, f) { 704 return blitBuffer(utf8ToBytes(r, e.length - t), e, t, f); 705 } 706 function asciiWrite(e, r, t, f) { 707 return blitBuffer(asciiToBytes(r), e, t, f); 708 } 709 function latin1Write(e, r, t, f) { 710 return asciiWrite(e, r, t, f); 711 } 712 function base64Write(e, r, t, f) { 713 return blitBuffer(base64ToBytes(r), e, t, f); 714 } 715 function ucs2Write(e, r, t, f) { 716 return blitBuffer(utf16leToBytes(r, e.length - t), e, t, f); 717 } 718 Buffer.prototype.write = function write(e, r, t, f) { 719 if (r === undefined) { 720 f = "utf8"; 721 t = this.length; 722 r = 0; 723 } else if (t === undefined && typeof r === "string") { 724 f = r; 725 t = this.length; 726 r = 0; 727 } else if (isFinite(r)) { 728 r = r >>> 0; 729 if (isFinite(t)) { 730 t = t >>> 0; 731 if (f === undefined) f = "utf8"; 732 } else { 733 f = t; 734 t = undefined; 735 } 736 } else { 737 throw new Error("Buffer.write(string, encoding, offset[, length]) is no longer supported"); 738 } 739 var n = this.length - r; 740 if (t === undefined || t > n) t = n; 741 if (e.length > 0 && (t < 0 || r < 0) || r > this.length) { 742 throw new RangeError("Attempt to write outside buffer bounds"); 743 } 744 if (!f) f = "utf8"; 745 var i = false; 746 for(;;){ 747 switch(f){ 748 case "hex": 749 return hexWrite(this, e, r, t); 750 case "utf8": 751 case "utf-8": 752 return utf8Write(this, e, r, t); 753 case "ascii": 754 return asciiWrite(this, e, r, t); 755 case "latin1": 756 case "binary": 757 return latin1Write(this, e, r, t); 758 case "base64": 759 return base64Write(this, e, r, t); 760 case "ucs2": 761 case "ucs-2": 762 case "utf16le": 763 case "utf-16le": 764 return ucs2Write(this, e, r, t); 765 default: 766 if (i) throw new TypeError("Unknown encoding: " + f); 767 f = ("" + f).toLowerCase(); 768 i = true; 769 } 770 } 771 }; 772 Buffer.prototype.toJSON = function toJSON() { 773 return { 774 type: "Buffer", 775 data: Array.prototype.slice.call(this._arr || this, 0) 776 }; 777 }; 778 function base64Slice(e, r, t) { 779 if (r === 0 && t === e.length) { 780 return f.fromByteArray(e); 781 } else { 782 return f.fromByteArray(e.slice(r, t)); 783 } 784 } 785 function utf8Slice(e, r, t) { 786 t = Math.min(e.length, t); 787 var f = []; 788 var n = r; 789 while(n < t){ 790 var i = e[n]; 791 var o = null; 792 var u = i > 239 ? 4 : i > 223 ? 3 : i > 191 ? 2 : 1; 793 if (n + u <= t) { 794 var a, s, h, c; 795 switch(u){ 796 case 1: 797 if (i < 128) { 798 o = i; 799 } 800 break; 801 case 2: 802 a = e[n + 1]; 803 if ((a & 192) === 128) { 804 c = (i & 31) << 6 | a & 63; 805 if (c > 127) { 806 o = c; 807 } 808 } 809 break; 810 case 3: 811 a = e[n + 1]; 812 s = e[n + 2]; 813 if ((a & 192) === 128 && (s & 192) === 128) { 814 c = (i & 15) << 12 | (a & 63) << 6 | s & 63; 815 if (c > 2047 && (c < 55296 || c > 57343)) { 816 o = c; 817 } 818 } 819 break; 820 case 4: 821 a = e[n + 1]; 822 s = e[n + 2]; 823 h = e[n + 3]; 824 if ((a & 192) === 128 && (s & 192) === 128 && (h & 192) === 128) { 825 c = (i & 15) << 18 | (a & 63) << 12 | (s & 63) << 6 | h & 63; 826 if (c > 65535 && c < 1114112) { 827 o = c; 828 } 829 } 830 } 831 } 832 if (o === null) { 833 o = 65533; 834 u = 1; 835 } else if (o > 65535) { 836 o -= 65536; 837 f.push(o >>> 10 & 1023 | 55296); 838 o = 56320 | o & 1023; 839 } 840 f.push(o); 841 n += u; 842 } 843 return decodeCodePointsArray(f); 844 } 845 var u = 4096; 846 function decodeCodePointsArray(e) { 847 var r = e.length; 848 if (r <= u) { 849 return String.fromCharCode.apply(String, e); 850 } 851 var t = ""; 852 var f = 0; 853 while(f < r){ 854 t += String.fromCharCode.apply(String, e.slice(f, f += u)); 855 } 856 return t; 857 } 858 function asciiSlice(e, r, t) { 859 var f = ""; 860 t = Math.min(e.length, t); 861 for(var n = r; n < t; ++n){ 862 f += String.fromCharCode(e[n] & 127); 863 } 864 return f; 865 } 866 function latin1Slice(e, r, t) { 867 var f = ""; 868 t = Math.min(e.length, t); 869 for(var n = r; n < t; ++n){ 870 f += String.fromCharCode(e[n]); 871 } 872 return f; 873 } 874 function hexSlice(e, r, t) { 875 var f = e.length; 876 if (!r || r < 0) r = 0; 877 if (!t || t < 0 || t > f) t = f; 878 var n = ""; 879 for(var i = r; i < t; ++i){ 880 n += s[e[i]]; 881 } 882 return n; 883 } 884 function utf16leSlice(e, r, t) { 885 var f = e.slice(r, t); 886 var n = ""; 887 for(var i = 0; i < f.length; i += 2){ 888 n += String.fromCharCode(f[i] + f[i + 1] * 256); 889 } 890 return n; 891 } 892 Buffer.prototype.slice = function slice(e, r) { 893 var t = this.length; 894 e = ~~e; 895 r = r === undefined ? t : ~~r; 896 if (e < 0) { 897 e += t; 898 if (e < 0) e = 0; 899 } else if (e > t) { 900 e = t; 901 } 902 if (r < 0) { 903 r += t; 904 if (r < 0) r = 0; 905 } else if (r > t) { 906 r = t; 907 } 908 if (r < e) r = e; 909 var f = this.subarray(e, r); 910 Object.setPrototypeOf(f, Buffer.prototype); 911 return f; 912 }; 913 function checkOffset(e, r, t) { 914 if (e % 1 !== 0 || e < 0) throw new RangeError("offset is not uint"); 915 if (e + r > t) throw new RangeError("Trying to access beyond buffer length"); 916 } 917 Buffer.prototype.readUIntLE = function readUIntLE(e, r, t) { 918 e = e >>> 0; 919 r = r >>> 0; 920 if (!t) checkOffset(e, r, this.length); 921 var f = this[e]; 922 var n = 1; 923 var i = 0; 924 while(++i < r && (n *= 256)){ 925 f += this[e + i] * n; 926 } 927 return f; 928 }; 929 Buffer.prototype.readUIntBE = function readUIntBE(e, r, t) { 930 e = e >>> 0; 931 r = r >>> 0; 932 if (!t) { 933 checkOffset(e, r, this.length); 934 } 935 var f = this[e + --r]; 936 var n = 1; 937 while(r > 0 && (n *= 256)){ 938 f += this[e + --r] * n; 939 } 940 return f; 941 }; 942 Buffer.prototype.readUInt8 = function readUInt8(e, r) { 943 e = e >>> 0; 944 if (!r) checkOffset(e, 1, this.length); 945 return this[e]; 946 }; 947 Buffer.prototype.readUInt16LE = function readUInt16LE(e, r) { 948 e = e >>> 0; 949 if (!r) checkOffset(e, 2, this.length); 950 return this[e] | this[e + 1] << 8; 951 }; 952 Buffer.prototype.readUInt16BE = function readUInt16BE(e, r) { 953 e = e >>> 0; 954 if (!r) checkOffset(e, 2, this.length); 955 return this[e] << 8 | this[e + 1]; 956 }; 957 Buffer.prototype.readUInt32LE = function readUInt32LE(e, r) { 958 e = e >>> 0; 959 if (!r) checkOffset(e, 4, this.length); 960 return (this[e] | this[e + 1] << 8 | this[e + 2] << 16) + this[e + 3] * 16777216; 961 }; 962 Buffer.prototype.readUInt32BE = function readUInt32BE(e, r) { 963 e = e >>> 0; 964 if (!r) checkOffset(e, 4, this.length); 965 return this[e] * 16777216 + (this[e + 1] << 16 | this[e + 2] << 8 | this[e + 3]); 966 }; 967 Buffer.prototype.readIntLE = function readIntLE(e, r, t) { 968 e = e >>> 0; 969 r = r >>> 0; 970 if (!t) checkOffset(e, r, this.length); 971 var f = this[e]; 972 var n = 1; 973 var i = 0; 974 while(++i < r && (n *= 256)){ 975 f += this[e + i] * n; 976 } 977 n *= 128; 978 if (f >= n) f -= Math.pow(2, 8 * r); 979 return f; 980 }; 981 Buffer.prototype.readIntBE = function readIntBE(e, r, t) { 982 e = e >>> 0; 983 r = r >>> 0; 984 if (!t) checkOffset(e, r, this.length); 985 var f = r; 986 var n = 1; 987 var i = this[e + --f]; 988 while(f > 0 && (n *= 256)){ 989 i += this[e + --f] * n; 990 } 991 n *= 128; 992 if (i >= n) i -= Math.pow(2, 8 * r); 993 return i; 994 }; 995 Buffer.prototype.readInt8 = function readInt8(e, r) { 996 e = e >>> 0; 997 if (!r) checkOffset(e, 1, this.length); 998 if (!(this[e] & 128)) return this[e]; 999 return (255 - this[e] + 1) * -1; 1000 }; 1001 Buffer.prototype.readInt16LE = function readInt16LE(e, r) { 1002 e = e >>> 0; 1003 if (!r) checkOffset(e, 2, this.length); 1004 var t = this[e] | this[e + 1] << 8; 1005 return t & 32768 ? t | 4294901760 : t; 1006 }; 1007 Buffer.prototype.readInt16BE = function readInt16BE(e, r) { 1008 e = e >>> 0; 1009 if (!r) checkOffset(e, 2, this.length); 1010 var t = this[e + 1] | this[e] << 8; 1011 return t & 32768 ? t | 4294901760 : t; 1012 }; 1013 Buffer.prototype.readInt32LE = function readInt32LE(e, r) { 1014 e = e >>> 0; 1015 if (!r) checkOffset(e, 4, this.length); 1016 return this[e] | this[e + 1] << 8 | this[e + 2] << 16 | this[e + 3] << 24; 1017 }; 1018 Buffer.prototype.readInt32BE = function readInt32BE(e, r) { 1019 e = e >>> 0; 1020 if (!r) checkOffset(e, 4, this.length); 1021 return this[e] << 24 | this[e + 1] << 16 | this[e + 2] << 8 | this[e + 3]; 1022 }; 1023 Buffer.prototype.readFloatLE = function readFloatLE(e, r) { 1024 e = e >>> 0; 1025 if (!r) checkOffset(e, 4, this.length); 1026 return n.read(this, e, true, 23, 4); 1027 }; 1028 Buffer.prototype.readFloatBE = function readFloatBE(e, r) { 1029 e = e >>> 0; 1030 if (!r) checkOffset(e, 4, this.length); 1031 return n.read(this, e, false, 23, 4); 1032 }; 1033 Buffer.prototype.readDoubleLE = function readDoubleLE(e, r) { 1034 e = e >>> 0; 1035 if (!r) checkOffset(e, 8, this.length); 1036 return n.read(this, e, true, 52, 8); 1037 }; 1038 Buffer.prototype.readDoubleBE = function readDoubleBE(e, r) { 1039 e = e >>> 0; 1040 if (!r) checkOffset(e, 8, this.length); 1041 return n.read(this, e, false, 52, 8); 1042 }; 1043 function checkInt(e, r, t, f, n, i) { 1044 if (!Buffer.isBuffer(e)) throw new TypeError('"buffer" argument must be a Buffer instance'); 1045 if (r > n || r < i) throw new RangeError('"value" argument is out of bounds'); 1046 if (t + f > e.length) throw new RangeError("Index out of range"); 1047 } 1048 Buffer.prototype.writeUIntLE = function writeUIntLE(e, r, t, f) { 1049 e = +e; 1050 r = r >>> 0; 1051 t = t >>> 0; 1052 if (!f) { 1053 var n = Math.pow(2, 8 * t) - 1; 1054 checkInt(this, e, r, t, n, 0); 1055 } 1056 var i = 1; 1057 var o = 0; 1058 this[r] = e & 255; 1059 while(++o < t && (i *= 256)){ 1060 this[r + o] = e / i & 255; 1061 } 1062 return r + t; 1063 }; 1064 Buffer.prototype.writeUIntBE = function writeUIntBE(e, r, t, f) { 1065 e = +e; 1066 r = r >>> 0; 1067 t = t >>> 0; 1068 if (!f) { 1069 var n = Math.pow(2, 8 * t) - 1; 1070 checkInt(this, e, r, t, n, 0); 1071 } 1072 var i = t - 1; 1073 var o = 1; 1074 this[r + i] = e & 255; 1075 while(--i >= 0 && (o *= 256)){ 1076 this[r + i] = e / o & 255; 1077 } 1078 return r + t; 1079 }; 1080 Buffer.prototype.writeUInt8 = function writeUInt8(e, r, t) { 1081 e = +e; 1082 r = r >>> 0; 1083 if (!t) checkInt(this, e, r, 1, 255, 0); 1084 this[r] = e & 255; 1085 return r + 1; 1086 }; 1087 Buffer.prototype.writeUInt16LE = function writeUInt16LE(e, r, t) { 1088 e = +e; 1089 r = r >>> 0; 1090 if (!t) checkInt(this, e, r, 2, 65535, 0); 1091 this[r] = e & 255; 1092 this[r + 1] = e >>> 8; 1093 return r + 2; 1094 }; 1095 Buffer.prototype.writeUInt16BE = function writeUInt16BE(e, r, t) { 1096 e = +e; 1097 r = r >>> 0; 1098 if (!t) checkInt(this, e, r, 2, 65535, 0); 1099 this[r] = e >>> 8; 1100 this[r + 1] = e & 255; 1101 return r + 2; 1102 }; 1103 Buffer.prototype.writeUInt32LE = function writeUInt32LE(e, r, t) { 1104 e = +e; 1105 r = r >>> 0; 1106 if (!t) checkInt(this, e, r, 4, 4294967295, 0); 1107 this[r + 3] = e >>> 24; 1108 this[r + 2] = e >>> 16; 1109 this[r + 1] = e >>> 8; 1110 this[r] = e & 255; 1111 return r + 4; 1112 }; 1113 Buffer.prototype.writeUInt32BE = function writeUInt32BE(e, r, t) { 1114 e = +e; 1115 r = r >>> 0; 1116 if (!t) checkInt(this, e, r, 4, 4294967295, 0); 1117 this[r] = e >>> 24; 1118 this[r + 1] = e >>> 16; 1119 this[r + 2] = e >>> 8; 1120 this[r + 3] = e & 255; 1121 return r + 4; 1122 }; 1123 Buffer.prototype.writeIntLE = function writeIntLE(e, r, t, f) { 1124 e = +e; 1125 r = r >>> 0; 1126 if (!f) { 1127 var n = Math.pow(2, 8 * t - 1); 1128 checkInt(this, e, r, t, n - 1, -n); 1129 } 1130 var i = 0; 1131 var o = 1; 1132 var u = 0; 1133 this[r] = e & 255; 1134 while(++i < t && (o *= 256)){ 1135 if (e < 0 && u === 0 && this[r + i - 1] !== 0) { 1136 u = 1; 1137 } 1138 this[r + i] = (e / o >> 0) - u & 255; 1139 } 1140 return r + t; 1141 }; 1142 Buffer.prototype.writeIntBE = function writeIntBE(e, r, t, f) { 1143 e = +e; 1144 r = r >>> 0; 1145 if (!f) { 1146 var n = Math.pow(2, 8 * t - 1); 1147 checkInt(this, e, r, t, n - 1, -n); 1148 } 1149 var i = t - 1; 1150 var o = 1; 1151 var u = 0; 1152 this[r + i] = e & 255; 1153 while(--i >= 0 && (o *= 256)){ 1154 if (e < 0 && u === 0 && this[r + i + 1] !== 0) { 1155 u = 1; 1156 } 1157 this[r + i] = (e / o >> 0) - u & 255; 1158 } 1159 return r + t; 1160 }; 1161 Buffer.prototype.writeInt8 = function writeInt8(e, r, t) { 1162 e = +e; 1163 r = r >>> 0; 1164 if (!t) checkInt(this, e, r, 1, 127, -128); 1165 if (e < 0) e = 255 + e + 1; 1166 this[r] = e & 255; 1167 return r + 1; 1168 };
vendor: 6,329 bytes, lines 1169-1315
1169 Buffer.prototype.writeInt16LE = function writeInt16LE(e, r, t) { 1170 e = +e; 1171 r = r >>> 0; 1172 if (!t) checkInt(this, e, r, 2, 32767, -32768); 1173 this[r] = e & 255; 1174 this[r + 1] = e >>> 8; 1175 return r + 2; 1176 }; 1177 Buffer.prototype.writeInt16BE = function writeInt16BE(e, r, t) { 1178 e = +e; 1179 r = r >>> 0; 1180 if (!t) checkInt(this, e, r, 2, 32767, -32768); 1181 this[r] = e >>> 8; 1182 this[r + 1] = e & 255; 1183 return r + 2; 1184 }; 1185 Buffer.prototype.writeInt32LE = function writeInt32LE(e, r, t) { 1186 e = +e; 1187 r = r >>> 0; 1188 if (!t) checkInt(this, e, r, 4, 2147483647, -2147483648); 1189 this[r] = e & 255; 1190 this[r + 1] = e >>> 8; 1191 this[r + 2] = e >>> 16; 1192 this[r + 3] = e >>> 24; 1193 return r + 4; 1194 }; 1195 Buffer.prototype.writeInt32BE = function writeInt32BE(e, r, t) { 1196 e = +e; 1197 r = r >>> 0; 1198 if (!t) checkInt(this, e, r, 4, 2147483647, -2147483648); 1199 if (e < 0) e = 4294967295 + e + 1; 1200 this[r] = e >>> 24; 1201 this[r + 1] = e >>> 16; 1202 this[r + 2] = e >>> 8; 1203 this[r + 3] = e & 255; 1204 return r + 4; 1205 }; 1206 function checkIEEE754(e, r, t, f, n, i) { 1207 if (t + f > e.length) throw new RangeError("Index out of range"); 1208 if (t < 0) throw new RangeError("Index out of range"); 1209 } 1210 function writeFloat(e, r, t, f, i) { 1211 r = +r; 1212 t = t >>> 0; 1213 if (!i) { 1214 checkIEEE754(e, r, t, 4, 34028234663852886e22, -34028234663852886e22); 1215 } 1216 n.write(e, r, t, f, 23, 4); 1217 return t + 4; 1218 } 1219 Buffer.prototype.writeFloatLE = function writeFloatLE(e, r, t) { 1220 return writeFloat(this, e, r, true, t); 1221 }; 1222 Buffer.prototype.writeFloatBE = function writeFloatBE(e, r, t) { 1223 return writeFloat(this, e, r, false, t); 1224 }; 1225 function writeDouble(e, r, t, f, i) { 1226 r = +r; 1227 t = t >>> 0; 1228 if (!i) { 1229 checkIEEE754(e, r, t, 8, 17976931348623157e292, -17976931348623157e292); 1230 } 1231 n.write(e, r, t, f, 52, 8); 1232 return t + 8; 1233 } 1234 Buffer.prototype.writeDoubleLE = function writeDoubleLE(e, r, t) { 1235 return writeDouble(this, e, r, true, t); 1236 }; 1237 Buffer.prototype.writeDoubleBE = function writeDoubleBE(e, r, t) { 1238 return writeDouble(this, e, r, false, t); 1239 }; 1240 Buffer.prototype.copy = function copy(e, r, t, f) { 1241 if (!Buffer.isBuffer(e)) throw new TypeError("argument should be a Buffer"); 1242 if (!t) t = 0; 1243 if (!f && f !== 0) f = this.length; 1244 if (r >= e.length) r = e.length; 1245 if (!r) r = 0; 1246 if (f > 0 && f < t) f = t; 1247 if (f === t) return 0; 1248 if (e.length === 0 || this.length === 0) return 0; 1249 if (r < 0) { 1250 throw new RangeError("targetStart out of bounds"); 1251 } 1252 if (t < 0 || t >= this.length) throw new RangeError("Index out of range"); 1253 if (f < 0) throw new RangeError("sourceEnd out of bounds"); 1254 if (f > this.length) f = this.length; 1255 if (e.length - r < f - t) { 1256 f = e.length - r + t; 1257 } 1258 var n = f - t; 1259 if (this === e && typeof Uint8Array.prototype.copyWithin === "function") { 1260 this.copyWithin(r, t, f); 1261 } else if (this === e && t < r && r < f) { 1262 for(var i = n - 1; i >= 0; --i){ 1263 e[i + r] = this[i + t]; 1264 } 1265 } else { 1266 Uint8Array.prototype.set.call(e, this.subarray(t, f), r); 1267 } 1268 return n; 1269 }; 1270 Buffer.prototype.fill = function fill(e, r, t, f) { 1271 if (typeof e === "string") { 1272 if (typeof r === "string") { 1273 f = r; 1274 r = 0; 1275 t = this.length; 1276 } else if (typeof t === "string") { 1277 f = t; 1278 t = this.length; 1279 } 1280 if (f !== undefined && typeof f !== "string") { 1281 throw new TypeError("encoding must be a string"); 1282 } 1283 if (typeof f === "string" && !Buffer.isEncoding(f)) { 1284 throw new TypeError("Unknown encoding: " + f); 1285 } 1286 if (e.length === 1) { 1287 var n = e.charCodeAt(0); 1288 if (f === "utf8" && n < 128 || f === "latin1") { 1289 e = n; 1290 } 1291 } 1292 } else if (typeof e === "number") { 1293 e = e & 255; 1294 } else if (typeof e === "boolean") { 1295 e = Number(e); 1296 } 1297 if (r < 0 || this.length < r || this.length < t) { 1298 throw new RangeError("Out of range index"); 1299 } 1300 if (t <= r) { 1301 return this; 1302 } 1303 r = r >>> 0; 1304 t = t === undefined ? this.length : t >>> 0; 1305 if (!e) e = 0; 1306 var i; 1307 if (typeof e === "number") { 1308 for(i = r; i < t; ++i){ 1309 this[i] = e; 1310 } 1311 } else { 1312 var o = Buffer.isBuffer(e) ? e : Buffer.from(e, f); 1313 var u = o.length; 1314 if (u === 0) { 1315 throw new TypeError('The value "' + e + '" is invali
vendor: 5,321 bytes, lines 1315-1453
1315d for argument "value"'); 1316 } 1317 for(i = 0; i < t - r; ++i){ 1318 this[i + r] = o[i % u]; 1319 } 1320 } 1321 return this; 1322 }; 1323 var a = /[^+/0-9A-Za-z-_]/g; 1324 function base64clean(e) { 1325 e = e.split("=")[0]; 1326 e = e.trim().replace(a, ""); 1327 if (e.length < 2) return ""; 1328 while(e.length % 4 !== 0){ 1329 e = e + "="; 1330 } 1331 return e; 1332 } 1333 function utf8ToBytes(e, r) { 1334 r = r || Infinity; 1335 var t; 1336 var f = e.length; 1337 var n = null; 1338 var i = []; 1339 for(var o = 0; o < f; ++o){ 1340 t = e.charCodeAt(o); 1341 if (t > 55295 && t < 57344) { 1342 if (!n) { 1343 if (t > 56319) { 1344 if ((r -= 3) > -1) i.push(239, 191, 189); 1345 continue; 1346 } else if (o + 1 === f) { 1347 if ((r -= 3) > -1) i.push(239, 191, 189); 1348 continue; 1349 } 1350 n = t; 1351 continue; 1352 } 1353 if (t < 56320) { 1354 if ((r -= 3) > -1) i.push(239, 191, 189); 1355 n = t; 1356 continue; 1357 } 1358 t = (n - 55296 << 10 | t - 56320) + 65536; 1359 } else if (n) { 1360 if ((r -= 3) > -1) i.push(239, 191, 189); 1361 } 1362 n = null; 1363 if (t < 128) { 1364 if ((r -= 1) < 0) break; 1365 i.push(t); 1366 } else if (t < 2048) { 1367 if ((r -= 2) < 0) break; 1368 i.push(t >> 6 | 192, t & 63 | 128); 1369 } else if (t < 65536) { 1370 if ((r -= 3) < 0) break; 1371 i.push(t >> 12 | 224, t >> 6 & 63 | 128, t & 63 | 128); 1372 } else if (t < 1114112) { 1373 if ((r -= 4) < 0) break; 1374 i.push(t >> 18 | 240, t >> 12 & 63 | 128, t >> 6 & 63 | 128, t & 63 | 128); 1375 } else { 1376 throw new Error("Invalid code point"); 1377 } 1378 } 1379 return i; 1380 } 1381 function asciiToBytes(e) { 1382 var r = []; 1383 for(var t = 0; t < e.length; ++t){ 1384 r.push(e.charCodeAt(t) & 255); 1385 } 1386 return r; 1387 } 1388 function utf16leToBytes(e, r) { 1389 var t, f, n; 1390 var i = []; 1391 for(var o = 0; o < e.length; ++o){ 1392 if ((r -= 2) < 0) break; 1393 t = e.charCodeAt(o); 1394 f = t >> 8; 1395 n = t % 256; 1396 i.push(n); 1397 i.push(f); 1398 } 1399 return i; 1400 } 1401 function base64ToBytes(e) { 1402 return f.toByteArray(base64clean(e)); 1403 } 1404 function blitBuffer(e, r, t, f) { 1405 for(var n = 0; n < f; ++n){ 1406 if (n + t >= r.length || n >= e.length) break; 1407 r[n + t] = e[n]; 1408 } 1409 return n; 1410 } 1411 function isInstance(e, r) { 1412 return e instanceof r || e != null && e.constructor != null && e.constructor.name != null && e.constructor.name === r.name; 1413 } 1414 function numberIsNaN(e) { 1415 return e !== e; 1416 } 1417 var s = function() { 1418 var e = "0123456789abcdef"; 1419 var r = new Array(256); 1420 for(var t = 0; t < 16; ++t){ 1421 var f = t * 16; 1422 for(var n = 0; n < 16; ++n){ 1423 r[f + n] = e[t] + e[n]; 1424 } 1425 } 1426 return r; 1427 }(); 1428 }, 1429 783: function(e, r) { 1430 /*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */ r.read = function(e, r, t, f, n) { 1431 var i, o; 1432 var u = n * 8 - f - 1; 1433 var a = (1 << u) - 1; 1434 var s = a >> 1; 1435 var h = -7; 1436 var c = t ? n - 1 : 0; 1437 var l = t ? -1 : 1; 1438 var p = e[r + c]; 1439 c += l; 1440 i = p & (1 << -h) - 1; 1441 p >>= -h; 1442 h += u; 1443 for(; h > 0; i = i * 256 + e[r + c], c += l, h -= 8){} 1444 o = i & (1 << -h) - 1; 1445 i >>= -h; 1446 h += f; 1447 for(; h > 0; o = o * 256 + e[r + c], c += l, h -= 8){} 1448 if (i === 0) { 1449 i = 1 - s; 1450 } else if (i === a) { 1451 return o ? NaN : (p ? -1 : 1) * Infinity; 1452 } else { 1453 o = o + Math.pow(2, f);
1454 i = i - s; 1455 } 1456 return (p ? -1 : 1) * o * Math.pow(2, i - f); 1457 }; 1458 r.write = function(e, r, t, f, n, i) { 1459 var o, u, a; 1460 var s = i * 8 - n - 1; 1461 var h = (1 << s) - 1; 1462 var c = h >> 1; 1463 var l = n === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0; 1464 var p = f ? 0 : i - 1; 1465 var y = f ? 1 : -1; 1466 var g = r < 0 || r === 0 && 1 / r < 0 ? 1 : 0; 1467 r = Math.abs(r); 1468 if (isNaN(r) || r === Infinity) { 1469 u = isNaN(r) ? 1 : 0; 1470 o = h; 1471 } else { 1472 o = Math.floor(Math.log(r) / Math.LN2); 1473 if (r * (a = Math.pow(2, -o)) < 1) { 1474 o--; 1475 a *= 2; 1476 } 1477 if (o + c >= 1) { 1478 r += l / a; 1479 } else { 1480 r += l * Math.pow(2, 1 - c); 1481 } 1482 if (r * a >= 2) { 1483 o++; 1484 a /= 2; 1485 } 1486 if (o + c >= h) { 1487 u = 0; 1488 o = h; 1489 } else if (o + c >= 1) { 1490 u = (r * a - 1) * Math.pow(2, n); 1491 o = o + c; 1492 } else { 1493 u = r * Math.pow(2, c - 1) * Math.pow(2, n); 1494 o = 0; 1495 } 1496 } 1497 for(; n >= 8; e[t + p] = u & 255, p += y, u /= 256, n -= 8){} 1498 o = o << n | u; 1499 s += n; 1500 for(; s > 0; e[t + p] = o & 255, p += y, o /= 256, s -= 8){} 1501 e[t + p - y] |= g * 128; 1502 }; 1503 } 1504 }; 1505 var r = {}; 1506 function __nccwpck_require__(t) { 1507 var f = r[t]; 1508 if (f !== undefined) { 1509 return f.exports; 1510 } 1511 var n = r[t] = { 1512 exports: {} 1513 }; 1514 var i = true; 1515 try { 1516 e[t](n, n.exports, __nccwpck_require__); 1517 i = false; 1518 } finally{ 1519 if (i) delete r[t]; 1520 } 1521 return n.exports; 1522 } 1523 if (typeof __nccwpck_require__ !== "undefined") __nccwpck_require__.ab = ("TURBOPACK compile-time value", "/ROOT/node_modules/next/dist/compiled/buffer") + "/"; 1524 var t = __nccwpck_require__(72); 1525 module.exports = t; 1526})(); 1527}), 1528660209, ((__turbopack_context__) => { 1529"use strict"; 1530 1531var __TURBOPACK__imported__module__843476__ = __turbopack_context__.i(843476); 1532var __TURBOPACK__imported__module__271645__ = __turbopack_context__.i(271645); 1533; 1534; 1535const SvgCheck = (props, ref)=>/*#__PURE__*/ (0, __TURBOPACK__imported__module__843476__["jsx"])("svg", { 1536 xmlns: "http://www.w3.org/2000/svg", 1537 width: 20, 1538 height: 20, 1539 fill: "none",
1540 viewBox: "0 0 20 20", 1541 ref: ref, 1542 ...props, 1543 children: /*#__PURE__*/ (0, __TURBOPACK__imported__module__843476__["jsx"])("path", { 1544 fill: "#0F823F", 1545 fillRule: "evenodd", 1546 stroke: "#0F823F", 1547 strokeLinecap: "square", 1548 strokeLinejoin: "round", 1549 d: "M18.053 5.805a.5.5 0 0 1 0 .707l-9.369 9.369a1.26 1.26 0 0 1-1.783 0l-4.954-4.954a.5.5 0 0 1 0-.707l1.077-1.077a.5.5 0 0 1 .707 0l3.708 3.708a.5.5 0 0 0 .707 0L16.27 4.73a.5.5 0 0 1 .707 0z", 1550 clipRule: "evenodd" 1551 }) 1552 }); 1553const ForwardRef = /*#__PURE__*/ (0, __TURBOPACK__imported__module__271645__["forwardRef"])(SvgCheck); 1554const Memo = /*#__PURE__*/ (0, __TURBOPACK__imported__module__271645__["memo"])(ForwardRef); 1555const __TURBOPACK__default__export__ = Memo; 1556__turbopack_context__.s([ 1557 "default", 1558 0, 1559 __TURBOPACK__default__export__ 1560]); 1561}), 1562552356, ((__turbopack_context__) => { 1563"use strict"; 1564 1565var __TURBOPACK__imported__module__843476__ = __turbopack_context__.i(843476); 1566var __TURBOPACK__imported__module__660209__ = __turbopack_context__.i(660209); 1567var __TURBOPACK__imported__module__945060__ = __turbopack_context__.i(945060); 1568; 1569; 1570; 1571function UspItem(param) { 1572 let { className, children } = param; 1573 return /*#__PURE__*/ (0, __TURBOPACK__imported__module__843476__["jsxs"])("span", { 1574 className: (0, __TURBOPACK__imported__module__945060__["cn"])("inline-flex items-center text-gray-500", className), 1575 children: [ 1576 /*#__PURE__*/ (0, __TURBOPACK__imported__module__843476__["jsx"])(__TURBOPACK__imported__module__660209__["default"], { 1577 className: "mr-1 h-[0.8em] w-auto", 1578 "aria-hidden": "true" 1579 }), 1580 children 1581 ] 1582 }); 1583} 1584__turbopack_context__.s([ 1585 "UspItem", 1586 0, 1587 UspItem 1588]); 1589}), 1590710191, ((__turbopack_context__) => { 1591"use strict"; 1592 1593// Generated by @compas/code-gen 1594async function apiSupportContact(axiosInstance, body, requestConfig) { 1595 const response = await axiosInstance.request({ 1596 url: "support/contact", 1597 method: "POST", 1598 data: body, 1599 ...requestConfig 1600 }); 1601 return response.data; 1602} 1603async function apiSupportSubscribeNewsletter(axiosInstance, body, requestConfig) { 1604 const response = await axiosInstance.request({ 1605 url: "support/mailing-list/newsletter/subscribe", 1606 method: "POST", 1607 data: body, 1608 ...requestConfig 1609 }); 1610 return response.data; 1611} 1612__turbopack_context__.s([ 1613 "apiSupportContact", 1614 0, 1615 apiSupportContact, 1616 "apiSupportSubscribeNewsletter", 1617 0, 1618 apiSupportSubscribeNewsletter 1619]); 1620}), 1621397126, ((__turbopack_context__) => { 1622"use strict"; 1623 1624/*! 1625* tabbable 6.4.0 1626* @license MIT, https://github.com/focus-trap/tabbable/blob/master/LICENSE 1627*/ // NOTE: separate `:not()` selectors has broader browser support than the newer 1628// `:not([inert], [inert] *)` (Feb 2023) 1629var candidateSelectors = [ 1630 'input:not([inert]):not([inert] *)', 1631 'select:not([inert]):not([inert] *)', 1632 'textarea:not([inert]):not([inert] *)', 1633 'a[href]:not([inert]):not([inert] *)', 1634 'button:not([inert]):not([inert] *)', 1635 '[tabindex]:not(slot):not([inert]):not([inert] *)', 1636 'audio[controls]:not([inert]):not([inert] *)', 1637 'video[controls]:not([inert]):not([inert] *)', 1638 '[contenteditable]:not([contenteditable="false"]):not([inert]):not([inert] *)', 1639 'details>summary:first-of-type:not([inert]):not([inert] *)', 1640 'details:not([inert]):not([inert] *)' 1641]; 1642var candidateSelector = /* #__PURE__ */ candidateSelectors.join(','); 1643var NoElement = typeof Element === 'undefined'; 1644var matches = NoElement ? function() {} : Element.prototype.matches || Element.prototype.msMatchesSelector || Element.prototype.webkitMatchesSelector; 1645var getRootNode = !NoElement && Element.prototype.getRootNode ? function(element) { 1646 var _element$getRootNode; 1647 return element === null || element === void 0 ? void 0 : (_element$getRootNode = element.getRootNode) === null || _element$getRootNode === void 0 ? void 0 : _element$getRootNode.call(element); 1648} : function(element) { 1649 return element === null || element === void 0 ? void 0 : element.ownerDocument; 1650}; 1651/** 1652 * Determines if a node is inert or in an inert ancestor. 1653 * @param {Node} [node] 1654 * @param {boolean} [lookUp] If true and `node` is not inert, looks up at ancestors to 1655 * see if any of them are inert. If false, only `node` itself is considered. 1656 * @returns {boolean} True if inert itself or by way of being in an inert ancestor. 1657 * False if `node` is falsy. 1658 */ var _isInert = function isInert(node, lookUp) { 1659 var _node$getAttribute; 1660 if (lookUp === void 0) { 1661 lookUp = true; 1662 } 1663 // CAREFUL: JSDom does not support inert at all, so we can't use the `HTMLElement.inert` 1664 // JS API property; we have to check the attribute, which can either be empty or 'true'; 1665 // if it's `null` (not specified) or 'false', it's an active element 1666 var inertAtt = node === null || node === void 0 ? void 0 : (_node$getAttribute = n
vendor: 27,212 bytes, lines 1666-2195
1666ode.getAttribute) === null || _node$getAttribute === void 0 ? void 0 : _node$getAttribute.call(node, 'inert'); 1667 var inert = inertAtt === '' || inertAtt === 'true'; 1668 // NOTE: this could also be handled with `node.matches('[inert], :is([inert] *)')` 1669 // if it weren't for `matches()` not being a function on shadow roots; the following 1670 // code works for any kind of node 1671 var result = inert || lookUp && node && (// closest does not exist on shadow roots, so we fall back to a manual 1672 // lookup upward, in case it is not defined. 1673 typeof node.closest === 'function' ? node.closest('[inert]') : _isInert(node.parentNode)); 1674 return result; 1675}; 1676/** 1677 * Determines if a node's content is editable. 1678 * @param {Element} [node] 1679 * @returns True if it's content-editable; false if it's not or `node` is falsy. 1680 */ var isContentEditable = function isContentEditable(node) { 1681 var _node$getAttribute2; 1682 // CAREFUL: JSDom does not support the `HTMLElement.isContentEditable` API so we have 1683 // to use the attribute directly to check for this, which can either be empty or 'true'; 1684 // if it's `null` (not specified) or 'false', it's a non-editable element 1685 var attValue = node === null || node === void 0 ? void 0 : (_node$getAttribute2 = node.getAttribute) === null || _node$getAttribute2 === void 0 ? void 0 : _node$getAttribute2.call(node, 'contenteditable'); 1686 return attValue === '' || attValue === 'true'; 1687}; 1688/** 1689 * @param {Element} el container to check in 1690 * @param {boolean} includeContainer add container to check 1691 * @param {(node: Element) => boolean} filter filter candidates 1692 * @returns {Element[]} 1693 */ var getCandidates = function getCandidates(el, includeContainer, filter) { 1694 // even if `includeContainer=false`, we still have to check it for inertness because 1695 // if it's inert (either by itself or via its parent), then all its children are inert 1696 if (_isInert(el)) { 1697 return []; 1698 } 1699 var candidates = Array.prototype.slice.apply(el.querySelectorAll(candidateSelector)); 1700 if (includeContainer && matches.call(el, candidateSelector)) { 1701 candidates.unshift(el); 1702 } 1703 candidates = candidates.filter(filter); 1704 return candidates; 1705}; 1706/** 1707 * @callback GetShadowRoot 1708 * @param {Element} element to check for shadow root 1709 * @returns {ShadowRoot|boolean} ShadowRoot if available or boolean indicating if a shadowRoot is attached but not available. 1710 */ /** 1711 * @callback ShadowRootFilter 1712 * @param {Element} shadowHostNode the element which contains shadow content 1713 * @returns {boolean} true if a shadow root could potentially contain valid candidates. 1714 */ /** 1715 * @typedef {Object} CandidateScope 1716 * @property {Element} scopeParent contains inner candidates 1717 * @property {Element[]} candidates list of candidates found in the scope parent 1718 */ /** 1719 * @typedef {Object} IterativeOptions 1720 * @property {GetShadowRoot|boolean} getShadowRoot true if shadow support is enabled; falsy if not; 1721 * if a function, implies shadow support is enabled and either returns the shadow root of an element 1722 * or a boolean stating if it has an undisclosed shadow root 1723 * @property {(node: Element) => boolean} filter filter candidates 1724 * @property {boolean} flatten if true then result will flatten any CandidateScope into the returned list 1725 * @property {ShadowRootFilter} shadowRootFilter filter shadow roots; 1726 */ /** 1727 * @param {Element[]} elements list of element containers to match candidates from 1728 * @param {boolean} includeContainer add container list to check 1729 * @param {IterativeOptions} options 1730 * @returns {Array.<Element|CandidateScope>} 1731 */ var _getCandidatesIteratively = function getCandidatesIteratively(elements, includeContainer, options) { 1732 var candidates = []; 1733 var elementsToCheck = Array.from(elements); 1734 while(elementsToCheck.length){ 1735 var element = elementsToCheck.shift(); 1736 if (_isInert(element, false)) { 1737 continue; 1738 } 1739 if (element.tagName === 'SLOT') { 1740 // add shadow dom slot scope (slot itself cannot be focusable) 1741 var assigned = element.assignedElements(); 1742 var content = assigned.length ? assigned : element.children; 1743 var nestedCandidates = _getCandidatesIteratively(content, true, options); 1744 if (options.flatten) { 1745 candidates.push.apply(candidates, nestedCandidates); 1746 } else { 1747 candidates.push({ 1748 scopeParent: element, 1749 candidates: nestedCandidates 1750 }); 1751 } 1752 } else { 1753 // check candidate element 1754 var validCandidate = matches.call(element, candidateSelector); 1755 if (validCandidate && options.filter(element) && (includeContainer || !elements.includes(element))) { 1756 candidates.push(element); 1757 } 1758 // iterate over shadow content if possible 1759 var shadowRoot = element.shadowRoot || // check for an undisclosed shadow 1760 typeof options.getShadowRoot === 'function' && options.getShadowRoot(element); 1761 // no inert look up because we're already drilling down and checking for inertness 1762 // on the way down, so all containers to this root node should have already been 1763 // vetted as non-inert 1764 var validShadowRoot = !_isInert(shadowRoot, false) && (!options.shadowRootFilter || options.shadowRootFilter(element)); 1765 if (shadowRoot && validShadowRoot) { 1766 // add shadow dom scope IIF a shadow root node was given; otherwise, an undisclosed 1767 // shadow exists, so look at light dom children as fallback BUT create a scope for any 1768 // child candidates found because they're likely slotted elements (elements that are 1769 // children of the web component element (which has the shadow), in the light dom, but 1770 // slotted somewhere _inside_ the undisclosed shadow) -- the scope is created below, 1771 // _after_ we return from this recursive call 1772 var _nestedCandidates = _getCandidatesIteratively(shadowRoot === true ? element.children : shadowRoot.children, true, options); 1773 if (options.flatten) { 1774 candidates.push.apply(candidates, _nestedCandidates); 1775 } else { 1776 candidates.push({ 1777 scopeParent: element, 1778 candidates: _nestedCandidates 1779 }); 1780 } 1781 } else { 1782 // there's not shadow so just dig into the element's (light dom) children 1783 // __without__ giving the element special scope treatment 1784 elementsToCheck.unshift.apply(elementsToCheck, element.children); 1785 } 1786 } 1787 } 1788 return candidates; 1789}; 1790/** 1791 * @private 1792 * Determines if the node has an explicitly specified `tabindex` attribute. 1793 * @param {HTMLElement} node 1794 * @returns {boolean} True if so; false if not. 1795 */ var hasTabIndex = function hasTabIndex(node) { 1796 return !isNaN(parseInt(node.getAttribute('tabindex'), 10)); 1797}; 1798/** 1799 * Determine the tab index of a given node. 1800 * @param {HTMLElement} node 1801 * @returns {number} Tab order (negative, 0, or positive number). 1802 * @throws {Error} If `node` is falsy. 1803 */ var getTabIndex = function getTabIndex(node) { 1804 if (!node) { 1805 throw new Error('No node provided'); 1806 } 1807 if (node.tabIndex < 0) { 1808 // in Chrome, <details/>, <audio controls/> and <video controls/> elements get a default 1809 // `tabIndex` of -1 when the 'tabindex' attribute isn't specified in the DOM, 1810 // yet they are still part of the regular tab order; in FF, they get a default 1811 // `tabIndex` of 0; since Chrome still puts those elements in the regular tab 1812 // order, consider their tab index to be 0. 1813 // Also browsers do not return `tabIndex` correctly for contentEditable nodes; 1814 // so if they don't have a tabindex attribute specifically set, assume it's 0. 1815 if ((/^(AUDIO|VIDEO|DETAILS)$/.test(node.tagName) || isContentEditable(node)) && !hasTabIndex(node)) { 1816 return 0; 1817 } 1818 } 1819 return node.tabIndex; 1820}; 1821/** 1822 * Determine the tab index of a given node __for sort order purposes__. 1823 * @param {HTMLElement} node 1824 * @param {boolean} [isScope] True for a custom element with shadow root or slot that, by default, 1825 * has tabIndex -1, but needs to be sorted by document order in order for its content to be 1826 * inserted into the correct sort position. 1827 * @returns {number} Tab order (negative, 0, or positive number). 1828 */ var getSortOrderTabIndex = function getSortOrderTabIndex(node, isScope) { 1829 var tabIndex = getTabIndex(node); 1830 if (tabIndex < 0 && isScope && !hasTabIndex(node)) { 1831 return 0; 1832 } 1833 return tabIndex; 1834}; 1835var sortOrderedTabbables = function sortOrderedTabbables(a, b) { 1836 return a.tabIndex === b.tabIndex ? a.documentOrder - b.documentOrder : a.tabIndex - b.tabIndex; 1837}; 1838var isInput = function isInput(node) { 1839 return node.tagName === 'INPUT'; 1840}; 1841var isHiddenInput = function isHiddenInput(node) { 1842 return isInput(node) && node.type === 'hidden'; 1843}; 1844var isDetailsWithSummary = function isDetailsWithSummary(node) { 1845 var r = node.tagName === 'DETAILS' && Array.prototype.slice.apply(node.children).some(function(child) { 1846 return child.tagName === 'SUMMARY'; 1847 }); 1848 return r; 1849}; 1850var getCheckedRadio = function getCheckedRadio(nodes, form) { 1851 for(var i = 0; i < nodes.length; i++){ 1852 if (nodes[i].checked && nodes[i].form === form) { 1853 return nodes[i]; 1854 } 1855 } 1856}; 1857var isTabbableRadio = function isTabbableRadio(node) { 1858 if (!node.name) { 1859 return true; 1860 } 1861 var radioScope = node.form || getRootNode(node); 1862 var queryRadios = function queryRadios(name) { 1863 return radioScope.querySelectorAll('input[type="radio"][name="' + name + '"]'); 1864 }; 1865 var radioSet; 1866 if (typeof window !== 'undefined' && typeof window.CSS !== 'undefined' && typeof window.CSS.escape === 'function') { 1867 radioSet = queryRadios(window.CSS.escape(node.name)); 1868 } else { 1869 try { 1870 radioSet = queryRadios(node.name); 1871 } catch (err) { 1872 // eslint-disable-next-line no-console 1873 console.error('Looks like you have a radio button with a name attribute containing invalid CSS selector characters and need the CSS.escape polyfill: %s', err.message); 1874 return false; 1875 } 1876 } 1877 var checked = getCheckedRadio(radioSet, node.form); 1878 return !checked || checked === node; 1879}; 1880var isRadio = function isRadio(node) { 1881 return isInput(node) && node.type === 'radio'; 1882}; 1883var isNonTabbableRadio = function isNonTabbableRadio(node) { 1884 return isRadio(node) && !isTabbableRadio(node); 1885}; 1886// determines if a node is ultimately attached to the window's document 1887var isNodeAttached = function isNodeAttached(node) { 1888 var _nodeRoot; 1889 // The root node is the shadow root if the node is in a shadow DOM; some document otherwise 1890 // (but NOT _the_ document; see second 'If' comment below for more). 1891 // If rootNode is shadow root, it'll have a host, which is the element to which the shadow 1892 // is attached, and the one we need to check if it's in the document or not (because the 1893 // shadow, and all nodes it contains, is never considered in the document since shadows 1894 // behave like self-contained DOMs; but if the shadow's HOST, which is part of the document, 1895 // is hidden, or is not in the document itself but is detached, it will affect the shadow's 1896 // visibility, including all the nodes it contains). The host could be any normal node, 1897 // or a custom element (i.e. web component). Either way, that's the one that is considered 1898 // part of the document, not the shadow root, nor any of its children (i.e. the node being 1899 // tested). 1900 // To further complicate things, we have to look all the way up until we find a shadow HOST 1901 // that is attached (or find none) because the node might be in nested shadows... 1902 // If rootNode is not a shadow root, it won't have a host, and so rootNode should be the 1903 // document (per the docs) and while it's a Document-type object, that document does not 1904 // appear to be the same as the node's `ownerDocument` for some reason, so it's safer 1905 // to ignore the rootNode at this point, and use `node.ownerDocument`. Otherwise, 1906 // using `rootNode.contains(node)` will _always_ be true we'll get false-positives when 1907 // node is actually detached. 1908 // NOTE: If `nodeRootHost` or `node` happens to be the `document` itself (which is possible 1909 // if a tabbable/focusable node was quickly added to the DOM, focused, and then removed 1910 // from the DOM as in https://github.com/focus-trap/focus-trap-react/issues/905), then 1911 // `ownerDocument` will be `null`, hence the optional chaining on it. 1912 var nodeRoot = node && getRootNode(node); 1913 var nodeRootHost = (_nodeRoot = nodeRoot) === null || _nodeRoot === void 0 ? void 0 : _nodeRoot.host; 1914 // in some cases, a detached node will return itself as the root instead of a document or 1915 // shadow root object, in which case, we shouldn't try to look further up the host chain 1916 var attached = false; 1917 if (nodeRoot && nodeRoot !== node) { 1918 var _nodeRootHost, _nodeRootHost$ownerDo, _node$ownerDocument; 1919 attached = !!((_nodeRootHost = nodeRootHost) !== null && _nodeRootHost !== void 0 && (_nodeRootHost$ownerDo = _nodeRootHost.ownerDocument) !== null && _nodeRootHost$ownerDo !== void 0 && _nodeRootHost$ownerDo.contains(nodeRootHost) || node !== null && node !== void 0 && (_node$ownerDocument = node.ownerDocument) !== null && _node$ownerDocument !== void 0 && _node$ownerDocument.contains(node)); 1920 while(!attached && nodeRootHost){ 1921 var _nodeRoot2, _nodeRootHost2, _nodeRootHost2$ownerD; 1922 // since it's not attached and we have a root host, the node MUST be in a nested shadow DOM, 1923 // which means we need to get the host's host and check if that parent host is contained 1924 // in (i.e. attached to) the document 1925 nodeRoot = getRootNode(nodeRootHost); 1926 nodeRootHost = (_nodeRoot2 = nodeRoot) === null || _nodeRoot2 === void 0 ? void 0 : _nodeRoot2.host; 1927 attached = !!((_nodeRootHost2 = nodeRootHost) !== null && _nodeRootHost2 !== void 0 && (_nodeRootHost2$ownerD = _nodeRootHost2.ownerDocument) !== null && _nodeRootHost2$ownerD !== void 0 && _nodeRootHost2$ownerD.contains(nodeRootHost)); 1928 } 1929 } 1930 return attached; 1931}; 1932var isZeroArea = function isZeroArea(node) { 1933 var _node$getBoundingClie = node.getBoundingClientRect(), width = _node$getBoundingClie.width, height = _node$getBoundingClie.height; 1934 return width === 0 && height === 0; 1935}; 1936var isHidden = function isHidden(node, _ref) { 1937 var displayCheck = _ref.displayCheck, getShadowRoot = _ref.getShadowRoot; 1938 if (displayCheck === 'full-native') { 1939 if ('checkVisibility' in node) { 1940 // Chrome >= 105, Edge >= 105, Firefox >= 106, Safari >= 17.4 1941 // @see https://developer.mozilla.org/en-US/docs/Web/API/Element/checkVisibility#browser_compatibility 1942 var visible = node.checkVisibility({ 1943 // Checking opacity might be desirable for some use cases, but natively, 1944 // opacity zero elements _are_ focusable and tabbable. 1945 checkOpacity: false, 1946 opacityProperty: false, 1947 contentVisibilityAuto: true, 1948 visibilityProperty: true, 1949 // This is an alias for `visibilityProperty`. Contemporary browsers 1950 // support both. However, this alias has wider browser support (Chrome 1951 // >= 105 and Firefox >= 106, vs. Chrome >= 121 and Firefox >= 122), so 1952 // we include it anyway. 1953 checkVisibilityCSS: true 1954 }); 1955 return !visible; 1956 } 1957 // Fall through to manual visibility checks 1958 } 1959 // NOTE: visibility will be `undefined` if node is detached from the document 1960 // (see notes about this further down), which means we will consider it visible 1961 // (this is legacy behavior from a very long way back) 1962 // NOTE: we check this regardless of `displayCheck="none"` because this is a 1963 // _visibility_ check, not a _display_ check 1964 if (getComputedStyle(node).visibility === 'hidden') { 1965 return true; 1966 } 1967 var isDirectSummary = matches.call(node, 'details>summary:first-of-type'); 1968 var nodeUnderDetails = isDirectSummary ? node.parentElement : node; 1969 if (matches.call(nodeUnderDetails, 'details:not([open]) *')) { 1970 return true; 1971 } 1972 if (!displayCheck || displayCheck === 'full' || // full-native can run this branch when it falls through in case 1973 // Element#checkVisibility is unsupported 1974 displayCheck === 'full-native' || displayCheck === 'legacy-full') { 1975 if (typeof getShadowRoot === 'function') { 1976 // figure out if we should consider the node to be in an undisclosed shadow and use the 1977 // 'non-zero-area' fallback 1978 var originalNode = node; 1979 while(node){ 1980 var parentElement = node.parentElement; 1981 var rootNode = getRootNode(node); 1982 if (parentElement && !parentElement.shadowRoot && getShadowRoot(parentElement) === true // check if there's an undisclosed shadow 1983 ) { 1984 // node has an undisclosed shadow which means we can only treat it as a black box, so we 1985 // fall back to a non-zero-area test 1986 return isZeroArea(node); 1987 } else if (node.assignedSlot) { 1988 // iterate up slot 1989 node = node.assignedSlot; 1990 } else if (!parentElement && rootNode !== node.ownerDocument) { 1991 // cross shadow boundary 1992 node = rootNode.host; 1993 } else { 1994 // iterate up normal dom 1995 node = parentElement; 1996 } 1997 } 1998 node = originalNode; 1999 } 2000 // else, `getShadowRoot` might be true, but all that does is enable shadow DOM support 2001 // (i.e. it does not also presume that all nodes might have undisclosed shadows); or 2002 // it might be a falsy value, which means shadow DOM support is disabled 2003 // Since we didn't find it sitting in an undisclosed shadow (or shadows are disabled) 2004 // now we can just test to see if it would normally be visible or not, provided it's 2005 // attached to the main document. 2006 // NOTE: We must consider case where node is inside a shadow DOM and given directly to 2007 // `isTabbable()` or `isFocusable()` -- regardless of `getShadowRoot` option setting. 2008 if (isNodeAttached(node)) { 2009 // this works wherever the node is: if there's at least one client rect, it's 2010 // somehow displayed; it also covers the CSS 'display: contents' case where the 2011 // node itself is hidden in place of its contents; and there's no need to search 2012 // up the hierarchy either 2013 return !node.getClientRects().length; 2014 } 2015 // Else, the node isn't attached to the document, which means the `getClientRects()` 2016 // API will __always__ return zero rects (this can happen, for example, if React 2017 // is used to render nodes onto a detached tree, as confirmed in this thread: 2018 // https://github.com/facebook/react/issues/9117#issuecomment-284228870) 2019 // 2020 // It also means that even window.getComputedStyle(node).display will return `undefined` 2021 // because styles are only computed for nodes that are in the document. 2022 // 2023 // NOTE: THIS HAS BEEN THE CASE FOR YEARS. It is not new, nor is it caused by tabbable 2024 // somehow. Though it was never stated officially, anyone who has ever used tabbable 2025 // APIs on nodes in detached containers has actually implicitly used tabbable in what 2026 // was later (as of v5.2.0 on Apr 9, 2021) called `displayCheck="none"` mode -- essentially 2027 // considering __everything__ to be visible because of the innability to determine styles. 2028 // 2029 // v6.0.0: As of this major release, the default 'full' option __no longer treats detached 2030 // nodes as visible with the 'none' fallback.__ 2031 if (displayCheck !== 'legacy-full') { 2032 return true; // hidden 2033 } 2034 // else, fallback to 'none' mode and consider the node visible 2035 } else if (displayCheck === 'non-zero-area') { 2036 // NOTE: Even though this tests that the node's client rect is non-zero to determine 2037 // whether it's displayed, and that a detached node will __always__ have a zero-area 2038 // client rect, we don't special-case for whether the node is attached or not. In 2039 // this mode, we do want to consider nodes that have a zero area to be hidden at all 2040 // times, and that includes attached or not. 2041 return isZeroArea(node); 2042 } 2043 // visible, as far as we can tell, or per current `displayCheck=none` mode, we assume 2044 // it's visible 2045 return false; 2046}; 2047// form fields (nested) inside a disabled fieldset are not focusable/tabbable 2048// unless they are in the _first_ <legend> element of the top-most disabled 2049// fieldset 2050var isDisabledFromFieldset = function isDisabledFromFieldset(node) { 2051 if (/^(INPUT|BUTTON|SELECT|TEXTAREA)$/.test(node.tagName)) { 2052 var parentNode = node.parentElement; 2053 // check if `node` is contained in a disabled <fieldset> 2054 while(parentNode){ 2055 if (parentNode.tagName === 'FIELDSET' && parentNode.disabled) { 2056 // look for the first <legend> among the children of the disabled <fieldset> 2057 for(var i = 0; i < parentNode.children.length; i++){ 2058 var child = parentNode.children.item(i); 2059 // when the first <legend> (in document order) is found 2060 if (child.tagName === 'LEGEND') { 2061 // if its parent <fieldset> is not nested in another disabled <fieldset>, 2062 // return whether `node` is a descendant of its first <legend> 2063 return matches.call(parentNode, 'fieldset[disabled] *') ? true : !child.contains(node); 2064 } 2065 } 2066 // the disabled <fieldset> containing `node` has no <legend> 2067 return true; 2068 } 2069 parentNode = parentNode.parentElement; 2070 } 2071 } 2072 // else, node's tabbable/focusable state should not be affected by a fieldset's 2073 // enabled/disabled state 2074 return false; 2075}; 2076var isNodeMatchingSelectorFocusable = function isNodeMatchingSelectorFocusable(options, node) { 2077 if (node.disabled || isHiddenInput(node) || isHidden(node, options) || // For a details element with a summary, the summary element gets the focus 2078 isDetailsWithSummary(node) || isDisabledFromFieldset(node)) { 2079 return false; 2080 } 2081 return true; 2082}; 2083var isNodeMatchingSelectorTabbable = function isNodeMatchingSelectorTabbable(options, node) { 2084 if (isNonTabbableRadio(node) || getTabIndex(node) < 0 || !isNodeMatchingSelectorFocusable(options, node)) { 2085 return false; 2086 } 2087 return true; 2088}; 2089var isShadowRootTabbable = function isShadowRootTabbable(shadowHostNode) { 2090 var tabIndex = parseInt(shadowHostNode.getAttribute('tabindex'), 10); 2091 if (isNaN(tabIndex) || tabIndex >= 0) { 2092 return true; 2093 } 2094 // If a custom element has an explicit negative tabindex, 2095 // browsers will not allow tab targeting said element's children. 2096 return false; 2097}; 2098/** 2099 * @param {Array.<Element|CandidateScope>} candidates 2100 * @returns Element[] 2101 */ var _sortByOrder = function sortByOrder(candidates) { 2102 var regularTabbables = []; 2103 var orderedTabbables = []; 2104 candidates.forEach(function(item, i) { 2105 var isScope = !!item.scopeParent; 2106 var element = isScope ? item.scopeParent : item; 2107 var candidateTabindex = getSortOrderTabIndex(element, isScope); 2108 var elements = isScope ? _sortByOrder(item.candidates) : element; 2109 if (candidateTabindex === 0) { 2110 isScope ? regularTabbables.push.apply(regularTabbables, elements) : regularTabbables.push(element); 2111 } else { 2112 orderedTabbables.push({ 2113 documentOrder: i, 2114 tabIndex: candidateTabindex, 2115 item: item, 2116 isScope: isScope, 2117 content: elements 2118 }); 2119 } 2120 }); 2121 return orderedTabbables.sort(sortOrderedTabbables).reduce(function(acc, sortable) { 2122 sortable.isScope ? acc.push.apply(acc, sortable.content) : acc.push(sortable.content); 2123 return acc; 2124 }, []).concat(regularTabbables); 2125}; 2126var tabbable = function tabbable(container, options) { 2127 options = options || {}; 2128 var candidates; 2129 if (options.getShadowRoot) { 2130 candidates = _getCandidatesIteratively([ 2131 container 2132 ], options.includeContainer, { 2133 filter: isNodeMatchingSelectorTabbable.bind(null, options), 2134 flatten: false, 2135 getShadowRoot: options.getShadowRoot, 2136 shadowRootFilter: isShadowRootTabbable 2137 }); 2138 } else { 2139 candidates = getCandidates(container, options.includeContainer, isNodeMatchingSelectorTabbable.bind(null, options)); 2140 } 2141 return _sortByOrder(candidates); 2142}; 2143var focusable = function focusable(container, options) { 2144 options = options || {}; 2145 var candidates; 2146 if (options.getShadowRoot) { 2147 candidates = _getCandidatesIteratively([ 2148 container 2149 ], options.includeContainer, { 2150 filter: isNodeMatchingSelectorFocusable.bind(null, options), 2151 flatten: true, 2152 getShadowRoot: options.getShadowRoot 2153 }); 2154 } else { 2155 candidates = getCandidates(container, options.includeContainer, isNodeMatchingSelectorFocusable.bind(null, options)); 2156 } 2157 return candidates; 2158}; 2159var isTabbable = function isTabbable(node, options) { 2160 options = options || {}; 2161 if (!node) { 2162 throw new Error('No node provided'); 2163 } 2164 if (matches.call(node, candidateSelector) === false) { 2165 return false; 2166 } 2167 return isNodeMatchingSelectorTabbable(options, node); 2168}; 2169var focusableCandidateSelector = /* #__PURE__ */ candidateSelectors.concat('iframe:not([inert]):not([inert] *)').join(','); 2170var isFocusable = function isFocusable(node, options) { 2171 options = options || {}; 2172 if (!node) { 2173 throw new Error('No node provided'); 2174 } 2175 if (matches.call(node, focusableCandidateSelector) === false) { 2176 return false; 2177 } 2178 return isNodeMatchingSelectorFocusable(options, node); 2179}; 2180; 2181__turbopack_context__.s([ 2182 "focusable", 2183 0, 2184 focusable, 2185 "isTabbable", 2186 0, 2187 isTabbable, 2188 "tabbable", 2189 0, 2190 tabbable 2191]); 2192}), 2193]); 2194 2195//# debugId=b0465181-0754-5fb3-7f45-4c57f8fdfe36
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.