forked from fanruan/fineui
Browse Source
Merge in VISUAL/fineui from ~DAILER/fineui:master to master * commit 'b667e5684bd282de75bcfc6546fb45d6105fe6ba': 无JIRA 回复number的polyfill 无JIRA chore: 改一下打包. and babel 无JIRA chore: 去掉IE8支持 无JIRA __destoryes6
14 changed files with 52 additions and 296 deletions
@ -1 +0,0 @@
|
||||
module.exports = require('@fui/babel-preset-fineui').configs.ie8; |
||||
@ -1,22 +0,0 @@
|
||||
/** |
||||
* 缓冲池 |
||||
* @type {{Buffer: {}}} |
||||
*/ |
||||
|
||||
(function () { |
||||
var Buffer = {}; |
||||
var MODE = false;// 设置缓存模式为关闭
|
||||
|
||||
BI.BufferPool = { |
||||
put: function (name, cache) { |
||||
if (BI.isNotNull(Buffer[name])) { |
||||
throw new Error("key值：[" + name + "] 已存在!", Buffer); |
||||
} |
||||
Buffer[name] = cache; |
||||
}, |
||||
|
||||
get: function (name) { |
||||
return Buffer[name]; |
||||
} |
||||
}; |
||||
})(); |
||||
@ -1,31 +0,0 @@
|
||||
/** |
||||
* 共享池 |
||||
* @type {{Shared: {}}} |
||||
*/ |
||||
|
||||
(function () { |
||||
var _Shared = {}; |
||||
BI.SharingPool = { |
||||
_Shared: _Shared, |
||||
put: function (name, shared) { |
||||
_Shared[name] = shared; |
||||
}, |
||||
|
||||
cat: function () { |
||||
var args = Array.prototype.slice.call(arguments, 0), |
||||
copy = _Shared; |
||||
for (var i = 0; i < args.length; i++) { |
||||
copy = copy && copy[args[i]]; |
||||
} |
||||
return copy; |
||||
}, |
||||
|
||||
get: function () { |
||||
return BI.deepClone(this.cat.apply(this, arguments)); |
||||
}, |
||||
|
||||
remove: function (key) { |
||||
delete _Shared[key]; |
||||
} |
||||
}; |
||||
})(); |
||||
@ -1,96 +0,0 @@
|
||||
// Production steps of ECMA-262, Edition 5, 15.4.4.14
|
||||
// Reference: http://es5.github.io/#x15.4.4.14
|
||||
if (!Array.prototype.indexOf) { |
||||
Array.prototype.indexOf = function (searchElement, fromIndex) { |
||||
|
||||
var k; |
||||
|
||||
// 1. Let o be the result of calling ToObject passing
|
||||
// the this value as the argument.
|
||||
if (this == null) { |
||||
throw new TypeError("\"this\" is null or not defined"); |
||||
} |
||||
|
||||
var o = Object(this); |
||||
|
||||
// 2. Let lenValue be the result of calling the Get
|
||||
// internal method of o with the argument "length".
|
||||
// 3. Let len be ToUint32(lenValue).
|
||||
var len = o.length >>> 0; |
||||
|
||||
// 4. If len is 0, return -1.
|
||||
if (len === 0) { |
||||
return -1; |
||||
} |
||||
|
||||
// 5. If argument fromIndex was passed let n be
|
||||
// ToInteger(fromIndex); else let n be 0.
|
||||
var n = fromIndex | 0; |
||||
|
||||
// 6. If n >= len, return -1.
|
||||
if (n >= len) { |
||||
return -1; |
||||
} |
||||
|
||||
// 7. If n >= 0, then Let k be n.
|
||||
// 8. Else, n<0, Let k be len - abs(n).
|
||||
// If k is less than 0, then let k be 0.
|
||||
k = Math.max(n >= 0 ? n : len - Math.abs(n), 0); |
||||
|
||||
// 9. Repeat, while k < len
|
||||
while (k < len) { |
||||
// a. Let Pk be ToString(k).
|
||||
// This is implicit for LHS operands of the in operator
|
||||
// b. Let kPresent be the result of calling the
|
||||
// HasProperty internal method of o with argument Pk.
|
||||
// This step can be combined with c
|
||||
// c. If kPresent is true, then
|
||||
// i. Let elementK be the result of calling the Get
|
||||
// internal method of o with the argument ToString(k).
|
||||
// ii. Let same be the result of applying the
|
||||
// Strict Equality Comparison Algorithm to
|
||||
// searchElement and elementK.
|
||||
// iii. If same is true, return k.
|
||||
if (k in o && o[k] === searchElement) { |
||||
return k; |
||||
} |
||||
k++; |
||||
} |
||||
return -1; |
||||
}; |
||||
} |
||||
if (!Array.prototype.lastIndexOf) { |
||||
Array.prototype.lastIndexOf = function (searchElement /* , fromIndex*/) { |
||||
"use strict"; |
||||
|
||||
if (this === void 0 || this === null) { |
||||
throw new TypeError(); |
||||
} |
||||
|
||||
var n, k, |
||||
t = Object(this), |
||||
len = t.length >>> 0; |
||||
if (len === 0) { |
||||
return -1; |
||||
} |
||||
|
||||
n = len - 1; |
||||
if (arguments.length > 1) { |
||||
n = Number(arguments[1]); |
||||
if (n != n) { |
||||
n = 0; |
||||
} else if (n != 0 && n != (1 / 0) && n != -(1 / 0)) { |
||||
n = (n > 0 || -1) * Math.floor(Math.abs(n)); |
||||
} |
||||
} |
||||
|
||||
for (k = n >= 0 |
||||
? Math.min(n, len - 1) |
||||
: len - Math.abs(n); k >= 0; k--) { |
||||
if (k in t && t[k] === searchElement) { |
||||
return k; |
||||
} |
||||
} |
||||
return -1; |
||||
}; |
||||
} |
||||
@ -1,21 +0,0 @@
|
||||
/* |
||||
* 前端缓存 |
||||
*/ |
||||
_global.localStorage || (_global.localStorage = { |
||||
items: {}, |
||||
setItem: function (k, v) { |
||||
BI.Cache.addCookie(k, v); |
||||
}, |
||||
getItem: function (k) { |
||||
return BI.Cache.getCookie(k); |
||||
}, |
||||
removeItem: function (k) { |
||||
BI.Cache.deleteCookie(k); |
||||
}, |
||||
key: function () { |
||||
|
||||
}, |
||||
clear: function () { |
||||
this.items = {}; |
||||
} |
||||
}); |
||||
@ -1,51 +0,0 @@
|
||||
|
||||
if (!Object.keys) { |
||||
Object.keys = function(o) { |
||||
if (o !== Object(o)) { |
||||
throw new TypeError('Object.keys called on a non-object'); |
||||
} |
||||
// fix的问题
|
||||
var falsy; |
||||
var skipArray = { |
||||
__ob__: falsy, |
||||
$accessors: falsy, |
||||
$vbthis: falsy, |
||||
$vbsetter: falsy |
||||
}; |
||||
var k = [], p; |
||||
for (p in o) { |
||||
if (!(p in skipArray)) { |
||||
if (Object.prototype.hasOwnProperty.call(o, p)) { |
||||
k.push(p); |
||||
} |
||||
} |
||||
} |
||||
return k; |
||||
}; |
||||
} |
||||
|
||||
if (!Array.isArray) { |
||||
Array.isArray = function(arg) { |
||||
return Object.prototype.toString.call(arg) === '[object Array]'; |
||||
}; |
||||
} |
||||
|
||||
/* 统一采用core-js的polyfill，此块暂去 |
||||
// https://stackoverflow.com/questions/10919915/ie8-getprototypeof-method
|
||||
if (typeof Object.getPrototypeOf !== "function") { |
||||
Object.getPrototypeOf = "".__proto__ === String.prototype |
||||
? function (object) { |
||||
return object.__proto__; |
||||
} |
||||
: function (object) { |
||||
// May break if the constructor has been tampered with
|
||||
return object.constructor.prototype; |
||||
}; |
||||
} |
||||
*/ |
||||
|
||||
if(!Date.now) { |
||||
Date.now = function () { |
||||
return new Date().valueOf(); |
||||
}; |
||||
} |
||||
@ -1,16 +0,0 @@
|
||||
if (typeof Set !== "undefined" && Set.toString().match(/native code/)) { |
||||
|
||||
} else { |
||||
Set = function () { |
||||
this.set = {}; |
||||
}; |
||||
Set.prototype.has = function (key) { |
||||
return this.set[key] !== undefined; |
||||
}; |
||||
Set.prototype.add = function (key) { |
||||
this.set[key] = 1; |
||||
}; |
||||
Set.prototype.clear = function () { |
||||
this.set = {}; |
||||
}; |
||||
} |
||||
@ -0,0 +1,24 @@
|
||||
const path = require('path'); |
||||
const glob = require('glob'); |
||||
|
||||
// const glob = require('fast-glob');
|
||||
|
||||
function uniq(names) { |
||||
return [...new Set(names)]; |
||||
} |
||||
|
||||
const globalExcludes = [ |
||||
"**/*/__test__/*.js", |
||||
]; |
||||
|
||||
function sync(patterns, excludes = []) { |
||||
const ignore = globalExcludes.concat(excludes).map(pattern => path.join(__dirname, "../", pattern).replace(/\\/g, '/')); |
||||
|
||||
return patterns.map(pattern => glob.sync(path.join(__dirname, "../", pattern).replace(/\\/g, '/'), { ignore })).flat(); |
||||
} |
||||
|
||||
|
||||
module.exports = { |
||||
sync, |
||||
uniq, |
||||
}; |
||||
Loading…
Reference in new issue