blob: f81fe275ae4c9649ba68210f21664c87313db3a6 (
plain)
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
|
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) 2012
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/>.
*/
/**
* Basic in-memory heap structure.
*
* This heap is built lazily: if you first add many elements, then poll the
* heap, it will be bulk-loaded in O(n) instead of iteratively built in O(n log
* n). This is implemented via a simple validTo counter.
*
* @author Erich Schubert
*/
public class IntegerMinHeap extends IntegerHeap {
/**
* Constructor with default capacity.
*/
public IntegerMinHeap() {
super(DEFAULT_INITIAL_CAPACITY);
}
/**
* Constructor with initial capacity.
*
* @param size initial capacity
*/
public IntegerMinHeap(int size) {
super(size);
}
/**
* Compare two objects
*
* @param o1 First object
* @param o2 Second object
*/
@Override
protected boolean comp(int o1, int o2) {
return o1 > o2;
}
}
|
