function retParent(elem, n) {
while (elem && n) {
elem = elem.parentElement;
n--;
}
return elem;
}
4 . n为正 返回后面的兄弟元素节点,n为负 返回前面的 为0 返回自己
function retSibling(elem, n) {
while (elem && n) {
if (n > 0) {
n--;
elem = elem.nextElementSibling
} else {
elem = elem.previousElementSibling
n++
}
}
return elem;
}
function type(Target) {
var template = {
"[object Array]": "Arrat",
"[object Object]": "Object",
"[object Number]": "Object-Number",
"[object Boolean]": "Boolean",
"[object String]": "String",
"[object Function]": "Function"
}
if (Target == null) {
return "null"
} else if (typeof (Target) == "object") {
var str = Object.prototype.toString.call(Target);
return template[str]
} else {
return typeof (Target)
}
}
- 数组去重
Array.prototype.unique = function () {
var obj = {},
arr1 = [];
for (var i = 0; i < this.length; i++) {
if (!obj[this[i]]) {
obj[this[i]] = 'abc';
arr1.push(this[i]);
}
}
return arr1;
}