var __getOwnPropNames = Object.getOwnPropertyNames; var __commonJS = (cb, mod) => function __require() { return mod || (0, cb[__getOwnPropNames(cb)[0]])((mod = { exports: {} }).exports, mod), mod.exports; }; // ../../../../Documents/HBuilderProjects/B404219-tianranqi/node_modules/base-64/base64.js var require_base64 = __commonJS({ "../../../../Documents/HBuilderProjects/B404219-tianranqi/node_modules/base-64/base64.js"(exports, module) { (function(root) { var freeExports = typeof exports == "object" && exports; var freeModule = typeof module == "object" && module && module.exports == freeExports && module; var freeGlobal = typeof global == "object" && global; if (freeGlobal.global === freeGlobal || freeGlobal.window === freeGlobal) { root = freeGlobal; } var InvalidCharacterError = function(message) { this.message = message; }; InvalidCharacterError.prototype = new Error(); InvalidCharacterError.prototype.name = "InvalidCharacterError"; var error = function(message) { throw new InvalidCharacterError(message); }; var TABLE = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; var REGEX_SPACE_CHARACTERS = /[\t\n\f\r ]/g; var decode = function(input) { input = String(input).replace(REGEX_SPACE_CHARACTERS, ""); var length = input.length; if (length % 4 == 0) { input = input.replace(/==?$/, ""); length = input.length; } if (length % 4 == 1 || // http://whatwg.org/C#alphanumeric-ascii-characters /[^+a-zA-Z0-9/]/.test(input)) { error( "Invalid character: the string to be decoded is not correctly encoded." ); } var bitCounter = 0; var bitStorage; var buffer; var output = ""; var position = -1; while (++position < length) { buffer = TABLE.indexOf(input.charAt(position)); bitStorage = bitCounter % 4 ? bitStorage * 64 + buffer : buffer; if (bitCounter++ % 4) { output += String.fromCharCode( 255 & bitStorage >> (-2 * bitCounter & 6) ); } } return output; }; var encode = function(input) { input = String(input); if (/[^\0-\xFF]/.test(input)) { error( "The string to be encoded contains characters outside of the Latin1 range." ); } var padding = input.length % 3; var output = ""; var position = -1; var a; var b; var c; var buffer; var length = input.length - padding; while (++position < length) { a = input.charCodeAt(position) << 16; b = input.charCodeAt(++position) << 8; c = input.charCodeAt(++position); buffer = a + b + c; output += TABLE.charAt(buffer >> 18 & 63) + TABLE.charAt(buffer >> 12 & 63) + TABLE.charAt(buffer >> 6 & 63) + TABLE.charAt(buffer & 63); } if (padding == 2) { a = input.charCodeAt(position) << 8; b = input.charCodeAt(++position); buffer = a + b; output += TABLE.charAt(buffer >> 10) + TABLE.charAt(buffer >> 4 & 63) + TABLE.charAt(buffer << 2 & 63) + "="; } else if (padding == 1) { buffer = input.charCodeAt(position); output += TABLE.charAt(buffer >> 2) + TABLE.charAt(buffer << 4 & 63) + "=="; } return output; }; var base64 = { "encode": encode, "decode": decode, "version": "1.0.0" }; if (typeof define == "function" && typeof define.amd == "object" && define.amd) { define(function() { return base64; }); } else if (freeExports && !freeExports.nodeType) { if (freeModule) { freeModule.exports = base64; } else { for (var key in base64) { base64.hasOwnProperty(key) && (freeExports[key] = base64[key]); } } } else { root.base64 = base64; } })(exports); } }); export default require_base64(); /*! Bundled license information: base-64/base64.js: (*! https://mths.be/base64 v1.0.0 by @mathias | MIT license *) */ //# sourceMappingURL=base-64.js.map