17 |
* Free Software Foundation, Inc., * |
* Free Software Foundation, Inc., * |
18 |
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. * |
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. * |
19 |
***************************************************************************/ |
***************************************************************************/ |
20 |
#include "solutionvector.h" |
#include "containervector.h" |
21 |
|
|
22 |
|
|
23 |
|
|
24 |
SolutionVector::SolutionVector(GUIUpdate* update) : SolutionContainer(update) |
ContainerVector::ContainerVector(GUIUpdate* update) : SolutionContainer(update) |
25 |
{ |
{ |
26 |
total = -1; |
total = -1; |
27 |
} |
} |
28 |
|
|
29 |
|
|
30 |
SolutionVector::~SolutionVector() |
ContainerVector::~ContainerVector() |
31 |
{ |
{ |
32 |
} |
} |
33 |
|
|
34 |
int SolutionVector::numSolutions() |
int ContainerVector::numSolutions() |
35 |
{ |
{ |
36 |
return solutions.size(); |
return solutions.size(); |
37 |
} |
} |
38 |
|
|
39 |
int SolutionVector::totalSolutions() |
int ContainerVector::totalSolutions() |
40 |
{ |
{ |
41 |
return total; |
return total; |
42 |
} |
} |
43 |
|
|
44 |
|
|
45 |
void SolutionVector::uniqueSolutions() |
void ContainerVector::uniqueSolutions() |
46 |
{ |
{ |
47 |
for (int i=1;i<=4;i++) { |
for (int i=1;i<=4;i++) { |
48 |
if (m_halt) |
if (m_halt) |
52 |
} |
} |
53 |
} |
} |
54 |
|
|
55 |
void SolutionVector::uniqueSolutionsWorker(int rot,bool mirror) |
void ContainerVector::uniqueSolutionsWorker(int rot,bool mirror) |
56 |
{ |
{ |
57 |
int match_count; |
int match_count; |
58 |
|
|
59 |
if (total == -1) |
if (total == -1) |
60 |
total = solutions.size(); |
total = solutions.size(); |
61 |
|
|
62 |
std::vector<Solution> buf; |
std::vector<Solution*> buf; |
63 |
for (unsigned int i=0; i<solutions.size(); i++) { |
for (unsigned int i=0; i<solutions.size(); i++) { |
64 |
if (m_halt) |
if (m_halt) |
65 |
return; |
return; |
66 |
match_count = 0; |
match_count = 0; |
67 |
Solution tmp(solutions[i]); |
Solution* tmp = solutions[i]->copy(); |
68 |
if (mirror) |
if (mirror) |
69 |
tmp.mirror(); |
tmp->mirror(); |
70 |
for (int k=0;k<rot;k++) |
for (int k=0;k<rot;k++) |
71 |
tmp.rotate90(); |
tmp->rotate90(); |
72 |
|
|
73 |
//unders�g kun resten af m�ngden, start ved i |
//unders�g kun resten af m�ngden, start ved i |
74 |
for (unsigned int j=i+1; j<solutions.size();j++) { |
for (unsigned int j=i+1; j<solutions.size();j++) { |
75 |
if ( tmp == solutions[j] ) { |
if ( *tmp == *solutions[j] ) { |
76 |
match_count++; |
match_count++; |
77 |
break; |
break; |
78 |
} |
} |
89 |
|
|
90 |
|
|
91 |
|
|
92 |
void SolutionVector::addSolution(Solution sol) |
void ContainerVector::addSolution(Solution* sol) |
93 |
{ |
{ |
94 |
solutions.push_back(sol); |
solutions.push_back(sol); |
95 |
} |
} |
96 |
|
|
97 |
Solution SolutionVector::solution(int index) |
Solution* ContainerVector::solution(int index) |
98 |
{ |
{ |
99 |
return solutions[index] ; |
return solutions[index] ; |
100 |
} |
} |