QueueMonoid

class QueueMonoid[A] extends Monoid[Queue[A]]
trait Monoid[Queue[A]]
trait Semigroup[Queue[A]]
class Object
trait Matchable
class Any

Value members

Concrete methods

def combine(x: Queue[A], y: Queue[A]): Queue[A]
override def combineAll(xs: IterableOnce[Queue[A]]): Queue[A]
Definition Classes
override def combineN(x: Queue[A], n: Int): Queue[A]
Definition Classes
def empty: Queue[A]

Inherited methods

override def combineAllOption(as: IterableOnce[Queue[A]]): Option[Queue[A]]
Definition Classes
Inherited from:
Monoid
def intercalate(middle: Queue[A]): Semigroup[Queue[A]]

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.

Inherited from:
Semigroup
def isEmpty(a: Queue[A])(implicit ev: Eq[Queue[A]]): 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
Inherited from:
Monoid
override def reverse: Monoid[Queue[A]]
Definition Classes
Inherited from:
Monoid