-
Notifications
You must be signed in to change notification settings - Fork 0
/
scamp.py
2413 lines (1909 loc) · 58 KB
/
scamp.py
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
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
# -*- coding: utf-8 -*-
# SCAMP -Symbian Cellular Automata Machine in Python
# (C) Giles R. Greenway, released under the GNU Public License v3
#15/04/2011
import appuifw, e32, os, os.path, graphics, random, re
try:
import sysinfo
except:
pass
try:
begin_redraw()
end_redraw()
except:
def begin_redraw(junk1=0,junk2=0,junk3=0,junk4=0):
pass
def end_redraw(junk1=0,junk2=0,junk3=0,junk4=0):
pass
def openurl(url):
#if os.path.exists('z:\\system\\programs\\apprun.exe') and os.path.exists('z:\\System\\Apps\\Browser\\Browser.app'):
# e32.start_exe('z:\\system\\programs\\apprun.exe', 'z:\\System\\Apps\\Browser\\Browser.app'+ ' "%s"' %url,1)
#else:
e32.start_exe('BrowserNG.exe','4 "%s"' %url, 1)
class ProgressBar(object):
# Implements a ProgressBar on Canvas
def __init__(self, other_canvas, start=0, end=100,
color=(0,0,0), fill=(255,255,255),
outline=(0,0,0)):
#canvas assignments
self.canvas_copy = graphics.Image.new(other_canvas.size)
self.canvas_copy.blit(other_canvas)
self.return_canvas = graphics.Image.new(self.canvas_copy.size)
self.return_canvas.blit(other_canvas)
self.canvas = other_canvas
#External box size
self.box_w = int(self.canvas_copy.size[0] * 0.8)
self.box_h = 50 #height of window
self.box_l = int(self.canvas_copy.size[0] - self.box_w) / 2
self.box_t = self.canvas_copy.size[1] - self.box_h - 5
#ProgressBar size
self.progr_margin_h = 5 #horizontal margins (left and right)
self.prog_w = self.box_w - 2 * self.progr_margin_h
self.prog_h = 18 #height of progressbar
self.prog_l = self.box_l + self.progr_margin_h
self.prog_t = self.box_t + int((self.box_h - self.prog_h) / 2)
#internal progressbar expects that external has 1px border
self.internal_w_max = self.prog_w - 2
self.internal_h = self.prog_h - 2
self.internal_l = self.prog_l + 1
self.internal_t = self.prog_t + 1
self.internal_w = 0
#colors & values
self.start = start
self.end = end
self.value = start
self.color = color
self.outline = outline
self.fill = fill
self.rect = (self.box_l,self.box_t,self.box_l + self.box_w,self.box_t + self.box_h)
#shows initial progressbar
self.redraw()
def close(self):
#Closes the window and frees the image buffers memory
self.canvas.blit(self.return_canvas)
del self.canvas_copy
del self.return_canvas
def set_value(self, value):
if value > self.end:
value = self.end
elif value < self.start:
value = self.start
self.value = value
self.internal_w = int(((1.0 * self.value - self.start)/ \
(1.0 * self.end - self.start)) \
* self.internal_w_max)
self.redraw()
def redraw(self):
"""You don't need call redraw on application.
Just use set_value to redraw the progressbar"""
self.canvas_copy.blit(self.return_canvas)
#external window
self.canvas_copy.rectangle((self.box_l,
self.box_t,
self.box_l + self.box_w,
self.box_t + self.box_h),
outline=self.outline,
fill=self.fill)
#progressbar external border
self.canvas_copy.rectangle((self.prog_l,
self.prog_t,
self.prog_l + self.prog_w,
self.prog_t + self.prog_h),
outline=self.outline,
fill=self.fill)
#progressbar core
self.canvas_copy.rectangle((self.internal_l,
self.internal_t,
self.internal_l + self.internal_w,
self.internal_t + self.internal_h),
outline=None,
fill=self.color)
self.canvas.blit(self.canvas_copy)
##############################################################################
# #
# For a three-by-three array of binary cells,there are 2^9 combinations, and #
# thus 2^(2^9) possible CA rules.We can do a reasonable quick and cheap job #
# of compressing such potentially huge integers by converting them to hex, #
# (possibly) run-length encoding them, counting the number of different #
# hex-digits present to reduce the bit-count for each one as much as #
# possible, then encoding them in chunks of six bits using sixty-four #
# characters. Reasonably effective, if not entirely optimal. #
# #
##############################################################################
# 64 characters, each can represent 6 bits.
codechars = '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#'
# Quickly look up the value of each character.
codedict = dict()
for i, char in enumerate(codechars):
codedict[char] = i
# Run-length encode a hex string.
def rle(hexstr):
runchar = hexstr[0]
run = 1
outstr = ""
for loop in range(1,len(hexstr)):
if hexstr[loop] == runchar:
if run < 17:
run += 1
else:
# A run is represented by one repetition of the character, plus a hex digit that gives the length.
outstr += 2*runchar+"f"
run = 1
else:
if run == 1:
# A single character represents itself.
outstr += runchar
else:
outstr += 2*runchar+codechars[run-2]
runchar = hexstr[loop]
run = 1
# Add on the final run.
if run == 1:
outstr += runchar
else:
outstr += 2*runchar+codechars[run-2]
return outstr
# Run-length decode a hex string.
def rld(codestr):
char = 0
outstr = ""
while char<len(codestr)-1:
if codestr[char] == codestr[char+1]:
# Got a run, add it to the output and skip three chars.
outstr += (2+codedict[codestr[char+2]])*codestr[char]
char += 3
else:
outstr += codestr[char]
char += 1
if char < len(codestr):
# Any left-overs must be a single char.
outstr += codestr[char]
return outstr
# Code a hex string using a set of 64 chars.
def crunch(x):
chardict = dict()
chars = 0
present = 0
# What hex digits are present in the string?
for loop in range(16):
if codechars[loop] in x:
present = present | pow(2,loop)
chardict[codechars[loop]] = chars
chars += 1
bits = 1
# How many bits are needed per character in the string?
while (pow(2,bits) < chars):
bits += 1
# Chop the hex string into six-bit chunks represented by a single character.
outstr = ""
thischar = 0
charbits = 0
for char in x:
if charbits+bits <= 6:
# Room for one more character?
thischar = (thischar << bits) + chardict[char]
charbits += bits
else:
# Add the character to the ourput and start packing the next one.
outstr += codechars[thischar]
charbits = bits
thischar = chardict[char]
# Add the final char and work out how many decoded chars to throw away.
thischar = thischar << (6-charbits)
outstr += codechars[thischar]
spare = (6-charbits)/bits
# First three chars encode the hex digits present in the string.
c3 = codechars[(present>>12)&63]
c2 = codechars[(present>>6)&63]
c1 = codechars[present&63]
return c3+c2+c1+codechars[spare]+outstr
# Recover a "crunched" hex string.
def decrunch(x):
# Recover the hex-digits present in the decoded string.
present = (codedict[x[0]] & 63) << 12
present += codedict[x[1]] << 6
present += codedict[x[2]]
spare = codedict[x[3]]
charlist = list()
chars = 0
# Reconstruct the list of hex digits.
for loop in range(16):
if pow(2,loop) & present:
charlist.append(codechars[loop])
chars += 1
# Find the number of bits per hex digit.
bits = 1
while (pow(2,bits) < chars):
bits += 1
# Decode each char.
outstr = ""
mask = pow(2,bits) - 1
for char in x[4:len(x)]:
charval = codedict[char]
charbits = 6
while charbits >= bits:
shift = (charbits/bits -1) * bits
outstr += charlist[mask&(charval>>shift)]
charbits -= bits
return outstr[0:len(outstr)-spare]
# Decide whether its worth doing the run-length encoding.
def squeeze(x):
y = crunch(rle(x))
z = crunch(x)
# Set the sixth bit of the first char if we're bothering with the RLE.
if len(y) <= len(z):
return(codechars[codedict[y[0]]|32]+y[1:len(y)])
else:
return z
# Decode a coded string back to a hex string, with or without RLE.
def unsqueeze(x):
firstchar = codedict[x[0]]
if firstchar & 32:
return rld(decrunch(x))
else:
return decrunch(x)
##############################################################################
# #
# Tokenize, parse and evaluate simple logical functions on the states of a #
# cell and its neighbours. #
# #
##############################################################################
# Operators and their precedences: left shift, right shift, multiply, divide, modulo, bitwise AND, bitwise OR, bitwise XOR, logical AND, logical OR,
# logical XOR, greater than, less than, equal to, plus, minus and logical NOT.
operators = ("l",0),("r",0),("*",1),("/",1),("%",1),("&",2),("|",2),("$",2),("a",2),("o",2),("^",2),("x",2),(">",2),("<",2),("=",2),("+",3),("-",3),("!",4)
ops = ""
for index in range(len(operators)):
ops += operators[index][0]
digits = "0123456789"
chars = "neswc"
brackets = "()"
legal = digits+chars+ops+brackets
ruletext = ""
# Various token-types:
class variable(object):
def __init__(self,s,p):
self.type = 2
self.prior = 0
self.pos = p
self.label = s
class operator(object):
def __init__(self,s,p):
self.type = 3
self.pos = p
self.label = s
for index in range(len(ops)):
if s == ops[index]:
self.prior = operators[index][1]
class constant(object):
def __init__(self,s,p):
self.type = 1
self.prior = 0
self.pos = p
self.value = eval(s)
def set_val(self,v):
self.value = v
class bracket(object):
def __init__(self,s,p):
self.type = 4
self.prior = 5
self.pos = p
if s == "(":
self.left = 1
else:
self.left = 0
class error_token(object):
def __init__(self):
self.type = 5
self.prior = 999
self.pos = 0
# Find the token-type of a character:
def whatsit(x):
for c in digits:
if x == c:
return 1
for c in chars:
if x == c:
return 2
for c in ops:
if x == c:
return 3
for c in brackets:
if x == c:
return 4
return 5
# Make a token from string s from position p of type t.
def make_token(s,t,p):
if t == 1:
return constant(s,p)
if t == 2:
return variable(s,p)
if t == 3:
return operator(s,p)
if t == 4:
return bracket(s,p)
if t == 5:
return error_token()
# Tokenize string "s" given a list of possible variables.
def tokenize(s,var_strings):
token_list = list()
# Get the first character.
this_token = s[0]
token_type = whatsit(this_token)
token_pos = 0
for index in range(1,len(s)):
c = s[index]
# What sort of token does the next char belong to?
char_type = whatsit(c)
if char_type > 2:
# Must be an operator or a bracket. Store the current token and start a new one.
token_list.append(make_token(this_token,token_type,token_pos))
this_token = c
token_type = char_type
token_pos = index
else:
if char_type == token_type:
# The next char could be part of the current token,
if token_type == 1:
# Two consequtive digits, the number gets longer.
this_token += c
else:
# Does the next char complete a two-char variable?
trial = this_token + c
if trial in var_strings:
this_token = trial
else:
# Start a new token.
token_list.append(make_token(this_token,token_type,token_pos))
this_token = c
token_type = char_type
token_pos = index
else:
token_list.append(make_token(this_token,token_type,token_pos))
this_token = c
token_type = char_type
token_pos = index
token_list.append(make_token(this_token,token_type,token_pos))
return token_list
# Shunting algorithim. Take the input string in_str and a list of valid chars, return a stack of tokens ready for evaluation.
def parse(in_str,valid):
in_stack = list()
out_stack = list()
op_stack = list()
in_stack = tokenize(in_str,valid)
in_stack.reverse()
while len(in_stack) > 0: # Iterate over the input stack.
token = in_stack.pop()
if token.type == 5: # Chuck back an error token and quit.
out_stack = list()
out_stack.append(token)
return out_stack
if token.type == 1 or token.type == 2: # Variables and constants go straight on the output stack.
out_stack.append(token)
if token.type == 3:
if len(op_stack) > 0:
while len(op_stack) > 0 and op_stack[len(op_stack)-1].prior <= token.prior:
out_stack.append(op_stack.pop())
op_stack.append(token)
if token.type == 4:
if token.left:
op_stack.append(token) # Left brackets go to the operator stack.
else:
while len(op_stack) > 0: # Put the contents on the operator stack on the output stack 'till we find a left bracket.
op_token = op_stack.pop()
if op_token.type == 3:
out_stack.append(op_token)
else:
break
while len(op_stack) > 0: # Push any leftover operators on the output stack.
out_stack.append(op_stack.pop())
return out_stack
def rp_eval(in_stack,vardict): # Evaluate a suitable stack of tokens, given the values of the variables.
out_stack = list()
for token in in_stack:
if token.type == 1: # Contants go straight through.
out_stack.append(token)
if token.type == 2: # Push a constant with the varisble's value.
out_stack.append(constant(str(vardict[token.label]),token.pos))
if token.type == 3:
toke = constant("0",0)
c2 = out_stack.pop().value # Take a value from the stack.
if token.label != "!":
c1 = out_stack.pop().value # Binary operaters, take another value.
if token.label == "+":
toke.set_val(c1+c2)
if token.label == "-":
toke.set_val(c1-c2)
if token.label == "*":
toke.set_val(c1*c2)
if token.label == "/":
if c2 != 0:
toke.set_val(int(c1/c2))
else:
toke.set_val(0)
if token.label == "%": # Modular division
if c2 != 0:
toke.set_val(c1%c2)
else:
toke.set_val(0)
if token.label == "&": # Bitwise AND
toke.set_val(c1&c2)
if token.label == "|": # Bitwise OR
toke.set_val(c1|c2)
if token.label == "$": # Bitwise XOE
toke.set_val(c1^c2)
if token.label == "^": # Raise to power
toke.set_val(c1**c2)
if token.label == "a": # Logical AND
if c1 and c2:
toke.set_val(1)
else:
toke.set_val(0)
if token.label == "o": # Logical OR
if c1 or c2:
toke.set_val(1)
else:
toke.set_val(0)
if token.label == "x": # Logical XOR
if (c1 or c2) and not (c1 and c2):
toke.set_val(1)
else:
toke.set_val(0)
if token.label == ">": # Greater than
if c1 > c2:
toke.set_val(1)
else:
toke.set_val(0)
if token.label == "<": # Less than
if c1 > c2:
toke.set_val(1)
else:
toke.set_val(0)
if token.label == "=": # Equality
if c1 == c2:
toke.set_val(1)
else:
toke.set_val(0)
else:
if c2:
toke.set_val(0)
else:
toke.set_val(1)
out_stack.append(toke) # Put the result of the operation on the output stack.
return out_stack.pop().value
white = (255,255,255)
black = (0,0,0)
grey = (128,128,128)
red = (255,0,0)
yellow = (255,255,0)
green = (0,255,0)
blue = (0,0,255)
violet = (255,0,255)
class palette(object):
def __init__(self,order):
if order == 2:
self.cols = [white,black]
else:
self.cols = order*[0]
n_cols = len(colours)
spread = 256 / n_cols
map = []
big_list = 256*[0]
for index in range(n_cols-1):
map.append(index*spread)
big_list[map[index]] = colours[index]
map.append(255)
big_list[255] = colours[n_cols-1]
for index in range(n_cols-1):
dc = 1+map[index+1]-map[index]
dred = (colours[index+1][0]-colours[index][0])/dc
dgreen = (colours[index+1][1]-colours[index][1])/dc
dblue = (colours[index+1][2]-colours[index][2])/dc
for col in range(map[index]+1,map[index+1]):
big_list[col] = (self.setrgb(big_list[col-1][0]+dred),
self.setrgb(big_list[col-1][1]+dgreen),
self.setrgb(big_list[col-1][2]+dblue))
for index in range(order-1):
self.cols[index] = big_list[(index*255)/order]
self.cols[order-1] = big_list[255]
images[orientation].clear((self.cols[0],white,black)[bg_col])
handle_redraw((0,0,w,h))
def setrgb(self,rgb):
if rgb > 255:
return 255
if rgb < 0:
return 0
return rgb
def midcol(col1,col2):
return (int((col1[0]+col2[0])/2),int((col1[1]+col2[1])/2),
int((col1[2]+col2[2])/2))
def s60sum(n):
t = 0
for x in n:
t += x
return t
class ca_par(object):
def __init__(self,nm,vl,mi,mx):
self.name = nm
self.value = vl
self.mini = mi
self.maxi = mx
def set_val(self,x):
self.value = x
class ca_type(object):
def __init__(self,prototype):
lab,prs,eng,name,rec,seed,prog = prototype
global ca_labels
global ca_names
self.pars=[]
for index in prs:
self.pars.append(ca_par(index[0], index[1], index[2],index[3]))
self.values = {}
self.reset()
self.engine = eng
self.name = name
self.ca = 0
self.fields = []
for index in self.pars:
if index.name == u'history' or index.name == u"rule" or index.name == u'code':
self.fields.append((index.name, 'text',unicode(index.value)))
else:
self.fields.append((index.name, 'number',index.value))
self.pform = appuifw.Form(self.fields,
appuifw.FFormEditModeOnly)
self.pform.save_hook = validate
self.recordable = rec
self.seed_type = seed
self.prog = prog
def reset(self):
for index in self.pars:
self.values[index.name] = index.value
def set_rule(self,newrule):
if self.fields[0][0] == u'rule':
self.values["rule"] = newrule
if self.fields[0][0] == u'code':
self.values["code"] = newrule
self.fields = []
for index in self.pars:
if index.name == u'history' or index.name == u'rule' or index.name == 'code':
self.fields.append((index.name, 'text',unicode(self.values [index.name])))
else:
self.fields.append((index.name, 'number',self.values[index.name]))
self.pform = appuifw.Form(self.fields,appuifw.FFormEditModeOnly)
self.pform.save_hook = validate
def draw(self):
self.ca = self.engine(self.values)
self.ca.draw()
self.ca = 0
class ca_seed(object):
def __init__(self,dm,lab,nm,prs):
global seed_labels_1d
global seed_names_1d
global seed_labels_2d
global seed_names_2d
self.name = nm
if dm == 1:
self.dim = 1
seed_lables_1d.append(lab)
seed_names_1d.append(nm)
else:
self.dim = 2
seed_lables_2d.append(lab)
seed_names_2d.append(nm)
self.pars=[]
for index in prs:
self.pars.append(ca_par(
index[0], index[1], index[2],index[3]))
self.values = {}
self.reset()
fields = []
for index in self.pars:
if index.maxi == -1 and index.mini == -1:
fields.append((index.name, 'text',index.value))
else:
fields.append((index.name, 'number',index.value))
self.pform = appuifw.Form(fields,
appuifw.FFormEditModeOnly)
self.pform.save_hook = validate_seed
def reset(self):
for index in self.pars:
self.values[index.name] = index.value
class ca_base(object):
def __init__(self):
self.ticktock = 0
self.tocktick = 0
self.then = 0
self.now = 1
def update(self):
if click:
savesnap()
if rec and not self.ticktock % rec_inter:
rec_img()
self.tocktick = self.tocktick + 1
self.ticktock = self.ticktock + 1
def set_planes(self,n):
self.planes = abs(n) + 1
self.mask = (2 ** self.planes) - 1
self.unmask = self.mask & (self.mask << 1)
self.bitmasks = []
for l in range(self.planes):
self.bitmasks.append(2 ** l)
if n >= 0:
self.cellcol = self.state
return palette(2 ** self.planes)
else:
self.cellcol = self.change
return palette(1+self.planes)
def swap(self):
tmp = self.then
self.then = self.now
self.now = tmp
class ca_1d(ca_base):
def __init__(self,siz):
ca_base.__init__(self)
self.size = siz
self.cells = ([0]*self.size, [0]*self.size)
self.states = 2
def nearest(self,x):
return [self.state((x+index)%self.size) for index in range(1,-2,-1)]
def nextnearest(self,x):
return [self.state((x+index)%self.size) for index in range(2,-3,-1)]
def cells2int(self,x):
return s60sum([(x[index] & 1)*pow(2,index) for index in range(len(x))])
def change(self,n):
cell = self.state(n)
diff = self.planes
for l in range(1,self.planes):
if cell & self.bitmasks[l] != cell & cell & self.bitmasks[l-1]:
diff = l-1
break
return diff
def state(self,cell):
return self.cells[self.then][cell]
def next_state(self,cell):
return self.cells[self.now][cell]
def set_state(self,cell,val):
self.cells[self.then][cell] = val
def write(self,cell,val):
self.cells[self.now][cell] = val
def toggle(self,cell):
self.cells[self.now][cell] = self.mask & ((self.cells[self.then][cell] << 1) | 1)
def untoggle(self,cell):
self.cells[self.now][cell] = (self.cells[self.then][cell] << 1) & self.unmask
def clear(self):
self.cells = [[0]*self.size, [0]*self.size]
def seed(self):
seed = one_d_seeds[chosen_seed]
if seed.name == "singledefect":
num = seed.values['number']
just = seed.values['justify']
if seed.values['separation'] == 0:
sep = w/(num+1)
else:
sep = seed.values['separation']
if num == 1:
sep = 0
if just == 0:
start = w/2 - ((num-1)*sep)/2
if just == 1:
start = 0
if just == 2:
start = w - (num-1)*sep - 1
if start < 0:
start = 0
for index in range(num):
self.set_state(start + (sep*index)%w,1)
if seed.name == "altblocks":
num = seed.values['number']
on = seed.values['on']
off = seed.values['off']
if num > 0:
run = (num * on) + ((num-1) * off)
start = w/2 - run/2
if start < 0:
start = 0
if run > w:
run = w
else:
start = 0
run = w
on_run = 1
run_count = 0
for index in range(run):
run_count = run_count + 1
if on_run:
self.set_state(start + index,1)
if run_count == on:
run_count = 0
on_run = 0
else:
if run_count == off:
run_count = 0
on_run = 1
if seed.name == "rand":
prob = seed.values["probability"]
width = seed.values["width"]
if width == 0:
start = 0
end = w
else:
start = w/2 - width/2
end = start + width
for index in range(start,end):
if random.choice(range(1000)) < prob:
self.set_state(index,1)
if seed.name == "bits":
just = seed.values['justify']
if just == 0:
start = w/2 - 8
if just == 1:
start = 0
if just == 2:
start = w - 16
bytes = [seed.values['left'],seed.values['right']]
for byte in range(2):
for bit in range(8):
if bytes[byte] & 2**(7-bit):
self.set_state(start+(8*byte)+bit,1)
def draw(self):
while drawing * finishing:
for y in range(h):
for x in range(w):
plotpoint(x,y,self.pal.cols[self.cellcol(x)])
for x in range(w):
self.iterate(x)
self.swap()
handle_redraw((0,y,w,y))
e32.ao_yield()
if drawing != 1:
break
self.update()
class sim_1d(ca_1d):
def __init__(self,par):
self.pars = par
ca_1d.__init__(self,w)
self.seed()
self.rules = [self.pars['rule']/pow(2,loop) % 2 for loop in range(8)]
self.history = self.pars['history']
self.pal = self.set_planes(self.history)
def iterate(self,x):
if self.rules[self.cells2int(self.nearest(x))]:
self.toggle(x)
else:
self.untoggle(x)
def cells2int(x):
return s60sum([(x[index] & 1)*pow(2,index) for index in range(len(x))])
def int2code(x):
x = str(hex(x))
return squeeze(x[2:len(x)-1])
def code2int(x):
return eval('0x'+unsqueeze(x)+"L")
class nn_1d(ca_1d):
def __init__(self,par):
self.pars = par
ca_1d.__init__(self,w)
self.seed()
self.rules = [self.pars['rule']/pow(2,loop) % 2 for loop in range(32)]
self.bits = [pow(2,loop) for loop in range(32)]
self.history = self.pars['history']
self.pal = self.set_planes(self.history)
def iterate(self,x):
cells = self.nextnearest(x)
if self.rules[self.cells2int(self.nextnearest(x))]:
self.toggle(x)
else:
self.untoggle(x)
class pascal(ca_1d):
def __init__(self,par):
self.pars = par
ca_1d.__init__(self,h)
self.set_state(1,1)
self.mod = self.pars['modulo']
if self.pars['colours']:
self.pal = palette(self.mod)
self.paint = self.col_paint
else:
self.paint = self.mono_paint
def mono_paint(self,off,x,y):
if self.state(x) !=0:
plotpoint(off+x,y,black)
def col_paint(self,off,x,y):
plotpoint(x+off,y,self.pal.cols[self.state(x)])
def draw(self):