abstract class Lcs[T] extends AnyRef
The interface to classes that computes the longest common subsequence between two sequences of elements
Linear Supertypes
Known Subclasses
Ordering
- Alphabetic
- By Inheritance
Inherited
- Lcs
- AnyRef
- Any
Implicitly
- by PatchOps
- by DiffOps
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
- new Lcs()
Abstract Value Members
-
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.
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.
-
abstract
def
savedHashes: Lcs[T]
Returns an instance of this Lcs algorithm that precomputes and store hashes of elements to diff.
Concrete 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): (Lcs[T], B)
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def apply[F[_], Json](json: Json)(implicit P: Patch[F, Json, Lcs[T]]): F[Json]
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native() @HotSpotIntrinsicCandidate()
- 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
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def formatted(fmtstr: String): String
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- val json: Lcs[T]
-
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.
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- val patch: Lcs[T]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
- def →[B](y: B): (Lcs[T], B)