author  paulson 
Tue, 03 Dec 1996 11:20:43 +0100  
changeset 2303  84ed9e0d7c50 
parent 2271  7c4744ed8fc3 
child 2317  672015b535d7 
permissions  rwrr 
41
97aae241094b
added cons, rcons, last_elem, sort_strings, take_suffix;
wenzelm
parents:
24
diff
changeset

1 
(* Title: Pure/library.ML 
0  2 
ID: $Id$ 
233  3 
Author: Lawrence C Paulson, Cambridge University Computer Laboratory 
0  4 
Copyright 1992 University of Cambridge 
5 

233  6 
Basic library: functions, options, pairs, booleans, lists, integers, 
7 
strings, lists as sets, association lists, generic tables, balanced trees, 

2243
3ebeaaacfbd1
Etaexpanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset

8 
input / TextIO.output, timing, filenames, misc functions. 
0  9 
*) 
10 

1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

11 
infix > ~~ \ \\ orelf ins ins_string ins_int orf andf prefix upto downto 
2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset

12 
mem mem_int mem_string union union_int union_string 
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset

13 
inter inter_int inter_string subset subset_int subset_string subdir_of; 
1364
8ea1a962ad72
files now define a structure to allow SML/NJ to optimize the code
clasohm
parents:
1290
diff
changeset

14 

8ea1a962ad72
files now define a structure to allow SML/NJ to optimize the code
clasohm
parents:
1290
diff
changeset

15 

8ea1a962ad72
files now define a structure to allow SML/NJ to optimize the code
clasohm
parents:
1290
diff
changeset

16 
structure Library = 
8ea1a962ad72
files now define a structure to allow SML/NJ to optimize the code
clasohm
parents:
1290
diff
changeset

17 
struct 
0  18 

233  19 
(** functions **) 
0  20 

233  21 
(*handy combinators*) 
22 
fun curry f x y = f (x, y); 

23 
fun uncurry f (x, y) = f x y; 

24 
fun I x = x; 

25 
fun K x y = x; 

0  26 

380  27 
(*reverse apply*) 
410  28 
fun (x > f) = f x; 
380  29 

233  30 
(*combine two functions forming the union of their domains*) 
2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset

31 
fun (f orelf g) = fn x => f x handle Match => g x; 
0  32 

233  33 
(*application of (infix) operator to its left or right argument*) 
34 
fun apl (x, f) y = f (x, y); 

35 
fun apr (f, y) x = f (x, y); 

0  36 

233  37 
(*functional for pairs*) 
38 
fun pairself f (x, y) = (f x, f y); 

0  39 

233  40 
(*function exponentiation: f(...(f x)...) with n applications of f*) 
41 
fun funpow n f x = 

42 
let fun rep (0, x) = x 

43 
 rep (n, x) = rep (n  1, f x) 

44 
in rep (n, x) end; 

160  45 

46 

47 

233  48 
(** options **) 
0  49 

50 
datatype 'a option = None  Some of 'a; 

51 

52 
exception OPTION of string; 

53 

54 
fun the (Some x) = x 

55 
 the None = raise OPTION "the"; 

56 

255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

57 
fun if_none None y = y 
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

58 
 if_none (Some x) _ = x; 
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

59 

0  60 
fun is_some (Some _) = true 
61 
 is_some None = false; 

62 

63 
fun is_none (Some _) = false 

64 
 is_none None = true; 

65 

233  66 
fun apsome f (Some x) = Some (f x) 
67 
 apsome _ None = None; 

0  68 

233  69 

70 

71 
(** pairs **) 

72 

73 
fun pair x y = (x, y); 

74 
fun rpair x y = (y, x); 

75 

76 
fun fst (x, y) = x; 

77 
fun snd (x, y) = y; 

78 

79 
fun eq_fst ((x1, _), (x2, _)) = x1 = x2; 

80 
fun eq_snd ((_, y1), (_, y2)) = y1 = y2; 

81 

82 
fun swap (x, y) = (y, x); 

83 

84 
(*apply the function to a component of a pair*) 

85 
fun apfst f (x, y) = (f x, y); 

86 
fun apsnd f (x, y) = (x, f y); 

87 

88 

89 

90 
(** booleans **) 

91 

92 
(* equality *) 

93 

94 
fun equal x y = x = y; 

95 
fun not_equal x y = x <> y; 

96 

97 

98 
(* operators for combining predicates *) 

99 

2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset

100 
fun (p orf q) = fn x => p x orelse q x; 
233  101 

2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset

102 
fun (p andf q) = fn x => p x andalso q x; 
233  103 

104 
fun notf p x = not (p x); 

0  105 

233  106 

107 
(* predicates on lists *) 

108 

109 
fun orl [] = false 

110 
 orl (x :: xs) = x orelse orl xs; 

111 

112 
fun andl [] = true 

113 
 andl (x :: xs) = x andalso andl xs; 

114 

2271  115 
(*Needed because several objectlogics declare the theory, therefore structure, 
116 
List.*) 

117 
structure List_ = List; 

118 

