trait Ops[F[_], A] extends Serializable
- Alphabetic
- By Inheritance
- Ops
- Serializable
- Serializable
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Abstract Value Members
- abstract def self: F[A]
- abstract val typeClassInstance: TypeClassType
Concrete 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() @IntrinsicCandidate()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def maximum(implicit A: Order[A]): A
- def maximumBy[B](f: (A) ⇒ B)(implicit arg0: Order[B]): A
- def maximumByNel[B](f: (A) ⇒ B)(implicit arg0: Order[B]): NonEmptyList[A]
- def maximumNel(implicit A: Order[A]): NonEmptyList[A]
- def minimum(implicit A: Order[A]): A
- def minimumBy[B](f: (A) ⇒ B)(implicit arg0: Order[B]): A
- def minimumByNel[B](f: (A) ⇒ B)(implicit arg0: Order[B]): NonEmptyList[A]
- def minimumNel(implicit A: Order[A]): NonEmptyList[A]
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def nonEmptyIntercalate(a: A)(implicit A: Semigroup[A]): A
- def nonEmptyPartition[B, C](f: (A) ⇒ Either[B, C]): Ior[NonEmptyList[B], NonEmptyList[C]]
- def nonEmptySequence_[G[_], B](implicit arg0: <:<[A, G[B]], G: Apply[G]): G[Unit]
- def nonEmptyTraverse_[G[_], B](f: (A) ⇒ G[B])(implicit G: Apply[G]): G[Unit]
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
- def reduce(implicit A: Semigroup[A]): A
- def reduceK[G[_], B](implicit arg0: <:<[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])(implicit G: FlatMap[G]): G[B]
- def reduceLeftTo[B](f: (A) ⇒ B)(g: (B, A) ⇒ B): B
- def reduceMap[B](f: (A) ⇒ B)(implicit B: Semigroup[B]): B
- def reduceMapA[G[_], B](f: (A) ⇒ G[B])(implicit G: Apply[G], B: Semigroup[B]): G[B]
- def reduceMapM[G[_], B](f: (A) ⇒ G[B])(implicit 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]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
- def toNonEmptyList: NonEmptyList[A]
-
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( ... )