[Functional Programming Monad] Combine Stateful Computations Using A State Monad

The true power of the State ADT really shows when we start combining our discrete, stateful transactions. We start looking at another construction helper named of, used to lift any given value of any type into the resultant. We also explore another instance method called chain that is used for combining our simple, discrete transactions into more complex flows that can be extended to meet our needs as they arise. To create a set of stateful transactions to be combined, we see how the get and modify construction helpers can be used to make simple, easy to read code.

 

const { constant, Pair, Unit, curry, objOf, compose, State, mapProps, prop, option } = require("crocks");

const { put, get, modify } = State;


const add = x => y => x+y;
const inc = add(1);

// State s a -> State(x => Pair(a, x))

// 'get' return result apply to variable a
const addState = n => 
    get(add(n))

const incState = n => 
    modify(inc) // modify return Unit() in variable position, Pair( (), 3 )
    .map(constant(n)) // to keep the vairable a, we can use constant to wrap a value into function, Pair( 12, 3 )

const compute = n => 
    State.of(n)
        .chain(addState)
        .chain(incState)


 console.log(
     compute(10)
        .runWith(2)
 )       

 

转载于:https://www.cnblogs.com/Answer1215/p/10338745.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值