whether to fallback to classic LCS when patience could not find the LCS
An occurrence of a value associated to its index
Computes the longest common subsequence between both sequences.
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.
(patience: StringAdd).self
(patience: StringFormat).self
(patience: ArrowAssoc[Patience[T]]).x
(Since version 2.10.0) Use leftOfArrow
instead
(patience: Ensuring[Patience[T]]).x
(Since version 2.10.0) Use resultOfEnsuring
instead
Implementation of the patience algorithm [1] to compute the longest common subsequence
[1] http://alfedenzo.livejournal.com/170301.html