diff options
| author |  Otto Kekäläinen <otto@seravo.fi> | 2016-07-03 15:26:04 +0300 |
|---|---|---|
| committer | Otto Kekäläinen <otto@seravo.fi> | 2016-07-03 15:26:04 +0300 |
| commit | 3808d091f86e079c8f3437f5cd66bd2c507cef8a (patch) | |
| tree | 83e72f0b4fb9548251fdb0af74003e1523251226 /src/google/protobuf/util/message_differencer.cc | |
| parent | cae3b0cbb689d0ed1e5da73942a5a9705f3411b0 (diff) | |
Fix spelling in strings and comments
Diffstat (limited to 'src/google/protobuf/util/message_differencer.cc')
| -rw-r--r-- | src/google/protobuf/util/message_differencer.cc | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/google/protobuf/util/message_differencer.cc b/src/google/protobuf/util/message_differencer.cc index fc55c2b9..a6d0cb07 100644 --- a/src/google/protobuf/util/message_differencer.cc +++ b/src/google/protobuf/util/message_differencer.cc @@ -1386,7 +1386,7 @@ bool MessageDifferencer::MatchRepeatedFieldIndices( if (key_comparator != NULL || IsTreatedAsSet(repeated_field)) { if (scope_ == PARTIAL) { // When partial matching is enabled, Compare(a, b) && Compare(a, c) - // doesn't neccessarily imply Compare(b, c). Therefore a naive greedy + // doesn't necessarily imply Compare(b, c). Therefore a naive greedy // algorithm will fail to find a maximum matching. // Here we use the argumenting path algorithm. MaximumMatcher::NodeMatchCallback* callback = |