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
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
|
/*** /
This file is part of Golly, a Game of Life Simulator.
Copyright (C) 2009 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
/ ***/
#include "generationsalgo.h"
#include <string.h>
using namespace std ;
int generationsalgo::NumCellStates() {
return maxCellStates ;
}
const char* generationsalgo::setrule(const char *s) {
if ((int)strlen(s) + 10 > MAXRULESIZE)
return "Rule too long for Generations" ;
// a legal rule goes:
// [0-8]+/[1-8]+/[1-9][0-9]*
const char *p = s ;
int tstaybits = 0, tbornbits = 0, tnumstates = 0 ;
while ('0' <= *p && *p <= '8') {
tstaybits |= 1<<(*p-'0') ;
p++ ;
}
if (*p != '/')
return "Missing expected slash in Generations rule" ;
p++ ;
while ('1' <= *p && *p <= '8') {
tbornbits |= 1<<(*p-'0') ;
p++ ;
}
if (*p != '/')
return "Missing expected slash in Generations rule" ;
p++ ;
while ('0' <= *p && *p <= '9') {
tnumstates = 10 * tnumstates + *p - '0' ;
p++ ;
if (tnumstates > 256)
return "Number of states too high in Generations rule" ;
}
if (tnumstates < 2)
return "Number of states too low in Generations rule" ;
if (*p)
return "Extra stuff at end of Generations rule" ;
staybits = tstaybits ;
bornbits = tbornbits ;
maxCellStates = tnumstates ;
// AKT: store rule in canonical format for getrule()
int i, j = 0 ;
char states[4] ; // room for "2".."256" and null
for (i=0; i<=8; i++) {
if (staybits & (1 << i)) canonrule[j++] = '0' + i ;
}
canonrule[j++] = '/' ;
for (i=1; i<=8; i++) {
if (bornbits & (1 << i)) canonrule[j++] = '0' + i ;
}
canonrule[j++] = '/' ;
sprintf(states, "%d", tnumstates) ;
i = 0 ;
while (states[i]) {
canonrule[j++] = states[i++] ;
}
canonrule[j] = 0 ;
ghashbase::setrule(canonrule) ;
return 0 ;
}
const char* generationsalgo::getrule() {
return canonrule ;
}
static const char *DEFAULTRULE = "12/34/3" ;
const char* generationsalgo::DefaultRule() {
return DEFAULTRULE ;
}
/*
* These colors are not presently used; we'll go back to them
* when we permit colors to change with rules.
*/
static unsigned char defcolors[256*3] ;
static int lastcolorset = -1 ;
unsigned char *generationsalgo::GetColorData(int &numcolors) {
numcolors = maxCellStates ;
if (lastcolorset != numcolors) {
/* use Yellow (255,255,0) -> Red (255,0,0) */
if (numcolors <= 2) {
defcolors[3] = 255 ;
defcolors[4] = 255 ;
defcolors[5] = 0 ;
} else {
for (int i=1; i<numcolors; i++) {
defcolors[i*3] = 255 ;
defcolors[i*3+1] = (unsigned char)
(255 * (numcolors-i-1) / (numcolors-2)) ;
defcolors[i*3+2] = 0 ;
}
}
}
return defcolors ;
}
generationsalgo::generationsalgo() {
// we may need this to be >2 here so it's recognized as multistate
maxCellStates = 3 ;
}
generationsalgo::~generationsalgo() {}
state generationsalgo::slowcalc(state nw, state n, state ne, state w, state c,
state e, state sw, state s, state se) {
int nn = (nw==1)+(n==1)+(ne==1)+(w==1)+(e==1)+(sw==1)+(s==1)+(se==1) ;
if (c==1 && (staybits & (1 << nn)))
return 1 ;
if (c==0 && (bornbits & (1 << nn)))
return 1 ;
if (c > 0 && c+1 < maxCellStates)
return c + 1 ;
return 0 ;
}
static lifealgo *creator() { return new generationsalgo() ; }
void generationsalgo::doInitializeAlgoInfo(staticAlgoInfo &ai) {
ghashbase::doInitializeAlgoInfo(ai) ;
ai.setAlgorithmName("Generations") ;
ai.setAlgorithmCreator(&creator) ;
ai.minstates = 2 ;
ai.maxstates = 256 ;
// init default color scheme
ai.defgradient = true; // use gradient
ai.defr1 = 255; // start color = red
ai.defg1 = 0;
ai.defb1 = 0;
ai.defr2 = 255; // end color = yellow
ai.defg2 = 255;
ai.defb2 = 0;
// if not using gradient then set all states to white
for (int i=0; i<256; i++) {
ai.defr[i] = ai.defg[i] = ai.defb[i] = 255;
}
}
|
