queensgui/src/queensmain.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 <qapplication.h>
#include <qlabel.h>
#include <qlayout.h>
#include <q3listbox.h>
#include <q3popupmenu.h>
#include <qpushbutton.h>
#include <qspinbox.h>
#include <qstring.h>


#include "queensmain.h"
//Added by qt3to4:
#include <Q3HBoxLayout>
#include <QContextMenuEvent>
#include <Q3VBoxLayout>
#include "board.h"
#include "queens.h"

#include "solution.h"
#include "solutionmatrix.h"
#include "solutionint.h"

#include "containervector.h"
#include "containerlist.h"
#include "containerhash.h"
#include "containermnvector.h"
#include "containerminimalvector.h"

#include "config.h"


QueensMain::QueensMain(QWidget *parent, const char *name)
 : QDialog(parent, name)
{
    Q3VBoxLayout *mainlayout = new Q3VBoxLayout( this );
     
    m_board = new Board( this );
      
    m_start = new QPushButton("Start", this);
    m_quit = new QPushButton("Quit", this);
    m_stop = new QPushButton("Stop", this);
    m_stop->setEnabled( false );
    
    Q3HBoxLayout *upperlayout = new Q3HBoxLayout( mainlayout );
    Q3VBoxLayout *left = new Q3VBoxLayout( upperlayout );

    upperlayout->add( m_board );        
    m_list = new Q3ListBox( this );

    m_list->setMinimumWidth( 180 );
    m_sizeSelector = new QSpinBox( this );
    m_status = new QLabel( this );
    
    left->add( m_list );
    left->add( m_sizeSelector );
    
    Q3HBoxLayout *buttons = new Q3HBoxLayout( mainlayout );    
    buttons->add( m_start );
    buttons->add( m_stop );
    buttons->add( m_quit );
    
    mainlayout->add( m_status );
    
    m_sizeSelector->setMinValue( MIN_SIZE );
    m_sizeSelector->setMaxValue( MAX_SIZE );
    m_sizeSelector->setValue( 8 );
    m_board->setSize( 8 );
        
        m_storage = StorageInt;
    m_sortalgo = SortMinimalVector;
    m_solutions = NULL;
    m_queens = NULL;
        m_sol = NULL;
    
    connect(m_quit, 
        SIGNAL( clicked() ), 
                qApp, 
                SLOT( quit() ) 
                );
        
    connect(m_sizeSelector, 
        SIGNAL( valueChanged(int) ), 
                this, 
                SLOT( resize(int) ) 
                );
        
    connect(m_start, 
        SIGNAL( clicked() ), 
                this, 
                SLOT( start() ) 
                );
        
    connect(m_stop, 
        SIGNAL( clicked() ), 
                this, 
                SLOT( stop() )
                );
        
    connect(m_list, 
        SIGNAL( selectionChanged() ), 
                this, 
                SLOT( showSolution() ) 
                );
        
    connect( qApp, 
        SIGNAL( lastWindowClosed() ), 
                qApp, 
                SLOT( quit() )
                );
}


QueensMain::~QueensMain()
{
    delete m_board;
        
        if (m_solutions != NULL)
                delete m_solutions;
        if (m_sol != NULL)
                delete m_sol;
}

void QueensMain::start()
{
    m_sizeSelector->setEnabled( false );
    m_start->setEnabled( false );
    m_stop->setEnabled( true );
    m_list->clear();
    m_status->setText( QString("Searching ...") );
    
        m_board->setMatrix(0);
        
    if (m_queens != NULL) {
        m_queens->wait();
        delete m_queens;
                m_queens = 0;
    }    
    
    if (m_solutions != NULL)
         delete m_solutions;
    switch (m_sortalgo) {
            case SortList:
                    m_solutions = new ContainerList(this);
                    break;
            case SortVector:
                    m_solutions = new ContainerVector(this);
                    break;
            case SortHash:
                    m_solutions = new ContainerHash(this);
                    break;
            case SortMNVector:
                    m_solutions = new ContainerMNVector(this);
                    break;
                case SortMinimalVector:
                        m_solutions = new ContainerMinimalVector(this);
                        break;
    }
        
        if (m_sol != NULL)
                delete m_sol;
        
        switch(this->m_storage) {
                case StorageInt:
                        m_sol = new SolutionInt(m_sizeSelector->value());
                        break;
                case StorageMatrix:
                        m_sol = new SolutionMatrix(m_sizeSelector->value());
                        break;
        }


    m_elapsed.start();
    m_time.start();
    m_queens = new Queens(this, m_sol, m_solutions, m_sizeSelector->value() ,false);
    m_queens->start();
}

