|
| 1 | +package org.jetbrains.kotlinx.jupyter.ext.graph.structure |
| 2 | + |
| 3 | +import org.jetbrains.kotlinx.jupyter.api.graphs.GraphNode |
| 4 | + |
| 5 | +val <T> GraphNode<T>.allParents: Iterable<GraphNode<T>> get() { |
| 6 | + return IterablesView(listOf(inNodes, outNodes, biNodes)) |
| 7 | +} |
| 8 | + |
| 9 | +private class IterablesView<T>(private val iterables: Iterable<Iterable<T>>) : Iterable<T> { |
| 10 | + override fun iterator(): Iterator<T> { |
| 11 | + return MyIterator(iterables) |
| 12 | + } |
| 13 | + |
| 14 | + class MyIterator<T>(iterables: Iterable<Iterable<T>>) : Iterator<T> { |
| 15 | + private val outerIterator = iterables.iterator() |
| 16 | + private var innerIterator: Iterator<T>? = null |
| 17 | + |
| 18 | + override fun hasNext(): Boolean { |
| 19 | + while (innerIterator?.hasNext() != true) { |
| 20 | + if (!outerIterator.hasNext()) return false |
| 21 | + innerIterator = outerIterator.next().iterator() |
| 22 | + } |
| 23 | + return true |
| 24 | + } |
| 25 | + |
| 26 | + override fun next(): T { |
| 27 | + if (!hasNext()) throw IndexOutOfBoundsException() |
| 28 | + return innerIterator!!.next() |
| 29 | + } |
| 30 | + } |
| 31 | +} |
| 32 | + |
| 33 | +fun <T> GraphNode<T>.populate( |
| 34 | + nodes: MutableSet<GraphNode<T>>, |
| 35 | + directedEdges: MutableCollection<DirectedEdge<T>>, |
| 36 | + undirectedEdges: MutableCollection<UndirectedEdge<T>>, |
| 37 | +) { |
| 38 | + nodes.add(this) |
| 39 | + for (parent in inNodes) { |
| 40 | + directedEdges.add(DirectedEdge(parent, this)) |
| 41 | + } |
| 42 | + for (parent in outNodes) { |
| 43 | + directedEdges.add(DirectedEdge(this, parent)) |
| 44 | + } |
| 45 | + for (parent in this.biNodes) { |
| 46 | + undirectedEdges.add(UndirectedEdge(this, parent)) |
| 47 | + } |
| 48 | + for (parent in allParents) { |
| 49 | + if (parent !in nodes) parent.populate(nodes, directedEdges, undirectedEdges) |
| 50 | + } |
| 51 | +} |
0 commit comments