trait Function1Group[A, B] extends Function1Monoid[A, B] with Group[(A) ⇒ B]
- Alphabetic
- By Inheritance
- Function1Group
- Group
- Function1Monoid
- Monoid
- Function1Semigroup
- Semigroup
- Serializable
- Serializable
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Abstract Value Members
-
implicit abstract
def
B: Group[B]
- Definition Classes
- Function1Group → Function1Monoid → Function1Semigroup
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
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native() @IntrinsicCandidate()
-
def
combine(x: (A) ⇒ B, y: (A) ⇒ B): (A) ⇒ B
Associative operation which combines two values.
Associative operation which combines two values.
Example:
scala> import cats.kernel.instances.string._ scala> import cats.kernel.instances.int._ scala> import cats.kernel.instances.option._ scala> Semigroup[String].combine("Hello ", "World!") res0: String = Hello World! scala> Semigroup[Option[Int]].combine(None, Some(1)) res1: Option[Int] = Some(1)
- Definition Classes
- Function1Semigroup → Semigroup
-
def
combineAll(as: IterableOnce[(A) ⇒ B]): (A) ⇒ B
Given a sequence of
as
, sum them using the monoid and return the total.Given a sequence of
as
, sum them using the monoid and return the total.Example:
scala> import cats.kernel.instances.string._ scala> Monoid[String].combineAll(List("One ", "Two ", "Three")) res0: String = One Two Three scala> Monoid[String].combineAll(List.empty) res1: String = ""
- Definition Classes
- Monoid
-
def
combineAllOption(as: IterableOnce[(A) ⇒ B]): Option[(A) ⇒ B]
Given a sequence of
as
, combine them and return the total.Given a sequence of
as
, combine them and return the total.If the sequence is empty, returns None. Otherwise, returns Some(total).
Example:
scala> import cats.kernel.instances.string._ scala> Semigroup[String].combineAllOption(List("One ", "Two ", "Three")) res0: Option[String] = Some(One Two Three) scala> Semigroup[String].combineAllOption(List.empty) res1: Option[String] = None
-
def
combineN(a: (A) ⇒ B, n: Int): (A) ⇒ B
Return
a
appended to itselfn
times. -
val
empty: (A) ⇒ B
Return the identity element for this monoid.
Return the identity element for this monoid.
Example:
scala> import cats.kernel.instances.int._ scala> import cats.kernel.instances.string._ scala> Monoid[String].empty res0: String = "" scala> Monoid[Int].empty res1: Int = 0
- Definition Classes
- Function1Monoid → Monoid
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
-
def
intercalate(middle: (A) ⇒ B): Semigroup[(A) ⇒ B]
Between each pair of elements insert middle This name matches the term used in Foldable and Reducible and a similar Haskell function.
Between each pair of elements insert middle This name matches the term used in Foldable and Reducible and a similar Haskell function.
- Definition Classes
- Semigroup
-
def
inverse(x: (A) ⇒ B): (A) ⇒ B
Find the inverse of
a
.Find the inverse of
a
.combine(a, inverse(a))
=combine(inverse(a), a)
=empty
.Example:
scala> import cats.kernel.instances.int._ scala> Group[Int].inverse(5) res0: Int = -5
- Definition Classes
- Function1Group → Group
-
def
isEmpty(a: (A) ⇒ B)(implicit ev: Eq[(A) ⇒ B]): Boolean
Tests if
a
is the identity.Tests if
a
is the identity.Example:
scala> import cats.kernel.instances.string._ scala> Monoid[String].isEmpty("") res0: Boolean = true scala> Monoid[String].isEmpty("something") res1: Boolean = false
- Definition Classes
- Monoid
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
-
def
remove(a: (A) ⇒ B, b: (A) ⇒ B): (A) ⇒ B
Remove the element
b
froma
.Remove the element
b
froma
.Equivalent to
combine(a, inverse(b))
Example:
scala> import cats.kernel.instances.int._ scala> Group[Int].remove(5, 2) res0: Int = 3
- Definition Classes
- Group
-
def
repeatedCombineN(a: (A) ⇒ B, n: Int): (A) ⇒ B
Return
a
combined with itself more than once.Return
a
combined with itself more than once.- Attributes
- protected[this]
- Definition Classes
- Semigroup
-
def
reverse: Monoid[(A) ⇒ B]
return a semigroup that reverses the order so combine(a, b) == reverse.combine(b, a)
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
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()
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )