-
Notifications
You must be signed in to change notification settings - Fork 320
/
ch-2.ps
186 lines (174 loc) · 3.82 KB
/
ch-2.ps
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
%!PS
% begin included library code
% see https://github.com/Firedrake/postscript-libraries/
/quicksort.main { % lo hi -> (null)
3 dict begin
/hi exch def
/lo exch def
/xit false def
lo 0 lt {
/xit true def
} if
hi 0 lt {
/xit true def
} if
lo hi ge {
/xit true def
} if
xit not {
/p quicksort.partition def
lo p quicksort.main
p 1 add hi quicksort.main
} if
end
} bind def
/quicksort { % [ a c b ] -> [ a b c ]
1 dict begin
/arr exch def
0 arr length 1 sub quicksort.main
arr
end
} bind def
/test.end {
( ) print
test.count 0 gt {
(Passed ) print
test.pass (...) cvs print
(/) print
test.count (...) cvs print
( \() print
test.pass 100 mul test.count idiv (...) cvs print
(%\)) print
(\r\n) print
} if
} bind def
/test.start {
print (:) print
/test.pass 0 def
/test.count 0 def
} bind def
/deepeq {
2 dict begin
/a exch def
/b exch def
a type b type eq {
a type /dicttype eq {
a length b length eq {
<<
a {
pop
true
} forall
b {
pop
true
} forall
>>
true exch
{
pop
dup a exch known {
dup b exch known {
dup a exch get exch b exch get deepeq not {
pop false
} if
} {
false
} ifelse
} {
false
} ifelse
} forall
} {
false
} ifelse
} {
a type dup /arraytype eq exch /stringtype eq or {
a length b length eq {
true
0 1 a length 1 sub {
dup a exch get exch b exch get deepeq not {
pop false
exit
} if
} for
} {
false
} ifelse
} {
a b eq
} ifelse
} ifelse
} {
false
} ifelse
end
} bind def
/quicksort.swap {
2 dict begin
/bi exch def
/ai exch def
arr ai get
arr bi get
arr exch ai exch put
arr exch bi exch put
end
} bind def
/quicksort.partition {
3 dict begin
/pivot arr hi lo add 2 idiv get def
/i lo 1 sub def
/j hi 1 add def
{
{
/i i 1 add def
arr i get pivot ge {
exit
} if
} loop
{
/j j 1 sub def
arr j get pivot le {
exit
} if
} loop
i j ge {
j
exit
} if
i j quicksort.swap
} loop
end
} bind def
/test {
/test.count test.count 1 add def
{
/test.pass test.pass 1 add def
} {
( ) print
test.count (....) cvs print
(-fail) print
} ifelse
} bind def
% end included library code
/fivenumber {
4 dict begin
/n exch quicksort def
/nl n length 1 sub def
[
n 0 get
1 1 3 {
nl mul /bx exch def
/base bx 4 idiv def
n base get
bx 4 mod 0 ne {
n base 1 add get add 2.0 div
} if
} for
n nl get
]
end
} bind def
(fivenumber) test.start
[0.0 0.0 1.0 2.0 63.0 61.0 27.0 13.0] fivenumber [ 0.0 0.5 7.5 44.0 63.0 ] deepeq test
test.end