You cannot 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
179 KiB
JavaScript
22 lines
179 KiB
JavaScript
2 months ago
|
/*!
|
||
|
* html2canvas 1.0.0-rc.5 <https://html2canvas.hertzen.com>
|
||
|
* Copyright (c) 2019 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 = A || self).html2canvas = e() }(this, function () {
|
||
|
"use strict";
|
||
|
/*! *****************************************************************************
|
||
|
Copyright (c) Microsoft Corporation. All rights reserved.
|
||
|
Licensed under the Apache License, Version 2.0 (the "License"); you may not use
|
||
|
this file except in compliance with the License. You may obtain a copy of the
|
||
|
License at http://www.apache.org/licenses/LICENSE-2.0
|
||
|
|
||
|
THIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
|
||
|
KIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED
|
||
|
WARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,
|
||
|
MERCHANTABLITY OR NON-INFRINGEMENT.
|
||
|
|
||
|
See the Apache Version 2.0 License for specific language governing permissions
|
||
|
and limitations under the License.
|
||
|
***************************************************************************** */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) e.hasOwnProperty(t) && (A[t] = e[t]) })(A, e) }; function A(A, e) { function t() { this.constructor = A } r(A, e), A.prototype = null === e ? Object.create(e) : (t.prototype = e.prototype, new t) } var K = function () { return (K = Object.assign || function (A) { for (var e, t = 1, r = arguments.length; t < r; t++)for (var n in e = arguments[t]) Object.prototype.hasOwnProperty.call(e, n) && (A[n] = e[n]); return A }).apply(this, arguments) }; function a(B, s, o, i) { return new (o || (o = Promise))(function (A, e) { function t(A) { try { n(i.next(A)) } catch (A) { e(A) } } function r(A) { try { n(i.throw(A)) } catch (A) { e(A) } } function n(e) { e.done ? A(e.value) : new o(function (A) { A(e.value) }).then(t, r) } n((i = i.apply(B, s || [])).next()) }) } function S(t, r) { var n, B, s, A, o = { label: 0, sent: function () { if (1 & s[0]) throw s[1]; return s[1] }, trys: [], ops: [] }; return A = { next: e(0), throw: e(1), return: e(2) }, "function" == typeof Symbol && (A[Symbol.iterator] = function () { return this }), A; function e(e) { return function (A) { return function (e) { if (n) throw new TypeError("Generator is already executing."); for (; o;)try { if (n = 1, B && (s = 2 & e[0] ? B.return : e[0] ? B.throw || ((s = B.return) && s.call(B), 0) : B.next) && !(s = s.call(B, e[1])).done) return s; switch (B = 0, s && (e = [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++ , B = 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], B = 0 } finally { n = s = 0 } if (5 & e[0]) throw e[1]; return { value: e[0] ? e[1] : void 0, done: !0 } }([e, A]) } } } var I = (n.prototype.add = function (A, e, t, r) { return new n(this.left + A, this.top + e, this.width + t, this.height + r) }, n.fromClientRect = function (A) { return new n(A.left, A.top, A.width, A.height) }, n); function n(A, e, t, r) { this.left = A, this.top = e, this.width = t, this.height = r } for (var T = function (A) { return I.fromClientRect(A.getBoundingClientRect()) }, c = function (A) { for (var e = [], t = 0, r = A.length; t < r;) { var n = A.charCodeAt(t++); if (55296 <= n && n <= 56319 && t < r) { var B = A.charCodeAt(t++); 56320 == (64512 & B) ? e.push(((1023 & n) << 10) + (1023 & B) + 65536) : (e.push(n), t--) } else e.push(n) } return e }, l = 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 = [], n = -1, B = ""; ++n < t;) { var s = A[n]; s <= 65535 ? r.push(s) : (s -= 65536, r.push(55296 + (s >> 10), s % 1024 + 56320)), (n + 1 === t || 16384 < r.length) && (B += String.fromCharCode.apply(String, r), r.length = 0) } return B }, e = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", Q = "undefined" == typeof Uint8Array ? [] : new Uint8Array(256), t = 0; t < e.length; t++)Q[e.charCodeAt(t)] = t; function B(A, e, t) { return A.slice ? A.slice(e, t) : new Uint16Array(Array.prototype.slice.call(A, e, t)) } var s = (o.prototype.get = function (A) { var e; if (0 <= A) { if (A < 55296 || 56319 < A && A <= 65535) return e = ((e = this.index[A >> 5]) << 2) + (31 & A), this.data[e]; if (A <= 65535) return e = ((e = this.index[2048 + (A - 55296 >> 5)]) << 2) + (31 & A), this.data[e]; if (A < this.highStart) return e = 2080 + (A >>
|
||
|
});
|