Packages

c

gnieh.diff

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
  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. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  10. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  11. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  12. def lcs(s1: IndexedSeq[T], s2: IndexedSeq[T], low1: Int, high1: Int, low2: Int, high2: Int): List[Common]

    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. Before calling the actual lcs algorithm, it performs some preprocessing to detect trivial solutions.

    Definition Classes
    Lcs
  13. def lcs(seq1: IndexedSeq[T], seq2: IndexedSeq[T]): List[Common]

    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
    Annotations
    @inline()
  14. def lcsInner(seq1: IndexedSeq[T], glow1: Int, seq2: IndexedSeq[T], glow2: Int): List[Common]

    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
  15. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  16. final def notify(): Unit
    Definition Classes
    AnyRef
  17. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  18. def push(common: Common, commons: List[Common], back: Boolean): List[Common]
    Attributes
    protected
    Definition Classes
    Lcs
  19. def push(idx1: Int, idx2: Int, commons: List[Common], back: Boolean): List[Common]
    Attributes
    protected
    Definition Classes
    Lcs
  20. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  21. def toString(): String
    Definition Classes
    AnyRef → Any
  22. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  23. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  24. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Lcs[T]

Inherited from AnyRef

Inherited from Any

Ungrouped