Class

diffson.lcs

Patience

Related Doc: package lcs

Permalink

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 PatchOps
  2. by DiffOps
  3. by any2stringadd
  4. by StringFormat
  5. by Ensuring
  6. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Patience(withFallback: Boolean = true)(implicit arg0: Eq[T])

    Permalink

    withFallback

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

Type Members

  1. type Occurrence = (T, Int)

    Permalink

    An occurrence of a value associated to its index

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. def +(other: String): String

    Permalink
    Implicit information
    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)

    Permalink
    Implicit information
    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

    Permalink
    Definition Classes
    AnyRef → Any

  6. def apply[F[_], Json](json: Json)(implicit P: Patch[F, Json, Patience[T]]): F[Json]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Patience[T] to PatchOps[Patience[T]] performed by method PatchOps in diffson.
    Definition Classes
    PatchOps

  7. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  8. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  9. def diff[P](that: Patience[T])(implicit Diff: Diff[Patience[T], P]): P

    Permalink
    Implicit information
    This member is added by an implicit conversion from Patience[T] to DiffOps[Patience[T]] performed by method DiffOps in diffson.
    Definition Classes
    DiffOps

  10. def ensuring(cond: (Patience[T]) ⇒ Boolean, msg: ⇒ Any): Patience[T]

    Permalink
    Implicit information
    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: (Patience[T]) ⇒ Boolean): Patience[T]

    Permalink
    Implicit information
    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. def ensuring(cond: Boolean, msg: ⇒ Any): Patience[T]

    Permalink
    Implicit information
    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

  13. def ensuring(cond: Boolean): Patience[T]

    Permalink
    Implicit information
    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

  14. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  15. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  16. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  17. def formatted(fmtstr: String): String

    Permalink
    Implicit information
    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()

  18. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  19. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  20. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  21. val json: Patience[T]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Patience[T] to DiffOps[Patience[T]] performed by method DiffOps in diffson.
    Definition Classes
    DiffOps

  22. def lcs(s1: List[T], s2: List[T], low1: Int, high1: Int, low2: Int, high2: Int): List[(Int, Int)]

    Permalink

    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

  23. def lcs(seq1: List[T], seq2: List[T]): List[(Int, Int)]

    Permalink

    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

  24. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  25. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  26. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  27. val patch: Patience[T]

    Permalink
    Implicit information
    This member is added by an implicit conversion from Patience[T] to PatchOps[Patience[T]] performed by method PatchOps in diffson.
    Definition Classes
    PatchOps

  28. def savedHashes: Lcs[T]

    Permalink

    Returns an instance of this Lcs algorithm that precomputes and store hashes of elements to diff.

    Returns an instance of this Lcs algorithm that precomputes and store hashes of elements to diff.

    Definition Classes
    Patience → Lcs

  29. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef

  30. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  31. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  32. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  33. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  34. def →[B](y: B): (Patience[T], B)

    Permalink
    Implicit information
    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 PatchOps from Patience[T] to PatchOps[Patience[T]]

Inherited by implicit conversion DiffOps from Patience[T] to DiffOps[Patience[T]]

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