diffson-core
4.4.0
API
Generated with
diffson-core/diffson.lcs/Lcs

Lcs

diffson.lcs.Lcs
abstract class Lcs[T]

The interface to classes that computes the longest common subsequence between two sequences of elements

Attributes

Source:
Lcs.scala
Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
class HashedLcs[T]
class Patience[T]

Members list

Concise view

Value members

Abstract methods

def lcs(seq1: List[T], seq2: 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.

Attributes

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

Attributes

Source:
Lcs.scala

Concrete 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.

Attributes

Source:
Lcs.scala
Generated with