Method pop

src/main/java/de/bwaldvogel/liblinear/Heap.java:47–64

()

    }

    void pop() {
        size--;
        a[0] = a[size];
        int i = 0;
        while (i * 2 + 1 < size) {
            int l = i * 2 + 1;
            int r = i * 2 + 2;
            if (r < size && cmp(a[l], a[r])) {
                l = r;
            }
            if (cmp(a[i], a[l])) {
                Linear.swap(a, i, l);
                i = l;
            } else {
                break;
            }
        }
    }

    Feature top() {
        return this.a[0];