Data.Diverse.Profunctor.Many

Combinators similar to Profunctor Strong

itemized :: forall w a b s t. Itemized w a b s t => w a b -> w s t

Like Strong or Arrow but lifting into Many

itemized' :: Profunctor w => w a b -> w (Many '[a]) (Many '[b])

Like Strong or Arrow but lifting into Many of one type

projected :: forall proxy w a1 a2 b1 b2. Projected w a1 a2 b1 b2 => proxy a2 -> w (Many a1) (Many b1) -> w (Many a2) (Many b2)

Like Strong or Arrow but lifting from a Many to a Many of another type

(*&&*) :: forall w a1 a2 a3 b1 b2 b3. SelectWith w a1 a2 a3 b1 b2 b3 => w (Many a1) (Many b1) -> w (Many a2) (Many b2) -> w (Many a3) (Many b3) infixr 3

Split the input between the two argument arrows and combine their output. The type of the resultant input is a Many of all the unique types in the argument arrows' inputs, The type of the resultant output is a concatenated Many of the arguments arrows' outputs. Analogous to a Many combination of both of *** and &&&. It is a compile error if the types are not distinct in each of the argument arrow inputs.

(>&&>) :: forall w a a2 b1 b2 b3. ThenSelect w a2 b1 b2 b3 => w a (Many b1) -> w (Many a2) (Many b2) -> w a (Many b3) infixr 3

Left-to-right chaining of arrows one after another, where left over input not consumed by the right arrow is forwarded to the output. It is a compile error if the types are not distinct in each of the argument arrow inputs, or if the input of the second arrow is not a subset of the output of the first arrow.

(<&&<) :: ThenSelect w a2 b1 b2 b3 => w (Many a2) (Many b2) -> w a (Many b1) -> w a (Many b3) infixl 2

right-to-left version of '(>&&>)'