class
Patience[T] extends Lcs[T]
Instance Constructors
-
new
Patience(withFallback: Boolean = true)
Type Members
-
type
Occurrence = (T, Int)
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
+(other: String): String
-
def
->[B](y: B): (Patience[T], B)
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
-
-
-
-
-
-
def
finalize(): Unit
-
def
formatted(fmtstr: String): String
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
lcs(s1: Seq[T], s2: Seq[T], low1: Int, high1: Int, low2: Int, high2: Int): List[(Int, Int)]
-
def
lcs(seq1: Seq[T], seq2: Seq[T]): List[(Int, Int)]
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
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): (Patience[T], B)
Inherited by implicit conversion any2stringadd from
Patience[T] to any2stringadd[Patience[T]]
Inherited by implicit conversion StringFormat from
Patience[T] to StringFormat[Patience[T]]
Inherited by implicit conversion Ensuring from
Patience[T] to Ensuring[Patience[T]]
Inherited by implicit conversion ArrowAssoc from
Patience[T] to ArrowAssoc[Patience[T]]
Implementation of the patience algorithm [1] to compute the longest common subsequence
[1] http://alfedenzo.livejournal.com/170301.html