Object

org.emmalanguage.util

Monoids

Related Doc: package util

Permalink

object Monoids

Missing instances of cats.Monoid.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Monoids
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. val conj: Monoid[Boolean]

    Permalink

    Conjunctive boolean monoid.

  7. val disj: Monoid[Boolean]

    Permalink

    Disjunctive boolean monoid.

  8. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  9. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  10. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  11. def first[A](zero: A): Monoid[A]

    Permalink

    Trivial monoid with bias to the left.

  12. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  13. implicit def graphUnion[V, A, B]: Monoid[Graph[V, A, B]]

    Permalink

    Graph union forms a monoid.

  14. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  15. implicit def hcons[H, T <: HList](implicit H: Monoid[H], T: Monoid[T]): Monoid[::[H, T]]

    Permalink

    shapeless.HList is a generic product.

  16. implicit val hnil: Monoid[HNil]

    Permalink

    shapeless.HNil is an empty monoid.

  17. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  18. def last[A](zero: A): Monoid[A]

    Permalink

    Trivial monoid with bias to the right.

  19. def merge[K, V](implicit V: Monoid[V]): Monoid[Map[K, V]]

    Permalink

    Monoid for maps that merges previous values via an underlying monoid.

  20. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  21. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  22. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  23. def overwrite[K, V]: Monoid[Map[K, V]]

    Permalink

    Monoid for maps that overwrites previous values.

  24. def reverse[A](implicit A: Monoid[A]): Monoid[A]

    Permalink

    Reverses an existing monoid (i.e.

    Reverses an existing monoid (i.e. applying it right to left).

  25. def sliding[Col[x] <: Iterable[x], A](n: Int)(implicit Col: CanBuildFrom[Nothing, A, Col[A]]): Monoid[Col[A]]

    Permalink

    Monoid for collections that preserves only the last n elements.

  26. implicit def sortedSet[A](implicit arg0: Ordering[A]): Monoid[SortedSet[A]]

    Permalink

    Monoid for sorted sets.

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

    Permalink
    Definition Classes
    AnyRef
  28. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  29. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  30. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  31. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped