Javascript node traversal Function

A group of Functions found on Firefox's official website is equivalent to treewalker. With this function, you can easily implement all the functions of traversal API 2 in IE (nextelementsibling, previuselementsibling, firstelementchild, lastelementchild, children) these functions let you find the next sibling, previous sibling, first child, and last child of a given node (element ). what makes them unique is that they safely ignore whitespace nodes so you get the real node you're looking for each time. CopyCode The Code is as follows: function is_all_ws (NOD) {return! (/[^ \ T \ n \ r]/. Test (nod. Data ));}
Function is_ignorable (NOD) {return (nod. nodetype = 8) | (nod. nodetype = 3) & is_all_ws (NOD ));}
Function node_before (SIB ){
While (SIB = SIB. previussibling )){
If (! Is_ignorable (SIB) return SIB;
}
Return NULL;
}
Function node_after (SIB ){
While (SIB = SIB. nextsibling )){
If (! Is_ignorable (SIB) return SIB;
}
Return NULL;
}
Function first_child (PAR ){
VaR res = par. firstchild;
While (RES ){
If (! Is_ignorable (RES) return res;
Res = res. nextsibling;
}
Return NULL;
}
Function last_child (PAR ){
VaR res = par. lastchild;
While (RES ){
If (! Is_ignorable (RES) return res;
Res = res. previussibling;
}
Return NULL;
}