spliff/io.bullet.spliff/Diff/Op

Op

object Op
Companion
class
class Object
trait Matchable
class Any

Type members

Classlikes

sealed trait DelIns extends DelInsMov

The super type of the two basic diff operations returned by Myers' Diff algorithm, Delete and Insert.

The super type of the two basic diff operations returned by Myers' Diff algorithm, Delete and Insert.

sealed trait DelInsMov extends Op

The super type of Delete, Insert and Move.

The super type of Delete, Insert and Move.

final case class Delete(baseIx: Int, count: Int) extends DelIns with Step[Nothing]

Represents a number of contiguous elements that is present in the base sequence but not in the target.

Represents a number of contiguous elements that is present in the base sequence but not in the target.

Value Params
baseIx

the index of the first element in the base sequence that is deleted

count

the number of elements in the deleted chunk

final case class Insert(baseIx: Int, targetIx: Int, count: Int) extends DelIns

Represents a number of contiguous elements that is present in the target sequence but not in the base.

Represents a number of contiguous elements that is present in the target sequence but not in the base.

Value Params
baseIx

the index of the element in the base sequence where the new elements are inserted

count

the number of elements in the inserted chunk

targetIx

the index of the first element in the target sequence that is inserted

final case class Move(origIx: Int, destIx: Int, count: Int) extends DelInsMov with Step[Nothing]

Represents a number of contiguous elements that is present in both the base and target sequences but in a different position in the sequence relative to its surrounding elements.

Represents a number of contiguous elements that is present in both the base and target sequences but in a different position in the sequence relative to its surrounding elements.

Value Params
count

the number of elements in the moved chunk

destIx

the index into the base sequence where the elements are moved to (i.e. inserted)

origIx

the index into the base sequence where the elements are moved from (i.e. deleted)

final case class Replace(baseIx: Int, delCount: Int, targetIx: Int, insCount: Int) extends Op

Represents a number of contiguous elements in the base that was replaced with a chunk of a potentially differing (non-zero) length in the target.

Represents a number of contiguous elements in the base that was replaced with a chunk of a potentially differing (non-zero) length in the target.

This operation is essentially a combination of a Delete and an Insert at the same baseIx.

Value Params
baseIx

the index of the first element in the base sequence that are replaced

delCount

the number of elements in the base sequence that are replaced

insCount

the number of elements that are inserted from the target sequence

targetIx

the index of the first element in the target sequence that are inserted

Implicits

Implicits

implicit def ordering[T <: Op]: Ordering[T]