1 files changed, 62 insertions, 0 deletions
diff --git a/src/de/lmu/ifi/dbs/elki/utilities/datastructures/heap/IntegerMinHeap.java b/src/de/lmu/ifi/dbs/elki/utilities/datastructures/heap/IntegerMinHeap.java
new file mode 100644
index 00000000..f81fe275
--- /dev/null
+++ b/src/de/lmu/ifi/dbs/elki/utilities/datastructures/heap/IntegerMinHeap.java
@@ -0,0 +1,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;
+  }
+}