implicit class NonEmptyForEachOps[F[+_], A] extends AnyRef
Instance Constructors
- new NonEmptyForEachOps(self: F[A])
Value Members
- final def !=(arg0: Any): Boolean
- final def ##: Int
- final def ==(arg0: Any): Boolean
- final def asInstanceOf[T0]: T0
- def clone(): AnyRef
- final def eq(arg0: AnyRef): Boolean
- def equals(arg0: AnyRef): Boolean
- def finalize(): Unit
- def forEach1[G[+_], B](f: (A) => G[B])(implicit arg0: AssociativeBoth[G], arg1: Covariant[G], F: NonEmptyForEach[F]): G[F[B]]
- def forEach1_[G[+_]](f: (A) => G[Any])(implicit arg0: AssociativeBoth[G], arg1: Covariant[G], F: NonEmptyForEach[F]): G[Unit]
- final def getClass(): Class[_ <: AnyRef]
- def hashCode(): Int
- final def isInstanceOf[T0]: Boolean
- final def ne(arg0: AnyRef): Boolean
- final def notify(): Unit
- final def notifyAll(): Unit
- def reduce1(implicit F: NonEmptyForEach[F], A: Associative[A]): A
- def reduceAll(f: (A, A) => A)(implicit F: NonEmptyForEach[F]): A
- def reduceIdempotent1(implicit F: NonEmptyForEach[F], ia: Idempotent[A], ea: Equal[A]): A
- def reduceMap[B](f: (A) => B)(implicit arg0: Associative[B], F: NonEmptyForEach[F]): B
- def reduceMapLeft[B](map: (A) => B)(reduce: (B, A) => B)(implicit F: NonEmptyForEach[F]): B
- def reduceMapRight[B](map: (A) => B)(reduce: (A, B) => B)(implicit F: NonEmptyForEach[F]): B
- final def synchronized[T0](arg0: => T0): T0
- def toNonEmptyChunk(implicit F: NonEmptyForEach[F]): NonEmptyChunk[A]
- def toNonEmptyList(implicit F: NonEmptyForEach[F]): NonEmptyList[A]
- def toString(): String
- final def wait(): Unit
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit
Inherited from Any
Value Members
- final def asInstanceOf[T0]: T0
- final def isInstanceOf[T0]: Boolean
Ungrouped
- final def !=(arg0: Any): Boolean
- final def ##: Int
- final def ==(arg0: Any): Boolean
- final def asInstanceOf[T0]: T0
- def clone(): AnyRef
- final def eq(arg0: AnyRef): Boolean
- def equals(arg0: AnyRef): Boolean
- def finalize(): Unit
- def forEach1[G[+_], B](f: (A) => G[B])(implicit arg0: AssociativeBoth[G], arg1: Covariant[G], F: NonEmptyForEach[F]): G[F[B]]
- def forEach1_[G[+_]](f: (A) => G[Any])(implicit arg0: AssociativeBoth[G], arg1: Covariant[G], F: NonEmptyForEach[F]): G[Unit]
- final def getClass(): Class[_ <: AnyRef]
- def hashCode(): Int
- final def isInstanceOf[T0]: Boolean
- final def ne(arg0: AnyRef): Boolean
- final def notify(): Unit
- final def notifyAll(): Unit
- def reduce1(implicit F: NonEmptyForEach[F], A: Associative[A]): A
- def reduceAll(f: (A, A) => A)(implicit F: NonEmptyForEach[F]): A
- def reduceIdempotent1(implicit F: NonEmptyForEach[F], ia: Idempotent[A], ea: Equal[A]): A
- def reduceMap[B](f: (A) => B)(implicit arg0: Associative[B], F: NonEmptyForEach[F]): B
- def reduceMapLeft[B](map: (A) => B)(reduce: (B, A) => B)(implicit F: NonEmptyForEach[F]): B
- def reduceMapRight[B](map: (A) => B)(reduce: (A, B) => B)(implicit F: NonEmptyForEach[F]): B
- final def synchronized[T0](arg0: => T0): T0
- def toNonEmptyChunk(implicit F: NonEmptyForEach[F]): NonEmptyChunk[A]
- def toNonEmptyList(implicit F: NonEmptyForEach[F]): NonEmptyList[A]
- def toString(): String
- final def wait(): Unit
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit