src/Pure/library.ML
author wenzelm
Thu, 03 Feb 1994 13:55:42 +0100
changeset 254 b1fcd27fcac4
parent 245 faf3de36fdb1
child 255 ee132db91681
permissions -rw-r--r--
replaced pprint_sg by Sign.pprint_sg; added Syntax.simple_pprint_typ;
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
41
97aae241094b added cons, rcons, last_elem, sort_strings, take_suffix;
wenzelm
parents: 24
diff changeset
     1
(*  Title:      Pure/library.ML
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     2
    ID:         $Id$
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     4
    Copyright   1992  University of Cambridge
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     5
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
     6
Basic library: functions, options, pairs, booleans, lists, integers,
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
     7
strings, lists as sets, association lists, generic tables, balanced trees,
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
     8
input / output, timing, filenames, misc functions.
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     9
*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    10
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    11
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    12
(** functions **)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    13
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    14
(*handy combinators*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    15
fun curry f x y = f (x, y);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    16
fun uncurry f (x, y) = f x y;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    17
fun I x = x;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    18
fun K x y = x;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    19
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    20
(*combine two functions forming the union of their domains*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    21
infix orelf;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    22
fun f orelf g = fn x => f x handle Match => g x;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    23
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    24
(*application of (infix) operator to its left or right argument*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    25
fun apl (x, f) y = f (x, y);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    26
fun apr (f, y) x = f (x, y);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    27
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    28
(*functional for pairs*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    29
fun pairself f (x, y) = (f x, f y);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    30
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    31
(*function exponentiation: f(...(f x)...) with n applications of f*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    32
fun funpow n f x =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    33
  let fun rep (0, x) = x
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    34
        | rep (n, x) = rep (n - 1, f x)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    35
  in rep (n, x) end;
160
80ccb6c354ba added equal, not_equal: ''a -> ''a -> bool
wenzelm
parents: 41
diff changeset
    36
80ccb6c354ba added equal, not_equal: ''a -> ''a -> bool
wenzelm
parents: 41
diff changeset
    37
80ccb6c354ba added equal, not_equal: ''a -> ''a -> bool
wenzelm
parents: 41
diff changeset
    38
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    39
(** options **)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    40
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    41
datatype 'a option = None | Some of 'a;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    42
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    43
exception OPTION of string;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    44
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    45
fun the (Some x) = x
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    46
  | the None = raise OPTION "the";
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    47
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    48
fun is_some (Some _) = true
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    49
  | is_some None = false;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    50
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    51
fun is_none (Some _) = false
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    52
  | is_none None = true;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    53
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    54
fun apsome f (Some x) = Some (f x)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    55
  | apsome _ None = None;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    56
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    57
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    58
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    59
(** pairs **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    60
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    61
fun pair x y = (x, y);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    62
fun rpair x y = (y, x);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    63
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    64
fun fst (x, y) = x;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    65
fun snd (x, y) = y;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    66
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    67
fun eq_fst ((x1, _), (x2, _)) = x1 = x2;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    68
fun eq_snd ((_, y1), (_, y2)) = y1 = y2;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    69
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    70
fun swap (x, y) = (y, x);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    71
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    72
(*apply the function to a component of a pair*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    73
fun apfst f (x, y) = (f x, y);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    74
fun apsnd f (x, y) = (x, f y);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    75
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    76
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    77
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    78
(** booleans **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    79
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    80
(* equality *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    81
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    82
fun equal x y = x = y;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    83
fun not_equal x y = x <> y;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    84
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    85
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    86
(* operators for combining predicates *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    87
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    88
infix orf;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    89
fun p orf q = fn x => p x orelse q x;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    90
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    91
infix andf;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    92
fun p andf q = fn x => p x andalso q x;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    93
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    94
fun notf p x = not (p x);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    95
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    96
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    97
(* predicates on lists *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    98
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    99
fun orl [] = false
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   100
  | orl (x :: xs) = x orelse orl xs;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   101
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   102
fun andl [] = true
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   103
  | andl (x :: xs) = x andalso andl xs;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   104
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   105
(*exists pred [x1, ..., xn] ===> pred x1 orelse ... orelse pred xn*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   106
fun exists (pred: 'a -> bool) : 'a list -> bool =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   107
  let fun boolf [] = false
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   108
        | boolf (x :: xs) = pred x orelse boolf xs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   109
  in boolf end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   110
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   111
(*forall pred [x1, ..., xn] ===> pred x1 andalso ... andalso pred xn*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   112
fun forall (pred: 'a -> bool) : 'a list -> bool =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   113
  let fun boolf [] = true
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   114
        | boolf (x :: xs) = pred x andalso boolf xs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   115
  in boolf end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   116
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   117
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   118
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   119
(** lists **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   120
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   121
exception LIST of string;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   122
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   123
fun null [] = true
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   124
  | null (_ :: _) = false;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   125
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   126
fun hd [] = raise LIST "hd"
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   127
  | hd (x :: _) = x;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   128
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   129
fun tl [] = raise LIST "tl"
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   130
  | tl (_ :: xs) = xs;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   131
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   132
fun cons x xs = x :: xs;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   133
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   134
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   135
(* fold *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   136
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   137
(*the following versions of fold are designed to fit nicely with infixes*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   138
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   139
(*  (op @) (e, [x1, ..., xn])  ===>  ((e @ x1) @ x2) ... @ xn
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   140
    for operators that associate to the left (TAIL RECURSIVE)*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   141
fun foldl (f: 'a * 'b -> 'a) : 'a * 'b list -> 'a =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   142
  let fun itl (e, [])  = e
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   143
        | itl (e, a::l) = itl (f(e, a), l)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   144
  in  itl end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   145
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   146
(*  (op @) ([x1, ..., xn], e)  ===>   x1 @ (x2 ... @ (xn @ e))
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   147
    for operators that associate to the right (not tail recursive)*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   148
fun foldr f (l, e) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   149
  let fun itr [] = e
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   150
        | itr (a::l) = f(a, itr l)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   151
  in  itr l  end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   152
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   153
(*  (op @) [x1, ..., xn]  ===>   x1 @ (x2 ... @ (x[n-1] @ xn))
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   154
    for n > 0, operators that associate to the right (not tail recursive)*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   155
fun foldr1 f l =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   156
  let fun itr [x] = x                       (* FIXME [] case: elim warn (?) *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   157
        | itr (x::l) = f(x, itr l)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   158
  in  itr l  end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   159
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   160
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   161
(* basic list functions *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   162
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   163
(*length of a list, should unquestionably be a standard function*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   164
local fun length1 (n, [])  = n   (*TAIL RECURSIVE*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   165
        | length1 (n, x :: xs) = length1 (n + 1, xs)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   166
in  fun length l = length1 (0, l) end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   167
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   168
(*take the first n elements from a list*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   169
fun take (n, []) = []
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   170
  | take (n, x :: xs) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   171
      if n > 0 then x :: take (n - 1, xs) else [];
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   172
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   173
(*drop the first n elements from a list*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   174
fun drop (n, []) = []
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   175
  | drop (n, x :: xs) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   176
      if n > 0 then drop (n - 1, xs) else x :: xs;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   177
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   178
(*return nth element of a list, where 0 designates the first element;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   179
  raise EXCEPTION if list too short*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   180
fun nth_elem NL =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   181
  (case drop NL of
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   182
    [] => raise LIST "nth_elem"
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   183
  | x :: _ => x);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   184
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   185
(*last element of a list*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   186
fun last_elem [] = raise LIST "last_elem"
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   187
  | last_elem [x] = x
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   188
  | last_elem (_ :: xs) = last_elem xs;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   189
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   190
(*find the position of an element in a list*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   191
fun find (x, ys) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   192
  let fun f (y :: ys, i) = if x = y then i else f (ys, i + 1)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   193
        | f (_, _) = raise LIST "find"
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   194
  in f (ys, 0) end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   195
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   196
(*flatten a list of lists to a list*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   197
fun flat (ls: 'c list list) : 'c list = foldr (op @) (ls, []);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   198
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   199
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   200
(*like Lisp's MAPC -- seq proc [x1, ..., xn] evaluates
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   201
  (proc x1; ...; proc xn) for side effects*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   202
fun seq (proc: 'a -> unit) : 'a list -> unit =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   203
  let fun seqf [] = ()
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   204
        | seqf (x :: xs) = (proc x; seqf xs)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   205
  in seqf end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   206
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   207
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   208
(*separate s [x1, x2, ..., xn]  ===>  [x1, s, x2, s, ..., s, xn]*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   209
fun separate s (x :: (xs as _ :: _)) = x :: s :: separate s xs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   210
  | separate _ xs = xs;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   211
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   212
(*make the list [x, x, ..., x] of length n*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   213
fun replicate n (x: 'a) : 'a list =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   214
  let fun rep (0, xs) = xs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   215
        | rep (n, xs) = rep (n - 1, x :: xs)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   216
  in
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   217
    if n < 0 then raise LIST "replicate"
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   218
    else rep (n, [])
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   219
  end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   220
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   221
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   222
(* filter *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   223
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   224
(*copy the list preserving elements that satisfy the predicate*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   225
fun filter (pred: 'a->bool) : 'a list -> 'a list =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   226
  let fun filt [] = []
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   227
        | filt (x :: xs) = if pred x then x :: filt xs else filt xs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   228
  in filt end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   229
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   230
fun filter_out f = filter (not o f);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   231
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   232
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   233
fun mapfilter (f: 'a -> 'b option) ([]: 'a list) = [] : 'b list
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   234
  | mapfilter f (x :: xs) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   235
      (case f x of
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   236
        None => mapfilter f xs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   237
      | Some y => y :: mapfilter f xs);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   238
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   239
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   240
(* lists of pairs *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   241
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   242
(*combine two lists forming a list of pairs:
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   243
  [x1, ..., xn] ~~ [y1, ..., yn]  ===>  [(x1, y1), ..., (xn, yn)]*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   244
infix ~~;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   245
fun [] ~~ [] = []
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   246
  | (x :: xs) ~~ (y :: ys) = (x, y) :: (xs ~~ ys)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   247
  | _ ~~ _ = raise LIST "~~";
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   248
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   249
(*combine two lists*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   250
fun map2 _ ([], []) = []
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   251
  | map2 f (x :: xs, y :: ys) = (f (x, y) :: map2 f (xs, ys))
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   252
  | map2 _ _ = raise LIST "map2";
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   253
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   254
(*inverse of ~~; the old 'split':
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   255
  [(x1, y1), ..., (xn, yn)]  ===>  ([x1, ..., xn], [y1, ..., yn])*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   256
fun split_list (l: ('a * 'b) list) = (map #1 l, map #2 l);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   257
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   258
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   259
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   260
(* prefixes, suffixes *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   261
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   262
infix prefix;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   263
fun [] prefix _ = true
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   264
  | (x :: xs) prefix (y :: ys) = x = y andalso (xs prefix ys)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   265
  | _ prefix _ = false;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   266
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   267
(* [x1, ..., xi, ..., xn]  --->  ([x1, ..., x(i-1)], [xi, ..., xn])
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   268
   where xi is the first element that does not satisfy the predicate*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   269
fun take_prefix (pred : 'a -> bool)  (xs: 'a list) : 'a list * 'a list =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   270
  let fun take (rxs, []) = (rev rxs, [])
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   271
        | take (rxs, x::xs) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   272
            if  pred x  then  take(x::rxs, xs)  else  (rev rxs, x::xs)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   273
  in  take([], xs)  end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   274
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   275
(* [x1, ..., xi, ..., xn]  --->  ([x1, ..., xi], [x(i+1), ..., xn])
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   276
   where xi is the last element that does not satisfy the predicate*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   277
fun take_suffix _ [] = ([], [])
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   278
  | take_suffix pred (x :: xs) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   279
      (case take_suffix pred xs of
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   280
        ([], sffx) => if pred x then ([], x :: sffx) else ([x], sffx)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   281
      | (prfx, sffx) => (x :: prfx, sffx));
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   282
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   283
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   284
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   285
(** integers **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   286
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   287
fun inc i = i := ! i + 1;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   288
fun dec i = i := ! i - 1;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   289
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   290
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   291
(* lists of integers *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   292
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   293
(*make the list [from, from + 1, ..., to]*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   294
infix upto;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   295
fun from upto to =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   296
  if from > to then [] else from :: ((from + 1) upto to);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   297
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   298
(*make the list [from, from - 1, ..., to]*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   299
infix downto;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   300
fun from downto to =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   301
  if from < to then [] else from :: ((from - 1) downto to);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   302
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   303
(*predicate: downto0 (is, n) <=> is = [n, n - 1, ..., 0]*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   304
fun downto0 (i :: is, n) = i = n andalso downto0 (is, n - 1)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   305
  | downto0 ([], n) = n = ~1;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   306
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   307
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   308
(* operations on integer lists *)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   309
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   310
fun sum [] = 0
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   311
  | sum (n :: ns) = n + sum ns;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   312
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   313
fun max [m:int] = m
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   314
  | max (m :: n :: ns) = if m > n then max (m :: ns) else max (n :: ns)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   315
  | max [] = raise LIST "max";
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   316
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   317
fun min [m:int] = m
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   318
  | min (m :: n :: ns) = if m < n then min (m :: ns) else min (n :: ns)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   319
  | min [] = raise LIST "min";
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   320
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   321
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   322
(* convert integers to strings *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   323
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   324
(*expand the number in the given base;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   325
  example: radixpand (2, 8) gives [1, 0, 0, 0]*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   326
fun radixpand (base, num) : int list =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   327
  let
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   328
    fun radix (n, tail) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   329
      if n < base then n :: tail
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   330
      else radix (n div base, (n mod base) :: tail)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   331
  in radix (num, []) end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   332
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   333
(*expands a number into a string of characters starting from "zerochar";
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   334
  example: radixstring (2, "0", 8) gives "1000"*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   335
fun radixstring (base, zerochar, num) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   336
  let val offset = ord zerochar;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   337
      fun chrof n = chr (offset + n)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   338
  in implode (map chrof (radixpand (base, num))) end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   339
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   340
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   341
fun string_of_int n =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   342
  if n < 0 then "~" ^ radixstring (10, "0", ~n) else radixstring (10, "0", n);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   343
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   344
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   345
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   346
(** strings **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   347
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   348
fun is_letter ch =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   349
  ord "A" <= ord ch andalso ord ch <= ord "Z" orelse
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   350
  ord "a" <= ord ch andalso ord ch <= ord "z";
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   351
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   352
fun is_digit ch =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   353
  ord "0" <= ord ch andalso ord ch <= ord "9";
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   354
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   355
(*letter or _ or prime (')*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   356
fun is_quasi_letter "_" = true
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   357
  | is_quasi_letter "'" = true
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   358
  | is_quasi_letter ch = is_letter ch;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   359
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   360
(*white space: blanks, tabs, newlines*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   361
val is_blank : string -> bool =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   362
  fn " " => true | "\t" => true | "\n" => true | _ => false;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   363
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   364
val is_letdig = is_quasi_letter orf is_digit;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   365
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   366
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   367
(*lower all chars of string*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   368
val to_lower =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   369
  let
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   370
    fun lower ch =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   371
      if ch >= "A" andalso ch <= "Z" then
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   372
        chr (ord ch - ord "A" + ord "a")
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   373
      else ch;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   374
  in implode o (map lower) o explode end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   375
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   376
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   377
(*simple quoting (does not escape special chars)*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   378
fun quote s = "\"" ^ s ^ "\"";
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   379
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   380
(*space_implode "..." (explode "hello"); gives "h...e...l...l...o"*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   381
fun space_implode a bs = implode (separate a bs);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   382
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   383
(*concatenate messages, one per line, into a string*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   384
val cat_lines = implode o (map (apr (op ^, "\n")));
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   385
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   386
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   387
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   388
(** lists as sets **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   389
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   390
(*membership in a list*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   391
infix mem;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   392
fun x mem [] = false
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   393
  | x mem (y :: ys) = x = y orelse x mem ys;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   394
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   395
(*generalized membership test*)
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   396
fun gen_mem eq (x, []) = false
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   397
  | gen_mem eq (x, y :: ys) = eq (x, y) orelse gen_mem eq (x, ys);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   398
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   399
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   400
(*insertion into list if not already there*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   401
infix ins;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   402
fun x ins xs = if x mem xs then xs else x :: xs;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   403
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   404
(*generalized insertion*)
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   405
fun gen_ins eq (x, xs) = if gen_mem eq (x, xs) then xs else x :: xs;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   406
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   407
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   408
(*union of sets represented as lists: no repetitions*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   409
infix union;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   410
fun xs union [] = xs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   411
  | [] union ys = ys
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   412
  | (x :: xs) union ys = xs union (x ins ys);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   413
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   414
(*generalized union*)
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   415
fun gen_union eq (xs, []) = xs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   416
  | gen_union eq ([], ys) = ys
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   417
  | gen_union eq (x :: xs, ys) = gen_union eq (xs, gen_ins eq (x, ys));
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   418
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   419
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   420
(*intersection*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   421
infix inter;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   422
fun [] inter ys = []
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   423
  | (x :: xs) inter ys =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   424
      if x mem ys then x :: (xs inter ys) else xs inter ys;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   425
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   426
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   427
(*subset*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   428
infix subset;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   429
fun [] subset ys = true
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   430
  | (x :: xs) subset ys = x mem ys andalso xs subset ys;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   431
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   432
fun gen_subset eq (xs, ys) = forall (fn x => gen_mem eq (x, ys)) xs;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   433
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   434
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   435
(*removing an element from a list WITHOUT duplicates*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   436
infix \;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   437
fun (y :: ys) \ x = if x = y then ys else y :: (ys \ x)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   438
  | [] \ x = [];
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   439
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   440
infix \\;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   441
val op \\ = foldl (op \);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   442
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   443
(*removing an element from a list -- possibly WITH duplicates*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   444
fun gen_rem eq (xs, y) = filter_out (fn x => eq (x, y)) xs;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   445
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   446
val gen_rems = foldl o gen_rem;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   447
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   448
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   449
(*makes a list of the distinct members of the input; preserves order, takes
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   450
  first of equal elements*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   451
fun gen_distinct eq lst =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   452
  let
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   453
    val memb = gen_mem eq;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   454
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   455
    fun dist (rev_seen, []) = rev rev_seen
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   456
      | dist (rev_seen, x :: xs) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   457
          if memb (x, rev_seen) then dist (rev_seen, xs)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   458
          else dist (x :: rev_seen, xs);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   459
  in
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   460
    dist ([], lst)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   461
  end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   462
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   463
val distinct = gen_distinct (op =);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   464
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   465
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   466
(*returns the tail beginning with the first repeated element, or []*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   467
fun findrep [] = []
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   468
  | findrep (x :: xs) = if x mem xs then x :: xs else findrep xs;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   469
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   470
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   471
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   472
(** association lists **)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   473
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   474
(*association list lookup*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   475
fun assoc ([], key) = None
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   476
  | assoc ((keyi, xi) :: pairs, key) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   477
      if key = keyi then Some xi else assoc (pairs, key);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   478
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   479
fun assocs ps x =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   480
  (case assoc (ps, x) of
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   481
    None => []
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   482
  | Some ys => ys);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   483
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   484
(*generalized association list lookup*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   485
fun gen_assoc eq ([], key) = None
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   486
  | gen_assoc eq ((keyi, xi) :: pairs, key) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   487
      if eq (key, keyi) then Some xi else gen_assoc eq (pairs, key);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   488
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   489
(*association list update*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   490
fun overwrite (al, p as (key, _)) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   491
  let fun over ((q as (keyi, _)) :: pairs) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   492
            if keyi = key then p :: pairs else q :: (over pairs)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   493
        | over [] = [p]
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   494
  in over al end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   495
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   496
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   497
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   498
(** generic tables **)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   499
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   500
(*Tables are supposed to be 'efficient' encodings of lists of elements distinct
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   501
  wrt. an equality "eq". The extend and merge operations below are optimized
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   502
  for long-term space efficiency.*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   503
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   504
(*append (new) elements to a table*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   505
fun generic_extend _ _ _ tab [] = tab
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   506
  | generic_extend eq dest_tab mk_tab tab1 lst2 =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   507
      let
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   508
        val lst1 = dest_tab tab1;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   509
        val new_lst2 = gen_rems eq (lst2, lst1);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   510
      in
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   511
        if null new_lst2 then tab1
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   512
        else mk_tab (lst1 @ new_lst2)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   513
      end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   514
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   515
(*append (new) elements of 2nd table to 1st table*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   516
fun generic_merge eq dest_tab mk_tab tab1 tab2 =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   517
  let
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   518
    val lst1 = dest_tab tab1;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   519
    val lst2 = dest_tab tab2;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   520
    val new_lst2 = gen_rems eq (lst2, lst1);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   521
  in
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   522
    if null new_lst2 then tab1
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   523
    else if gen_subset eq (lst1, lst2) then tab2
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   524
    else mk_tab (lst1 @ new_lst2)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   525
  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   526
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   527
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   528
(*lists as tables*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   529
val extend_list = generic_extend (op =) I I;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   530
val merge_lists = generic_merge (op =) I I;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   531
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   532
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   533
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   534
(** balanced trees **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   535
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   536
exception Balance;      (*indicates non-positive argument to balancing fun*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   537
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   538
(*balanced folding; avoids deep nesting*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   539
fun fold_bal f [x] = x
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   540
  | fold_bal f [] = raise Balance
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   541
  | fold_bal f xs =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   542
      let val k = length xs div 2
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   543
      in  f (fold_bal f (take(k, xs)),
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   544
             fold_bal f (drop(k, xs)))
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   545
      end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   546
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   547
(*construct something of the form f(...g(...(x)...)) for balanced access*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   548
fun access_bal (f, g, x) n i =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   549
  let fun acc n i =     (*1<=i<=n*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   550
          if n=1 then x else
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   551
          let val n2 = n div 2
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   552
          in  if i<=n2 then f (acc n2 i)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   553
                       else g (acc (n-n2) (i-n2))
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   554
          end
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   555
  in  if 1<=i andalso i<=n then acc n i else raise Balance  end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   556
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   557
(*construct ALL such accesses; could try harder to share recursive calls!*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   558
fun accesses_bal (f, g, x) n =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   559
  let fun acc n =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   560
          if n=1 then [x] else
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   561
          let val n2 = n div 2
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   562
              val acc2 = acc n2
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   563
          in  if n-n2=n2 then map f acc2 @ map g acc2
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   564
                         else map f acc2 @ map g (acc (n-n2)) end
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   565
  in  if 1<=n then acc n else raise Balance  end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   566
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   567
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   568
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   569
(** input / output **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   570
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   571
fun prs s = output (std_out, s);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   572
fun writeln s = prs (s ^ "\n");
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   573
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   574
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   575
(*print error message and abort to top level*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   576
exception ERROR;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   577
fun error msg = (writeln msg; raise ERROR);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   578
fun sys_error msg = (writeln "*** System Error ***"; error msg);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   579
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   580
fun assert p msg = if p then () else error msg;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   581
fun deny p msg = if p then error msg else ();
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   582
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   583
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   584
(* FIXME close file (?) *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   585
(*for the "test" target in Makefiles -- signifies successful termination*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   586
fun maketest msg =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   587
  (writeln msg; output (open_out "test", "Test examples ran successfully\n"));
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   588
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   589
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   590
(*print a list surrounded by the brackets lpar and rpar, with comma separator
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   591
  print nothing for empty list*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   592
fun print_list (lpar, rpar, pre: 'a -> unit) (l : 'a list) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   593
  let fun prec x = (prs ","; pre x)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   594
  in
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   595
    (case l of
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   596
      [] => ()
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   597
    | x::l => (prs lpar; pre x; seq prec l; prs rpar))
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   598
  end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   599
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   600
(*print a list of items separated by newlines*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   601
fun print_list_ln (pre: 'a -> unit) : 'a list -> unit =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   602
  seq (fn x => (pre x; writeln ""));
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   603
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   604
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   605
val print_int = prs o string_of_int;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   606
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   607
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   608
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   609
(** timing **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   610
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   611
(*unconditional timing function*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   612
val timeit = cond_timeit true;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   613
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   614
(*timed application function*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   615
fun timeap f x = timeit (fn () => f x);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   616
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   617
(*timed "use" function, printing filenames*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   618
fun time_use fname = timeit (fn () =>
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   619
  (writeln ("\n**** Starting " ^ fname ^ " ****"); use fname;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   620
   writeln ("\n**** Finished " ^ fname ^ " ****")));
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   621
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   622
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   623
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   624
(** filenames **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   625
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   626
(*convert UNIX filename of the form "path/file" to "path/" and "file";
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   627
  if filename contains no slash, then it returns "" and "file"*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   628
val split_filename =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   629
  (pairself implode) o take_suffix (not_equal "/") o explode;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   630
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   631
val base_name = #2 o split_filename;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   632
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   633
(*merge splitted filename (path and file);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   634
  if path does not end with one a slash is appended*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   635
fun tack_on "" name = name
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   636
  | tack_on path name =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   637
      if last_elem (explode path) = "/" then path ^ name
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   638
      else path ^ "/" ^ name;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   639
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   640
(*remove the extension of a filename, i.e. the part after the last '.'*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   641
val remove_ext = implode o #1 o take_suffix (not_equal ".") o explode;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   642
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   643
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   644
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   645
(** misc functions **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   646
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   647
(*use the keyfun to make a list of (x, key) pairs*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   648
fun make_keylist (keyfun: 'a->'b) : 'a list -> ('a * 'b) list =
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   649
  let fun keypair x = (x, keyfun x)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   650
  in map keypair end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   651
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   652
(*given a list of (x, key) pairs and a searchkey
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   653
  return the list of xs from each pair whose key equals searchkey*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   654
fun keyfilter [] searchkey = []
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   655
  | keyfilter ((x, key) :: pairs) searchkey =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   656
      if key = searchkey then x :: keyfilter pairs searchkey
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   657
      else keyfilter pairs searchkey;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   658
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   659
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   660
(*Partition list into elements that satisfy predicate and those that don't.
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   661
  Preserves order of elements in both lists.*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   662
fun partition (pred: 'a->bool) (ys: 'a list) : ('a list * 'a list) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   663
    let fun part ([], answer) = answer
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   664
          | part (x::xs, (ys, ns)) = if pred(x)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   665
            then  part (xs, (x::ys, ns))
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   666
            else  part (xs, (ys, x::ns))
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   667
    in  part (rev ys, ([], []))  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   668
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   669
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   670
fun partition_eq (eq:'a * 'a -> bool) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   671
    let fun part [] = []
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   672
          | part (x::ys) = let val (xs, xs') = partition (apl(x, eq)) ys
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   673
                           in (x::xs)::(part xs') end
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   674
    in part end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   675
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   676
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   677
(*Partition a list into buckets  [ bi, b(i+1), ..., bj ]
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   678
   putting x in bk if p(k)(x) holds.  Preserve order of elements if possible.*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   679
fun partition_list p i j =
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   680
  let fun part k xs =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   681
            if k>j then
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   682
              (case xs of [] => []
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   683
                         | _ => raise LIST "partition_list")
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   684
            else
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   685
            let val (ns, rest) = partition (p k) xs;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   686
            in  ns :: part(k+1)rest  end
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   687
  in  part i end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   688
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   689
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   690
(* sorting *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   691
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   692
(*insertion sort; stable (does not reorder equal elements)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   693
  'less' is less-than test on type 'a*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   694
fun sort (less: 'a*'a -> bool) =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   695
  let fun insert (x, []) = [x]
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   696
        | insert (x, y::ys) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   697
              if less(y, x) then y :: insert (x, ys) else x::y::ys;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   698
      fun sort1 [] = []
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   699
        | sort1 (x::xs) = insert (x, sort1 xs)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   700
  in  sort1  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   701
41
97aae241094b added cons, rcons, last_elem, sort_strings, take_suffix;
wenzelm
parents: 24
diff changeset
   702
(*sort strings*)
97aae241094b added cons, rcons, last_elem, sort_strings, take_suffix;
wenzelm
parents: 24
diff changeset
   703
val sort_strings = sort (op <= : string * string -> bool);
97aae241094b added cons, rcons, last_elem, sort_strings, take_suffix;
wenzelm
parents: 24
diff changeset
   704
97aae241094b added cons, rcons, last_elem, sort_strings, take_suffix;
wenzelm
parents: 24
diff changeset
   705
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   706
(* transitive closure (not Warshall's algorithm) *)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   707
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   708
fun transitive_closure [] = []
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   709
  | transitive_closure ((x, ys)::ps) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   710
      let val qs = transitive_closure ps
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   711
          val zs = foldl (fn (zs, y) => assocs qs y union zs) (ys, ys)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   712
          fun step(u, us) = (u, if x mem us then zs union us else us)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   713
      in (x, zs) :: map step qs end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   714
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   715
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   716
(* generating identifiers *)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   717
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   718
local
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   719
  val a = ord "a" and z = ord "z" and A = ord "A" and Z = ord "Z"
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   720
  and k0 = ord "0" and k9 = ord "9"
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   721
in
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   722
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   723
(*Increment a list of letters like a reversed base 26 number.
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   724
  If head is "z", bumps chars in tail.
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   725
  Digits are incremented as if they were integers.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   726
  "_" and "'" are not changed.
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   727
  For making variants of identifiers.*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   728
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   729
fun bump_int_list(c::cs) = if c="9" then "0" :: bump_int_list cs else
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   730
        if k0 <= ord(c) andalso ord(c) < k9 then chr(ord(c)+1) :: cs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   731
        else "1" :: c :: cs
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   732
  | bump_int_list([]) = error("bump_int_list: not an identifier");
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   733
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   734
fun bump_list([], d) = [d]
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   735
  | bump_list(["'"], d) = [d, "'"]
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   736
  | bump_list("z"::cs, _) = "a" :: bump_list(cs, "a")
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   737
  | bump_list("Z"::cs, _) = "A" :: bump_list(cs, "A")
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   738
  | bump_list("9"::cs, _) = "0" :: bump_int_list cs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   739
  | bump_list(c::cs, _) = let val k = ord(c)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   740
        in if (a <= k andalso k < z) orelse (A <= k andalso k < Z) orelse
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   741
              (k0 <= k andalso k < k9) then chr(k+1) :: cs else
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   742
           if c="'" orelse c="_" then c :: bump_list(cs, "") else
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   743
                error("bump_list: not legal in identifier: " ^
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   744
                        implode(rev(c::cs)))
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   745
        end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   746
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   747
end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   748
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   749
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
   750
97aae241094b added cons, rcons, last_elem, sort_strings, take_suffix;
wenzelm
parents: 24
diff changeset
   751
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   752
(* lexical scanning *)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   753
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   754
(*scan a list of characters into "words" composed of "letters" (recognized by
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   755
  is_let) and separated by any number of non-"letters"*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   756
fun scanwords is_let cs =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   757
  let fun scan1 [] = []
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   758
        | scan1 cs =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   759
            let val (lets, rest) = take_prefix is_let cs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   760
            in implode lets :: scanwords is_let rest end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   761
  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
   762