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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
|
/*** /
This file is part of Golly, a Game of Life Simulator.
Copyright (C) 2013 Andrew Trevorrow and Tomas Rokicki.
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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
Web site: http://sourceforge.net/projects/golly
Authors: rokicki@gmail.com andrew@trevorrow.com
/ ***/
#ifndef _WXALGOS_H_
#define _WXALGOS_H_
#include "lifealgo.h"
// Golly supports multiple algorithms. The first algorithm
// registered must *always* be qlifealgo. The second must
// *always* be hlifealgo. (These are to support old scripts.)
// The order of the rest do not matter and indeed should soon
// be capable of being dynamic.
enum {
QLIFE_ALGO, // QuickLife
HLIFE_ALGO // HashLife
};
const int MAX_ALGOS = 50; // maximum number of algorithms
typedef int algo_type; // 0..MAX_ALGOS-1
// A class for all the static info we need about a particular algorithm.
class AlgoData : public staticAlgoInfo {
public:
AlgoData();
~AlgoData();
virtual void setDefaultBaseStep(int v) { defbase = v; }
virtual void setDefaultMaxMem(int v) { algomem = v; }
static AlgoData& tick(); // static allocator
// additional data
bool canhash; // algo uses hashing?
int algomem; // maximum memory (in MB)
int defbase; // default base step
wxColor statusrgb; // status bar color
wxBrush* statusbrush; // corresponding brush
wxBitmap** icons7x7; // icon bitmaps for scale 1:8
wxBitmap** icons15x15; // icon bitmaps for scale 1:16
wxBitmap** icons31x31; // icon bitmaps for scale 1:32
// default color scheme
bool gradient; // use color gradient?
wxColor fromrgb; // color at start of gradient
wxColor torgb; // color at end of gradient
// if gradient is false then use these colors for each cell state
unsigned char algor[256];
unsigned char algog[256];
unsigned char algob[256];
};
extern AlgoData* algoinfo[MAX_ALGOS]; // static info for each algorithm
extern wxMenu* algomenu; // menu of algorithm names
extern wxMenu* algomenupop; // copy of algomenu for PopupMenu calls
extern algo_type initalgo; // initial algorithm
// the following bitmaps are grayscale icons that can be used with any rules
// with any number of states
extern wxBitmap** circles7x7; // circular icons for scale 1:8
extern wxBitmap** circles15x15; // circular icons for scale 1:16
extern wxBitmap** circles31x31; // circular icons for scale 1:32
extern wxBitmap** diamonds7x7; // diamond icons for scale 1:8
extern wxBitmap** diamonds15x15; // diamond icons for scale 1:16
extern wxBitmap** diamonds31x31; // diamond icons for scale 1:32
extern wxBitmap** hexagons7x7; // hexagonal icons for scale 1:8
extern wxBitmap** hexagons15x15; // hexagonal icons for scale 1:16
extern wxBitmap** hexagons31x31; // hexagonal icons for scale 1:32
// NOTE: the triangular icons are only suitable for a 4-state rule that
// is emulating a triangular neighborhood with 2 triangles per cell
extern wxBitmap** triangles7x7; // triangular icons for scale 1:8
extern wxBitmap** triangles15x15; // triangular icons for scale 1:16
extern wxBitmap** triangles31x31; // triangular icons for scale 1:32
void InitAlgorithms();
// Initialize above data. Must be called before reading the prefs file.
void DeleteAlgorithms();
// Deallocate memory allocated in InitAlgorithms().
lifealgo* CreateNewUniverse(algo_type algotype, bool allowcheck = true);
// Create a new universe of given type. If allowcheck is true then
// event checking is allowed; ie. poller is set to wxGetApp().Poller().
const char* GetAlgoName(algo_type algotype);
// Return name of given algorithm. This name appears in various menus
// and is also stored in the prefs file.
int NumAlgos();
// Return current number of algorithms.
bool MultiColorImage(wxImage& image);
// Return true if image contains at least one color that isn't a shade of gray.
bool LoadIconFile(const wxString& path, int maxstate,
wxBitmap*** out7x7, wxBitmap*** out15x15, wxBitmap*** out31x31);
// Return true if we can successfully load icon bitmaps from given file.
wxBitmap** CreateIconBitmaps(const char** xpmdata, int maxstates);
// Create icon bitmaps using the given XPM data.
wxBitmap** ScaleIconBitmaps(wxBitmap** srcicons, int size);
// Create scaled versions of the given icon bitmaps.
void FreeIconBitmaps(wxBitmap** icons);
// Delete the given icon bitmaps.
#endif
|
