src/Pure/library.ML
author wenzelm
Fri Jun 18 20:07:42 2004 +0200 (2004-06-18)
changeset 14968 9db3d2be8cdf
parent 14926 d2baf4b79424
child 14981 e73f8140af78
permissions -rw-r--r--
tuned exists_string;
wenzelm@41
     1
(*  Title:      Pure/library.ML
clasohm@0
     2
    ID:         $Id$
wenzelm@233
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
wenzelm@12284
     4
    Author:     Markus Wenzel, TU Munich
wenzelm@8806
     5
    License:    GPL (GNU GENERAL PUBLIC LICENSE)
clasohm@0
     6
wenzelm@233
     7
Basic library: functions, options, pairs, booleans, lists, integers,
wenzelm@14826
     8
rational numbers, strings, lists as sets, association lists, generic
wenzelm@14826
     9
tables, balanced trees, orders, current directory, misc.
clasohm@0
    10
*)
clasohm@0
    11
wenzelm@8418
    12
infix |> |>> |>>> ~~ \ \\ ins ins_string ins_int orf andf prefix upto downto
wenzelm@4212
    13
  mem mem_int mem_string union union_int union_string inter inter_int
wenzelm@4212
    14
  inter_string subset subset_int subset_string;
clasohm@1364
    15
wenzelm@6510
    16
infix 3 oo ooo oooo;
wenzelm@5893
    17
wenzelm@4621
    18
signature LIBRARY =
wenzelm@4621
    19
sig
wenzelm@4621
    20
  (*functions*)
