#include <cluster.hh>

Cluster::Cluster(string name)
{ 
  namn_=name;
  ant_=0;
  centroid_=new Hashtab();
}

string Cluster::name()
{
  return namn_;
}

Cluster::~Cluster()
{
  delete centroid_;
}

Hashtab* Cluster::centroid()
{
  return centroid_;
}

void Cluster::hangon(Hashtab* newone)
{
  ant_++;
  medl_.insert(medl_.end(), newone);
}

int Cluster::ant()
{
  return ant_;
}

Hashtab* Cluster::medl(int nr)
{
  return medl_[nr];
}

void Cluster::ready()  //beräknar ett klusters centroid
{
  BinTree* tmp;
  for (int i=0;i<ant();i++)
  {
    tmp=medl_[i]->btree()->min();
    while (tmp->next(tmp->nGnr())!=0)
    {
      centroid()->btree()->set(tmp->nGnr(),tmp->ant()/ant());
      tmp=tmp->next(tmp->nGnr());
    }
  }
/* Vad är detta?
  int remaining=ant_;  //antal binärträd som inte tagit slut
  Vec <BinTree*> tmp(remaining);
  for (int i=0;i<remaining;i++)
    tmp[i]=medl_[i]->btree()->min();
  int min_i=0;
  BinTree* min_p=tmp[min_i];
  longint min_nGnr=min_p->nGnr();
  for (i=0;i<remaining;i++)
  {
    if (tmp[i]->nGnr()<min_nGnr)
      {
	min_i=i;
	min_p=tmp[min_i];
	min_nGnr=min_p->nGnr();
      }
  }
  while (remaining>0)  //flytta hela tiden fram pekaren i det "bakersta" trädet
  {
    int sum=0;
    for (i=0;i<remaining;i++)
    {  
      if (tmp[i]->nGnr()==min_nGnr)
	sum++;
    }
    centroid_->btree()->set(min_nGnr,sum/ant_);
    if (min_p->next(min_p->nGnr())==0)
    {
      delete tmp[i]; //ta bort vektorelementet då listan är nästan slut
      remaining--;
    }
    else
    {
      tmp[min_i]=tmp[min_i]->next(tmp[min_i]->nGnr());
      min_p=tmp[min_i];
      min_nGnr=min_p->nGnr();
    }
    for (i=0;i<remaining;i++)
    {
      if (tmp[i]->nGnr()<min_nGnr)
      {
	min_i=i;
	min_p=tmp[min_i];
	min_nGnr=min_p->nGnr();
      }
    }
  }
*/
}

void Cluster::display()
{
  char ch;
  cout<<"Cluster "<<namn_<<" contains the following texts (Similarity with centroid)\n";
  for (int i=0;i<ant_;i++)
  {
    cout<<"  "<<medl_[i]->filn()<<"  (";
    cout<<medl_[i]->comp(centroid_)<<")\n";
  }
}

void Cluster::setname()
{
  string namn;
  cout<<"Please name this cluster: ";
  cin>>namn;
  namn_=namn;
}


void Cluster::zoomin()  //returnerar en pekare till samma kluster,
{                           //men nu centrerat kring origo
  for (int i=0;i<ant();i++)
  {
    this->hangon(medl(i));
    this->medl(i)-centroid(); //ändra operatorn i Hashtab
    //häng på hashtabellerna - centroiden hos det gamla klustret
  }
}