ApplicativeGroup

Instance Constructors

new ApplicativeGroup()(implicit app: Applicative[M], grp: Group[T])

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 additive: algebra.Group[M[T]]

These are from algebra.Monoid
These are from algebra.Monoid

Definition Classes
Group → AdditiveGroup → Monoid → AdditiveMonoid → Semigroup → AdditiveSemigroup
final def asInstanceOf[T0]: T0

Definition Classes
Any
def assertNotZero(v: M[T]): Unit

Definition Classes
Monoid
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def combine(l: M[T], r: M[T]): M[T]

Definition Classes
Semigroup → Semigroup
def combineAll(t: TraversableOnce[M[T]]): M[T]

Definition Classes
Monoid → Monoid
def combineAllOption(as: IterableOnce[M[T]]): Option[M[T]]

Definition Classes
Monoid → Semigroup
def combineN(a: M[T], n: Int): M[T]

Definition Classes
Group → Monoid → Semigroup
def empty: M[T]

Definition Classes
Monoid → Monoid
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
def inverse(v: M[T]): M[T]

Definition Classes
Group → Group
def isEmpty(a: M[T])(implicit ev: Eq[M[T]]): Boolean

Definition Classes
Monoid
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isNonZero(v: M[T]): Boolean

Definition Classes
Monoid
def isZero(a: M[T])(implicit ev: Eq[M[T]]): Boolean

Definition Classes
AdditiveMonoid
def minus(l: M[T], r: M[T]): M[T]

Definition Classes
ApplicativeGroup → AdditiveGroup
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def negate(v: M[T]): M[T]

Definition Classes
ApplicativeGroup → AdditiveGroup
def nonZeroOption(v: M[T]): Option[M[T]]

Definition Classes
Monoid
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def plus(l: M[T], r: M[T]): M[T]

Definition Classes
ApplicativeSemigroup → AdditiveSemigroup
def positiveSumN(a: M[T], n: Int): M[T]

Attributes
protected[this]
Definition Classes
AdditiveSemigroup
def remove(l: M[T], r: M[T]): M[T]

Definition Classes
Group → Group
def repeatedCombineN(a: M[T], n: Int): M[T]

Attributes
protected[this]
Definition Classes
Semigroup
def sum(vs: TraversableOnce[M[T]]): M[T]

Definition Classes
Monoid → AdditiveMonoid
def sumN(a: M[T], n: Int): M[T]

Definition Classes
AdditiveGroup → AdditiveMonoid → AdditiveSemigroup
def sumOption(iter: TraversableOnce[M[T]]): Option[M[T]]

Returns an instance of T calculated by summing all instances in iter in one pass.
Returns an instance of T calculated by summing all instances in iter in one pass. Returns None if iter is empty, else Some[ T].
iter
instances of T to be combined
returns
None if iter is empty, else an option value containing the summed T

Definition Classes
Semigroup
Note
Override if there is a faster way to compute this sum than iter.reduceLeftOption using plus.
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
def trySum(as: TraversableOnce[M[T]]): Option[M[T]]

Definition Classes
AdditiveMonoid → AdditiveSemigroup
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( ... )
lazy val zero: M[T]

Definition Classes
ApplicativeMonoid → AdditiveMonoid

Related Doc: package algebird

class ApplicativeGroup[T, M[_]] extends ApplicativeMonoid[T, M] with Group[M[T]]

Instance Constructors

new ApplicativeGroup()(implicit app: Applicative[M], grp: Group[T])

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def additive: algebra.Group[M[T]]

final def asInstanceOf[T0]: T0

def assertNotZero(v: M[T]): Unit

def clone(): AnyRef

def combine(l: M[T], r: M[T]): M[T]

def combineAll(t: TraversableOnce[M[T]]): M[T]

def combineAllOption(as: IterableOnce[M[T]]): Option[M[T]]

def combineN(a: M[T], n: Int): M[T]

def empty: M[T]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

def inverse(v: M[T]): M[T]

def isEmpty(a: M[T])(implicit ev: Eq[M[T]]): Boolean

final def isInstanceOf[T0]: Boolean

def isNonZero(v: M[T]): Boolean

def isZero(a: M[T])(implicit ev: Eq[M[T]]): Boolean

def minus(l: M[T], r: M[T]): M[T]

final def ne(arg0: AnyRef): Boolean

def negate(v: M[T]): M[T]

def nonZeroOption(v: M[T]): Option[M[T]]

final def notify(): Unit

final def notifyAll(): Unit

def plus(l: M[T], r: M[T]): M[T]

def positiveSumN(a: M[T], n: Int): M[T]

def remove(l: M[T], r: M[T]): M[T]

def repeatedCombineN(a: M[T], n: Int): M[T]

def sum(vs: TraversableOnce[M[T]]): M[T]

def sumN(a: M[T], n: Int): M[T]

def sumOption(iter: TraversableOnce[M[T]]): Option[M[T]]

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

def toString(): String

def trySum(as: TraversableOnce[M[T]]): Option[M[T]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

lazy val zero: M[T]

Inherited from Group[M[T]]

Inherited from AdditiveGroup[M[T]]

Inherited from cats.kernel.Group[M[T]]

Inherited from ApplicativeMonoid[T, M]

Inherited from Monoid[M[T]]

Inherited from AdditiveMonoid[M[T]]

Inherited from cats.kernel.Monoid[M[T]]

Inherited from ApplicativeSemigroup[T, M]

Inherited from Semigroup[M[T]]

Inherited from AdditiveSemigroup[M[T]]

Inherited from cats.kernel.Semigroup[M[T]]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped