src/Pure/library.ML
author paulson
Wed, 20 Mar 1996 18:40:57 +0100
changeset 1592 d89d5ff2397f
parent 1580 e3fd931e6095
child 1628 60136fdd80c4
permissions -rw-r--r--
maketest now closes the output file Declared type mtree for proof objects
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
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
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
    12
      mem mem_int mem_string union union_string union_int inter inter_int
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
    13
      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
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    18
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    19
(** functions **)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    20
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    21
(*handy combinators*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    22
fun curry f x y = f (x, y);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    23
fun uncurry f (x, y) = f x y;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    24
fun I x = x;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    25
fun K x y = x;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    26
380
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
    27
(*reverse apply*)
410
c8171ee32744 replaced infix also by |>
wenzelm
parents: 380
diff changeset
    28
fun (x |> f) = f x;
380
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
    29
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    30
(*combine two functions forming the union of their domains*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    31
fun f orelf g = fn x => f x handle Match => g x;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    32
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    33
(*application of (infix) operator to its left or right argument*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    34
fun apl (x, f) y = f (x, y);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    35
fun apr (f, y) x = f (x, y);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    36
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    37
(*functional for pairs*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    38
fun pairself f (x, y) = (f x, f y);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    39
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    40
(*function exponentiation: f(...(f x)...) with n applications of f*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    41
fun funpow n f x =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    42
  let fun rep (0, x) = x
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    43
        | rep (n, x) = rep (n - 1, f x)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    44
  in rep (n, x) end;
160
80ccb6c354ba added equal, not_equal: ''a -> ''a -> bool
wenzelm
parents: 41
diff changeset
    45
80ccb6c354ba added equal, not_equal: ''a -> ''a -> bool
wenzelm
parents: 41
diff changeset
    46
80ccb6c354ba added equal, not_equal: ''a -> ''a -> bool
wenzelm
parents: 41
diff changeset
    47
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    48
(** options **)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    49
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    50
datatype 'a option = None | Some of 'a;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    51
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    52
exception OPTION of string;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    53
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    54
fun the (Some x) = x
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    55
  | the None = raise OPTION "the";
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    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
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    60
fun is_some (Some _) = true
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    61
  | is_some None = false;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    62
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    63
fun is_none (Some _) = false
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    64
  | is_none None = true;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    65
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    66
fun apsome f (Some x) = Some (f x)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    67
  | apsome _ None = None;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    68
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    69
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    70
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    71
(** pairs **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    72
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    73
fun pair x y = (x, y);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    74
fun rpair x y = (y, x);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    75
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    76
fun fst (x, y) = x;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    77
fun snd (x, y) = y;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    78
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    79
fun eq_fst ((x1, _), (x2, _)) = x1 = x2;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    80
fun eq_snd ((_, y1), (_, y2)) = y1 = y2;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    81
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    82
fun swap (x, y) = (y, x);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    83
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    84
(*apply the function to a component of a pair*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    85
fun apfst f (x, y) = (f x, y);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    86
fun apsnd f (x, y) = (x, f y);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    87
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    88
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    89
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    90
(** booleans **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    91
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    92
(* equality *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    93
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    94
fun equal x y = x = y;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    95
fun not_equal x y = x <> y;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    96
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    97
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    98
(* operators for combining predicates *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    99
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   100
fun p orf q = fn x => p x orelse q x;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   101
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   102
fun p andf q = fn x => p x andalso q x;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   103
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   104
fun notf p x = not (p x);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   105
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   106
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   107
(* predicates on lists *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   108
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   109
fun orl [] = false
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   110
  | orl (x :: xs) = x orelse orl xs;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   111
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   112
fun andl [] = true
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   113
  | andl (x :: xs) = x andalso andl xs;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   114
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   115
(*exists pred [x1, ..., xn] ===> pred x1 orelse ... orelse pred xn*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   116
fun exists (pred: 'a -> bool) : 'a list -> bool =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   117
  let fun boolf [] = false
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   118
        | boolf (x :: xs) = pred x orelse boolf xs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   119
  in boolf end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   120
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   121
(*forall pred [x1, ..., xn] ===> pred x1 andalso ... andalso pred xn*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   122
fun forall (pred: 'a -> bool) : 'a list -> bool =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   123
  let fun boolf [] = true
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   124
        | boolf (x :: xs) = pred x andalso boolf xs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   125
  in boolf end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   126
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   127
380
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   128
(* flags *)
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   129
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   130
fun set flag = (flag := true; true);
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   131
fun reset flag = (flag := false; false);
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   132
fun toggle flag = (flag := not (! flag); ! flag);
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   133
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   134
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   135
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   136
(** lists **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   137
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   138
exception LIST of string;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   139
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   140
fun null [] = true
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   141
  | null (_ :: _) = false;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   142
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   143
fun hd [] = raise LIST "hd"
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   144
  | hd (x :: _) = x;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   145
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   146
fun tl [] = raise LIST "tl"
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   147
  | tl (_ :: xs) = xs;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   148
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   149
fun cons x xs = x :: xs;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   150
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   151
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   152
(* fold *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   153
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   154
(*the following versions of fold are designed to fit nicely with infixes*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   155
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   156
(*  (op @) (e, [x1, ..., xn])  ===>  ((e @ x1) @ x2) ... @ xn
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   157
    for operators that associate to the left (TAIL RECURSIVE)*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   158
fun foldl (f: 'a * 'b -> 'a) : 'a * 'b list -> 'a =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   159
  let fun itl (e, [])  = e
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   160
        | itl (e, a::l) = itl (f(e, a), l)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   161
  in  itl end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   162
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   163
(*  (op @) ([x1, ..., xn], e)  ===>   x1 @ (x2 ... @ (xn @ e))
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   164
    for operators that associate to the right (not tail recursive)*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   165
fun foldr f (l, e) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   166
  let fun itr [] = e
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   167
        | itr (a::l) = f(a, itr l)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   168
  in  itr l  end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   169
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   170
(*  (op @) [x1, ..., xn]  ===>   x1 @ (x2 ... @ (x[n-1] @ xn))
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   171
    for n > 0, operators that associate to the right (not tail recursive)*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   172
fun foldr1 f l =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   173
  let fun itr [x] = x                       (* FIXME [] case: elim warn (?) *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   174
        | itr (x::l) = f(x, itr l)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   175
  in  itr l  end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   176
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   177
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   178
(* basic list functions *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   179
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   180
(*length of a list, should unquestionably be a standard function*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   181
local fun length1 (n, [])  = n   (*TAIL RECURSIVE*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   182
        | length1 (n, x :: xs) = length1 (n + 1, xs)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   183
in  fun length l = length1 (0, l) end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   184
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   185
(*take the first n elements from a list*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   186
fun take (n, []) = []
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   187
  | take (n, x :: xs) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   188
      if n > 0 then x :: take (n - 1, xs) else [];
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   189
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   190
(*drop the first n elements from a list*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   191
fun drop (n, []) = []
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   192
  | drop (n, x :: xs) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   193
      if n > 0 then drop (n - 1, xs) else x :: xs;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   194
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   195
(*return nth element of a list, where 0 designates the first element;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   196
  raise EXCEPTION if list too short*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   197
fun nth_elem NL =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   198
  (case drop NL of
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   199
    [] => raise LIST "nth_elem"
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   200
  | x :: _ => x);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   201
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   202
(*last element of a list*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   203
fun last_elem [] = raise LIST "last_elem"
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   204
  | last_elem [x] = x
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   205
  | last_elem (_ :: xs) = last_elem xs;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   206
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   207
(*find the position of an element in a list*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   208
fun find (x, ys) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   209
  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
   210
        | f (_, _) = raise LIST "find"
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   211
  in f (ys, 0) end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   212
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   213
(*flatten a list of lists to a list*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   214
fun flat (ls: 'c list list) : 'c list = foldr (op @) (ls, []);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   215
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   216
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   217
(*like Lisp's MAPC -- seq proc [x1, ..., xn] evaluates
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   218
  (proc x1; ...; proc xn) for side effects*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   219
fun seq (proc: 'a -> unit) : 'a list -> unit =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   220
  let fun seqf [] = ()
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   221
        | seqf (x :: xs) = (proc x; seqf xs)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   222
  in seqf end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   223
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   224
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   225
(*separate s [x1, x2, ..., xn]  ===>  [x1, s, x2, s, ..., s, xn]*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   226
fun separate s (x :: (xs as _ :: _)) = x :: s :: separate s xs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   227
  | separate _ xs = xs;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   228
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   229
(*make the list [x, x, ..., x] of length n*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   230
fun replicate n (x: 'a) : 'a list =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   231
  let fun rep (0, xs) = xs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   232
        | rep (n, xs) = rep (n - 1, x :: xs)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   233
  in
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   234
    if n < 0 then raise LIST "replicate"
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   235
    else rep (n, [])
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   236
  end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   237
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   238
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   239
(* filter *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   240
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   241
(*copy the list preserving elements that satisfy the predicate*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   242
fun filter (pred: 'a->bool) : 'a list -> 'a list =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   243
  let fun filt [] = []
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   244
        | filt (x :: xs) = if pred x then x :: filt xs else filt xs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   245
  in filt end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   246
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   247
fun filter_out f = filter (not o f);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   248
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   249
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   250
fun mapfilter (f: 'a -> 'b option) ([]: 'a list) = [] : 'b list
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   251
  | mapfilter f (x :: xs) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   252
      (case f x of
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   253
        None => mapfilter f xs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   254
      | Some y => y :: mapfilter f xs);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   255
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   256
380
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   257
fun find_first _ [] = None
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   258
  | find_first pred (x :: xs) =
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   259
      if pred x then Some x else find_first pred xs;
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   260
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   261
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   262
(* lists of pairs *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   263
380
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   264
fun map2 _ ([], []) = []
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   265
  | map2 f (x :: xs, y :: ys) = (f (x, y) :: map2 f (xs, ys))
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   266
  | map2 _ _ = raise LIST "map2";
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   267
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   268
fun exists2 _ ([], []) = false
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   269
  | exists2 pred (x :: xs, y :: ys) = pred (x, y) orelse exists2 pred (xs, ys)
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   270
  | exists2 _ _ = raise LIST "exists2";
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   271
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   272
fun forall2 _ ([], []) = true
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   273
  | forall2 pred (x :: xs, y :: ys) = pred (x, y) andalso forall2 pred (xs, ys)
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   274
  | forall2 _ _ = raise LIST "forall2";
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   275
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   276
(*combine two lists forming a list of pairs:
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   277
  [x1, ..., xn] ~~ [y1, ..., yn]  ===>  [(x1, y1), ..., (xn, yn)]*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   278
fun [] ~~ [] = []
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   279
  | (x :: xs) ~~ (y :: ys) = (x, y) :: (xs ~~ ys)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   280
  | _ ~~ _ = raise LIST "~~";
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   281
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   282
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   283
(*inverse of ~~; the old 'split':
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   284
  [(x1, y1), ..., (xn, yn)]  ===>  ([x1, ..., xn], [y1, ..., yn])*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   285
fun split_list (l: ('a * 'b) list) = (map #1 l, map #2 l);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   286
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   287
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   288
(* prefixes, suffixes *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   289
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   290
fun [] prefix _ = true
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   291
  | (x :: xs) prefix (y :: ys) = x = y andalso (xs prefix ys)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   292
  | _ prefix _ = false;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   293
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   294
(* [x1, ..., xi, ..., xn]  --->  ([x1, ..., x(i-1)], [xi, ..., xn])
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   295
   where xi is the first element that does not satisfy the predicate*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   296
fun take_prefix (pred : 'a -> bool)  (xs: 'a list) : 'a list * 'a list =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   297
  let fun take (rxs, []) = (rev rxs, [])
255
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   298
        | take (rxs, x :: xs) =
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   299
            if  pred x  then  take(x :: rxs, xs)  else  (rev rxs, x :: xs)
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   300
  in  take([], xs)  end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   301
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   302
(* [x1, ..., xi, ..., xn]  --->  ([x1, ..., xi], [x(i+1), ..., xn])
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   303
   where xi is the last element that does not satisfy the predicate*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   304
fun take_suffix _ [] = ([], [])
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   305
  | take_suffix pred (x :: xs) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   306
      (case take_suffix pred xs of
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   307
        ([], sffx) => if pred x then ([], x :: sffx) else ([x], sffx)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   308
      | (prfx, sffx) => (x :: prfx, sffx));
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   309
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   310
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   311
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   312
(** integers **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   313
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   314
fun inc i = i := ! i + 1;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   315
fun dec i = i := ! i - 1;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   316
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   317
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   318
(* lists of integers *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   319
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   320
(*make the list [from, from + 1, ..., to]*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   321
fun from upto to =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   322
  if from > to then [] else from :: ((from + 1) upto to);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   323
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   324
(*make the list [from, from - 1, ..., to]*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   325
fun from downto to =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   326
  if from < to then [] else from :: ((from - 1) downto to);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   327
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   328
(*predicate: downto0 (is, n) <=> is = [n, n - 1, ..., 0]*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   329
fun downto0 (i :: is, n) = i = n andalso downto0 (is, n - 1)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   330
  | downto0 ([], n) = n = ~1;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   331
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   332
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   333
(* operations on integer lists *)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   334
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   335
fun sum [] = 0
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   336
  | sum (n :: ns) = n + sum ns;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   337
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   338
fun max [m:int] = m
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   339
  | 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
   340
  | max [] = raise LIST "max";
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   341
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   342
fun min [m:int] = m
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   343
  | 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
   344
  | min [] = raise LIST "min";
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   345
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   346
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   347
(* convert integers to strings *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   348
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   349
(*expand the number in the given base;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   350
  example: radixpand (2, 8) gives [1, 0, 0, 0]*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   351
fun radixpand (base, num) : int list =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   352
  let
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   353
    fun radix (n, tail) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   354
      if n < base then n :: tail
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   355
      else radix (n div base, (n mod base) :: tail)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   356
  in radix (num, []) end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   357
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   358
(*expands a number into a string of characters starting from "zerochar";
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   359
  example: radixstring (2, "0", 8) gives "1000"*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   360
fun radixstring (base, zerochar, num) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   361
  let val offset = ord zerochar;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   362
      fun chrof n = chr (offset + n)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   363
  in implode (map chrof (radixpand (base, num))) end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   364
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   365
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   366
fun string_of_int n =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   367
  if n < 0 then "~" ^ radixstring (10, "0", ~n) else radixstring (10, "0", n);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   368
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   369
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   370
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   371
(** strings **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   372
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   373
fun is_letter ch =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   374
  ord "A" <= ord ch andalso ord ch <= ord "Z" orelse
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   375
  ord "a" <= ord ch andalso ord ch <= ord "z";
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   376
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   377
fun is_digit ch =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   378
  ord "0" <= ord ch andalso ord ch <= ord "9";
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   379
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   380
(*letter or _ or prime (')*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   381
fun is_quasi_letter "_" = true
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   382
  | is_quasi_letter "'" = true
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   383
  | is_quasi_letter ch = is_letter ch;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   384
512
55755ed9fab9 Pure/library/enclose, Pure/Syntax/pretty/enclose: renamed from parents
lcp
parents: 410
diff changeset
   385
(*white space: blanks, tabs, newlines, formfeeds*)
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   386
val is_blank : string -> bool =
512
55755ed9fab9 Pure/library/enclose, Pure/Syntax/pretty/enclose: renamed from parents
lcp
parents: 410
diff changeset
   387
  fn " " => true | "\t" => true | "\n" => true | "\^L" => true | _ => false;
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   388
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   389
val is_letdig = is_quasi_letter orf is_digit;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   390
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   391
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   392
(*lower all chars of string*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   393
val to_lower =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   394
  let
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   395
    fun lower ch =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   396
      if ch >= "A" andalso ch <= "Z" then
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   397
        chr (ord ch - ord "A" + ord "a")
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   398
      else ch;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   399
  in implode o (map lower) o explode end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   400
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   401
512
55755ed9fab9 Pure/library/enclose, Pure/Syntax/pretty/enclose: renamed from parents
lcp
parents: 410
diff changeset
   402
(*enclose in brackets*)
55755ed9fab9 Pure/library/enclose, Pure/Syntax/pretty/enclose: renamed from parents
lcp
parents: 410
diff changeset
   403
fun enclose lpar rpar str = lpar ^ str ^ rpar;
255
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   404
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   405
(*simple quoting (does not escape special chars)*)
512
55755ed9fab9 Pure/library/enclose, Pure/Syntax/pretty/enclose: renamed from parents
lcp
parents: 410
diff changeset
   406
val quote = enclose "\"" "\"";
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   407
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   408
(*space_implode "..." (explode "hello"); gives "h...e...l...l...o"*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   409
fun space_implode a bs = implode (separate a bs);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   410
255
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   411
val commas = space_implode ", ";
380
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   412
val commas_quote = commas o map quote;
255
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   413
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   414
(*concatenate messages, one per line, into a string*)
255
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   415
val cat_lines = space_implode "\n";
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   416
1290
ee8f41456d28 added space_explode and relative_path
clasohm
parents: 955
diff changeset
   417
(*space_explode "." "h.e..l.lo"; gives ["h", "e", "l", "lo"]*)
ee8f41456d28 added space_explode and relative_path
clasohm
parents: 955
diff changeset
   418
fun space_explode sep s =
ee8f41456d28 added space_explode and relative_path
clasohm
parents: 955
diff changeset
   419
  let fun divide [] "" = []
ee8f41456d28 added space_explode and relative_path
clasohm
parents: 955
diff changeset
   420
        | divide [] part = [part]
ee8f41456d28 added space_explode and relative_path
clasohm
parents: 955
diff changeset
   421
        | divide (c::s) part =
ee8f41456d28 added space_explode and relative_path
clasohm
parents: 955
diff changeset
   422
            if c = sep then
ee8f41456d28 added space_explode and relative_path
clasohm
parents: 955
diff changeset
   423
              (if part = "" then divide s "" else part :: divide s "")
ee8f41456d28 added space_explode and relative_path
clasohm
parents: 955
diff changeset
   424
            else divide s (part ^ c)
ee8f41456d28 added space_explode and relative_path
clasohm
parents: 955
diff changeset
   425
  in divide (explode s) "" end;
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   426
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   427
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   428
(** lists as sets **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   429
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   430
(*membership in a list*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   431
fun x mem [] = false
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   432
  | x mem (y :: ys) = x = y orelse x mem ys;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   433
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   434
(*membership in a list, optimized version for int lists*)
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   435
fun (x:int) mem_int [] = false
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   436
  | 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
   437
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   438
(*membership in a list, optimized version for string lists*)
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   439
fun (x:string) mem_string [] = false
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   440
  | 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
   441
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   442
(*generalized membership test*)
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   443
fun gen_mem eq (x, []) = false
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   444
  | 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
   445
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   446
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   447
(*insertion into list if not already there*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   448
fun x ins xs = if x mem xs then xs else x :: xs;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   449
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   450
(*insertion into list if not already there, optimized version for int lists*)
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   451
fun (x:int) ins_int xs = if x mem_int xs then xs else x :: xs;
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   452
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   453
(*insertion into list if not already there, optimized version for string lists*)
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   454
fun (x:string) ins_string xs = if x mem_string xs then xs else x :: xs;
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   455
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   456
(*generalized insertion*)
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   457
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
   458
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   459
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   460
(*union of sets represented as lists: no repetitions*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   461
fun xs union [] = xs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   462
  | [] union ys = ys
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   463
  | (x :: xs) union ys = xs union (x ins ys);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   464
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   465
(*union of sets represented as lists: no repetitions, optimized version for int lists*)
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   466
fun (xs:int list) union_int [] = xs
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   467
  | [] union_int ys = ys
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   468
  | (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
   469
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   470
(*union of sets represented as lists: no repetitions, optimized version for string lists*)
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   471
fun (xs:string list) union_string [] = xs
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   472
  | [] union_string ys = ys
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   473
  | (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
   474
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   475
(*generalized union*)
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   476
fun gen_union eq (xs, []) = xs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   477
  | gen_union eq ([], ys) = ys
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   478
  | 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
   479
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   480
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   481
(*intersection*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   482
fun [] inter ys = []
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   483
  | (x :: xs) inter ys =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   484
      if x mem ys then x :: (xs inter ys) else xs inter ys;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   485
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   486
(*intersection, optimized version for int lists*)
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   487
fun ([]:int list) inter_int ys = []
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   488
  | (x :: xs) inter_int ys =
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   489
      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
   490
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   491
(*intersection, optimized version for string lists *)
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   492
fun ([]:string list) inter_string ys = []
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   493
  | (x :: xs) inter_string ys =
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   494
      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
   495
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   496
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   497
(*subset*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   498
fun [] subset ys = true
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   499
  | (x :: xs) subset ys = x mem ys andalso xs subset ys;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   500
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   501
(*subset, optimized version for int lists*)
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   502
fun ([]:int list) subset_int ys = true
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   503
  | (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
   504
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   505
(*subset, optimized version for string lists*)
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   506
fun ([]:string list) subset_string ys = true
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   507
  | (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
   508
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   509
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
   510
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   511
265
443dc2c37583 added eq_set;
wenzelm
parents: 255
diff changeset
   512
(*eq_set*)
443dc2c37583 added eq_set;
wenzelm
parents: 255
diff changeset
   513
443dc2c37583 added eq_set;
wenzelm
parents: 255
diff changeset
   514
fun eq_set (xs, ys) =
443dc2c37583 added eq_set;
wenzelm
parents: 255
diff changeset
   515
  xs = ys orelse (xs subset ys andalso ys subset xs);
443dc2c37583 added eq_set;
wenzelm
parents: 255
diff changeset
   516
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   517
(*eq_set, optimized version for int lists*)
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   518
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   519
fun eq_set_int ((xs:int list), ys) =
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   520
  xs = ys orelse (xs subset_int ys andalso ys subset_int xs);
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   521
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   522
(*eq_set, optimized version for string lists*)
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   523
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   524
fun eq_set_string ((xs:string list), ys) =
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   525
  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
   526
265
443dc2c37583 added eq_set;
wenzelm
parents: 255
diff changeset
   527
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   528
(*removing an element from a list WITHOUT duplicates*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   529
fun (y :: ys) \ x = if x = y then ys else y :: (ys \ x)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   530
  | [] \ x = [];
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   531
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   532
val op \\ = foldl (op \);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   533
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   534
(*removing an element from a list -- possibly WITH duplicates*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   535
fun gen_rem eq (xs, y) = filter_out (fn x => eq (x, y)) xs;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   536
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   537
val gen_rems = foldl o gen_rem;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   538
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   539
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   540
(*makes a list of the distinct members of the input; preserves order, takes
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   541
  first of equal elements*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   542
fun gen_distinct eq lst =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   543
  let
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   544
    val memb = gen_mem eq;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   545
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   546
    fun dist (rev_seen, []) = rev rev_seen
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   547
      | dist (rev_seen, x :: xs) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   548
          if memb (x, rev_seen) then dist (rev_seen, xs)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   549
          else dist (x :: rev_seen, xs);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   550
  in
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   551
    dist ([], lst)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   552
  end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   553
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   554
val distinct = gen_distinct (op =);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   555
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   556
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   557
(*returns the tail beginning with the first repeated element, or []*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   558
fun findrep [] = []
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   559
  | findrep (x :: xs) = if x mem xs then x :: xs else findrep xs;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   560
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   561
255
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   562
(*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
   563
  order, takes first of equal elements*)
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   564
fun gen_duplicates eq lst =
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   565
  let
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   566
    val memb = gen_mem eq;
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   567
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   568
    fun dups (rev_dups, []) = rev rev_dups
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   569
      | dups (rev_dups, x :: xs) =
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   570
          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
   571
            dups (rev_dups, xs)
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   572
          else dups (x :: rev_dups, xs);
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   573
  in
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   574
    dups ([], lst)
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   575
  end;
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   576
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   577
val duplicates = gen_duplicates (op =);
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   578
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   579
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   580
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   581
(** association lists **)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   582
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   583
(*association list lookup*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   584
fun assoc ([], key) = None
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   585
  | assoc ((keyi, xi) :: pairs, key) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   586
      if key = keyi then Some xi else assoc (pairs, key);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   587
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   588
(*association list lookup, optimized version for int lists*)
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   589
fun assoc_int ([], (key:int)) = None
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   590
  | assoc_int ((keyi, xi) :: pairs, key) =
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   591
      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
   592
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   593
(*association list lookup, optimized version for string lists*)
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   594
fun assoc_string ([], (key:string)) = None
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   595
  | assoc_string ((keyi, xi) :: pairs, key) =
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   596
      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
   597
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   598
(*association list lookup, optimized version for string*int lists*)
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   599
fun assoc_string_int ([], (key:string*int)) = None
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   600
  | assoc_string_int ((keyi, xi) :: pairs, key) =
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   601
      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
   602
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   603
fun assocs ps x =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   604
  (case assoc (ps, x) of
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   605
    None => []
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   606
  | Some ys => ys);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   607
255
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   608
(*two-fold association list lookup*)
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   609
fun assoc2 (aal, (key1, key2)) =
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   610
  (case assoc (aal, key1) of
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   611
    Some al => assoc (al, key2)
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   612
  | None => None);
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   613
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   614
(*generalized association list lookup*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   615
fun gen_assoc eq ([], key) = None
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   616
  | gen_assoc eq ((keyi, xi) :: pairs, key) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   617
      if eq (key, keyi) then Some xi else gen_assoc eq (pairs, key);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   618
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   619
(*association list update*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   620
fun overwrite (al, p as (key, _)) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   621
  let fun over ((q as (keyi, _)) :: pairs) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   622
            if keyi = key then p :: pairs else q :: (over pairs)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   623
        | over [] = [p]
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   624
  in over al end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   625
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   626
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   627
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   628
(** generic tables **)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   629
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   630
(*Tables are supposed to be 'efficient' encodings of lists of elements distinct
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   631
  wrt. an equality "eq". The extend and merge operations below are optimized
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   632
  for long-term space efficiency.*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   633
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   634
(*append (new) elements to a table*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   635
fun generic_extend _ _ _ tab [] = tab
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   636
  | generic_extend eq dest_tab mk_tab tab1 lst2 =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   637
      let
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   638
        val lst1 = dest_tab tab1;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   639
        val new_lst2 = gen_rems eq (lst2, lst1);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   640
      in
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   641
        if null new_lst2 then tab1
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   642
        else mk_tab (lst1 @ new_lst2)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   643
      end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   644
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   645
(*append (new) elements of 2nd table to 1st table*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   646
fun generic_merge eq dest_tab mk_tab tab1 tab2 =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   647
  let
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   648
    val lst1 = dest_tab tab1;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   649
    val lst2 = dest_tab tab2;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   650
    val new_lst2 = gen_rems eq (lst2, lst1);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   651
  in
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   652
    if null new_lst2 then tab1
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   653
    else if gen_subset eq (lst1, lst2) then tab2
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   654
    else mk_tab (lst1 @ new_lst2)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   655
  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   656
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   657
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   658
(*lists as tables*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   659
val extend_list = generic_extend (op =) I I;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   660
val merge_lists = generic_merge (op =) I I;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   661
380
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   662
fun merge_rev_lists xs [] = xs
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   663
  | merge_rev_lists [] ys = ys
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   664
  | merge_rev_lists xs (y :: ys) =
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   665
      (if y mem xs then I else cons y) (merge_rev_lists xs ys);
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   666
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   667
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   668
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   669
(** balanced trees **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   670
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   671
exception Balance;      (*indicates non-positive argument to balancing fun*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   672
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   673
(*balanced folding; avoids deep nesting*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   674
fun fold_bal f [x] = x
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   675
  | fold_bal f [] = raise Balance
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   676
  | fold_bal f xs =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   677
      let val k = length xs div 2
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   678
      in  f (fold_bal f (take(k, xs)),
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   679
             fold_bal f (drop(k, xs)))
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   680
      end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   681
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   682
(*construct something of the form f(...g(...(x)...)) for balanced access*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   683
fun access_bal (f, g, x) n i =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   684
  let fun acc n i =     (*1<=i<=n*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   685
          if n=1 then x else
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   686
          let val n2 = n div 2
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   687
          in  if i<=n2 then f (acc n2 i)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   688
                       else g (acc (n-n2) (i-n2))
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   689
          end
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   690
  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
   691
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   692
(*construct ALL such accesses; could try harder to share recursive calls!*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   693
fun accesses_bal (f, g, x) n =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   694
  let fun acc n =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   695
          if n=1 then [x] else
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   696
          let val n2 = n div 2
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   697
              val acc2 = acc n2
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   698
          in  if n-n2=n2 then map f acc2 @ map g acc2
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   699
                         else map f acc2 @ map g (acc (n-n2)) end
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   700
  in  if 1<=n then acc n else raise Balance  end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   701
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   702
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   703
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   704
(** input / output **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   705
1580
e3fd931e6095 Added some functions which allow redirection of Isabelle's output
berghofe
parents: 1576
diff changeset
   706
val prs_fn = ref(fn s => output (std_out, s));
e3fd931e6095 Added some functions which allow redirection of Isabelle's output
berghofe
parents: 1576
diff changeset
   707
e3fd931e6095 Added some functions which allow redirection of Isabelle's output
berghofe
parents: 1576
diff changeset
   708
fun prs s = !prs_fn s;
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   709
fun writeln s = prs (s ^ "\n");
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   710
1580
e3fd931e6095 Added some functions which allow redirection of Isabelle's output
berghofe
parents: 1576
diff changeset
   711
(*print warning*)
e3fd931e6095 Added some functions which allow redirection of Isabelle's output
berghofe
parents: 1576
diff changeset
   712
val warning_fn = ref(fn s => output (std_out, s ^ "\n"));
e3fd931e6095 Added some functions which allow redirection of Isabelle's output
berghofe
parents: 1576
diff changeset
   713
fun warning s = !warning_fn ("Warning: " ^ s);
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   714
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   715
(*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
   716
e3fd931e6095 Added some functions which allow redirection of Isabelle's output
berghofe
parents: 1576
diff changeset
   717
val error_fn = ref(fn s => output (std_out, s ^ "\n"));
e3fd931e6095 Added some functions which allow redirection of Isabelle's output
berghofe
parents: 1576
diff changeset
   718
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   719
exception ERROR;
1580
e3fd931e6095 Added some functions which allow redirection of Isabelle's output
berghofe
parents: 1576
diff changeset
   720
fun error msg = (!error_fn msg; raise ERROR);
e3fd931e6095 Added some functions which allow redirection of Isabelle's output
berghofe
parents: 1576
diff changeset
   721
fun sys_error msg = (!error_fn "*** SYSTEM ERROR ***"; error msg);
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   722
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   723
fun assert p msg = if p then () else error msg;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   724
fun deny p msg = if p then error msg else ();
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   725
544
c53386a5bcf1 Pure/library/assert_all: new, moved from ZF/ind_syntax.ML
lcp
parents: 512
diff changeset
   726
(*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
   727
fun assert_all pred l msg_fn = 
c53386a5bcf1 Pure/library/assert_all: new, moved from ZF/ind_syntax.ML
lcp
parents: 512
diff changeset
   728
  let fun asl [] = ()
1460
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   729
	| asl (x::xs) = if pred x then asl xs
5a6f2aabd538 inserted tabs again
clasohm
parents: 1458
diff changeset
   730
	                else error (msg_fn x)
544
c53386a5bcf1 Pure/library/assert_all: new, moved from ZF/ind_syntax.ML
lcp
parents: 512
diff changeset
   731
  in  asl l  end;
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   732
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   733
(*for the "test" target in Makefiles -- signifies successful termination*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   734
fun maketest msg =
1592
d89d5ff2397f maketest now closes the output file
paulson
parents: 1580
diff changeset
   735
  (writeln msg; 
d89d5ff2397f maketest now closes the output file
paulson
parents: 1580
diff changeset
   736
   let val os = open_out "test" 
d89d5ff2397f maketest now closes the output file
paulson
parents: 1580
diff changeset
   737
   in  output (os, "Test examples ran successfully\n");
d89d5ff2397f maketest now closes the output file
paulson
parents: 1580
diff changeset
   738
       close_out os
d89d5ff2397f maketest now closes the output file
paulson
parents: 1580
diff changeset
   739
   end);
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   740
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   741
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   742
(*print a list surrounded by the brackets lpar and rpar, with comma separator
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   743
  print nothing for empty list*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   744
fun print_list (lpar, rpar, pre: 'a -> unit) (l : 'a list) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   745
  let fun prec x = (prs ","; pre x)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   746
  in
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   747
    (case l of
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   748
      [] => ()
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   749
    | x::l => (prs lpar; pre x; seq prec l; prs rpar))
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   750
  end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   751
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   752
(*print a list of items separated by newlines*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   753
fun print_list_ln (pre: 'a -> unit) : 'a list -> unit =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   754
  seq (fn x => (pre x; writeln ""));
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   755
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   756
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   757
val print_int = prs o string_of_int;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   758
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   759
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   760
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   761
(** timing **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   762
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   763
(*unconditional timing function*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   764
val timeit = cond_timeit true;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   765
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   766
(*timed application function*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   767
fun timeap f x = timeit (fn () => f x);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   768
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   769
(*timed "use" function, printing filenames*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   770
fun time_use fname = timeit (fn () =>
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   771
  (writeln ("\n**** Starting " ^ fname ^ " ****"); use fname;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   772
   writeln ("\n**** Finished " ^ fname ^ " ****")));
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   773
955
aa0c5f9daf5b Declares the function exit_use to behave like use but fail if
lcp
parents: 544
diff changeset
   774
(*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
   775
fun exit_use fname = use fname handle _ => exit 1;
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   776
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   777
1407
c22cc592785f added subdir_of
clasohm
parents: 1364
diff changeset
   778
(** filenames and paths **)
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   779
1290
ee8f41456d28 added space_explode and relative_path
clasohm
parents: 955
diff changeset
   780
(*Convert UNIX filename of the form "path/file" to "path/" and "file";
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   781
  if filename contains no slash, then it returns "" and "file"*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   782
val split_filename =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   783
  (pairself implode) o take_suffix (not_equal "/") o explode;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   784
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   785
val base_name = #2 o split_filename;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   786
1290
ee8f41456d28 added space_explode and relative_path
clasohm
parents: 955
diff changeset
   787
(*Merge splitted filename (path and file);
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   788
  if path does not end with one a slash is appended*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   789
fun tack_on "" name = name
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   790
  | tack_on path name =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   791
      if last_elem (explode path) = "/" then path ^ name
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   792
      else path ^ "/" ^ name;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   793
1290
ee8f41456d28 added space_explode and relative_path
clasohm
parents: 955
diff changeset
   794
(*Remove the extension of a filename, i.e. the part after the last '.'*)
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   795
val remove_ext = implode o #1 o take_suffix (not_equal ".") o explode;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   796
1290
ee8f41456d28 added space_explode and relative_path
clasohm
parents: 955
diff changeset
   797
(*Make relative path to reach an absolute location from a different one*)
ee8f41456d28 added space_explode and relative_path
clasohm
parents: 955
diff changeset
   798
fun relative_path cur_path dest_path =
ee8f41456d28 added space_explode and relative_path
clasohm
parents: 955
diff changeset
   799
  let (*Remove common beginning of both paths and make relative path*)
ee8f41456d28 added space_explode and relative_path
clasohm
parents: 955
diff changeset
   800
      fun mk_relative [] [] = []
ee8f41456d28 added space_explode and relative_path
clasohm
parents: 955
diff changeset
   801
        | mk_relative [] ds = ds
ee8f41456d28 added space_explode and relative_path
clasohm
parents: 955
diff changeset
   802
        | mk_relative cs [] = map (fn _ => "..") cs
ee8f41456d28 added space_explode and relative_path
clasohm
parents: 955
diff changeset
   803
        | mk_relative (c::cs) (d::ds) =
ee8f41456d28 added space_explode and relative_path
clasohm
parents: 955
diff changeset
   804
            if c = d then mk_relative cs ds
ee8f41456d28 added space_explode and relative_path
clasohm
parents: 955
diff changeset
   805
            else ".." :: map (fn _ => "..") cs @ (d::ds);
ee8f41456d28 added space_explode and relative_path
clasohm
parents: 955
diff changeset
   806
  in if cur_path = "" orelse hd (explode cur_path) <> "/" orelse
ee8f41456d28 added space_explode and relative_path
clasohm
parents: 955
diff changeset
   807
        dest_path = "" orelse hd (explode dest_path) <> "/" then
ee8f41456d28 added space_explode and relative_path
clasohm
parents: 955
diff changeset
   808
       error "Relative or empty path passed to relative_path"
ee8f41456d28 added space_explode and relative_path
clasohm
parents: 955
diff changeset
   809
     else ();
ee8f41456d28 added space_explode and relative_path
clasohm
parents: 955
diff changeset
   810
     space_implode "/" (mk_relative (space_explode "/" cur_path)
ee8f41456d28 added space_explode and relative_path
clasohm
parents: 955
diff changeset
   811
                                    (space_explode "/" dest_path))
ee8f41456d28 added space_explode and relative_path
clasohm
parents: 955
diff changeset
   812
  end;
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   813
1407
c22cc592785f added subdir_of
clasohm
parents: 1364
diff changeset
   814
(*Determine if absolute path1 is a subdirectory of absolute path2*)
c22cc592785f added subdir_of
clasohm
parents: 1364
diff changeset
   815
fun path1 subdir_of path2 =
c22cc592785f added subdir_of
clasohm
parents: 1364
diff changeset
   816
  if hd (explode path1) <> "/" orelse hd (explode path2) <> "/" then
c22cc592785f added subdir_of
clasohm
parents: 1364
diff changeset
   817
    error "Relative or empty path passed to subdir_of"
c22cc592785f added subdir_of
clasohm
parents: 1364
diff changeset
   818
  else (space_explode "/" path2) prefix (space_explode "/" path1);
c22cc592785f added subdir_of
clasohm
parents: 1364
diff changeset
   819
1456
2e07cd051ff9 added absolute_path
clasohm
parents: 1407
diff changeset
   820
fun absolute_path cwd file =
2e07cd051ff9 added absolute_path
clasohm
parents: 1407
diff changeset
   821
  let fun rm_points [] result = rev result
2e07cd051ff9 added absolute_path
clasohm
parents: 1407
diff changeset
   822
        | rm_points (".."::ds) result = rm_points ds (tl result)
2e07cd051ff9 added absolute_path
clasohm
parents: 1407
diff changeset
   823
        | rm_points ("."::ds) result = rm_points ds result
2e07cd051ff9 added absolute_path
clasohm
parents: 1407
diff changeset
   824
        | rm_points (d::ds) result = rm_points ds (d::result);
2e07cd051ff9 added absolute_path
clasohm
parents: 1407
diff changeset
   825
  in if file = "" then ""
2e07cd051ff9 added absolute_path
clasohm
parents: 1407
diff changeset
   826
     else if hd (explode file) = "/" then file
2e07cd051ff9 added absolute_path
clasohm
parents: 1407
diff changeset
   827
     else "/" ^ space_implode "/"
2e07cd051ff9 added absolute_path
clasohm
parents: 1407
diff changeset
   828
                  (rm_points (space_explode "/" (tack_on cwd file)) [])
2e07cd051ff9 added absolute_path
clasohm
parents: 1407
diff changeset
   829
  end;
2e07cd051ff9 added absolute_path
clasohm
parents: 1407
diff changeset
   830
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   831
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   832
(** misc functions **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   833
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   834
(*use the keyfun to make a list of (x, key) pairs*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   835
fun make_keylist (keyfun: 'a->'b) : 'a list -> ('a * 'b) list =
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   836
  let fun keypair x = (x, keyfun x)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   837
  in map keypair end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   838
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   839
(*given a list of (x, key) pairs and a searchkey
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   840
  return the list of xs from each pair whose key equals searchkey*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   841
fun keyfilter [] searchkey = []
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   842
  | keyfilter ((x, key) :: pairs) searchkey =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   843
      if key = searchkey then x :: keyfilter pairs searchkey
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   844
      else keyfilter pairs searchkey;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   845
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   846
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   847
(*Partition list into elements that satisfy predicate and those that don't.
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   848
  Preserves order of elements in both lists.*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   849
fun partition (pred: 'a->bool) (ys: 'a list) : ('a list * 'a list) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   850
    let fun part ([], answer) = answer
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   851
          | part (x::xs, (ys, ns)) = if pred(x)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   852
            then  part (xs, (x::ys, ns))
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   853
            else  part (xs, (ys, x::ns))
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   854
    in  part (rev ys, ([], []))  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   855
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   856
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   857
fun partition_eq (eq:'a * 'a -> bool) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   858
    let fun part [] = []
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   859
          | part (x::ys) = let val (xs, xs') = partition (apl(x, eq)) ys
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   860
                           in (x::xs)::(part xs') end
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   861
    in part end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   862
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   863
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   864
(*Partition a list into buckets  [ bi, b(i+1), ..., bj ]
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   865
   putting x in bk if p(k)(x) holds.  Preserve order of elements if possible.*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   866
fun partition_list p i j =
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   867
  let fun part k xs =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   868
            if k>j then
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   869
              (case xs of [] => []
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   870
                         | _ => raise LIST "partition_list")
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   871
            else
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   872
            let val (ns, rest) = partition (p k) xs;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   873
            in  ns :: part(k+1)rest  end
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   874
  in  part i end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   875
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   876
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   877
(* sorting *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   878
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   879
(*insertion sort; stable (does not reorder equal elements)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   880
  'less' is less-than test on type 'a*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   881
fun sort (less: 'a*'a -> bool) =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   882
  let fun insert (x, []) = [x]
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   883
        | insert (x, y::ys) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   884
              if less(y, x) then y :: insert (x, ys) else x::y::ys;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   885
      fun sort1 [] = []
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   886
        | sort1 (x::xs) = insert (x, sort1 xs)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   887
  in  sort1  end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   888
41
97aae241094b added cons, rcons, last_elem, sort_strings, take_suffix;
wenzelm
parents: 24
diff changeset
   889
(*sort strings*)
97aae241094b added cons, rcons, last_elem, sort_strings, take_suffix;
wenzelm
parents: 24
diff changeset
   890
val sort_strings = sort (op <= : string * string -> bool);
97aae241094b added cons, rcons, last_elem, sort_strings, take_suffix;
wenzelm
parents: 24
diff changeset
   891
97aae241094b added cons, rcons, last_elem, sort_strings, take_suffix;
wenzelm
parents: 24
diff changeset
   892
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   893
(* transitive closure (not Warshall's algorithm) *)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   894
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   895
fun transitive_closure [] = []
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   896
  | transitive_closure ((x, ys)::ps) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   897
      let val qs = transitive_closure ps
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   898
          val zs = foldl (fn (zs, y) => assocs qs y union zs) (ys, ys)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   899
          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
   900
      in (x, zs) :: map step qs end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   901
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   902
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   903
(* generating identifiers *)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   904
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   905
local
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   906
  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
   907
  and k0 = ord "0" and k9 = ord "9"
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   908
in
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   909
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   910
(*Increment a list of letters like a reversed base 26 number.
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   911
  If head is "z", bumps chars in tail.
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   912
  Digits are incremented as if they were integers.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   913
  "_" and "'" are not changed.
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   914
  For making variants of identifiers.*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   915
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   916
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
   917
        if k0 <= ord(c) andalso ord(c) < k9 then chr(ord(c)+1) :: cs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   918
        else "1" :: c :: cs
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   919
  | bump_int_list([]) = error("bump_int_list: not an identifier");
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   920
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   921
fun bump_list([], d) = [d]
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   922
  | bump_list(["'"], d) = [d, "'"]
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   923
  | bump_list("z"::cs, _) = "a" :: bump_list(cs, "a")
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   924
  | bump_list("Z"::cs, _) = "A" :: bump_list(cs, "A")
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   925
  | bump_list("9"::cs, _) = "0" :: bump_int_list cs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   926
  | bump_list(c::cs, _) = let val k = ord(c)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   927
        in if (a <= k andalso k < z) orelse (A <= k andalso k < Z) orelse
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   928
              (k0 <= k andalso k < k9) then chr(k+1) :: cs else
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   929
           if c="'" orelse c="_" then c :: bump_list(cs, "") else
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   930
                error("bump_list: not legal in identifier: " ^
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   931
                        implode(rev(c::cs)))
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   932
        end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   933
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   934
end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   935
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   936
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
   937
97aae241094b added cons, rcons, last_elem, sort_strings, take_suffix;
wenzelm
parents: 24
diff changeset
   938
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   939
(* lexical scanning *)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   940
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   941
(*scan a list of characters into "words" composed of "letters" (recognized by
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   942
  is_let) and separated by any number of non-"letters"*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   943
fun scanwords is_let cs =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   944
  let fun scan1 [] = []
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   945
        | scan1 cs =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   946
            let val (lets, rest) = take_prefix is_let cs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   947
            in implode lets :: scanwords is_let rest end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   948
  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
   949
1364
8ea1a962ad72 files now define a structure to allow SML/NJ to optimize the code
clasohm
parents: 1290
diff changeset
   950
end;
8ea1a962ad72 files now define a structure to allow SML/NJ to optimize the code
clasohm
parents: 1290
diff changeset
   951
1592
d89d5ff2397f maketest now closes the output file
paulson
parents: 1580
diff changeset
   952
(*Variable-branching trees: for proof terms*)
d89d5ff2397f maketest now closes the output file
paulson
parents: 1580
diff changeset
   953
datatype 'a mtree = Join of 'a * 'a mtree list;
d89d5ff2397f maketest now closes the output file
paulson
parents: 1580
diff changeset
   954
1364
8ea1a962ad72 files now define a structure to allow SML/NJ to optimize the code
clasohm
parents: 1290
diff changeset
   955
open Library;