trait AllOps[F[_], A] extends Ops[F, A] with Traverse.AllOps[F, A] with Reducible.AllOps[F, A]
- Alphabetic
- By Inheritance
- AllOps
- AllOps
- Ops
- AllOps
- AllOps
- Ops
- AllOps
- AllOps
- Ops
- Ops
- AllOps
- AllOps
- Ops
- Ops
- Ops
- Ops
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Type Members
- abstract type TypeClassType <: NonEmptyTraverse[F]
Abstract Value Members
-
abstract
def
self: F[A]
- Definition Classes
- Ops
-
abstract
val
typeClassInstance: TypeClassType
- Definition Classes
- Ops
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
-
def
as[B](b: B): F[B]
- Definition Classes
- Ops
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
def
collectFirst[B](pf: PartialFunction[A, B]): Option[B]
- Definition Classes
- Ops
-
def
collectFirstSome[B](f: (A) ⇒ Option[B]): Option[B]
- Definition Classes
- Ops
-
def
collectFoldSome[B](f: (A) ⇒ Option[B])(implicit B: Monoid[B]): B
- Definition Classes
- Ops
-
def
combineAll(implicit arg0: Monoid[A]): A
- Definition Classes
- Ops
-
def
combineAllOption(implicit ev: Semigroup[A]): Option[A]
- Definition Classes
- Ops
-
def
dropWhile_(p: (A) ⇒ Boolean): List[A]
- Definition Classes
- Ops
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
exists(p: (A) ⇒ Boolean): Boolean
- Definition Classes
- Ops
-
def
existsM[G[_]](p: (A) ⇒ G[Boolean])(implicit G: Monad[G]): G[Boolean]
- Definition Classes
- Ops
-
def
filter_(p: (A) ⇒ Boolean): List[A]
- Definition Classes
- Ops
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
find(f: (A) ⇒ Boolean): Option[A]
- Definition Classes
- Ops
-
def
flatSequence[G[_], B](implicit arg0: <:<[A, G[F[B]]], G: Applicative[G], F: FlatMap[F]): G[F[B]]
- Definition Classes
- Ops
-
def
flatTraverse[G[_], B](f: (A) ⇒ G[F[B]])(implicit G: Applicative[G], F: FlatMap[F]): G[F[B]]
- Definition Classes
- Ops
-
final
def
fmap[B](f: (A) ⇒ B): F[B]
- Definition Classes
- Ops
-
def
fold(implicit A: Monoid[A]): A
- Definition Classes
- Ops
-
def
foldK[G[_], B](implicit arg0: <:<[A, G[B]], G: MonoidK[G]): G[B]
- Definition Classes
- Ops
-
def
foldLeft[B](b: B)(f: (B, A) ⇒ B): B
- Definition Classes
- Ops
-
final
def
foldLeftM[G[_], B](z: B)(f: (B, A) ⇒ G[B])(implicit G: Monad[G]): G[B]
- Definition Classes
- Ops
-
def
foldM[G[_], B](z: B)(f: (B, A) ⇒ G[B])(implicit G: Monad[G]): G[B]
- Definition Classes
- Ops
-
def
foldMap[B](f: (A) ⇒ B)(implicit B: Monoid[B]): B
- Definition Classes
- Ops
-
def
foldMapA[G[_], B](f: (A) ⇒ G[B])(implicit G: Applicative[G], B: Monoid[B]): G[B]
- Definition Classes
- Ops
-
def
foldMapM[G[_], B](f: (A) ⇒ G[B])(implicit G: Monad[G], B: Monoid[B]): G[B]
- Definition Classes
- Ops
-
def
foldRight[B](lb: Eval[B])(f: (A, Eval[B]) ⇒ Eval[B]): Eval[B]
- Definition Classes
- Ops
-
def
foldRightDefer[G[_], B](gb: G[B])(fn: (A, G[B]) ⇒ G[B])(implicit arg0: Defer[G]): G[B]
- Definition Classes
- Ops
-
def
forall(p: (A) ⇒ Boolean): Boolean
- Definition Classes
- Ops
-
def
forallM[G[_]](p: (A) ⇒ G[Boolean])(implicit G: Monad[G]): G[Boolean]
- Definition Classes
- Ops
-
def
fproduct[B](f: (A) ⇒ B): F[(A, B)]
- Definition Classes
- Ops
-
def
fproductLeft[B](f: (A) ⇒ B): F[(B, A)]
- Definition Classes
- Ops
-
def
get(idx: Long): Option[A]
- Definition Classes
- Ops
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
imap[B](f: (A) ⇒ B)(g: (B) ⇒ A): F[B]
- Definition Classes
- Ops
-
def
intercalate(a: A)(implicit A: Monoid[A]): A
- Definition Classes
- Ops
-
def
isEmpty: Boolean
- Definition Classes
- Ops
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
map[B](f: (A) ⇒ B): F[B]
- Definition Classes
- Ops
-
def
mapWithIndex[B](f: (A, Int) ⇒ B): F[B]
- Definition Classes
- Ops
-
def
maximum(implicit A: Order[A]): A
- Definition Classes
- Ops
-
def
maximumBy[B](f: (A) ⇒ B)(implicit arg0: Order[B]): A
- Definition Classes
- Ops
-
def
maximumByOption[B](f: (A) ⇒ B)(implicit arg0: Order[B]): Option[A]
- Definition Classes
- Ops
-
def
maximumOption(implicit A: Order[A]): Option[A]
- Definition Classes
- Ops
-
def
minimum(implicit A: Order[A]): A
- Definition Classes
- Ops
-
def
minimumBy[B](f: (A) ⇒ B)(implicit arg0: Order[B]): A
- Definition Classes
- Ops
-
def
minimumByOption[B](f: (A) ⇒ B)(implicit arg0: Order[B]): Option[A]
- Definition Classes
- Ops
-
def
minimumOption(implicit A: Order[A]): Option[A]
- Definition Classes
- Ops
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
nonEmpty: Boolean
- Definition Classes
- Ops
-
def
nonEmptyFlatSequence[G[_], B](implicit arg0: <:<[A, G[F[B]]], G: Apply[G], F: FlatMap[F]): G[F[B]]
- Definition Classes
- Ops
-
def
nonEmptyFlatTraverse[G[_], B](f: (A) ⇒ G[F[B]])(implicit G: Apply[G], F: FlatMap[F]): G[F[B]]
- Definition Classes
- Ops
-
def
nonEmptyIntercalate(a: A)(implicit A: Semigroup[A]): A
- Definition Classes
- Ops
-
def
nonEmptyPartition[B, C](f: (A) ⇒ Either[B, C]): Ior[NonEmptyList[B], NonEmptyList[C]]
- Definition Classes
- Ops
-
def
nonEmptySequence[G[_], B](implicit arg0: <:<[A, G[B]], arg1: Apply[G]): G[F[B]]
- Definition Classes
- Ops
-
def
nonEmptySequence_[G[_], B](implicit arg0: <:<[A, G[B]], G: Apply[G]): G[Unit]
- Definition Classes
- Ops
-
def
nonEmptyTraverse[G[_], B](f: (A) ⇒ G[B])(implicit arg0: Apply[G]): G[F[B]]
- Definition Classes
- Ops
-
def
nonEmptyTraverse_[G[_], B](f: (A) ⇒ G[B])(implicit G: Apply[G]): G[Unit]
- Definition Classes
- Ops
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
partitionEither[B, C](f: (A) ⇒ Either[B, C])(implicit A: Alternative[F]): (F[B], F[C])
- Definition Classes
- Ops
-
def
reduce(implicit A: Semigroup[A]): A
- Definition Classes
- Ops
-
def
reduceK[G[_], B](implicit arg0: <:<[A, G[B]], G: SemigroupK[G]): G[B]
- Definition Classes
- Ops
-
def
reduceLeft(f: (A, A) ⇒ A): A
- Definition Classes
- Ops
-
def
reduceLeftM[G[_], B](f: (A) ⇒ G[B])(g: (B, A) ⇒ G[B])(implicit G: FlatMap[G]): G[B]
- Definition Classes
- Ops
-
def
reduceLeftOption(f: (A, A) ⇒ A): Option[A]
- Definition Classes
- Ops
-
def
reduceLeftTo[B](f: (A) ⇒ B)(g: (B, A) ⇒ B): B
- Definition Classes
- Ops
-
def
reduceLeftToOption[B](f: (A) ⇒ B)(g: (B, A) ⇒ B): Option[B]
- Definition Classes
- Ops
-
def
reduceMap[B](f: (A) ⇒ B)(implicit B: Semigroup[B]): B
- Definition Classes
- Ops
-
def
reduceMapA[G[_], B](f: (A) ⇒ G[B])(implicit G: Apply[G], B: Semigroup[B]): G[B]
- Definition Classes
- Ops
-
def
reduceMapM[G[_], B](f: (A) ⇒ G[B])(implicit G: FlatMap[G], B: Semigroup[B]): G[B]
- Definition Classes
- Ops
-
def
reduceRight(f: (A, Eval[A]) ⇒ Eval[A]): Eval[A]
- Definition Classes
- Ops
-
def
reduceRightOption(f: (A, Eval[A]) ⇒ Eval[A]): Eval[Option[A]]
- Definition Classes
- Ops
-
def
reduceRightTo[B](f: (A) ⇒ B)(g: (A, Eval[B]) ⇒ Eval[B]): Eval[B]
- Definition Classes
- Ops
-
def
reduceRightToOption[B](f: (A) ⇒ B)(g: (A, Eval[B]) ⇒ Eval[B]): Eval[Option[B]]
- Definition Classes
- Ops
-
def
sequence[G[_], B](implicit arg0: <:<[A, G[B]], arg1: Applicative[G]): G[F[B]]
- Definition Classes
- Ops
-
def
sequence_[G[_], B](implicit arg0: <:<[A, G[B]], arg1: Applicative[G]): G[Unit]
- Definition Classes
- Ops
-
def
size: Long
- Definition Classes
- Ops
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
takeWhile_(p: (A) ⇒ Boolean): List[A]
- Definition Classes
- Ops
-
def
toIterable: Iterable[A]
- Definition Classes
- Ops
-
def
toList: List[A]
- Definition Classes
- Ops
-
def
toNonEmptyList: NonEmptyList[A]
- Definition Classes
- Ops
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
def
traverse[G[_], B](f: (A) ⇒ G[B])(implicit arg0: Applicative[G]): G[F[B]]
- Definition Classes
- Ops
-
def
traverseWithIndexM[G[_], B](f: (A, Int) ⇒ G[B])(implicit G: Monad[G]): G[F[B]]
- Definition Classes
- Ops
-
def
traverse_[G[_], B](f: (A) ⇒ G[B])(implicit G: Applicative[G]): G[Unit]
- Definition Classes
- Ops
-
def
tupleLeft[B](b: B): F[(B, A)]
- Definition Classes
- Ops
-
def
tupleRight[B](b: B): F[(A, B)]
- Definition Classes
- Ops
-
def
unorderedFold(implicit arg0: CommutativeMonoid[A]): A
- Definition Classes
- Ops
-
def
unorderedFoldMap[B](f: (A) ⇒ B)(implicit arg0: CommutativeMonoid[B]): B
- Definition Classes
- Ops
-
def
unorderedSequence[G[_], B](implicit arg0: <:<[A, G[B]], arg1: CommutativeApplicative[G]): G[F[B]]
- Definition Classes
- Ops
-
def
unorderedTraverse[G[_], B](f: (A) ⇒ G[B])(implicit arg0: CommutativeApplicative[G]): G[F[B]]
- Definition Classes
- Ops
-
def
void: F[Unit]
- Definition Classes
- Ops
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
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()
-
def
widen[B >: A]: F[B]
- Definition Classes
- Ops
-
def
zipWithIndex: F[(A, Int)]
- Definition Classes
- Ops