(expected []expectedNode)
| 61 | } |
| 62 | |
| 63 | func expectedNodesDebugString(expected []expectedNode) string { |
| 64 | debug := "" |
| 65 | for i, node := range expected { |
| 66 | debug += fmt.Sprintf("Node %d: %p\n", i, node.node) |
| 67 | } |
| 68 | |
| 69 | for i, node := range expected { |
| 70 | debug += "\n" |
| 71 | debug += fmt.Sprintf("=== Node %d: %p ===\n", i, node.node) |
| 72 | debug += edgeMapsDebugString(node.in, node.out) |
| 73 | } |
| 74 | return debug |
| 75 | } |
| 76 | |
| 77 | // edgeMapsEqual checks if all the edges in this equal all the edges in that. |
| 78 | func edgeMapsEqual(this, that EdgeMap) bool { |
no test coverage detected
searching dependent graphs…