specs2-common/org.specs2.data/LevenhsteinCosts

LevenhsteinCosts

trait LevenhsteinCosts[T] extends EditDistanceCosts[T]
class Object
trait Matchable
class Any

Value members

Abstract methods

def equiv: Equiv[T]

Concrete methods

def insertionDeletionCost(c: T): Int
Returns:

the cost of an insertion or deletion

def lowerCost(a: T, b: T, del: Int, subst: Int, ins: Int): EditDistanceOp
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")

def substitutionCost(a: T, b: T): Int
Returns:

the cost of a substitution