Kai Sellgren kaisellgren
mpilquist
/ State.scala
Created
February 24, 2013 21:57
Example of computing Fibonacci sequence with Scala 2.10 and memoizing State monad
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| trait State[S, A] { | |
| val run: S => (S, A) | |
| def apply(s: S): (S, A) = | |
| run(s) | |
| def eval(s: S): A = | |
| apply(s)._2 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import scalaz._ | |
| import Scalaz._ | |
| /** | |
| * Use the state monad to 'process a trade' and store the new trade. | |
| * As well as processing the trade, handle validation errors. | |
| */ | |
| object StateMonad extends App { | |
| case class Trade(info: String) |