implicit final class TofuCollectionsSyntax[F[_], A] extends AnyVal
- Alphabetic
- By Inheritance
- TofuCollectionsSyntax
- AnyVal
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
- new TofuCollectionsSyntax(fa: F[A])
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- Any
-
final
def
##(): Int
- Definition Classes
- Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
getClass(): Class[_ <: AnyVal]
- Definition Classes
- AnyVal → Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
mapAccumF[G[_], B, C](start: B)(step: (B, A) ⇒ G[(B, C)])(implicit arg0: Monad[G], F: Traverse[F]): G[(B, F[C])]
like mapAccumL but also combines monadic effects of
Gstack-safety guaranteed via Free -
def
mapAccumF_[G[_], B, C](start: B)(step: (B, A) ⇒ G[(B, C)])(implicit arg0: Monad[G], F: Traverse[F]): G[F[C]]
like mapAccumF but drop the final state
-
def
mapAccumL[B, C](start: B)(step: (B, A) ⇒ (B, C))(implicit F: Traverse[F]): (B, F[C])
a combination of map and scanLeft it applies a function to each element of a structure, passing an accumulating parameter from left to right, and returning a final value of this accumulator together with the new structure.
-
def
mapAccumL_[B, C](start: B)(step: (B, A) ⇒ (B, C))(implicit F: Traverse[F]): F[C]
like mapAccumL, but drop the final state
-
def
mapAccumM[G[_], B, C](start: B)(step: (B, A) ⇒ G[(B, C)])(implicit arg0: Monad[G], F: Traverse[F]): G[(B, F[C])]
like mapAccumL but also combines monadic effects of
Gstack-safety relies on a stack safety of G -
def
mapAccumM_[G[_], B, C](start: B)(step: (B, A) ⇒ G[(B, C)])(implicit arg0: Monad[G], F: Traverse[F]): G[F[C]]
like mapAccumM but drop the final state
-
def
scanF[G[_], B](start: B)(step: (B, A) ⇒ G[B])(implicit arg0: Monad[G], F: Traverse[F]): G[(B, F[B])]
accumulate values effectfully, producing intermediate results initial state will posess a first item place in the traverse order final state is returned as a separate result
-
def
scanL[B](start: B)(step: (B, A) ⇒ B)(implicit F: Traverse[F]): (B, F[B])
accumulate values, producing intermediate results initial state will posess a first item place in the traverse order final state is returned as a separate result
-
def
toString(): String
- Definition Classes
- Any