amos-tool 1.6.22 → 1.6.24
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/docs/Logger.html +1 -1
- package/docs/RayDB.html +1 -1
- package/docs/global.html +1 -1
- package/docs/index.html +1 -1
- package/lib/_clone.js +25 -25
- package/lib/_fastDeepEqual.js +3 -3
- package/lib/_forOwn.js +2 -2
- package/lib/_funcThrottle.js +5 -5
- package/lib/_list.js +2 -2
- package/lib/_object.assign.js +4 -4
- package/lib/_omit.js +2 -2
- package/lib/_parseJson.js +2 -2
- package/lib/_stringify.js +7 -7
- package/lib/_uuids.js +6 -6
- package/lib/algorithm/rank.js +2 -3
- package/lib/array2tree.js +2 -2
- package/lib/arrayFilter.js +4 -4
- package/lib/arrayUtils.js +12 -12
- package/lib/browser/Cookie.js +1 -1
- package/lib/browser/RayDB.js +26 -28
- package/lib/browser/indexDB.js +6 -8
- package/lib/browserSupport.js +4 -4
- package/lib/dom/fileSaveAs.js +8 -8
- package/lib/dom/minfyImg.js +14 -12
- package/lib/extra/pathToTree.js +28 -26
- package/lib/extra/sortBy.js +3 -3
- package/lib/flat.js +2 -2
- package/lib/locationParams.js +12 -12
- package/lib/log.js +4 -4
- package/lib/math/dateTime.js +8 -8
- package/lib/math/divide.js +2 -2
- package/lib/math/operations.js +10 -10
- package/lib/merged.js +5 -5
- package/lib/objectPath.js +6 -6
- package/lib/parseText.js +2 -2
- package/lib/png/randomPic.js +2 -2
- package/lib/qs/_assign.js +2 -2
- package/lib/qs/_merge.js +16 -16
- package/lib/qs/utils.js +5 -5
- package/lib/random.js +3 -3
- package/lib/store.js +2 -2
- package/lib/strUtils.js +13 -11
- package/lib/tableFilter.js +63 -63
- package/lib/throttleDebounce.js +2 -3
- package/lib/url/restfulUrl.js +2 -2
- package/lib/utils.js +12 -17
- package/lib/xss/implementEncode.js +2 -2
- package/package.json +1 -1
package/lib/strUtils.js
CHANGED
|
@@ -7,27 +7,29 @@ module.exports = {
|
|
|
7
7
|
return utils.isNil(e) ? e : utils.isString(e) ? e[0].toUpperCase() + e.slice(1, e.length) : e;
|
|
8
8
|
},
|
|
9
9
|
camelCase: function(e) {
|
|
10
|
-
return e.charAt(0).toUpperCase() + e.slice(1).replace(/-(\w)/g,
|
|
10
|
+
return e.charAt(0).toUpperCase() + e.slice(1).replace(/-(\w)/g, function(e, r) {
|
|
11
11
|
return r.toUpperCase();
|
|
12
|
-
})
|
|
12
|
+
});
|
|
13
13
|
},
|
|
14
14
|
transCamel: function(e) {
|
|
15
|
-
return (e = e.toLowerCase()).replace(/-(\w)/g,
|
|
15
|
+
return (e = e.toLowerCase()).replace(/-(\w)/g, function(e, r) {
|
|
16
16
|
return r.toUpperCase();
|
|
17
|
-
})
|
|
17
|
+
});
|
|
18
18
|
},
|
|
19
19
|
capFirst: function(e) {
|
|
20
|
-
return e && "" !== e ? e.replace(/(\w)/,
|
|
20
|
+
return e && "" !== e ? e.replace(/(\w)/, function(e) {
|
|
21
21
|
return e.toUpperCase();
|
|
22
|
-
})
|
|
22
|
+
}) : e;
|
|
23
23
|
},
|
|
24
24
|
hashCode: function(e) {
|
|
25
25
|
if (e) {
|
|
26
|
+
var r = function(e) {
|
|
27
|
+
return e > 2147483647 || e < -2147483648 ? 4294967295 & e : e;
|
|
28
|
+
};
|
|
26
29
|
e = e.toString();
|
|
27
|
-
for (var
|
|
28
|
-
return
|
|
30
|
+
for (var t = 0, n = 0; n < e.length; n++) t = r(t = 31 * t + e.charCodeAt(n));
|
|
31
|
+
return t;
|
|
29
32
|
}
|
|
30
|
-
var n;
|
|
31
33
|
return null;
|
|
32
34
|
},
|
|
33
35
|
dealScaleAndUnit: function(e, r) {
|
|
@@ -77,8 +79,8 @@ module.exports = {
|
|
|
77
79
|
toUTF8: function(e) {
|
|
78
80
|
var r, t, n, l = "";
|
|
79
81
|
for (t = e.length, r = 0; r < t; r++) (n = e.charCodeAt(r)) >= 1 && n <= 127 ? l += e.charAt(r) : n > 2047 ? (l += String.fromCharCode(224 | n >> 12 & 15),
|
|
80
|
-
l += String.fromCharCode(128 | n >> 6 & 63), l += String.fromCharCode(128 |
|
|
81
|
-
l += String.fromCharCode(128 |
|
|
82
|
+
l += String.fromCharCode(128 | n >> 6 & 63), l += String.fromCharCode(128 | 63 & n)) : (l += String.fromCharCode(192 | n >> 6 & 31),
|
|
83
|
+
l += String.fromCharCode(128 | 63 & n));
|
|
82
84
|
return l;
|
|
83
85
|
}
|
|
84
86
|
};
|
package/lib/tableFilter.js
CHANGED
|
@@ -10,98 +10,98 @@ function getChildrenlength(e) {
|
|
|
10
10
|
function flatToHierarchy(e) {
|
|
11
11
|
if (!e.length) return e;
|
|
12
12
|
var t = [], n = {};
|
|
13
|
-
e.forEach(
|
|
13
|
+
e.forEach(function(e) {
|
|
14
14
|
if (e.pos) {
|
|
15
15
|
var t = e.pos.split("-").length;
|
|
16
16
|
n[t] || (n[t] = []), n[t].push(e);
|
|
17
17
|
}
|
|
18
|
-
})
|
|
19
|
-
var r = Object.keys(n).sort(
|
|
18
|
+
});
|
|
19
|
+
var r = Object.keys(n).sort(function(e, t) {
|
|
20
20
|
return t - e;
|
|
21
|
-
})
|
|
22
|
-
return _utils.reduce(r,
|
|
23
|
-
return r && r !== e && n[e].forEach(
|
|
21
|
+
});
|
|
22
|
+
return _utils.reduce(r, function(e, r) {
|
|
23
|
+
return r && r !== e && n[e].forEach(function(e) {
|
|
24
24
|
var l = !1;
|
|
25
|
-
n[r].forEach(
|
|
25
|
+
n[r].forEach(function(t) {
|
|
26
26
|
isInclude(t.pos.split("-"), e.pos.split("-")) && (l = !0, t.children || (t.children = []),
|
|
27
27
|
t.children.push(e));
|
|
28
|
-
})
|
|
29
|
-
})
|
|
30
|
-
})
|
|
28
|
+
}), l || t.push(e);
|
|
29
|
+
}), r;
|
|
30
|
+
}), n[r[r.length - 1]].concat(t);
|
|
31
31
|
}
|
|
32
32
|
|
|
33
33
|
function filterParentPosition(e) {
|
|
34
34
|
var t = {};
|
|
35
|
-
e.forEach(
|
|
35
|
+
e.forEach(function(e) {
|
|
36
36
|
var n = e.split("-").length;
|
|
37
37
|
t[n] || (t[n] = []), t[n].push(e);
|
|
38
|
-
})
|
|
39
|
-
for (var n = Object.keys(t).sort(), r = 0; r < n.length; r++) n[r + 1] && t[n[r]].forEach(
|
|
40
|
-
for (var l = r + 1; l < n.length; l++) t[n[l]].forEach(
|
|
38
|
+
});
|
|
39
|
+
for (var n = Object.keys(t).sort(), r = 0; r < n.length; r++) n[r + 1] && t[n[r]].forEach(function(e) {
|
|
40
|
+
for (var l = r + 1; l < n.length; l++) t[n[l]].forEach(function(r, c) {
|
|
41
41
|
isInclude(e.split("-"), r.split("-")) && (t[n[l]][c] = null);
|
|
42
|
-
})
|
|
42
|
+
}), t[n[l]] = t[n[l]].filter(function(e) {
|
|
43
43
|
return e;
|
|
44
|
-
})
|
|
45
|
-
})
|
|
44
|
+
});
|
|
45
|
+
});
|
|
46
46
|
var l = [];
|
|
47
|
-
return n.forEach(
|
|
47
|
+
return n.forEach(function(e) {
|
|
48
48
|
l = l.concat(t[e]);
|
|
49
|
-
})
|
|
49
|
+
}), l;
|
|
50
50
|
}
|
|
51
51
|
|
|
52
52
|
function isInclude(e, t) {
|
|
53
|
-
return _utils.every(e,
|
|
53
|
+
return _utils.every(e, function(e, n) {
|
|
54
54
|
return e === t[n];
|
|
55
|
-
})
|
|
55
|
+
});
|
|
56
56
|
}
|
|
57
57
|
|
|
58
58
|
function filterAllCheckedData(e, t) {
|
|
59
59
|
if (!e.length) return e;
|
|
60
60
|
var n = recursiveGen(t), r = [];
|
|
61
61
|
return function t(n) {
|
|
62
|
-
n.forEach(
|
|
62
|
+
n.forEach(function(n) {
|
|
63
63
|
if (!n.__checked) {
|
|
64
64
|
var l = e.indexOf(n.value), c = n.children;
|
|
65
65
|
l > -1 ? (n.__checked = !0, r.push({
|
|
66
66
|
node: n,
|
|
67
67
|
pos: n._pos
|
|
68
|
-
}), e.splice(l, 1), c && recursive(c,
|
|
68
|
+
}), e.splice(l, 1), c && recursive(c, function(e) {
|
|
69
69
|
e.__checked = !0, r.push({
|
|
70
70
|
node: e,
|
|
71
71
|
pos: e._pos
|
|
72
72
|
});
|
|
73
|
-
}))
|
|
73
|
+
})) : c && t(c);
|
|
74
74
|
}
|
|
75
|
-
})
|
|
75
|
+
});
|
|
76
76
|
}(n), function e(t, n) {
|
|
77
77
|
n || (n = {
|
|
78
78
|
root: !0
|
|
79
79
|
});
|
|
80
80
|
var l = 0;
|
|
81
|
-
t.forEach(
|
|
81
|
+
t.forEach(function(t) {
|
|
82
82
|
var n = t.children;
|
|
83
83
|
if (!n || t.__checked || t.__halfChecked) t.__checked ? l++ : t.__halfChecked && (l += .5); else {
|
|
84
84
|
var r = e(n, t);
|
|
85
85
|
r.__checked ? l++ : r.__halfChecked && (l += .5);
|
|
86
86
|
}
|
|
87
|
-
})
|
|
87
|
+
});
|
|
88
88
|
var c = t.length;
|
|
89
89
|
return l === c ? (n.__checked = !0, r.push({
|
|
90
90
|
node: n,
|
|
91
91
|
pos: n._pos
|
|
92
92
|
})) : l < c && l > 0 && (n.__halfChecked = !0), n.root ? t : n;
|
|
93
|
-
}(n), r.forEach(
|
|
93
|
+
}(n), r.forEach(function(e, t) {
|
|
94
94
|
delete r[t].node.__checked, delete r[t].node._pos, r[t].node.props = {
|
|
95
95
|
title: r[t].node.title,
|
|
96
96
|
label: r[t].node.label || r[t].node.title,
|
|
97
97
|
value: r[t].node.value
|
|
98
98
|
}, r[t].node.children && (r[t].node.props.children = r[t].node.children), delete r[t].node.title,
|
|
99
99
|
delete r[t].node.label, delete r[t].node.value, delete r[t].node.children;
|
|
100
|
-
})
|
|
100
|
+
}), r;
|
|
101
101
|
}
|
|
102
102
|
|
|
103
103
|
function recursiveGen(e, t) {
|
|
104
|
-
return t || (t = 0), e.map(
|
|
104
|
+
return t || (t = 0), e.map(function(e, n) {
|
|
105
105
|
var r = t + "-" + n, l = {
|
|
106
106
|
title: e.title,
|
|
107
107
|
label: e.label || e.title,
|
|
@@ -110,13 +110,13 @@ function recursiveGen(e, t) {
|
|
|
110
110
|
_pos: r
|
|
111
111
|
};
|
|
112
112
|
return e.children && (l.children = recursiveGen(e.children, r)), l;
|
|
113
|
-
})
|
|
113
|
+
});
|
|
114
114
|
}
|
|
115
115
|
|
|
116
116
|
function recursive(e, t) {
|
|
117
|
-
e.forEach(
|
|
117
|
+
e.forEach(function(e) {
|
|
118
118
|
t(e), e.children && recursive(e.children, t);
|
|
119
|
-
})
|
|
119
|
+
});
|
|
120
120
|
}
|
|
121
121
|
|
|
122
122
|
function flatCustomArr(e, t) {
|
|
@@ -124,24 +124,24 @@ function flatCustomArr(e, t) {
|
|
|
124
124
|
if (!t.length) return t;
|
|
125
125
|
var n = [], r = {};
|
|
126
126
|
!function t(n) {
|
|
127
|
-
n.forEach(
|
|
127
|
+
n.forEach(function(n) {
|
|
128
128
|
n.code && (0 == n.level || "0" == n.level || n.level) && (n.children && n.children.length > 0 ? (r[n.level] || (r[n.level] = []),
|
|
129
129
|
r[n.level].push(n), t(n.children), n.children = []) : (r[n.level] || (r[n.level] = []),
|
|
130
130
|
n.label.indexOf(e) > -1 && r[n.level].push(n)));
|
|
131
|
-
})
|
|
131
|
+
});
|
|
132
132
|
}(t);
|
|
133
|
-
var l = Object.keys(r).sort(
|
|
133
|
+
var l = Object.keys(r).sort(function(e, t) {
|
|
134
134
|
return t - e;
|
|
135
|
-
})
|
|
136
|
-
return _utils.reduce(l,
|
|
137
|
-
return t && t !== e && r[e].forEach(
|
|
135
|
+
});
|
|
136
|
+
return _utils.reduce(l, function(e, t) {
|
|
137
|
+
return t && t !== e && r[e].forEach(function(e, l) {
|
|
138
138
|
var c = !1;
|
|
139
|
-
r[t].forEach(
|
|
139
|
+
r[t].forEach(function(t) {
|
|
140
140
|
isInclude(t.pos.split("-"), e.pos.split("-")) && (c = !0, t.children || (t.children = []),
|
|
141
141
|
t.children.push(e));
|
|
142
|
-
})
|
|
143
|
-
})
|
|
144
|
-
})
|
|
142
|
+
}), c || n.push(e);
|
|
143
|
+
}), t;
|
|
144
|
+
}), r[l[l.length - 1]].concat(n);
|
|
145
145
|
}
|
|
146
146
|
|
|
147
147
|
function recombineFlatData(e, t) {
|
|
@@ -151,48 +151,48 @@ function recombineFlatData(e, t) {
|
|
|
151
151
|
function flatMatchedData2Hierarchy(e) {
|
|
152
152
|
if (!e.length) return e;
|
|
153
153
|
var t = [], n = {};
|
|
154
|
-
e.forEach(
|
|
154
|
+
e.forEach(function(e) {
|
|
155
155
|
if (e.code) {
|
|
156
156
|
var t = e.code.split("_").length;
|
|
157
157
|
n[t] || (n[t] = []), n[t].push(e);
|
|
158
158
|
}
|
|
159
|
-
})
|
|
160
|
-
var r = Object.keys(n).sort(
|
|
159
|
+
});
|
|
160
|
+
var r = Object.keys(n).sort(function(e, t) {
|
|
161
161
|
return t - e;
|
|
162
|
-
})
|
|
163
|
-
return _utils.reduce(r,
|
|
164
|
-
return r && r !== e && n[e].forEach(
|
|
162
|
+
});
|
|
163
|
+
return _utils.reduce(r, function(e, r) {
|
|
164
|
+
return r && r !== e && n[e].forEach(function(e) {
|
|
165
165
|
var l = !1;
|
|
166
|
-
n[r].forEach(
|
|
166
|
+
n[r].forEach(function(t) {
|
|
167
167
|
isInclude(t.code.split("_"), e.code.split("_")) && (l = !0, t.children || (t.children = []),
|
|
168
168
|
t.children.push(e));
|
|
169
|
-
})
|
|
170
|
-
})
|
|
171
|
-
})
|
|
169
|
+
}), l || t.push(e);
|
|
170
|
+
}), r;
|
|
171
|
+
}), n[r[r.length - 1]].concat(t);
|
|
172
172
|
}
|
|
173
173
|
|
|
174
174
|
function fileterAllMatchedData(e, t) {
|
|
175
175
|
var n = [];
|
|
176
176
|
return function t(r) {
|
|
177
|
-
r.forEach(
|
|
177
|
+
r.forEach(function(r) {
|
|
178
178
|
if (!r.__matched) {
|
|
179
179
|
r.__pos = r.code;
|
|
180
180
|
var l = r.label.indexOf(e), c = r.children;
|
|
181
181
|
l > -1 ? (r.__matched = !0, n.push(r), c && t(c)) : c && t(c);
|
|
182
182
|
}
|
|
183
|
-
})
|
|
183
|
+
});
|
|
184
184
|
}(t), function e(t, r) {
|
|
185
185
|
r || (r = {
|
|
186
186
|
root: !0
|
|
187
187
|
});
|
|
188
188
|
var l = !1;
|
|
189
|
-
return t.forEach(
|
|
189
|
+
return t.forEach(function(t) {
|
|
190
190
|
var n = t.children;
|
|
191
191
|
!n || t.__matched || t.__halfMatched ? t.__matched && (l = !0) : e(n, t).__matched && (l = !0);
|
|
192
|
-
})
|
|
193
|
-
}(t), n.forEach(
|
|
192
|
+
}), l && (r.__matched = !0, r.children = [], r.root || n.push(r)), r.root ? t : r;
|
|
193
|
+
}(t), n.forEach(function(e, t) {
|
|
194
194
|
delete n[t].__matched, delete n[t].__halfMatched, delete n[t].__pos, delete n[t].children;
|
|
195
|
-
})
|
|
195
|
+
}), n;
|
|
196
196
|
}
|
|
197
197
|
|
|
198
198
|
function recombineData(e, t) {
|
|
@@ -202,18 +202,18 @@ function recombineData(e, t) {
|
|
|
202
202
|
function filterChilds(e, t) {
|
|
203
203
|
var n = [];
|
|
204
204
|
return function t(r) {
|
|
205
|
-
r.forEach(
|
|
205
|
+
r.forEach(function(r, l) {
|
|
206
206
|
r.children && r.children.length > 0 ? t(r.children) : r.label.indexOf(e) > -1 && n.push(r);
|
|
207
|
-
})
|
|
207
|
+
});
|
|
208
208
|
}(t), n;
|
|
209
209
|
}
|
|
210
210
|
|
|
211
211
|
function filterTreeLevel(e, t, n) {
|
|
212
212
|
var r = (n = n || {}).levelKey || "level", l = n.childrenKey || "children";
|
|
213
213
|
return function e(t) {
|
|
214
|
-
t.forEach(
|
|
214
|
+
t.forEach(function(t, n) {
|
|
215
215
|
t[l] && t[l].length > 0 ? e(t[l]) : 3 == t[r] && delete t[l];
|
|
216
|
-
})
|
|
216
|
+
});
|
|
217
217
|
}(e = e || []), e;
|
|
218
218
|
}
|
|
219
219
|
|
package/lib/throttleDebounce.js
CHANGED
|
@@ -10,10 +10,9 @@ function throttle(t, o, e, n) {
|
|
|
10
10
|
function f() {
|
|
11
11
|
c = Date.now(), e.apply(l, a);
|
|
12
12
|
}
|
|
13
|
-
|
|
13
|
+
u || (n && !i && f(), r(), void 0 === n && d > t ? f() : !0 !== o && (i = setTimeout(n ? function() {
|
|
14
14
|
i = void 0;
|
|
15
|
-
}
|
|
16
|
-
u || (n && !i && f(), r(), void 0 === n && d > t ? f() : !0 !== o && (i = setTimeout(n ? v : f, void 0 === n ? t - d : t)));
|
|
15
|
+
} : f, void 0 === n ? t - d : t)));
|
|
17
16
|
}
|
|
18
17
|
return "boolean" != typeof o && (n = e, e = o, o = void 0), l.cancel = function() {
|
|
19
18
|
r(), u = !0;
|
package/lib/url/restfulUrl.js
CHANGED
|
@@ -3,7 +3,7 @@
|
|
|
3
3
|
var utils = require("./../utils"), _regex = /\{\s*([^\|\}]+?)\s*(?:\|([^\}]*))?\s*\}/g;
|
|
4
4
|
|
|
5
5
|
module.exports = function(e, r, s) {
|
|
6
|
-
return s || (s = _regex), e.replace ? e.replace(s,
|
|
6
|
+
return s || (s = _regex), e.replace ? e.replace(s, function(e, s) {
|
|
7
7
|
return utils.isUndefined(r[s]) ? e : r[s];
|
|
8
|
-
})
|
|
8
|
+
}) : e;
|
|
9
9
|
};
|
package/lib/utils.js
CHANGED
|
@@ -114,17 +114,17 @@ function isDate(e) {
|
|
|
114
114
|
}
|
|
115
115
|
|
|
116
116
|
function _isJSON(e) {
|
|
117
|
-
return !!isString(e) && (e = e.replace(/\s/g, "").replace(/\n|\r/, ""), /^\{(.*?)\}$/.test(e) ? /"(.*?)":(.*?)/g.test(e) : !!/^\[(.*?)\]$/.test(e) && e.replace(/^\[/, "").replace(/\]$/, "").replace(/},{/g, "}\n{").split(/\n/).map(
|
|
117
|
+
return !!isString(e) && (e = e.replace(/\s/g, "").replace(/\n|\r/, ""), /^\{(.*?)\}$/.test(e) ? /"(.*?)":(.*?)/g.test(e) : !!/^\[(.*?)\]$/.test(e) && e.replace(/^\[/, "").replace(/\]$/, "").replace(/},{/g, "}\n{").split(/\n/).map(function(e) {
|
|
118
118
|
return _isJSON(e);
|
|
119
|
-
})
|
|
119
|
+
}).reduce(function(e, t) {
|
|
120
120
|
return !!t;
|
|
121
|
-
}))
|
|
121
|
+
}));
|
|
122
122
|
}
|
|
123
123
|
|
|
124
124
|
var stringIsJson = function(e) {
|
|
125
125
|
try {
|
|
126
126
|
var t = JSON.parse(e);
|
|
127
|
-
return !(isNil(t) || !isArray(t) && !isObject(t));
|
|
127
|
+
return isString(t) && (t = JSON.parse(t)), !(isNil(t) || !isArray(t) && !isObject(t));
|
|
128
128
|
} catch (t) {
|
|
129
129
|
return _isJSON(e);
|
|
130
130
|
}
|
|
@@ -132,16 +132,16 @@ var stringIsJson = function(e) {
|
|
|
132
132
|
if (isNil(t) || !isObject(t)) return !1;
|
|
133
133
|
isString(e) && (e = [ e ]);
|
|
134
134
|
var n = 0;
|
|
135
|
-
return e.forEach(
|
|
135
|
+
return e.forEach(function(e) {
|
|
136
136
|
e in t && n++;
|
|
137
|
-
})
|
|
137
|
+
}), e.length === n;
|
|
138
138
|
}, isOwnKeyInObject = function(e, t) {
|
|
139
139
|
if (isNil(t) || !isObject(t)) return !1;
|
|
140
140
|
isString(e) && (e = [ e ]);
|
|
141
141
|
var n = 0;
|
|
142
|
-
return e.forEach(
|
|
142
|
+
return e.forEach(function(e) {
|
|
143
143
|
e in t && hasOwnProperty.call(t, e) && n++;
|
|
144
|
-
})
|
|
144
|
+
}), e.length === n;
|
|
145
145
|
}, simpleEqual = function(e, t) {
|
|
146
146
|
if (e === t) return !0;
|
|
147
147
|
if ("object" !== (0, _typeof2.default)(e) || null === e || "object" !== (0, _typeof2.default)(t) || null === t) return !1;
|
|
@@ -193,11 +193,7 @@ var stringIsJson = function(e) {
|
|
|
193
193
|
if ("function" != typeof t) throw new TypeError;
|
|
194
194
|
for (arguments.length > 2 && (r = n), i = 0; i < s; ) {
|
|
195
195
|
var u;
|
|
196
|
-
if (i in o)
|
|
197
|
-
u = o[i];
|
|
198
|
-
var l = t.call(r, u, i, o);
|
|
199
|
-
if (!l) return !1;
|
|
200
|
-
}
|
|
196
|
+
if (i in o) if (u = o[i], !t.call(r, u, i, o)) return !1;
|
|
201
197
|
i++;
|
|
202
198
|
}
|
|
203
199
|
return !0;
|
|
@@ -251,9 +247,9 @@ function mergeAll(e, t) {
|
|
|
251
247
|
}
|
|
252
248
|
|
|
253
249
|
function subObjectEqual(e, t) {
|
|
254
|
-
return !(!isEmpty(e) && !isEmpty(t)) || (e === t || !Object.keys(t).some(
|
|
250
|
+
return !(!isEmpty(e) && !isEmpty(t)) || (e === t || !Object.keys(t).some(function(n) {
|
|
255
251
|
return n in e && t[n] !== e[n];
|
|
256
|
-
}))
|
|
252
|
+
}));
|
|
257
253
|
}
|
|
258
254
|
|
|
259
255
|
function isPromise(e) {
|
|
@@ -278,8 +274,7 @@ function checkFileName(e) {
|
|
|
278
274
|
if (isNil(e)) return !1;
|
|
279
275
|
if (!isString(e) && !isNumber(e)) return !1;
|
|
280
276
|
if ((e = String(e)).length > t) return !1;
|
|
281
|
-
|
|
282
|
-
return !n.test(e) && (!e.endsWith(" ") && !e.startsWith(" ") && ("." !== e && " " !== e));
|
|
277
|
+
return !/[\\/:\*\?"<>\|]/g.test(e) && (!e.endsWith(" ") && !e.startsWith(" ") && ("." !== e && " " !== e));
|
|
283
278
|
}
|
|
284
279
|
|
|
285
280
|
module.exports = {
|
|
@@ -32,8 +32,8 @@ var attributes = {
|
|
|
32
32
|
|
|
33
33
|
module.exports = function(o) {
|
|
34
34
|
var e = [];
|
|
35
|
-
return getXssPatternList().forEach(
|
|
35
|
+
return getXssPatternList().forEach(function(n) {
|
|
36
36
|
var t = new RegExp(n.pattern, n.flags.join(""));
|
|
37
37
|
e.push(t), o = o.replace(t, "");
|
|
38
|
-
})
|
|
38
|
+
}), o;
|
|
39
39
|
};
|