list::longestCommonSubsequence (public)

 list::longestCommonSubsequence sequence1 sequence2

Defined in packages/xowiki/tcl/lcs-procs.tcl

Find a longest common subsequence of two lists.

Parameters:
sequence1 (required)
First list to compare.
sequence2 (required)
Second list to compare.
Returns:
Two lists of indices, one into each input. Corresponding indices identify equal elements in the common subsequence.

Partial Call Graph (max 5 caller/called nodes):
xowiki::text_diff_in_html xowiki::text_diff_in_html (private) list::longestCommonSubsequence list::longestCommonSubsequence xowiki::text_diff_in_html->list::longestCommonSubsequence

Testcases:
No testcase defined.
[ show source ]
Show another procedure: