| 65 | bool matrix[MAX_UCHAR + 1][MAX_UCHAR + 1]; |
| 66 | public: |
| 67 | EqualityDefinition(const string& alphabet, |
| 68 | const EdlibEqualityPair* additionalEqualities = NULL, |
| 69 | const int additionalEqualitiesLength = 0) { |
| 70 | for (int i = 0; i < (int) alphabet.size(); i++) { |
| 71 | for (int j = 0; j < (int) alphabet.size(); j++) { |
| 72 | matrix[i][j] = (i == j); |
| 73 | } |
| 74 | } |
| 75 | if (additionalEqualities != NULL) { |
| 76 | for (int i = 0; i < additionalEqualitiesLength; i++) { |
| 77 | size_t firstTransformed = alphabet.find(additionalEqualities[i].first); |
| 78 | size_t secondTransformed = alphabet.find(additionalEqualities[i].second); |
| 79 | if (firstTransformed != string::npos && secondTransformed != string::npos) { |
| 80 | matrix[firstTransformed][secondTransformed] = matrix[secondTransformed][firstTransformed] = true; |
| 81 | } |
| 82 | } |
| 83 | } |
| 84 | } |
| 85 | |
| 86 | /** |
| 87 | * @param a Element from transformed sequence. |