* Given any node return the first leaf node without children. * * @param {DOMElement|DOMTextNode} node * @return {DOMElement|DOMTextNode}
(node)
| 16871 | */ |
| 16872 | |
| 16873 | function getLeafNode(node) { |
| 16874 | while (node && node.firstChild) { |
| 16875 | node = node.firstChild; |
| 16876 | } |
| 16877 | return node; |
| 16878 | } |
| 16879 | |
| 16880 | /** |
| 16881 | * Get the next sibling within a container. This will walk up the |
no outgoing calls
no test coverage detected
searching dependent graphs…