You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
22 lines
215 KiB
22 lines
215 KiB
2 years ago
|
/*!
|
||
|
* html2canvas 1.4.1 <https://html2canvas.hertzen.com>
|
||
|
* Copyright (c) 2022 Niklas von Hertzen <https://hertzen.com>
|
||
|
* Released under MIT License
|
||
|
*/
|
||
|
!function (A, e) { "object" == typeof exports && "undefined" != typeof module ? module.exports = e() : "function" == typeof define && define.amd ? define(e) : (A = "undefined" != typeof globalThis ? globalThis : A || self).html2canvas = e() }(this, function () {
|
||
|
"use strict";
|
||
|
/*! *****************************************************************************
|
||
|
Copyright (c) Microsoft Corporation.
|
||
|
|
||
|
Permission to use, copy, modify, and/or distribute this software for any
|
||
|
purpose with or without fee is hereby granted.
|
||
|
|
||
|
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
|
||
|
REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
|
||
|
AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
|
||
|
INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
|
||
|
LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
|
||
|
OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
|
||
|
PERFORMANCE OF THIS SOFTWARE.
|
||
|
***************************************************************************** */var r = function (A, e) { return (r = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function (A, e) { A.__proto__ = e } || function (A, e) { for (var t in e) Object.prototype.hasOwnProperty.call(e, t) && (A[t] = e[t]) })(A, e) }; function A (A, e) { if ("function" != typeof e && null !== e) throw new TypeError("Class extends value " + String(e) + " is not a constructor or null"); function t () { this.constructor = A } r(A, e), A.prototype = null === e ? Object.create(e) : (t.prototype = e.prototype, new t) } var h = function () { return (h = Object.assign || function (A) { for (var e, t = 1, r = arguments.length; t < r; t++)for (var B in e = arguments[t]) Object.prototype.hasOwnProperty.call(e, B) && (A[B] = e[B]); return A }).apply(this, arguments) }; function a (A, s, o, i) { return new (o = o || Promise)(function (t, e) { function r (A) { try { n(i.next(A)) } catch (A) { e(A) } } function B (A) { try { n(i.throw(A)) } catch (A) { e(A) } } function n (A) { var e; A.done ? t(A.value) : ((e = A.value) instanceof o ? e : new o(function (A) { A(e) })).then(r, B) } n((i = i.apply(A, s || [])).next()) }) } function H (t, r) { var B, n, s, o = { label: 0, sent: function () { if (1 & s[0]) throw s[1]; return s[1] }, trys: [], ops: [] }, A = { next: e(0), throw: e(1), return: e(2) }; return "function" == typeof Symbol && (A[Symbol.iterator] = function () { return this }), A; function e (e) { return function (A) { return function (e) { if (B) throw new TypeError("Generator is already executing."); for (; o;)try { if (B = 1, n && (s = 2 & e[0] ? n.return : e[0] ? n.throw || ((s = n.return) && s.call(n), 0) : n.next) && !(s = s.call(n, e[1])).done) return s; switch (n = 0, (e = s ? [2 & e[0], s.value] : e)[0]) { case 0: case 1: s = e; break; case 4: return o.label++, { value: e[1], done: !1 }; case 5: o.label++, n = e[1], e = [0]; continue; case 7: e = o.ops.pop(), o.trys.pop(); continue; default: if (!(s = 0 < (s = o.trys).length && s[s.length - 1]) && (6 === e[0] || 2 === e[0])) { o = 0; continue } if (3 === e[0] && (!s || e[1] > s[0] && e[1] < s[3])) { o.label = e[1]; break } if (6 === e[0] && o.label < s[1]) { o.label = s[1], s = e; break } if (s && o.label < s[2]) { o.label = s[2], o.ops.push(e); break } s[2] && o.ops.pop(), o.trys.pop(); continue }e = r.call(t, o) } catch (A) { e = [6, A], n = 0 } finally { B = s = 0 } if (5 & e[0]) throw e[1]; return { value: e[0] ? e[1] : void 0, done: !0 } }([e, A]) } } } function t (A, e, t) { if (t || 2 === arguments.length) for (var r, B = 0, n = e.length; B < n; B++)!r && B in e || ((r = r || Array.prototype.slice.call(e, 0, B))[B] = e[B]); return A.concat(r || e) } var d = (B.prototype.add = function (A, e, t, r) { return new B(this.left + A, this.top + e, this.width + t, this.height + r) }, B.fromClientRect = function (A, e) { return new B(e.left + A.windowBounds.left, e.top + A.windowBounds.top, e.width, e.height) }, B.fromDOMRectList = function (A, e) { e = Array.from(e).find(function (A) { return 0 !== A.width }); return e ? new B(e.left + A.windowBounds.left, e.top + A.windowBounds.top, e.width, e.height) : B.EMPTY }, B.EMPTY = new B(0, 0, 0, 0), B); function B (A, e, t, r) { this.left = A, this.top = e, this.width = t, this.height = r } for (var f = function (A, e) { return d.fromClientRect(A, e.getBoundingClientRect()) }, Q = function (A) { for (var e = [], t = 0, r = A.length; t < r;) { var B, n = A.charCodeAt(t++); 55296 <= n && n <= 56319 && t < r ? 56320 == (64512 & (B = A.charCodeAt(t++))) ? e.push(((1023 & n) << 10) + (1023 & B) + 65536) : (e.push(n), t--) : e.push(n) } return e }, g = function () { for (var A = [], e = 0; e < arguments.length; e++)A[e] = arguments[e]; if (String.fromCodePoint) return String.fromCodePoint.apply(String, A); var t = A.length; if (!t) return ""; for (var r = [], B = -1, n = ""; ++B < t;) { var s = A[B]; s <= 65535 ? r.push(s) : (s -= 65536, r.push(55296 + (s >> 10), s % 1024 + 56320)), (B + 1 === t || 16384 < r.length) && (n += String.fromC
|
||
|
});
|