stringInstance

Type Members

trait EmptyLaw extends PlusLaw

Definition Classes
PlusEmpty
trait EqualLaw extends AnyRef

Definition Classes
Equal
trait IsEmptyLaw extends EmptyLaw

Definition Classes
IsEmpty
trait MonoidLaw extends SemigroupLaw

Monoid instances must satisfy scalaz.Semigroup.SemigroupLaw and 2 additional laws:
trait OrderLaw extends EqualLaw

Definition Classes
Order
trait PlusLaw extends AnyRef

Definition Classes
Plus
type SA[α] = String
trait SemigroupApply extends Apply[[α]F]

Attributes
protected[this]
Definition Classes
Semigroup
trait SemigroupCompose extends Compose[[α, β]F]

Attributes
protected[this]
Definition Classes
Semigroup
trait SemigroupLaw extends AnyRef

A semigroup in type F must satisfy two laws:

Value Members

final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def !=(arg0: Any): Boolean

Definition Classes
Any
final def ##(): Int

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

Definition Classes
AnyRef
final def ==(arg0: Any): Boolean

Definition Classes
Any
def append(f1: String, f2: ⇒ String): String

The binary operation to combine f1 and f2.
The binary operation to combine f1 and f2.
Implementations should not evaluate the by-name parameter f2 if result can be determined by f1.

Definition Classes
stringInstance → Semigroup
final def applicative: Applicative[[α]String]

A monoidal applicative functor, that implements point and ap with the operations zero and append respectively.
A monoidal applicative functor, that implements point and ap with the operations zero and append respectively. Note that the type parameter α in Applicative[λ[α => F]] is discarded; it is a phantom type. As such, the functor cannot support scalaz.Bind.

Definition Classes
Monoid
def apply(x: String, y: String): Ordering

Definition Classes
Order
final def apply: Apply[[α]String]

An scalaz.Apply, that implements ap with append.
An scalaz.Apply, that implements ap with append. Note that the type parameter α in Apply[λ[α => F]] is discarded; it is a phantom type. As such, the functor cannot support scalaz.Bind.

Definition Classes
Semigroup
final def asInstanceOf[T0]: T0

Definition Classes
Any
final def category: Category[[α, β]String]

Every Monoid gives rise to a scalaz.Category, for which the type parameters are phantoms.
Every Monoid gives rise to a scalaz.Category, for which the type parameters are phantoms.

Definition Classes
Monoid
Note
category.monoid = this
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def compose[G[_]]: PlusEmpty[[α]String]

The composition of PlusEmpty F and G, [x]F[G[x]], is a PlusEmpty
The composition of PlusEmpty F and G, [x]F[G[x]], is a PlusEmpty

Definition Classes
PlusEmpty → Plus
final def compose: Compose[[α, β]String]

Every Semigroup gives rise to a scalaz.Compose, for which the type parameters are phantoms.
Every Semigroup gives rise to a scalaz.Compose, for which the type parameters are phantoms.

Definition Classes
Semigroup
Note
compose.semigroup = this
def contramap[B](f: (B) ⇒ String): Order[B]

Definition Classes
Order → Equal
def empty[A]: String

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

Definition Classes
AnyRef
def equal(x: String, y: String): Boolean

Definition Classes
stringInstance → Order → Equal
def equalIsNatural: Boolean

returns
true, if equal(f1, f2) is known to be equivalent to f1 == f2

Definition Classes
stringInstance → Equal
def equalLaw: EqualLaw

Definition Classes
Equal
val equalSyntax: EqualSyntax[String]

Definition Classes
Equal
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 greaterThan(x: String, y: String): Boolean

Definition Classes
Order
def greaterThanOrEqual(x: String, y: String): Boolean

Definition Classes
Order
def hashCode(): Int

Definition Classes
AnyRef → Any
final def ifEmpty[B](a: String)(t: ⇒ B)(f: ⇒ B)(implicit eq: Equal[String]): B

Definition Classes
Monoid
def isEmpty[A](s: SA[A]): Boolean

Definition Classes
stringInstance → IsEmpty
def isEmptyLaw: IsEmptyLaw

Definition Classes
IsEmpty
val isEmptySyntax: IsEmptySyntax[[α]String]

Definition Classes
IsEmpty
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isMZero(a: String)(implicit eq: Equal[String]): Boolean

Whether a == zero.
Whether a == zero.

Definition Classes
Monoid
def lessThan(x: String, y: String): Boolean

Definition Classes
Order
def lessThanOrEqual(x: String, y: String): Boolean

Definition Classes
Order
def max(x: String, y: String): String

Definition Classes
Order
def min(x: String, y: String): String

Definition Classes
Order
def monoid[A]: Monoid[String]

Definition Classes
PlusEmpty
def monoidLaw: MonoidLaw

Definition Classes
Monoid
val monoidSyntax: MonoidSyntax[String]

Definition Classes
Monoid
def multiply(value: String, n: Int): String

For n = 0, zero For n = 1, append(zero, value) For n = 2, append(append(zero, value), value)
For n = 0, zero For n = 1, append(zero, value) For n = 2, append(append(zero, value), value)

Definition Classes
Monoid
def multiply1(value: String, n: Int): String

For n = 0, value For n = 1, append(value, value) For n = 2, append(append(value, value), value)
For n = 0, value For n = 1, append(value, value) For n = 2, append(append(value, value), value)
The default definition uses peasant multiplication, exploiting associativity to only require O(log n) uses of append

Definition Classes
Semigroup
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def onEmpty[A, B](a: String)(v: ⇒ B)(implicit eq: Equal[String], mb: Monoid[B]): B

Definition Classes
Monoid
final def onNotEmpty[B](a: String)(v: ⇒ B)(implicit eq: Equal[String], mb: Monoid[B]): B

