X-Git-Url: https://git.pterodactylus.net/?a=blobdiff_plain;f=src%2Fnet%2Fpterodactylus%2Futil%2Fdata%2FNode.java;h=950ed990874b31058b57f3b9a426904fba065808;hb=8cc2883a3e6b701006a01cb9eb0bc116dfead5fe;hp=7737d5027c649766523224194db23bdc868e5b28;hpb=415d6680a02bfbd85ad3f154a7c7f2aee5453549;p=jSite2.git

diff --git a/src/net/pterodactylus/util/data/Node.java b/src/net/pterodactylus/util/data/Node.java
index 7737d50..950ed99 100644
--- a/src/net/pterodactylus/util/data/Node.java
+++ b/src/net/pterodactylus/util/data/Node.java
@@ -1,6 +1,7 @@
 
 package net.pterodactylus.util.data;
 
+import java.util.Comparator;
 import java.util.Iterator;
 
 /**
@@ -12,7 +13,7 @@ import java.util.Iterator;
  * @param <E>
  *            The type of the element to store
  */
-public interface Node<E> extends Iterable<Node<E>> {
+public interface Node<E extends Comparable<E>> extends Iterable<Node<E>>, Comparable<Node<E>> {
 
 	/**
 	 * Returns the parent node of the node.
@@ -54,6 +55,58 @@ public interface Node<E> extends Iterable<Node<E>> {
 	public Node<E> getChild(int index);
 
 	/**
+	 * Returns the direct child node that contains the given element.
+	 * 
+	 * @param element
+	 *            The element
+	 * @return The direct child node containing the given element, or
+	 *         <code>null</code> if this node does not have a child node
+	 *         containing the given element
+	 */
+	public Node<E> getChild(E element);
+
+	/**
+	 * Returns whether the given node is a direct child of this node.
+	 * 
+	 * @param childNode
+	 *            The child node
+	 * @return <code>true</code> if the given node is a direct child of this
+	 *         node, <code>false</code> otherwise
+	 */
+	public boolean hasChild(Node<E> childNode);
+
+	/**
+	 * Returns whether this node contains a child node containing the given
+	 * element.
+	 * 
+	 * @param element
+	 *            The element
+	 * @return <code>true</code> if this node contains a direct child node
+	 *         containing the given element, <code>false</code> otherwise
+	 */
+	public boolean hasChild(E element);
+
+	/**
+	 * Returns the index of the given child node.
+	 * 
+	 * @param childNode
+	 *            The child node
+	 * @return The index of the child node, or <code>-1</code> if the child
+	 *         node is not a child node of this node
+	 */
+	public int getIndexOfChild(Node<E> childNode);
+
+	/**
+	 * Returns the index of the child node containing the given element.
+	 * 
+	 * @param element
+	 *            The element
+	 * @return The index of the child node, or <code>-1</code> if the child
+	 *         node is not a child node of this node
+	 */
+	public int getIndexOfChild(E element);
+
+	/**
 	 * Remove the given child node from this node. If the given node is not a
 	 * child of this node, nothing happens.
 	 * 
@@ -80,8 +133,37 @@ public interface Node<E> extends Iterable<Node<E>> {
 	public void removeChild(int childIndex);
 
 	/**
+	 * Removes all children from this node.
+	 */
+	public void removeAllChildren();
+
+	/**
 	 * {@inheritDoc}
 	 */
 	public Iterator<Node<E>> iterator();
 
+	/**
+	 * Searches this node’s children recursively for a node that contains the
+	 * given element.
+	 * 
+	 * @param element
+	 *            The element to search
+	 * @return The node that contains the given element, or <code>null</code>
+	 *         if no node could be found
+	 */
+	public Node<E> findChild(E element);
+
+	/**
+	 * Sorts all children according to their natural order.
+	 */
+	public void sortChildren();
+
+	/**
+	 * Sorts all children with the given comparator.
+	 * 
+	 * @param comparator
+	 *            The comparator used to sort the children
+	 */
+	public void sortChildren(Comparator<Node<E>> comparator);
+
 }
\ No newline at end of file