(Feature node)
| 30 | } |
| 31 | |
| 32 | void push(Feature node) { |
| 33 | a[size] = node; |
| 34 | size++; |
| 35 | int i = size - 1; |
| 36 | while (i > 0) { |
| 37 | int p = (i - 1) / 2; |
| 38 | if (cmp(a[p], a[i])) { |
| 39 | Linear.swap(a, i, p); |
| 40 | i = p; |
| 41 | } else { |
| 42 | break; |
| 43 | } |
| 44 | } |
| 45 | } |
| 46 | |
| 47 | void pop() { |
| 48 | size--; |
no test coverage detected