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