Witherable
class Witherable[t: Type -> Type] with Traversable[t], Filterable[t]SourceA trait for data structures that can be traversed in left-to-right order with an applicative partial functor.
Class Definitions
def sequenceWither(t: t[m[Option[a]]]): m[t[a]] with Witherable[t], Applicative[m]
SourceReturns the result of running all the actions in the data structure t.
def wither(f: a -> m[Option[b]] \ ef, t: t[a]): m[t[b]] \ ef with Witherable[t], Applicative[m]
SourceReturns the result of applying the applicative partial mapping function f to all the elements of the
data structure t.