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

SolutionMNVector::SolutionMNVector(GUIUpdate* update)
 : SolutionVector(update)
{
}


SolutionMNVector::~SolutionMNVector()
{
}

void SolutionMNVector::uniqueSolutions()
{
	std::vector<Solution> buf;
	buf.reserve(solutions.size() / 10);
	for (unsigned int i=0; i<solutions.size(); i++) {
		if (m_halt)
			break;
			
		unsigned int j;
		for (j=0; j<buf.size(); j++) {
			if (m_halt)
				break;
			Solution tmp ( solutions[i] );

			if (tmp == buf[j]) 
				break;
			tmp.rotate90();
			
			if (tmp == buf[j])
				break;
			
			tmp.rotate90();
			if (tmp == buf[j])
				break;
				
			tmp.rotate90();
			if (tmp == buf[j])
				break;
			
			tmp.mirror();
			if (tmp == buf[j])
				break;
			
			tmp.rotate90();
			if (tmp == buf[j])
				break;
				
			tmp.rotate90();
			if (tmp == buf[j])
				break;
				
			tmp.rotate90();
			if (tmp == buf[j])
				break;
		}
		if ( j == buf.size() ) 
		{	// hvis j==buf.size() fandt vi ingen duplicates i buf
			buf.push_back( solutions[i] );
			m_uniqueRemoved++;
			m_update->duplicateRemoved();
		}
	}
	solutions = buf;
}