StringLevenhsteinCosts

org.specs2.data.StringLevenhsteinCosts

Attributes

Graph
Supertypes
trait LevenhsteinCosts[Char]
trait EditDistanceCosts[Char]
class Object
trait Matchable
class Any
Self type

Members list

Value members

Inherited methods

def insertionDeletionCost(c: Char): Int

Attributes

Returns

the cost of an insertion or deletion

Inherited from:
LevenhsteinCosts
def lowerCost(a: Char, b: Char, del: Int, subst: Int, ins: Int): EditDistanceOp

Attributes

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")

Inherited from:
LevenhsteinCosts
def substitutionCost(a: Char, b: Char): Int

Attributes

Returns

the cost of a substitution

Inherited from:
LevenhsteinCosts

Concrete fields

val equiv: Equiv[Char]