diffson-core/diffson.lcs/DynamicProgLcs

DynamicProgLcs

class DynamicProgLcs[T] extends Lcs[T]

Implementation of the LCS using dynamic programming.

Source:
DynamicProgLcs.scala
class Lcs[T]
class Object
trait Matchable
class Any

Value members

Concrete methods

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

Computest the longest common subsequence between both input slices. Returns an ordered list containing the indices in the first sequence and in the second sequence.

Computest the longest common subsequence between both input slices. Returns an ordered list containing the indices in the first sequence and in the second sequence.

Source:
DynamicProgLcs.scala
def savedHashes: Lcs[T]

Returns an instance of this Lcs algorithm that precomputes and store hashes of elements to diff.

Returns an instance of this Lcs algorithm that precomputes and store hashes of elements to diff.

Source:
DynamicProgLcs.scala

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
Source:
Lcs.scala