зеркало из https://github.com/microsoft/clang-1.git
zap more dead code.
git-svn-id: https://llvm.org/svn/llvm-project/cfe/trunk@113076 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Родитель
66392d4260
Коммит
24dce6ef2f
|
@ -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();
|
||||
}
|
||||
|
|
|
@ -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(); }
|
||||
|
||||
|
|
Загрузка…
Ссылка в новой задаче