'+(b+c.text())+"
";e=c.attr("href");b=a.iframeTab.generateID(e);if(0${title + element.text()}
`; 18 | let url = element.attr('href') 19 | let id = iframeTabParent.iframeTab.generateID(url); 20 | if (iframeTabParent.elements.iframe_tab.find(`#iframe-home-${id}`).length > 0) { 21 | iframeTabParent.elements.iframe_tab.find(`#iframe-home-${id}`).click() 22 | return false 23 | } 24 | let choose_element = iframeTabParent.iframeTab.findIframeTabActiveElement() 25 | iframeTabParent.swiper.appendSlide(iframeTabParent.iframeTabTemplate.tabItem(page_html, id)) 26 | iframeTabParent.elements.iframe_tabContent.append(iframeTabParent.iframeTabTemplate.tabContentItem(url, id)) 27 | iframeTabParent.swiper.updateSlides(); 28 | /*移除tab bar 选中样式*/ 29 | iframeTabParent.iframeTab.removeTabBarStyle() 30 | /*更新选中缓存中的tab bar*/ 31 | iframeTabParent.iframeTab.cacheUpdateTabBar(choose_element) 32 | //触发点击 33 | iframeTabParent.elements.iframe_tab.find(`#iframe-home-${id}`).click() 34 | }, 35 | init() { 36 | $(document).on('click', 'a[iframe-tab=true]', function (e) { 37 | iframeTabExtends.addTab($(this)) 38 | e.preventDefault() 39 | }) 40 | } 41 | } 42 | iframeTabExtends.init() 43 | } 44 | }) 45 | -------------------------------------------------------------------------------- /src/assets/js/md5.js: -------------------------------------------------------------------------------- 1 | /* 2 | * JavaScript MD5 3 | * https://github.com/blueimp/JavaScript-MD5 4 | * 5 | * Copyright 2011, Sebastian Tschan 6 | * https://blueimp.net 7 | * 8 | * Licensed under the MIT license: 9 | * https://opensource.org/licenses/MIT 10 | * 11 | * Based on 12 | * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message 13 | * Digest Algorithm, as defined in RFC 1321. 14 | * Version 2.2 Copyright (C) Paul Johnston 1999 - 2009 15 | * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet 16 | * Distributed under the BSD License 17 | * See http://pajhome.org.uk/crypt/md5 for more info. 18 | */ 19 | 20 | /* global define */ 21 | 22 | ;(function ($) { 23 | 'use strict' 24 | 25 | /* 26 | * Add integers, wrapping at 2^32. This uses 16-bit operations internally 27 | * to work around bugs in some JS interpreters. 28 | */ 29 | function safeAdd (x, y) { 30 | var lsw = (x & 0xffff) + (y & 0xffff) 31 | var msw = (x >> 16) + (y >> 16) + (lsw >> 16) 32 | return (msw << 16) | (lsw & 0xffff) 33 | } 34 | 35 | /* 36 | * Bitwise rotate a 32-bit number to the left. 37 | */ 38 | function bitRotateLeft (num, cnt) { 39 | return (num << cnt) | (num >>> (32 - cnt)) 40 | } 41 | 42 | /* 43 | * These functions implement the four basic operations the algorithm uses. 44 | */ 45 | function md5cmn (q, a, b, x, s, t) { 46 | return safeAdd(bitRotateLeft(safeAdd(safeAdd(a, q), safeAdd(x, t)), s), b) 47 | } 48 | function md5ff (a, b, c, d, x, s, t) { 49 | return md5cmn((b & c) | (~b & d), a, b, x, s, t) 50 | } 51 | function md5gg (a, b, c, d, x, s, t) { 52 | return md5cmn((b & d) | (c & ~d), a, b, x, s, t) 53 | } 54 | function md5hh (a, b, c, d, x, s, t) { 55 | return md5cmn(b ^ c ^ d, a, b, x, s, t) 56 | } 57 | function md5ii (a, b, c, d, x, s, t) { 58 | return md5cmn(c ^ (b | ~d), a, b, x, s, t) 59 | } 60 | 61 | /* 62 | * Calculate the MD5 of an array of little-endian words, and a bit length. 63 | */ 64 | function binlMD5 (x, len) { 65 | /* append padding */ 66 | x[len >> 5] |= 0x80 << (len % 32) 67 | x[((len + 64) >>> 9 << 4) + 14] = len 68 | 69 | var i 70 | var olda 71 | var oldb 72 | var oldc 73 | var oldd 74 | var a = 1732584193 75 | var b = -271733879 76 | var c = -1732584194 77 | var d = 271733878 78 | 79 | for (i = 0; i < x.length; i += 16) { 80 | olda = a 81 | oldb = b 82 | oldc = c 83 | oldd = d 84 | 85 | a = md5ff(a, b, c, d, x[i], 7, -680876936) 86 | d = md5ff(d, a, b, c, x[i + 1], 12, -389564586) 87 | c = md5ff(c, d, a, b, x[i + 2], 17, 606105819) 88 | b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330) 89 | a = md5ff(a, b, c, d, x[i + 4], 7, -176418897) 90 | d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426) 91 | c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341) 92 | b = md5ff(b, c, d, a, x[i + 7], 22, -45705983) 93 | a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416) 94 | d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417) 95 | c = md5ff(c, d, a, b, x[i + 10], 17, -42063) 96 | b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162) 97 | a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682) 98 | d = md5ff(d, a, b, c, x[i + 13], 12, -40341101) 99 | c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290) 100 | b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329) 101 | 102 | a = md5gg(a, b, c, d, x[i + 1], 5, -165796510) 103 | d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632) 104 | c = md5gg(c, d, a, b, x[i + 11], 14, 643717713) 105 | b = md5gg(b, c, d, a, x[i], 20, -373897302) 106 | a = md5gg(a, b, c, d, x[i + 5], 5, -701558691) 107 | d = md5gg(d, a, b, c, x[i + 10], 9, 38016083) 108 | c = md5gg(c, d, a, b, x[i + 15], 14, -660478335) 109 | b = md5gg(b, c, d, a, x[i + 4], 20, -405537848) 110 | a = md5gg(a, b, c, d, x[i + 9], 5, 568446438) 111 | d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690) 112 | c = md5gg(c, d, a, b, x[i + 3], 14, -187363961) 113 | b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501) 114 | a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467) 115 | d = md5gg(d, a, b, c, x[i + 2], 9, -51403784) 116 | c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473) 117 | b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734) 118 | 119 | a = md5hh(a, b, c, d, x[i + 5], 4, -378558) 120 | d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463) 121 | c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562) 122 | b = md5hh(b, c, d, a, x[i + 14], 23, -35309556) 123 | a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060) 124 | d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353) 125 | c = md5hh(c, d, a, b, x[i + 7], 16, -155497632) 126 | b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640) 127 | a = md5hh(a, b, c, d, x[i + 13], 4, 681279174) 128 | d = md5hh(d, a, b, c, x[i], 11, -358537222) 129 | c = md5hh(c, d, a, b, x[i + 3], 16, -722521979) 130 | b = md5hh(b, c, d, a, x[i + 6], 23, 76029189) 131 | a = md5hh(a, b, c, d, x[i + 9], 4, -640364487) 132 | d = md5hh(d, a, b, c, x[i + 12], 11, -421815835) 133 | c = md5hh(c, d, a, b, x[i + 15], 16, 530742520) 134 | b = md5hh(b, c, d, a, x[i + 2], 23, -995338651) 135 | 136 | a = md5ii(a, b, c, d, x[i], 6, -198630844) 137 | d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415) 138 | c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905) 139 | b = md5ii(b, c, d, a, x[i + 5], 21, -57434055) 140 | a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571) 141 | d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606) 142 | c = md5ii(c, d, a, b, x[i + 10], 15, -1051523) 143 | b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799) 144 | a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359) 145 | d = md5ii(d, a, b, c, x[i + 15], 10, -30611744) 146 | c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380) 147 | b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649) 148 | a = md5ii(a, b, c, d, x[i + 4], 6, -145523070) 149 | d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379) 150 | c = md5ii(c, d, a, b, x[i + 2], 15, 718787259) 151 | b = md5ii(b, c, d, a, x[i + 9], 21, -343485551) 152 | 153 | a = safeAdd(a, olda) 154 | b = safeAdd(b, oldb) 155 | c = safeAdd(c, oldc) 156 | d = safeAdd(d, oldd) 157 | } 158 | return [a, b, c, d] 159 | } 160 | 161 | /* 162 | * Convert an array of little-endian words to a string 163 | */ 164 | function binl2rstr (input) { 165 | var i 166 | var output = '' 167 | var length32 = input.length * 32 168 | for (i = 0; i < length32; i += 8) { 169 | output += String.fromCharCode((input[i >> 5] >>> (i % 32)) & 0xff) 170 | } 171 | return output 172 | } 173 | 174 | /* 175 | * Convert a raw string to an array of little-endian words 176 | * Characters >255 have their high-byte silently ignored. 177 | */ 178 | function rstr2binl (input) { 179 | var i 180 | var output = [] 181 | output[(input.length >> 2) - 1] = undefined 182 | for (i = 0; i < output.length; i += 1) { 183 | output[i] = 0 184 | } 185 | var length8 = input.length * 8 186 | for (i = 0; i < length8; i += 8) { 187 | output[i >> 5] |= (input.charCodeAt(i / 8) & 0xff) << (i % 32) 188 | } 189 | return output 190 | } 191 | 192 | /* 193 | * Calculate the MD5 of a raw string 194 | */ 195 | function rstrMD5 (s) { 196 | return binl2rstr(binlMD5(rstr2binl(s), s.length * 8)) 197 | } 198 | 199 | /* 200 | * Calculate the HMAC-MD5, of a key and some data (raw strings) 201 | */ 202 | function rstrHMACMD5 (key, data) { 203 | var i 204 | var bkey = rstr2binl(key) 205 | var ipad = [] 206 | var opad = [] 207 | var hash 208 | ipad[15] = opad[15] = undefined 209 | if (bkey.length > 16) { 210 | bkey = binlMD5(bkey, key.length * 8) 211 | } 212 | for (i = 0; i < 16; i += 1) { 213 | ipad[i] = bkey[i] ^ 0x36363636 214 | opad[i] = bkey[i] ^ 0x5c5c5c5c 215 | } 216 | hash = binlMD5(ipad.concat(rstr2binl(data)), 512 + data.length * 8) 217 | return binl2rstr(binlMD5(opad.concat(hash), 512 + 128)) 218 | } 219 | 220 | /* 221 | * Convert a raw string to a hex string 222 | */ 223 | function rstr2hex (input) { 224 | var hexTab = '0123456789abcdef' 225 | var output = '' 226 | var x 227 | var i 228 | for (i = 0; i < input.length; i += 1) { 229 | x = input.charCodeAt(i) 230 | output += hexTab.charAt((x >>> 4) & 0x0f) + hexTab.charAt(x & 0x0f) 231 | } 232 | return output 233 | } 234 | 235 | /* 236 | * Encode a string as utf-8 237 | */ 238 | function str2rstrUTF8 (input) { 239 | return unescape(encodeURIComponent(input)) 240 | } 241 | 242 | /* 243 | * Take string arguments and return either raw or hex encoded strings 244 | */ 245 | function rawMD5 (s) { 246 | return rstrMD5(str2rstrUTF8(s)) 247 | } 248 | function hexMD5 (s) { 249 | return rstr2hex(rawMD5(s)) 250 | } 251 | function rawHMACMD5 (k, d) { 252 | return rstrHMACMD5(str2rstrUTF8(k), str2rstrUTF8(d)) 253 | } 254 | function hexHMACMD5 (k, d) { 255 | return rstr2hex(rawHMACMD5(k, d)) 256 | } 257 | 258 | function md5 (string, key, raw) { 259 | if (!key) { 260 | if (!raw) { 261 | return hexMD5(string) 262 | } 263 | return rawMD5(string) 264 | } 265 | if (!raw) { 266 | return hexHMACMD5(key, string) 267 | } 268 | return rawHMACMD5(key, string) 269 | } 270 | 271 | if (typeof define === 'function' && define.amd) { 272 | define(function () { 273 | return md5 274 | }) 275 | } else if (typeof module === 'object' && module.exports) { 276 | module.exports = md5 277 | } else { 278 | $.md5 = md5 279 | } 280 | })(this) 281 | -------------------------------------------------------------------------------- /src/assets/js/swiper.min.js: -------------------------------------------------------------------------------- 1 | /** 2 | * Swiper 6.4.5 3 | * Most modern mobile touch slider and framework with hardware accelerated transitions 4 | * https://swiperjs.com 5 | * 6 | * Copyright 2014-2020 Vladimir Kharlampidi 7 | * 8 | * Released under the MIT License 9 | * 10 | * Released on: December 18, 2020 11 | */ 12 | 13 | !function(e,t){"object"==typeof exports&&"undefined"!=typeof module?module.exports=t():"function"==typeof define&&define.amd?define(t):(e="undefined"!=typeof globalThis?globalThis:e||self).Swiper=t()}(this,(function(){"use strict";function e(e,t){for(var a=0;a