-
Notifications
You must be signed in to change notification settings - Fork 1
/
Exercise 3.58 expand.rkt
174 lines (153 loc) · 2.73 KB
/
Exercise 3.58 expand.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
#lang racket
; Exercise 3.58. Give an interpretation of the stream computed by the following procedure:
; (define (expand num den radix)
; (cons-stream
; (quotient (* num radix) den)
; (expand (remainder (* num radix) den) den radix)))
; (Quotient is a primitive that returns the integer quotient of two integers.) What are the
; successive elements produced by (expand 1 7 10) ? What is produced by (expand 3 8 10) ?
; S O L U T I O N
; (expand 1 7 10) produces:
; 1, 4, 2, 8, 5, 7, 1, 4, 2, 8, 5, 7, 1, 4 ...
; (expand 3 8 10) produces
; 3, 7, 5, 0, 0, 0, 0 ...
(define (expand num den radix)
(stream-cons
(quotient (* num radix) den)
(expand (remainder (* num radix) den) den radix)
)
)
(define (stream-ref s n)
; (display "Entered stream-ref with n = ")
; (display n)
; (newline)
(if (= n 0)
(stream-first s)
(stream-ref (stream-rest s) (- n 1))
)
)
; This procedure displays a finite number of elements from the supplied stream
; as specified by 'count'
(define (display-stream-elements count s)
(if (= 0 count)
(begin
(newline)
'done
)
(begin
(newline)
(display (stream-first s))
(display-stream-elements (- count 1) (stream-rest s))
)
)
)
; 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
; Test Results
Welcome to DrRacket, version 6.11 [3m].
Language: racket, with debugging; memory limit: 512 MB.
> (define S1 (expand 1 7 10))
> (display-stream-elements 25 S1)
1
4
2
8
5
7
1
4
2
8
5
7
1
4
2
8
5
7
1
4
2
8
5
7
1
'done
> (define S2 (expand 3 8 10))
> (display-stream-elements 20 S2)
3
7
5
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
'done
>