diffson-core
4.5.0
API
Generated with
diffson-core/diffson/diffson.lcs/HashedLcs

HashedLcs

diffson.lcs.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.

Attributes

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

Members list

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.

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

Definition Classes
Lcs
Source
HashedLcs.scala
override def savedHashes: HashedLcs[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

Definition Classes
Lcs
Source
HashedLcs.scala

Inherited methods

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

Computes the longest commons subsequence between both inputs.

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

Inherited from:
Lcs
Source
Lcs.scala
Generated with