Packages

c

gnieh.diffson

Patience

class Patience[T] extends Lcs[T]

Implementation of the patience algorithm [1] to compute the longest common subsequence

[1] http://alfedenzo.livejournal.com/170301.html

Linear Supertypes
Lcs[T], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Patience
  2. Lcs
  3. AnyRef
  4. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Patience(withFallback: Boolean = true)

    withFallback

    whether to fallback to classic LCS when patience could not find the LCS

Type Members

  1. type Occurrence = (T, Int)

    An occurrence of a value associated to its index

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from Patience[T] to any2stringadd[Patience[T]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (Patience[T], B)
    Implicit
    This member is added by an implicit conversion from Patience[T] to ArrowAssoc[Patience[T]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  5. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. def ensuring(cond: (Patience[T]) ⇒ Boolean, msg: ⇒ Any): Patience[T]
    Implicit
    This member is added by an implicit conversion from Patience[T] to Ensuring[Patience[T]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  9. def ensuring(cond: (Patience[T]) ⇒ Boolean): Patience[T]
    Implicit
    This member is added by an implicit conversion from Patience[T] to Ensuring[Patience[T]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  10. def ensuring(cond: Boolean, msg: ⇒ Any): Patience[T]
    Implicit
    This member is added by an implicit conversion from Patience[T] to Ensuring[Patience[T]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  11. def ensuring(cond: Boolean): Patience[T]
    Implicit
    This member is added by an implicit conversion from Patience[T] to Ensuring[Patience[T]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  12. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  13. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  14. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  15. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from Patience[T] to StringFormat[Patience[T]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  16. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  17. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  18. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  19. def lcs(s1: Seq[T], s2: Seq[T], low1: Int, high1: Int, low2: Int, high2: Int): List[(Int, Int)]

    Computes the longest common subsequence between both sequences.

    Computes the longest common subsequence between both sequences. It is encoded as the list of common indices in the first and the second sequence.

    Definition Classes
    Patience → Lcs
  20. def lcs(seq1: Seq[T], seq2: Seq[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
  21. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  22. final def notify(): Unit
    Definition Classes
    AnyRef
  23. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  24. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  25. def toString(): String
    Definition Classes
    AnyRef → Any
  26. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  27. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  28. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  29. def →[B](y: B): (Patience[T], B)
    Implicit
    This member is added by an implicit conversion from Patience[T] to ArrowAssoc[Patience[T]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Inherited from Lcs[T]

Inherited from AnyRef

Inherited from Any

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]]

Ungrouped