We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.
You must be logged in to block users.
Contact GitHub support about this user’s behavior. Learn more about reporting abuse.
A cross-platform virtual tabletop for multiplayer card games
C++ 1.8k 512
A scala library for the Tak board game
Scala 16
Slides and video recording for my "Intro to Cats-Effect" talk
HTML 26 3
## The problem
I have some data which has adjacent entries that I want to group together and perform actions on.
I know roughly that `fs2.Pull` can be used to "step" through a stream and do more complicated
logic than the built in combinators allow. I don't know how to write one though!
| Operation | Input | Result | Notes |
| --- | --- | --- | --- |
| map | `F[A]` , `A => B` | `F[B]` | Functor |
| apply | `F[A]` , `F[A => B]` | `F[B]` | Applicative |
| (fa, fb, ...).mapN | `(F[A], F[B], ...)` , `(A, B, ...) => C` | `F[C]` | Applicative
### Parallels between `map` and similar functions
```
map :: F[A] => (A => B) => F[B]
flatMap :: F[A] => (A => F[B]) => F[B]
traverse :: G[A] => (A => F[B]) => F[G[B]]
There was an error while loading. Please reload this page.