|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Tests for String_DP.H. More...
Go to the source code of this file.
Functions | |
| TEST (StringDP, LevenshteinDistanceClassic) | |
| TEST (StringDP, DamerauLevenshteinDistance) | |
| TEST (StringDP, LongestCommonSubsequence) | |
| TEST (StringDP, LongestCommonSubstring) | |
| TEST (StringDP, LongestCommonSubstringNoMatch) | |
| TEST (StringDP, LevenshteinSingleChar) | |
| TEST (StringDP, LevenshteinDistanceOne) | |
| TEST (StringDP, LevenshteinIdentical) | |
| TEST (StringDP, DamerauLevenshteinSingleChar) | |
| TEST (StringDP, DamerauLevenshteinEmpty) | |
| TEST (StringDP, DamerauLevenshteinVsLevenshtein) | |
| TEST (StringDP, LcsEmptyStrings) | |
| TEST (StringDP, LcsSingleChar) | |
| TEST (StringDP, LongestCommonSubstringSingleChar) | |
| TEST (StringDP, StressLongerEditDistance) | |
Tests for String_DP.H.
Definition in file string_dp_test.cc.
| TEST | ( | StringDP | , |
| DamerauLevenshteinDistance | |||
| ) |
Definition at line 52 of file string_dp_test.cc.
References Aleph::damerau_levenshtein_distance(), and Aleph::divide_and_conquer_partition_dp().
| TEST | ( | StringDP | , |
| DamerauLevenshteinEmpty | |||
| ) |
Definition at line 113 of file string_dp_test.cc.
References Aleph::damerau_levenshtein_distance(), and Aleph::divide_and_conquer_partition_dp().
| TEST | ( | StringDP | , |
| DamerauLevenshteinSingleChar | |||
| ) |
Definition at line 105 of file string_dp_test.cc.
References Aleph::damerau_levenshtein_distance(), and Aleph::divide_and_conquer_partition_dp().
| TEST | ( | StringDP | , |
| DamerauLevenshteinVsLevenshtein | |||
| ) |
Definition at line 118 of file string_dp_test.cc.
References Aleph::damerau_levenshtein_distance(), Aleph::divide_and_conquer_partition_dp(), and Aleph::levenshtein_distance().
| TEST | ( | StringDP | , |
| LcsEmptyStrings | |||
| ) |
Definition at line 125 of file string_dp_test.cc.
References Aleph::divide_and_conquer_partition_dp(), and Aleph::longest_common_subsequence().
| TEST | ( | StringDP | , |
| LcsSingleChar | |||
| ) |
Definition at line 136 of file string_dp_test.cc.
References Aleph::divide_and_conquer_partition_dp(), Aleph::longest_common_subsequence(), and r.
| TEST | ( | StringDP | , |
| LevenshteinDistanceClassic | |||
| ) |
Definition at line 43 of file string_dp_test.cc.
References Aleph::divide_and_conquer_partition_dp(), Aleph::edit_distance(), and Aleph::levenshtein_distance().
| TEST | ( | StringDP | , |
| LevenshteinDistanceOne | |||
| ) |
Definition at line 90 of file string_dp_test.cc.
References Aleph::divide_and_conquer_partition_dp(), and Aleph::levenshtein_distance().
| TEST | ( | StringDP | , |
| LevenshteinIdentical | |||
| ) |
Definition at line 100 of file string_dp_test.cc.
References Aleph::divide_and_conquer_partition_dp(), and Aleph::levenshtein_distance().
| TEST | ( | StringDP | , |
| LevenshteinSingleChar | |||
| ) |
Definition at line 82 of file string_dp_test.cc.
References Aleph::divide_and_conquer_partition_dp(), and Aleph::levenshtein_distance().
| TEST | ( | StringDP | , |
| LongestCommonSubsequence | |||
| ) |
Definition at line 59 of file string_dp_test.cc.
References Aleph::divide_and_conquer_partition_dp(), Aleph::longest_common_subsequence(), and r.
| TEST | ( | StringDP | , |
| LongestCommonSubstring | |||
| ) |
Definition at line 66 of file string_dp_test.cc.
References Aleph::divide_and_conquer_partition_dp(), Aleph::longest_common_substring(), and r.
| TEST | ( | StringDP | , |
| LongestCommonSubstringNoMatch | |||
| ) |
Definition at line 75 of file string_dp_test.cc.
References Aleph::divide_and_conquer_partition_dp(), Aleph::longest_common_substring(), and r.
| TEST | ( | StringDP | , |
| LongestCommonSubstringSingleChar | |||
| ) |
Definition at line 143 of file string_dp_test.cc.
References Aleph::divide_and_conquer_partition_dp(), Aleph::longest_common_substring(), and r.
| TEST | ( | StringDP | , |
| StressLongerEditDistance | |||
| ) |
Definition at line 150 of file string_dp_test.cc.
References Aleph::divide_and_conquer_partition_dp(), and Aleph::levenshtein_distance().