EDIT

/**

* Copyright (C) 2007 EDIT

* European Distributed Institute of Taxonomy 

* http://www.e-taxonomy.eu

* 

* The contents of this file are subject to the Mozilla Public License Version 1.1

* See LICENSE.TXT at the top of this package for the full license terms.

*/

package eu.etaxonomy.cdm.model.description;

import java.util.ArrayList;

import java.util.List;

import java.util.UUID;

import javax.persistence.Entity;

import javax.persistence.ManyToOne;

import javax.persistence.Transient;

import org.apache.log4j.Logger;

import org.hibernate.annotations.Cascade;

import org.hibernate.annotations.CascadeType;

import eu.etaxonomy.cdm.model.common.TermBase;

/**

 * Feature type trees arrange feature types (characters). They may also be used to

 * define flat feature types subsets for filtering purposes. 

 * A feature type tree is build out of feature type nodes, which can be hierarchically organised.

 * @author m.doering

 * @version 1.0

 * @created 08-Nov-2007 13:06:16

 */

@Entity

public class FeatureTree extends TermBase {

	static Logger logger = Logger.getLogger(FeatureTree.class);

	//private Set<FeatureNode> nodes = new HashSet<FeatureNode>();

	private FeatureNode root;

	private boolean isDescriptionSeparated = false;

	/**

	 * @return the isDescriptionSeperated

	 */

	public boolean isDescriptionSeparated() {

		return isDescriptionSeparated;

	}

	/**

	 * @param isDescriptionSeperated the isDescriptionSeperated to set

	 */

	public void setDescriptionSeparated(boolean isDescriptionSeperated) {

		this.isDescriptionSeparated = isDescriptionSeperated;

	}

	public static FeatureTree NewInstance(){

		return new FeatureTree();

	}

	public static FeatureTree NewInstance(UUID uuid){

		FeatureTree result =  new FeatureTree();

		result.setUuid(uuid);

		return result;

	}

	public static FeatureTree NewInstance(List<Feature> featureList){

		FeatureTree result =  new FeatureTree();

		FeatureNode root = result.getRoot();

		for (Feature feature : featureList){

			FeatureNode child = FeatureNode.NewInstance(feature);

			root.addChild(child);	

		}

		return result;

	}

	protected FeatureTree() {

		super();

		root = FeatureNode.NewInstance();

	}

//	@OneToMany

//	@Cascade({CascadeType.SAVE_UPDATE})

//	public Set<FeatureNode> getNodes() {

//		return nodes;

//	}

//	public void setNodes(Set<FeatureNode> nodes) {

//		this.nodes = nodes;

//	}

	@ManyToOne

	@Cascade({CascadeType.SAVE_UPDATE})

	public FeatureNode getRoot() {

		return root;

	}

	public void setRoot(FeatureNode root) {

		this.root = root;

	}

	@Transient

	public List<FeatureNode> getRootChildren(){

		List<FeatureNode> result = new ArrayList<FeatureNode>();

		result.addAll(root.getChildren());

		return result;

	}

}