-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathConway-tst.lisp
166 lines (153 loc) · 10.5 KB
/
Conway-tst.lisp
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
(in-package "ACL2")
;testing code
(include-book "Conway")
(include-book "doublecheck" :dir :teachpacks)
(include-book "list-utilities" :dir :teachpacks)
(include-book "testing" :dir :teachpacks)
;tests for get-avl-key
(check-expect (get-avl-key 1 1 3) 4)
(check-expect (get-avl-key 0 0 5) 0)
(check-expect (get-avl-key 5 5 5) 30)
(check-expect (get-avl-key 3 2 20) 43)
;tests for input-lines->avl-tree
(check-expect (input-lines->avl-tree 0 0 1 (list (coerce "x" 'list)) (empty-tree))
(list 1 0 0 nil nil))
(check-expect (input-lines->avl-tree 0 0 2 (list (coerce " x" 'list) (coerce "x " 'list)) (empty-tree))
(list 2 1 0 nil (list 1 2 0 nil nil)))
(check-expect (input-lines->avl-tree 0 0 2 (list (coerce "x " 'list) (coerce " x" 'list)) (empty-tree))
(list 2 0 0 nil (list 1 3 0 nil nil)))
(check-expect (input-lines->avl-tree 0 0 2 (list (coerce "xx" 'list) (coerce "x " 'list)) (empty-tree))
(list 2 1 0 (list 1 0 0 nil nil) (list 1 2 0 nil nil)))
;tests for strings->char-lists
(check-expect (strings->char-lists nil) nil)
(check-expect (strings->char-lists (list "hello")) (list (list #\h #\e #\l #\l #\o)))
(check-expect (strings->char-lists (list "x x" " x" "x ")) (list (list #\x #\Space #\x) (list #\Space #\Space #\x) (list #\x #\Space #\Space)))
(check-expect (strings->char-lists (list "xxx" "xxx")) (list (list #\x #\x #\x) (list #\x #\x #\x)))
;tests for num-live-neighbors
(check-expect (num-live-neighbors 0 1 1 0 0 (empty-tree)) 0)
(check-expect (num-live-neighbors 9 4 4 1 1
(input-lines->avl-tree 0 0 4 (list (coerce "x xx" 'list)
(coerce "xxxx" 'list)
(coerce "x x" 'list)
(coerce " x" 'list))
(empty-tree)))
5)
(check-expect (num-live-neighbors 9 3 3 1 1
(input-lines->avl-tree 0 0 3 (list (coerce "xxx" 'list)
(coerce "xxx" 'list)
(coerce "x x" 'list)
)
(empty-tree)))
7)
(check-expect (num-live-neighbors 9 3 3 2 3
(input-lines->avl-tree 0 0 3 (list (coerce "xxx" 'list)
(coerce "xxx" 'list)
(coerce "x x" 'list)
)
(empty-tree)))
7)
;tests for build-next-generation-cell
(check-expect (build-next-generation-cell 1 1 0 0 (empty-tree) (empty-tree)) nil)
(check-expect (build-next-generation-cell 3 3 0 0 (input-lines->avl-tree 0 0 3 (list (coerce "x " 'list)
(coerce "x " 'list)
(coerce "x " 'list)
)
(empty-tree))
(empty-tree))
(list 1 0 "x" nil nil))
(check-expect (build-next-generation-cell 3 3 0 0 (input-lines->avl-tree 0 0 3 (list (coerce "x " 'list)
(coerce " " 'list)
(coerce "x " 'list)
)
(empty-tree))
(empty-tree))
nil)
(check-expect (build-next-generation-cell 3 3 0 0 (input-lines->avl-tree 0 0 3 (list (coerce "x " 'list)
(coerce "xx " 'list)
(coerce "x " 'list)
)
(empty-tree))
(empty-tree))
(list 1 0 "x" nil nil))
;tests for build-next-generation-row
(check-expect (build-next-generation-row 4 4 0 0 (input-lines->avl-tree 0 0 4 (list (coerce "x xx" 'list)
(coerce "xxxx" 'list)
(coerce "x x" 'list)
(coerce " x" 'list))
(empty-tree))
(empty-tree))
nil)
(check-expect (build-next-generation-row 4 4 1 1 (input-lines->avl-tree 0 0 4 (list (coerce "x " 'list)
(coerce "x " 'list)
(coerce "x " 'list)
(coerce " " 'list))
(empty-tree))
(empty-tree))
(list 2 5 "x" (list 1 4 "x" nil nil) nil))
(check-expect (build-next-generation-row 1 1 0 0 (empty-tree) (empty-tree)) nil)
(check-expect (build-next-generation-row 4 4 1 1 (input-lines->avl-tree 0 0 4 (list (coerce "xx " 'list)
(coerce "x " 'list)
(coerce "x " 'list)
(coerce " " 'list))
(empty-tree))
(empty-tree))
(list 1 4 "x" nil nil))
;tests for build-next-generation
(check-expect (build-next-generation 1 1 0 (empty-tree) (empty-tree)) nil)
(check-expect (build-next-generation 4 4 0 (input-lines->avl-tree 0 0 4 (list (coerce " x " 'list)
(coerce "xx " 'list)
(coerce " " 'list)
(coerce " " 'list))
(empty-tree))
(empty-tree))
(list 2 1 "x" (list 1 0 "x" nil nil) nil))
(check-expect (build-next-generation 4 4 0 (input-lines->avl-tree 0 0 4 (list (coerce " xx " 'list)
(coerce "xx " 'list)
(coerce "x " 'list)
(coerce " x " 'list))
(empty-tree))
(empty-tree))
(list 1 2 "x" nil nil))
(check-expect (build-next-generation 4 4 0 (input-lines->avl-tree 0 0 4 (list (coerce " xx " 'list)
(coerce "xxx " 'list)
(coerce " " 'list)
(coerce " " 'list))
(empty-tree))
(empty-tree))
(list 2 2 "x" (list 1 0 "x" nil nil) (list 1 3 "x" nil nil)))
;tests for tablecell
(check-expect (tablecell nil) (string-append "<td> </td>" nil))
(check-expect (tablecell t) (string-append "<td class='live'> </td>" nil))
;Properties
;get-avl-key property tests
(defproperty get-avl-key-prop
(width :value (random-between 1 1000)
x :value (random-between 0 width)
y :value (random-between 0 width))
(implies (and (natp x) (natp y) (natp width))
(equal (get-avl-key x y width) (+ x (* y width)))
)
)
(defproperty empty-tree-nil-prop
(width :value (random-between 1 1000)
height :value (random-between 1 1000)
x :value (random-between 0 width)
y :value (random-between 0 height))
(equal (build-next-generation width height y (empty-tree) (empty-tree))
nil)
)
(defproperty single-comlumn-tree-prop
(width :value 1
height :value (random-between 1 1000)
y :value (random-between 1 height))
(equal (build-next-generation-row width height 0 (empty-tree) (empty-tree) )
(build-next-generation-cell width height 0 y (empty-tree) (empty-tree)))
)
(defproperty get-avl-key-prop2
(width :value (random-between 1 1000)
x :value (random-between 0 width)
y :value (random-between 0 width))
(implies (and (natp x) (natp y) (natp width))
(equal (get-avl-key x y width) (+ x (* y width)))
)
)