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