fp-ts-std
fp-ts-std copied to clipboard
samhh
The missing pseudo-standard library for fp-ts.
The likes of `pureIf` and `memptyWhen` should probably take lazy values. Whilst they're usually used in lambdas with some laziness, they'd ideally delay computing the lifted value until the condition...
These two: - https://samhh.github.io/fp-ts-std/modules/Applicative.ts.html#when - https://samhh.github.io/fp-ts-std/modules/Applicative.ts.html#unless In case of `fp-ts` which has `Pointed` type class to support the `of`, seems unnecessary to require `Applicative` here, no?
Hi, I recently found myself using RTEs while working with Next.js's `getServerSideProps` function and figured that `RTE.unsafeUnwrap` might be useful to someone else as well 😄
Following #128, these can be defined roughly as: ```hs allPass fs x = andM $ flap fs x ```
Crucially these need to short-circuit. As per https://hackage.haskell.org/package/relude-1.1.0.0/docs/Relude-Foldable-Fold.html#v:andM: ```hs andM [putTextLn "1" >> pure True, putTextLn "2" >> pure False, putTextLn "3" >> pure True] -- 1 -- 2 --...
See `base` on `URL` constructor: https://developer.mozilla.org/en-US/docs/Web/API/URL/URL
Hi @samhh, thank you for your work. I'm aware of the [pinned issue](https://github.com/samhh/fp-ts-std/issues/89) that discusses the interaction between `jest` and `fp-ts-std`'s conditional exports. I'm having a similar issue with the...
```hs firstGood :: Alternative m => [a -> m b] -> a -> m b firstGood [] _ = empty firstGood (f:gs) x = f x firstGood gs x ```...