aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorGennadiy Civil <misterg@google.com>2018-04-05 11:34:32 -0400
committerGennadiy Civil <misterg@google.com>2018-04-05 11:34:32 -0400
commit47d15bceea62696b856e203c236cdd95b285d73c (patch)
tree83c35e27b192746015fea04b7fe5e114bbeb92bf
parent0cd6a4f5f585f4a58a24254dc4cc81675edba16c (diff)
parent2cf2a1f8ce9e25a2c0d053a51a3e67b3621f025b (diff)
downloadgoogletest-47d15bceea62696b856e203c236cdd95b285d73c.tar.gz
googletest-47d15bceea62696b856e203c236cdd95b285d73c.tar.bz2
googletest-47d15bceea62696b856e203c236cdd95b285d73c.zip
Merge branch 'master' of github.com:google/googletest
-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 ffc22f92..c050da79 100644
--- a/googletest/include/gtest/internal/gtest-internal.h
+++ b/googletest/include/gtest/internal/gtest-internal.h
@@ -157,7 +157,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(