-
Notifications
You must be signed in to change notification settings - Fork 1
/
Exercise 3.33 constraint propagation averager.rkt
387 lines (346 loc) · 7.11 KB
/
Exercise 3.33 constraint propagation averager.rkt
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
#lang racket
; Exercise 3.33. Using primitive multiplier, adder, and constant constraints, define a procedure
; averager that takes three connectors a, b, and c as inputs and establishes the constraint that
; the value of c is the average of the values of a and b.
; S O L U T I O N
(require rnrs/mutable-pairs-6)
(require compatibility/mlist)
(define (averager a b c)
(let ((u (make-connector)) (v (make-connector)))
(adder a b u)
(multiplier c v u)
(constant 2 v)
'ok
)
)
(define (adder a1 a2 sum)
(define (process-new-value)
(cond
((and (has-value? a1) (has-value? a2))
(set-value!
sum
(+ (get-value a1) (get-value a2))
me
)
)
((and (has-value? a1) (has-value? sum))
(set-value!
a2
(- (get-value sum) (get-value a1))
me
)
)
((and (has-value? a2) (has-value? sum))
(set-value!
a1
(- (get-value sum) (get-value a2))
me
)
)
)
)
(define (process-forget-value)
(forget-value! sum me)
(forget-value! a1 me)
(forget-value! a2 me)
(process-new-value)
)
(define (me request)
(cond
((eq? request 'I-have-a-value)
(process-new-value)
)
((eq? request 'I-lost-my-value)
(process-forget-value)
)
(else
(error "Unknown request -- ADDER" request)
)
)
)
(connect a1 me)
(connect a2 me)
(connect sum me)
me
)
(define (multiplier m1 m2 product)
(define (process-new-value)
(cond
((or
(and (has-value? m1) (= (get-value m1) 0))
(and (has-value? m2) (= (get-value m2) 0))
)
(set-value! product 0 me)
)
((and (has-value? m1) (has-value? m2))
(set-value!
product
(* (get-value m1) (get-value m2))
me
)
)
((and (has-value? product) (has-value? m1))
(set-value!
m2
(/ (get-value product) (get-value m1))
me
)
)
((and (has-value? product) (has-value? m2))
(set-value!
m1
(/ (get-value product) (get-value m2))
me
)
)
)
)
(define (process-forget-value)
(forget-value! product me)
(forget-value! m1 me)
(forget-value! m2 me)
(process-new-value)
)
(define (me request)
(cond
((eq? request 'I-have-a-value)
(process-new-value)
)
((eq? request 'I-lost-my-value)
(process-forget-value)
)
(else
(error "Unknown request -- MULTIPLIER" request)
)
)
)
(connect m1 me)
(connect m2 me)
(connect product me)
me
)
(define (constant value connector)
(define (me request)
(error "Unknown request -- CONSTANT" request)
)
(connect connector me)
(set-value! connector value me)
me
)
(define (has-value? connector) (connector 'has-value?))
(define (get-value connector) (connector 'value))
(define (set-value! connector new-value informant)
((connector 'set-value!) new-value informant)
)
(define (forget-value! connector retractor)
((connector 'forget) retractor)
)
(define (connect connector new-constraint)
((connector 'connect) new-constraint)
)
(define (inform-about-value constraint)
(constraint 'I-have-a-value)
)
(define (inform-about-no-value constraint)
(constraint 'I-lost-my-value)
)
(define (make-connector)
(let ((value false) (informant false) (constraints '()))
(define (set-my-value newval setter)
(cond
((not (has-value? me))
(set! value newval)
(set! informant setter)
(for-each-except
setter
inform-about-value
constraints
)
)
((not (= value newval))
(error "Contradiction" (list value newval))
)
(else
'ignored
)
)
)
(define (forget-my-value retractor)
(if (eq? retractor informant)
(begin (set! informant false)
(for-each-except
retractor
inform-about-no-value
constraints
)
)
'ignored
)
)
(define (connect new-constraint)
(if (not (memq new-constraint constraints))
(set! constraints (cons new-constraint constraints))
(void)
)
(if (has-value? me)
(inform-about-value new-constraint)
(void)
)
'done
)
(define (me request)
(cond
((eq? request 'has-value?)
(if informant true false)
)
((eq? request 'value) value)
((eq? request 'set-value!) set-my-value)
((eq? request 'forget) forget-my-value)
((eq? request 'connect) connect)
(else
(error "Unknown operation -- CONNECTOR" request)
)
)
)
me
)
)
(define (for-each-except exception procedure list)
(define (loop items)
(cond
((null? items) 'done)
((eq? (car items) exception) (loop (cdr items)))
(else
(procedure (car items))
(loop (cdr items))
)
)
)
(loop list)
)
(define (probe name connector)
(define (print-probe value)
(display "Probe: ")
(display name)
(display " = ")
(display value)
(newline)
)
(define (process-new-value)
(print-probe (get-value connector))
)
(define (process-forget-value)
(print-probe "?")
)
(define (me request)
(cond
((eq? request 'I-have-a-value)
(process-new-value)
)
((eq? request 'I-lost-my-value)
(process-forget-value)
)
(else
(error "Unknown request -- PROBE" request)
)
)
)
(connect connector me)
me
)
; Test Driver
(define (run-test return-type proc . args)
(define (print-item-list items first-time?)
(cond
((not (pair? items)) (void))
(else
(if (not first-time?)
(display ", ")
(void)
)
(print (car items))
(print-item-list (cdr items) false)
)
)
)
(display "Applying ")
(display proc)
(if (not (null? args))
(begin
(display " on: ")
(print-item-list args true)
)
(void)
)
(newline)
(let ((result (apply proc args)))
(if (not (eq? return-type 'none))
(display "Result: ")
(void)
)
(cond
((procedure? result) ((result 'print)))
; ((eq? return-type 'deque) (print-deque result))
((eq? return-type 'none) (void))
(else
(print result)
(newline)
)
)
)
(newline)
)
(define (execution-time proc . args)
(define start-time (current-milliseconds))
; (display start-time)
; (display " ")
(apply proc args)
(define end-time (current-milliseconds))
; (display end-time)
(display "Execution time of ")
(display proc)
(display ": ")
(- end-time start-time)
)
; Tests
(define a (make-connector))
(define b (make-connector))
(define c (make-connector))
(averager a b c)
(probe 'a a)
(probe 'b b)
(probe 'c c)
; Test Results
Welcome to DrRacket, version 6.11 [3m].
Language: racket, with debugging; memory limit: 512 MB.
#<procedure:me>
> (set-value! a 15 'user)
Probe: a = 15
'done
> (set-value! b 35 'user)
Probe: b = 35
Probe: c = 25
'done
> (forget-value! b 'user)
Probe: b = ?
Probe: c = ?
'done
> (set-value! c 150 'user)
Probe: c = 150
Probe: b = 285
'done
> (forget-value! a 'user)
Probe: a = ?
Probe: b = ?
'done
> (get-value a)
15
> (get-value b)
285
> (get-value c)
150
> (set-value! a -170 'user)
Probe: a = -170
Probe: b = 470
'done
>