(node: Element, expectedNode: any[], currentIndex: number)
| 1402 | } |
| 1403 | |
| 1404 | function checkNodeDescendants(node: Element, expectedNode: any[], currentIndex: number) { |
| 1405 | let expectedDescendant = 0; |
| 1406 | |
| 1407 | for (let i = currentIndex + 1; i < expectedTree.length; ++i) { |
| 1408 | if (expectedTree[i].length > expectedNode.length) { |
| 1409 | ++expectedDescendant; |
| 1410 | } else if (expectedTree[i].length === expectedNode.length) { |
| 1411 | break; |
| 1412 | } |
| 1413 | } |
| 1414 | |
| 1415 | const actualDescendant = getNodes(node).length; |
| 1416 | if (actualDescendant !== expectedDescendant) { |
| 1417 | missedExpectations.push( |
| 1418 | `Expected node descendant num to be ${expectedDescendant} but was ${actualDescendant}`, |
| 1419 | ); |
| 1420 | } |
| 1421 | } |
| 1422 | |
| 1423 | getNodes(treeElement).forEach((node, index) => { |
| 1424 | const expected = expectedTree ? expectedTree[index] : null; |
no test coverage detected
searching dependent graphs…