jkachmar jkachmar

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!

In the end we should have something like

def combineAdjacent[F[_], A](
 shouldCombine: (A, A) =&gt; Boolean,

Run NIXPKGS_ALLOW_UNFREE=1 nix develop --impure to enter the shell, then conda update conda.

	newtype JSONB a = JSONB { unJSONB :: a }
	deriving
	( Generic
	, Eq
	, Foldable
	, Functor
	, Ord
	, Read
	, Show
	, Traversable

	{-

	Oh no! You're lost in a twisty maze of IO lifting and unlifting, and you've come to
	an impossible fork: you're currently in some monad that is `MonadBaseControl IO m`,
	but you need to call a function in `MonadUnliftIO`. AND you need to call functions
	in your original monad transformer, too!

	We can make this work, but it's a bit hairy.

	MonadUnliftIO is a strictly less powerful type class than `MonadBaseControl IO`, so