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 "solutionmnvector.h" |
21 |
|
22 |
SolutionMNVector::SolutionMNVector(GUIUpdate* update) |
23 |
: SolutionVector(update) |
24 |
{ |
25 |
} |
26 |
|
27 |
|
28 |
SolutionMNVector::~SolutionMNVector() |
29 |
{ |
30 |
} |
31 |
|
32 |
void SolutionMNVector::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 |
} |