233  119 
(*exists pred [x1, ..., xn] ===> pred x1 orelse ... orelse pred xn*) 
120 
fun exists (pred: 'a > bool) : 'a list > bool = 

121 
let fun boolf [] = false 

122 
 boolf (x :: xs) = pred x orelse boolf xs 

123 
in boolf end; 

124 

125 
(*forall pred [x1, ..., xn] ===> pred x1 andalso ... andalso pred xn*) 

126 
fun forall (pred: 'a > bool) : 'a list > bool = 

127 
let fun boolf [] = true 

128 
 boolf (x :: xs) = pred x andalso boolf xs 

129 
in boolf end; 

0  130 

233  131 

380  132 
(* flags *) 
133 

134 
fun set flag = (flag := true; true); 

135 
fun reset flag = (flag := false; false); 

136 
fun toggle flag = (flag := not (! flag); ! flag); 

137 

138 

233  139 

140 
(** lists **) 

141 

142 
exception LIST of string; 

143 

144 
fun null [] = true 

145 
 null (_ :: _) = false; 

146 

147 
fun hd [] = raise LIST "hd" 

148 
 hd (x :: _) = x; 

149 

150 
fun tl [] = raise LIST "tl" 

151 
 tl (_ :: xs) = xs; 

152 

153 
fun cons x xs = x :: xs; 

154 

155 

156 
(* fold *) 

157 

158 
(*the following versions of fold are designed to fit nicely with infixes*) 

0  159 

233  160 
(* (op @) (e, [x1, ..., xn]) ===> ((e @ x1) @ x2) ... @ xn 
161 
for operators that associate to the left (TAIL RECURSIVE)*) 

162 
fun foldl (f: 'a * 'b > 'a) : 'a * 'b list > 'a = 

163 
let fun itl (e, []) = e 

164 
 itl (e, a::l) = itl (f(e, a), l) 

165 
in itl end; 

166 

167 
(* (op @) ([x1, ..., xn], e) ===> x1 @ (x2 ... @ (xn @ e)) 

168 
for operators that associate to the right (not tail recursive)*) 

169 
fun foldr f (l, e) = 

170 
let fun itr [] = e 

171 
 itr (a::l) = f(a, itr l) 

172 
in itr l end; 

173 

174 
(* (op @) [x1, ..., xn] ===> x1 @ (x2 ... @ (x[n1] @ xn)) 

175 
for n > 0, operators that associate to the right (not tail recursive)*) 

176 
fun foldr1 f l = 

177 
let fun itr [x] = x (* FIXME [] case: elim warn (?) *) 

178 
 itr (x::l) = f(x, itr l) 

179 
in itr l end; 

180 

181 

182 
(* basic list functions *) 

183 

184 
(*length of a list, should unquestionably be a standard function*) 

185 
local fun length1 (n, []) = n (*TAIL RECURSIVE*) 

186 
 length1 (n, x :: xs) = length1 (n + 1, xs) 

187 
in fun length l = length1 (0, l) end; 

188 

189 
(*take the first n elements from a list*) 

190 
fun take (n, []) = [] 

191 
 take (n, x :: xs) = 

192 
if n > 0 then x :: take (n  1, xs) else []; 

193 

194 
(*drop the first n elements from a list*) 

195 
fun drop (n, []) = [] 

196 
 drop (n, x :: xs) = 

197 
if n > 0 then drop (n  1, xs) else x :: xs; 

0  198 

233  199 
(*return nth element of a list, where 0 designates the first element; 
200 
raise EXCEPTION if list too short*) 

201 
fun nth_elem NL = 

202 
(case drop NL of 

203 
[] => raise LIST "nth_elem" 

204 
 x :: _ => x); 

205 

206 
(*last element of a list*) 

207 
fun last_elem [] = raise LIST "last_elem" 

208 
 last_elem [x] = x 

209 
 last_elem (_ :: xs) = last_elem xs; 

210 

211 
(*find the position of an element in a list*) 

212 
fun find (x, ys) = 

213 
let fun f (y :: ys, i) = if x = y then i else f (ys, i + 1) 

214 
 f (_, _) = raise LIST "find" 

215 
in f (ys, 0) end; 

216 

217 
(*flatten a list of lists to a list*) 

218 
fun flat (ls: 'c list list) : 'c list = foldr (op @) (ls, []); 

219 

220 

221 
(*like Lisp's MAPC  seq proc [x1, ..., xn] evaluates 

222 
(proc x1; ...; proc xn) for side effects*) 

223 
fun seq (proc: 'a > unit) : 'a list > unit = 

224 
let fun seqf [] = () 

225 
 seqf (x :: xs) = (proc x; seqf xs) 

226 
in seqf end; 

227 

228 

229 
(*separate s [x1, x2, ..., xn] ===> [x1, s, x2, s, ..., s, xn]*) 

230 
fun separate s (x :: (xs as _ :: _)) = x :: s :: separate s xs 

231 
 separate _ xs = xs; 

232 

233 
(*make the list [x, x, ..., x] of length n*) 

234 
fun replicate n (x: 'a) : 'a list = 

235 
let fun rep (0, xs) = xs 

236 
 rep (n, xs) = rep (n  1, x :: xs) 

237 
in 

238 
if n < 0 then raise LIST "replicate" 

239 
else rep (n, []) 

240 
end; 

241 

242 

243 
(* filter *) 

244 

245 
(*copy the list preserving elements that satisfy the predicate*) 

246 
fun filter (pred: 'a>bool) : 'a list > 'a list = 

0  247 
let fun filt [] = [] 
233  248 
 filt (x :: xs) = if pred x then x :: filt xs else filt xs 
249 
in filt end; 

0  250 

251 
fun filter_out f = filter (not o f); 

252 

253 

233  254 
fun mapfilter (f: 'a > 'b option) ([]: 'a list) = [] : 'b list 
255 
 mapfilter f (x :: xs) = 

256 
(case f x of 

257 
None => mapfilter f xs 

258 
 Some y => y :: mapfilter f xs); 

259 

260 

380  261 
fun find_first _ [] = None 
262 
 find_first pred (x :: xs) = 

263 
if pred x then Some x else find_first pred xs; 

264 

265 

233  266 
(* lists of pairs *) 
267 

380  268 
fun map2 _ ([], []) = [] 
269 
 map2 f (x :: xs, y :: ys) = (f (x, y) :: map2 f (xs, ys)) 

270 
 map2 _ _ = raise LIST "map2"; 

271 

272 
fun exists2 _ ([], []) = false 

273 
 exists2 pred (x :: xs, y :: ys) = pred (x, y) orelse exists2 pred (xs, ys) 

274 
 exists2 _ _ = raise LIST "exists2"; 

275 

276 
fun forall2 _ ([], []) = true 

277 
 forall2 pred (x :: xs, y :: ys) = pred (x, y) andalso forall2 pred (xs, ys) 

278 
 forall2 _ _ = raise LIST "forall2"; 

279 

233  280 
(*combine two lists forming a list of pairs: 
281 
[x1, ..., xn] ~~ [y1, ..., yn] ===> [(x1, y1), ..., (xn, yn)]*) 

282 
fun [] ~~ [] = [] 

283 
 (x :: xs) ~~ (y :: ys) = (x, y) :: (xs ~~ ys) 

284 
 _ ~~ _ = raise LIST "~~"; 

285 

286 

287 
(*inverse of ~~; the old 'split': 

288 
[(x1, y1), ..., (xn, yn)] ===> ([x1, ..., xn], [y1, ..., yn])*) 

289 
fun split_list (l: ('a * 'b) list) = (map #1 l, map #2 l); 

290 

291 

292 
(* prefixes, suffixes *) 

293 

294 
fun [] prefix _ = true 

295 
 (x :: xs) prefix (y :: ys) = x = y andalso (xs prefix ys) 

296 
 _ prefix _ = false; 

297 

298 
(* [x1, ..., xi, ..., xn] > ([x1, ..., x(i1)], [xi, ..., xn]) 

299 
where xi is the first element that does not satisfy the predicate*) 

300 
fun take_prefix (pred : 'a > bool) (xs: 'a list) : 'a list * 'a list = 

301 
let fun take (rxs, []) = (rev rxs, []) 

255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

302 
 take (rxs, x :: xs) = 
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

303 
if pred x then take(x :: rxs, xs) else (rev rxs, x :: xs) 
233  304 
in take([], xs) end; 
305 

306 
(* [x1, ..., xi, ..., xn] > ([x1, ..., xi], [x(i+1), ..., xn]) 

307 
where xi is the last element that does not satisfy the predicate*) 

308 
fun take_suffix _ [] = ([], []) 

309 
 take_suffix pred (x :: xs) = 

310 
(case take_suffix pred xs of 

311 
([], sffx) => if pred x then ([], x :: sffx) else ([x], sffx) 

312 
 (prfx, sffx) => (x :: prfx, sffx)); 

313 

314 

315 

316 
(** integers **) 

317 

318 
fun inc i = i := ! i + 1; 

319 
fun dec i = i := ! i  1; 

320 

321 

322 
(* lists of integers *) 

323 

324 
(*make the list [from, from + 1, ..., to]*) 

2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset

325 
fun (from upto to) = 
233  326 
if from > to then [] else from :: ((from + 1) upto to); 
327 

328 
(*make the list [from, from  1, ..., to]*) 

2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset

329 
fun (from downto to) = 
233  330 
if from < to then [] else from :: ((from  1) downto to); 
331 

332 
(*predicate: downto0 (is, n) <=> is = [n, n  1, ..., 0]*) 

333 
fun downto0 (i :: is, n) = i = n andalso downto0 (is, n  1) 

334 
 downto0 ([], n) = n = ~1; 

335 

336 

337 
(* convert integers to strings *) 

338 

339 
(*expand the number in the given base; 

340 
example: radixpand (2, 8) gives [1, 0, 0, 0]*) 

341 
fun radixpand (base, num) : int list = 

342 
let 

343 
fun radix (n, tail) = 

344 
if n < base then n :: tail 

345 
else radix (n div base, (n mod base) :: tail) 

346 
in radix (num, []) end; 

347 

348 
(*expands a number into a string of characters starting from "zerochar"; 

349 
example: radixstring (2, "0", 8) gives "1000"*) 

350 
fun radixstring (base, zerochar, num) = 

351 
let val offset = ord zerochar; 

352 
fun chrof n = chr (offset + n) 

353 
in implode (map chrof (radixpand (base, num))) end; 

354 

355 

356 
fun string_of_int n = 

357 
if n < 0 then "~" ^ radixstring (10, "0", ~n) else radixstring (10, "0", n); 

358 

359 

360 

361 
(** strings **) 

362 

363 
fun is_letter ch = 

364 
ord "A" <= ord ch andalso ord ch <= ord "Z" orelse 

365 
ord "a" <= ord ch andalso ord ch <= ord "z"; 

366 

367 
fun is_digit ch = 

368 
ord "0" <= ord ch andalso ord ch <= ord "9"; 

369 

370 
(*letter or _ or prime (')*) 

371 
fun is_quasi_letter "_" = true 

372 
 is_quasi_letter "'" = true 

373 
 is_quasi_letter ch = is_letter ch; 

374 

512
55755ed9fab9
Pure/library/enclose, Pure/Syntax/pretty/enclose: renamed from parents
lcp
parents:
410
diff
changeset

375 
(*white space: blanks, tabs, newlines, formfeeds*) 
233  376 
val is_blank : string > bool = 
512
55755ed9fab9
Pure/library/enclose, Pure/Syntax/pretty/enclose: renamed from parents
lcp
parents:
410
diff
changeset

377 
fn " " => true  "\t" => true  "\n" => true  "\^L" => true  _ => false; 
233  378 

379 
val is_letdig = is_quasi_letter orf is_digit; 

380 

2196  381 
(*printable chars*) 
382 
fun is_printable c = ord c > ord " " andalso ord c <= ord "~"; 

383 

233  384 

385 
(*lower all chars of string*) 

386 
val to_lower = 

387 
let 

388 
fun lower ch = 

389 
if ch >= "A" andalso ch <= "Z" then 

390 
chr (ord ch  ord "A" + ord "a") 

391 
else ch; 

392 
in implode o (map lower) o explode end; 

393 

394 

512
55755ed9fab9
Pure/library/enclose, Pure/Syntax/pretty/enclose: renamed from parents
lcp
parents:
410
diff
changeset

395 
(*enclose in brackets*) 
55755ed9fab9
Pure/library/enclose, Pure/Syntax/pretty/enclose: renamed from parents
lcp
parents:
410
diff
changeset

396 
fun enclose lpar rpar str = lpar ^ str ^ rpar; 
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

397 

233  398 
(*simple quoting (does not escape special chars)*) 
512
55755ed9fab9
Pure/library/enclose, Pure/Syntax/pretty/enclose: renamed from parents
lcp
parents:
410
diff
changeset

399 
val quote = enclose "\"" "\""; 
233  400 

401 
(*space_implode "..." (explode "hello"); gives "h...e...l...l...o"*) 

402 
fun space_implode a bs = implode (separate a bs); 

403 

255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

404 
val commas = space_implode ", "; 
380  405 
val commas_quote = commas o map quote; 
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

406 

233  407 
(*concatenate messages, one per line, into a string*) 
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

408 
val cat_lines = space_implode "\n"; 
233  409 

1290  410 
(*space_explode "." "h.e..l.lo"; gives ["h", "e", "l", "lo"]*) 
411 
fun space_explode sep s = 

412 
let fun divide [] "" = [] 

413 
 divide [] part = [part] 

414 
 divide (c::s) part = 

415 
if c = sep then 

416 
(if part = "" then divide s "" else part :: divide s "") 

417 
else divide s (part ^ c) 

418 
in divide (explode s) "" end; 

233  419 

420 

421 
(** lists as sets **) 

422 

423 
(*membership in a list*) 

424 
fun x mem [] = false 

425 
 x mem (y :: ys) = x = y orelse x mem ys; 

0  426 

2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset

427 
(*membership in a list, optimized version for ints*) 
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

428 
fun (x:int) mem_int [] = false 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

429 
 x mem_int (y :: ys) = x = y orelse x mem_int ys; 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

430 

2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset

431 
(*membership in a list, optimized version for strings*) 
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

432 
fun (x:string) mem_string [] = false 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

433 
 x mem_string (y :: ys) = x = y orelse x mem_string ys; 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

434 

0  435 
(*generalized membership test*) 
233  436 
fun gen_mem eq (x, []) = false 
437 
 gen_mem eq (x, y :: ys) = eq (x, y) orelse gen_mem eq (x, ys); 

438 

439 

440 
(*insertion into list if not already there*) 

2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset

441 
fun (x ins xs) = if x mem xs then xs else x :: xs; 
0  442 

2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset

443 
(*insertion into list, optimized version for ints*) 
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset

444 
fun (x ins_int xs) = if x mem_int xs then xs else x :: xs; 
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

445 

2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset

446 
(*insertion into list, optimized version for strings*) 
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset

447 
fun (x ins_string xs) = if x mem_string xs then xs else x :: xs; 
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

448 

0  449 
(*generalized insertion*) 
233  450 
fun gen_ins eq (x, xs) = if gen_mem eq (x, xs) then xs else x :: xs; 
451 

452 

453 
(*union of sets represented as lists: no repetitions*) 

454 
fun xs union [] = xs 

455 
 [] union ys = ys 

456 
 (x :: xs) union ys = xs union (x ins ys); 

0  457 

2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset

458 
(*union of sets, optimized version for ints*) 
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

459 
fun (xs:int list) union_int [] = xs 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

460 
 [] union_int ys = ys 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

461 
 (x :: xs) union_int ys = xs union_int (x ins_int ys); 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

462 

2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset

463 
(*union of sets, optimized version for strings*) 
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

464 
fun (xs:string list) union_string [] = xs 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

465 
 [] union_string ys = ys 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

466 
 (x :: xs) union_string ys = xs union_string (x ins_string ys); 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

467 

0  468 
(*generalized union*) 
233  469 
fun gen_union eq (xs, []) = xs 
470 
 gen_union eq ([], ys) = ys 

471 
 gen_union eq (x :: xs, ys) = gen_union eq (xs, gen_ins eq (x, ys)); 

472 

473 

474 
(*intersection*) 

475 
fun [] inter ys = [] 

476 
 (x :: xs) inter ys = 

477 
if x mem ys then x :: (xs inter ys) else xs inter ys; 

478 

2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset

479 
(*intersection, optimized version for ints*) 
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

480 
fun ([]:int list) inter_int ys = [] 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

481 
 (x :: xs) inter_int ys = 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

482 
if x mem_int ys then x :: (xs inter_int ys) else xs inter_int ys; 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

483 

2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset

484 
(*intersection, optimized version for strings *) 
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

485 
fun ([]:string list) inter_string ys = [] 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

486 
 (x :: xs) inter_string ys = 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

487 
if x mem_string ys then x :: (xs inter_string ys) else xs inter_string ys; 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

488 

233  489 

490 
(*subset*) 

491 
fun [] subset ys = true 

492 
 (x :: xs) subset ys = x mem ys andalso xs subset ys; 

493 

2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset

494 
(*subset, optimized version for ints*) 
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

495 
fun ([]:int list) subset_int ys = true 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

496 
 (x :: xs) subset_int ys = x mem_int ys andalso xs subset_int ys; 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

497 

2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset

498 
(*subset, optimized version for strings*) 
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

499 
fun ([]:string list) subset_string ys = true 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

500 
 (x :: xs) subset_string ys = x mem_string ys andalso xs subset_string ys; 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

501 

2182
29e56f003599
Removal of polymorphic equality via mem, subset, eq_set, etc
paulson
parents:
2175
diff
changeset

502 
(*set equality for strings*) 
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

503 
fun eq_set_string ((xs:string list), ys) = 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

504 
xs = ys orelse (xs subset_string ys andalso ys subset_string xs); 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

505 

2182
29e56f003599
Removal of polymorphic equality via mem, subset, eq_set, etc
paulson
parents:
2175
diff
changeset

506 
fun gen_subset eq (xs, ys) = forall (fn x => gen_mem eq (x, ys)) xs; 
29e56f003599
Removal of polymorphic equality via mem, subset, eq_set, etc
paulson
parents:
2175
diff
changeset

507 

265  508 

233  509 
(*removing an element from a list WITHOUT duplicates*) 
510 
fun (y :: ys) \ x = if x = y then ys else y :: (ys \ x) 

511 
 [] \ x = []; 

512 

2243
3ebeaaacfbd1
Etaexpanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset

513 
fun ys \\ xs = foldl (op \) (ys,xs); 
0  514 

233  515 
(*removing an element from a list  possibly WITH duplicates*) 
516 
fun gen_rem eq (xs, y) = filter_out (fn x => eq (x, y)) xs; 

517 

2243
3ebeaaacfbd1
Etaexpanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset

518 
fun gen_rems eq = foldl (gen_rem eq); 
233  519 

520 

521 
(*makes a list of the distinct members of the input; preserves order, takes 

522 
first of equal elements*) 

523 
fun gen_distinct eq lst = 

524 
let 

525 
val memb = gen_mem eq; 

0  526 

233  527 
fun dist (rev_seen, []) = rev rev_seen 
528 
 dist (rev_seen, x :: xs) = 

529 
if memb (x, rev_seen) then dist (rev_seen, xs) 

530 
else dist (x :: rev_seen, xs); 

531 
in 

532 
dist ([], lst) 

533 
end; 

534 

2243
3ebeaaacfbd1
Etaexpanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset

535 
fun distinct l = gen_distinct (op =) l; 
233  536 

537 

538 
(*returns the tail beginning with the first repeated element, or []*) 

539 
fun findrep [] = [] 

540 
 findrep (x :: xs) = if x mem xs then x :: xs else findrep xs; 

541 

542 

255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

543 
(*returns a list containing all repeated elements exactly once; preserves 
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

544 
order, takes first of equal elements*) 
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

545 
fun gen_duplicates eq lst = 
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

546 
let 
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

547 
val memb = gen_mem eq; 
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

548 

ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

549 
fun dups (rev_dups, []) = rev rev_dups 
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

550 
 dups (rev_dups, x :: xs) = 
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

551 
if memb (x, rev_dups) orelse not (memb (x, xs)) then 
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

552 
dups (rev_dups, xs) 
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

553 
else dups (x :: rev_dups, xs); 
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

554 
in 
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

555 
dups ([], lst) 
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

556 
end; 
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

557 

2243
3ebeaaacfbd1
Etaexpanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset

558 
fun duplicates l = gen_duplicates (op =) l; 
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

559 

ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

560 

233  561 

562 
(** association lists **) 

0  563 

233  564 
(*association list lookup*) 
565 
fun assoc ([], key) = None 

566 
 assoc ((keyi, xi) :: pairs, key) = 

567 
if key = keyi then Some xi else assoc (pairs, key); 

568 

2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset

569 
(*association list lookup, optimized version for ints*) 
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

570 
fun assoc_int ([], (key:int)) = None 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

571 
 assoc_int ((keyi, xi) :: pairs, key) = 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

572 
if key = keyi then Some xi else assoc_int (pairs, key); 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

573 

2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset

574 
(*association list lookup, optimized version for strings*) 
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

575 
fun assoc_string ([], (key:string)) = None 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

576 
 assoc_string ((keyi, xi) :: pairs, key) = 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

577 
if key = keyi then Some xi else assoc_string (pairs, key); 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

578 

2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset

579 
(*association list lookup, optimized version for string*ints*) 
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

580 
fun assoc_string_int ([], (key:string*int)) = None 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

581 
 assoc_string_int ((keyi, xi) :: pairs, key) = 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

582 
if key = keyi then Some xi else assoc_string_int (pairs, key); 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

583 

233  584 
fun assocs ps x = 
585 
(case assoc (ps, x) of 

586 
None => [] 

587 
 Some ys => ys); 

588 

255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

589 
(*twofold association list lookup*) 
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

590 
fun assoc2 (aal, (key1, key2)) = 
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

591 
(case assoc (aal, key1) of 
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

592 
Some al => assoc (al, key2) 
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

593 
 None => None); 
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

594 

233  595 
(*generalized association list lookup*) 
596 
fun gen_assoc eq ([], key) = None 

597 
 gen_assoc eq ((keyi, xi) :: pairs, key) = 

598 
if eq (key, keyi) then Some xi else gen_assoc eq (pairs, key); 

599 

600 
(*association list update*) 

601 
fun overwrite (al, p as (key, _)) = 

602 
let fun over ((q as (keyi, _)) :: pairs) = 

603 
if keyi = key then p :: pairs else q :: (over pairs) 

604 
 over [] = [p] 

605 
in over al end; 

606 

607 

608 

609 
(** generic tables **) 

0  610 

233  611 
(*Tables are supposed to be 'efficient' encodings of lists of elements distinct 
612 
wrt. an equality "eq". The extend and merge operations below are optimized 

613 
for longterm space efficiency.*) 

614 

615 
(*append (new) elements to a table*) 

616 
fun generic_extend _ _ _ tab [] = tab 

617 
 generic_extend eq dest_tab mk_tab tab1 lst2 = 

618 
let 

619 
val lst1 = dest_tab tab1; 

620 
val new_lst2 = gen_rems eq (lst2, lst1); 

621 
in 

622 
if null new_lst2 then tab1 

623 
else mk_tab (lst1 @ new_lst2) 

624 
end; 

0  625 

233  626 
(*append (new) elements of 2nd table to 1st table*) 
627 
fun generic_merge eq dest_tab mk_tab tab1 tab2 = 

628 
let 

629 
val lst1 = dest_tab tab1; 

630 
val lst2 = dest_tab tab2; 

631 
val new_lst2 = gen_rems eq (lst2, lst1); 

632 
in 

633 
if null new_lst2 then tab1 

634 
else if gen_subset eq (lst1, lst2) then tab2 

635 
else mk_tab (lst1 @ new_lst2) 

636 
end; 

0  637 

233  638 

639 
(*lists as tables*) 

2243
3ebeaaacfbd1
Etaexpanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset

640 
fun extend_list tab = generic_extend (op =) I I tab; 
3ebeaaacfbd1
Etaexpanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset

641 
fun merge_lists tab = generic_merge (op =) I I tab; 
233  642 

380  643 
fun merge_rev_lists xs [] = xs 
644 
 merge_rev_lists [] ys = ys 

645 
 merge_rev_lists xs (y :: ys) = 

646 
(if y mem xs then I else cons y) (merge_rev_lists xs ys); 

647 

0  648 

649 

233  650 
(** balanced trees **) 
651 

652 
exception Balance; (*indicates nonpositive argument to balancing fun*) 

653 

654 
(*balanced folding; avoids deep nesting*) 

655 
fun fold_bal f [x] = x 

656 
 fold_bal f [] = raise Balance 

657 
 fold_bal f xs = 

658 
let val k = length xs div 2 

659 
in f (fold_bal f (take(k, xs)), 

660 
fold_bal f (drop(k, xs))) 

661 
end; 

662 

663 
(*construct something of the form f(...g(...(x)...)) for balanced access*) 

664 
fun access_bal (f, g, x) n i = 

665 
let fun acc n i = (*1<=i<=n*) 

666 
if n=1 then x else 

667 
let val n2 = n div 2 

668 
in if i<=n2 then f (acc n2 i) 

669 
else g (acc (nn2) (in2)) 

670 
end 

671 
in if 1<=i andalso i<=n then acc n i else raise Balance end; 

672 

673 
(*construct ALL such accesses; could try harder to share recursive calls!*) 

674 
fun accesses_bal (f, g, x) n = 

675 
let fun acc n = 

676 
if n=1 then [x] else 

677 
let val n2 = n div 2 

678 
val acc2 = acc n2 

679 
in if nn2=n2 then map f acc2 @ map g acc2 

680 
else map f acc2 @ map g (acc (nn2)) end 

681 
in if 1<=n then acc n else raise Balance end; 

682 

683 

684 

685 
(** input / output **) 

686 

2243
3ebeaaacfbd1
Etaexpanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset

687 
val cd = OS.FileSys.chDir; 
3ebeaaacfbd1
Etaexpanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset

688 

3ebeaaacfbd1
Etaexpanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset

689 
val prs_fn = ref(fn s => TextIO.output (TextIO.stdOut, s)); 
1580
e3fd931e6095
Added some functions which allow redirection of Isabelle's output
berghofe
parents:
1576
diff
changeset

690 

e3fd931e6095
Added some functions which allow redirection of Isabelle's output
berghofe
parents:
1576
diff
changeset

691 
fun prs s = !prs_fn s; 
233  692 
fun writeln s = prs (s ^ "\n"); 
693 

2243
3ebeaaacfbd1
Etaexpanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset

694 
(* TextIO.output to LaTeX / xdvi *) 
1628
60136fdd80c4
Added functions pr_latex and printgoal_latex which
berghofe
parents:
1592
diff
changeset

695 
fun latex s = 
2243
3ebeaaacfbd1
Etaexpanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset

696 
execute ( "( cd /tmp ; echo \"" ^ s ^ 
3ebeaaacfbd1
Etaexpanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset

697 
"\"  isa2latex s > $$.tex ; latex $$.tex ; xdvi $$.dvi ; rm $$.* ) > /dev/null &" ) ; 
1628
60136fdd80c4
Added functions pr_latex and printgoal_latex which
berghofe
parents:
1592
diff
changeset

698 

1580
e3fd931e6095
Added some functions which allow redirection of Isabelle's output
berghofe
parents:
1576
diff
changeset

699 
(*print warning*) 
2243
3ebeaaacfbd1
Etaexpanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset

700 
val warning_fn = ref(fn s => TextIO.output (TextIO.stdOut, s ^ "\n")); 
1580
e3fd931e6095
Added some functions which allow redirection of Isabelle's output
berghofe
parents:
1576
diff
changeset

701 
fun warning s = !warning_fn ("Warning: " ^ s); 
233  702 

703 
(*print error message and abort to top level*) 

1580
e3fd931e6095
Added some functions which allow redirection of Isabelle's output
berghofe
parents:
1576
diff
changeset

704 

2243
3ebeaaacfbd1
Etaexpanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset

705 
val error_fn = ref(fn s => TextIO.output (TextIO.stdOut, s ^ "\n")); 
1580
e3fd931e6095
Added some functions which allow redirection of Isabelle's output
berghofe
parents:
1576
diff
changeset

706 

233  707 
exception ERROR; 
1580
e3fd931e6095
Added some functions which allow redirection of Isabelle's output
berghofe
parents:
1576
diff
changeset

708 
fun error msg = (!error_fn msg; raise ERROR); 
e3fd931e6095
Added some functions which allow redirection of Isabelle's output
berghofe
parents:
1576
diff
changeset

709 
fun sys_error msg = (!error_fn "*** SYSTEM ERROR ***"; error msg); 
233  710 

711 
fun assert p msg = if p then () else error msg; 

712 
fun deny p msg = if p then error msg else (); 

713 

544
c53386a5bcf1
Pure/library/assert_all: new, moved from ZF/ind_syntax.ML
lcp
parents:
512
diff
changeset

714 
(*Assert pred for every member of l, generating a message if pred fails*) 
c53386a5bcf1
Pure/library/assert_all: new, moved from ZF/ind_syntax.ML
lcp
parents:
512
diff
changeset

715 
fun assert_all pred l msg_fn = 
c53386a5bcf1
Pure/library/assert_all: new, moved from ZF/ind_syntax.ML
lcp
parents:
512
diff
changeset

716 
let fun asl [] = () 
2243
3ebeaaacfbd1
Etaexpanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset

717 
 asl (x::xs) = if pred x then asl xs 
3ebeaaacfbd1
Etaexpanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset

718 
else error (msg_fn x) 
544
c53386a5bcf1
Pure/library/assert_all: new, moved from ZF/ind_syntax.ML
lcp
parents:
512
diff
changeset

719 
in asl l end; 
233  720 

721 
(*for the "test" target in Makefiles  signifies successful termination*) 

722 
fun maketest msg = 

1592  723 
(writeln msg; 
2243
3ebeaaacfbd1
Etaexpanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset

724 
let val os = TextIO.openOut "test" 
3ebeaaacfbd1
Etaexpanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset

725 
in TextIO.output (os, "Test examples ran successfully\n"); 
3ebeaaacfbd1
Etaexpanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset

726 
TextIO.closeOut os 
1592  727 
end); 
233  728 

729 

730 
(*print a list surrounded by the brackets lpar and rpar, with comma separator 

731 
print nothing for empty list*) 

732 
fun print_list (lpar, rpar, pre: 'a > unit) (l : 'a list) = 

733 
let fun prec x = (prs ","; pre x) 

734 
in 

735 
(case l of 

736 
[] => () 

737 
 x::l => (prs lpar; pre x; seq prec l; prs rpar)) 

738 
end; 

739 

740 
(*print a list of items separated by newlines*) 

741 
fun print_list_ln (pre: 'a > unit) : 'a list > unit = 

742 
seq (fn x => (pre x; writeln "")); 

743 

744 

745 
val print_int = prs o string_of_int; 

746 

747 

748 

749 
(** timing **) 

750 

751 
(*unconditional timing function*) 

2243
3ebeaaacfbd1
Etaexpanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset

752 
fun timeit x = cond_timeit true x; 
233  753 

754 
(*timed application function*) 

755 
fun timeap f x = timeit (fn () => f x); 

756 

757 
(*timed "use" function, printing filenames*) 

758 
fun time_use fname = timeit (fn () => 

759 
(writeln ("\n**** Starting " ^ fname ^ " ****"); use fname; 

760 
writeln ("\n**** Finished " ^ fname ^ " ****"))); 

761 

955
aa0c5f9daf5b
Declares the function exit_use to behave like use but fail if
lcp
parents:
544
diff
changeset

762 
(*For Makefiles: use the file, but exit with error code if errors found.*) 
aa0c5f9daf5b
Declares the function exit_use to behave like use but fail if
lcp
parents:
544
diff
changeset

763 
fun exit_use fname = use fname handle _ => exit 1; 
233  764 

765 

1407  766 
(** filenames and paths **) 
233  767 

1290  768 
(*Convert UNIX filename of the form "path/file" to "path/" and "file"; 
233  769 
if filename contains no slash, then it returns "" and "file"*) 
770 
val split_filename = 

771 
(pairself implode) o take_suffix (not_equal "/") o explode; 

772 

773 
val base_name = #2 o split_filename; 

774 

1290  775 
(*Merge splitted filename (path and file); 
233  776 
if path does not end with one a slash is appended*) 
777 
fun tack_on "" name = name 

778 
 tack_on path name = 

779 
if last_elem (explode path) = "/" then path ^ name 

780 
else path ^ "/" ^ name; 

781 

1290  782 
(*Remove the extension of a filename, i.e. the part after the last '.'*) 
233  783 
val remove_ext = implode o #1 o take_suffix (not_equal ".") o explode; 
784 

1290  785 
(*Make relative path to reach an absolute location from a different one*) 
786 
fun relative_path cur_path dest_path = 

787 
let (*Remove common beginning of both paths and make relative path*) 

788 
fun mk_relative [] [] = [] 

789 
 mk_relative [] ds = ds 

790 
 mk_relative cs [] = map (fn _ => "..") cs 

791 
 mk_relative (c::cs) (d::ds) = 

792 
if c = d then mk_relative cs ds 

793 
else ".." :: map (fn _ => "..") cs @ (d::ds); 

794 
in if cur_path = "" orelse hd (explode cur_path) <> "/" orelse 

795 
dest_path = "" orelse hd (explode dest_path) <> "/" then 

796 
error "Relative or empty path passed to relative_path" 

797 
else (); 

798 
space_implode "/" (mk_relative (space_explode "/" cur_path) 

799 
(space_explode "/" dest_path)) 

800 
end; 

233  801 

1407  802 
(*Determine if absolute path1 is a subdirectory of absolute path2*) 
803 
fun path1 subdir_of path2 = 

804 
if hd (explode path1) <> "/" orelse hd (explode path2) <> "/" then 

805 
error "Relative or empty path passed to subdir_of" 

806 
else (space_explode "/" path2) prefix (space_explode "/" path1); 

807 

1456  808 
fun absolute_path cwd file = 
809 
let fun rm_points [] result = rev result 

810 
 rm_points (".."::ds) result = rm_points ds (tl result) 

811 
 rm_points ("."::ds) result = rm_points ds result 

812 
 rm_points (d::ds) result = rm_points ds (d::result); 

813 
in if file = "" then "" 

814 
else if hd (explode file) = "/" then file 

815 
else "/" ^ space_implode "/" 

816 
(rm_points (space_explode "/" (tack_on cwd file)) []) 

817 
end; 

818 

233  819 

820 
(** misc functions **) 

821 

822 
(*use the keyfun to make a list of (x, key) pairs*) 

0  823 
fun make_keylist (keyfun: 'a>'b) : 'a list > ('a * 'b) list = 
233  824 
let fun keypair x = (x, keyfun x) 
825 
in map keypair end; 

0  826 

233  827 
(*given a list of (x, key) pairs and a searchkey 
0  828 
return the list of xs from each pair whose key equals searchkey*) 
829 
fun keyfilter [] searchkey = [] 

233  830 
 keyfilter ((x, key) :: pairs) searchkey = 
831 
if key = searchkey then x :: keyfilter pairs searchkey 

832 
else keyfilter pairs searchkey; 

0  833 

834 

835 
(*Partition list into elements that satisfy predicate and those that don't. 

233  836 
Preserves order of elements in both lists.*) 
0  837 
fun partition (pred: 'a>bool) (ys: 'a list) : ('a list * 'a list) = 
838 
let fun part ([], answer) = answer 

233  839 
 part (x::xs, (ys, ns)) = if pred(x) 
840 
then part (xs, (x::ys, ns)) 

841 
else part (xs, (ys, x::ns)) 

842 
in part (rev ys, ([], [])) end; 

0  843 

844 

845 
fun partition_eq (eq:'a * 'a > bool) = 

846 
let fun part [] = [] 

233  847 
 part (x::ys) = let val (xs, xs') = partition (apl(x, eq)) ys 
848 
in (x::xs)::(part xs') end 

0  849 
in part end; 
850 

851 

233  852 
(*Partition a list into buckets [ bi, b(i+1), ..., bj ] 
0  853 
putting x in bk if p(k)(x) holds. Preserve order of elements if possible.*) 
854 
fun partition_list p i j = 

233  855 
let fun part k xs = 
856 
if k>j then 

0  857 
(case xs of [] => [] 
858 
 _ => raise LIST "partition_list") 

859 
else 

233  860 
let val (ns, rest) = partition (p k) xs; 
861 
in ns :: part(k+1)rest end 

0  862 
in part i end; 
863 

864 

233  865 
(* sorting *) 
866 

867 
(*insertion sort; stable (does not reorder equal elements) 

868 
'less' is lessthan test on type 'a*) 

869 
fun sort (less: 'a*'a > bool) = 

0  870 
let fun insert (x, []) = [x] 
233  871 
 insert (x, y::ys) = 
872 
if less(y, x) then y :: insert (x, ys) else x::y::ys; 

0  873 
fun sort1 [] = [] 
874 
 sort1 (x::xs) = insert (x, sort1 xs) 

875 
in sort1 end; 

876 

41
97aae241094b
added cons, rcons, last_elem, sort_strings, take_suffix;
wenzelm
parents:
24
diff
changeset

877 
(*sort strings*) 
97aae241094b
added cons, rcons, last_elem, sort_strings, take_suffix;
wenzelm
parents:
24
diff
changeset

878 
val sort_strings = sort (op <= : string * string > bool); 
97aae241094b
added cons, rcons, last_elem, sort_strings, take_suffix;
wenzelm
parents:
24
diff
changeset

879 

97aae241094b
added cons, rcons, last_elem, sort_strings, take_suffix;
wenzelm
parents:
24
diff
changeset

880 

233  881 
(* transitive closure (not Warshall's algorithm) *) 
0  882 

233  883 
fun transitive_closure [] = [] 
884 
 transitive_closure ((x, ys)::ps) = 

885 
let val qs = transitive_closure ps 

2182
29e56f003599
Removal of polymorphic equality via mem, subset, eq_set, etc
paulson
parents:
2175
diff
changeset

886 
val zs = foldl (fn (zs, y) => assocs qs y union_string zs) (ys, ys) 
29e56f003599
Removal of polymorphic equality via mem, subset, eq_set, etc
paulson
parents:
2175
diff
changeset

887 
fun step(u, us) = (u, if x mem_string us then zs union_string us 
2243
3ebeaaacfbd1
Etaexpanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset

888 
else us) 
233  889 
in (x, zs) :: map step qs end; 
0  890 

891 

2303
84ed9e0d7c50
Random number generated "downgraded" to generate numbers below 2^29  1,
paulson
parents:
2271
diff
changeset

892 
(** Simple random number generator; not guaranteed to be good, because modulus 
84ed9e0d7c50
Random number generated "downgraded" to generate numbers below 2^29  1,
paulson
parents:
2271
diff
changeset

893 
has been reduced from 2^311 to 2^291 to prevent integer overflows 
84ed9e0d7c50
Random number generated "downgraded" to generate numbers below 2^29  1,
paulson
parents:
2271
diff
changeset

894 
**) 
84ed9e0d7c50
Random number generated "downgraded" to generate numbers below 2^29  1,
paulson
parents:
2271
diff
changeset

895 
local val a = 16807.0 and m = 536870911.0 (* 2^29  1 *) 
2003  896 
in fun nextrandom seed = 
897 
let val t = a*seed 

898 
in t  m * real(floor(t/m)) end 

899 
end; 

900 

233  901 
(* generating identifiers *) 
0  902 

903 
local 

233  904 
val a = ord "a" and z = ord "z" and A = ord "A" and Z = ord "Z" 
905 
and k0 = ord "0" and k9 = ord "9" 

2003  906 

907 
val seedr = ref 10000.0; 

0  908 
in 
909 

2003  910 
(*Maps 063 to AZ, az, 09 or _ or ' for generating random identifiers*) 
911 
fun newid n = 

912 
let fun char i = 

913 
if i<26 then chr (A+i) 

914 
else if i<52 then chr (a+i26) 

915 
else if i<62 then chr (k0+i52) 

916 
else if i=62 then "_" 

917 
else (*i=63*) "'" 

918 
in implode (map char (radixpand (64,n))) end; 

919 

2303
84ed9e0d7c50
Random number generated "downgraded" to generate numbers below 2^29  1,
paulson
parents:
2271
diff
changeset

920 
(*Randomly generated identifiers with given prefix; MUST start with a letter*) 
2003  921 
fun gensym pre = pre ^ 
2303
84ed9e0d7c50
Random number generated "downgraded" to generate numbers below 2^29  1,
paulson
parents:
2271
diff
changeset

922 
(#1(newid (floor (!seedr)), 
2243
3ebeaaacfbd1
Etaexpanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset

923 
seedr := nextrandom (!seedr))) 
2003  924 

0  925 
(*Increment a list of letters like a reversed base 26 number. 
233  926 
If head is "z", bumps chars in tail. 
0  927 
Digits are incremented as if they were integers. 
928 
"_" and "'" are not changed. 

233  929 
For making variants of identifiers.*) 
0  930 

931 
fun bump_int_list(c::cs) = if c="9" then "0" :: bump_int_list cs else 

233  932 
if k0 <= ord(c) andalso ord(c) < k9 then chr(ord(c)+1) :: cs 
933 
else "1" :: c :: cs 

0  934 
 bump_int_list([]) = error("bump_int_list: not an identifier"); 
935 

233  936 
fun bump_list([], d) = [d] 
937 
 bump_list(["'"], d) = [d, "'"] 

938 
 bump_list("z"::cs, _) = "a" :: bump_list(cs, "a") 

939 
 bump_list("Z"::cs, _) = "A" :: bump_list(cs, "A") 

940 
 bump_list("9"::cs, _) = "0" :: bump_int_list cs 

941 
 bump_list(c::cs, _) = let val k = ord(c) 

942 
in if (a <= k andalso k < z) orelse (A <= k andalso k < Z) orelse 

943 
(k0 <= k andalso k < k9) then chr(k+1) :: cs else 

944 
if c="'" orelse c="_" then c :: bump_list(cs, "") else 

945 
error("bump_list: not legal in identifier: " ^ 

946 
implode(rev(c::cs))) 

947 
end; 

0  948 

949 
end; 

950 

233  951 
fun bump_string s : string = implode (rev (bump_list(rev(explode s), ""))); 
41
97aae241094b
added cons, rcons, last_elem, sort_strings, take_suffix;
wenzelm
parents:
24
diff
changeset

952 

97aae241094b
added cons, rcons, last_elem, sort_strings, take_suffix;
wenzelm
parents:
24
diff
changeset

953 

233  954 
(* lexical scanning *) 
0  955 

233  956 
(*scan a list of characters into "words" composed of "letters" (recognized by 
957 
is_let) and separated by any number of non"letters"*) 

958 
fun scanwords is_let cs = 

0  959 
let fun scan1 [] = [] 
233  960 
 scan1 cs = 
961 
let val (lets, rest) = take_prefix is_let cs 

962 
in implode lets :: scanwords is_let rest end; 

963 
in scan1 (#2 (take_prefix (not o is_let) cs)) end; 

24
f3d4ff75d9f2
added functions that operate on filenames: split_filename (originally located
clasohm
parents:
0
diff
changeset

964 

1364
8ea1a962ad72
files now define a structure to allow SML/NJ to optimize the code
clasohm
parents:
1290
diff
changeset

965 
end; 
8ea1a962ad72
files now define a structure to allow SML/NJ to optimize the code
clasohm
parents:
1290
diff
changeset

966 

1592  967 
(*Variablebranching trees: for proof terms*) 
968 
datatype 'a mtree = Join of 'a * 'a mtree list; 

969 

1364
8ea1a962ad72
files now define a structure to allow SML/NJ to optimize the code
clasohm
parents:
1290
diff
changeset

970 
open Library; 