diffson-core/diffson.lcs/HashedLcs

HashedLcs

class HashedLcs[T](delegate: Lcs[Hashed[T]])(implicit evidence$1: Eq[T]) extends Lcs[T]

Speeds up LCS computations by pre-computing hashes for all objects. Very useful for objects that recompute hashCodes on each invocation.

Value parameters:
delegate

Decorated LCS implementation.

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

Value members

Concrete methods

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

Definition Classes
Source:
HashedLcs.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:
HashedLcs.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