1 files changed, 58 insertions, 0 deletions
diff --git a/elki/src/main/java/de/lmu/ifi/dbs/elki/index/tree/metrical/mtreevariants/mtree/MTreeNode.java b/elki/src/main/java/de/lmu/ifi/dbs/elki/index/tree/metrical/mtreevariants/mtree/MTreeNode.java
new file mode 100644
index 00000000..db8f4a19
--- /dev/null
+++ b/elki/src/main/java/de/lmu/ifi/dbs/elki/index/tree/metrical/mtreevariants/mtree/MTreeNode.java
@@ -0,0 +1,58 @@
+package de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mtree;
+
+/*
+ This file is part of ELKI:
+ Environment for Developing KDD-Applications Supported by Index-Structures
+
+ Copyright (C) 2015
+ 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 de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.AbstractMTreeNode;
+import de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.MTreeEntry;
+
+/**
+ * Represents a node in an M-Tree.
+ * 
+ * @author Elke Achtert
+ * @param <O> Object type
+ */
+public class MTreeNode<O> extends AbstractMTreeNode<O, MTreeNode<O>, MTreeEntry> {
+  /**
+   * Serial version
+   */
+  private static final long serialVersionUID = 1;
+
+  /**
+   * Empty constructor for Externalizable interface.
+   */
+  public MTreeNode() {
+    // empty constructor
+  }
+
+  /**
+   * Creates a new MTreeNode with the specified parameters.
+   * 
+   * @param capacity the capacity (maximum number of entries plus 1 for
+   *        overflow) of this node
+   * @param isLeaf indicates whether this node is a leaf node
+   */
+  public MTreeNode(int capacity, boolean isLeaf) {
+    super(capacity, isLeaf, MTreeEntry.class);
+  }
+}
+\ No newline at end of file