void QueensMain::stop()
{
    m_solutions->halt();
    m_queens->stop();
    m_queens->wait();
        
    int num = m_solutions->numSolutions();
    m_status->setText( QString("Aborted. Found ") + QString::number(num,10).append(" solutions") ); 
    m_list->clear();
    for (int i=1; i<=num; i++)
        m_list->insertItem( QString("Solution no ") + QString::number(i,10), i);
        
    delete m_queens;
    m_queens = NULL;
    
    m_list->setEnabled( true );
    m_sizeSelector->setEnabled( true );
    m_start->setEnabled( true );
    m_stop->setEnabled( false );
}

void QueensMain::foundSolution()
{
        int num = m_solutions->totalSolutions();
    if (m_elapsed.elapsed() > 500) 
    {
        m_status->setText( QString("Searching ... found ") + QString::number(num,10).append(" solutions") );
                m_elapsed.restart();
    }
}

void QueensMain::finishedSearch()
{
        uniqueSolutions();
        m_sizeSelector->setEnabled( true );
        m_start->setEnabled( true );
        m_stop->setEnabled( false );
}


void QueensMain::showSolution()
{
        int index = m_list->currentItem();
        Solution* sol = m_solutions->solution( index );
        m_board->setMatrix( sol );
}

void QueensMain::resize(int size)
{
        m_board->setSize( size );
        m_board->repaint( true );
        m_list->clear();
}

QString QueensMain::elapsed()
{
        int time = m_time.elapsed();
        int msec = time % 1000;
        int sec = time / 1000;
        int min = sec / 60;
        sec %= 60;
        QString smsec = (QString::number(msec)).rightJustify(3, '0');
        QString ssec = (QString::number(sec)).rightJustify(2,'0');
        
        QString res;
        if (min!=0)
                res = QString("%1:%2.%3").arg(min).arg(ssec).arg(smsec);
        else
                res = QString("%1.%2").arg(sec).arg(smsec);
        return res;
}

void QueensMain::uniqueSolutions()
{
        m_totalcount = m_solutions->totalSolutions();
        m_status->setText( QString("sorting ") + QString::number(m_totalcount,10).append(" solutions...") );
        
        m_elapsed.restart();
        m_solutions->uniqueSolutions();
                
        int uniq = m_solutions->numSolutions();
        
        
        QString msg;
        msg = QString( "Found %1 unique solutions, of %2 total solutions. Time elapsed: %3" ).arg(uniq).arg(m_totalcount).arg( elapsed() );

        m_list->clear();
        for (int i=1; i<=uniq; i++)
                m_list->insertItem( QString("Unique solution no ") + QString::number(i,10), i);
        
        m_status->setText( msg ); 
}

void QueensMain::contextMenuEvent( QContextMenuEvent *event)
{
        Q3PopupMenu *contextMenu = new Q3PopupMenu( this );
        contextMenu->setCheckable( true );
        contextMenu->insertItem( "---Container class---" );

        contextMenu->insertItem("List", this, SLOT( sortList() ), 0, 1);
        contextMenu->insertItem("Vector", this, SLOT( sortVector() ), 0, 2);
        contextMenu->insertItem("Hash", this, SLOT( sortHash() ), 0, 3);
        contextMenu->insertItem("M*N Vector", this, SLOT(sortMNVector()), 0, 4);
        contextMenu->insertItem("Minimal Vector", this, SLOT(sortMinimalVector()), 0, 5);
        
        contextMenu->insertItem( "---Solution Class---" );
        contextMenu->insertItem("Matrix Solution", this, SLOT( storageMatrix() ), 0, 6);
        contextMenu->insertItem("Int Solution", this, SLOT( storageInt() ), 0, 7);


        switch (m_sortalgo) {
                case SortList:
                        contextMenu->setItemChecked( 1, true);
                        break;
                case SortVector:
                        contextMenu->setItemChecked( 2, true);
                        break;
                case SortHash:
                        contextMenu->setItemChecked( 3, true);
                        break;
                case SortMNVector:
                        contextMenu->setItemChecked( 4, true);
                        break;
                case SortMinimalVector:
                        contextMenu->setItemChecked( 5, true);
                        break;
        }       
        
        switch (m_storage) {
                case StorageMatrix:
                        contextMenu->setItemChecked(6, true);
                        break;
                case StorageInt:
                        contextMenu->setItemChecked(7, true);
                        break;
        }

        
        contextMenu->exec( event->globalPos() );
        delete contextMenu;
}

