Mercurial > urweb

annotate src/flat_util.sml @ 28:104d43266b33

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Field sorting for Flat
author Adam Chlipala <adamc@hcoop.net>
date Tue, 10 Jun 2008 16:22:46 -0400
parents 4ab19c19665f
children 537db4ee89f4
rev   line source
adamc@26 1 (* Copyright (c) 2008, Adam Chlipala
adamc@26 2 * All rights reserved.
adamc@26 3 *
adamc@26 4 * Redistribution and use in source and binary forms, with or without
adamc@26 5 * modification, are permitted provided that the following conditions are met:
adamc@26 6 *
adamc@26 7 * - Redistributions of source code must retain the above copyright notice,
adamc@26 8 * this list of conditions and the following disclaimer.
adamc@26 9 * - Redistributions in binary form must reproduce the above copyright notice,
adamc@26 10 * this list of conditions and the following disclaimer in the documentation
adamc@26 11 * and/or other materials provided with the distribution.
adamc@26 12 * - The names of contributors may not be used to endorse or promote products
adamc@26 13 * derived from this software without specific prior written permission.
adamc@26 14 *
adamc@26 15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
adamc@26 16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
adamc@26 17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
adamc@26 18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
adamc@26 19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
adamc@26 20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
adamc@26 21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
adamc@26 22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
adamc@26 23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
adamc@26 24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
adamc@26 25 * POSSIBILITY OF SUCH DAMAGE.
adamc@26 26 *)
adamc@26 27
adamc@26 28 structure FlatUtil :> FLAT_UTIL = struct
adamc@26 29
adamc@26 30 open Flat
adamc@26 31
adamc@26 32 structure S = Search
adamc@26 33
adamc@26 34 structure Typ = struct
adamc@26 35
adamc@28 36 fun join (o1, o2) =
adamc@28 37 case o1 of
adamc@28 38 EQUAL => o2 ()
adamc@28 39 | v => v
adamc@28 40
adamc@28 41 fun joinL f (os1, os2) =
adamc@28 42 case (os1, os2) of
adamc@28 43 (nil, nil) => EQUAL
adamc@28 44 | (nil, _) => LESS
adamc@28 45 | (h1 :: t1, h2 :: t2) =>
adamc@28 46 join (f (h1, h2), fn () => joinL f (t1, t2))
adamc@28 47 | (_ :: _, nil) => GREATER
adamc@28 48
adamc@28 49 fun compare ((t1, _), (t2, _)) =
adamc@28 50 case (t1, t2) of
adamc@28 51 (TFun (d1, r1), TFun (d2, r2)) =>
adamc@28 52 join (compare (d1, d2), fn () => compare (r1, r2))
adamc@28 53 | (TCode (d1, r1), TCode (d2, r2)) =>
adamc@28 54 join (compare (d1, d2), fn () => compare (r1, r2))
adamc@28 55 | (TRecord xts1, TRecord xts2) =>
adamc@28 56 let
adamc@28 57 val xts2 = sortFields xts1
adamc@28 58 val xts2 = sortFields xts2
adamc@28 59 in
adamc@28 60 joinL compareFields (xts1, xts2)
adamc@28 61 end
adamc@28 62 | (TNamed n1, TNamed n2) => Int.compare (n1, n2)
adamc@28 63
adamc@28 64 | (TFun _, _) => LESS
adamc@28 65 | (_, TFun _) => GREATER
adamc@28 66
adamc@28 67 | (TCode _, _) => LESS
adamc@28 68 | (_, TCode _) => GREATER
adamc@28 69
adamc@28 70 | (TRecord _, _) => LESS
adamc@28 71 | (_, TRecord _) => GREATER
adamc@28 72
adamc@28 73 and compareFields ((x1, t1), (x2, t2)) =
adamc@28 74 join (String.compare (x1, x2),
adamc@28 75 fn () => compare (t1, t2))
adamc@28 76
adamc@28 77 and sortFields xts = ListMergeSort.sort (fn (x, y) => compareFields (x, y) = GREATER) xts
adamc@28 78
adamc@26 79 fun mapfold fc =
adamc@26 80 let
adamc@26 81 fun mft c acc =
adamc@26 82 S.bindP (mft' c acc, fc)
adamc@26 83
adamc@26 84 and mft' (cAll as (c, loc)) =
adamc@26 85 case c of
adamc@26 86 TFun (t1, t2) =>
adamc@26 87 S.bind2 (mft t1,
adamc@26 88 fn t1' =>
adamc@26 89 S.map2 (mft t2,
adamc@26 90 fn t2' =>
adamc@26 91 (TFun (t1', t2'), loc)))
adamc@26 92 | TCode (t1, t2) =>
adamc@26 93 S.bind2 (mft t1,
adamc@26 94 fn t1' =>
adamc@26 95 S.map2 (mft t2,
adamc@26 96 fn t2' =>
adamc@26 97 (TCode (t1', t2'), loc)))
adamc@26 98 | TRecord xts =>
adamc@26 99 S.map2 (ListUtil.mapfold (fn (x, t) =>
adamc@26 100 S.map2 (mft t,
adamc@26 101 fn t' =>
adamc@26 102 (x, t')))
adamc@26 103 xts,
adamc@26 104 fn xts' => (TRecord xts', loc))
adamc@26 105 | TNamed _ => S.return2 cAll
adamc@26 106 in
adamc@26 107 mft
adamc@26 108 end
adamc@26 109
adamc@26 110 fun map typ c =
adamc@26 111 case mapfold (fn c => fn () => S.Continue (typ c, ())) c () of
adamc@26 112 S.Return () => raise Fail "Flat_util.Typ.map"
adamc@26 113 | S.Continue (c, ()) => c
adamc@26 114
adamc@26 115 fun fold typ s c =
adamc@26 116 case mapfold (fn c => fn s => S.Continue (c, typ (c, s))) c s of
adamc@26 117 S.Continue (_, s) => s
adamc@26 118 | S.Return _ => raise Fail "FlatUtil.Typ.fold: Impossible"
adamc@26 119
adamc@26 120 fun exists typ k =
adamc@26 121 case mapfold (fn c => fn () =>
adamc@26 122 if typ c then
adamc@26 123 S.Return ()
adamc@26 124 else
adamc@26 125 S.Continue (c, ())) k () of
adamc@26 126 S.Return _ => true
adamc@26 127 | S.Continue _ => false
adamc@26 128
adamc@26 129 end
adamc@26 130
adamc@26 131 structure Exp = struct
adamc@26 132
adamc@26 133 datatype binder =
adamc@26 134 NamedT of string * int * typ option
adamc@26 135 | RelE of string * typ
adamc@26 136 | NamedE of string * int * typ * exp option
adamc@26 137
adamc@26 138 fun mapfoldB {typ = fc, exp = fe, bind} =
adamc@26 139 let
adamc@26 140 val mft = Typ.mapfold fc
adamc@26 141
adamc@26 142 fun mfe ctx e acc =
adamc@26 143 S.bindP (mfe' ctx e acc, fe ctx)
adamc@26 144
adamc@26 145 and mfe' ctx (eAll as (e, loc)) =
adamc@26 146 case e of
adamc@26 147 EPrim _ => S.return2 eAll
adamc@26 148 | ERel _ => S.return2 eAll
adamc@26 149 | ENamed _ => S.return2 eAll
adamc@26 150 | ECode _ => S.return2 eAll
adamc@26 151 | EApp (e1, e2) =>
adamc@26 152 S.bind2 (mfe ctx e1,
adamc@26 153 fn e1' =>
adamc@26 154 S.map2 (mfe ctx e2,
adamc@26 155 fn e2' =>
adamc@26 156 (EApp (e1', e2'), loc)))
adamc@26 157
adamc@26 158 | ERecord xes =>
adamc@26 159 S.map2 (ListUtil.mapfold (fn (x, e) =>
adamc@26 160 S.map2 (mfe ctx e,
adamc@26 161 fn e' =>
adamc@26 162 (x, e')))
adamc@26 163 xes,
adamc@26 164 fn xes' =>
adamc@26 165 (ERecord xes', loc))
adamc@26 166 | EField (e, x) =>
adamc@26 167 S.map2 (mfe ctx e,
adamc@26 168 fn e' =>
adamc@26 169 (EField (e', x), loc))
adamc@26 170
adamc@26 171 | ELet (xes, e) =>
adamc@26 172 S.bind2 (ListUtil.mapfold (fn (x, e) =>
adamc@26 173 S.map2 (mfe ctx e,
adamc@26 174 fn e' =>
adamc@26 175 (x, e')))
adamc@26 176 xes,
adamc@26 177 fn xes' =>
adamc@26 178 S.map2 (mfe ctx e,
adamc@26 179 fn e' =>
adamc@26 180 (ELet (xes', e'), loc)))
adamc@26 181 in
adamc@26 182 mfe
adamc@26 183 end
adamc@26 184
adamc@26 185 fun mapfold {typ = fc, exp = fe} =
adamc@26 186 mapfoldB {typ = fc,
adamc@26 187 exp = fn () => fe,
adamc@26 188 bind = fn ((), _) => ()} ()
adamc@26 189
adamc@26 190 fun mapB {typ, exp, bind} ctx e =
adamc@26 191 case mapfoldB {typ = fn c => fn () => S.Continue (typ c, ()),
adamc@26 192 exp = fn ctx => fn e => fn () => S.Continue (exp ctx e, ()),
adamc@26 193 bind = bind} ctx e () of
adamc@26 194 S.Continue (e, ()) => e
adamc@26 195 | S.Return _ => raise Fail "FlatUtil.Exp.mapB: Impossible"
adamc@26 196
adamc@26 197 fun map {typ, exp} e =
adamc@26 198 case mapfold {typ = fn c => fn () => S.Continue (typ c, ()),
adamc@26 199 exp = fn e => fn () => S.Continue (exp e, ())} e () of
adamc@26 200 S.Return () => raise Fail "Flat_util.Exp.map"
adamc@26 201 | S.Continue (e, ()) => e
adamc@26 202
adamc@26 203 fun fold {typ, exp} s e =
adamc@26 204 case mapfold {typ = fn c => fn s => S.Continue (c, typ (c, s)),
adamc@26 205 exp = fn e => fn s => S.Continue (e, exp (e, s))} e s of
adamc@26 206 S.Continue (_, s) => s
adamc@26 207 | S.Return _ => raise Fail "FlatUtil.Exp.fold: Impossible"
adamc@26 208
adamc@26 209 fun exists {typ, exp} k =
adamc@26 210 case mapfold {typ = fn c => fn () =>
adamc@26 211 if typ c then
adamc@26 212 S.Return ()
adamc@26 213 else
adamc@26 214 S.Continue (c, ()),
adamc@26 215 exp = fn e => fn () =>
adamc@26 216 if exp e then
adamc@26 217 S.Return ()
adamc@26 218 else
adamc@26 219 S.Continue (e, ())} k () of
adamc@26 220 S.Return _ => true
adamc@26 221 | S.Continue _ => false
adamc@26 222
adamc@26 223 end
adamc@26 224
adamc@26 225 structure Decl = struct
adamc@26 226
adamc@26 227 datatype binder = datatype Exp.binder
adamc@26 228
adamc@26 229 fun mapfoldB {typ = fc, exp = fe, decl = fd, bind} =
adamc@26 230 let
adamc@26 231 val mft = Typ.mapfold fc
adamc@26 232
adamc@26 233 val mfe = Exp.mapfoldB {typ = fc, exp = fe, bind = bind}
adamc@26 234
adamc@26 235 fun mfd ctx d acc =
adamc@26 236 S.bindP (mfd' ctx d acc, fd ctx)
adamc@26 237
adamc@26 238 and mfd' ctx (dAll as (d, loc)) =
adamc@26 239 case d of
adamc@26 240 DVal (x, n, t, e) =>
adamc@26 241 S.bind2 (mft t,
adamc@26 242 fn t' =>
adamc@26 243 S.map2 (mfe ctx e,
adamc@26 244 fn e' =>
adamc@26 245 (DVal (x, n, t', e'), loc)))
adamc@26 246 | DFun (n, x, dom, ran, e) =>
adamc@26 247 S.bind2 (mft dom,
adamc@26 248 fn dom' =>
adamc@26 249 S.bind2 (mft ran,
adamc@26 250 fn ran' =>
adamc@26 251 S.map2 (mfe ctx e,
adamc@26 252 fn e' =>
adamc@26 253 (DFun (n, x, dom', ran', e'), loc))))
adamc@26 254 in
adamc@26 255 mfd
adamc@26 256 end
adamc@26 257
adamc@26 258 fun mapfold {typ = fc, exp = fe, decl = fd} =
adamc@26 259 mapfoldB {typ = fc,
adamc@26 260 exp = fn () => fe,
adamc@26 261 decl = fn () => fd,
adamc@26 262 bind = fn ((), _) => ()} ()
adamc@26 263
adamc@26 264 fun fold {typ, exp, decl} s d =
adamc@26 265 case mapfold {typ = fn c => fn s => S.Continue (c, typ (c, s)),
adamc@26 266 exp = fn e => fn s => S.Continue (e, exp (e, s)),
adamc@26 267 decl = fn d => fn s => S.Continue (d, decl (d, s))} d s of
adamc@26 268 S.Continue (_, s) => s
adamc@26 269 | S.Return _ => raise Fail "FlatUtil.Decl.fold: Impossible"
adamc@26 270
adamc@26 271 end
adamc@26 272
adamc@26 273 structure File = struct
adamc@26 274
adamc@26 275 datatype binder =
adamc@26 276 NamedT of string * int * typ option
adamc@26 277 | RelE of string * typ
adamc@26 278 | NamedE of string * int * typ * exp option
adamc@26 279 | F of int * string * Flat.typ * Flat.typ * Flat.exp
adamc@26 280
adamc@26 281 fun mapfoldB (all as {bind, ...}) =
adamc@26 282 let
adamc@26 283 val mfd = Decl.mapfoldB all
adamc@26 284
adamc@26 285 fun mff ctx ds =
adamc@26 286 case ds of
adamc@26 287 nil => S.return2 nil
adamc@26 288 | d :: ds' =>
adamc@26 289 S.bind2 (mfd ctx d,
adamc@26 290 fn d' =>
adamc@26 291 let
adamc@26 292 val b =
adamc@26 293 case #1 d' of
adamc@26 294 DVal (x, n, t, e) => NamedE (x, n, t, SOME e)
adamc@26 295 | DFun v => F v
adamc@26 296 val ctx' = bind (ctx, b)
adamc@26 297 in
adamc@26 298 S.map2 (mff ctx' ds',
adamc@26 299 fn ds' =>
adamc@26 300 d' :: ds')
adamc@26 301 end)
adamc@26 302 in
adamc@26 303 mff
adamc@26 304 end
adamc@26 305
adamc@26 306 fun mapfold {typ = fc, exp = fe, decl = fd} =
adamc@26 307 mapfoldB {typ = fc,
adamc@26 308 exp = fn () => fe,
adamc@26 309 decl = fn () => fd,
adamc@26 310 bind = fn ((), _) => ()} ()
adamc@26 311
adamc@26 312 fun mapB {typ, exp, decl, bind} ctx ds =
adamc@26 313 case mapfoldB {typ = fn c => fn () => S.Continue (typ c, ()),
adamc@26 314 exp = fn ctx => fn e => fn () => S.Continue (exp ctx e, ()),
adamc@26 315 decl = fn ctx => fn d => fn () => S.Continue (decl ctx d, ()),
adamc@26 316 bind = bind} ctx ds () of
adamc@26 317 S.Continue (ds, ()) => ds
adamc@26 318 | S.Return _ => raise Fail "FlatUtil.File.mapB: Impossible"
adamc@26 319
adamc@26 320 fun fold {typ, exp, decl} s d =
adamc@26 321 case mapfold {typ = fn c => fn s => S.Continue (c, typ (c, s)),
adamc@26 322 exp = fn e => fn s => S.Continue (e, exp (e, s)),
adamc@26 323 decl = fn d => fn s => S.Continue (d, decl (d, s))} d s of
adamc@26 324 S.Continue (_, s) => s
adamc@26 325 | S.Return _ => raise Fail "FlatUtil.File.fold: Impossible"
adamc@26 326
adamc@26 327 end
adamc@26 328
adamc@26 329 end