/***********************************************************************
This file is part of KEEL-software, the Data Mining tool for regression,
classification, clustering, pattern mining and so on.
Copyright (C) 2004-2010
F. Herrera (herrera@decsai.ugr.es)
L. S�nchez (luciano@uniovi.es)
J. Alcal�-Fdez (jalcala@decsai.ugr.es)
S. Garc�a (sglopez@ujaen.es)
A. Fern�ndez (alberto.fernandez@ujaen.es)
J. Luengo (julianlm@decsai.ugr.es)
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/
**********************************************************************/
/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
package keel.GraphInterKeel.experiments;
import java.util.Vector;
/**
*
* @author tua
*/
public class Joint {
public Node before;
public Vector<String> data_selected= new Vector<String>();
public String type_lqd;
public Vector<String> problem = new Vector<String>();
public Vector<Integer> times = new Vector<Integer>();
public Vector<Vector<String>> tableVector= new Vector<Vector<String>>();
public Vector<DinamicParameter> parameters = new Vector<DinamicParameter>();
public Joint() {
before= null;
}
public void information()
{
System.out.println("Way: "+ before.id);
for(int i=0;i<data_selected.size();i++)
{
System.out.println("Problem: "+ problem.get(i).toString());
for(int j=0;j<parameters.get(i).size();j++)
{
System.out.println("Parameter "+ j);
for(int v=0;v<parameters.get(i).get(j).size();v++)
System.out.println("Values: "+ parameters.get(i).get(j).get(v));
}
if(times.size()!=0 && times.size()==data_selected.size())
System.out.println("times "+times.get(i));
}
}
public boolean contain(String name)
{
for(int i=0;i<data_selected.size();i++)
if(data_selected.get(i).compareTo(name)==0)
return true;
return false;
}
public int position_name(String name)
{
for(int i=0;i<data_selected.size();i++)
if(data_selected.get(i).compareTo(name)==0)
return i;
return -1;
}
public void setNode(Node n)
{
before=n;
}
public Node getNode()
{
return before;
}
public String gettypelqd()
{
return type_lqd;
}
public Vector<String> getdataSelected()
{
for(int i=0;i<data_selected.size();i++)
System.out.println (" Data selected: "+data_selected.get(i));
return data_selected;
}
public Vector<String> getproblem()
{
return problem;
}
public Vector<Vector<String>> gettableVector()
{
return tableVector;
}
public Vector<DinamicParameter> getparameters()
{
return parameters;
}
public Vector<Integer> gettimes()
{
return times;
}
public void insertParameter(DinamicParameter contain )
{
parameters.addElement(contain);
}
public void insertDataSelected(String contain )
{
data_selected.addElement(contain);
}
public void insertproblem(String contain )
{
problem.addElement(contain);
}
public void removeParameters(int position)
{
parameters.remove(position);
}
public void removeDataset(int position)
{
data_selected.remove(position);
}
public void removeProblem(int position)
{
problem.remove(position);
}
public DinamicParameter getParametersP(int position)
{
return parameters.get(position);
}
}