final
class
Foldable1Ops[F[_], A] extends Ops[F[A]]
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
implicit
val
F: Foldable1[F]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
final
def
distinct1(implicit A: Order[A]): NonEmptyList[A]
-
final
def
distinctE1(implicit A: Equal[A]): NonEmptyList[A]
-
-
-
def
finalize(): Unit
-
final
def
foldLeft1(f: (A, A) ⇒ A): A
-
final
def
foldMap1[B](f: (A) ⇒ B = (a: A) => a)(implicit arg0: Semigroup[B]): B
-
final
def
foldMapLeft1[B](z: (A) ⇒ B)(f: (B, A) ⇒ B): B
-
final
def
foldMapRight1[B](z: (A) ⇒ B)(f: (A, ⇒ B) ⇒ B): B
-
final
def
foldRight1(f: (A, ⇒ A) ⇒ A): A
-
final
def
foldl1(f: (A) ⇒ (A) ⇒ A): A
-
final
def
foldr1(f: (A) ⇒ (⇒ A) ⇒ A): A
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
intercalate1(a: A)(implicit A: Semigroup[A]): A
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
maximum1(implicit A: Order[A]): A
-
final
def
maximumBy1[B](f: (A) ⇒ B)(implicit arg0: Order[B]): A
-
final
def
maximumOf1[B](f: (A) ⇒ B)(implicit arg0: Order[B]): B
-
final
def
minimum1(implicit A: Order[A]): A
-
final
def
minimumBy1[B](f: (A) ⇒ B)(implicit arg0: Order[B]): A
-
final
def
minimumOf1[B](f: (A) ⇒ B)(implicit arg0: Order[B]): B
-
final
def
msuml1[G[_], B](implicit ev: ===[A, G[B]], G: Plus[G]): G[B]
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
psum1[G[_], B](implicit ev: ===[A, G[B]], G: Plus[G]): G[B]
-
final
def
psumMap1[G[_], B](f: (A) ⇒ G[B])(implicit G: Plus[G]): G[B]
-
final
def
scanLeft1(f: (A, A) ⇒ A): NonEmptyList[A]
-
final
def
scanRight1(f: (A, A) ⇒ A): NonEmptyList[A]
-
val
self: F[A]
-
final
def
suml1(implicit A: Semigroup[A]): A
-
final
def
sumr1(implicit A: Semigroup[A]): A
-
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
Wraps a value
self
and provides methods related toFoldable1