(ctx, oldElt, startNode)
| 165 | } |
| 166 | |
| 167 | function _matchesUpcomingSibling(ctx, oldElt, startNode) { |
| 168 | if (ctx.futureMatches.has(oldElt)) return true; |
| 169 | for (var sibling = startNode.nextSibling, i = 0; sibling && i < 10; sibling = sibling.nextSibling, i++) { |
| 170 | if (sibling instanceof Element && oldElt.isEqualNode(sibling)) { |
| 171 | ctx.futureMatches.add(oldElt); |
| 172 | return true; |
| 173 | } |
| 174 | } |
| 175 | return false; |
| 176 | } |
| 177 | |
| 178 | function _removeNode(ctx, node) { |
| 179 | if (ctx.idMap.has(node)) { |
no outgoing calls
no test coverage detected