maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity

zap more dead code. 

llvm-svn: 113076
This commit is contained in:
Chris Lattner 2010-09-04 18:19:08 +00:00
parent 2f095c636a
commit a3d232ad27
2 changed files with 4 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
clang/lib/Rewrite/RewriteRope.cpp
View File

@ -119,7 +119,7 @@ namespace {
/// guaranteed that there is a split at Offset.
void erase(unsigned Offset, unsigned NumBytes);
static inline bool classof(const RopePieceBTreeNode *) { return true; }
//static inline bool classof(const RopePieceBTreeNode *) { return true; }
};
} // end anonymous namespace
@ -223,7 +223,7 @@ namespace {
/// guaranteed that there is a split at Offset.
void erase(unsigned Offset, unsigned NumBytes);
static inline bool classof(const RopePieceBTreeLeaf *) { return true; }
//static inline bool classof(const RopePieceBTreeLeaf *) { return true; }
static inline bool classof(const RopePieceBTreeNode *N) {
return N->isLeaf();
}
@ -455,7 +455,7 @@ namespace {
/// guaranteed that there is a split at Offset.
void erase(unsigned Offset, unsigned NumBytes);
static inline bool classof(const RopePieceBTreeInterior *) { return true; }
//static inline bool classof(const RopePieceBTreeInterior *) { return true; }
static inline bool classof(const RopePieceBTreeNode *N) {
return !N->isLeaf();
}

5
clang/lib/Sema/SemaLookup.cpp
View File

@ -183,11 +183,8 @@ namespace {
std::sort(list.begin(), list.end(), UnqualUsingEntry::Comparator());
}
typedef ListTy::iterator iterator;
typedef ListTy::const_iterator const_iterator;
iterator begin() { return list.begin(); }
iterator end() { return list.end(); }
const_iterator begin() const { return list.begin(); }
const_iterator end() const { return list.end(); }
@ -2707,7 +2704,7 @@ public:
typedef llvm::SmallVector<IdentifierInfo *, 4>::const_iterator
keyword_iterator;
keyword_iterator keyword_begin() const { return BestKeywords.begin(); }
keyword_iterator keyword_end() const { return BestKeywords.end(); }
//keyword_iterator keyword_end() const { return BestKeywords.end(); }
bool keyword_empty() const { return BestKeywords.empty(); }
unsigned keyword_size() const { return BestKeywords.size(); }