-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathch2.5.3-suguni.rkt
447 lines (361 loc) · 13.4 KB
/
ch2.5.3-suguni.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
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
(load "support/common.rkt")
(load "support/data-directed-prog.rkt")
;; generic arithmetic operators
(define (add x y) (apply-generic 'add x y))
(define (sub x y) (apply-generic 'sub x y))
(define (mul x y) (apply-generic 'mul x y))
(define (div x y) (apply-generic 'div x y))
(define (equ? x y) (apply-generic 'equ? x y))
(define (=zero? x) (apply-generic '=zero? x))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;; scheme number package
(define (install-scheme-number-package)
(define (tag x)
(attach-tag 'scheme-number x))
(put 'add '(scheme-number scheme-number)
(lambda (x y) (tag (+ x y))))
(put 'sub '(scheme-number scheme-number)
(lambda (x y) (tag (- x y))))
(put 'mul '(scheme-number scheme-number)
(lambda (x y) (tag (* x y))))
(put 'div '(scheme-number scheme-number)
(lambda (x y) (tag (/ x y))))
(put 'make 'scheme-number
(lambda (x) (tag x)))
;; equ?
(define (equ? x y) (eq? x y))
(put 'equ? '(scheme-number scheme-number) equ?)
;; =zero?
(put '=zero? '(scheme-number) zero?) ;; ??? (zero? x)
;; ex 2.81
(put 'exp '(scheme-number scheme-number)
(lambda (x y) (tag (expt x y))))
'done)
(define (make-scheme-number n)
((get 'make 'scheme-number) n))
;; rational package
(define (install-rational-package)
(define (numer x) (car x))
(define (denom x) (cdr x))
(define (make-rat n d)
(if (not (zero? d))
(let ((g (gcd n d)))
(cons (/ n g) (/ d g)))
(cons n d)))
(define (add-rat x y)
(make-rat (+ (* (numer x) (denom y))
(* (numer y) (denom x)))
(* (denom x) (denom y))))
(define (sub-rat x y)
(make-rat (- (* (numer x) (denom y))
(* (numer y) (denom x)))
(* (denom x) (denom y))))
(define (mul-rat x y)
(make-rat (* (numer x) (numer y))
(* (denom x) (denom y))))
(define (div-rat x y)
(make-rat (* (numer x) (denom y))
(* (denom x) (numer y))))
(define (tag x)
(attach-tag 'rational x))
(put 'add '(rational rational)
(lambda (x y) (tag (add-rat x y))))
(put 'sub '(rational rational)
(lambda (x y) (tag (sub-rat x y))))
(put 'mul '(rational rational)
(lambda (x y) (tag (mul-rat x y))))
(put 'div '(rational rational)
(lambda (x y) (tag (div-rat x y))))
(put 'make 'rational
(lambda (n d) (tag (make-rat n d))))
;; equ?
(define (equ? x y)
(and (eq? (numer x) (numer y))
(eq? (denom x) (denom y))))
(put 'equ? '(rational rational) equ?)
;; =zero?
(put '=zero? '(rational)
(lambda (x) (and (zero? (numer x)) (not (zero? (denom x))))))
'done)
(define (make-rational n d)
((get 'make 'rational) n d))
;; 직각좌표 package
(define (install-rectangular-package)
(define (real-part z) (car z))
(define (imag-part z) (cdr z))
(define (magnitude z)
(sqrt (+ (square (real-part z))
(square (imag-part z)))))
(define (angle z)
(atan (imag-part z) (real-part z)))
(define (make-from-real-imag x y) (cons x y))
(define (make-from-mag-ang r a)
(cons (* r (cos a))
(* r (sin a))))
;; utility
(define (tag x) (attach-tag 'rectangular x))
;; interface
(put 'real-part '(rectangular) real-part)
(put 'imag-part '(rectangular) imag-part)
(put 'magnitude '(rectangular) magnitude)
(put 'angle '(rectangular) angle)
(put 'make-from-real-imag 'rectangular
(lambda (x y) (tag (make-from-real-imag x y))))
(put 'make-from-mag-ang 'rectangular
(lambda (r a) (tag (make-from-mag-ang r a))))
;; equ?
(define (equ? x y)
(and (eq? (real-part x) (real-part y))
(eq? (imag-part x) (imag-part y))))
(put 'equ? '(rectangular rectangular) equ?)
;; =zero?
(put '=zero? '(rectangular)
(lambda (z) (and (zero? (real-part z))
(zero? (imag-part z)))))
'done)
;; 극좌표 package
(define (install-polar-package)
(define (real-part z)
(* (magnitude z) (cos (angle z))))
(define (imag-part z)
(* (magnitude z) (sin (angle z))))
(define (magnitude z) (car z))
(define (angle z) (cdr z))
(define (make-from-real-imag x y)
(cons (sqrt (+ (square x) (square y)))
(atan y x)))
(define (make-from-mag-ang r a) (cons r a))
;; utility
(define (tag x) (attach-tag 'polar x))
;; interface
(put 'real-part '(polar) real-part)
(put 'imag-part '(polar) imag-part)
(put 'magnitude '(polar) magnitude)
(put 'angle '(polar) angle)
(put 'make-from-real-imag 'polar
(lambda (x y) (tag (make-from-real-imag x y))))
(put 'make-from-mag-ang 'polar
(lambda (r a) (tag (make-from-mag-ang r a))))
;; equ?
(define (equ? x y)
(and (eq? (magnitude x) (magnitude y))
(eq? (angle x) (angle y))))
(put 'equ? '(polar polar) equ?)
;; =zero?
(put '=zero? '(polar)
(lambda (z) (zero? (magnitude z))))
'done)
(define (real-part z) (apply-generic 'real-part z))
(define (imag-part z) (apply-generic 'imag-part z))
(define (magnitude z) (apply-generic 'magnitude z))
(define (angle z) (apply-generic 'angle z))
;; 복소수 pakcage
(define (install-complex-package)
(define (make-from-real-imag x y)
((get 'make-from-real-imag 'rectangular) x y))
(define (make-from-mag-ang r a)
((get 'make-from-mag-ang 'polar) r a))
(define (add-complex z1 z2)
(make-from-real-imag (+ (real-part z1) (real-part z2))
(+ (imag-part z1) (imag-part z2))))
(define (sub-complex z1 z2)
(make-from-real-imag (- (real-part z1) (real-part z2))
(- (imag-part z1) (imag-part z2))))
(define (mul-complex z1 z2)
(make-from-mag-ang (* (magnitude z1) (magnitude z2))
(* (angle z1) (angle z2))))
(define (div-complex z1 z2)
(make-from-mag-ang (/ (magnitude z1) (magnitude z2))
(/ (angle z1) (angle z2))))
(define (tag x) (attach-tag 'complex x))
(put 'add '(complex complex)
(lambda (z1 z2) (tag (add-complex z1 z2))))
(put 'sub '(complex complex)
(lambda (z1 z2) (tag (sub-complex z1 z2))))
(put 'mul '(complex complex)
(lambda (z1 z2) (tag (mul-complex z1 z2))))
(put 'div '(complex complex)
(lambda (z1 z2) (tag (div-complex z1 z2))))
(put 'make-from-real-imag 'complex
(lambda (x y) (tag (make-from-real-imag x y))))
(put 'make-from-mag-ang 'complex
(lambda (r a) (tag (make-from-mag-ang r a))))
;; complex에 대해서 real-part, imag-part, magnitude, angle 가능하게 함.
(put 'real-part '(complex) real-part)
(put 'imag-part '(complex) imag-part)
(put 'magnitude '(complex) magnitude)
(put 'angle '(complex) angle)
;; equ?
(put 'equ? '(complex complex)
(lambda (x y) (apply-generic 'equ? x y)))
;; =zero?
(put '=zero? '(complex)
(lambda (z) (apply-generic '=zero? z)))
'done)
(define (make-complex-from-real-imag x y)
((get 'make-from-real-imag 'complex) x y))
(define (make-complex-from-mag-ang r a)
((get 'make-from-mag-ang 'complex) r a))
(install-scheme-number-package)
(install-rational-package)
(install-rectangular-package)
(install-polar-package)
(install-complex-package)
;; polynomial package
(define (install-polynomial-package)
;; polynomial 구조
;; (variable ((order coeff) (order coeff) ... (order coeff)))
(define (make-poly variable term-list)
(cons variable term-list))
(define (variable p) (car p))
(define (term-list p) (cdr p))
(define (variable? e) (symbol? e))
(define (same-variable? v1 v2) (and (variable? v1) (variable? v2) (eq? v1 v2)))
; (define (adjoin-term term term-list)
; (if (=zero? (coeff term))
; term-list
; (cons term term-list)))
;
; (define (the-empty-termlist) '())
; (define (empty-termlist? term) (null? term))
; (define (first-term term-list) (car term-list))
; (define (rest-terms term-list) (cdr term-list))
;; ex 2.89
;; 다른 코드(adjoin-term을 이용하는 프로시저들)는 그대로 두고 adjoin-term 프로시저만 변경
;; 아래 테스트 코드에서는 sparse term-list로 테스트하고 있어 수정함.
(define (adjoin-term term term-list)
(define (insert-n v n l) ;; l=(1 2 3 4) v=2, n=3 => (2 2 2 1 2 3 4)
(if (= n 0)
l
(insert-n v (- n 1) (cons v l))))
(define (replace-n v n l)
(define (iter input idx output)
(if (null? input)
output
(iter (cdr input) (- idx 1)
(append output (list (if (= idx n) v (car input)))))))
(iter l (- (length l) 1) '()))
(let ((max-order (- (length term-list) 1))
(o (order term))
(c (coeff term)))
(if (> o max-order)
(cons c (insert-n 0 (- o max-order 1) term-list))
(replace-n c o term-list))))
(define (the-empty-termlist) '())
(define (empty-termlist? term-list) (null? term-list))
(define (first-term term-list)
(make-term (- (length term-list) 1) (car term-list))) ;; !!!
(define (rest-terms term-list)
(cdr term-list))
;; (put 'terms 'polynomial (lambda(x) (term-list x)))
(define (make-term order coeff) (list order coeff))
(define (order term) (car term))
(define (coeff term) (cadr term))
(define (add-terms l1 l2)
(cond ((empty-termlist? l1) l2)
((empty-termlist? l2) l1)
(else
(let ((t1 (first-term l1))
(t2 (first-term l2)))
(cond ((> (order t1) (order t2))
(adjoin-term t1 (add-terms (rest-terms l1) l2)))
((< (order t1) (order t2))
(adjoin-term t2 (add-terms l1 (rest-terms l2))))
(else (adjoin-term
(make-term (order t1)
(add (coeff t1) (coeff t2)))
(add-terms (rest-terms l1)
(rest-terms l2)))))))))
(define (mul-terms l1 l2)
(if (empty-termlist? l1)
(the-empty-termlist)
(add-terms (mul-term-by-all-terms (first-term l1) l2)
(mul-terms (rest-terms l1) l2))))
(define (mul-term-by-all-terms t1 l)
(if (empty-termlist? l)
(the-empty-termlist)
(let ((t2 (first-term l)))
(adjoin-term
(make-term (+ (order t1) (order t2))
(mul (coeff t1) (coeff t2)))
(mul-term-by-all-terms t1 (rest-terms l))))))
(define (add-poly p1 p2)
(if (same-variable? (variable p1) (variable p2))
(make-poly (variable p1)
(add-terms (term-list p1)
(term-list p2)))
(error "Poly not in same var -- ADD-POLY" (list p1 p2))))
(define (mul-poly p1 p2)
(if (same-variable? (variable p1) (variable p2))
(make-poly (variable p1)
(mul-terms (term-list p1)
(term-list p2)))
(error "Poly not in same var -- MUL-POLY" (list p1 p2))))
(define (tag p) (attach-tag 'polynomial p))
(put 'add '(polynomial polynomial)
(lambda (p1 p2) (tag (add-poly p1 p2))))
(put 'mul '(polynomial polynomial)
(lambda (p1 p2) (tag (mul-poly p1 p2))))
(put 'make 'polynomial
(lambda (var terms) (tag (make-poly var terms))))
;; ex 2.87
(define (=zero-poly? p)
(define (=zero-terms? ts)
(if (null? ts)
#t
(if (=zero? (coeff (first-term ts)))
(=zero-terms? (rest-terms ts))
#f)))
(let ((ts (term-list p)))
(if (empty-termlist? ts)
#t
(=zero-terms? ts))))
(put '=zero? '(polynomial) =zero-poly?)
;; ex 2.88
(define (sub-terms l1 l2)
(let ((minus-l2 (mul-terms (adjoin-term (make-term 0 -1)
(the-empty-termlist)) l2))) ;; ((0 -1))
(add-terms l1 minus-l2)))
(define (sub-poly p1 p2)
(if (same-variable? (variable p1) (variable p2))
(make-poly (variable p1)
(sub-terms (term-list p1)
(term-list p2)))
(error "Poly not in same var -- SUB-POLY" (list p1 p2))))
(put 'sub '(polynomial polynomial)
(lambda (p1 p2) (tag (sub-poly p1 p2))))
'done)
(define (make-polynomial var terms)
((get 'make 'polynomial) var terms))
(install-polynomial-package)
;; polynomial package test code
;; sparse term list
;; (define p1 (make-polynomial 'x '((2 1) (1 2) (0 1)))) ;; x^2 + 2x + 1
;; (define p2 (make-polynomial 'x '((2 1) (1 -2) (0 1)))) ;; x^2 - 2x + 1
;; dense term list 인 경우
(define p1 (make-polynomial 'x '(1 2 1))) ;; x^2 + 2x + 1
(define p2 (make-polynomial 'x '(1 -2 1))) ;; x^2 - 2x + 1
(add p1 p2) ;; > 2x^2 + 2
;; ex 2.87 test code
(define zero-poly1 (make-polynomial 'x '()))
;; (define zero-poly2 (make-polynomial 'x '((2 0) (0 0))))
;; ex 2.89 테스트 코드
(define zero-poly2 (make-polynomial 'x '(0 0 0)))
;(define zero-poly2 (make-polynomial 'x '((2 0) (0 0))))
(define zero-poly2 (make-polynomial 'x '(0 0 0))) ;; 0x^2 + 0x + 0
(=zero? zero-poly1)
(=zero? zero-poly2)
(=zero? p1)
;; ex 2.88 test code
;(mul (make-polynomial 'x '((0 -1))) p1) ;; -x^2 + -2x + -1
;(mul (make-polynomial 'x '((0 -1))) p2) ;; -x^2 + 2x + 1
;(add p1 p2) ;; 2x^2 + 2
;(=zero? (add p1 (mul (make-polynomial 'x '((0 -1))) p1))) ;; 0
;(sub p1 p2) ;; 4x
;(sub p2 p1) ;; -4x
;;(define py (make-polynomial 'y '((2 1) (0 1))))
(define py (make-polynomial 'y '(1 0 1)))
(define (install-dense-terms-package)
'done)
(define (install-sparse-terms-package)
'done)