/
dottable.hpp
77 lines (67 loc) · 2.19 KB
/
dottable.hpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
/*
* KDots
* Copyright (c) 2011-2012 Minh Ngo <nlminhtl@gmail.com>
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef KDOTS_DOTTABLE_HPP
#define KDOTS_DOTTABLE_HPP
#include <memory>
#include <QObject>
#include "graph.hpp"
#include "gameconfig.hpp"
#include "polygon.hpp"
namespace KDots
{
class StepQueue;
class KDOTS_EXPORT DotTable : public QObject
{
Q_OBJECT
std::unique_ptr<Graph> m_graph;
std::shared_ptr<StepQueue> m_steps;
GameConfig m_config;
std::vector<Polygon_ptr> m_polygons;
public:
DotTable (const GameConfig& config, QObject *parent = 0);
GameConfig gameConfig () const;
void pushPoint (const Point& point);
inline std::vector<Polygon_ptr> polygons ()
{
return m_polygons;
}
inline Graph& graph () const
{
return *m_graph;
}
inline std::shared_ptr<StepQueue> stepQueue ()
{
return m_steps;
}
void undo ();
signals:
void nextPlayer (const Point& lastPoint);
private:
void drawPolygon (PolyList polygons);
void continueStep ();
};
}
#endif