/***************************************************************************
 *   Copyright (C) 2005 by Torben Nielsen   *
 *   torben@t-hoerup.dk   *
 *                                                                         *
 *   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 2 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, write to the                         *
 *   Free Software Foundation, Inc.,                                       *
 *   59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.             *
 ***************************************************************************/
#include "solutionvector.h"



SolutionVector::SolutionVector(GUIUpdate* update) : SolutionContainer(update)
{
    total = -1;
}


SolutionVector::~SolutionVector()
{
}

int SolutionVector::numSolutions()
{
	return solutions.size();
}

int SolutionVector::totalSolutions()
{
	return total;
}


void SolutionVector::uniqueSolutions()
{
	for (int i=1;i<=4;i++) {
		if (m_halt)
			return;
		uniqueSolutionsWorker(i,false);
		uniqueSolutionsWorker(i,true);
	}
}

void SolutionVector::uniqueSolutionsWorker(int rot,bool mirror)
{
	int match_count;

	if (total == -1)
		total = solutions.size();
	
	std::vector<Solution*> buf;
	for (unsigned int i=0; i<solutions.size(); i++) {
		if (m_halt)
			return;
		match_count = 0;
		Solution* tmp = solutions[i]->copy();
		if (mirror)
			tmp->mirror();
		for (int k=0;k<rot;k++)
			tmp->rotate90();

		//unders�g kun resten af m�ngden, start ved i
		for (unsigned int j=i+1; j<solutions.size();j++) {
			if ( *tmp == *solutions[j] ) { 
				match_count++;
				break;
			}
		}
		if (match_count < 1)
		{
			buf.push_back(tmp);
			m_uniqueRemoved ++;
			m_update->duplicateRemoved();
		}
	}
	solutions = buf;
}



void SolutionVector::addSolution(Solution* sol)
{
    solutions.push_back(sol);   
}

Solution* SolutionVector::solution(int index)
{
    return solutions[index] ;
}