Author: jlebar
Date: Fri Jul 29 00:26:58 2016
New Revision: 277113
URL: http://llvm.org/viewvc/llvm-project?rev=277113&view=rev
Log:
[Typo police] s/proccess/process/, s/auxiliary/auxilliary/.
Modified:
clang-tools-extra/trunk/clang-tidy/ClangTidyDiagnosticConsumer.cpp
Modified: clang-tools-extra/trunk/clang-tidy/ClangTidyDiagnosticConsumer.cpp
URL:
http://llvm.org/viewvc/llvm-project/clang-tools-extra/trunk/clang-tidy/ClangTidyDiagnosticConsumer.cpp?rev=277113&r1=277112&r2=277113&view=diff
==============================================================================
--- clang-tools-extra/trunk/clang-tidy/ClangTidyDiagnosticConsumer.cpp
(original)
+++ clang-tools-extra/trunk/clang-tidy/ClangTidyDiagnosticConsumer.cpp Fri Jul
29 00:26:58 2016
@@ -426,7 +426,7 @@ void ClangTidyDiagnosticConsumer::remove
// replacements. To detect overlapping replacements, we use a sweep line
// algorithm over these sets of intervals.
// An event here consists of the opening or closing of an interval. During
the
- // proccess, we maintain a counter with the amount of open intervals. If we
+ // process, we maintain a counter with the amount of open intervals. If we
// find an endpoint of an interval and this counter is different from 0, it
// means that this interval overlaps with another one, so we set it as
// inapplicable.
@@ -448,7 +448,7 @@ void ClangTidyDiagnosticConsumer::remove
// priority than begin events.
//
// * If we have several begin points at the same position, we will mark
as
- // inapplicable the ones that we proccess later, so the first one has
to
+ // inapplicable the ones that we process later, so the first one has to
// be the one with the latest end point, because this one will contain
// all the other intervals. For the same reason, if we have several end
// points in the same position, the last one has to be the one with the
@@ -456,14 +456,14 @@ void ClangTidyDiagnosticConsumer::remove
// position of the complementary.
//
// * In case of two equal intervals, the one whose error is bigger can
- // potentially contain the other one, so we want to proccess its begin
+ // potentially contain the other one, so we want to process its begin
// points before and its end points later.
//
// * Finally, if we have two equal intervals whose errors have the same
// size, none of them will be strictly contained inside the other.
// Sorting by ErrorId will guarantee that the begin point of the first
- // one will be proccessed before, disallowing the second one, and the
- // end point of the first one will also be proccessed before,
+ // one will be processed before, disallowing the second one, and the
+ // end point of the first one will also be processed before,
// disallowing the first one.
if (Type == ET_Begin)
Priority = std::make_tuple(Begin, Type, -End, -ErrorSize, ErrorId);
_______________________________________________
cfe-commits mailing list
cfe-commits@lists.llvm.org
http://lists.llvm.org/cgi-bin/mailman/listinfo/cfe-commits
