diffson-core/diffson.lcs/Patience

Patience

class Patience[T](withFallback: Boolean)(`evidence$1`: Eq[T]) extends Lcs[T]

Implementation of the patience algorithm [1] to compute the longest common subsequence

Implementation of the patience algorithm [1] to compute the longest common subsequence

[1] http://alfedenzo.livejournal.com/170301.html

Value Params
withFallback

whether to fallback to classic LCS when patience could not find the LCS

Authors

Lucas Satabin

class Lcs[T]
class Object
trait Matchable
class Any

Type members

Types

type Occurrence = (T, Int)

An occurrence of a value associated to its index

An occurrence of a value associated to its index

Value members

Concrete methods

def lcs(s1: List[T], s2: List[T], low1: Int, high1: Int, low2: Int, high2: Int): List[(Int, Int)]

Computes the longest common subsequence between both sequences. It is encoded as the list of common indices in the first and the second sequence.

Computes the longest common subsequence between both sequences. It is encoded as the list of common indices in the first and the second sequence.

def savedHashes: Lcs[T]

Inherited methods

def lcs(seq1: List[T], seq2: List[T]): List[(Int, Int)]

Computes the longest commons subsequence between both inputs. Returns an ordered list containing the indices in the first sequence and in the second sequence.

Computes the longest commons subsequence between both inputs. Returns an ordered list containing the indices in the first sequence and in the second sequence.

Inherited from
Lcs