Max

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 aggregator[T](implicit ord: Ordering[T]): MaxAggregator[T]

Returns an Aggregator that selects the maximum instance of an ordered type T in the aggregated stream.
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
implicit def doubleMonoid: Monoid[Max[Double]] with BoundedSemilattice[Max[Double]]

Monoid for Max [Double] with zero == Double.MinValue Note: MinValue > NegativeInfinity, but people may be relying on this emitting a non-infinite number.
Monoid for Max [Double] with zero == Double.MinValue Note: MinValue > NegativeInfinity, but people may be relying on this emitting a non-infinite number. Sadness

Definition Classes
MaxInstances
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
implicit def equiv[T](implicit eq: Equiv[T]): Equiv[Max[T]]

Definition Classes
LowPriorityMaxInstances
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
implicit def floatMonoid: Monoid[Max[Float]] with BoundedSemilattice[Max[Float]]

Monoid for Max [Float] with zero == Float.MinValue Note: MinValue > NegativeInfinity, but people may be relying on this emitting a non-infinite number.
Monoid for Max [Float] with zero == Float.MinValue Note: MinValue > NegativeInfinity, but people may be relying on this emitting a non-infinite number. Sadness

Definition Classes
MaxInstances
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
implicit def intMonoid: Monoid[Max[Int]] with BoundedSemilattice[Max[Int]]

Monoid for Max[Int] with zero == Int.MinValue
Monoid for Max[Int] with zero == Int.MinValue

Definition Classes
MaxInstances
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
implicit def listMonoid[T](implicit arg0: Ordering[T]): Monoid[Max[List[T]]] with BoundedSemilattice[Max[List[T]]]

Returns a Monoid instance for Max[List[T]] that compares lists first by length and then element-wise by T, and returns the maximum value.
Returns a Monoid instance for Max[List[T]] that compares lists first by length and then element-wise by T, and returns the maximum value.

Definition Classes
LowPriorityMaxInstances
implicit def longMonoid: Monoid[Max[Long]] with BoundedSemilattice[Max[Long]]

Monoid for Max[Long] with zero == Long.MinValue
Monoid for Max[Long] with zero == Long.MinValue

Definition Classes
MaxInstances
def maxSemigroup[T](implicit ord: Ordering[T]): Semigroup[T] with Semilattice[T]

Returns a Semigroup instance with a plus implementation that always returns the maximum T argument.
def monoid[T](zero: ⇒ T)(implicit arg0: Ordering[T]): Monoid[Max[T]] with BoundedSemilattice[Max[T]]

Returns a Monoid instance for Max [T] that combines instances using Max.max and uses zero for its identity.
Returns a Monoid instance for Max [T] that combines instances using Max.max and uses zero for its identity.
zero
identity of the returned Monoid instance

Definition Classes
LowPriorityMaxInstances
Note
zero must be <= every element of T for the returned instance to be lawful.
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
implicit def ordering[T](implicit arg0: Ordering[T]): Ordering[Max[T]]

Definition Classes
LowPriorityMaxInstances
implicit def semigroup[T](implicit arg0: Ordering[T]): Semigroup[Max[T]] with Semilattice[Max[T]]

Returns a Semigroup instance for Max [T].
Returns a Semigroup instance for Max [T]. The plus implementation always returns the maximum Max[T] argument.

Definition Classes
LowPriorityMaxInstances
implicit def streamMonoid[T](implicit arg0: Ordering[T]): Monoid[Max[Stream[T]]] with BoundedSemilattice[Max[Stream[T]]]

Returns a Monoid instance for Max[Stream[T]] that compares lists first by length and then element-wise by T, and returns the maximum value.
Returns a Monoid instance for Max[Stream[T]] that compares lists first by length and then element-wise by T, and returns the maximum value.

Definition Classes
LowPriorityMaxInstances
implicit def stringMonoid: Monoid[Max[String]]

Monoid for Max[String] with zero == ""
Monoid for Max[String] with zero == ""

Definition Classes
MaxInstances
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
implicit def vectorMonoid[T](implicit arg0: Ordering[T]): Monoid[Max[Vector[T]]] with BoundedSemilattice[Max[Vector[T]]]

Returns a Monoid instance for Max[Vector[T]] that compares lists first by length and then element-wise by T, and returns the maximum value.
Returns a Monoid instance for Max[Vector[T]] that compares lists first by length and then element-wise by T, and returns the maximum value.

Definition Classes
LowPriorityMaxInstances
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( ... )

Related Docs: class Max | package algebird

object Max extends MaxInstances with Serializable

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def aggregator[T](implicit ord: Ordering[T]): MaxAggregator[T]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

implicit def doubleMonoid: Monoid[Max[Double]] with BoundedSemilattice[Max[Double]]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

implicit def equiv[T](implicit eq: Equiv[T]): Equiv[Max[T]]

def finalize(): Unit

implicit def floatMonoid: Monoid[Max[Float]] with BoundedSemilattice[Max[Float]]

final def getClass(): Class[_]

def hashCode(): Int

implicit def intMonoid: Monoid[Max[Int]] with BoundedSemilattice[Max[Int]]

final def isInstanceOf[T0]: Boolean

implicit def listMonoid[T](implicit arg0: Ordering[T]): Monoid[Max[List[T]]] with BoundedSemilattice[Max[List[T]]]

implicit def longMonoid: Monoid[Max[Long]] with BoundedSemilattice[Max[Long]]

def maxSemigroup[T](implicit ord: Ordering[T]): Semigroup[T] with Semilattice[T]

def monoid[T](zero: ⇒ T)(implicit arg0: Ordering[T]): Monoid[Max[T]] with BoundedSemilattice[Max[T]]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

implicit def ordering[T](implicit arg0: Ordering[T]): Ordering[Max[T]]

implicit def semigroup[T](implicit arg0: Ordering[T]): Semigroup[Max[T]] with Semilattice[Max[T]]

implicit def streamMonoid[T](implicit arg0: Ordering[T]): Monoid[Max[Stream[T]]] with BoundedSemilattice[Max[Stream[T]]]

implicit def stringMonoid: Monoid[Max[String]]

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

implicit def vectorMonoid[T](implicit arg0: Ordering[T]): Monoid[Max[Vector[T]]] with BoundedSemilattice[Max[Vector[T]]]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from Serializable

Inherited from Serializable

Inherited from MaxInstances

Inherited from LowPriorityMaxInstances

Inherited from AnyRef

Inherited from Any

Ungrouped