/***************************************************************************
 *   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 "solutionlist.h"

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


SolutionList::~SolutionList()
{
}


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

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


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


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

	if (total == -1)
		total = solutions.size();
	
	for (ListIt i=solutions.begin(); i != solutions.end(); i++) {
		if (m_halt)
			return;
		match_count = 0;
		Solution tmp(*i);
		if (mirror)
			tmp.mirror();
		for (int k=0;k<rot;k++)
			tmp.rotate90();

		//unders�g kun resten af m�ngden, start ved i+1		
		ListIt j =i;
		j++;
		for ( ; j!=solutions.end();j++) 
		{
			if ( tmp == (*j) ) 
			{
				solutions.erase(j);
				m_uniqueRemoved++;
				m_update->duplicateRemoved();
				break;
			}
		}
	}
}


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

Solution SolutionList::solution(int index)
{
    int count=0;
	ListIt it;

    for (it = solutions.begin(); it != solutions.end(); it++, count++) {
        if (count == index) {
	    	break;
		} 
    }
    return *it;
}