class Tuple9Monoid[A, B, C, D, E, F, G, H, I] extends Tuple9Semigroup[A, B, C, D, E, F, G, H, I] with Monoid[(A, B, C, D, E, F, G, H, I)]
Combine 9 monoids into a product monoid
Linear Supertypes
Known Subclasses
Ordering
- Alphabetic
- By Inheritance
Inherited
- Tuple9Monoid
- Monoid
- AdditiveMonoid
- Monoid
- Tuple9Semigroup
- Semigroup
- AdditiveSemigroup
- Semigroup
- Serializable
- Serializable
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
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.Monoid[(A, B, C, D, E, F, G, H, I)]
These are from algebra.Monoid
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
assertNotZero(v: (A, B, C, D, E, F, G, H, I)): Unit
- Definition Classes
- Monoid
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
combine(l: (A, B, C, D, E, F, G, H, I), r: (A, B, C, D, E, F, G, H, I)): (A, B, C, D, E, F, G, H, I)
- Definition Classes
- Semigroup → Semigroup
-
def
combineAll(t: TraversableOnce[(A, B, C, D, E, F, G, H, I)]): (A, B, C, D, E, F, G, H, I)
- Definition Classes
- Monoid → Monoid
-
def
combineAllOption(as: TraversableOnce[(A, B, C, D, E, F, G, H, I)]): Option[(A, B, C, D, E, F, G, H, I)]
- Definition Classes
- Monoid → Semigroup
-
def
combineN(a: (A, B, C, D, E, F, G, H, I), n: Int): (A, B, C, D, E, F, G, H, I)
- Definition Classes
- Monoid → Semigroup
-
def
empty: (A, B, C, D, E, F, G, H, I)
- 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
isEmpty(a: (A, B, C, D, E, F, G, H, I))(implicit ev: Eq[(A, B, C, D, E, F, G, H, I)]): Boolean
- Definition Classes
- Monoid
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isNonZero(v: (A, B, C, D, E, F, G, H, I)): Boolean
- Definition Classes
- Monoid
-
def
isZero(a: (A, B, C, D, E, F, G, H, I))(implicit ev: Eq[(A, B, C, D, E, F, G, H, I)]): Boolean
- Definition Classes
- AdditiveMonoid
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
nonZeroOption(v: (A, B, C, D, E, F, G, H, I)): Option[(A, B, C, D, E, F, G, H, I)]
- Definition Classes
- Monoid
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
def
plus(l: (A, B, C, D, E, F, G, H, I), r: (A, B, C, D, E, F, G, H, I)): (A, B, C, D, E, F, G, H, I)
- Definition Classes
- Tuple9Semigroup → AdditiveSemigroup
-
def
positiveSumN(a: (A, B, C, D, E, F, G, H, I), n: Int): (A, B, C, D, E, F, G, H, I)
- Attributes
- protected[this]
- Definition Classes
- AdditiveSemigroup
-
def
repeatedCombineN(a: (A, B, C, D, E, F, G, H, I), n: Int): (A, B, C, D, E, F, G, H, I)
- Attributes
- protected[this]
- Definition Classes
- Semigroup
-
def
sum(vs: TraversableOnce[(A, B, C, D, E, F, G, H, I)]): (A, B, C, D, E, F, G, H, I)
- Definition Classes
- Monoid → AdditiveMonoid
-
def
sumN(a: (A, B, C, D, E, F, G, H, I), n: Int): (A, B, C, D, E, F, G, H, I)
- Definition Classes
- AdditiveMonoid → AdditiveSemigroup
-
def
sumOption(to: TraversableOnce[(A, B, C, D, E, F, G, H, I)]): Option[(A, B, C, D, E, F, G, H, I)]
Returns an instance of
T
calculated by summing all instances initer
in one pass.Returns an instance of
T
calculated by summing all instances initer
in one pass. ReturnsNone
ifiter
is empty, elseSome[T]
.- returns
None
ifiter
is empty, else an option value containing the summedT
- Definition Classes
- Tuple9Semigroup → 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[(A, B, C, D, E, F, G, H, I)]): Option[(A, B, C, D, E, F, G, H, I)]
- 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( ... )
-
def
zero: (A, B, C, D, E, F, G, H, I)
- Definition Classes
- Tuple9Monoid → AdditiveMonoid