TraceTestGroup.java

/*
 * #%~
 * Combinatorial Testing
 * %%
 * Copyright (C) 2008 - 2014 Overture
 * %%
 * This program 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.
 * 
 * This program 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 this program.  If not, see
 * <http://www.gnu.org/licenses/gpl-3.0.html>.
 * #~%
 */
package org.overture.ide.plugins.combinatorialtesting.views.treeView;

import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.util.Vector;

import org.overture.ct.utils.TraceHelperNotInitializedException;
import org.overture.ct.utils.TraceTestResult;
import org.overture.interpreter.traces.Verdict;
import org.xml.sax.SAXException;

public class TraceTestGroup extends TraceTestTreeNode
{
	public static final Long GROUP_SIZE = new Long(200);
	Long startNumber;
	Long stopNumber;
	Verdict lastKnownStatus = null;

	public TraceTestGroup(Long startNumber, Long stopNumber)
	{
		super(null);
		this.startNumber = startNumber;
		this.stopNumber = stopNumber - 1;
		
		children = new ArrayList<ITreeNode>();
		addChild(new NotYetReadyTreeNode());

	}
	
	@Override
	public Integer getNumber()
	{
	return startNumber.intValue();
	}

	private List<ITreeNode> children;

	@Override
	public String toString()
	{
		return "[" + startNumber + "..." + stopNumber + "]";
	}

	@Override
	public String getName()
	{
		return toString();
	}


	@Override
	public Object getAdapter(@SuppressWarnings("rawtypes") Class adapter)
	{
		return null;
	}

	@Override
	public void addChild(ITreeNode child)
	{
		if (!children.contains(child))
		{
			boolean contains = false;
			for (ITreeNode node : getChildren())
			{

				if (node.getName().equals(child.getName()))
				{
					contains = true;
				}
			}
			if (!contains)
			{
				children.add(child);
				child.setParent(this);
			}
		}
	}

	public void removeChild(ITreeNode child)
	{
		children.remove(child);
		if (child instanceof TraceTestGroup)
		{
			((TraceTestGroup) child).removeChildern();
		}
		child.setParent(null);
	}

	@Override
	public List<ITreeNode> getChildren()
	{
		return children;
	}

	@Override
	public boolean hasChildren()
	{
		return stopNumber - startNumber > 0;
	}

	@Override
	public boolean hasChild(String name)
	{
		for (ITreeNode node : children)
		{
			if (node.getName().equals(name))
			{
				return true;
			}

		}
		return false;
	}

	@Override
	public Verdict getStatus()
	{
		if (lastKnownStatus == null)
		{
			Verdict status = null;

			for (ITreeNode n : children)
			{
				if (n instanceof TraceTestTreeNode)
				{
					TraceTestTreeNode node = (TraceTestTreeNode) n;
					status = calculateStatus(status, node.getStatus());
				}
			}
			lastKnownStatus = status;
		}
		return lastKnownStatus;
	}

	private Verdict calculateStatus(Verdict status, Verdict nextStatus)
	{

		if (nextStatus == Verdict.FAILED)
		{
			return nextStatus;
		} else if (nextStatus == Verdict.INCONCLUSIVE
				&& status != Verdict.FAILED)
		{
			return nextStatus;
		} else if (nextStatus == Verdict.PASSED && status == null)
		{
			status = nextStatus;
		}

		return status;
	}

	public void loadGroupStatus() throws SAXException, IOException,
			ClassNotFoundException, TraceHelperNotInitializedException
	{
		TraceTreeNode t = getTraceParent(this);
		if (t != null)
		{

			List<TraceTestResult> traceStatus = t.getTraceStore().getTraceTests(startNumber.intValue(), stopNumber.intValue());
			Verdict status = null;
			for (TraceTestResult traceTestStatus : traceStatus)
			{
				lastKnownStatus = calculateStatus(status, traceTestStatus.getStatus());
				if (lastKnownStatus == Verdict.FAILED)
				{
					break;
				}
			}

		}
	}

	private void loadTestNodes() throws Exception
	{
		TraceTreeNode t = getTraceParent(this);
		if (t != null)
		{

			List<TraceTestResult> traceStatus = t.getTraceStore().getTraceTests(startNumber.intValue(), stopNumber.intValue());

			for (TraceTestResult traceTestStatus : traceStatus)
			{
				this.addChild(new TraceTestTreeNode(traceTestStatus));
			}
		}
	}

	private TraceTreeNode getTraceParent(ITreeNode node)
	{
		if (node.getParent() == null)
		{
			return null;
		} else if (node.getParent() instanceof TraceTreeNode)
		{
			return (TraceTreeNode) node.getParent();
		} else
		{
			return getTraceParent(node.getParent());
		}
	}

	public void loadTests() throws Exception
	{
		removeChildern();


		Long size = stopNumber - startNumber;

		GroupSizeCalculator gs = new GroupSizeCalculator(size);

		if (!gs.hasGroups())
		{
			loadTestNodes();
		} else
		{

			Long currentCount = startNumber - 1;
			for (int i = 0; i < gs.getNumberOfGroups() - 1; i++)
			{
				TraceTestGroup group = new TraceTestGroup(currentCount + 1, currentCount
						+ gs.getGroupSize());
				currentCount += gs.getGroupSize();
				this.addChild(group);
			}

			TraceTestGroup group = new TraceTestGroup(currentCount + 1, stopNumber + 1);
			this.addChild(group);

		}

	}

	public void unloadTests()
	{
		removeChildern();
		addChild(new NotYetReadyTreeNode());
	}

	public void removeChildern()
	{
		for (int i = 0; i < children.size(); i++)
		{

			ITreeNode tmp = children.get(i);
			removeChild(tmp);

			tmp = null;
		}
		children = new Vector<ITreeNode>();
		System.gc();
	}

	public static Double numberOfLevels(Long count, Long groupSize)
	{
		if (count / groupSize > groupSize)
		{
			return new Double(1) + numberOfLevels(count / groupSize, groupSize);
		} else
		{
			return new Double(1);
		}

	}

}