/* Copyright or (C) or Copr. GET / ENST, Telecom-Paris, Ludovic Apvrille
 * 
 * ludovic.apvrille AT enst.fr
 * 
 * This software is a computer program whose purpose is to allow the
 * edition of TURTLE analysis, design and deployment diagrams, to
 * allow the generation of RT-LOTOS or Java code from this diagram,
 * and at last to allow the analysis of formal validation traces
 * obtained from external tools, e.g. RTL from LAAS-CNRS and CADP
 * from INRIA Rhone-Alpes.
 * 
 * This software is governed by the CeCILL  license under French law and
 * abiding by the rules of distribution of free software.  You can  use,
 * modify and/ or redistribute the software under the terms of the CeCILL
 * license as circulated by CEA, CNRS and INRIA at the following URL
 * "http://www.cecill.info".
 * 
 * As a counterpart to the access to the source code and  rights to copy,
 * modify and redistribute granted by the license, users are provided only
 * with a limited warranty  and the software's author,  the holder of the
 * economic rights,  and the successive licensors  have only  limited
 * liability.
 * 
 * In this respect, the user's attention is drawn to the risks associated
 * with loading,  using,  modifying and/or developing or reproducing the
 * software by the user in light of its specific status of free software,
 * that may mean  that it is complicated to manipulate,  and  that  also
 * therefore means  that it is reserved for developers  and  experienced
 * professionals having in-depth computer knowledge. Users are therefore
 * encouraged to load and test the software's suitability as regards their
 * requirements in conditions enabling the security of their systems and/or
 * data to be ensured and,  more generally, to use and operate it in the
 * same conditions as regards security.
 * 
 * The fact that you are presently reading this means that you have had
 * knowledge of the CeCILL license and that you accept its terms.
 */




package myutil;

import java.util.ArrayList;

/**
 * Class TreeCell
 * Creation: 21/11/2008
 * Version 2.0 21/11/2008
 * @author Ludovic APVRILLE
 */
public class TreeCell {
   private Object element;
   private ArrayList<TreeCell> children;
   
   public TreeCell() {
	   children = new ArrayList<TreeCell>();
   }
   
   public void setElement(Object _element) {
	   element = _element;
   }
   
   public Object getElement() {
	   return element;
   }
   
   public void addChildren(TreeCell tc) {
	   children.add(tc);
   }
   
   public boolean isLeaf() {
	   return (children.size() == 0);
   }
   
   public int getNbOfChildren() {
	   return children.size();
   }
   
   public TreeCell getChildrenByIndex(int index) {
	   if (index < children.size()) {
		   return children.get(index);
	   }
	   return null;
   }
   
   public boolean containsElement(Object o){
	   if (element == o) {
		   return true;
	   }
	   
	   for(TreeCell tc: children) {
		   if (tc.containsElement(o)) {
			   return true;
		   }
	   }
	   
	   return false;
   }
   
   public ArrayList<TreeCell> getAllLeafs() {
	   ArrayList<TreeCell> leafs = new ArrayList<TreeCell>();
	   if (isLeaf()) {
		   leafs.add(this);
		   return leafs;
	   }
	   
	   for(TreeCell cells: children) {
		   leafs.addAll(cells.getAllLeafs());
	   }
	   
	   return leafs;
   }
   
   public String toString() {
	   String s;
	   if (element == null) {
		   s = "(empty element)";
	   } else {
		   s = "element:" + element.toString();
	   }
	   if (isLeaf()) {
		   s = "Leaf: " + s + "\n";
	   } else {
		   s += "\n I have " + children.size() + " sons\nExploring my sons:\n";
		   for(TreeCell cells: children) {
			   s += cells.toString();
		   }
	   }
	   
	   return s;
   }
}