summaryrefslogtreecommitdiff
path: root/include/llvm/ADT/ilist.h
diff options
context:
space:
mode:
authorGabor Greif <ggreif@gmail.com>2009-03-02 19:49:29 +0000
committerGabor Greif <ggreif@gmail.com>2009-03-02 19:49:29 +0000
commit83b5752747ea14696b0e51904722c38771f22eb7 (patch)
tree65aa3333c975661e2123570b27ca9f7d96f452d9 /include/llvm/ADT/ilist.h
parent6e2b86b8aaeb5af37366d71ad47009ee2970b273 (diff)
downloadllvm-83b5752747ea14696b0e51904722c38771f22eb7.tar.gz
llvm-83b5752747ea14696b0e51904722c38771f22eb7.tar.bz2
llvm-83b5752747ea14696b0e51904722c38771f22eb7.tar.xz
drop support for GCC 2.x as it is hopelessly broken anyway
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@65864 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'include/llvm/ADT/ilist.h')
-rw-r--r--include/llvm/ADT/ilist.h19
1 files changed, 4 insertions, 15 deletions
diff --git a/include/llvm/ADT/ilist.h b/include/llvm/ADT/ilist.h
index 962a29d0ff..ee7d199230 100644
--- a/include/llvm/ADT/ilist.h
+++ b/include/llvm/ADT/ilist.h
@@ -491,14 +491,7 @@ public:
size_type size() const {
if (Head == 0) return 0; // Don't require construction of sentinel if empty.
-#if __GNUC__ == 2
- // GCC 2.95 has a broken std::distance
- size_type Result = 0;
- std::distance(begin(), end(), Result);
- return Result;
-#else
return std::distance(begin(), end());
-#endif
}
iterator erase(iterator first, iterator last) {
@@ -616,14 +609,10 @@ struct ilist : public iplist<NodeTy> {
insert(this->begin(), first, last);
}
-
- // Forwarding functions: A workaround for GCC 2.95 which does not correctly
- // support 'using' declarations to bring a hidden member into scope.
- //
- iterator insert(iterator a, NodeTy *b){ return iplist<NodeTy>::insert(a, b); }
- void push_front(NodeTy *a) { iplist<NodeTy>::push_front(a); }
- void push_back(NodeTy *a) { iplist<NodeTy>::push_back(a); }
-
+ // bring hidden functions into scope
+ using iplist<NodeTy>::insert;
+ using iplist<NodeTy>::push_front;
+ using iplist<NodeTy>::push_back;
// Main implementation here - Insert for a node passed by value...
iterator insert(iterator where, const NodeTy &val) {