Algorithms to solve the Longest Common Subsequence problem. http://en.wikibooks.org/wiki/Algorithm_Implementation/Strings/Longest_common_subsequence
More...
|
static int[,] | GetLCS< T > (IList< T > str1, IList< T > str2, IEqualityComparer< T > comparer=null) |
|
static List< T > | ReadLCSFromBacktrack< T > (int[,] backtrack, IList< T > string1, IList< T > string2, IEqualityComparer< T > comparer=null) |
|
static void | ApplyDiff< T > (IList< T > list1, IList< T > list2, List< Diff > differences, Func< T, T > copyItem=null) |
|
static List< Diff > | GenerateDiff< T > (int[,] backtrack, IList< T > list1, IList< T > list2, IEqualityComparer< T > comparer=null) |
|
Enumerator |
---|
Add |
|
Remove |
|
Skip |
|
Definition at line 35 of file LCS.cs.
static void SiliconStudio.Quantum.LCS.ApplyDiff< T > |
( |
IList< T > |
list1, |
|
|
IList< T > |
list2, |
|
|
List< Diff > |
differences, |
|
|
Func< T, T > |
copyItem = null |
|
) |
| |
|
static |
static List<Diff> SiliconStudio.Quantum.LCS.GenerateDiff< T > |
( |
int |
backtrack[,], |
|
|
IList< T > |
list1, |
|
|
IList< T > |
list2, |
|
|
IEqualityComparer< T > |
comparer = null |
|
) |
| |
|
static |
static int [,] SiliconStudio.Quantum.LCS.GetLCS< T > |
( |
IList< T > |
str1, |
|
|
IList< T > |
str2, |
|
|
IEqualityComparer< T > |
comparer = null |
|
) |
| |
|
static |
static List<T> SiliconStudio.Quantum.LCS.ReadLCSFromBacktrack< T > |
( |
int |
backtrack[,], |
|
|
IList< T > |
string1, |
|
|
IList< T > |
string2, |
|
|
IEqualityComparer< T > |
comparer = null |
|
) |
| |
|
static |
The documentation for this class was generated from the following file:
- D:/Projects/Bitbucket Hosting/DoxygenFilesAndSources/Paradox v1.0.0 beta06/sources/common/presentation/SiliconStudio.Presentation.Quantum/LCS.cs