Definition Classes
Monoid
def order(x: String, y: String): Ordering

Definition Classes
stringInstance → Order
def orderLaw: OrderLaw

Definition Classes
Order
val orderSyntax: OrderSyntax[String]

Definition Classes
Order
def plus[A](f1: SA[A], f2: ⇒ SA[A]): String

Definition Classes
stringInstance → Plus
def plusEmptyLaw: EmptyLaw

Definition Classes
PlusEmpty
val plusEmptySyntax: PlusEmptySyntax[[α]String]

Definition Classes
PlusEmpty
def plusLaw: PlusLaw

Definition Classes
Plus
val plusSyntax: PlusSyntax[[α]String]

Definition Classes
Plus
def product[G[_]](implicit G0: PlusEmpty[G]): PlusEmpty[[α](String, G[α])]

The product of PlusEmpty F and G, [x](F[x], G[x]]), is a PlusEmpty
The product of PlusEmpty F and G, [x](F[x], G[x]]), is a PlusEmpty

Definition Classes
PlusEmpty
def product[G[_]](implicit G0: Plus[G]): Plus[[α](String, G[α])]

The product of Plus F and G, [x](F[x], G[x]]), is a Plus
The product of Plus F and G, [x](F[x], G[x]]), is a Plus

Definition Classes
Plus
def reverseOrder: Order[String]

Definition Classes
Order
def semigroup[A]: Semigroup[String]

Definition Classes
Plus
def semigroupLaw: SemigroupLaw

Definition Classes
Semigroup
val semigroupSyntax: SemigroupSyntax[String]

Definition Classes
Semigroup
def show(f: String): Cord

Definition Classes
stringInstance → Show
val showSyntax: ShowSyntax[String]

Definition Classes
Show
def shows(f: String): String

Definition Classes
Show
def sort(x: String, y: String): (String, String)

Definition Classes
Order
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toScalaOrdering: scala.math.Ordering[String]

Definition Classes
Order
Note
Order.fromScalaOrdering(toScalaOrdering).order(x, y)
this.order(x, y)
def toString(): String

Definition Classes
AnyRef → Any
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: String

The identity element for append.
The identity element for append.

Definition Classes
stringInstance → Monoid

implicit object stringInstance extends Monoid[String] with Show[String] with Equal[String] with Order[String] with IsEmpty[[α]String]

Type Members

trait EmptyLaw extends PlusLaw

trait EqualLaw extends AnyRef

trait IsEmptyLaw extends EmptyLaw

trait MonoidLaw extends SemigroupLaw

trait OrderLaw extends EqualLaw

trait PlusLaw extends AnyRef

type SA[α] = String

trait SemigroupApply extends Apply[[α]F]

trait SemigroupCompose extends Compose[[α, β]F]

trait SemigroupLaw extends AnyRef

Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def append(f1: String, f2: ⇒ String): String

final def applicative: Applicative[[α]String]

def apply(x: String, y: String): Ordering

final def apply: Apply[[α]String]

final def asInstanceOf[T0]: T0

final def category: Category[[α, β]String]

def clone(): AnyRef

def compose[G[_]]: PlusEmpty[[α]String]

final def compose: Compose[[α, β]String]

def contramap[B](f: (B) ⇒ String): Order[B]

def empty[A]: String

final def eq(arg0: AnyRef): Boolean

def equal(x: String, y: String): Boolean

def equalIsNatural: Boolean

def equalLaw: EqualLaw

val equalSyntax: EqualSyntax[String]

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def greaterThan(x: String, y: String): Boolean

def greaterThanOrEqual(x: String, y: String): Boolean

def hashCode(): Int

final def ifEmpty[B](a: String)(t: ⇒ B)(f: ⇒ B)(implicit eq: Equal[String]): B

def isEmpty[A](s: SA[A]): Boolean

def isEmptyLaw: IsEmptyLaw

val isEmptySyntax: IsEmptySyntax[[α]String]

final def isInstanceOf[T0]: Boolean

def isMZero(a: String)(implicit eq: Equal[String]): Boolean

def lessThan(x: String, y: String): Boolean

def lessThanOrEqual(x: String, y: String): Boolean

def max(x: String, y: String): String

def min(x: String, y: String): String

def monoid[A]: Monoid[String]

def monoidLaw: MonoidLaw

val monoidSyntax: MonoidSyntax[String]

def multiply(value: String, n: Int): String

def multiply1(value: String, n: Int): String

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def onEmpty[A, B](a: String)(v: ⇒ B)(implicit eq: Equal[String], mb: Monoid[B]): B

final def onNotEmpty[B](a: String)(v: ⇒ B)(implicit eq: Equal[String], mb: Monoid[B]): B

def order(x: String, y: String): Ordering

def orderLaw: OrderLaw

val orderSyntax: OrderSyntax[String]

def plus[A](f1: SA[A], f2: ⇒ SA[A]): String

def plusEmptyLaw: EmptyLaw

val plusEmptySyntax: PlusEmptySyntax[[α]String]

def plusLaw: PlusLaw

val plusSyntax: PlusSyntax[[α]String]

def product[G[_]](implicit G0: PlusEmpty[G]): PlusEmpty[[α](String, G[α])]

def product[G[_]](implicit G0: Plus[G]): Plus[[α](String, G[α])]

def reverseOrder: Order[String]

def semigroup[A]: Semigroup[String]

def semigroupLaw: SemigroupLaw

val semigroupSyntax: SemigroupSyntax[String]

def show(f: String): Cord

val showSyntax: ShowSyntax[String]

def shows(f: String): String

def sort(x: String, y: String): (String, String)

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

`this.order(x, y)`