aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorBilly Donahue <BillyDonahue@users.noreply.github.com>2017-06-11 18:34:04 -0400
committerGitHub <noreply@github.com>2017-06-11 18:34:04 -0400
commitc2d90bddc6a2a562ee7750c14351e9ca16a6a37a (patch)
tree2107bccaf3c6683d7d80308657a8e1df6decfe41
parenta44bbab9bdb2ac80336504a373aab9109163a808 (diff)
downloadgoogletest-c2d90bddc6a2a562ee7750c14351e9ca16a6a37a.tar.gz
googletest-c2d90bddc6a2a562ee7750c14351e9ca16a6a37a.tar.bz2
googletest-c2d90bddc6a2a562ee7750c14351e9ca16a6a37a.zip
Create gtest-internal.h
-rw-r--r--googletest/include/gtest/internal/gtest-internal.h2
1 files changed, 1 insertions, 1 deletions
diff --git a/googletest/include/gtest/internal/gtest-internal.h b/googletest/include/gtest/internal/gtest-internal.h
index eda5ab46..72d83f0b 100644
--- a/googletest/include/gtest/internal/gtest-internal.h
+++ b/googletest/include/gtest/internal/gtest-internal.h
@@ -175,7 +175,7 @@ namespace edit_distance {
// Returns the optimal edits to go from 'left' to 'right'.
// All edits cost the same, with replace having lower priority than
// add/remove.
-// Simple implementation of the Wagner–Fischer algorithm.
+// Simple implementation of the Wagner-Fischer algorithm.
// See http://en.wikipedia.org/wiki/Wagner-Fischer_algorithm
enum EditType { kMatch, kAdd, kRemove, kReplace };
GTEST_API_ std::vector<EditType> CalculateOptimalEdits(