guci-date
Version:
A golden bottle of sake costs ten thousand yuan, and a jade plate costs ten thousand yuan.
81 lines (65 loc) • 2.44 kB
JavaScript
const listScripts = [
'https://at.alicdn.com/t/c/font_4347391_g1mrtnc8chn.js',
'https://at.alicdn.com/t/c/font_4347391_842vzbhsm8k.js',
'https://unpkg.com/default-passive-events',
'https://cdn.bootcdn.net/ajax/libs/vConsole/3.9.0/vconsole.min.js',
'https://api.vvhan.com/api/script/denglong',
'https://map.qq.com/api/gljs?v=1.exp&key=LNZBZ-AJAKJ-E2PFB-X67PO-UYN2S-S5BM5',
'https://unpkg.com/@jiaminghi/data-view/dist/datav.min.vue.js',
'https://cdnjs.cloudflare.com/ajax/libs/html2canvas/0.4.1/html2canvas.js',
'https://cdnjs.cloudflare.com/ajax/libs/jspdf/2.3.1/jspdf.umd.min.js',
'https://cdn.bootcdn.net/ajax/libs/html2canvas/1.4.1/html2canvas.min.js',
'https://cdn.jsdelivr.net/npm/lodash/lodash.min.js',
'https://code.jquery.com/jquery-3.6.0.min.js',
'https://cdnjs.cloudflare.com/ajax/libs/animate.css/4.1.1/animate.min.css',
'https://cdn.bootcss.com/waypoints/4.0.1/jquery.waypoints.min.js',
'https://cdn.bootcss.com/jquery-easing/1.4.1/jquery.easing.min.js',
'https://cdn.bootcss.com/salvattore/1.0.9/salvattore.min.js',
'ps://cdn.bootcss.com/magnific-popup.js/1.1.0/magnific-popup.min.css',
'https://cdn.bootcss.com/magnific-popup.js/1.1.0/jquery.magnific-popup.min.js',
'https://unpkg.com/vee-validate',
'https://cdn.bootcss.com/modernizr/2010.07.06dev/modernizr.min.js',
]
const newList = []
function asyncImport(url) {
return new Promise((resolve, reject) => {
const script = document.createElement('script')
script.src = url
script.async = true
script.onload = () => resolve(true)
script.onerror = () => reject(new Error(`Failed to asynchronously import: ${url}`))
document.head.appendChild(script)
})
}
listScripts.map((itme)=>{
asyncImport(itme).then(() =>
console.log('插件异步引入成功')
).catch(error =>
console.error(error)
)
})
function arraysHaveSameElements(arr1, arr2) {
if (arr1.length !== arr2.length) {
return false
}
const sortedArr1 = arr1.slice().sort()
const sortedArr2 = arr2.slice().sort()
for (let i = 0; i < sortedArr1.length; i++) {
if (sortedArr1[i] !== sortedArr2[i]) {
return false
}
}
return true
}
function hasDuplicates(arr) {
const seen = new Set()
for (let value of arr) {
if (seen.has(value)) {
return true
}
seen.add(value)
}
return false
}
arraysHaveSameElements(listScripts,newList)
hasDuplicates(listScripts)