h*     0.1.2 Safe-Inferredm  arrow-utilsWrap the Arrow in a newtype in order to create new class instances. This is a generalisation of  ArrowMonad, which is isomorphic to  a () c. arrow-utils:Creates arrows using f, then runs all arrows in the given , discarding the results. arrow-utils:Creates arrows using f, then runs all arrows in the given , collecting the results. "traverseArr (+) [1,10] 1 == [2,11] arrow-utilsLike , but discard the results. arrow-utilsRun all arrows in the given , collecting the results. %sequenceArr [(+1), (+10)] 1 == [2,11] arrow-utilsFans each input from  Vector n b+ to a separate arrow from the given vector. sequenceArrVec (Vec.generate ((+).fromIntegral) :: Vector 5 (Int -> Int)) (Vec.replicate 1 :: Vector 5 Int) == Vector [1,2,3,4,5] arrow-utilsFans each input from [b] to a separate arrow from the given list. The output list has length of the minimum of the input list length and the arrow list length.  sequenceArrList [(+1), (+10)] [1,2] == [2,12] sequenceArrList [(+1), (+10)] [1] == [2] sequenceArrList [(+1)] [1,2,3,4] == [2]  arrow-utils Similar to when for /. Relevant for arrows which embeded a Monad.  arrow-utils Similar to unless for /. Relevant for arrows which embeded a Monad.  arrow-utilsAlways output the given value.  arrow-utils runs the arrows in parallel  arrow-utils f postcomposes with f        (arrow-utils-0.1.2-Am2oFQQkpD72OKueInTzjNControl.Arrow.Utils arrow-utilsSameInputArrowunSameInputArrow traverseArr_ traverseArr sequenceArr_ sequenceArrzipSequenceArrVeczipSequenceArrListwhenArr unlessArr constantly$fApplicativeSameInputArrow$fFunctorSameInputArrowbase Data.FoldableFoldableData.Traversable TraversableGHC.Base Applicative<*>fmap