implicit class NonEmptyForEachOps[F[+_], A] extends AnyRef
Provides infix syntax for traversing collections.
- Alphabetic
- By Inheritance
- NonEmptyForEachOps
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
- new NonEmptyForEachOps(self: F[A])
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native() @HotSpotIntrinsicCandidate()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
forEach1[G[+_], B](f: (A) ⇒ G[B])(implicit arg0: AssociativeBoth[G], arg1: Covariant[G], F: NonEmptyForEach[F]): G[F[B]]
Traverse each element in the collection using the specified effectual function
f, returning a new collection with the results in the context of the effect. -
def
forEach1_[G[+_]](f: (A) ⇒ G[Any])(implicit arg0: AssociativeBoth[G], arg1: Covariant[G], F: NonEmptyForEach[F]): G[Unit]
Traverses each element in the collection with the specified effectual function
fpurely for its effects. -
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
reduce1(implicit F: NonEmptyForEach[F], A: Associative[A]): A
Reduces the non-empty collection of associative elements.
-
def
reduceAll(f: (A, A) ⇒ A)(implicit F: NonEmptyForEach[F]): A
Reduces the collection to a summary value using the binary function
f. -
def
reduceIdempotent1(implicit F: NonEmptyForEach[F], ia: Idempotent[A], ea: Equal[A]): A
Reduces the collection to a summary value using the idempotent operation, returning
Noneif the collection is empty. -
def
reduceMap[B](f: (A) ⇒ B)(implicit arg0: Associative[B], F: NonEmptyForEach[F]): B
Maps each element of the collection to a type
Bfor which a combine operation is defined using the functionfand then reduces those values to a single summary using the combine operation. -
def
reduceMapLeft[B](map: (A) ⇒ B)(reduce: (B, A) ⇒ B)(implicit F: NonEmptyForEach[F]): B
Reduces the elements of this collection from left to right using the function
mapto transform the first value to the typeBand then the functionreduceAllto combine theBvalue with each otherAvalue. -
def
reduceMapRight[B](map: (A) ⇒ B)(reduce: (A, B) ⇒ B)(implicit F: NonEmptyForEach[F]): B
Reduces the elements of this collection from right to left using the function
mapto transform the first value to the typeBand then the functionreduceAllto combine theBvalue with each otherAvalue. -
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toNonEmptyChunk(implicit F: NonEmptyForEach[F]): NonEmptyChunk[A]
Converts the collection to a
NonEmptyChunk. -
def
toNonEmptyList(implicit F: NonEmptyForEach[F]): NonEmptyList[A]
Converts the collection to a
NonEmptyList. -
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )