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
|
(*
Copyright (c) 2000
Cambridge University Technical Services Limited
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*)
structure Misc :
(*****************************************************************************)
(* Misc exports signature *)
(*****************************************************************************)
sig
(* standard exceptions used by the compiler *)
exception Interrupt;
(* These are handled in the compiler *)
exception Conversion of string; (* string to int conversion failure *)
(* This isn't handled at all (except generically) *)
exception InternalError of string; (* compiler error *)
val quickSort : ('a -> 'a -> bool) -> 'a list -> 'a list
val unescapeString : string -> string
type 'a iter;
val Iter : {next: unit -> 'a iter, value: unit -> 'a, continue: bool} ->
'a iter
val Continue : 'a iter -> bool
val Value : 'a iter -> 'a
val Next : 'a iter -> 'a iter
val iterList : 'a iter -> 'a list
val upto : int -> int -> int iter
val downto : int -> int -> int iter
val for : 'a iter -> ('a -> 'b) -> unit
val forsucc: ('a -> 'a) -> ('a * 'b -> bool) ->
'a -> 'b -> ('a -> 'c) -> unit
val first : ('a -> bool) -> ('a -> 'b) -> (unit -> 'b) -> 'a iter -> 'b
val mapIterator : ('a -> 'b) -> 'a iter -> 'b list
val revfoldIterator : ('a -> 'b -> 'b) -> 'b -> 'a iter -> 'b
val lookupDefault : ('a -> 'b option) -> ('a -> 'b option) -> 'a -> 'b option
end =
(*****************************************************************************)
(* Misc structure body *)
(*****************************************************************************)
struct
open RuntimeCalls; (* for POLY_SYS and EXC numbers *)
exception Interrupt = SML90.Interrupt;
(* These are handled in the compiler *)
(* Conversion may be also raised by run-time Conversion routines *)
local
structure Conversion =
RunCall.Run_exception1
(
type ex_type = string;
val ex_iden = EXC_conversion
);
in
exception Conversion = Conversion.ex;
end;
(* This isn't handled at all (except generically) *)
exception InternalError of string; (* compiler error *)
fun filter f [] = []
| filter f (h::t) =
if f h then h :: filter f t else filter f t;
fun quickSort (leq:'a -> 'a -> bool) ([]:'a list) = []
| quickSort (leq:'a -> 'a -> bool) ([h]:'a list) = [h]
| quickSort (leq:'a -> 'a -> bool) ((h::t) :'a list) =
let
val (after, befor) = List.partition (leq h) t
in
quickSort leq befor @ (h :: quickSort leq after)
end;
(* Convert a string, recognising and converting escape codes. This is
installed as the initial string conversion function and replaced
when the String structure is compiled.
We can't use fromString because it stops on invalid input and
returns as much as it can rather than raising an exception. *)
fun unescapeString(s: string) : string =
let
val len = size s
fun rdr i =
if i = len then NONE
else SOME(String.sub(s, i), i+1)
(* Repeatedly convert escape sequences and accumulate the
results in a list. *)
fun convChars i =
if i = len then [] (* Finished *)
else case Char.scan rdr i of
NONE => (* Bad conversion *)
raise Conversion "Invalid string constant"
| SOME(res, j) => res :: convChars j
in
String.implode(convChars 0)
end
fun forsucc succ (op <=) =
let
fun for first last f =
if first <= last then (f first; for (succ first) last f) else ();
in
for
end;
datatype 'a iter = Iter of { continue: bool,
value: unit -> 'a,
next: unit -> 'a iter };
fun Continue (Iter {continue,...}) = continue;
fun Value (Iter {value,...}) = value();
fun Next (Iter {next,...}) = next();
fun iterList i = if Continue i then Value i :: iterList (Next i) else [];
fun first condition (* The condition to search for *)
thenpart (* Executed if found *)
elsepart (* Executed if not *) =
let
fun search i = if Continue i
then
let
val v = Value i;
in
if condition v then thenpart v else search (Next i)
end
else elsepart()
in
search
end;
fun for i body = if Continue i then (body (Value i); for (Next i) body) else ();
fun mapIterator f i = map f (iterList i);
(*fun revfoldIterator f x i = revfold f x (iterList i);*)
fun revfoldIterator f x i =
if Continue i
then revfoldIterator f (f (Value i) x) (Next i)
else x
fun upto start finish =
let
fun succ n = Iter { continue = n <= finish,
next = fn () => succ (n+1),
value = fn () => n };
in
succ start
end;
fun downto start finish =
let
fun pred n = Iter { continue = n >= finish,
next = fn () => pred (n-1),
value = fn () => n };
in
pred start
end;
fun lookupDefault first second = (fn key => case first key of NONE => second key | v => v);
end (* Misc *);
|
