Lcs

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

abstract def savedHashes: Lcs[T]

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

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

def ->[B](y: B): (Lcs[T], B)

final def ==(arg0: Any): Boolean

def apply[F[_], Json](json: Json)(implicit P: Patch[F, Json, Lcs[T]]): F[Json]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def diff[P](that: Lcs[T])(implicit Diff: Diff[Lcs[T], P]): P

def ensuring(cond: (Lcs[T]) ⇒ Boolean, msg: ⇒ Any): Lcs[T]

def ensuring(cond: (Lcs[T]) ⇒ Boolean): Lcs[T]

def ensuring(cond: Boolean, msg: ⇒ Any): Lcs[T]

def ensuring(cond: Boolean): Lcs[T]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def formatted(fmtstr: String): String

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

val json: Lcs[T]

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

Computes the longest commons subsequence between both inputs.

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val patch: Lcs[T]

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def →[B](y: B): (Lcs[T], B)