MyBank

JCO

JWAA

Java+

ALE

Academia

Mideast

Cox

Installation

Documentation

Source

Changes

License

Demo

TreeNode.java

package edu.virtualschool.jwaa;

import java.util.ArrayList;
import java.util.Iterator;

import org.apache.log4j.Logger;

public abstract class TreeNode
{
  private TreeNode parentNode = null;
  private final ArrayList childNodeList = new ArrayList();
  
  final static Logger logger = Logger.getLogger(TreeNode.class.getName());

  public TreeNode() { }
  public final void addChildNode(TreeNode child)
  {
    if (child != null)
      child.setParentNode(this);
  }
  public final void addChildNodeArray(TreeNode[] c)
  {
    for (int i = 0; i < c.length; i++)
      addChildNode(c[i]);
  }
  public final void removeChildNode(TreeNode child)
  {
    if (child != null)
        child.setParentNode(null);
  }
  public final void removeAllChildNodes()
  {
    for (Iterator iterator = childrenIterator(); iterator.hasNext(); )
    {
      TreeNode child = (TreeNode)iterator.next();
      removeChildNode(child);
    }
  }
  public final TreeNode getParentNode() { return parentNode; }
  public final void detachFromParent()
  {
    setParentNode(null);
  }
  private final TreeNode setParentNode(TreeNode newParent)
  {
    TreeNode oldParent = parentNode;
    if (parentNode == newParent)
      return parentNode;
    if (oldParent != null && oldParent != newParent)
    {
      logger.warn("reparenting "+this+"\nfrom "+oldParent+"\nto "+newParent);
      oldParent.childNodeList.remove(this);
    }
    if (newParent != null)
      newParent.childNodeList.add(this);
    this.parentNode = newParent;
    return oldParent;
  }
  public final int getDepth() 
  {
    int depth = 0;
    for(TreeNode node = this; node != null; node = node.parentNode)
      depth++;
    return depth;
  }
  public final ArrayList getRootPath()
  {
    ArrayList path = new ArrayList();
    for (TreeNode node = this; node != null; node = node.parentNode)
        path.add(node);
    return path;
  }
  public final TreeNode getRootNode()
  {
    TreeNode node = null;
    for (node = this; node != null; node = node.parentNode)
      if (node.parentNode == null)
        break;
    return node;
  }
  public final Iterator childrenIterator() 
  { 
    return childNodeList.iterator(); 
  }
//  public final ArrayList getChildNodeList() 
//  { 
//    return childNodeList; 
//  }
  public final boolean isChildNodeOf(TreeNode thatNode)
  {
    for (TreeNode thisNode = this; thisNode != null; thisNode = thisNode.parentNode)
      if (thisNode == thatNode) return true;
    return false;
  }
  public final boolean isRootNode() { return parentNode == null; }
  public final TreeNode nextSiblingNode()
  {
    if (parentNode == null) return null;
    ArrayList siblings = parentNode.childNodeList;
    int index = siblings.indexOf(this);
    if (index+1 < siblings.size()) return (TreeNode)siblings.get(index+1);
    else return null;
  }
  public final TreeNode prevSiblingNode()
  {
    if (parentNode == null) return null;
    ArrayList siblings = parentNode.childNodeList;
    int index = siblings.indexOf(this);
    if (index-1 >= 0) return (TreeNode)siblings.get(index-1);
    else return parentNode;
  }
  public final void accept(Visitor visitor)
  {
    visitor.visit(this);
    if (visitor.isDone()) return;
    for (Iterator e = childNodeList.iterator(); e.hasNext(); )
    {
      TreeNode child = (TreeNode)e.next();
      child.accept(visitor);
    }
  }
}