Ops

trait Ops[F[_], A] extends Serializable
trait Serializable
class Object
trait Matchable
class Any
trait AllOps[F, A]
trait AllOps[F, A]

Type members

Types

Value members

Abstract methods

def self: F[A]

Concrete methods

def maximum(A: Order[A]): A
def maximumBy[B](f: A => B)(`ev$1`: Order[B]): A
def maximumByNel[B](f: A => B)(`ev$1`: Order[B]): NonEmptyList[A]
def maximumNel(A: Order[A]): NonEmptyList[A]
def minimum(A: Order[A]): A
def minimumBy[B](f: A => B)(`ev$1`: Order[B]): A
def minimumByNel[B](f: A => B)(`ev$1`: Order[B]): NonEmptyList[A]
def minimumNel(A: Order[A]): NonEmptyList[A]
def nonEmptyIntercalate(a: A)(A: Semigroup[A]): A
def nonEmptyPartition[B, C](f: A => Either[B, C]): Ior[NonEmptyList[B], NonEmptyList[C]]
def nonEmptySequence_[G[_], B](`ev$1`: A <:< G[B], G: Apply[G]): G[Unit]
def nonEmptyTraverse_[G[_], B](f: A => G[B])(G: Apply[G]): G[Unit]
def reduce(A: Semigroup[A]): A
def reduceK[G[_], B](`ev$1`: A <:< G[B], G: SemigroupK[G]): G[B]
def reduceLeft(f: (A, A) => A): A
def reduceLeftM[G[_], B](f: A => G[B])(g: (B, A) => G[B])(G: FlatMap[G]): G[B]
def reduceLeftTo[B](f: A => B)(g: (B, A) => B): B
def reduceMap[B](f: A => B)(B: Semigroup[B]): B
def reduceMapA[G[_], B](f: A => G[B])(G: Apply[G], B: Semigroup[B]): G[B]
def reduceMapM[G[_], B](f: A => G[B])(G: FlatMap[G], B: Semigroup[B]): G[B]
def reduceRight(f: (A, Eval[A]) => Eval[A]): Eval[A]
def reduceRightTo[B](f: A => B)(g: (A, Eval[B]) => Eval[B]): Eval[B]

Abstract fields