org.specs2.text.EditDistance

StringDistance

trait StringDistance extends AnyRef

Evaluate the distance between 2 strings by counting the number of insertions, suppressions or substitutions which are necessary to transform one into the other

Linear Supertypes
AnyRef, Any
Known Subclasses
EditMatrix
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. StringDistance
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Value Members

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  7. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  8. def cost(s1: String, s2: String, i: Int, j: Int, matrix: DistanceMatrix): Op

    returns

    the cost for DistanceMatrix(i, j)

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

    Definition Classes
    AnyRef

  10. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  11. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

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

    Definition Classes
    AnyRef → Any

  13. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  14. def initialize(s1: String, s2: String, matrix: DistanceMatrix): Unit

  15. def insertionDeletionCost(c: Char): Int

    returns

    the cost of an insertion or deletion

  16. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  17. def lowerCost(a: Char, b: Char, del: Int, subst: Int, ins: Int): Op

    returns

    the lower cost and associated operation of a deletion, substitution or insertion in case of equality between a non-substitution and an insertion/suppression we select the insertion/suppression in order to group all the differences together diff("abcd", "acbd") ==> ("a[bc]d", "a[cb]d"). the distance is 2, otherwise diff("abcd", "acbd") ==> ("a[b]c[]d", "a[c]b[]d")

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

    Definition Classes
    AnyRef

  19. final def notify(): Unit

    Definition Classes
    AnyRef

  20. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  21. def substitutionCost(a: Char, b: Char): Int

    returns

    the cost of a substitution

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

    Definition Classes
    AnyRef

  23. def toString(): String

    Definition Classes
    AnyRef → Any

  24. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  25. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  26. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped