1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
|
package de.lmu.ifi.dbs.elki.utilities.datastructures.heap;
/*
This file is part of ELKI:
Environment for Developing KDD-Applications Supported by Index-Structures
Copyright (C) 2014
Ludwig-Maximilians-Universität München
Lehr- und Forschungseinheit für Datenbanksysteme
ELKI Development Team
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
import java.util.Comparator;
/**
* Heap class that is bounded in size from the top. It will keep the bottom
* {@code k} Elements only.
*
* @author Erich Schubert
*
* @param <E> Element type. Should be {@link Comparable} or a {@link Comparator}
* needs to be given.
*/
public class TopBoundedUpdatableHeap<E> extends UpdatableHeap<E> {
/**
* Maximum size.
*/
protected int maxsize;
/**
* Constructor with maximum size only.
*
* @param maxsize Maximum size
*/
public TopBoundedUpdatableHeap(int maxsize) {
this(maxsize, null);
}
/**
* Constructor with maximum size and {@link Comparator}.
*
* @param maxsize Maximum size
* @param comparator Comparator
*/
public TopBoundedUpdatableHeap(int maxsize, Comparator<? super E> comparator) {
super(maxsize + 1, comparator);
this.maxsize = maxsize;
assert (maxsize > 0);
}
@Override
public void offerAt(int pos, E e) {
// don't add if we hit maxsize and are worse
if (pos != NO_VALUE || super.size() < maxsize) {
super.offerAt(pos, e);
return;
}
if (compare(e, queue[0]) < 0) {
// while we did not change, this still was "successful".
return;
}
E prev = super.replaceTopElement(e);
handleOverflow(prev);
}
/**
* Test if the priority of an object is higher.
*
* @param e New object
* @param object Reference object
* @return True when an update is needed
*/
protected int compare(Object e, Object object) {
if (comparator == null) {
@SuppressWarnings("unchecked")
Comparable<Object> c = (Comparable<Object>) e;
return c.compareTo(queue[0]);
} else {
return comparator.compare(e, queue[0]);
}
}
/**
* Handle an overflow in the structure. This function can be overridden to get
* overflow treatment.
*
* @param e Overflowing element.
*/
protected void handleOverflow(E e) {
// index.remove(e); // Should not be needed.
}
/**
* Get the maximum size.
*
* @return the maximum size
*/
public int getMaxSize() {
return maxsize;
}
}
|
