view demo/refFun.ur @ 469:b393c2fc80f8

About to begin optimization of recursive transaction functions
author Adam Chlipala <adamc@hcoop.net>
date Thu, 06 Nov 2008 17:09:53 -0500
parents c471345f5165
children 20fab0e96217
line wrap: on
line source
functor Make(M : sig
                 type data
                 val inj : sql_injectable data
             end) = struct

    type ref = int

    sequence s
    table t : { Id : int, Data : M.data }

    fun new d =
        id <- nextval s;
        dml (INSERT INTO t (Id, Data) VALUES ({id}, {d}));
        return id

    fun read r =
        o <- oneOrNoRows (SELECT t.Data FROM t WHERE t.Id = {r});
        return (case o of
            None => error <xml>You already deleted that ref!</xml>
          | Some r => r.T.Data)

    fun write r d =
        dml (UPDATE t SET Data = {d} WHERE Id = {r})

    fun delete r =
        dml (DELETE FROM t WHERE Id = {r})

end