(heap, node)
| 2124 | |
| 2125 | "use strict"; |
| 2126 | function push(heap, node) { |
| 2127 | var index = heap.length; |
| 2128 | heap.push(node); |
| 2129 | a: for (; 0 < index; ) { |
| 2130 | var parentIndex = (index - 1) >>> 1, |
| 2131 | parent = heap[parentIndex]; |
| 2132 | if (0 < compare(parent, node)) |
| 2133 | (heap[parentIndex] = node), (heap[index] = parent), (index = parentIndex); |
| 2134 | else break a; |
| 2135 | } |
| 2136 | } |
| 2137 | function peek(heap) { |
| 2138 | return 0 === heap.length ? null : heap[0]; |
| 2139 | } |
no test coverage detected
searching dependent graphs…