annotate src/fftw-3.3.3/genfft/monads.ml @ 44:9894b839b0cb

Updated MSVC
author Chris Cannam
date Tue, 18 Oct 2016 15:58:42 +0100
parents 37bf6b4a2645
children
rev   line source
Chris@10 1 (*
Chris@10 2 * Copyright (c) 1997-1999 Massachusetts Institute of Technology
Chris@10 3 * Copyright (c) 2003, 2007-11 Matteo Frigo
Chris@10 4 * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology
Chris@10 5 *
Chris@10 6 * This program is free software; you can redistribute it and/or modify
Chris@10 7 * it under the terms of the GNU General Public License as published by
Chris@10 8 * the Free Software Foundation; either version 2 of the License, or
Chris@10 9 * (at your option) any later version.
Chris@10 10 *
Chris@10 11 * This program is distributed in the hope that it will be useful,
Chris@10 12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@10 13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
Chris@10 14 * GNU General Public License for more details.
Chris@10 15 *
Chris@10 16 * You should have received a copy of the GNU General Public License
Chris@10 17 * along with this program; if not, write to the Free Software
Chris@10 18 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Chris@10 19 *
Chris@10 20 *)
Chris@10 21
Chris@10 22 (*************************************************************
Chris@10 23 * Monads
Chris@10 24 *************************************************************)
Chris@10 25
Chris@10 26 (*
Chris@10 27 * Phil Wadler has many well written papers about monads. See
Chris@10 28 * http://cm.bell-labs.com/cm/cs/who/wadler/
Chris@10 29 *)
Chris@10 30 (* vanilla state monad *)
Chris@10 31 module StateMonad = struct
Chris@10 32 let returnM x = fun s -> (x, s)
Chris@10 33
Chris@10 34 let (>>=) = fun m k ->
Chris@10 35 fun s ->
Chris@10 36 let (a', s') = m s
Chris@10 37 in let (a'', s'') = k a' s'
Chris@10 38 in (a'', s'')
Chris@10 39
Chris@10 40 let (>>) = fun m k ->
Chris@10 41 m >>= fun _ -> k
Chris@10 42
Chris@10 43 let rec mapM f = function
Chris@10 44 [] -> returnM []
Chris@10 45 | a :: b ->
Chris@10 46 f a >>= fun a' ->
Chris@10 47 mapM f b >>= fun b' ->
Chris@10 48 returnM (a' :: b')
Chris@10 49
Chris@10 50 let runM m x initial_state =
Chris@10 51 let (a, _) = m x initial_state
Chris@10 52 in a
Chris@10 53
Chris@10 54 let fetchState =
Chris@10 55 fun s -> s, s
Chris@10 56
Chris@10 57 let storeState newState =
Chris@10 58 fun _ -> (), newState
Chris@10 59 end
Chris@10 60
Chris@10 61 (* monad with built-in memoizing capabilities *)
Chris@10 62 module MemoMonad =
Chris@10 63 struct
Chris@10 64 open StateMonad
Chris@10 65
Chris@10 66 let memoizing lookupM insertM f k =
Chris@10 67 lookupM k >>= fun vMaybe ->
Chris@10 68 match vMaybe with
Chris@10 69 Some value -> returnM value
Chris@10 70 | None ->
Chris@10 71 f k >>= fun value ->
Chris@10 72 insertM k value >> returnM value
Chris@10 73
Chris@10 74 let runM initial_state m x = StateMonad.runM m x initial_state
Chris@10 75 end