-
Notifications
You must be signed in to change notification settings - Fork 0
/
DomTraverse.js
145 lines (132 loc) · 3.77 KB
/
DomTraverse.js
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
var DomTraverse = {
getPrevBeginTagNode: function (node) {
if (!node.previousSibling) {
return node.parentNode;
} else {
var leaf = node.previousSibling;
while (leaf.lastChild) {
leaf = leaf.lastChild;
}
return leaf;
}
},
getNextBeginTagNode: function (node) {
if (node.firstChild) {
return node.firstChild;
} else {
while (node && !node.nextSibling) {
node = node.parentNode;
}
return node ? node.nextSibling : node;
}
},
getPrevEndTagNode: function (node) {
if (node.lastChild) {
return node.lastChild;
} else {
while (node && !node.previousSibling) {
node = node.parentNode;
}
return node ? node.previousSibling : node;
}
},
getNextEndTagNode: function (node) {
if (!node.nextSibling) {
return node.parentNode;
} else {
var leaf = node.nextSibling;
while (leaf.firstChild) {
leaf = leaf.firstChild;
}
return leaf;
}
},
getPrevBeginTagLeaf: function (node) {
var leaf = DomTraverse.getPrevBeginTagNode(node);
while (leaf && leaf.firstChild) {
leaf = DomTraverse.getPrevBeginTagNode(leaf);
}
return leaf;
},
getNextBeginTagLeaf: function (node) {
var leaf = DomTraverse.getNextBeginTagNode(node);
while (leaf && leaf.firstChild) {
leaf = DomTraverse.getNextBeginTagNode(leaf);
}
return leaf;
},
getPrevEndTagLeaf: function (node) {
var leaf = DomTraverse.getPrevEndTagNode(node);
while (leaf && leaf.firstChild) {
leaf = DomTraverse.getPrevEndTagNode(leaf);
}
return leaf;
},
getNextEndTagLeaf: function (node) {
var leaf = DomTraverse.getNextEndTagNode(node);
while (leaf && leaf.firstChild) {
leaf = DomTraverse.getNextEndTagNode(leaf);
}
return leaf;
}
};
function getPrevNodeByLever(node) {
if (node.previousSibling) {
return node.previousSibling;
} else {
var result = [document.documentElement],
currentNode,
childNodes,
index = 0;
while (index < result.length) {
currentNode = result[index];
if (node.parentNode === currentNode) {
return result.pop();
}
childNodes = currentNode.childNodes;
[].push.apply(result, childNodes);
index++;
}
return undefined;
}
}
function getNextNodeByLever(node) {
if (node.nextSibling) {
return node.nextSibling;
} else {
var result = [document.documentElement],
currentNode,
childNodes,
index = 0,
_index = Infinity;
while (index < result.length) {
currentNode = result[index];
if (node.parentNode === currentNode) {
_index = result.length;
}
childNodes = currentNode.childNodes;
[].push.apply(result, childNodes);
index++;
if (result.length > _index) {
break;
}
}
return result[_index];
}
}
function getAllNodesByLevel() {
var levelMap = [[document.documentElement]],
level = 0;
while (level < levelMap.length) {
var curLevel = levelMap[level],
nextLevel = [];
for (var j = 0, l = curLevel.length; j < l; j++) {
Array.prototype.push.apply(nextLevel, curLevel[j].childNodes)
}
if (nextLevel.length) {
levelMap.push(nextLevel);
}
level++
}
return levelMap;
}