public SortedBin getMinBin() {
            SortedBin minBin = this;
            SortedBin bin = this;
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            bin = bin.nextNonEmpty;
            if (bin == null) {
                return minBin;
            }
            if (bin.lv < minBin.lv) {
                minBin = bin;
            }
            return minBin;
        }
add a key value pair to the heap

@param key   the key to insert
@param value the value to insert object
main/src/main/java/cgeo/geocaching/brouter/util/SortedHeap.java