(heap)
| 2423 | return heap.length === 0 ? null : heap[0]; |
| 2424 | } |
| 2425 | function pop(heap) { |
| 2426 | if (heap.length === 0) { |
| 2427 | return null; |
| 2428 | } |
| 2429 | |
| 2430 | var first = heap[0]; |
| 2431 | var last = heap.pop(); |
| 2432 | |
| 2433 | if (last !== first) { |
| 2434 | heap[0] = last; |
| 2435 | siftDown(heap, last, 0); |
| 2436 | } |
| 2437 | |
| 2438 | return first; |
| 2439 | } |
| 2440 | |
| 2441 | function siftUp(heap, node, i) { |
| 2442 | var index = i; |
no test coverage detected