void QueensMain::duplicateRemoved()
{
        if (m_elapsed.elapsed() > 500)
        {
                int uniq = m_solutions->getUniqueRemoved(); 
                QString status;
                status = QString ("Sorting %1 solutions. So far identified %2 duplicates").arg(m_totalcount).arg(uniq);
                m_status->setText(status);
                m_elapsed.restart();
        }       
}

void QueensMain::sortList()
{
        m_sortalgo = SortList;
}

void QueensMain::sortVector()
{
        m_sortalgo = SortVector;
}

void QueensMain::sortHash()
{
        m_sortalgo = SortHash;
}

void QueensMain::sortMNVector()
{
        m_sortalgo = SortMNVector;
}

void QueensMain::sortMinimalVector()
{
        m_sortalgo = SortMinimalVector;
}


void QueensMain::storageInt()
{
        m_storage = StorageInt;
}

void QueensMain::storageMatrix()
{
        m_storage = StorageMatrix;
}
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 <qapplication.h>
21	#include <qlabel.h>
22	#include <qlayout.h>
23	#include <q3listbox.h>
24	#include <q3popupmenu.h>
25	#include <qpushbutton.h>
26	#include <qspinbox.h>
27	#include <qstring.h>
28
29
30
31	#include "queensmain.h"
32	//Added by qt3to4:
33	#include <Q3HBoxLayout>
34	#include <QContextMenuEvent>
35	#include <Q3VBoxLayout>
36	#include "board.h"
37	#include "queens.h"
38
39	#include "solution.h"
40	#include "solutionmatrix.h"
41	#include "solutionint.h"
42
43	#include "containervector.h"
44	#include "containerlist.h"
45	#include "containerhash.h"
46	#include "containermnvector.h"
47	#include "containerminimalvector.h"
48
49	#include "config.h"
50
51
52
53	QueensMain::QueensMain(QWidget parent, const char name)
54	: QDialog(parent, name)
55	{
56	Q3VBoxLayout *mainlayout = new Q3VBoxLayout( this );
57
58	m_board = new Board( this );
59
60	m_start = new QPushButton("Start", this);
61	m_quit = new QPushButton("Quit", this);
62	m_stop = new QPushButton("Stop", this);
63	m_stop->setEnabled( false );
64
65	Q3HBoxLayout *upperlayout = new Q3HBoxLayout( mainlayout );
66	Q3VBoxLayout *left = new Q3VBoxLayout( upperlayout );
67
68	upperlayout->add( m_board );
69	m_list = new Q3ListBox( this );
70
71	m_list->setMinimumWidth( 180 );
72	m_sizeSelector = new QSpinBox( this );
73	m_status = new QLabel( this );
74
75	left->add( m_list );
76	left->add( m_sizeSelector );
77
78	Q3HBoxLayout *buttons = new Q3HBoxLayout( mainlayout );
79	buttons->add( m_start );
80	buttons->add( m_stop );
81	buttons->add( m_quit );
82
83	mainlayout->add( m_status );
84
85	m_sizeSelector->setMinValue( MIN_SIZE );
86	m_sizeSelector->setMaxValue( MAX_SIZE );
87	m_sizeSelector->setValue( 8 );
88	m_board->setSize( 8 );
89
90	m_storage = StorageInt;
91	m_sortalgo = SortMinimalVector;
92	m_solutions = NULL;
93	m_queens = NULL;
94	m_sol = NULL;
95
96	connect(m_quit,
97	SIGNAL( clicked() ),
98	qApp,
99	SLOT( quit() )
100	);
101
102	connect(m_sizeSelector,
103	SIGNAL( valueChanged(int) ),
104	this,
105	SLOT( resize(int) )
106	);
107
108	connect(m_start,
109	SIGNAL( clicked() ),
110	this,
111	SLOT( start() )
112	);
113
114	connect(m_stop,
115	SIGNAL( clicked() ),
116	this,
117	SLOT( stop() )
118	);
119
120	connect(m_list,
121	SIGNAL( selectionChanged() ),
122	this,
123	SLOT( showSolution() )
124	);
125
126	connect( qApp,
127	SIGNAL( lastWindowClosed() ),
128	qApp,
129	SLOT( quit() )
130	);
131	}
132
133
134	QueensMain::~QueensMain()
135	{
136	delete m_board;
137
138	if (m_solutions != NULL)
139	delete m_solutions;
140	if (m_sol != NULL)
141	delete m_sol;
142	}
143
144	void QueensMain::start()
145	{
146	m_sizeSelector->setEnabled( false );
147	m_start->setEnabled( false );
148	m_stop->setEnabled( true );
149	m_list->clear();
150	m_status->setText( QString("Searching ...") );
151
152	m_board->setMatrix(0);
153
154	if (m_queens != NULL) {
155	m_queens->wait();
156	delete m_queens;
157	m_queens = 0;
158	}
159
160	if (m_solutions != NULL)
161	delete m_solutions;
162	switch (m_sortalgo) {
163	case SortList:
164	m_solutions = new ContainerList(this);
165	break;
166	case SortVector:
167	m_solutions = new ContainerVector(this);
168	break;
169	case SortHash:
170	m_solutions = new ContainerHash(this);
171	break;
172	case SortMNVector:
173	m_solutions = new ContainerMNVector(this);
174	break;
175	case SortMinimalVector:
176	m_solutions = new ContainerMinimalVector(this);
177	break;
178	}
179
180	if (m_sol != NULL)
181	delete m_sol;
182
183	switch(this->m_storage) {
184	case StorageInt:
185	m_sol = new SolutionInt(m_sizeSelector->value());
186	break;
187	case StorageMatrix:
188	m_sol = new SolutionMatrix(m_sizeSelector->value());
189	break;
190	}
191
192
193	m_elapsed.start();
194	m_time.start();
195	m_queens = new Queens(this, m_sol, m_solutions, m_sizeSelector->value() ,false);
196	m_queens->start();
197	}
198
199	void QueensMain::stop()
200	{
201	m_solutions->halt();
202	m_queens->stop();
203	m_queens->wait();
204
205	int num = m_solutions->numSolutions();
206	m_status->setText( QString("Aborted. Found ") + QString::number(num,10).append(" solutions") );
207	m_list->clear();
208	for (int i=1; i<=num; i++)
209	m_list->insertItem( QString("Solution no ") + QString::number(i,10), i);
210
211	delete m_queens;
212	m_queens = NULL;
213
214	m_list->setEnabled( true );
215	m_sizeSelector->setEnabled( true );
216	m_start->setEnabled( true );
217	m_stop->setEnabled( false );
218	}
219
220	void QueensMain::foundSolution()
221	{
222	int num = m_solutions->totalSolutions();
223	if (m_elapsed.elapsed() > 500)
224	{
225	m_status->setText( QString("Searching ... found ") + QString::number(num,10).append(" solutions") );
226	m_elapsed.restart();
227	}
228	}
229
230	void QueensMain::finishedSearch()
231	{
232	uniqueSolutions();
233	m_sizeSelector->setEnabled( true );
234	m_start->setEnabled( true );
235	m_stop->setEnabled( false );
236	}
237
238
239	void QueensMain::showSolution()
240	{
241	int index = m_list->currentItem();
242	Solution* sol = m_solutions->solution( index );
243	m_board->setMatrix( sol );
244	}
245
246	void QueensMain::resize(int size)
247	{
248	m_board->setSize( size );
249	m_board->repaint( true );
250	m_list->clear();
251	}
252
253	QString QueensMain::elapsed()
254	{
255	int time = m_time.elapsed();
256	int msec = time % 1000;
257	int sec = time / 1000;
258	int min = sec / 60;
259	sec %= 60;
260	QString smsec = (QString::number(msec)).rightJustify(3, '0');
261	QString ssec = (QString::number(sec)).rightJustify(2,'0');
262
263	QString res;
264	if (min!=0)
265	res = QString("%1:%2.%3").arg(min).arg(ssec).arg(smsec);
266	else
267	res = QString("%1.%2").arg(sec).arg(smsec);
268	return res;
269	}
270
271	void QueensMain::uniqueSolutions()
272	{
273	m_totalcount = m_solutions->totalSolutions();
274	m_status->setText( QString("sorting ") + QString::number(m_totalcount,10).append(" solutions...") );
275
276	m_elapsed.restart();
277	m_solutions->uniqueSolutions();
278
279	int uniq = m_solutions->numSolutions();
280
281
282	QString msg;
283	msg = QString( "Found %1 unique solutions, of %2 total solutions. Time elapsed: %3" ).arg(uniq).arg(m_totalcount).arg( elapsed() );
284
285	m_list->clear();
286	for (int i=1; i<=uniq; i++)
287	m_list->insertItem( QString("Unique solution no ") + QString::number(i,10), i);
288
289	m_status->setText( msg );
290	}
291
292	void QueensMain::contextMenuEvent( QContextMenuEvent *event)
293	{
294	Q3PopupMenu *contextMenu = new Q3PopupMenu( this );
295	contextMenu->setCheckable( true );
296	contextMenu->insertItem( "---Container class---" );
297
298	contextMenu->insertItem("List", this, SLOT( sortList() ), 0, 1);
299	contextMenu->insertItem("Vector", this, SLOT( sortVector() ), 0, 2);
300	contextMenu->insertItem("Hash", this, SLOT( sortHash() ), 0, 3);
301	contextMenu->insertItem("M*N Vector", this, SLOT(sortMNVector()), 0, 4);
302	contextMenu->insertItem("Minimal Vector", this, SLOT(sortMinimalVector()), 0, 5);
303
304	contextMenu->insertItem( "---Solution Class---" );
305	contextMenu->insertItem("Matrix Solution", this, SLOT( storageMatrix() ), 0, 6);
306	contextMenu->insertItem("Int Solution", this, SLOT( storageInt() ), 0, 7);
307
308
309	switch (m_sortalgo) {
310	case SortList:
311	contextMenu->setItemChecked( 1, true);
312	break;
313	case SortVector:
314	contextMenu->setItemChecked( 2, true);
315	break;
316	case SortHash:
317	contextMenu->setItemChecked( 3, true);
318	break;
319	case SortMNVector:
320	contextMenu->setItemChecked( 4, true);
321	break;
322	case SortMinimalVector:
323	contextMenu->setItemChecked( 5, true);
324	break;
325	}
326
327	switch (m_storage) {
328	case StorageMatrix:
329	contextMenu->setItemChecked(6, true);
330	break;
331	case StorageInt:
332	contextMenu->setItemChecked(7, true);
333	break;
334	}
335
336
337	contextMenu->exec( event->globalPos() );
338	delete contextMenu;
339	}
340
341	void QueensMain::duplicateRemoved()
342	{
343	if (m_elapsed.elapsed() > 500)
344	{
345	int uniq = m_solutions->getUniqueRemoved();
346	QString status;
347	status = QString ("Sorting %1 solutions. So far identified %2 duplicates").arg(m_totalcount).arg(uniq);
348	m_status->setText(status);
349	m_elapsed.restart();
350	}
351	}
352
353	void QueensMain::sortList()
354	{
355	m_sortalgo = SortList;
356	}
357
358	void QueensMain::sortVector()
359	{
360	m_sortalgo = SortVector;
361	}
362
363	void QueensMain::sortHash()
364	{
365	m_sortalgo = SortHash;
366	}
367
368	void QueensMain::sortMNVector()
369	{
370	m_sortalgo = SortMNVector;
371	}
372
373	void QueensMain::sortMinimalVector()
374	{
375	m_sortalgo = SortMinimalVector;
376	}
377
378
379	void QueensMain::storageInt()
380	{
381	m_storage = StorageInt;
382	}
383
384	void QueensMain::storageMatrix()
385	{
386	m_storage = StorageMatrix;
387	}