Packages

o

scalaz.std.StringInstances

stringInstance

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 EqualLaw extends AnyRef
    Definition Classes
    Equal
  2. trait IsEmptyLaw extends EmptyLaw
    Definition Classes
    IsEmpty
  3. trait MonoidLaw extends SemigroupLaw

    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
  4. trait OrderLaw extends EqualLaw
    Definition Classes
    Order
  5. trait PlusLaw extends AnyRef
    Definition Classes
    Plus
  6. trait EmptyLaw extends PlusLaw
    Definition Classes
    PlusEmpty
  7. trait SemigroupApply extends Apply[[α]F]
    Attributes
    protected[this]
    Definition Classes
    Semigroup
  8. trait SemigroupCompose extends Compose[[α, β]F]
    Attributes
    protected[this]
    Definition Classes
    Semigroup
  9. trait SemigroupLaw extends AnyRef

    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
  10. type SA[α] = String

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. 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
  5. 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
  6. def apply(x: String, y: String): Ordering
    Definition Classes
    Order
  7. 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
  8. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  9. 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

  10. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  11. 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
  12. 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

  13. def contramap[B](f: (B) ⇒ String): Order[B]
    Definition Classes
    Order → Equal
  14. def empty[A]: String
    Definition Classes
    stringInstance → PlusEmpty
  15. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  16. def equal(x: String, y: String): Boolean
    Definition Classes
    stringInstance → Order → Equal
  17. def equalIsNatural: Boolean

    returns

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

    Definition Classes
    stringInstance → Equal
  18. def equalLaw: EqualLaw
    Definition Classes
    Equal
  19. val equalSyntax: EqualSyntax[String]
    Definition Classes
    Equal
  20. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  21. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  22. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  23. def greaterThan(x: String, y: String): Boolean
    Definition Classes
    Order
  24. def greaterThanOrEqual(x: String, y: String): Boolean
    Definition Classes
    Order
  25. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  26. final def ifEmpty[B](a: String)(t: ⇒ B)(f: ⇒ B)(implicit eq: Equal[String]): B
    Definition Classes
    Monoid
  27. def isEmpty[A](s: SA[A]): Boolean
    Definition Classes
    stringInstance → IsEmpty
  28. def isEmptyLaw: IsEmptyLaw
    Definition Classes
    IsEmpty
  29. val isEmptySyntax: IsEmptySyntax[[α]String]
    Definition Classes
    IsEmpty
  30. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  31. def isMZero(a: String)(implicit eq: Equal[String]): Boolean

    Whether a == zero.

    Whether a == zero.

    Definition Classes
    Monoid
  32. def lessThan(x: String, y: String): Boolean
    Definition Classes
    Order
  33. def lessThanOrEqual(x: String, y: String): Boolean
    Definition Classes
    Order
  34. def max(x: String, y: String): String
    Definition Classes
    Order
  35. def min(x: String, y: String): String
    Definition Classes
    Order
  36. def monoid[A]: Monoid[String]
    Definition Classes
    PlusEmpty
  37. def monoidLaw: MonoidLaw
    Definition Classes
    Monoid
  38. val monoidSyntax: MonoidSyntax[String]
    Definition Classes
    Monoid
  39. 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
  40. 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
  41. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  42. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  43. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  44. final def onEmpty[A, B](a: String)(v: ⇒ B)(implicit eq: Equal[String], mb: Monoid[B]): B
    Definition Classes
    Monoid
  45. final def onNotEmpty[B](a: String)(v: ⇒ B)(implicit eq: Equal[String], mb: Monoid[B]): B
    Definition Classes
    Monoid
  46. def order(x: String, y: String): Ordering
    Definition Classes
    stringInstance → Order
  47. def orderLaw: OrderLaw
    Definition Classes
    Order
  48. val orderSyntax: OrderSyntax[String]
    Definition Classes
    Order
  49. def plus[A](f1: SA[A], f2: ⇒ SA[A]): String
    Definition Classes
    stringInstance → Plus
  50. def plusEmptyLaw: EmptyLaw
    Definition Classes
    PlusEmpty
  51. val plusEmptySyntax: PlusEmptySyntax[[α]String]
    Definition Classes
    PlusEmpty
  52. def plusLaw: PlusLaw
    Definition Classes
    Plus
  53. val plusSyntax: PlusSyntax[[α]String]
    Definition Classes
    Plus
  54. 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
  55. 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
  56. def reverseOrder: Order[String]
    Definition Classes
    Order
  57. def semigroup[A]: Semigroup[String]
    Definition Classes
    Plus
  58. def semigroupLaw: SemigroupLaw
    Definition Classes
    Semigroup
  59. val semigroupSyntax: SemigroupSyntax[String]
    Definition Classes
    Semigroup
  60. def show(f: String): Cord
    Definition Classes
    stringInstance → Show
  61. val showSyntax: ShowSyntax[String]
    Definition Classes
    Show
  62. def shows(f: String): String
    Definition Classes
    stringInstance → Show
  63. def sort(x: String, y: String): (String, String)
    Definition Classes
    Order
  64. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  65. def toScalaOrdering: scala.math.Ordering[String]

    Definition Classes
    Order
    Note

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

    this.order(x, y)

  66. def toString(): String
    Definition Classes
    AnyRef → Any
  67. def unfoldlPsum[S, A](seed: S)(f: (S) ⇒ Maybe[(S, String)]): String
    Definition Classes
    PlusEmpty
  68. def unfoldlPsumOpt[S, A](seed: S)(f: (S) ⇒ Maybe[(S, String)]): Maybe[String]

    Unfold seed to the left and sum using #plus.

    Unfold seed to the left and sum using #plus. Plus instances with right absorbing elements may override this method to not unfold more than is necessary to determine the result.

    Definition Classes
    Plus
  69. def unfoldlSum[S](seed: S)(f: (S) ⇒ Maybe[(S, String)]): String
    Definition Classes
    Monoid
  70. def unfoldlSumOpt[S](seed: S)(f: (S) ⇒ Maybe[(S, String)]): Maybe[String]

    Unfold seed to the left and sum using #append.

    Unfold seed to the left and sum using #append. Semigroups with right absorbing elements may override this method to not unfold more than is necessary to determine the result.

    Definition Classes
    Semigroup
  71. def unfoldrPsum[S, A](seed: S)(f: (S) ⇒ Maybe[(String, S)]): String
    Definition Classes
    PlusEmpty
  72. def unfoldrPsumOpt[S, A](seed: S)(f: (S) ⇒ Maybe[(String, S)]): Maybe[String]

    Unfold seed to the right and sum using #plus.

    Unfold seed to the right and sum using #plus. Plus instances with left absorbing elements may override this method to not unfold more than is necessary to determine the result.

    Definition Classes
    Plus
  73. def unfoldrSum[S](seed: S)(f: (S) ⇒ Maybe[(String, S)]): String
    Definition Classes
    Monoid
  74. def unfoldrSumOpt[S](seed: S)(f: (S) ⇒ Maybe[(String, S)]): Maybe[String]

    Unfold seed to the right and sum using #append.

    Unfold seed to the right and sum using #append. Semigroups with left absorbing elements may override this method to not unfold more than is necessary to determine the result.

    Definition Classes
    Semigroup
  75. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  76. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  77. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  78. def zero: String

    The identity element for append.

    The identity element for append.

    Definition Classes
    stringInstance → Monoid

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