//所有浏览器都兼容的将伪数组转化为数组的方法
function convertToArray(nodes) {
var array=null;
try {
array = Array.prototype.slice.call(nodes,0);
}catch (ex){
array = new Array();
for(var i=0,len = nodes.length;i<len;i++){
array.push(nodes[i]);
}
}
return array;
}
//判断是否是第一个、最后一个节点
function isFirstAndLastNode(nodes) {
if(nodes.nextSibling ===null){
alert("the last node in the parent's childNodes list."+nodes);
}else if (nodes.previousSibling ===null){
alert("the first node in the parent's childNodes list."+nodes);
}
}
//判断是否含有子节点
function isHasChildNodes(someNode) {
return someNode.hasChildNodes();
}
//向节点的子节点末尾添加一个子节点
function appendChildNodes(someNode,node) {
var returnNode = someNode.appendChild(node);
alert(returnNode==node);
return someNode;
}
//向节点的某个子节点之前添加一个新节点
function insertChildNode(someNode,newNode,insertBeforeNode) {
var returnNode=someNode.insertBefore(newNode,insertBeforeNode); //当insertBeforeNode==null 相当于上一个方法
return someNode;
}
//替换一个子节点
function replaceOneChildNode(someNode,newNode,replaceNode) {
var returnNode = someNode.replaceChild(newNode,replaceNode);
return someNode;
}
//移除某个子节点
function removeOneChildNode(someNode,removeNode) {
var returnNode = someNode.removeChild(removeNode);
return someNode;
}
//对节点实行深复制(复制节点和整个节点树)
function deepCopy(someNode) {
var deepList = someNode.cloneNode(true); //>0
alert(deepList.length);
}
//对节点实行浅复制(只复制节点本身)
function shallCopy(someNode) {
var shallList = someNode.cloneNode(false);
alert(shallList.length); //0
}
js,Dom操作
最新推荐文章于 2025-04-13 17:55:49 发布