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 "solutionlist.h" |
#include "containerlist.h" |
21 |
|
|
22 |
SolutionList::SolutionList(GUIUpdate* update) |
ContainerList::ContainerList(GUIUpdate* update) |
23 |
: SolutionContainer(update) |
: SolutionContainer(update) |
24 |
{ |
{ |
25 |
total = -1; |
total = -1; |
26 |
} |
} |
27 |
|
|
28 |
|
|
29 |
SolutionList::~SolutionList() |
ContainerList::~ContainerList() |
30 |
{ |
{ |
31 |
} |
} |
32 |
|
|
33 |
|
|
34 |
int SolutionList::numSolutions() |
int ContainerList::numSolutions() |
35 |
{ |
{ |
36 |
return solutions.size(); |
return solutions.size(); |
37 |
} |
} |
38 |
|
|
39 |
int SolutionList::totalSolutions() |
int ContainerList::totalSolutions() |
40 |
{ |
{ |
41 |
return total; |
return total; |
42 |
} |
} |
43 |
|
|
44 |
|
|
45 |
void SolutionList::uniqueSolutions() |
void ContainerList::uniqueSolutions() |
46 |
{ |
{ |
47 |
for (int i=1;i<=4;i++) { |
for (int i=1;i<=4;i++) { |
48 |
if (m_halt) |
if (m_halt) |
53 |
} |
} |
54 |
|
|
55 |
|
|
56 |
void SolutionList::uniqueSolutionsWorker(int rot,bool mirror) |
void ContainerList::uniqueSolutionsWorker(int rot,bool mirror) |
57 |
{ |
{ |
58 |
int match_count; |
int match_count; |
59 |
|
|
64 |
if (m_halt) |
if (m_halt) |
65 |
return; |
return; |
66 |
match_count = 0; |
match_count = 0; |
67 |
Solution tmp(*i); |
Solution* tmp = (*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+1 |
//unders�g kun resten af m�ngden, start ved i+1 |
74 |
ListIt j =i; |
ListIt j =i; |
75 |
j++; |
j++; |
76 |
for ( ; j!=solutions.end();j++) |
for ( ; j!=solutions.end();j++) |
77 |
{ |
{ |
78 |
if ( tmp == (*j) ) |
if ( *tmp == *(*j) ) |
79 |
{ |
{ |
80 |
solutions.erase(j); |
solutions.erase(j); |
81 |
m_uniqueRemoved++; |
m_uniqueRemoved++; |
87 |
} |
} |
88 |
|
|
89 |
|
|
90 |
void SolutionList::addSolution(Solution sol) |
void ContainerList::addSolution(Solution* sol) |
91 |
{ |
{ |
92 |
solutions.push_back(sol); |
solutions.push_back(sol); |
93 |
} |
} |
94 |
|
|
95 |
Solution SolutionList::solution(int index) |
Solution* ContainerList::solution(int index) |
96 |
{ |
{ |
97 |
int count=0; |
int count=0; |
98 |
ListIt it; |
ListIt it; |