class HashedLcs[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.
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- HashedLcs
- Lcs
- AnyRef
- Any
Implicitly
- by PatchOps
- by DiffOps
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
Visibility
- Public
- Protected
Instance Constructors
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##(): Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- def ->[B](y: B): (HashedLcs[T], B)
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def apply[F[_], Json](json: Json)(implicit P: Patch[F, Json, HashedLcs[T]]): F[Json]
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def diff[P](that: HashedLcs[T])(implicit Diff: Diff[HashedLcs[T], P]): P
- def ensuring(cond: (HashedLcs[T]) => Boolean, msg: => Any): HashedLcs[T]
- def ensuring(cond: (HashedLcs[T]) => Boolean): HashedLcs[T]
- def ensuring(cond: Boolean, msg: => Any): HashedLcs[T]
- def ensuring(cond: Boolean): HashedLcs[T]
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def formatted(fmtstr: String): String
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- val json: HashedLcs[T]
- 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.
- 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.
- Definition Classes
- Lcs
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- val patch: HashedLcs[T]
- def savedHashes: HashedLcs[T]
Returns an instance of this Lcs algorithm that precomputes and store hashes of elements to diff.
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
Deprecated Value Members
- def →[B](y: B): (HashedLcs[T], B)
- Implicit
- This member is added by an implicit conversion from HashedLcs[T] toArrowAssoc[HashedLcs[T]] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use
->instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.