diff options
| author | Chris Lattner <sabre@nondot.org> | 2010-01-20 17:53:58 +0000 |
|---|---|---|
| committer | Chris Lattner <sabre@nondot.org> | 2010-01-20 17:53:58 +0000 |
| commit | 6a89c50e23f21af0da4b3c961bfba2f7192c49c4 (patch) | |
| tree | cd5b1d6872e5b2287c927174256d4284e409aec1 /clang/lib | |
| parent | 6a7939243fdb1afc38e01697a76e0bd6af78f4ae (diff) | |
| download | bcm5719-llvm-6a89c50e23f21af0da4b3c961bfba2f7192c49c4.tar.gz bcm5719-llvm-6a89c50e23f21af0da4b3c961bfba2f7192c49c4.zip | |
reduce redundant are's
llvm-svn: 94009
Diffstat (limited to 'clang/lib')
| -rw-r--r-- | clang/lib/Rewrite/DeltaTree.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/clang/lib/Rewrite/DeltaTree.cpp b/clang/lib/Rewrite/DeltaTree.cpp index 101cf93f9db..35e888bcf59 100644 --- a/clang/lib/Rewrite/DeltaTree.cpp +++ b/clang/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 |
