Repository navigation
Expand file tree
/
Copy pathutil.js
More file actions
200 lines (176 loc) · 5.47 KB
/
Copy pathutil.js
File metadata and controls
200 lines (176 loc) · 5.47 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
var util = {};
util.mapper = function(parent, filter, recursive) {
return function() {
return util.mapDOMNodes(parent, recursive !== false, filter);
};
};
// Returns Array
util.mapDOMNodes = function(parent, recursive, callback) {
function visit(parent, result) {
if (parent.childNodes) {
return parent.childNodes.toArray().reduce(reducer, result);
} else {
return result;
}
}
function reducer(array, child) {
if (callback === true || callback(child)) {
array.push(child);
}
if (recursive && child._childNodes) {
visit(child, array);
}
return array;
}
return visit(parent, []);
};
util.visitTree = function(root, callback) {
var cur = root; // TODO: Unroll this.
function visit(el) {
if (el) {
callback(el);
if (el._childNodes) {
var i = 0,
children = el._childNodes,
l = children.length;
for (i; i<l; i++) {
visit(children[i]);
}
}
}
}
visit(root);
};
util.markTreeReadonly = function(node) {
function markLevel(el) {
el._readonly = true;
// also mark attributes and their children read-only
if (el.attributes) {
var attributes = el.attributes, l = attributes.length, i=0;
attributes._readonly = true;
for (i; i<l; i++) {
util.visitTree(attributes[i], markLevel);
}
}
}
util.visitTree(node, markLevel);
};
var xml1_0StartRegex = ":\\a-z_\\uC0-\\uD6\\uD8-\\uF6\\uF8-\\u2FF\\u370-\\u37D\\u37F-\\u1FFF\\u200C-\\u200D\\u2070-\\u218F\\u2C00\\u2FEF\\u3001-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFFD\\u10000-\\uEFFFF\\u4a"
var xml1_0EndRegex = '\\-\\.0-9\\uB7\\u300-\\u36F\\u203F-\\u2040';
var xml1_0Regex = new RegExp('^[' + xml1_0StartRegex + '][' + xml1_0StartRegex + xml1_0EndRegex + ']*$', 'i');
var xml1_0RegexInverse = new RegExp('[^' + xml1_0StartRegex + '][' + xml1_0StartRegex + xml1_0EndRegex + ']', 'gi');
util.regex = {
fallback : {
filters : {
tag : /^[\w:\d_\.-]+$/i,
entity : /^[\w:\d_\.-]+$/i,
attribute : /^[\w\d_\-&:;]+$/i,
namespace : /^[\w:\d_\.-]+$/i
},
inverse : {
tag : /[^a-z:\d_\.-]/ig,
entity : /[^\w:\d_\.-]/ig,
attribute : /[^\w\d_\-&:;]/ig,
namespace : /[^\w:\d_\.-]/ig
}
},
'xml- remove for now -1.0' : {
filters : {
tag : xml1_0Regex,
entity : xml1_0Regex,
attribute : xml1_0Regex,
namespace : xml1_0Regex
},
inverse : {
tag : xml1_0RegexInverse,
entity : xml1_0RegexInverse,
attribute : xml1_0RegexInverse,
namespace : xml1_0RegexInverse
}
},
'xml1.1' : {
filters : {
tag : /^[\u9\uA\uD\u20-\uD7FF\uE000-\uFFFD\u10000-\u10FFFF]+$/,
entity : /^[\u9\uA\uD\u20-\uD7FF\uE000-\uFFFD\u10000-\u10FFFF]+$/,
attribute : /^[\u9\uA\uD\u20-\uD7FF\uE000-\uFFFD\u10000-\u10FFFF]+$/,
namespace : /^[\u9\uA\uD\u20-\uD7FF\uE000-\uFFFD\u10000-\u10FFFF]+$/
},
inverse : {
tag : /[^\u9\uA\uD\u20-\uD7FF\uE000-\uFFFD\u10000-\u10FFFF]/g,
entity : /[^\u9\uA\uD\u20-\uD7FF\uE000-\uFFFD\u10000-\u10FFFF]/g,
attribute : /[^\u9\uA\uD\u20-\uD7FF\uE000-\uFFFD\u10000-\u10FFFF]/g,
namespace : /[^\u9\uA\uD\u20-\uD7FF\uE000-\uFFFD\u10000-\u10FFFF]/g
}
}
};
util.validationFailures = function(element, type, value, mode) {
mode = mode || 'fallback';
if (util.regex[mode] && util.regex[mode].inverse[type]) {
var inverse = util.regex[mode].inverse;
var result = value.match(inverse[type]);
return result;
} else {
return value.match(util.regex.fallback.inverse[type]);
}
};
util.validate = function(element, type, value, mode) {
mode = mode || 'fallback';
if (util.regex[mode] && util.regex[mode].filters[type]) {
var filters = util.regex[mode].filters;
var result = filters[type].test(value);
if (!result) {
// TODO: forward this to the proper channel (document.trigger?)
return false;
} else {
return result;
}
} else {
return util.regex.fallback.filters[type].test(value);
}
};
util.trim = function(str) {
return str.replace(/^\s*(\S*(\s+\S+)*)\s*$/, "$1");
}
util.debug = function(element) {
var ret = [];
if (element) {
util.mapDOMNodes(element, true, function(node) {
var attributes = [];
if (node.attributes) {
node.attributes.toArray().forEach(function(attr) {
attributes.push(attr.nodeName + '="' + attr.nodeValue + '"');
});
}
var val = '(' + node.nodeType + ') ' + (node.tagName || node.nodeName) + '[' + attributes.join(' ') + '] = "' + node.nodeValue + '"';
ret.push(val);
});
}
return ret.join('\n');
}
/**
* Intercepts a method by replacing the prototype's implementation
* with a wrapper that invokes the given interceptor instead.
*
* utils.intercept(core.Element, 'inserBefore',
* function(_super, args, newChild, refChild) {
* console.log('insertBefore', newChild, refChild);
* return _super.apply(this, args);
* }
* );
*/
util.intercept = function(clazz, method, interceptor) {
var proto = clazz.prototype,
_super = proto[method],
unwrapArgs = interceptor.length > 2;
proto[method] = function() {
if (unwrapArgs) {
var args = Array.prototype.slice.call(arguments);
args.unshift(_super, arguments);
return interceptor.apply(this, args);
}
else {
return interceptor.call(this, _super, arguments);
}
};
};
module.exports = util;