Witherable

trait Witherable[t: Type -> Type] with Traversable[t], Filterable[t]Source

A trait for data structures that can be traversed in left-to-right order with an applicative partial functor.

instance Witherable[Chain]Source

instance Witherable[DelayList]Source

instance Witherable[List]Source

instance Witherable[Map[k]] with Order[k]Source

instance Witherable[Option]Source

instance Witherable[RedBlackTree[k]] with Order[k]Source

instance Witherable[Vector]Source

Trait Definitions

def sequenceWither(t: t[m[Option[a]]]): m[t[a]] \ Aef[t] with Witherable[t], Applicative[m] Source

Returns 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 + Aef[t] with Witherable[t], Applicative[m] Source

Returns the result of applying the applicative partial mapping function f to all the elements of the data structure t.