summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorNico Weber <nicolasweber@gmx.de>2015-05-02 14:38:43 -0700
committerNico Weber <nicolasweber@gmx.de>2015-05-02 14:38:43 -0700
commitf0f36ad1c72f6100a8957f035769fda50b69919f (patch)
tree47738a6f5572518e424022b17f58cdc6ee8904c6
parent3cae29b166c27a93a26cc5f086ba7d89ea81494d (diff)
downloadninja-f0f36ad1c72f6100a8957f035769fda50b69919f.tar.gz
Fix typo in comment.
-rw-r--r--src/edit_distance.cc2
1 files changed, 1 insertions, 1 deletions
diff --git a/src/edit_distance.cc b/src/edit_distance.cc
index 9553c6e..a6719d3 100644
--- a/src/edit_distance.cc
+++ b/src/edit_distance.cc
@@ -28,7 +28,7 @@ int EditDistance(const StringPiece& s1,
// http://en.wikipedia.org/wiki/Levenshtein_distance
//
// Although the algorithm is typically described using an m x n
- // array, only two rows are used at a time, so this implemenation
+ // array, only two rows are used at a time, so this implementation
// just keeps two separate vectors for those two rows.
int m = s1.len_;
int n = s2.len_;