reduce redundant are's

git-svn-id: https://llvm.org/svn/llvm-project/cfe/trunk@94009 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/include/clang/Rewrite/DeltaTree.h b/include/clang/Rewrite/DeltaTree.h
index 7e0796524c6d9011775aa478224ff086b75cb7dc..f32906a323e06b560c580727a23e8a1cbcbc05c0 100644 (file)
--- a/include/clang/Rewrite/DeltaTree.h
+++ b/include/clang/Rewrite/DeltaTree.h
@@ -17,7 +17,7 @@
 namespace clang {
 
   /// DeltaTree - a multiway search tree (BTree) structure with some fancy
-  /// features.  B-Trees are are generally more memory and cache efficient than
+  /// features.  B-Trees are generally more memory and cache efficient than
   /// binary trees, because they store multiple keys/values in each node.  This
   /// implements a key/value mapping from index to delta, and allows fast lookup
   /// on index.  However, an added (important) bonus is that it can also

diff --git a/lib/Rewrite/DeltaTree.cpp b/lib/Rewrite/DeltaTree.cpp
index 101cf93f9db9d1425174d0ee48a203defddb7fa5..35e888bcf59511a781dfc4fecce911e38678b8a1 100644 (file)
--- a/lib/Rewrite/DeltaTree.cpp
+++ b/lib/Rewrite/DeltaTree.cpp
@@ -20,7 +20,7 @@ using llvm::cast;
 using llvm::dyn_cast;
 
 /// The DeltaTree class is a multiway search tree (BTree) structure with some
-/// fancy features.  B-Trees are are generally more memory and cache efficient
+/// fancy features.  B-Trees are generally more memory and cache efficient
 /// than binary trees, because they store multiple keys/values in each node.
 ///
 /// DeltaTree implements a key/value mapping from FileIndex to Delta, allowing