BinaryInnerNode.java

/*
 * 
 * Copyright 2012 lexergen.
 * This file is part of lexergen.
 * 
 * lexergen is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 * 
 * lexergen 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 General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public License
 * along with lexergen.  If not, see <http://www.gnu.org/licenses/>.
 *  
 * lexergen:
 * A tool to chunk source code into tokens for further processing in a compiler chain.
 * 
 * Projectgroup: bi, bii
 * 
 * Authors: Johannes Dahlke
 * 
 * Module:  Softwareprojekt Übersetzerbau 2012 
 * 
 * Created: Apr. 2012 
 * Version: 1.0
 *
 */

package de.fuberlin.bii.regextodfaconverter.directconverter.syntaxtree.node;

import de.fuberlin.bii.utils.Test;


/**
 * Stellt einen binären inneren Knoten in einem {@link Tree Baum} dar.
 * Ein binärer Knoten hat zwei  Kinder.
 * 
 * @author Johannes Dahlke
 *
 */
@SuppressWarnings("rawtypes")
public class BinaryInnerNode<Value> extends InnerNode<Value> {
	
	private Leaf leftDummyNode = new Leaf<Value>( null);
	private Leaf rightDummyNode = new Leaf<Value>( null);
	
	public BinaryInnerNode( Value value) {
		this( value, null, null);
	}
	
	public BinaryInnerNode( Value value, TreeNode leftChildNode, TreeNode rightChildNode) {
		this( null, value, leftChildNode, rightChildNode);
	}
	
	@SuppressWarnings("unchecked")
	public BinaryInnerNode( BinaryInnerNode parentNode, Value value, TreeNode leftChildNode, TreeNode rightChildNode) {
		super( parentNode, value);
		setLeftChildNode( leftChildNode);
		setRightChildNode( rightChildNode);
	}
	



	public void setRightChildNode( TreeNode rightChildNode) {
		if ( Test.isUnassigned( rightChildNode))
			rightChildNode = rightDummyNode;
		if ( childCount() == 0)
			setLeftChildNode( null);
		insertChild( rightChildNode, 1);
	}

	public void setLeftChildNode( TreeNode leftChildNode) {
		if ( Test.isUnassigned( leftChildNode))
			leftChildNode = leftDummyNode;
		insertChild( leftChildNode, 0);	
	}
	
	public TreeNode getRightChildNode() {
		if ( childCount() >= 2)
			return getNodeWithIndex( 1);
		// otherwise
		return null;
	}

	public TreeNode getLeftChildNode() {
		if ( childCount() >= 1)
			return getNodeWithIndex( 0);
		// otherwise
		return null;
	}
	
	@Deprecated // use setLeftCildNode etc. instead
	@Override
	public boolean insertChild( TreeNode childNode, int index) {
		if ( index <= 0)
			index = 0;
		if ( index >= 1)
			index = 1;
		if ( childCount() > index)
			super.removeChildWithIndex( index);
		return super.insertChild( childNode, index);
	}

	@Override
	protected boolean canAddChild( TreeNode childNode) {
		return true; // there are no constraints
	}


	
}
/* OLD VERSION
public class BinaryTreeNode extends  {
	
	private static int leafCounter = 0;
  private int position; 
	
	public NodeValue nodeValue; 
	public BinaryTreeNode leftChildNode;
	public BinaryTreeNode rightChildNode;
	public BinaryTreeNode parentNode;
	
	public BinaryTreeNode( NodeValue nodeValue, BinaryTreeNode leftChildNode, BinaryTreeNode rightChildNode) {
		super();
		this.nodeValue = nodeValue;
		position = nodeValue instanceof Terminal ? ++leafCounter : 0;
		
		this.leftChildNode = leftChildNode;
		if ( Test.isAssigned( this.leftChildNode))
  		this.leftChildNode.parentNode = this;
		
		this.rightChildNode = rightChildNode;
		if ( Test.isAssigned( this.rightChildNode))
		  this.rightChildNode.parentNode = this;
	}
	
	@Override
	public String toString() {
		String result = "";

		 result += " ( ";
     result += Test.isAssigned( leftChildNode) ? leftChildNode.toString() : "null";
     result += " ) <-- ";
     result += (Test.isAssigned( nodeValue) ? nodeValue.toString() : "null") + (nodeValue instanceof Terminal ? ":" +position : "");
     result += " --> ( ";
     result += Test.isAssigned( rightChildNode) ? rightChildNode.toString() : "null";
     result += " ) ";
		return result;	
	}
	
	
	public int getPosition() {
		return position;
	}
}
*/