queensgui/src/containermnvector.cpp

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

ContainerMNVector::ContainerMNVector(GUIUpdate* update)
 : ContainerVector(update)
{
}


ContainerMNVector::~ContainerMNVector()
{
}

void ContainerMNVector::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]->copy() ;

                        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;
        
}
1	/***************************************************************************
2	* Copyright (C) 2005 by Torben Nielsen *
3	* torben@t-hoerup.dk *
4	* *
5	* This program is free software; you can redistribute it and/or modify *
6	* it under the terms of the GNU General Public License as published by *
7	* the Free Software Foundation; either version 2 of the License, or *
8	* (at your option) any later version. *
9	* *
10	* This program is distributed in the hope that it will be useful, *
11	* but WITHOUT ANY WARRANTY; without even the implied warranty of *
12	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
13	* GNU General Public License for more details. *
14	* *
15	* You should have received a copy of the GNU General Public License *
16	* along with this program; if not, write to the *
17	* Free Software Foundation, Inc., *
18	* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
19	***************************************************************************/
20	#include "containermnvector.h"
21
22	ContainerMNVector::ContainerMNVector(GUIUpdate* update)
23	: ContainerVector(update)
24	{
25	}
26
27
28	ContainerMNVector::~ContainerMNVector()
29	{
30	}
31
32	void ContainerMNVector::uniqueSolutions()
33	{
34	std::vector<Solution*> buf;
35	buf.reserve(solutions.size() / 10);
36	for (unsigned int i=0; i<solutions.size(); i++) {
37	if (m_halt)
38	break;
39
40	unsigned int j;
41	for (j=0; j<buf.size(); j++) {
42	if (m_halt)
43	break;
44	Solution* tmp = solutions[i]->copy() ;
45
46	if (tmp == buf[j])
47	break;
48	tmp->rotate90();
49
50	if (tmp == buf[j])
51	break;
52
53	tmp->rotate90();
54	if (tmp == buf[j])
55	break;
56
57	tmp->rotate90();
58	if (tmp == buf[j])
59	break;
60
61	tmp->mirror();
62	if (tmp == buf[j])
63	break;
64
65	tmp->rotate90();
66	if (tmp == buf[j])
67	break;
68
69	tmp->rotate90();
70	if (tmp == buf[j])
71	break;
72
73	tmp->rotate90();
74	if (tmp == buf[j])
75	break;
76	}
77	if ( j == buf.size() )
78	{ // hvis j==buf.size() fandt vi ingen duplicates i buf
79	buf.push_back( solutions[i] );
80	m_uniqueRemoved++;
81	m_update->duplicateRemoved();
82	}
83	}
84	solutions = buf;
85
86	}