trait
Ops[F[_], D] extends AnyRef
Type Members
-
abstract
type
TypeClassType <: Reducible[F]
Abstract Value Members
-
abstract
def
self: F[D]
-
abstract
val
typeClassInstance: TypeClassType
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
-
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
maximum(implicit A: Order[D]): D
-
def
minimum(implicit A: Order[D]): D
-
-
def
nonEmptyIntercalate(a: D)(implicit A: Semigroup[D]): D
-
def
nonEmptyPartition[B, C](f: (D) ⇒ Either[B, C]): Ior[NonEmptyList[B], NonEmptyList[C]]
-
def
nonEmptySequence_[G[_], A](implicit arg0: <:<[D, G[A]], G: Apply[G]): G[Unit]
-
def
nonEmptyTraverse_[G[_], B](f: (D) ⇒ G[B])(implicit G: Apply[G]): G[Unit]
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
reduce(implicit A: Semigroup[D]): D
-
def
reduceK[G[_], A](implicit arg0: <:<[D, G[A]], G: SemigroupK[G]): G[A]
-
def
reduceLeft(f: (D, D) ⇒ D): D
-
def
reduceLeftM[G[_], B](f: (D) ⇒ G[B])(g: (B, D) ⇒ G[B])(implicit G: FlatMap[G]): G[B]
-
def
reduceLeftTo[B](f: (D) ⇒ B)(g: (B, D) ⇒ B): B
-
def
reduceMap[B](f: (D) ⇒ B)(implicit B: Semigroup[B]): B
-
def
reduceMapM[G[_], B](f: (D) ⇒ G[B])(implicit G: FlatMap[G], B: Semigroup[B]): G[B]
-
def
reduceRight(f: (D, Eval[D]) ⇒ Eval[D]): Eval[D]
-
def
reduceRightTo[B](f: (D) ⇒ B)(g: (D, Eval[B]) ⇒ Eval[B]): Eval[B]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
