src/Pure/library.ML
author wenzelm
Fri, 19 Dec 1997 10:17:04 +0100
changeset 4445 de74b549f976
parent 4363 b449831f03f4
child 4479 708d7c26db5b
permissions -rw-r--r--
added rev_order, make_ord; reimplemented sort function: stable version of quicksort;
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,
4212
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
     7
strings, lists as sets, association lists, generic tables, balanced
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
     8
trees, orders, diagnostics, timing, misc functions.
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
     9
*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    10
4212
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
    11
infix |> ~~ \ \\ ins ins_string ins_int orf andf prefix upto downto
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
    12
  mem mem_int mem_string union union_int union_string inter inter_int
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
    13
  inter_string subset subset_int subset_string;
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
(*application of (infix) operator to its left or right argument*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    31
fun apl (x, f) y = f (x, y);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    32
fun apr (f, y) x = f (x, y);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    33
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    34
(*function exponentiation: f(...(f x)...) with n applications of f*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    35
fun funpow n f x =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    36
  let fun rep (0, x) = x
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    37
        | rep (n, x) = rep (n - 1, f x)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    38
  in rep (n, x) end;
160
80ccb6c354ba added equal, not_equal: ''a -> ''a -> bool
wenzelm
parents: 41
diff changeset
    39
80ccb6c354ba added equal, not_equal: ''a -> ''a -> bool
wenzelm
parents: 41
diff changeset
    40
80ccb6c354ba added equal, not_equal: ''a -> ''a -> bool
wenzelm
parents: 41
diff changeset
    41
2471
09634c9cbf3c added stamp util;
wenzelm
parents: 2403
diff changeset
    42
(** stamps **)
09634c9cbf3c added stamp util;
wenzelm
parents: 2403
diff changeset
    43
09634c9cbf3c added stamp util;
wenzelm
parents: 2403
diff changeset
    44
type stamp = unit ref;
09634c9cbf3c added stamp util;
wenzelm
parents: 2403
diff changeset
    45
val stamp: unit -> stamp = ref;
09634c9cbf3c added stamp util;
wenzelm
parents: 2403
diff changeset
    46
09634c9cbf3c added stamp util;
wenzelm
parents: 2403
diff changeset
    47
09634c9cbf3c added stamp util;
wenzelm
parents: 2403
diff changeset
    48
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    49
(** options **)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    50
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    51
datatype 'a option = None | Some of 'a;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    52
4139
e1659fd7a221 fixed exception OPTION;
wenzelm
parents: 4102
diff changeset
    53
exception OPTION;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    54
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    55
fun the (Some x) = x
4139
e1659fd7a221 fixed exception OPTION;
wenzelm
parents: 4102
diff changeset
    56
  | the None = raise OPTION;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    57
4212
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
    58
(*strict!*)
255
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
    59
fun if_none None y = y
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
    60
  | if_none (Some x) _ = x;
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
    61
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    62
fun is_some (Some _) = true
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    63
  | is_some None = false;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    64
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    65
fun is_none (Some _) = false
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    66
  | is_none None = true;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    67
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    68
fun apsome f (Some x) = Some (f x)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    69
  | apsome _ None = None;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
    70
4139
e1659fd7a221 fixed exception OPTION;
wenzelm
parents: 4102
diff changeset
    71
(*handle partial functions*)
4181
wenzelm
parents: 4139
diff changeset
    72
fun can f x = (f x; true) handle _ => false;
4139
e1659fd7a221 fixed exception OPTION;
wenzelm
parents: 4102
diff changeset
    73
fun try f x = Some (f x) handle _ => None;
e1659fd7a221 fixed exception OPTION;
wenzelm
parents: 4102
diff changeset
    74
e1659fd7a221 fixed exception OPTION;
wenzelm
parents: 4102
diff changeset
    75
e1659fd7a221 fixed exception OPTION;
wenzelm
parents: 4102
diff changeset
    76
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    77
(** pairs **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    78
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    79
fun pair x y = (x, y);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    80
fun rpair x y = (y, x);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    81
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    82
fun fst (x, y) = x;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    83
fun snd (x, y) = y;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    84
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    85
fun eq_fst ((x1, _), (x2, _)) = x1 = x2;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    86
fun eq_snd ((_, y1), (_, y2)) = y1 = y2;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    87
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    88
fun swap (x, y) = (y, x);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    89
4212
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
    90
(*apply function to components*)
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    91
fun apfst f (x, y) = (f x, y);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    92
fun apsnd f (x, y) = (x, f y);
4212
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
    93
fun pairself f (x, y) = (f x, f y);
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    94
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    95
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    96
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    97
(** booleans **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    98
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
    99
(* equality *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   100
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   101
fun equal x y = x = y;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   102
fun not_equal x y = x <> y;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   103
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   104
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   105
(* operators for combining predicates *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   106
2175
21fde76bc742 Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents: 2157
diff changeset
   107
fun (p orf q) = fn x => p x orelse q x;
21fde76bc742 Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents: 2157
diff changeset
   108
fun (p andf q) = fn x => p x andalso q x;
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   109
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   110
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   111
(* predicates on lists *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   112
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   113
(*exists pred [x1, ..., xn] ===> pred x1 orelse ... orelse pred xn*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   114
fun exists (pred: 'a -> bool) : 'a list -> bool =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   115
  let fun boolf [] = false
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   116
        | boolf (x :: xs) = pred x orelse boolf xs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   117
  in boolf end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   118
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   119
(*forall pred [x1, ..., xn] ===> pred x1 andalso ... andalso pred xn*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   120
fun forall (pred: 'a -> bool) : 'a list -> bool =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   121
  let fun boolf [] = true
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   122
        | boolf (x :: xs) = pred x andalso boolf xs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   123
  in boolf end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   124
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   125
380
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   126
(* flags *)
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   127
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   128
fun set flag = (flag := true; true);
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   129
fun reset flag = (flag := false; false);
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   130
fun toggle flag = (flag := not (! flag); ! flag);
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   131
4212
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
   132
(*temporarily set flag, handling errors*)
2978
83a4c4f79dcd renamed set_ap to setmp;
wenzelm
parents: 2958
diff changeset
   133
fun setmp flag value f x =
2958
7837471d2f27 improved inc, dec;
wenzelm
parents: 2806
diff changeset
   134
  let
7837471d2f27 improved inc, dec;
wenzelm
parents: 2806
diff changeset
   135
    val orig_value = ! flag;
7837471d2f27 improved inc, dec;
wenzelm
parents: 2806
diff changeset
   136
    fun return y = (flag := orig_value; y);
7837471d2f27 improved inc, dec;
wenzelm
parents: 2806
diff changeset
   137
  in
7837471d2f27 improved inc, dec;
wenzelm
parents: 2806
diff changeset
   138
    flag := value;
7837471d2f27 improved inc, dec;
wenzelm
parents: 2806
diff changeset
   139
    return (f x handle exn => (return (); raise exn))
7837471d2f27 improved inc, dec;
wenzelm
parents: 2806
diff changeset
   140
  end;
7837471d2f27 improved inc, dec;
wenzelm
parents: 2806
diff changeset
   141
380
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   142
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   143
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   144
(** lists **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   145
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   146
exception LIST of string;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   147
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   148
fun null [] = true
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   149
  | null (_ :: _) = false;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   150
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   151
fun hd [] = raise LIST "hd"
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   152
  | hd (x :: _) = x;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   153
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   154
fun tl [] = raise LIST "tl"
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   155
  | tl (_ :: xs) = xs;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   156
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   157
fun cons x xs = x :: xs;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   158
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   159
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   160
(* fold *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   161
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   162
(*the following versions of fold are designed to fit nicely with infixes*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   163
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   164
(*  (op @) (e, [x1, ..., xn])  ===>  ((e @ x1) @ x2) ... @ xn
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   165
    for operators that associate to the left (TAIL RECURSIVE)*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   166
fun foldl (f: 'a * 'b -> 'a) : 'a * 'b list -> 'a =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   167
  let fun itl (e, [])  = e
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   168
        | itl (e, a::l) = itl (f(e, a), l)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   169
  in  itl end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   170
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   171
(*  (op @) ([x1, ..., xn], e)  ===>   x1 @ (x2 ... @ (xn @ e))
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   172
    for operators that associate to the right (not tail recursive)*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   173
fun foldr f (l, e) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   174
  let fun itr [] = e
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   175
        | itr (a::l) = f(a, itr l)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   176
  in  itr l  end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   177
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   178
(*  (op @) [x1, ..., xn]  ===>   x1 @ (x2 ... @ (x[n-1] @ xn))
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   179
    for n > 0, operators that associate to the right (not tail recursive)*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   180
fun foldr1 f l =
4181
wenzelm
parents: 4139
diff changeset
   181
  let fun itr [x] = x
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   182
        | itr (x::l) = f(x, itr l)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   183
  in  itr l  end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   184
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   185
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   186
(* basic list functions *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   187
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   188
(*length of a list, should unquestionably be a standard function*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   189
local fun length1 (n, [])  = n   (*TAIL RECURSIVE*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   190
        | length1 (n, x :: xs) = length1 (n + 1, xs)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   191
in  fun length l = length1 (0, l) end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   192
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   193
(*take the first n elements from a list*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   194
fun take (n, []) = []
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   195
  | take (n, x :: xs) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   196
      if n > 0 then x :: take (n - 1, xs) else [];
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   197
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   198
(*drop the first n elements from a list*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   199
fun drop (n, []) = []
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   200
  | drop (n, x :: xs) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   201
      if n > 0 then drop (n - 1, xs) else x :: xs;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   202
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   203
(*return nth element of a list, where 0 designates the first element;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   204
  raise EXCEPTION if list too short*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   205
fun nth_elem NL =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   206
  (case drop NL of
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   207
    [] => raise LIST "nth_elem"
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   208
  | x :: _ => x);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   209
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   210
(*last element of a list*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   211
fun last_elem [] = raise LIST "last_elem"
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   212
  | last_elem [x] = x
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   213
  | last_elem (_ :: xs) = last_elem xs;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   214
3762
f20b071a429a added split_last;
wenzelm
parents: 3699
diff changeset
   215
(*rear decomposition*)
f20b071a429a added split_last;
wenzelm
parents: 3699
diff changeset
   216
fun split_last [] = raise LIST "split_last"
f20b071a429a added split_last;
wenzelm
parents: 3699
diff changeset
   217
  | split_last [x] = ([], x)
f20b071a429a added split_last;
wenzelm
parents: 3699
diff changeset
   218
  | split_last (x :: xs) = apfst (cons x) (split_last xs);
f20b071a429a added split_last;
wenzelm
parents: 3699
diff changeset
   219
4212
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
   220
(*find the position of an element in a list*)
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
   221
fun find_index pred =
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
   222
  let fun find _ [] = ~1
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
   223
        | find n (x :: xs) = if pred x then n else find (n + 1) xs;
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
   224
  in find 0 end;
3762
f20b071a429a added split_last;
wenzelm
parents: 3699
diff changeset
   225
4224
79e205c3a82c made SML/NJ happy;
wenzelm
parents: 4212
diff changeset
   226
fun find_index_eq x = find_index (equal x);
4212
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
   227
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
   228
(*find first element satisfying predicate*)
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
   229
fun find_first _ [] = None
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
   230
  | find_first pred (x :: xs) =
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
   231
      if pred x then Some x else find_first pred xs;
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   232
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   233
(*flatten a list of lists to a list*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   234
fun flat (ls: 'c list list) : 'c list = foldr (op @) (ls, []);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   235
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   236
(*like Lisp's MAPC -- seq proc [x1, ..., xn] evaluates
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   237
  (proc x1; ...; proc xn) for side effects*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   238
fun seq (proc: 'a -> unit) : 'a list -> unit =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   239
  let fun seqf [] = ()
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   240
        | seqf (x :: xs) = (proc x; seqf xs)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   241
  in seqf end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   242
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   243
(*separate s [x1, x2, ..., xn]  ===>  [x1, s, x2, s, ..., s, xn]*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   244
fun separate s (x :: (xs as _ :: _)) = x :: s :: separate s xs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   245
  | separate _ xs = xs;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   246
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   247
(*make the list [x, x, ..., x] of length n*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   248
fun replicate n (x: 'a) : 'a list =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   249
  let fun rep (0, xs) = xs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   250
        | rep (n, xs) = rep (n - 1, x :: xs)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   251
  in
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   252
    if n < 0 then raise LIST "replicate"
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   253
    else rep (n, [])
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   254
  end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   255
4248
5e8a31c41d44 added get_error: 'a error -> string option, get_ok: 'a error -> 'a option;
wenzelm
parents: 4224
diff changeset
   256
(*multiply [a, b, c, ...] * [xs, ys, zs, ...]*)
5e8a31c41d44 added get_error: 'a error -> string option, get_ok: 'a error -> 'a option;
wenzelm
parents: 4224
diff changeset
   257
fun multiply ([], _) = []
5e8a31c41d44 added get_error: 'a error -> string option, get_ok: 'a error -> 'a option;
wenzelm
parents: 4224
diff changeset
   258
  | multiply (x :: xs, yss) = map (cons x) yss @ multiply (xs, yss);
5e8a31c41d44 added get_error: 'a error -> string option, get_ok: 'a error -> 'a option;
wenzelm
parents: 4224
diff changeset
   259
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   260
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   261
(* filter *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   262
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   263
(*copy the list preserving elements that satisfy the predicate*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   264
fun filter (pred: 'a->bool) : 'a list -> 'a list =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   265
  let fun filt [] = []
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   266
        | filt (x :: xs) = if pred x then x :: filt xs else filt xs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   267
  in filt end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   268
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   269
fun filter_out f = filter (not o f);
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   270
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   271
fun mapfilter (f: 'a -> 'b option) ([]: 'a list) = [] : 'b list
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   272
  | mapfilter f (x :: xs) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   273
      (case f x of
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   274
        None => mapfilter f xs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   275
      | Some y => y :: mapfilter f xs);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   276
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   277
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   278
(* lists of pairs *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   279
380
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   280
fun map2 _ ([], []) = []
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   281
  | 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
   282
  | map2 _ _ = raise LIST "map2";
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   283
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   284
fun exists2 _ ([], []) = false
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   285
  | 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
   286
  | exists2 _ _ = raise LIST "exists2";
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   287
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   288
fun forall2 _ ([], []) = true
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   289
  | 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
   290
  | forall2 _ _ = raise LIST "forall2";
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   291
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   292
(*combine two lists forming a list of pairs:
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   293
  [x1, ..., xn] ~~ [y1, ..., yn]  ===>  [(x1, y1), ..., (xn, yn)]*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   294
fun [] ~~ [] = []
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   295
  | (x :: xs) ~~ (y :: ys) = (x, y) :: (xs ~~ ys)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   296
  | _ ~~ _ = raise LIST "~~";
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   297
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   298
(*inverse of ~~; the old 'split':
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   299
  [(x1, y1), ..., (xn, yn)]  ===>  ([x1, ..., xn], [y1, ..., yn])*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   300
fun split_list (l: ('a * 'b) list) = (map #1 l, map #2 l);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   301
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   302
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   303
(* prefixes, suffixes *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   304
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   305
fun [] prefix _ = true
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   306
  | (x :: xs) prefix (y :: ys) = x = y andalso (xs prefix ys)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   307
  | _ prefix _ = false;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   308
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   309
(* [x1, ..., xi, ..., xn]  --->  ([x1, ..., x(i-1)], [xi, ..., xn])
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   310
   where xi is the first element that does not satisfy the predicate*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   311
fun take_prefix (pred : 'a -> bool)  (xs: 'a list) : 'a list * 'a list =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   312
  let fun take (rxs, []) = (rev rxs, [])
255
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   313
        | take (rxs, x :: xs) =
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   314
            if  pred x  then  take(x :: rxs, xs)  else  (rev rxs, x :: xs)
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   315
  in  take([], xs)  end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   316
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   317
(* [x1, ..., xi, ..., xn]  --->  ([x1, ..., xi], [x(i+1), ..., xn])
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   318
   where xi is the last element that does not satisfy the predicate*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   319
fun take_suffix _ [] = ([], [])
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   320
  | take_suffix pred (x :: xs) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   321
      (case take_suffix pred xs of
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   322
        ([], sffx) => if pred x then ([], x :: sffx) else ([x], sffx)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   323
      | (prfx, sffx) => (x :: prfx, sffx));
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   324
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   325
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   326
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   327
(** integers **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   328
2958
7837471d2f27 improved inc, dec;
wenzelm
parents: 2806
diff changeset
   329
fun inc i = (i := ! i + 1; ! i);
7837471d2f27 improved inc, dec;
wenzelm
parents: 2806
diff changeset
   330
fun dec i = (i := ! i - 1; ! i);
233
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
(* lists of integers *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   334
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   335
(*make the list [from, from + 1, ..., to]*)
2175
21fde76bc742 Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents: 2157
diff changeset
   336
fun (from upto to) =
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   337
  if from > to then [] else from :: ((from + 1) upto to);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   338
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   339
(*make the list [from, from - 1, ..., to]*)
2175
21fde76bc742 Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents: 2157
diff changeset
   340
fun (from downto to) =
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   341
  if from < to then [] else from :: ((from - 1) downto to);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   342
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   343
(*predicate: downto0 (is, n) <=> is = [n, n - 1, ..., 0]*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   344
fun downto0 (i :: is, n) = i = n andalso downto0 (is, n - 1)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   345
  | downto0 ([], n) = n = ~1;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   346
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   347
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   348
(* convert integers to strings *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   349
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   350
(*expand the number in the given base;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   351
  example: radixpand (2, 8) gives [1, 0, 0, 0]*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   352
fun radixpand (base, num) : int list =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   353
  let
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   354
    fun radix (n, tail) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   355
      if n < base then n :: tail
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   356
      else radix (n div base, (n mod base) :: tail)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   357
  in radix (num, []) end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   358
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   359
(*expands a number into a string of characters starting from "zerochar";
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   360
  example: radixstring (2, "0", 8) gives "1000"*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   361
fun radixstring (base, zerochar, num) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   362
  let val offset = ord zerochar;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   363
      fun chrof n = chr (offset + n)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   364
  in implode (map chrof (radixpand (base, num))) end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   365
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   366
3407
afd288caf573 Removal of radixstring from string_of_int; addition of string_of_indexname
paulson
parents: 3393
diff changeset
   367
val string_of_int = Int.toString;
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   368
3407
afd288caf573 Removal of radixstring from string_of_int; addition of string_of_indexname
paulson
parents: 3393
diff changeset
   369
fun string_of_indexname (a,0) = a
afd288caf573 Removal of radixstring from string_of_int; addition of string_of_indexname
paulson
parents: 3393
diff changeset
   370
  | string_of_indexname (a,i) = a ^ "_" ^ Int.toString i;
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   371
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   372
4212
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
   373
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   374
(** strings **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   375
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   376
fun is_letter ch =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   377
  ord "A" <= ord ch andalso ord ch <= ord "Z" orelse
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   378
  ord "a" <= ord ch andalso ord ch <= ord "z";
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   379
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   380
fun is_digit ch =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   381
  ord "0" <= ord ch andalso ord ch <= ord "9";
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   382
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   383
(*letter or _ or prime (')*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   384
fun is_quasi_letter "_" = true
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   385
  | is_quasi_letter "'" = true
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   386
  | is_quasi_letter ch = is_letter ch;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   387
512
55755ed9fab9 Pure/library/enclose, Pure/Syntax/pretty/enclose: renamed from parents
lcp
parents: 410
diff changeset
   388
(*white space: blanks, tabs, newlines, formfeeds*)
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   389
val is_blank : string -> bool =
3393
e31ac367387e is_blank: fixed space2;
wenzelm
parents: 3365
diff changeset
   390
  fn " " => true | "\t" => true | "\n" => true | "\^L" => true | "\160" => true
3063
963e3bf01799 is_blank: added space2 (160);
wenzelm
parents: 2978
diff changeset
   391
    | _ => false;
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   392
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   393
val is_letdig = is_quasi_letter orf is_digit;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   394
2196
1b36ebc70487 added is_printable: string -> bool;
wenzelm
parents: 2182
diff changeset
   395
(*printable chars*)
1b36ebc70487 added is_printable: string -> bool;
wenzelm
parents: 2182
diff changeset
   396
fun is_printable c = ord c > ord " " andalso ord c <= ord "~";
1b36ebc70487 added is_printable: string -> bool;
wenzelm
parents: 2182
diff changeset
   397
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   398
(*lower all chars of string*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   399
val to_lower =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   400
  let
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   401
    fun lower ch =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   402
      if ch >= "A" andalso ch <= "Z" then
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   403
        chr (ord ch - ord "A" + ord "a")
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   404
      else ch;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   405
  in implode o (map lower) o explode end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   406
512
55755ed9fab9 Pure/library/enclose, Pure/Syntax/pretty/enclose: renamed from parents
lcp
parents: 410
diff changeset
   407
(*enclose in brackets*)
55755ed9fab9 Pure/library/enclose, Pure/Syntax/pretty/enclose: renamed from parents
lcp
parents: 410
diff changeset
   408
fun enclose lpar rpar str = lpar ^ str ^ rpar;
255
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   409
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   410
(*simple quoting (does not escape special chars)*)
512
55755ed9fab9 Pure/library/enclose, Pure/Syntax/pretty/enclose: renamed from parents
lcp
parents: 410
diff changeset
   411
val quote = enclose "\"" "\"";
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   412
4212
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
   413
(*space_implode "..." (explode "hello") = "h...e...l...l...o"*)
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   414
fun space_implode a bs = implode (separate a bs);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   415
255
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   416
val commas = space_implode ", ";
380
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   417
val commas_quote = commas o map quote;
255
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   418
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   419
(*concatenate messages, one per line, into a string*)
255
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   420
val cat_lines = space_implode "\n";
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   421
4212
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
   422
(*space_explode "." "h.e..l.lo" = ["h", "e", "", "l", "lo"]*)
3832
17a20a2af8f5 fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents: 3762
diff changeset
   423
fun space_explode _ "" = []
17a20a2af8f5 fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents: 3762
diff changeset
   424
  | space_explode sep str =
17a20a2af8f5 fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents: 3762
diff changeset
   425
      let
17a20a2af8f5 fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents: 3762
diff changeset
   426
        fun expl chs =
17a20a2af8f5 fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents: 3762
diff changeset
   427
          (case take_prefix (not_equal sep) chs of
17a20a2af8f5 fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents: 3762
diff changeset
   428
            (cs, []) => [implode cs]
17a20a2af8f5 fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents: 3762
diff changeset
   429
          | (cs, _ :: cs') => implode cs :: expl cs');
17a20a2af8f5 fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents: 3762
diff changeset
   430
      in expl (explode str) end;
17a20a2af8f5 fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents: 3762
diff changeset
   431
17a20a2af8f5 fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents: 3762
diff changeset
   432
val split_lines = space_explode "\n";
17a20a2af8f5 fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents: 3762
diff changeset
   433
17a20a2af8f5 fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents: 3762
diff changeset
   434
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   435
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   436
(** lists as sets **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   437
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   438
(*membership in a list*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   439
fun x mem [] = false
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   440
  | x mem (y :: ys) = x = y orelse x mem ys;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   441
2175
21fde76bc742 Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents: 2157
diff changeset
   442
(*membership in a list, optimized version for ints*)
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   443
fun (x:int) mem_int [] = false
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   444
  | 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
   445
2175
21fde76bc742 Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents: 2157
diff changeset
   446
(*membership in a list, optimized version for strings*)
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   447
fun (x:string) mem_string [] = false
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   448
  | 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
   449
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   450
(*generalized membership test*)
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   451
fun gen_mem eq (x, []) = false
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   452
  | 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
   453
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   454
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   455
(*insertion into list if not already there*)
2175
21fde76bc742 Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents: 2157
diff changeset
   456
fun (x ins xs) = if x mem xs then xs else x :: xs;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   457
2175
21fde76bc742 Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents: 2157
diff changeset
   458
(*insertion into list, optimized version for ints*)
21fde76bc742 Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents: 2157
diff changeset
   459
fun (x ins_int xs) = if x mem_int xs then xs else x :: xs;
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   460
2175
21fde76bc742 Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents: 2157
diff changeset
   461
(*insertion into list, optimized version for strings*)
21fde76bc742 Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents: 2157
diff changeset
   462
fun (x ins_string xs) = if x mem_string xs then xs else x :: xs;
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   463
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   464
(*generalized insertion*)
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   465
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
   466
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   467
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   468
(*union of sets represented as lists: no repetitions*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   469
fun xs union [] = xs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   470
  | [] union ys = ys
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   471
  | (x :: xs) union ys = xs union (x ins ys);
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   472
2175
21fde76bc742 Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents: 2157
diff changeset
   473
(*union of sets, optimized version for ints*)
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   474
fun (xs:int list) union_int [] = xs
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   475
  | [] union_int ys = ys
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   476
  | (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
   477
2175
21fde76bc742 Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents: 2157
diff changeset
   478
(*union of sets, optimized version for strings*)
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   479
fun (xs:string list) union_string [] = xs
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   480
  | [] union_string ys = ys
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   481
  | (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
   482
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   483
(*generalized union*)
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   484
fun gen_union eq (xs, []) = xs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   485
  | gen_union eq ([], ys) = ys
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   486
  | 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
   487
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   488
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   489
(*intersection*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   490
fun [] inter ys = []
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   491
  | (x :: xs) inter ys =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   492
      if x mem ys then x :: (xs inter ys) else xs inter ys;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   493
2175
21fde76bc742 Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents: 2157
diff changeset
   494
(*intersection, optimized version for ints*)
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   495
fun ([]:int list) inter_int ys = []
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   496
  | (x :: xs) inter_int ys =
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   497
      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
   498
2175
21fde76bc742 Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents: 2157
diff changeset
   499
(*intersection, optimized version for strings *)
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   500
fun ([]:string list) inter_string ys = []
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   501
  | (x :: xs) inter_string ys =
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   502
      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
   503
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   504
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   505
(*subset*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   506
fun [] subset ys = true
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   507
  | (x :: xs) subset ys = x mem ys andalso xs subset ys;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   508
2175
21fde76bc742 Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents: 2157
diff changeset
   509
(*subset, optimized version for ints*)
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   510
fun ([]:int list) subset_int ys = true
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   511
  | (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
   512
2175
21fde76bc742 Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents: 2157
diff changeset
   513
(*subset, optimized version for strings*)
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   514
fun ([]:string list) subset_string ys = true
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   515
  | (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
   516
4363
b449831f03f4 added eq_set;
wenzelm
parents: 4343
diff changeset
   517
(*set equality*)
b449831f03f4 added eq_set;
wenzelm
parents: 4343
diff changeset
   518
fun eq_set (xs, ys) =
b449831f03f4 added eq_set;
wenzelm
parents: 4343
diff changeset
   519
  xs = ys orelse (xs subset ys andalso ys subset xs);
b449831f03f4 added eq_set;
wenzelm
parents: 4343
diff changeset
   520
2182
29e56f003599 Removal of polymorphic equality via mem, subset, eq_set, etc
paulson
parents: 2175
diff changeset
   521
(*set equality for strings*)
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   522
fun eq_set_string ((xs:string list), ys) =
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   523
  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
   524
2182
29e56f003599 Removal of polymorphic equality via mem, subset, eq_set, etc
paulson
parents: 2175
diff changeset
   525
fun gen_subset eq (xs, ys) = forall (fn x => gen_mem eq (x, ys)) xs;
29e56f003599 Removal of polymorphic equality via mem, subset, eq_set, etc
paulson
parents: 2175
diff changeset
   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
2243
3ebeaaacfbd1 Eta-expanded some declarations that are illegal under value polymorphism
paulson
parents: 2196
diff changeset
   532
fun ys \\ xs = foldl (op \) (ys,xs);
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
2243
3ebeaaacfbd1 Eta-expanded some declarations that are illegal under value polymorphism
paulson
parents: 2196
diff changeset
   537
fun gen_rems eq = foldl (gen_rem eq);
233
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
2243
3ebeaaacfbd1 Eta-expanded some declarations that are illegal under value polymorphism
paulson
parents: 2196
diff changeset
   554
fun distinct l = gen_distinct (op =) l;
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   555
4102
f746af27164b added distinct_fst_string;
wenzelm
parents: 4063
diff changeset
   556
(*tuned version of distinct -- eq wrt. strings in fst component*)
f746af27164b added distinct_fst_string;
wenzelm
parents: 4063
diff changeset
   557
fun distinct_fst_string lst =
f746af27164b added distinct_fst_string;
wenzelm
parents: 4063
diff changeset
   558
  let
f746af27164b added distinct_fst_string;
wenzelm
parents: 4063
diff changeset
   559
    fun mem_str ((_:string, _), []) = false
f746af27164b added distinct_fst_string;
wenzelm
parents: 4063
diff changeset
   560
      | mem_str (p as (x, _), ((y, _) :: qs)) = x = y orelse mem_str (p, qs);
f746af27164b added distinct_fst_string;
wenzelm
parents: 4063
diff changeset
   561
f746af27164b added distinct_fst_string;
wenzelm
parents: 4063
diff changeset
   562
    fun dist (rev_seen, []) = rev rev_seen
f746af27164b added distinct_fst_string;
wenzelm
parents: 4063
diff changeset
   563
      | dist (rev_seen, p :: ps) =
f746af27164b added distinct_fst_string;
wenzelm
parents: 4063
diff changeset
   564
          if mem_str (p, rev_seen) then dist (rev_seen, ps)
f746af27164b added distinct_fst_string;
wenzelm
parents: 4063
diff changeset
   565
          else dist (p :: rev_seen, ps);
f746af27164b added distinct_fst_string;
wenzelm
parents: 4063
diff changeset
   566
  in
f746af27164b added distinct_fst_string;
wenzelm
parents: 4063
diff changeset
   567
    dist ([], lst)
f746af27164b added distinct_fst_string;
wenzelm
parents: 4063
diff changeset
   568
  end;
f746af27164b added distinct_fst_string;
wenzelm
parents: 4063
diff changeset
   569
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   570
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   571
(*returns the tail beginning with the first repeated element, or []*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   572
fun findrep [] = []
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   573
  | findrep (x :: xs) = if x mem xs then x :: xs else findrep xs;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   574
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   575
255
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   576
(*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
   577
  order, takes first of equal elements*)
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   578
fun gen_duplicates eq lst =
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   579
  let
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   580
    val memb = gen_mem eq;
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   581
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   582
    fun dups (rev_dups, []) = rev rev_dups
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   583
      | dups (rev_dups, x :: xs) =
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   584
          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
   585
            dups (rev_dups, xs)
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   586
          else dups (x :: rev_dups, xs);
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   587
  in
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   588
    dups ([], lst)
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   589
  end;
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   590
2243
3ebeaaacfbd1 Eta-expanded some declarations that are illegal under value polymorphism
paulson
parents: 2196
diff changeset
   591
fun duplicates l = gen_duplicates (op =) l;
255
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   592
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   593
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   594
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   595
(** association lists **)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   596
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   597
(*association list lookup*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   598
fun assoc ([], key) = None
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   599
  | assoc ((keyi, xi) :: pairs, key) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   600
      if key = keyi then Some xi else assoc (pairs, key);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   601
2175
21fde76bc742 Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents: 2157
diff changeset
   602
(*association list lookup, optimized version for ints*)
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   603
fun assoc_int ([], (key:int)) = None
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   604
  | assoc_int ((keyi, xi) :: pairs, key) =
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   605
      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
   606
2175
21fde76bc742 Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents: 2157
diff changeset
   607
(*association list lookup, optimized version for strings*)
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   608
fun assoc_string ([], (key:string)) = None
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   609
  | assoc_string ((keyi, xi) :: pairs, key) =
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   610
      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
   611
2175
21fde76bc742 Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents: 2157
diff changeset
   612
(*association list lookup, optimized version for string*ints*)
1576
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   613
fun assoc_string_int ([], (key:string*int)) = None
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   614
  | assoc_string_int ((keyi, xi) :: pairs, key) =
af8f43f742a0 Added some optimized versions of functions dealing with sets
berghofe
parents: 1460
diff changeset
   615
      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
   616
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   617
fun assocs ps x =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   618
  (case assoc (ps, x) of
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   619
    None => []
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   620
  | Some ys => ys);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   621
255
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   622
(*two-fold association list lookup*)
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   623
fun assoc2 (aal, (key1, key2)) =
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   624
  (case assoc (aal, key1) of
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   625
    Some al => assoc (al, key2)
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   626
  | None => None);
ee132db91681 added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents: 245
diff changeset
   627
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   628
(*generalized association list lookup*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   629
fun gen_assoc eq ([], key) = None
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   630
  | gen_assoc eq ((keyi, xi) :: pairs, key) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   631
      if eq (key, keyi) then Some xi else gen_assoc eq (pairs, key);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   632
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   633
(*association list update*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   634
fun overwrite (al, p as (key, _)) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   635
  let fun over ((q as (keyi, _)) :: pairs) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   636
            if keyi = key then p :: pairs else q :: (over pairs)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   637
        | over [] = [p]
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   638
  in over al end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   639
2522
a1a18530c4ac added gen_overwrite;
wenzelm
parents: 2506
diff changeset
   640
fun gen_overwrite eq (al, p as (key, _)) =
a1a18530c4ac added gen_overwrite;
wenzelm
parents: 2506
diff changeset
   641
  let fun over ((q as (keyi, _)) :: pairs) =
a1a18530c4ac added gen_overwrite;
wenzelm
parents: 2506
diff changeset
   642
            if eq (keyi, key) then p :: pairs else q :: (over pairs)
a1a18530c4ac added gen_overwrite;
wenzelm
parents: 2506
diff changeset
   643
        | over [] = [p]
a1a18530c4ac added gen_overwrite;
wenzelm
parents: 2506
diff changeset
   644
  in over al end;
a1a18530c4ac added gen_overwrite;
wenzelm
parents: 2506
diff changeset
   645
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   646
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   647
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   648
(** generic tables **)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   649
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   650
(*Tables are supposed to be 'efficient' encodings of lists of elements distinct
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   651
  wrt. an equality "eq". The extend and merge operations below are optimized
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   652
  for long-term space efficiency.*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   653
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   654
(*append (new) elements to a table*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   655
fun generic_extend _ _ _ tab [] = tab
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   656
  | generic_extend eq dest_tab mk_tab tab1 lst2 =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   657
      let
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   658
        val lst1 = dest_tab tab1;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   659
        val new_lst2 = gen_rems eq (lst2, lst1);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   660
      in
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   661
        if null new_lst2 then tab1
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   662
        else mk_tab (lst1 @ new_lst2)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   663
      end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   664
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   665
(*append (new) elements of 2nd table to 1st table*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   666
fun generic_merge eq dest_tab mk_tab tab1 tab2 =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   667
  let
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   668
    val lst1 = dest_tab tab1;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   669
    val lst2 = dest_tab tab2;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   670
    val new_lst2 = gen_rems eq (lst2, lst1);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   671
  in
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   672
    if null new_lst2 then tab1
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   673
    else if gen_subset eq (lst1, lst2) then tab2
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   674
    else mk_tab (lst1 @ new_lst2)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   675
  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   676
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   677
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   678
(*lists as tables*)
2243
3ebeaaacfbd1 Eta-expanded some declarations that are illegal under value polymorphism
paulson
parents: 2196
diff changeset
   679
fun extend_list tab = generic_extend (op =) I I tab;
3ebeaaacfbd1 Eta-expanded some declarations that are illegal under value polymorphism
paulson
parents: 2196
diff changeset
   680
fun merge_lists tab = generic_merge (op =) I I tab;
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   681
380
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   682
fun merge_rev_lists xs [] = xs
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   683
  | merge_rev_lists [] ys = ys
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   684
  | merge_rev_lists xs (y :: ys) =
daca5b594fb3 added infix op also: 'a * ('a -> 'b) -> 'b;
wenzelm
parents: 265
diff changeset
   685
      (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
   686
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   687
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   688
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   689
(** balanced trees **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   690
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   691
exception Balance;      (*indicates non-positive argument to balancing fun*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   692
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   693
(*balanced folding; avoids deep nesting*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   694
fun fold_bal f [x] = x
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   695
  | fold_bal f [] = raise Balance
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   696
  | fold_bal f xs =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   697
      let val k = length xs div 2
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   698
      in  f (fold_bal f (take(k, xs)),
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   699
             fold_bal f (drop(k, xs)))
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   700
      end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   701
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   702
(*construct something of the form f(...g(...(x)...)) for balanced access*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   703
fun access_bal (f, g, x) n i =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   704
  let fun acc n i =     (*1<=i<=n*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   705
          if n=1 then x else
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   706
          let val n2 = n div 2
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   707
          in  if i<=n2 then f (acc n2 i)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   708
                       else g (acc (n-n2) (i-n2))
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   709
          end
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   710
  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
   711
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   712
(*construct ALL such accesses; could try harder to share recursive calls!*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   713
fun accesses_bal (f, g, x) n =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   714
  let fun acc n =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   715
          if n=1 then [x] else
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   716
          let val n2 = n div 2
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   717
              val acc2 = acc n2
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   718
          in  if n-n2=n2 then map f acc2 @ map g acc2
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   719
                         else map f acc2 @ map g (acc (n-n2)) end
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   720
  in  if 1<=n then acc n else raise Balance  end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   721
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   722
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   723
2506
965127966331 added datatype order;
wenzelm
parents: 2471
diff changeset
   724
(** orders **)
965127966331 added datatype order;
wenzelm
parents: 2471
diff changeset
   725
965127966331 added datatype order;
wenzelm
parents: 2471
diff changeset
   726
datatype order = LESS | EQUAL | GREATER;
965127966331 added datatype order;
wenzelm
parents: 2471
diff changeset
   727
4445
de74b549f976 added rev_order, make_ord;
wenzelm
parents: 4363
diff changeset
   728
fun rev_order LESS = GREATER
de74b549f976 added rev_order, make_ord;
wenzelm
parents: 4363
diff changeset
   729
  | rev_order EQUAL = EQUAL
de74b549f976 added rev_order, make_ord;
wenzelm
parents: 4363
diff changeset
   730
  | rev_order GREATER = LESS;
de74b549f976 added rev_order, make_ord;
wenzelm
parents: 4363
diff changeset
   731
de74b549f976 added rev_order, make_ord;
wenzelm
parents: 4363
diff changeset
   732
fun make_ord rel (x, y) =
de74b549f976 added rev_order, make_ord;
wenzelm
parents: 4363
diff changeset
   733
  if rel (x, y) then LESS
de74b549f976 added rev_order, make_ord;
wenzelm
parents: 4363
diff changeset
   734
  else if rel (y, x) then GREATER
de74b549f976 added rev_order, make_ord;
wenzelm
parents: 4363
diff changeset
   735
  else EQUAL;
de74b549f976 added rev_order, make_ord;
wenzelm
parents: 4363
diff changeset
   736
4343
9849fb57c395 added prod_ord, dict_ord, list_ord;
wenzelm
parents: 4326
diff changeset
   737
fun int_ord (i, j: int) =
2506
965127966331 added datatype order;
wenzelm
parents: 2471
diff changeset
   738
  if i < j then LESS
965127966331 added datatype order;
wenzelm
parents: 2471
diff changeset
   739
  else if i = j then EQUAL
965127966331 added datatype order;
wenzelm
parents: 2471
diff changeset
   740
  else GREATER;
965127966331 added datatype order;
wenzelm
parents: 2471
diff changeset
   741
4343
9849fb57c395 added prod_ord, dict_ord, list_ord;
wenzelm
parents: 4326
diff changeset
   742
fun string_ord (a, b: string) =
2506
965127966331 added datatype order;
wenzelm
parents: 2471
diff changeset
   743
  if a < b then LESS
965127966331 added datatype order;
wenzelm
parents: 2471
diff changeset
   744
  else if a = b then EQUAL
965127966331 added datatype order;
wenzelm
parents: 2471
diff changeset
   745
  else GREATER;
965127966331 added datatype order;
wenzelm
parents: 2471
diff changeset
   746
4343
9849fb57c395 added prod_ord, dict_ord, list_ord;
wenzelm
parents: 4326
diff changeset
   747
(*lexicographic product*)
9849fb57c395 added prod_ord, dict_ord, list_ord;
wenzelm
parents: 4326
diff changeset
   748
fun prod_ord a_ord b_ord ((x, y), (x', y')) =
9849fb57c395 added prod_ord, dict_ord, list_ord;
wenzelm
parents: 4326
diff changeset
   749
  (case a_ord (x, x') of EQUAL => b_ord (y, y') | ord => ord);
9849fb57c395 added prod_ord, dict_ord, list_ord;
wenzelm
parents: 4326
diff changeset
   750
9849fb57c395 added prod_ord, dict_ord, list_ord;
wenzelm
parents: 4326
diff changeset
   751
(*dictionary order -- in general NOT well-founded!*)
9849fb57c395 added prod_ord, dict_ord, list_ord;
wenzelm
parents: 4326
diff changeset
   752
fun dict_ord _ ([], []) = EQUAL
9849fb57c395 added prod_ord, dict_ord, list_ord;
wenzelm
parents: 4326
diff changeset
   753
  | dict_ord _ ([], _ :: _) = LESS
9849fb57c395 added prod_ord, dict_ord, list_ord;
wenzelm
parents: 4326
diff changeset
   754
  | dict_ord _ (_ :: _, []) = GREATER
9849fb57c395 added prod_ord, dict_ord, list_ord;
wenzelm
parents: 4326
diff changeset
   755
  | dict_ord elem_ord (x :: xs, y :: ys) =
9849fb57c395 added prod_ord, dict_ord, list_ord;
wenzelm
parents: 4326
diff changeset
   756
      (case elem_ord (x, y) of EQUAL => dict_ord elem_ord (xs, ys) | ord => ord);
9849fb57c395 added prod_ord, dict_ord, list_ord;
wenzelm
parents: 4326
diff changeset
   757
9849fb57c395 added prod_ord, dict_ord, list_ord;
wenzelm
parents: 4326
diff changeset
   758
(*lexicographic product of lists*)
9849fb57c395 added prod_ord, dict_ord, list_ord;
wenzelm
parents: 4326
diff changeset
   759
fun list_ord elem_ord (xs, ys) =
9849fb57c395 added prod_ord, dict_ord, list_ord;
wenzelm
parents: 4326
diff changeset
   760
  prod_ord int_ord (dict_ord elem_ord) ((length xs, xs), (length ys, ys));
9849fb57c395 added prod_ord, dict_ord, list_ord;
wenzelm
parents: 4326
diff changeset
   761
2506
965127966331 added datatype order;
wenzelm
parents: 2471
diff changeset
   762
965127966331 added datatype order;
wenzelm
parents: 2471
diff changeset
   763
3525
88edd3450460 improved output channels: normal, warning, error;
wenzelm
parents: 3407
diff changeset
   764
(** input / output and diagnostics **)
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   765
2243
3ebeaaacfbd1 Eta-expanded some declarations that are illegal under value polymorphism
paulson
parents: 2196
diff changeset
   766
val cd = OS.FileSys.chDir;
2317
672015b535d7 added pwd;
wenzelm
parents: 2303
diff changeset
   767
val pwd = OS.FileSys.getDir;
2243
3ebeaaacfbd1 Eta-expanded some declarations that are illegal under value polymorphism
paulson
parents: 2196
diff changeset
   768
3525
88edd3450460 improved output channels: normal, warning, error;
wenzelm
parents: 3407
diff changeset
   769
88edd3450460 improved output channels: normal, warning, error;
wenzelm
parents: 3407
diff changeset
   770
local
88edd3450460 improved output channels: normal, warning, error;
wenzelm
parents: 3407
diff changeset
   771
  fun out s =
88edd3450460 improved output channels: normal, warning, error;
wenzelm
parents: 3407
diff changeset
   772
    (TextIO.output (TextIO.stdOut, s); TextIO.flushOut TextIO.stdOut);
88edd3450460 improved output channels: normal, warning, error;
wenzelm
parents: 3407
diff changeset
   773
88edd3450460 improved output channels: normal, warning, error;
wenzelm
parents: 3407
diff changeset
   774
  fun prefix_lines prfx txt =
3832
17a20a2af8f5 fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents: 3762
diff changeset
   775
    txt |> split_lines |> map (fn s => prfx ^ s ^ "\n") |> implode;
3525
88edd3450460 improved output channels: normal, warning, error;
wenzelm
parents: 3407
diff changeset
   776
in
88edd3450460 improved output channels: normal, warning, error;
wenzelm
parents: 3407
diff changeset
   777
88edd3450460 improved output channels: normal, warning, error;
wenzelm
parents: 3407
diff changeset
   778
(*hooks for output channels: normal, warning, error*)
88edd3450460 improved output channels: normal, warning, error;
wenzelm
parents: 3407
diff changeset
   779
val prs_fn = ref (fn s => out s);
88edd3450460 improved output channels: normal, warning, error;
wenzelm
parents: 3407
diff changeset
   780
val warning_fn = ref (fn s => out (prefix_lines "### " s));
88edd3450460 improved output channels: normal, warning, error;
wenzelm
parents: 3407
diff changeset
   781
val error_fn = ref (fn s => out (prefix_lines "*** " s));
88edd3450460 improved output channels: normal, warning, error;
wenzelm
parents: 3407
diff changeset
   782
88edd3450460 improved output channels: normal, warning, error;
wenzelm
parents: 3407
diff changeset
   783
end;
1580
e3fd931e6095 Added some functions which allow redirection of Isabelle's output
berghofe
parents: 1576
diff changeset
   784
e3fd931e6095 Added some functions which allow redirection of Isabelle's output
berghofe
parents: 1576
diff changeset
   785
fun prs s = !prs_fn s;
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   786
fun writeln s = prs (s ^ "\n");
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   787
3525
88edd3450460 improved output channels: normal, warning, error;
wenzelm
parents: 3407
diff changeset
   788
fun warning s = !warning_fn s;
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   789
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   790
(*print error message and abort to top level*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   791
exception ERROR;
4212
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
   792
fun error_msg s = !error_fn s;	  (*promise to raise ERROR later!*)
3553
a148c7e7152e added error_msg;
wenzelm
parents: 3525
diff changeset
   793
fun error s = (error_msg s; raise ERROR);
a148c7e7152e added error_msg;
wenzelm
parents: 3525
diff changeset
   794
fun sys_error msg = (error_msg " !! SYSTEM ERROR !!\n"; error msg);
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   795
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   796
fun assert p msg = if p then () else error msg;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   797
fun deny p msg = if p then error msg else ();
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   798
544
c53386a5bcf1 Pure/library/assert_all: new, moved from ZF/ind_syntax.ML
lcp
parents: 512
diff changeset
   799
(*Assert pred for every member of l, generating a message if pred fails*)
4212
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
   800
fun assert_all pred l msg_fn =
544
c53386a5bcf1 Pure/library/assert_all: new, moved from ZF/ind_syntax.ML
lcp
parents: 512
diff changeset
   801
  let fun asl [] = ()
4212
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
   802
        | asl (x::xs) = if pred x then asl xs else error (msg_fn x)
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
   803
  in asl l end;
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   804
3624
36e19fce289e added read_file, write_file;
wenzelm
parents: 3606
diff changeset
   805
4212
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
   806
(* handle errors capturing messages *)
3699
7c30ab9e25d1 added handle_error: ('a -> 'b) -> 'a -> 'b error;
wenzelm
parents: 3645
diff changeset
   807
7c30ab9e25d1 added handle_error: ('a -> 'b) -> 'a -> 'b error;
wenzelm
parents: 3645
diff changeset
   808
datatype 'a error =
7c30ab9e25d1 added handle_error: ('a -> 'b) -> 'a -> 'b error;
wenzelm
parents: 3645
diff changeset
   809
  Error of string |
7c30ab9e25d1 added handle_error: ('a -> 'b) -> 'a -> 'b error;
wenzelm
parents: 3645
diff changeset
   810
  OK of 'a;
7c30ab9e25d1 added handle_error: ('a -> 'b) -> 'a -> 'b error;
wenzelm
parents: 3645
diff changeset
   811
4248
5e8a31c41d44 added get_error: 'a error -> string option, get_ok: 'a error -> 'a option;
wenzelm
parents: 4224
diff changeset
   812
fun get_error (Error msg) = Some msg
5e8a31c41d44 added get_error: 'a error -> string option, get_ok: 'a error -> 'a option;
wenzelm
parents: 4224
diff changeset
   813
  | get_error _ = None;
5e8a31c41d44 added get_error: 'a error -> string option, get_ok: 'a error -> 'a option;
wenzelm
parents: 4224
diff changeset
   814
5e8a31c41d44 added get_error: 'a error -> string option, get_ok: 'a error -> 'a option;
wenzelm
parents: 4224
diff changeset
   815
fun get_ok (OK x) = Some x
5e8a31c41d44 added get_error: 'a error -> string option, get_ok: 'a error -> 'a option;
wenzelm
parents: 4224
diff changeset
   816
  | get_ok _ = None;
5e8a31c41d44 added get_error: 'a error -> string option, get_ok: 'a error -> 'a option;
wenzelm
parents: 4224
diff changeset
   817
3699
7c30ab9e25d1 added handle_error: ('a -> 'b) -> 'a -> 'b error;
wenzelm
parents: 3645
diff changeset
   818
fun handle_error f x =
7c30ab9e25d1 added handle_error: ('a -> 'b) -> 'a -> 'b error;
wenzelm
parents: 3645
diff changeset
   819
  let
7c30ab9e25d1 added handle_error: ('a -> 'b) -> 'a -> 'b error;
wenzelm
parents: 3645
diff changeset
   820
    val buffer = ref "";
7c30ab9e25d1 added handle_error: ('a -> 'b) -> 'a -> 'b error;
wenzelm
parents: 3645
diff changeset
   821
    fun capture s = buffer := ! buffer ^ s ^ "\n";
7c30ab9e25d1 added handle_error: ('a -> 'b) -> 'a -> 'b error;
wenzelm
parents: 3645
diff changeset
   822
    val result = Some (setmp error_fn capture f x) handle ERROR => None;
7c30ab9e25d1 added handle_error: ('a -> 'b) -> 'a -> 'b error;
wenzelm
parents: 3645
diff changeset
   823
  in
4212
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
   824
    (case result of
3699
7c30ab9e25d1 added handle_error: ('a -> 'b) -> 'a -> 'b error;
wenzelm
parents: 3645
diff changeset
   825
      None => Error (! buffer)
4212
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
   826
    | Some y => OK y)
3624
36e19fce289e added read_file, write_file;
wenzelm
parents: 3606
diff changeset
   827
  end;
36e19fce289e added read_file, write_file;
wenzelm
parents: 3606
diff changeset
   828
36e19fce289e added read_file, write_file;
wenzelm
parents: 3606
diff changeset
   829
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   830
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   831
(** timing **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   832
4326
7211ea5f29e2 New timing functions startTiming and endTiming
paulson
parents: 4284
diff changeset
   833
(*a conditional timing function: applies f to () and, if the flag is true,
7211ea5f29e2 New timing functions startTiming and endTiming
paulson
parents: 4284
diff changeset
   834
  prints its runtime*)
7211ea5f29e2 New timing functions startTiming and endTiming
paulson
parents: 4284
diff changeset
   835
fun cond_timeit flag f =
7211ea5f29e2 New timing functions startTiming and endTiming
paulson
parents: 4284
diff changeset
   836
  if flag then
7211ea5f29e2 New timing functions startTiming and endTiming
paulson
parents: 4284
diff changeset
   837
    let val start = startTiming()
7211ea5f29e2 New timing functions startTiming and endTiming
paulson
parents: 4284
diff changeset
   838
        val result = f ()
7211ea5f29e2 New timing functions startTiming and endTiming
paulson
parents: 4284
diff changeset
   839
    in
7211ea5f29e2 New timing functions startTiming and endTiming
paulson
parents: 4284
diff changeset
   840
	writeln (endTiming start);  result
7211ea5f29e2 New timing functions startTiming and endTiming
paulson
parents: 4284
diff changeset
   841
    end
7211ea5f29e2 New timing functions startTiming and endTiming
paulson
parents: 4284
diff changeset
   842
  else f ();
7211ea5f29e2 New timing functions startTiming and endTiming
paulson
parents: 4284
diff changeset
   843
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   844
(*unconditional timing function*)
2243
3ebeaaacfbd1 Eta-expanded some declarations that are illegal under value polymorphism
paulson
parents: 2196
diff changeset
   845
fun timeit x = cond_timeit true x;
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   846
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   847
(*timed application function*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   848
fun timeap f x = timeit (fn () => f x);
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   849
3606
5d7073700fbc Added function "file_exists".
berghofe
parents: 3553
diff changeset
   850
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   851
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   852
(** misc functions **)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   853
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   854
(*use the keyfun to make a list of (x, key) pairs*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   855
fun make_keylist (keyfun: 'a->'b) : 'a list -> ('a * 'b) list =
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   856
  let fun keypair x = (x, keyfun x)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   857
  in map keypair end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   858
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   859
(*given a list of (x, key) pairs and a searchkey
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   860
  return the list of xs from each pair whose key equals searchkey*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   861
fun keyfilter [] searchkey = []
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   862
  | keyfilter ((x, key) :: pairs) searchkey =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   863
      if key = searchkey then x :: keyfilter pairs searchkey
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   864
      else keyfilter pairs searchkey;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   865
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   866
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   867
(*Partition list into elements that satisfy predicate and those that don't.
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   868
  Preserves order of elements in both lists.*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   869
fun partition (pred: 'a->bool) (ys: 'a list) : ('a list * 'a list) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   870
    let fun part ([], answer) = answer
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   871
          | part (x::xs, (ys, ns)) = if pred(x)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   872
            then  part (xs, (x::ys, ns))
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   873
            else  part (xs, (ys, x::ns))
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   874
    in  part (rev ys, ([], []))  end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   875
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   876
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   877
fun partition_eq (eq:'a * 'a -> bool) =
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   878
    let fun part [] = []
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   879
          | part (x::ys) = let val (xs, xs') = partition (apl(x, eq)) ys
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   880
                           in (x::xs)::(part xs') end
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   881
    in part end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   882
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   883
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   884
(*Partition a list into buckets  [ bi, b(i+1), ..., bj ]
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   885
   putting x in bk if p(k)(x) holds.  Preserve order of elements if possible.*)
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   886
fun partition_list p i j =
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   887
  let fun part k xs =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   888
            if k>j then
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   889
              (case xs of [] => []
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   890
                         | _ => raise LIST "partition_list")
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   891
            else
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   892
            let val (ns, rest) = partition (p k) xs;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   893
            in  ns :: part(k+1)rest  end
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   894
  in  part i end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   895
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   896
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   897
(* sorting *)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   898
4445
de74b549f976 added rev_order, make_ord;
wenzelm
parents: 4363
diff changeset
   899
(*quicksort (stable, i.e. does not reorder equal elements)*)
de74b549f976 added rev_order, make_ord;
wenzelm
parents: 4363
diff changeset
   900
fun sort ord =
de74b549f976 added rev_order, make_ord;
wenzelm
parents: 4363
diff changeset
   901
  let
de74b549f976 added rev_order, make_ord;
wenzelm
parents: 4363
diff changeset
   902
    fun qsort xs =
de74b549f976 added rev_order, make_ord;
wenzelm
parents: 4363
diff changeset
   903
      let val len = length xs in
de74b549f976 added rev_order, make_ord;
wenzelm
parents: 4363
diff changeset
   904
        if len <= 1 then xs
de74b549f976 added rev_order, make_ord;
wenzelm
parents: 4363
diff changeset
   905
        else
de74b549f976 added rev_order, make_ord;
wenzelm
parents: 4363
diff changeset
   906
          let val (lts, eqs, gts) = part (nth_elem (len div 2, xs)) xs in
de74b549f976 added rev_order, make_ord;
wenzelm
parents: 4363
diff changeset
   907
            qsort lts @ eqs @ qsort gts
de74b549f976 added rev_order, make_ord;
wenzelm
parents: 4363
diff changeset
   908
          end
de74b549f976 added rev_order, make_ord;
wenzelm
parents: 4363
diff changeset
   909
      end
de74b549f976 added rev_order, make_ord;
wenzelm
parents: 4363
diff changeset
   910
    and part _ [] = ([], [], [])
de74b549f976 added rev_order, make_ord;
wenzelm
parents: 4363
diff changeset
   911
      | part pivot (x :: xs) = add (ord (x, pivot)) x (part pivot xs)
de74b549f976 added rev_order, make_ord;
wenzelm
parents: 4363
diff changeset
   912
    and add LESS x (lts, eqs, gts) = (x :: lts, eqs, gts)
de74b549f976 added rev_order, make_ord;
wenzelm
parents: 4363
diff changeset
   913
      | add EQUAL x (lts, eqs, gts) = (lts, x :: eqs, gts)
de74b549f976 added rev_order, make_ord;
wenzelm
parents: 4363
diff changeset
   914
      | add GREATER x (lts, eqs, gts) = (lts, eqs, x :: gts);
de74b549f976 added rev_order, make_ord;
wenzelm
parents: 4363
diff changeset
   915
  in qsort end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   916
41
97aae241094b added cons, rcons, last_elem, sort_strings, take_suffix;
wenzelm
parents: 24
diff changeset
   917
(*sort strings*)
4445
de74b549f976 added rev_order, make_ord;
wenzelm
parents: 4363
diff changeset
   918
val sort_strings = sort string_ord;
de74b549f976 added rev_order, make_ord;
wenzelm
parents: 4363
diff changeset
   919
fun sort_wrt sel xs = sort (string_ord o pairself sel) xs;
41
97aae241094b added cons, rcons, last_elem, sort_strings, take_suffix;
wenzelm
parents: 24
diff changeset
   920
97aae241094b added cons, rcons, last_elem, sort_strings, take_suffix;
wenzelm
parents: 24
diff changeset
   921
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   922
(* transitive closure (not Warshall's algorithm) *)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   923
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   924
fun transitive_closure [] = []
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   925
  | transitive_closure ((x, ys)::ps) =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   926
      let val qs = transitive_closure ps
2182
29e56f003599 Removal of polymorphic equality via mem, subset, eq_set, etc
paulson
parents: 2175
diff changeset
   927
          val zs = foldl (fn (zs, y) => assocs qs y union_string zs) (ys, ys)
29e56f003599 Removal of polymorphic equality via mem, subset, eq_set, etc
paulson
parents: 2175
diff changeset
   928
          fun step(u, us) = (u, if x mem_string us then zs union_string us 
2243
3ebeaaacfbd1 Eta-expanded some declarations that are illegal under value polymorphism
paulson
parents: 2196
diff changeset
   929
                                else us)
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   930
      in (x, zs) :: map step qs end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   931
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   932
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   933
(* generating identifiers *)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   934
4063
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   935
(** Freshly generated identifiers; supplied prefix MUST start with a letter **)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   936
local
4063
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   937
(*Maps 0-63 to A-Z, a-z, 0-9 or _ or ' for generating random identifiers*)
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   938
fun char i =      if i<26 then chr (ord "A" + i)
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   939
	     else if i<52 then chr (ord "a" + i - 26)
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   940
	     else if i<62 then chr (ord"0" + i - 52)
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   941
	     else if i=62 then "_"
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   942
	     else  (*i=63*)    "'";
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   943
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   944
val charVec = Vector.tabulate (64, char);
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   945
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   946
fun newid n = 
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   947
  let 
4284
eb65491ae776 removed merge_opts;
wenzelm
parents: 4255
diff changeset
   948
  in  implode (map (fn i => Vector.sub(charVec,i)) (radixpand (64,n)))  end;
2003
b48f066d52dc Addition of gensym
paulson
parents: 1628
diff changeset
   949
4284
eb65491ae776 removed merge_opts;
wenzelm
parents: 4255
diff changeset
   950
val seedr = ref 0;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   951
4063
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   952
in
4284
eb65491ae776 removed merge_opts;
wenzelm
parents: 4255
diff changeset
   953
4063
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   954
fun init_gensym() = (seedr := 0);
2003
b48f066d52dc Addition of gensym
paulson
parents: 1628
diff changeset
   955
4284
eb65491ae776 removed merge_opts;
wenzelm
parents: 4255
diff changeset
   956
fun gensym pre = pre ^ (#1(newid (!seedr), inc seedr));
4063
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   957
end;
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   958
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   959
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   960
local
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   961
(*Identifies those character codes legal in identifiers.
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   962
  chould use Basis Library character functions if Poly/ML provided characters*)
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   963
fun idCode k = (ord "a" <= k andalso k < ord "z") orelse 
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   964
               (ord "A" <= k andalso k < ord "Z") orelse
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   965
               (ord "0" <= k andalso k < ord "9");
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   966
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   967
val idCodeVec = Vector.tabulate (256, idCode);
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   968
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   969
in
2003
b48f066d52dc Addition of gensym
paulson
parents: 1628
diff changeset
   970
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   971
(*Increment a list of letters like a reversed base 26 number.
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   972
  If head is "z", bumps chars in tail.
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   973
  Digits are incremented as if they were integers.
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   974
  "_" and "'" are not changed.
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   975
  For making variants of identifiers.*)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   976
4063
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   977
fun bump_int_list(c::cs) = 
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   978
	if c="9" then "0" :: bump_int_list cs 
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   979
	else
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   980
        if "0" <= c andalso c < "9" then chr(ord(c)+1) :: cs
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   981
        else "1" :: c :: cs
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   982
  | bump_int_list([]) = error("bump_int_list: not an identifier");
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   983
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   984
fun bump_list([], d) = [d]
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   985
  | bump_list(["'"], d) = [d, "'"]
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   986
  | bump_list("z"::cs, _) = "a" :: bump_list(cs, "a")
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   987
  | bump_list("Z"::cs, _) = "A" :: bump_list(cs, "A")
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   988
  | bump_list("9"::cs, _) = "0" :: bump_int_list cs
4063
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   989
  | bump_list(c::cs, _) = 
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   990
        let val k = ord(c)
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   991
        in if Vector.sub(idCodeVec,k) then chr(k+1) :: cs 
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   992
	   else
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   993
           if c="'" orelse c="_" then c :: bump_list(cs, "") 
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   994
	   else error("bump_list: not legal in identifier: " ^
0b19014b9155 Faster lexing
paulson
parents: 4046
diff changeset
   995
		      implode(rev(c::cs)))
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
   996
        end;
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   997
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   998
end;
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
   999
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
  1000
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
  1001
97aae241094b added cons, rcons, last_elem, sort_strings, take_suffix;
wenzelm
parents: 24
diff changeset
  1002
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
  1003
(* lexical scanning *)
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1004
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
  1005
(*scan a list of characters into "words" composed of "letters" (recognized by
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
  1006
  is_let) and separated by any number of non-"letters"*)
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
  1007
fun scanwords is_let cs =
0
a5a9c433f639 Initial revision
clasohm
parents:
diff changeset
  1008
  let fun scan1 [] = []
233
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
  1009
        | scan1 cs =
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
  1010
            let val (lets, rest) = take_prefix is_let cs
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
  1011
            in implode lets :: scanwords is_let rest end;
efd6b4bb14dd major cleanup and reorganisation;
wenzelm
parents: 205
diff changeset
  1012
  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
  1013
4212
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
  1014
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
  1015
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
  1016
(* Variable-branching trees: for proof terms etc. *)
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
  1017
datatype 'a mtree = Join of 'a * 'a mtree list;
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
  1018
68c7b37f8721 major cleanup;
wenzelm
parents: 4194
diff changeset
  1019
4255
63ab0616900b added type object = exn;
wenzelm
parents: 4248
diff changeset
  1020
(* generic objects -- fool the ML type system via exception constructors *)
63ab0616900b added type object = exn;
wenzelm
parents: 4248
diff changeset
  1021
type object = exn;
63ab0616900b added type object = exn;
wenzelm
parents: 4248
diff changeset
  1022
63ab0616900b added type object = exn;
wenzelm
parents: 4248
diff changeset
  1023
1364
8ea1a962ad72 files now define a structure to allow SML/NJ to optimize the code
clasohm
parents: 1290
diff changeset
  1024
end;
8ea1a962ad72 files now define a structure to allow SML/NJ to optimize the code
clasohm
parents: 1290
diff changeset
  1025
8ea1a962ad72 files now define a structure to allow SML/NJ to optimize the code
clasohm
parents: 1290
diff changeset
  1026
open Library;