wenzelm@4621
    21
  val curry: ('a * 'b -> 'c) -> 'a -> 'b -> 'c
wenzelm@4621
    22
  val uncurry: ('a -> 'b -> 'c) -> 'a * 'b -> 'c
wenzelm@4621
    23
  val I: 'a -> 'a
wenzelm@4621
    24
  val K: 'a -> 'b -> 'a
wenzelm@4621
    25
  val |> : 'a * ('a -> 'b) -> 'b
wenzelm@8418
    26
  val |>> : ('a * 'b) * ('a -> 'c) -> 'c * 'b
wenzelm@8418
    27
  val |>>> : ('a * 'b) * ('a -> 'c * 'd) -> 'c * ('b * 'd)
wenzelm@4621
    28
  val apl: 'a * ('a * 'b -> 'c) -> 'b -> 'c
wenzelm@4621
    29
  val apr: ('a * 'b -> 'c) * 'b -> 'a -> 'c
wenzelm@4621
    30
  val funpow: int -> ('a -> 'a) -> 'a -> 'a
wenzelm@5893
    31
  val oo: ('a -> 'b) * ('c -> 'd -> 'a) -> 'c -> 'd -> 'b
wenzelm@5893
    32
  val ooo: ('a -> 'b) * ('c -> 'd -> 'e -> 'a) -> 'c -> 'd -> 'e -> 'b
wenzelm@6510
    33
  val oooo: ('a -> 'b) * ('c -> 'd -> 'e -> 'f -> 'a) -> 'c -> 'd -> 'e -> 'f -> 'b
clasohm@1364
    34
wenzelm@4621
    35
  (*stamps*)
wenzelm@4621
    36
  type stamp
wenzelm@4621
    37
  val stamp: unit -> stamp
wenzelm@4621
    38
wenzelm@4621
    39
  (*options*)
wenzelm@4621
    40
  datatype 'a option = None | Some of 'a
wenzelm@4621
    41
  exception OPTION
wenzelm@4621
    42
  val the: 'a option -> 'a
wenzelm@4621
    43
  val if_none: 'a option -> 'a -> 'a
wenzelm@4621
    44
  val is_some: 'a option -> bool
wenzelm@4621
    45
  val is_none: 'a option -> bool
wenzelm@4621
    46
  val apsome: ('a -> 'b) -> 'a option -> 'b option
wenzelm@14826
    47
  exception ERROR
wenzelm@6959
    48
  val try: ('a -> 'b) -> 'a -> 'b option
wenzelm@4621
    49
  val can: ('a -> 'b) -> 'a -> bool
wenzelm@14868
    50
  datatype 'a result = Result of 'a | Exn of exn
wenzelm@14868
    51
  val capture: ('a -> 'b) -> 'a -> 'b result
wenzelm@14868
    52
  val release: 'a result -> 'a
wenzelm@14868
    53
  val get_result: 'a result -> 'a option
wenzelm@14868
    54
  val get_exn: 'a result -> exn option
wenzelm@4621
    55
wenzelm@4621
    56
  (*pairs*)
wenzelm@4621
    57
  val pair: 'a -> 'b -> 'a * 'b
wenzelm@4621
    58
  val rpair: 'a -> 'b -> 'b * 'a
wenzelm@4621
    59
  val fst: 'a * 'b -> 'a
wenzelm@4621
    60
  val snd: 'a * 'b -> 'b
wenzelm@4621
    61
  val eq_fst: (''a * 'b) * (''a * 'c) -> bool
wenzelm@4621
    62
  val eq_snd: ('a * ''b) * ('c * ''b) -> bool
wenzelm@4621
    63
  val swap: 'a * 'b -> 'b * 'a
wenzelm@4621
    64
  val apfst: ('a -> 'b) -> 'a * 'c -> 'b * 'c
wenzelm@4621
    65
  val apsnd: ('a -> 'b) -> 'c * 'a -> 'c * 'b
wenzelm@4621
    66
  val pairself: ('a -> 'b) -> 'a * 'a -> 'b * 'b
wenzelm@4621
    67
wenzelm@4621
    68
  (*booleans*)
wenzelm@4621
    69
  val equal: ''a -> ''a -> bool
wenzelm@4621
    70
  val not_equal: ''a -> ''a -> bool
wenzelm@4621
    71
  val orf: ('a -> bool) * ('a -> bool) -> 'a -> bool
wenzelm@4621
    72
  val andf: ('a -> bool) * ('a -> bool) -> 'a -> bool
wenzelm@4621
    73
  val exists: ('a -> bool) -> 'a list -> bool
wenzelm@4621
    74
  val forall: ('a -> bool) -> 'a list -> bool
wenzelm@4621
    75
  val set: bool ref -> bool
wenzelm@4621
    76
  val reset: bool ref -> bool
wenzelm@4621
    77
  val toggle: bool ref -> bool
wenzelm@9118
    78
  val change: 'a ref -> ('a -> 'a) -> unit
wenzelm@4621
    79
  val setmp: 'a ref -> 'a -> ('b -> 'c) -> 'b -> 'c
wenzelm@11853
    80
  val conditional: bool -> (unit -> unit) -> unit
wenzelm@4621
    81
wenzelm@4621
    82
  (*lists*)
wenzelm@4621
    83
  exception LIST of string
wenzelm@4621
    84
  val null: 'a list -> bool
wenzelm@4621
    85
  val hd: 'a list -> 'a
wenzelm@4621
    86
  val tl: 'a list -> 'a list
wenzelm@4621
    87
  val cons: 'a -> 'a list -> 'a list
wenzelm@5285
    88
  val single: 'a -> 'a list
wenzelm@4629
    89
  val append: 'a list -> 'a list -> 'a list
berghofe@13794
    90
  val rev_append: 'a list -> 'a list -> 'a list
wenzelm@5904
    91
  val apply: ('a -> 'a) list -> 'a -> 'a
wenzelm@4621
    92
  val foldl: ('a * 'b -> 'a) -> 'a * 'b list -> 'a
wenzelm@4621
    93
  val foldr: ('a * 'b -> 'b) -> 'a list * 'b -> 'b
wenzelm@4621
    94
  val foldr1: ('a * 'a -> 'a) -> 'a list -> 'a
wenzelm@14792
    95
  val fold: ('a -> 'b -> 'b) -> 'a list -> 'b -> 'b
wenzelm@4956
    96
  val foldl_map: ('a * 'b -> 'a * 'c) -> 'a * 'b list -> 'a * 'c list
oheimb@11002
    97
  val foldln: ('a * int -> 'b -> 'b) -> 'a list -> 'b -> 'b
wenzelm@4621
    98
  val length: 'a list -> int
wenzelm@4621
    99
  val take: int * 'a list -> 'a list
wenzelm@4621
   100
  val drop: int * 'a list -> 'a list
nipkow@13629
   101
  val splitAt: int * 'a list -> 'a list * 'a list
nipkow@4713
   102
  val dropwhile: ('a -> bool) -> 'a list -> 'a list
wenzelm@4621
   103
  val nth_elem: int * 'a list -> 'a
wenzelm@11773
   104
  val map_nth_elem: int -> ('a -> 'a) -> 'a list -> 'a list
wenzelm@4621
   105
  val last_elem: 'a list -> 'a
wenzelm@4621
   106
  val split_last: 'a list -> 'a list * 'a
wenzelm@4893
   107
  val nth_update: 'a -> int * 'a list -> 'a list
wenzelm@4621
   108
  val find_index: ('a -> bool) -> 'a list -> int
wenzelm@4621
   109
  val find_index_eq: ''a -> ''a list -> int
wenzelm@4621
   110
  val find_first: ('a -> bool) -> 'a list -> 'a option
wenzelm@4916
   111
  val get_first: ('a -> 'b option) -> 'a list -> 'b option
wenzelm@4621
   112
  val flat: 'a list list -> 'a list
wenzelm@12136
   113
  val unflat: 'a list list -> 'b list -> 'b list list
wenzelm@4621
   114
  val seq: ('a -> unit) -> 'a list -> unit
wenzelm@4621
   115
  val separate: 'a -> 'a list -> 'a list
wenzelm@4621
   116
  val replicate: int -> 'a -> 'a list
wenzelm@4621
   117
  val multiply: 'a list * 'a list list -> 'a list list
wenzelm@14792
   118
  val product: 'a list -> 'b list -> ('a * 'b) list
wenzelm@4621
   119
  val filter: ('a -> bool) -> 'a list -> 'a list
wenzelm@4621
   120
  val filter_out: ('a -> bool) -> 'a list -> 'a list
wenzelm@4621
   121
  val mapfilter: ('a -> 'b option) -> 'a list -> 'b list
wenzelm@4621
   122
  val map2: ('a * 'b -> 'c) -> 'a list * 'b list -> 'c list
wenzelm@4621
   123
  val exists2: ('a * 'b -> bool) -> 'a list * 'b list -> bool
wenzelm@4621
   124
  val forall2: ('a * 'b -> bool) -> 'a list * 'b list -> bool
wenzelm@4956
   125
  val seq2: ('a * 'b -> unit) -> 'a list * 'b list -> unit
wenzelm@4621
   126
  val ~~ : 'a list * 'b list -> ('a * 'b) list
wenzelm@4621
   127
  val split_list: ('a * 'b) list -> 'a list * 'b list
wenzelm@7468
   128
  val equal_lists: ('a * 'b -> bool) -> 'a list * 'b list -> bool
wenzelm@4621
   129
  val prefix: ''a list * ''a list -> bool
wenzelm@4621
   130
  val take_prefix: ('a -> bool) -> 'a list -> 'a list * 'a list
wenzelm@4621
   131
  val take_suffix: ('a -> bool) -> 'a list -> 'a list * 'a list
wenzelm@12249
   132
  val prefixes1: 'a list -> 'a list list
wenzelm@12249
   133
  val suffixes1: 'a list -> 'a list list
wenzelm@4621
   134
wenzelm@4621
   135
  (*integers*)
nipkow@10692
   136
  val gcd: int * int -> int
nipkow@10692
   137
  val lcm: int * int -> int
wenzelm@4621
   138
  val inc: int ref -> int
wenzelm@4621
   139
  val dec: int ref -> int
wenzelm@4621
   140
  val upto: int * int -> int list
wenzelm@4621
   141
  val downto: int * int -> int list
wenzelm@4621
   142
  val downto0: int list * int -> bool
wenzelm@4621
   143
  val radixpand: int * int -> int list
wenzelm@4621
   144
  val radixstring: int * string * int -> string
wenzelm@4621
   145
  val string_of_int: int -> string
wenzelm@4621
   146
  val string_of_indexname: string * int -> string
wenzelm@14826
   147
  val read_radixint: int * string list -> int * string list
wenzelm@14826
   148
  val read_int: string list -> int * string list
wenzelm@14826
   149
  val oct_char: string -> string
wenzelm@4621
   150
nipkow@10692
   151
  (*rational numbers*)
nipkow@10692
   152
  type rat
wenzelm@14826
   153
  exception RAT of string
nipkow@10692
   154
  val rep_rat: rat -> int * int
nipkow@10692
   155
  val ratadd: rat * rat -> rat
nipkow@10692
   156
  val ratmul: rat * rat -> rat
nipkow@10692
   157
  val ratinv: rat -> rat
nipkow@10692
   158
  val int_ratdiv: int * int -> rat
nipkow@10692
   159
  val ratneg: rat -> rat
nipkow@10692
   160
  val rat_of_int: int -> rat
nipkow@10692
   161
wenzelm@4621
   162
  (*strings*)
wenzelm@6312
   163
  val nth_elem_string: int * string -> string
wenzelm@6282
   164
  val foldl_string: ('a * string -> 'a) -> 'a * string -> 'a
wenzelm@6312
   165
  val exists_string: (string -> bool) -> string -> bool
wenzelm@4621
   166
  val enclose: string -> string -> string -> string
wenzelm@6642
   167
  val unenclose: string -> string
wenzelm@4621
   168
  val quote: string -> string
wenzelm@4621
   169
  val space_implode: string -> string list -> string
wenzelm@4621
   170
  val commas: string list -> string
wenzelm@4621
   171
  val commas_quote: string list -> string
wenzelm@4621
   172
  val cat_lines: string list -> string
wenzelm@4621
   173
  val space_explode: string -> string -> string list
wenzelm@14826
   174
  val split_lines: string -> string list
wenzelm@5942
   175
  val prefix_lines: string -> string -> string
wenzelm@7712
   176
  val untabify: string list -> string list
wenzelm@5285
   177
  val suffix: string -> string -> string
wenzelm@5285
   178
  val unsuffix: string -> string -> string
wenzelm@10951
   179
  val replicate_string: int -> string -> string
wenzelm@14926
   180
  val translate_string: (string -> string) -> string -> string
wenzelm@4621
   181
wenzelm@4621
   182
  (*lists as sets*)
wenzelm@4621
   183
  val mem: ''a * ''a list -> bool
wenzelm@4621
   184
  val mem_int: int * int list -> bool
wenzelm@4621
   185
  val mem_string: string * string list -> bool
wenzelm@4621
   186
  val gen_mem: ('a * 'b -> bool) -> 'a * 'b list -> bool
wenzelm@4621
   187
  val ins: ''a * ''a list -> ''a list
wenzelm@4621
   188
  val ins_int: int * int list -> int list
wenzelm@4621
   189
  val ins_string: string * string list -> string list
wenzelm@4621
   190
  val gen_ins: ('a * 'a -> bool) -> 'a * 'a list -> 'a list
wenzelm@4621
   191
  val union: ''a list * ''a list -> ''a list
wenzelm@4621
   192
  val union_int: int list * int list -> int list
wenzelm@4621
   193
  val union_string: string list * string list -> string list
wenzelm@4621
   194
  val gen_union: ('a * 'a -> bool) -> 'a list * 'a list -> 'a list
paulson@7090
   195
  val gen_inter: ('a * 'b -> bool) -> 'a list * 'b list -> 'a list
wenzelm@4621
   196
  val inter: ''a list * ''a list -> ''a list
wenzelm@4621
   197
  val inter_int: int list * int list -> int list
wenzelm@4621
   198
  val inter_string: string list * string list -> string list
wenzelm@4621
   199
  val subset: ''a list * ''a list -> bool
wenzelm@4621
   200
  val subset_int: int list * int list -> bool
wenzelm@4621
   201
  val subset_string: string list * string list -> bool
wenzelm@4621
   202
  val eq_set: ''a list * ''a list -> bool
wenzelm@4621
   203
  val eq_set_string: string list * string list -> bool
wenzelm@4621
   204
  val gen_subset: ('a * 'b -> bool) -> 'a list * 'b list -> bool
wenzelm@4621
   205
  val \ : ''a list * ''a -> ''a list
wenzelm@4621
   206
  val \\ : ''a list * ''a list -> ''a list
wenzelm@4621
   207
  val gen_rem: ('a * 'b -> bool) -> 'a list * 'b -> 'a list
wenzelm@4621
   208
  val gen_rems: ('a * 'b -> bool) -> 'a list * 'b list -> 'a list
wenzelm@4621
   209
  val gen_distinct: ('a * 'a -> bool) -> 'a list -> 'a list
wenzelm@4621
   210
  val distinct: ''a list -> ''a list
wenzelm@4621
   211
  val findrep: ''a list -> ''a list
wenzelm@4621
   212
  val gen_duplicates: ('a * 'a -> bool) -> 'a list -> 'a list
wenzelm@4621
   213
  val duplicates: ''a list -> ''a list
wenzelm@4621
   214
wenzelm@4621
   215
  (*association lists*)
wenzelm@4621
   216
  val assoc: (''a * 'b) list * ''a -> 'b option
wenzelm@4621
   217
  val assoc_int: (int * 'a) list * int -> 'a option
wenzelm@4621
   218
  val assoc_string: (string * 'a) list * string -> 'a option
wenzelm@4621
   219
  val assoc_string_int: ((string * int) * 'a) list * (string * int) -> 'a option
wenzelm@4621
   220
  val assocs: (''a * 'b list) list -> ''a -> 'b list
wenzelm@4621
   221
  val assoc2: (''a * (''b * 'c) list) list * (''a * ''b) -> 'c option
wenzelm@4621
   222
  val gen_assoc: ('a * 'b -> bool) -> ('b * 'c) list * 'a -> 'c option
wenzelm@4621
   223
  val overwrite: (''a * 'b) list * (''a * 'b) -> (''a * 'b) list
wenzelm@4621
   224
  val gen_overwrite: ('a * 'a -> bool) -> ('a * 'b) list * ('a * 'b) -> ('a * 'b) list
wenzelm@4621
   225
wenzelm@12284
   226
  (*lists as tables*)
wenzelm@12284
   227
  val gen_merge_lists: ('a * 'a -> bool) -> 'a list -> 'a list -> 'a list
wenzelm@12284
   228
  val gen_merge_lists': ('a * 'a -> bool) -> 'a list -> 'a list -> 'a list
wenzelm@4621
   229
  val merge_lists: ''a list -> ''a list -> ''a list
wenzelm@12284
   230
  val merge_lists': ''a list -> ''a list -> ''a list
wenzelm@4692
   231
  val merge_alists: (''a * 'b) list -> (''a * 'b) list -> (''a * 'b) list
wenzelm@4621
   232
wenzelm@4621
   233
  (*balanced trees*)
wenzelm@4621
   234
  exception Balance
wenzelm@4621
   235
  val fold_bal: ('a * 'a -> 'a) -> 'a list -> 'a
wenzelm@4621
   236
  val access_bal: ('a -> 'a) * ('a -> 'a) * 'a -> int -> int -> 'a
wenzelm@4621
   237
  val accesses_bal: ('a -> 'a) * ('a -> 'a) * 'a -> int -> 'a list
wenzelm@4621
   238
wenzelm@4621
   239
  (*orders*)
wenzelm@4621
   240
  val rev_order: order -> order
wenzelm@4621
   241
  val make_ord: ('a * 'a -> bool) -> 'a * 'a -> order
wenzelm@4621
   242
  val int_ord: int * int -> order
wenzelm@4621
   243
  val string_ord: string * string -> order
wenzelm@4621
   244
  val prod_ord: ('a * 'b -> order) -> ('c * 'd -> order) -> ('a * 'c) * ('b * 'd) -> order
wenzelm@4621
   245
  val dict_ord: ('a * 'b -> order) -> 'a list * 'b list -> order
wenzelm@4621
   246
  val list_ord: ('a * 'b -> order) -> 'a list * 'b list -> order
wenzelm@4621
   247
  val sort: ('a * 'a -> order) -> 'a list -> 'a list
wenzelm@4621
   248
  val sort_strings: string list -> string list
wenzelm@4621
   249
  val sort_wrt: ('a -> string) -> 'a list -> 'a list
berghofe@11514
   250
  val unique_strings: string list -> string list
wenzelm@4621
   251
berghofe@14106
   252
  (*random numbers*)
berghofe@14106
   253
  exception RANDOM
berghofe@14106
   254
  val random: unit -> real
berghofe@14106
   255
  val random_range: int -> int -> int
berghofe@14106
   256
  val one_of: 'a list -> 'a
berghofe@14106
   257
  val frequency: (int * 'a) list -> 'a
berghofe@14106
   258
wenzelm@14826
   259
  (*current directory*)
wenzelm@4621
   260
  val cd: string -> unit
wenzelm@4621
   261
  val pwd: unit -> string
wenzelm@4621
   262
wenzelm@4621
   263
  (*misc*)
wenzelm@4621
   264
  val make_keylist: ('a -> 'b) -> 'a list -> ('a * 'b) list
wenzelm@4621
   265
  val keyfilter: ('a * ''b) list -> ''b -> 'a list
wenzelm@4621
   266
  val partition: ('a -> bool) -> 'a list -> 'a list * 'a list
wenzelm@4621
   267
  val partition_eq: ('a * 'a -> bool) -> 'a list -> 'a list list
wenzelm@4621
   268
  val partition_list: (int -> 'a -> bool) -> int -> int -> 'a list -> 'a list list
wenzelm@4621
   269
  val gensym: string -> string
wenzelm@4621
   270
  val scanwords: (string -> bool) -> string list -> string list
wenzelm@4621
   271
end;
wenzelm@4621
   272
wenzelm@4621
   273
structure Library: LIBRARY =
clasohm@1364
   274
struct
clasohm@0
   275
wenzelm@4995
   276
wenzelm@233
   277
(** functions **)
clasohm@0
   278
wenzelm@233
   279
(*handy combinators*)
wenzelm@233
   280
fun curry f x y = f (x, y);
wenzelm@233
   281
fun uncurry f (x, y) = f x y;
wenzelm@233
   282
fun I x = x;
wenzelm@233
   283
fun K x y = x;
clasohm@0
   284
wenzelm@380
   285
(*reverse apply*)
wenzelm@410
   286
fun (x |> f) = f x;
wenzelm@8418
   287
fun ((x, y) |>> f) = (f x, y);
wenzelm@8418
   288
fun ((x, y) |>>> f) = let val (x', z) = f x in (x', (y, z)) end;
wenzelm@380
   289
wenzelm@233
   290
(*application of (infix) operator to its left or right argument*)
wenzelm@233
   291
fun apl (x, f) y = f (x, y);
wenzelm@233
   292
fun apr (f, y) x = f (x, y);
clasohm@0
   293
wenzelm@233
   294
(*function exponentiation: f(...(f x)...) with n applications of f*)
wenzelm@233
   295
fun funpow n f x =
wenzelm@233
   296
  let fun rep (0, x) = x
wenzelm@233
   297
        | rep (n, x) = rep (n - 1, f x)
wenzelm@233
   298
  in rep (n, x) end;
wenzelm@160
   299
wenzelm@5893
   300
(*concatenation: 2 and 3 args*)
wenzelm@5893
   301
fun (f oo g) x y = f (g x y);
wenzelm@5893
   302
fun (f ooo g) x y z = f (g x y z);
wenzelm@6510
   303
fun (f oooo g) x y z w = f (g x y z w);
wenzelm@6510
   304
wenzelm@160
   305
wenzelm@160
   306
wenzelm@2471
   307
(** stamps **)
wenzelm@2471
   308
wenzelm@2471
   309
type stamp = unit ref;
wenzelm@2471
   310
val stamp: unit -> stamp = ref;
wenzelm@2471
   311
wenzelm@2471
   312
wenzelm@2471
   313
wenzelm@233
   314
(** options **)
clasohm@0
   315
clasohm@0
   316
datatype 'a option = None | Some of 'a;
clasohm@0
   317
wenzelm@4139
   318
exception OPTION;
clasohm@0
   319
clasohm@0
   320
fun the (Some x) = x
wenzelm@4139
   321
  | the None = raise OPTION;
clasohm@0
   322
wenzelm@4212
   323
(*strict!*)
wenzelm@255
   324
fun if_none None y = y
wenzelm@255
   325
  | if_none (Some x) _ = x;
wenzelm@255
   326
clasohm@0
   327
fun is_some (Some _) = true
clasohm@0
   328
  | is_some None = false;
clasohm@0
   329
clasohm@0
   330
fun is_none (Some _) = false
clasohm@0
   331
  | is_none None = true;
clasohm@0
   332
wenzelm@233
   333
fun apsome f (Some x) = Some (f x)
wenzelm@233
   334
  | apsome _ None = None;
clasohm@0
   335
wenzelm@6959
   336
wenzelm@6959
   337
(* exception handling *)
wenzelm@6959
   338
wenzelm@6959
   339
exception ERROR;
wenzelm@6959
   340
wenzelm@6959
   341
fun try f x = Some (f x)
wenzelm@6959
   342
  handle Interrupt => raise Interrupt | ERROR => raise ERROR | _ => None;
wenzelm@6959
   343
wenzelm@6959
   344
fun can f x = is_some (try f x);
wenzelm@4139
   345
wenzelm@4139
   346
wenzelm@14868
   347
datatype 'a result =
wenzelm@14868
   348
  Result of 'a |
wenzelm@14868
   349
  Exn of exn;
wenzelm@14868
   350
wenzelm@14868
   351
fun capture f x = Result (f x) handle e => Exn e;
wenzelm@14868
   352
wenzelm@14868
   353
fun release (Result y) = y
wenzelm@14868
   354
  | release (Exn e) = raise e;
wenzelm@14868
   355
wenzelm@14868
   356
fun get_result (Result x) = Some x
wenzelm@14868
   357
  | get_result _ = None;
wenzelm@14868
   358
wenzelm@14868
   359
fun get_exn (Exn exn) = Some exn
wenzelm@14868
   360
  | get_exn _ = None;
wenzelm@14868
   361
wenzelm@14868
   362
wenzelm@4139
   363
wenzelm@233
   364
(** pairs **)
wenzelm@233
   365
wenzelm@233
   366
fun pair x y = (x, y);
wenzelm@233
   367
fun rpair x y = (y, x);
wenzelm@233
   368
wenzelm@233
   369
fun fst (x, y) = x;
wenzelm@233
   370
fun snd (x, y) = y;
wenzelm@233
   371
wenzelm@233
   372
fun eq_fst ((x1, _), (x2, _)) = x1 = x2;
wenzelm@233
   373
fun eq_snd ((_, y1), (_, y2)) = y1 = y2;
wenzelm@233
   374
wenzelm@233
   375
fun swap (x, y) = (y, x);
wenzelm@233
   376
wenzelm@4212
   377
(*apply function to components*)
wenzelm@233
   378
fun apfst f (x, y) = (f x, y);
wenzelm@233
   379
fun apsnd f (x, y) = (x, f y);
wenzelm@4212
   380
fun pairself f (x, y) = (f x, f y);
wenzelm@233
   381
wenzelm@233
   382
wenzelm@233
   383
wenzelm@233
   384
(** booleans **)
wenzelm@233
   385
wenzelm@233
   386
(* equality *)
wenzelm@233
   387
wenzelm@233
   388
fun equal x y = x = y;
wenzelm@233
   389
fun not_equal x y = x <> y;
wenzelm@233
   390
wenzelm@233
   391
wenzelm@233
   392
(* operators for combining predicates *)
wenzelm@233
   393
paulson@2175
   394
fun (p orf q) = fn x => p x orelse q x;
paulson@2175
   395
fun (p andf q) = fn x => p x andalso q x;
wenzelm@233
   396
wenzelm@233
   397
wenzelm@233
   398
(* predicates on lists *)
wenzelm@233
   399
wenzelm@233
   400
(*exists pred [x1, ..., xn] ===> pred x1 orelse ... orelse pred xn*)
wenzelm@233
   401
fun exists (pred: 'a -> bool) : 'a list -> bool =
wenzelm@233
   402
  let fun boolf [] = false
wenzelm@233
   403
        | boolf (x :: xs) = pred x orelse boolf xs
wenzelm@233
   404
  in boolf end;
wenzelm@233
   405
wenzelm@233
   406
(*forall pred [x1, ..., xn] ===> pred x1 andalso ... andalso pred xn*)
wenzelm@233
   407
fun forall (pred: 'a -> bool) : 'a list -> bool =
wenzelm@233
   408
  let fun boolf [] = true
wenzelm@233
   409
        | boolf (x :: xs) = pred x andalso boolf xs
wenzelm@233
   410
  in boolf end;
clasohm@0
   411
wenzelm@233
   412
wenzelm@380
   413
(* flags *)
wenzelm@380
   414
wenzelm@380
   415
fun set flag = (flag := true; true);
wenzelm@380
   416
fun reset flag = (flag := false; false);
wenzelm@380
   417
fun toggle flag = (flag := not (! flag); ! flag);
wenzelm@380
   418
wenzelm@9118
   419
fun change r f = r := f (! r);
wenzelm@9118
   420
wenzelm@14826
   421
(*temporarily set flag, handling exceptions*)
wenzelm@2978
   422
fun setmp flag value f x =
wenzelm@2958
   423
  let
wenzelm@2958
   424
    val orig_value = ! flag;
wenzelm@2958
   425
    fun return y = (flag := orig_value; y);
wenzelm@2958
   426
  in
wenzelm@2958
   427
    flag := value;
wenzelm@2958
   428
    return (f x handle exn => (return (); raise exn))
wenzelm@2958
   429
  end;
wenzelm@2958
   430
wenzelm@380
   431
wenzelm@11853
   432
(* conditional execution *)
wenzelm@11853
   433
wenzelm@11853
   434
fun conditional b f = if b then f () else ();
wenzelm@11853
   435
wenzelm@11853
   436
wenzelm@233
   437
wenzelm@233
   438
(** lists **)
wenzelm@233
   439
wenzelm@233
   440
exception LIST of string;
wenzelm@233
   441
wenzelm@233
   442
fun null [] = true
wenzelm@233
   443
  | null (_ :: _) = false;
wenzelm@233
   444
wenzelm@233
   445
fun hd [] = raise LIST "hd"
wenzelm@233
   446
  | hd (x :: _) = x;
wenzelm@233
   447
wenzelm@233
   448
fun tl [] = raise LIST "tl"
wenzelm@233
   449
  | tl (_ :: xs) = xs;
wenzelm@233
   450
wenzelm@233
   451
fun cons x xs = x :: xs;
wenzelm@5285
   452
fun single x = [x];
wenzelm@233
   453
wenzelm@4629
   454
fun append xs ys = xs @ ys;
wenzelm@4629
   455
berghofe@13794
   456
(* tail recursive version *)
berghofe@13794
   457
fun rev_append [] ys = ys
berghofe@13794
   458
  | rev_append (x :: xs) ys = rev_append xs (x :: ys);
berghofe@13794
   459
wenzelm@5904
   460
fun apply [] x = x
wenzelm@5904
   461
  | apply (f :: fs) x = apply fs (f x);
wenzelm@5904
   462
wenzelm@233
   463
wenzelm@233
   464
(* fold *)
wenzelm@233
   465
wenzelm@233
   466
(*the following versions of fold are designed to fit nicely with infixes*)
clasohm@0
   467
wenzelm@233
   468
(*  (op @) (e, [x1, ..., xn])  ===>  ((e @ x1) @ x2) ... @ xn
wenzelm@233
   469
    for operators that associate to the left (TAIL RECURSIVE)*)
wenzelm@233
   470
fun foldl (f: 'a * 'b -> 'a) : 'a * 'b list -> 'a =
wenzelm@233
   471
  let fun itl (e, [])  = e
wenzelm@233
   472
        | itl (e, a::l) = itl (f(e, a), l)
wenzelm@233
   473
  in  itl end;
wenzelm@233
   474
wenzelm@233
   475
(*  (op @) ([x1, ..., xn], e)  ===>   x1 @ (x2 ... @ (xn @ e))
wenzelm@233
   476
    for operators that associate to the right (not tail recursive)*)
wenzelm@233
   477
fun foldr f (l, e) =
wenzelm@233
   478
  let fun itr [] = e
wenzelm@233
   479
        | itr (a::l) = f(a, itr l)
wenzelm@233
   480
  in  itr l  end;
wenzelm@233
   481
wenzelm@233
   482
(*  (op @) [x1, ..., xn]  ===>   x1 @ (x2 ... @ (x[n-1] @ xn))
wenzelm@233
   483
    for n > 0, operators that associate to the right (not tail recursive)*)
wenzelm@233
   484
fun foldr1 f l =
wenzelm@4181
   485
  let fun itr [x] = x
wenzelm@233
   486
        | itr (x::l) = f(x, itr l)
wenzelm@233
   487
  in  itr l  end;
wenzelm@233
   488
wenzelm@14792
   489
fun fold f xs y = foldl (fn (y', x) => f x y') (y, xs);
wenzelm@14792
   490
wenzelm@4956
   491
fun foldl_map _ (x, []) = (x, [])
wenzelm@4956
   492
  | foldl_map f (x, y :: ys) =
wenzelm@4956
   493
      let
wenzelm@4956
   494
        val (x', y') = f (x, y);
wenzelm@4956
   495
        val (x'', ys') = foldl_map f (x', ys);
wenzelm@4956
   496
      in (x'', y' :: ys') end;
wenzelm@4956
   497
oheimb@11002
   498
fun foldln f xs e = fst (foldl (fn ((e,i), x) => (f (x,i) e, i+1)) ((e,1),xs));
wenzelm@233
   499
wenzelm@233
   500
(* basic list functions *)
wenzelm@233
   501
wenzelm@233
   502
(*length of a list, should unquestionably be a standard function*)
wenzelm@233
   503
local fun length1 (n, [])  = n   (*TAIL RECURSIVE*)
wenzelm@233
   504
        | length1 (n, x :: xs) = length1 (n + 1, xs)
wenzelm@233
   505
in  fun length l = length1 (0, l) end;
wenzelm@233
   506
wenzelm@233
   507
(*take the first n elements from a list*)
wenzelm@233
   508
fun take (n, []) = []
wenzelm@233
   509
  | take (n, x :: xs) =
wenzelm@233
   510
      if n > 0 then x :: take (n - 1, xs) else [];
wenzelm@233
   511
wenzelm@233
   512
(*drop the first n elements from a list*)
wenzelm@233
   513
fun drop (n, []) = []
wenzelm@233
   514
  | drop (n, x :: xs) =
wenzelm@233
   515
      if n > 0 then drop (n - 1, xs) else x :: xs;
clasohm@0
   516
nipkow@13629
   517
fun splitAt(n,[]) = ([],[])
nipkow@13629
   518
  | splitAt(n,xs as x::ys) =
nipkow@13629
   519
      if n>0 then let val (ps,qs) = splitAt(n-1,ys) in (x::ps,qs) end
nipkow@13629
   520
      else ([],xs)
nipkow@13629
   521
nipkow@4713
   522
fun dropwhile P [] = []
nipkow@4713
   523
  | dropwhile P (ys as x::xs) = if P x then dropwhile P xs else ys;
nipkow@4713
   524
wenzelm@233
   525
(*return nth element of a list, where 0 designates the first element;
wenzelm@233
   526
  raise EXCEPTION if list too short*)
wenzelm@233
   527
fun nth_elem NL =
wenzelm@233
   528
  (case drop NL of
wenzelm@233
   529
    [] => raise LIST "nth_elem"
wenzelm@233
   530
  | x :: _ => x);
wenzelm@233
   531
wenzelm@11773
   532
fun map_nth_elem 0 f (x :: xs) = f x :: xs
wenzelm@11773
   533
  | map_nth_elem n f (x :: xs) = x :: map_nth_elem (n - 1) f xs
wenzelm@11773
   534
  | map_nth_elem _ _ [] = raise LIST "map_nth_elem";
wenzelm@11773
   535
wenzelm@233
   536
(*last element of a list*)
wenzelm@233
   537
fun last_elem [] = raise LIST "last_elem"
wenzelm@233
   538
  | last_elem [x] = x
wenzelm@233
   539
  | last_elem (_ :: xs) = last_elem xs;
wenzelm@233
   540
wenzelm@3762
   541
(*rear decomposition*)
wenzelm@3762
   542
fun split_last [] = raise LIST "split_last"
wenzelm@3762
   543
  | split_last [x] = ([], x)
wenzelm@3762
   544
  | split_last (x :: xs) = apfst (cons x) (split_last xs);
wenzelm@3762
   545
wenzelm@4893
   546
(*update nth element*)
nipkow@13629
   547
fun nth_update x n_xs =
nipkow@13629
   548
    (case splitAt n_xs of
nipkow@13629
   549
      (_,[]) => raise LIST "nth_update"
nipkow@13629
   550
    | (prfx, _ :: sffx') => prfx @ (x :: sffx'))
wenzelm@4893
   551
wenzelm@4212
   552
(*find the position of an element in a list*)
wenzelm@4212
   553
fun find_index pred =
wenzelm@4212
   554
  let fun find _ [] = ~1
wenzelm@4212
   555
        | find n (x :: xs) = if pred x then n else find (n + 1) xs;
wenzelm@4212
   556
  in find 0 end;
wenzelm@3762
   557
wenzelm@4224
   558
fun find_index_eq x = find_index (equal x);
wenzelm@4212
   559
wenzelm@4212
   560
(*find first element satisfying predicate*)
wenzelm@4212
   561
fun find_first _ [] = None
wenzelm@4212
   562
  | find_first pred (x :: xs) =
wenzelm@4212
   563
      if pred x then Some x else find_first pred xs;
wenzelm@233
   564
wenzelm@4916
   565
(*get first element by lookup function*)
wenzelm@4916
   566
fun get_first _ [] = None
wenzelm@4916
   567
  | get_first f (x :: xs) =
wenzelm@4916
   568
      (case f x of
wenzelm@4916
   569
        None => get_first f xs
wenzelm@4916
   570
      | some => some);
wenzelm@4916
   571
wenzelm@233
   572
(*flatten a list of lists to a list*)
wenzelm@233
   573
fun flat (ls: 'c list list) : 'c list = foldr (op @) (ls, []);
wenzelm@233
   574
wenzelm@12136
   575
fun unflat (xs :: xss) ys =
nipkow@13629
   576
      let val (ps,qs) = splitAt(length xs,ys)
nipkow@13629
   577
      in ps :: unflat xss qs end
wenzelm@12136
   578
  | unflat [] [] = []
wenzelm@12136
   579
  | unflat _ _ = raise LIST "unflat";
wenzelm@12136
   580
wenzelm@233
   581
(*like Lisp's MAPC -- seq proc [x1, ..., xn] evaluates
wenzelm@233
   582
  (proc x1; ...; proc xn) for side effects*)
wenzelm@233
   583
fun seq (proc: 'a -> unit) : 'a list -> unit =
wenzelm@233
   584
  let fun seqf [] = ()
wenzelm@233
   585
        | seqf (x :: xs) = (proc x; seqf xs)
wenzelm@233
   586
  in seqf end;
wenzelm@233
   587
wenzelm@233
   588
(*separate s [x1, x2, ..., xn]  ===>  [x1, s, x2, s, ..., s, xn]*)
wenzelm@233
   589
fun separate s (x :: (xs as _ :: _)) = x :: s :: separate s xs
wenzelm@233
   590
  | separate _ xs = xs;
wenzelm@233
   591
wenzelm@233
   592
(*make the list [x, x, ..., x] of length n*)
wenzelm@233
   593
fun replicate n (x: 'a) : 'a list =
wenzelm@233
   594
  let fun rep (0, xs) = xs
wenzelm@233
   595
        | rep (n, xs) = rep (n - 1, x :: xs)
wenzelm@233
   596
  in
wenzelm@233
   597
    if n < 0 then raise LIST "replicate"
wenzelm@233
   598
    else rep (n, [])
wenzelm@233
   599
  end;
wenzelm@233
   600
wenzelm@14926
   601
fun translate_string f = String.translate (f o String.str);
wenzelm@14926
   602
wenzelm@4248
   603
(*multiply [a, b, c, ...] * [xs, ys, zs, ...]*)
wenzelm@4248
   604
fun multiply ([], _) = []
wenzelm@4248
   605
  | multiply (x :: xs, yss) = map (cons x) yss @ multiply (xs, yss);
wenzelm@4248
   606
wenzelm@14792
   607
(*direct product*)
wenzelm@14792
   608
fun product _ [] = []
wenzelm@14792
   609
  | product [] _ = []
wenzelm@14792
   610
  | product (x :: xs) ys = map (pair x) ys @ product xs ys;
wenzelm@14792
   611
wenzelm@233
   612
wenzelm@233
   613
(* filter *)
wenzelm@233
   614
wenzelm@233
   615
(*copy the list preserving elements that satisfy the predicate*)
wenzelm@233
   616
fun filter (pred: 'a->bool) : 'a list -> 'a list =
clasohm@0
   617
  let fun filt [] = []
wenzelm@233
   618
        | filt (x :: xs) = if pred x then x :: filt xs else filt xs
wenzelm@233
   619
  in filt end;
clasohm@0
   620
clasohm@0
   621
fun filter_out f = filter (not o f);
clasohm@0
   622
wenzelm@233
   623
fun mapfilter (f: 'a -> 'b option) ([]: 'a list) = [] : 'b list
wenzelm@233
   624
  | mapfilter f (x :: xs) =
wenzelm@233
   625
      (case f x of
wenzelm@233
   626
        None => mapfilter f xs
wenzelm@233
   627
      | Some y => y :: mapfilter f xs);
wenzelm@233
   628
wenzelm@233
   629
wenzelm@233
   630
(* lists of pairs *)
wenzelm@233
   631
wenzelm@380
   632
fun map2 _ ([], []) = []
wenzelm@380
   633
  | map2 f (x :: xs, y :: ys) = (f (x, y) :: map2 f (xs, ys))
wenzelm@380
   634
  | map2 _ _ = raise LIST "map2";
wenzelm@380
   635
wenzelm@380
   636
fun exists2 _ ([], []) = false
wenzelm@380
   637
  | exists2 pred (x :: xs, y :: ys) = pred (x, y) orelse exists2 pred (xs, ys)
wenzelm@380
   638
  | exists2 _ _ = raise LIST "exists2";
wenzelm@380
   639
wenzelm@380
   640
fun forall2 _ ([], []) = true
wenzelm@380
   641
  | forall2 pred (x :: xs, y :: ys) = pred (x, y) andalso forall2 pred (xs, ys)
wenzelm@380
   642
  | forall2 _ _ = raise LIST "forall2";
wenzelm@380
   643
wenzelm@4956
   644
fun seq2 _ ([], []) = ()
wenzelm@4956
   645
  | seq2 f (x :: xs, y :: ys) = (f (x, y); seq2 f (xs, ys))
wenzelm@4956
   646
  | seq2 _ _ = raise LIST "seq2";
wenzelm@4956
   647
wenzelm@233
   648
(*combine two lists forming a list of pairs:
wenzelm@233
   649
  [x1, ..., xn] ~~ [y1, ..., yn]  ===>  [(x1, y1), ..., (xn, yn)]*)
wenzelm@233
   650
fun [] ~~ [] = []
wenzelm@233
   651
  | (x :: xs) ~~ (y :: ys) = (x, y) :: (xs ~~ ys)
wenzelm@233
   652
  | _ ~~ _ = raise LIST "~~";
wenzelm@233
   653
wenzelm@233
   654
(*inverse of ~~; the old 'split':
wenzelm@233
   655
  [(x1, y1), ..., (xn, yn)]  ===>  ([x1, ..., xn], [y1, ..., yn])*)
wenzelm@233
   656
fun split_list (l: ('a * 'b) list) = (map #1 l, map #2 l);
wenzelm@233
   657
wenzelm@7468
   658
fun equal_lists eq (xs, ys) = length xs = length ys andalso forall2 eq (xs, ys);
wenzelm@7468
   659
wenzelm@233
   660
wenzelm@233
   661
(* prefixes, suffixes *)
wenzelm@233
   662
wenzelm@233
   663
fun [] prefix _ = true
wenzelm@233
   664
  | (x :: xs) prefix (y :: ys) = x = y andalso (xs prefix ys)
wenzelm@233
   665
  | _ prefix _ = false;
wenzelm@233
   666
wenzelm@233
   667
(* [x1, ..., xi, ..., xn]  --->  ([x1, ..., x(i-1)], [xi, ..., xn])
wenzelm@233
   668
   where xi is the first element that does not satisfy the predicate*)
wenzelm@233
   669
fun take_prefix (pred : 'a -> bool)  (xs: 'a list) : 'a list * 'a list =
wenzelm@233
   670
  let fun take (rxs, []) = (rev rxs, [])
wenzelm@255
   671
        | take (rxs, x :: xs) =
wenzelm@255
   672
            if  pred x  then  take(x :: rxs, xs)  else  (rev rxs, x :: xs)
wenzelm@233
   673
  in  take([], xs)  end;
wenzelm@233
   674
wenzelm@233
   675
(* [x1, ..., xi, ..., xn]  --->  ([x1, ..., xi], [x(i+1), ..., xn])
wenzelm@233
   676
   where xi is the last element that does not satisfy the predicate*)
wenzelm@233
   677
fun take_suffix _ [] = ([], [])
wenzelm@233
   678
  | take_suffix pred (x :: xs) =
wenzelm@233
   679
      (case take_suffix pred xs of
wenzelm@233
   680
        ([], sffx) => if pred x then ([], x :: sffx) else ([x], sffx)
wenzelm@233
   681
      | (prfx, sffx) => (x :: prfx, sffx));
wenzelm@233
   682
wenzelm@12249
   683
fun prefixes1 [] = []
wenzelm@12249
   684
  | prefixes1 (x :: xs) = map (cons x) ([] :: prefixes1 xs);
wenzelm@12249
   685
wenzelm@12249
   686
fun suffixes1 xs = map rev (prefixes1 (rev xs));
wenzelm@12249
   687
wenzelm@233
   688
wenzelm@233
   689
wenzelm@233
   690
(** integers **)
wenzelm@233
   691
nipkow@10692
   692
fun gcd(x,y) =
nipkow@10692
   693
  let fun gxd x y =
nipkow@10692
   694
    if y = 0 then x else gxd y (x mod y)
nipkow@10692
   695
  in if x < y then gxd y x else gxd x y end;
nipkow@10692
   696
nipkow@10692
   697
fun lcm(x,y) = (x * y) div gcd(x,y);
nipkow@10692
   698
wenzelm@2958
   699
fun inc i = (i := ! i + 1; ! i);
wenzelm@2958
   700
fun dec i = (i := ! i - 1; ! i);
wenzelm@233
   701
wenzelm@233
   702
wenzelm@233
   703
(* lists of integers *)
wenzelm@233
   704
wenzelm@233
   705
(*make the list [from, from + 1, ..., to]*)
paulson@2175
   706
fun (from upto to) =
wenzelm@233
   707
  if from > to then [] else from :: ((from + 1) upto to);
wenzelm@233
   708
wenzelm@233
   709
(*make the list [from, from - 1, ..., to]*)
paulson@2175
   710
fun (from downto to) =
wenzelm@233
   711
  if from < to then [] else from :: ((from - 1) downto to);
wenzelm@233
   712
wenzelm@233
   713
(*predicate: downto0 (is, n) <=> is = [n, n - 1, ..., 0]*)
wenzelm@233
   714
fun downto0 (i :: is, n) = i = n andalso downto0 (is, n - 1)
wenzelm@233
   715
  | downto0 ([], n) = n = ~1;
wenzelm@233
   716
wenzelm@233
   717
wenzelm@233
   718
(* convert integers to strings *)
wenzelm@233
   719
wenzelm@233
   720
(*expand the number in the given base;
wenzelm@233
   721
  example: radixpand (2, 8) gives [1, 0, 0, 0]*)
wenzelm@233
   722
fun radixpand (base, num) : int list =
wenzelm@233
   723
  let
wenzelm@233
   724
    fun radix (n, tail) =
wenzelm@233
   725
      if n < base then n :: tail
wenzelm@233
   726
      else radix (n div base, (n mod base) :: tail)
wenzelm@233
   727
  in radix (num, []) end;
wenzelm@233
   728
wenzelm@233
   729
(*expands a number into a string of characters starting from "zerochar";
wenzelm@233
   730
  example: radixstring (2, "0", 8) gives "1000"*)
wenzelm@233
   731
fun radixstring (base, zerochar, num) =
wenzelm@233
   732
  let val offset = ord zerochar;
wenzelm@233
   733
      fun chrof n = chr (offset + n)
wenzelm@233
   734
  in implode (map chrof (radixpand (base, num))) end;
wenzelm@233
   735
wenzelm@233
   736
paulson@3407
   737
val string_of_int = Int.toString;
wenzelm@233
   738
paulson@3407
   739
fun string_of_indexname (a,0) = a
paulson@3407
   740
  | string_of_indexname (a,i) = a ^ "_" ^ Int.toString i;
wenzelm@233
   741
wenzelm@233
   742
wenzelm@14826
   743
(* read integers *)
wenzelm@14826
   744
wenzelm@14826
   745
fun read_radixint (radix: int, cs) : int * string list =
wenzelm@14826
   746
  let val zero = ord"0"
wenzelm@14826
   747
      val limit = zero+radix
wenzelm@14826
   748
      fun scan (num,[]) = (num,[])
wenzelm@14826
   749
        | scan (num, c::cs) =
wenzelm@14826
   750
              if  zero <= ord c  andalso  ord c < limit
wenzelm@14826
   751
              then scan(radix*num + ord c - zero, cs)
wenzelm@14826
   752
              else (num, c::cs)
wenzelm@14826
   753
  in  scan(0,cs)  end;
wenzelm@14826
   754
wenzelm@14826
   755
fun read_int cs = read_radixint (10, cs);
wenzelm@14826
   756
wenzelm@14826
   757
fun oct_char s = chr (#1 (read_radixint (8, explode s)));
wenzelm@14826
   758
wenzelm@14826
   759
wenzelm@14826
   760
wenzelm@233
   761
(** strings **)
wenzelm@233
   762
wenzelm@6312
   763
(*functions tuned for strings, avoiding explode*)
wenzelm@6312
   764
wenzelm@6312
   765
fun nth_elem_string (i, str) =
wenzelm@6959
   766
  (case try String.substring (str, i, 1) of
wenzelm@6959
   767
    Some s => s
wenzelm@6959
   768
  | None => raise LIST "nth_elem_string");
wenzelm@6312
   769
wenzelm@6282
   770
fun foldl_string f (x0, str) =
wenzelm@6282
   771
  let
wenzelm@6282
   772
    val n = size str;
wenzelm@14968
   773
    fun fold (x, i) =
wenzelm@14968
   774
      if i < n then fold (f (x, String.substring (str, i, 1)), i + 1) else x;
wenzelm@6282
   775
  in fold (x0, 0) end;
wenzelm@6282
   776
wenzelm@14968
   777
fun exists_string pred str =
wenzelm@14968
   778
  let
wenzelm@14968
   779
    val n = size str;
wenzelm@14968
   780
    fun ex i = i < n andalso (pred (String.substring (str, i, 1)) orelse ex (i + 1));
wenzelm@14968
   781
  in ex 0 end;
wenzelm@6312
   782
lcp@512
   783
(*enclose in brackets*)
lcp@512
   784
fun enclose lpar rpar str = lpar ^ str ^ rpar;
wenzelm@6642
   785
fun unenclose str = String.substring (str, 1, size str - 2);
wenzelm@255
   786
wenzelm@233
   787
(*simple quoting (does not escape special chars)*)
lcp@512
   788
val quote = enclose "\"" "\"";
wenzelm@233
   789
wenzelm@4212
   790
(*space_implode "..." (explode "hello") = "h...e...l...l...o"*)
wenzelm@233
   791
fun space_implode a bs = implode (separate a bs);
wenzelm@233
   792
wenzelm@255
   793
val commas = space_implode ", ";
wenzelm@380
   794
val commas_quote = commas o map quote;
wenzelm@255
   795
wenzelm@233
   796
(*concatenate messages, one per line, into a string*)
wenzelm@255
   797
val cat_lines = space_implode "\n";
wenzelm@233
   798
wenzelm@4212
   799
(*space_explode "." "h.e..l.lo" = ["h", "e", "", "l", "lo"]*)
wenzelm@3832
   800
fun space_explode _ "" = []
wenzelm@3832
   801
  | space_explode sep str =
wenzelm@3832
   802
      let
wenzelm@3832
   803
        fun expl chs =
wenzelm@3832
   804
          (case take_prefix (not_equal sep) chs of
wenzelm@3832
   805
            (cs, []) => [implode cs]
wenzelm@3832
   806
          | (cs, _ :: cs') => implode cs :: expl cs');
wenzelm@3832
   807
      in expl (explode str) end;
wenzelm@3832
   808
wenzelm@3832
   809
val split_lines = space_explode "\n";
wenzelm@3832
   810
wenzelm@14826
   811
fun prefix_lines "" txt = txt
wenzelm@14826
   812
  | prefix_lines prfx txt = txt |> split_lines |> map (fn s => prfx ^ s) |> cat_lines;
wenzelm@14826
   813
wenzelm@7712
   814
(*untabify*)
wenzelm@7712
   815
fun untabify chs =
wenzelm@7712
   816
  let
wenzelm@7712
   817
    val tab_width = 8;
wenzelm@7712
   818
wenzelm@7712
   819
    fun untab (_, "\n") = (0, ["\n"])
wenzelm@9118
   820
      | untab (pos, "\t") =
wenzelm@9118
   821
          let val d = tab_width - (pos mod tab_width) in (pos + d, replicate d " ") end
wenzelm@7712
   822
      | untab (pos, c) = (pos + 1, [c]);
wenzelm@7712
   823
  in
wenzelm@7712
   824
    if not (exists (equal "\t") chs) then chs
wenzelm@7712
   825
    else flat (#2 (foldl_map untab (0, chs)))
wenzelm@7712
   826
  end;
wenzelm@7712
   827
wenzelm@5285
   828
(*append suffix*)
wenzelm@5285
   829
fun suffix sfx s = s ^ sfx;
wenzelm@5285
   830
wenzelm@5285
   831
(*remove suffix*)
wenzelm@5285
   832
fun unsuffix sfx s =
wenzelm@5285
   833
  let
wenzelm@5285
   834
    val cs = explode s;
wenzelm@5285
   835
    val prfx_len = size s - size sfx;
wenzelm@5285
   836
  in
wenzelm@5285
   837
    if prfx_len >= 0 andalso implode (drop (prfx_len, cs)) = sfx then
wenzelm@5285
   838
      implode (take (prfx_len, cs))
wenzelm@5285
   839
    else raise LIST "unsuffix"
wenzelm@5285
   840
  end;
wenzelm@5285
   841
wenzelm@10951
   842
fun replicate_string 0 _ = ""
wenzelm@10951
   843
  | replicate_string 1 a = a
wenzelm@10951
   844
  | replicate_string k a =
wenzelm@10951
   845
      if k mod 2 = 0 then replicate_string (k div 2) (a ^ a)
wenzelm@10951
   846
      else replicate_string (k div 2) (a ^ a) ^ a;
wenzelm@10951
   847
wenzelm@3832
   848
wenzelm@233
   849
wenzelm@233
   850
(** lists as sets **)
wenzelm@233
   851
wenzelm@233
   852
(*membership in a list*)
wenzelm@233
   853
fun x mem [] = false
wenzelm@233
   854
  | x mem (y :: ys) = x = y orelse x mem ys;
clasohm@0
   855
paulson@2175
   856
(*membership in a list, optimized version for ints*)
berghofe@1576
   857
fun (x:int) mem_int [] = false
berghofe@1576
   858
  | x mem_int (y :: ys) = x = y orelse x mem_int ys;
berghofe@1576
   859
paulson@2175
   860
(*membership in a list, optimized version for strings*)
berghofe@1576
   861
fun (x:string) mem_string [] = false
berghofe@1576
   862
  | x mem_string (y :: ys) = x = y orelse x mem_string ys;
berghofe@1576
   863
clasohm@0
   864
(*generalized membership test*)
wenzelm@233
   865
fun gen_mem eq (x, []) = false
wenzelm@233
   866
  | gen_mem eq (x, y :: ys) = eq (x, y) orelse gen_mem eq (x, ys);
wenzelm@233
   867
wenzelm@233
   868
wenzelm@233
   869
(*insertion into list if not already there*)
paulson@2175
   870
fun (x ins xs) = if x mem xs then xs else x :: xs;
clasohm@0
   871
paulson@2175
   872
(*insertion into list, optimized version for ints*)
paulson@2175
   873
fun (x ins_int xs) = if x mem_int xs then xs else x :: xs;
berghofe@1576
   874
paulson@2175
   875
(*insertion into list, optimized version for strings*)
paulson@2175
   876
fun (x ins_string xs) = if x mem_string xs then xs else x :: xs;
berghofe@1576
   877
clasohm@0
   878
(*generalized insertion*)
wenzelm@233
   879
fun gen_ins eq (x, xs) = if gen_mem eq (x, xs) then xs else x :: xs;
wenzelm@233
   880
wenzelm@233
   881
wenzelm@233
   882
(*union of sets represented as lists: no repetitions*)
wenzelm@233
   883
fun xs union [] = xs
wenzelm@233
   884
  | [] union ys = ys
wenzelm@233
   885
  | (x :: xs) union ys = xs union (x ins ys);
clasohm@0
   886
paulson@2175
   887
(*union of sets, optimized version for ints*)
berghofe@1576
   888
fun (xs:int list) union_int [] = xs
berghofe@1576
   889
  | [] union_int ys = ys
berghofe@1576
   890
  | (x :: xs) union_int ys = xs union_int (x ins_int ys);
berghofe@1576
   891
paulson@2175
   892
(*union of sets, optimized version for strings*)
berghofe@1576
   893
fun (xs:string list) union_string [] = xs
berghofe@1576
   894
  | [] union_string ys = ys
berghofe@1576
   895
  | (x :: xs) union_string ys = xs union_string (x ins_string ys);
berghofe@1576
   896
clasohm@0
   897
(*generalized union*)
wenzelm@233
   898
fun gen_union eq (xs, []) = xs
wenzelm@233
   899
  | gen_union eq ([], ys) = ys
wenzelm@233
   900
  | gen_union eq (x :: xs, ys) = gen_union eq (xs, gen_ins eq (x, ys));
wenzelm@233
   901
wenzelm@233
   902
wenzelm@233
   903
(*intersection*)
wenzelm@233
   904
fun [] inter ys = []
wenzelm@233
   905
  | (x :: xs) inter ys =
wenzelm@233
   906
      if x mem ys then x :: (xs inter ys) else xs inter ys;
wenzelm@233
   907
paulson@2175
   908
(*intersection, optimized version for ints*)
berghofe@1576
   909
fun ([]:int list) inter_int ys = []
berghofe@1576
   910
  | (x :: xs) inter_int ys =
berghofe@1576
   911
      if x mem_int ys then x :: (xs inter_int ys) else xs inter_int ys;
berghofe@1576
   912
paulson@2175
   913
(*intersection, optimized version for strings *)
berghofe@1576
   914
fun ([]:string list) inter_string ys = []
berghofe@1576
   915
  | (x :: xs) inter_string ys =
berghofe@1576
   916
      if x mem_string ys then x :: (xs inter_string ys) else xs inter_string ys;
berghofe@1576
   917
paulson@7090
   918
(*generalized intersection*)
paulson@7090
   919
fun gen_inter eq ([], ys) = []
wenzelm@12284
   920
  | gen_inter eq (x::xs, ys) =
paulson@7090
   921
      if gen_mem eq (x,ys) then x :: gen_inter eq (xs, ys)
wenzelm@12284
   922
                           else      gen_inter eq (xs, ys);
paulson@7090
   923
wenzelm@233
   924
wenzelm@233
   925
(*subset*)
wenzelm@233
   926
fun [] subset ys = true
wenzelm@233
   927
  | (x :: xs) subset ys = x mem ys andalso xs subset ys;
wenzelm@233
   928
paulson@2175
   929
(*subset, optimized version for ints*)
berghofe@1576
   930
fun ([]:int list) subset_int ys = true
berghofe@1576
   931
  | (x :: xs) subset_int ys = x mem_int ys andalso xs subset_int ys;
berghofe@1576
   932
paulson@2175
   933
(*subset, optimized version for strings*)
berghofe@1576
   934
fun ([]:string list) subset_string ys = true
berghofe@1576
   935
  | (x :: xs) subset_string ys = x mem_string ys andalso xs subset_string ys;
berghofe@1576
   936
wenzelm@4363
   937
(*set equality*)
wenzelm@4363
   938
fun eq_set (xs, ys) =
wenzelm@4363
   939
  xs = ys orelse (xs subset ys andalso ys subset xs);
wenzelm@4363
   940
paulson@2182
   941
(*set equality for strings*)
berghofe@1576
   942
fun eq_set_string ((xs:string list), ys) =
berghofe@1576
   943
  xs = ys orelse (xs subset_string ys andalso ys subset_string xs);
berghofe@1576
   944
paulson@2182
   945
fun gen_subset eq (xs, ys) = forall (fn x => gen_mem eq (x, ys)) xs;
paulson@2182
   946
wenzelm@265
   947
wenzelm@233
   948
(*removing an element from a list WITHOUT duplicates*)
wenzelm@233
   949
fun (y :: ys) \ x = if x = y then ys else y :: (ys \ x)
wenzelm@233
   950
  | [] \ x = [];
wenzelm@233
   951
paulson@2243
   952
fun ys \\ xs = foldl (op \) (ys,xs);
clasohm@0
   953
wenzelm@233
   954
(*removing an element from a list -- possibly WITH duplicates*)
wenzelm@233
   955
fun gen_rem eq (xs, y) = filter_out (fn x => eq (x, y)) xs;
wenzelm@12295
   956
fun gen_rems eq (xs, ys) = filter_out (fn x => gen_mem eq (x, ys)) xs;
wenzelm@233
   957
wenzelm@233
   958
wenzelm@233
   959
(*makes a list of the distinct members of the input; preserves order, takes
wenzelm@233
   960
  first of equal elements*)
wenzelm@233
   961
fun gen_distinct eq lst =
wenzelm@233
   962
  let
wenzelm@233
   963
    val memb = gen_mem eq;
clasohm@0
   964
wenzelm@233
   965
    fun dist (rev_seen, []) = rev rev_seen
wenzelm@233
   966
      | dist (rev_seen, x :: xs) =
wenzelm@233
   967
          if memb (x, rev_seen) then dist (rev_seen, xs)
wenzelm@233
   968
          else dist (x :: rev_seen, xs);
wenzelm@233
   969
  in
wenzelm@233
   970
    dist ([], lst)
wenzelm@233
   971
  end;
wenzelm@233
   972
paulson@2243
   973
fun distinct l = gen_distinct (op =) l;
wenzelm@233
   974
wenzelm@233
   975
wenzelm@233
   976
(*returns the tail beginning with the first repeated element, or []*)
wenzelm@233
   977
fun findrep [] = []
wenzelm@233
   978
  | findrep (x :: xs) = if x mem xs then x :: xs else findrep xs;
wenzelm@233
   979
wenzelm@233
   980
wenzelm@255
   981
(*returns a list containing all repeated elements exactly once; preserves
wenzelm@255
   982
  order, takes first of equal elements*)
wenzelm@255
   983
fun gen_duplicates eq lst =
wenzelm@255
   984
  let
wenzelm@255
   985
    val memb = gen_mem eq;
wenzelm@255
   986
wenzelm@255
   987
    fun dups (rev_dups, []) = rev rev_dups
wenzelm@255
   988
      | dups (rev_dups, x :: xs) =
wenzelm@255
   989
          if memb (x, rev_dups) orelse not (memb (x, xs)) then
wenzelm@255
   990
            dups (rev_dups, xs)
wenzelm@255
   991
          else dups (x :: rev_dups, xs);
wenzelm@255
   992
  in
wenzelm@255
   993
    dups ([], lst)
wenzelm@255
   994
  end;
wenzelm@255
   995
paulson@2243
   996
fun duplicates l = gen_duplicates (op =) l;
wenzelm@255
   997
wenzelm@255
   998
wenzelm@233
   999
wenzelm@233
  1000
(** association lists **)
clasohm@0
  1001
wenzelm@233
  1002
(*association list lookup*)
wenzelm@233
  1003
fun assoc ([], key) = None
wenzelm@233
  1004
  | assoc ((keyi, xi) :: pairs, key) =
wenzelm@233
  1005
      if key = keyi then Some xi else assoc (pairs, key);
wenzelm@233
  1006
paulson@2175
  1007
(*association list lookup, optimized version for ints*)
berghofe@1576
  1008
fun assoc_int ([], (key:int)) = None
berghofe@1576
  1009
  | assoc_int ((keyi, xi) :: pairs, key) =
berghofe@1576
  1010
      if key = keyi then Some xi else assoc_int (pairs, key);
berghofe@1576
  1011
paulson@2175
  1012
(*association list lookup, optimized version for strings*)
berghofe@1576
  1013
fun assoc_string ([], (key:string)) = None
berghofe@1576
  1014
  | assoc_string ((keyi, xi) :: pairs, key) =
berghofe@1576
  1015
      if key = keyi then Some xi else assoc_string (pairs, key);
berghofe@1576
  1016
paulson@2175
  1017
(*association list lookup, optimized version for string*ints*)
berghofe@1576
  1018
fun assoc_string_int ([], (key:string*int)) = None
berghofe@1576
  1019
  | assoc_string_int ((keyi, xi) :: pairs, key) =
berghofe@1576
  1020
      if key = keyi then Some xi else assoc_string_int (pairs, key);
berghofe@1576
  1021
wenzelm@233
  1022
fun assocs ps x =
wenzelm@233
  1023
  (case assoc (ps, x) of
wenzelm@233
  1024
    None => []
wenzelm@233
  1025
  | Some ys => ys);
wenzelm@233
  1026
wenzelm@255
  1027
(*two-fold association list lookup*)
wenzelm@255
  1028
fun assoc2 (aal, (key1, key2)) =
wenzelm@255
  1029
  (case assoc (aal, key1) of
wenzelm@255
  1030
    Some al => assoc (al, key2)
wenzelm@255
  1031
  | None => None);
wenzelm@255
  1032
wenzelm@233
  1033
(*generalized association list lookup*)
wenzelm@233
  1034
fun gen_assoc eq ([], key) = None
wenzelm@233
  1035
  | gen_assoc eq ((keyi, xi) :: pairs, key) =
wenzelm@233
  1036
      if eq (key, keyi) then Some xi else gen_assoc eq (pairs, key);
wenzelm@233
  1037
wenzelm@233
  1038
(*association list update*)
wenzelm@233
  1039
fun overwrite (al, p as (key, _)) =
wenzelm@233
  1040
  let fun over ((q as (keyi, _)) :: pairs) =
wenzelm@233
  1041
            if keyi = key then p :: pairs else q :: (over pairs)
wenzelm@233
  1042
        | over [] = [p]
wenzelm@233
  1043
  in over al end;
wenzelm@233
  1044
wenzelm@2522
  1045
fun gen_overwrite eq (al, p as (key, _)) =
wenzelm@2522
  1046
  let fun over ((q as (keyi, _)) :: pairs) =
wenzelm@2522
  1047
            if eq (keyi, key) then p :: pairs else q :: (over pairs)
wenzelm@2522
  1048
        | over [] = [p]
wenzelm@2522
  1049
  in over al end;
wenzelm@2522
  1050
wenzelm@233
  1051
wenzelm@12284
  1052
(* lists as tables *)
wenzelm@233
  1053
wenzelm@12284
  1054
fun gen_merge_lists _ xs [] = xs
wenzelm@12284
  1055
  | gen_merge_lists _ [] ys = ys
wenzelm@12284
  1056
  | gen_merge_lists eq xs ys = xs @ gen_rems eq (ys, xs);
clasohm@0
  1057
wenzelm@12284
  1058
fun gen_merge_lists' _ xs [] = xs
wenzelm@12284
  1059
  | gen_merge_lists' _ [] ys = ys
wenzelm@12295
  1060
  | gen_merge_lists' eq xs ys = gen_rems eq (ys, xs) @ xs;
clasohm@0
  1061
wenzelm@12284
  1062
fun merge_lists xs ys = gen_merge_lists (op =) xs ys;
wenzelm@12284
  1063
fun merge_lists' xs ys = gen_merge_lists' (op =) xs ys;
wenzelm@12284
  1064
fun merge_alists al = gen_merge_lists eq_fst al;
wenzelm@380
  1065
clasohm@0
  1066
clasohm@0
  1067
wenzelm@233
  1068
(** balanced trees **)
wenzelm@233
  1069
wenzelm@233
  1070
exception Balance;      (*indicates non-positive argument to balancing fun*)
wenzelm@233
  1071
wenzelm@233
  1072
(*balanced folding; avoids deep nesting*)
wenzelm@233
  1073
fun fold_bal f [x] = x
wenzelm@233
  1074
  | fold_bal f [] = raise Balance
wenzelm@233
  1075
  | fold_bal f xs =
nipkow@13629
  1076
      let val (ps,qs) = splitAt(length xs div 2, xs)
nipkow@13629
  1077
      in  f (fold_bal f ps, fold_bal f qs)  end;
wenzelm@233
  1078
wenzelm@233
  1079
(*construct something of the form f(...g(...(x)...)) for balanced access*)
wenzelm@233
  1080
fun access_bal (f, g, x) n i =
wenzelm@233
  1081
  let fun acc n i =     (*1<=i<=n*)
wenzelm@233
  1082
          if n=1 then x else
wenzelm@233
  1083
          let val n2 = n div 2
wenzelm@233
  1084
          in  if i<=n2 then f (acc n2 i)
wenzelm@233
  1085
                       else g (acc (n-n2) (i-n2))
wenzelm@233
  1086
          end
wenzelm@233
  1087
  in  if 1<=i andalso i<=n then acc n i else raise Balance  end;
wenzelm@233
  1088
wenzelm@233
  1089
(*construct ALL such accesses; could try harder to share recursive calls!*)
wenzelm@233
  1090
fun accesses_bal (f, g, x) n =
wenzelm@233
  1091
  let fun acc n =
wenzelm@233
  1092
          if n=1 then [x] else
wenzelm@233
  1093
          let val n2 = n div 2
wenzelm@233
  1094
              val acc2 = acc n2
wenzelm@233
  1095
          in  if n-n2=n2 then map f acc2 @ map g acc2
wenzelm@233
  1096
                         else map f acc2 @ map g (acc (n-n2)) end
wenzelm@233
  1097
  in  if 1<=n then acc n else raise Balance  end;
wenzelm@233
  1098
wenzelm@233
  1099
wenzelm@233
  1100
wenzelm@2506
  1101
(** orders **)
wenzelm@2506
  1102
wenzelm@4445
  1103
fun rev_order LESS = GREATER
wenzelm@4445
  1104
  | rev_order EQUAL = EQUAL
wenzelm@4445
  1105
  | rev_order GREATER = LESS;
wenzelm@4445
  1106
wenzelm@4479
  1107
(*assume rel is a linear strict order*)
wenzelm@4445
  1108
fun make_ord rel (x, y) =
wenzelm@4445
  1109
  if rel (x, y) then LESS
wenzelm@4445
  1110
  else if rel (y, x) then GREATER
wenzelm@4445
  1111
  else EQUAL;
wenzelm@4445
  1112
paulson@14472
  1113
(*Better to use Int.compare*)
wenzelm@4343
  1114
fun int_ord (i, j: int) =
wenzelm@2506
  1115
  if i < j then LESS
wenzelm@2506
  1116
  else if i = j then EQUAL
wenzelm@2506
  1117
  else GREATER;
wenzelm@2506
  1118
paulson@14472
  1119
(*Better to use String.compare*)
wenzelm@4343
  1120
fun string_ord (a, b: string) =
wenzelm@2506
  1121
  if a < b then LESS
wenzelm@2506
  1122
  else if a = b then EQUAL
wenzelm@2506
  1123
  else GREATER;
wenzelm@2506
  1124
wenzelm@4343
  1125
(*lexicographic product*)
wenzelm@4343
  1126
fun prod_ord a_ord b_ord ((x, y), (x', y')) =
wenzelm@4343
  1127
  (case a_ord (x, x') of EQUAL => b_ord (y, y') | ord => ord);
wenzelm@4343
  1128
wenzelm@4343
  1129
(*dictionary order -- in general NOT well-founded!*)
wenzelm@4343
  1130
fun dict_ord _ ([], []) = EQUAL
wenzelm@4343
  1131
  | dict_ord _ ([], _ :: _) = LESS
wenzelm@4343
  1132
  | dict_ord _ (_ :: _, []) = GREATER
wenzelm@4343
  1133
  | dict_ord elem_ord (x :: xs, y :: ys) =
wenzelm@4343
  1134
      (case elem_ord (x, y) of EQUAL => dict_ord elem_ord (xs, ys) | ord => ord);
wenzelm@4343
  1135
wenzelm@4343
  1136
(*lexicographic product of lists*)
wenzelm@4343
  1137
fun list_ord elem_ord (xs, ys) =
wenzelm@4343
  1138
  prod_ord int_ord (dict_ord elem_ord) ((length xs, xs), (length ys, ys));
wenzelm@4343
  1139
wenzelm@2506
  1140
wenzelm@4621
  1141
(* sorting *)
wenzelm@4621
  1142
wenzelm@4621
  1143
(*quicksort (stable, i.e. does not reorder equal elements)*)
wenzelm@4621
  1144
fun sort ord =
wenzelm@4621
  1145
  let
wenzelm@4621
  1146
    fun qsort xs =
wenzelm@4621
  1147
      let val len = length xs in
wenzelm@4621
  1148
        if len <= 1 then xs
wenzelm@4621
  1149
        else
wenzelm@4621
  1150
          let val (lts, eqs, gts) = part (nth_elem (len div 2, xs)) xs in
wenzelm@4621
  1151
            qsort lts @ eqs @ qsort gts
wenzelm@4621
  1152
          end
wenzelm@4621
  1153
      end
wenzelm@4621
  1154
    and part _ [] = ([], [], [])
wenzelm@4621
  1155
      | part pivot (x :: xs) = add (ord (x, pivot)) x (part pivot xs)
wenzelm@4621
  1156
    and add LESS x (lts, eqs, gts) = (x :: lts, eqs, gts)
wenzelm@4621
  1157
      | add EQUAL x (lts, eqs, gts) = (lts, x :: eqs, gts)
wenzelm@4621
  1158
      | add GREATER x (lts, eqs, gts) = (lts, eqs, x :: gts);
wenzelm@4621
  1159
  in qsort end;
wenzelm@4621
  1160
wenzelm@4621
  1161
(*sort strings*)
wenzelm@4621
  1162
val sort_strings = sort string_ord;
wenzelm@4621
  1163
fun sort_wrt sel xs = sort (string_ord o pairself sel) xs;
wenzelm@4621
  1164
berghofe@11514
  1165
fun unique_strings ([]: string list) = []
berghofe@11514
  1166
  | unique_strings [x] = [x]
berghofe@11514
  1167
  | unique_strings (x :: y :: ys) =
berghofe@11514
  1168
      if x = y then unique_strings (y :: ys)
berghofe@11514
  1169
      else x :: unique_strings (y :: ys);
wenzelm@4621
  1170
wenzelm@2506
  1171
berghofe@14106
  1172
(** random numbers **)
berghofe@14106
  1173
berghofe@14106
  1174
exception RANDOM;
berghofe@14106
  1175
berghofe@14618
  1176
fun rmod x y = x - y * Real.realFloor (x / y);
berghofe@14106
  1177
berghofe@14106
  1178
local
berghofe@14106
  1179
  val a = 16807.0;
berghofe@14106
  1180
  val m = 2147483647.0;
berghofe@14106
  1181
  val random_seed = ref 1.0;
berghofe@14106
  1182
in
berghofe@14106
  1183
berghofe@14106
  1184
fun random () =
berghofe@14106
  1185
  let val r = rmod (a * !random_seed) m
berghofe@14106
  1186
  in (random_seed := r; r) end;
berghofe@14106
  1187
berghofe@14106
  1188
end;
berghofe@14106
  1189
berghofe@14106
  1190
fun random_range l h =
berghofe@14106
  1191
  if h < l orelse l < 0 then raise RANDOM
berghofe@14106
  1192
  else l + Real.floor (rmod (random ()) (real (h - l + 1)));
berghofe@14106
  1193
berghofe@14106
  1194
fun one_of xs = nth_elem (random_range 0 (length xs - 1), xs);
berghofe@14106
  1195
berghofe@14106
  1196
fun frequency xs =
berghofe@14106
  1197
  let
berghofe@14106
  1198
    val sum = foldl op + (0, map fst xs);
berghofe@14106
  1199
    fun pick n ((k, x) :: xs) =
berghofe@14106
  1200
      if n <= k then x else pick (n - k) xs
berghofe@14106
  1201
  in pick (random_range 1 sum) xs end;
berghofe@14106
  1202
berghofe@14106
  1203
wenzelm@14826
  1204
(** current directory **)
wenzelm@233
  1205
paulson@2243
  1206
val cd = OS.FileSys.chDir;
wenzelm@2317
  1207
val pwd = OS.FileSys.getDir;
paulson@2243
  1208
berghofe@3606
  1209
wenzelm@233
  1210
nipkow@10692
  1211
(** rational numbers **)
nipkow@10692
  1212
nipkow@10692
  1213
datatype rat = Rat of bool * int * int
nipkow@10692
  1214
wenzelm@14826
  1215
exception RAT of string;
wenzelm@14826
  1216
nipkow@10692
  1217
fun rep_rat(Rat(a,p,q)) = (if a then p else ~p,q)
nipkow@10692
  1218
nipkow@10692
  1219
fun ratnorm(a,p,q) = if p=0 then Rat(a,0,1) else
nipkow@10692
  1220
  let val absp = abs p
nipkow@10692
  1221
      val m = gcd(absp,q)
nipkow@10692
  1222
  in Rat(a = (0 <= p), absp div m, q div m) end;
nipkow@10692
  1223
nipkow@10692
  1224
fun ratadd(Rat(a,p,q),Rat(b,r,s)) =
nipkow@10692
  1225
  let val den = lcm(q,s)
nipkow@10692
  1226
      val p = p*(den div q) and r = r*(den div s)
nipkow@10692
  1227
      val num = (if a then p else ~p) + (if b then r else ~r)
nipkow@10692
  1228
  in ratnorm(true,num,den) end;
nipkow@10692
  1229
nipkow@10692
  1230
fun ratmul(Rat(a,p,q),Rat(b,r,s)) = ratnorm(a=b,p*r,q*s)
nipkow@10692
  1231
wenzelm@14826
  1232
fun ratinv(Rat(a,p,q)) = if p=0 then raise RAT "ratinv" else Rat(a,q,p)
nipkow@10692
  1233
nipkow@10692
  1234
fun int_ratdiv(p,q) =
wenzelm@14826
  1235
  if q=0 then raise RAT "int_ratdiv" else ratnorm(0<=q, p, abs q)
nipkow@10692
  1236
nipkow@10692
  1237
fun ratneg(Rat(b,p,q)) = Rat(not b,p,q);
nipkow@10692
  1238
nipkow@10692
  1239
fun rat_of_int i = if i < 0 then Rat(false,abs i,1) else Rat(true,i,1);
nipkow@10692
  1240
nipkow@10692
  1241
wenzelm@4621
  1242
(** misc **)
wenzelm@233
  1243
wenzelm@233
  1244
(*use the keyfun to make a list of (x, key) pairs*)
clasohm@0
  1245
fun make_keylist (keyfun: 'a->'b) : 'a list -> ('a * 'b) list =
wenzelm@233
  1246
  let fun keypair x = (x, keyfun x)
wenzelm@233
  1247
  in map keypair end;
clasohm@0
  1248
wenzelm@233
  1249
(*given a list of (x, key) pairs and a searchkey
clasohm@0
  1250
  return the list of xs from each pair whose key equals searchkey*)
clasohm@0
  1251
fun keyfilter [] searchkey = []
wenzelm@233
  1252
  | keyfilter ((x, key) :: pairs) searchkey =
wenzelm@233
  1253
      if key = searchkey then x :: keyfilter pairs searchkey
wenzelm@233
  1254
      else keyfilter pairs searchkey;
clasohm@0
  1255
clasohm@0
  1256
clasohm@0
  1257
(*Partition list into elements that satisfy predicate and those that don't.
wenzelm@233
  1258
  Preserves order of elements in both lists.*)
clasohm@0
  1259
fun partition (pred: 'a->bool) (ys: 'a list) : ('a list * 'a list) =
clasohm@0
  1260
    let fun part ([], answer) = answer
wenzelm@233
  1261
          | part (x::xs, (ys, ns)) = if pred(x)
wenzelm@233
  1262
            then  part (xs, (x::ys, ns))
wenzelm@233
  1263
            else  part (xs, (ys, x::ns))
wenzelm@233
  1264
    in  part (rev ys, ([], []))  end;
clasohm@0
  1265
clasohm@0
  1266
clasohm@0
  1267
fun partition_eq (eq:'a * 'a -> bool) =
clasohm@0
  1268
    let fun part [] = []
wenzelm@233
  1269
          | part (x::ys) = let val (xs, xs') = partition (apl(x, eq)) ys
wenzelm@233
  1270
                           in (x::xs)::(part xs') end
clasohm@0
  1271
    in part end;
clasohm@0
  1272
clasohm@0
  1273
wenzelm@233
  1274
(*Partition a list into buckets  [ bi, b(i+1), ..., bj ]
clasohm@0
  1275
   putting x in bk if p(k)(x) holds.  Preserve order of elements if possible.*)
clasohm@0
  1276
fun partition_list p i j =
wenzelm@233
  1277
  let fun part k xs =
wenzelm@233
  1278
            if k>j then
clasohm@0
  1279
              (case xs of [] => []
clasohm@0
  1280
                         | _ => raise LIST "partition_list")
clasohm@0
  1281
            else
wenzelm@233
  1282
            let val (ns, rest) = partition (p k) xs;
wenzelm@233
  1283
            in  ns :: part(k+1)rest  end
clasohm@0
  1284
  in  part i end;
clasohm@0
  1285
clasohm@0
  1286
wenzelm@233
  1287
(* generating identifiers *)
clasohm@0
  1288
paulson@4063
  1289
(** Freshly generated identifiers; supplied prefix MUST start with a letter **)
clasohm@0
  1290
local
paulson@4063
  1291
(*Maps 0-63 to A-Z, a-z, 0-9 or _ or ' for generating random identifiers*)
paulson@4063
  1292
fun char i =      if i<26 then chr (ord "A" + i)
wenzelm@5904
  1293
             else if i<52 then chr (ord "a" + i - 26)
wenzelm@5904
  1294
             else if i<62 then chr (ord"0" + i - 52)
wenzelm@5904
  1295
             else if i=62 then "_"
wenzelm@5904
  1296
             else  (*i=63*)    "'";
paulson@4063
  1297
paulson@4063
  1298
val charVec = Vector.tabulate (64, char);
paulson@4063
  1299
wenzelm@5904
  1300
fun newid n =
wenzelm@5904
  1301
  let
wenzelm@4284
  1302
  in  implode (map (fn i => Vector.sub(charVec,i)) (radixpand (64,n)))  end;
paulson@2003
  1303
wenzelm@4284
  1304
val seedr = ref 0;
clasohm@0
  1305
paulson@4063
  1306
in
wenzelm@4284
  1307
wenzelm@12346
  1308
fun gensym pre = pre ^ (#1(newid (!seedr), inc seedr));
paulson@2003
  1309
paulson@4063
  1310
end;
paulson@4063
  1311
paulson@4063
  1312
wenzelm@233
  1313
(* lexical scanning *)
clasohm@0
  1314
wenzelm@233
  1315
(*scan a list of characters into "words" composed of "letters" (recognized by
wenzelm@233
  1316
  is_let) and separated by any number of non-"letters"*)
wenzelm@233
  1317
fun scanwords is_let cs =
clasohm@0
  1318
  let fun scan1 [] = []
wenzelm@233
  1319
        | scan1 cs =
wenzelm@233
  1320
            let val (lets, rest) = take_prefix is_let cs
wenzelm@233
  1321
            in implode lets :: scanwords is_let rest end;
wenzelm@233
  1322
  in scan1 (#2 (take_prefix (not o is_let) cs)) end;
clasohm@24
  1323
wenzelm@4212
  1324
clasohm@1364
  1325
end;
clasohm@1364
  1326
clasohm@1364
  1327
open Library;