Object

scalaz.std.StringInstances

stringInstance

Related Doc: package StringInstances

Permalink

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

Source
String.scala
Linear Supertypes
IsEmpty[[α]String], PlusEmpty[[α]String], Plus[[α]String], Order[String], Equal[String], Show[String], Monoid[String], Semigroup[String], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. stringInstance
  2. IsEmpty
  3. PlusEmpty
  4. Plus
  5. Order
  6. Equal
  7. Show
  8. Monoid
  9. Semigroup
  10. AnyRef
  11. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Type Members

  1. trait EmptyLaw extends PlusLaw

    Permalink
    Definition Classes
    PlusEmpty
  2. trait EqualLaw extends AnyRef

    Permalink
    Definition Classes
    Equal
  3. trait IsEmptyLaw extends EmptyLaw

    Permalink
    Definition Classes
    IsEmpty
  4. trait MonoidLaw extends SemigroupLaw

    Permalink

    Monoid instances must satisfy scalaz.Semigroup.SemigroupLaw and 2 additional laws:

    Monoid instances must satisfy scalaz.Semigroup.SemigroupLaw and 2 additional laws:

    • left identity: forall a. append(zero, a) == a
    • right identity : forall a. append(a, zero) == a
    Definition Classes
    Monoid
  5. trait OrderLaw extends EqualLaw

    Permalink
    Definition Classes
    Order
  6. trait PlusLaw extends AnyRef

    Permalink
    Definition Classes
    Plus
  7. type SA[α] = String

    Permalink
  8. trait SemigroupLaw extends AnyRef

    Permalink

    A semigroup in type F must satisfy two laws:

    A semigroup in type F must satisfy two laws:

    • closure: ∀ a, b in F, append(a, b) is also in F. This is enforced by the type system.
    • associativity: ∀ a, b, c in F, the equation append(append(a, b), c) = append(a, append(b , c)) holds.
    Definition Classes
    Semigroup

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. def append(f1: String, f2: ⇒ String): String

    Permalink

    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
    stringInstanceSemigroup
  5. final def applicative: Applicative[[α]String]

    Permalink

    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[({type λ[α]=F})#λ] is discarded; it is a phantom type. As such, the functor cannot support scalaz.Bind.

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

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

    Permalink

    An scalaz.Apply, that implements ap with append.

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

    Definition Classes
    Semigroup
  8. final def asInstanceOf[T0]: T0

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

    Permalink

    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

  10. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  11. final def compose: Compose[[α, β]String]

    Permalink

    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

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

    Permalink
    Definition Classes
    OrderEqual
  13. def empty[A]: String

    Permalink
    Definition Classes
    stringInstancePlusEmpty
  14. final def eq(arg0: AnyRef): Boolean

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

    Permalink
    Definition Classes
    stringInstanceOrderEqual
  16. def equalIsNatural: Boolean

    Permalink

    returns

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

    Definition Classes
    stringInstanceEqual
  17. def equalLaw: EqualLaw

    Permalink
    Definition Classes
    Equal
  18. val equalSyntax: EqualSyntax[String]

    Permalink
    Definition Classes
    Equal
  19. def equals(arg0: Any): Boolean

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  21. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  22. def greaterThan(x: String, y: String): Boolean

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

    Permalink
    Definition Classes
    Order
  24. def hashCode(): Int

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

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

    Permalink
    Definition Classes
    stringInstanceIsEmpty
  27. def isEmptyLaw: IsEmptyLaw

    Permalink
    Definition Classes
    IsEmpty
  28. val isEmptySyntax: IsEmptySyntax[[α]String]

    Permalink
    Definition Classes
    IsEmpty
  29. final def isInstanceOf[T0]: Boolean

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

    Permalink

    Whether a == zero.

    Whether a == zero.

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

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

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

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

    Permalink
    Definition Classes
    Order
  35. def monoid[A]: Monoid[String]

    Permalink
    Definition Classes
    PlusEmpty
  36. def monoidLaw: MonoidLaw

    Permalink
    Definition Classes
    Monoid
  37. val monoidSyntax: MonoidSyntax[String]

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

    Permalink

    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
  39. final def ne(arg0: AnyRef): Boolean

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

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

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

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

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

    Permalink
    Definition Classes
    stringInstanceOrder
  45. def orderLaw: OrderLaw

    Permalink
    Definition Classes
    Order
  46. val orderSyntax: OrderSyntax[String]

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

    Permalink
    Definition Classes
    stringInstancePlus
  48. def plusEmptyLaw: EmptyLaw

    Permalink
    Definition Classes
    PlusEmpty
  49. val plusEmptySyntax: PlusEmptySyntax[[α]String]

    Permalink
    Definition Classes
    PlusEmpty
  50. def plusLaw: PlusLaw

    Permalink
    Definition Classes
    Plus
  51. val plusSyntax: PlusSyntax[[α]String]

    Permalink
    Definition Classes
    Plus
  52. final def reverseOrder: Order[String]

    Permalink
    Definition Classes
    Order
  53. def semigroup[A]: Semigroup[String]

    Permalink
    Definition Classes
    Plus
  54. def semigroupLaw: SemigroupLaw

    Permalink
    Definition Classes
    Semigroup
  55. val semigroupSyntax: SemigroupSyntax[String]

    Permalink
    Definition Classes
    Semigroup
  56. def show(f: String): Cord

    Permalink
    Definition Classes
    stringInstanceShow
  57. val showSyntax: ShowSyntax[String]

    Permalink
    Definition Classes
    Show
  58. def shows(f: String): String

    Permalink
    Definition Classes
    Show
  59. final def synchronized[T0](arg0: ⇒ T0): T0

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

    Permalink

    Definition Classes
    Order
    Note

    Order.fromScalaOrdering(toScalaOrdering).order(x, y)

    this.order(x, y)

  61. def toString(): String

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

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  65. def xmlText(f: String): Text

    Permalink
    Definition Classes
    Show
  66. def zero: String

    Permalink

    The identity element for append.

    The identity element for append.

    Definition Classes
    stringInstanceMonoid

Inherited from IsEmpty[[α]String]

Inherited from PlusEmpty[[α]String]

Inherited from Plus[[α]String]

Inherited from Order[String]

Inherited from Equal[String]

Inherited from Show[String]

Inherited from Monoid[String]

Inherited from Semigroup[String]

Inherited from AnyRef

Inherited from Any

Ungrouped