diff options
author | Misha Brukman <brukman+llvm@gmail.com> | 2005-04-21 20:19:05 +0000 |
---|---|---|
committer | Misha Brukman <brukman+llvm@gmail.com> | 2005-04-21 20:19:05 +0000 |
commit | 9769ab22265b313171d201b5928688524a01bd87 (patch) | |
tree | 4215db61d3b617687d0eec4ed3caf7dbf973f4ca /include/llvm/ADT/SetOperations.h | |
parent | 109026290b3b07152322e65801edb51dccfe7ddc (diff) | |
download | llvm-9769ab22265b313171d201b5928688524a01bd87.tar.gz llvm-9769ab22265b313171d201b5928688524a01bd87.tar.bz2 llvm-9769ab22265b313171d201b5928688524a01bd87.tar.xz |
Remove trailing whitespace
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@21408 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'include/llvm/ADT/SetOperations.h')
-rw-r--r-- | include/llvm/ADT/SetOperations.h | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/include/llvm/ADT/SetOperations.h b/include/llvm/ADT/SetOperations.h index 57750d19c6..c37d1e7b14 100644 --- a/include/llvm/ADT/SetOperations.h +++ b/include/llvm/ADT/SetOperations.h @@ -1,10 +1,10 @@ //===-- llvm/ADT/SetOperations.h - Generic Set Operations -------*- C++ -*-===// -// +// // The LLVM Compiler Infrastructure // // This file was developed by the LLVM research group and is distributed under // the University of Illinois Open Source License. See LICENSE.TXT for details. -// +// //===----------------------------------------------------------------------===// // // This file defines generic set operations that may be used on set's of @@ -20,7 +20,7 @@ namespace llvm { /// set_union(A, B) - Compute A := A u B, return whether A changed. /// template <class S1Ty, class S2Ty> -bool set_union(S1Ty &S1, const S2Ty &S2) { +bool set_union(S1Ty &S1, const S2Ty &S2) { bool Changed = false; for (typename S2Ty::const_iterator SI = S2.begin(), SE = S2.end(); @@ -60,9 +60,9 @@ S1Ty set_difference(const S1Ty &S1, const S2Ty &S2) { /// set_subtract(A, B) - Compute A := A - B /// template <class S1Ty, class S2Ty> -void set_subtract(S1Ty &S1, const S2Ty &S2) { +void set_subtract(S1Ty &S1, const S2Ty &S2) { for (typename S2Ty::const_iterator SI = S2.begin(), SE = S2.end(); - SI != SE; ++SI) + SI != SE; ++SI) S1.erase(*SI); } |