projects
/
oota-llvm.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Fix broken ipo_ext_iterator constructors.
[oota-llvm.git]
/
include
/
llvm
/
ADT
/
ilist.h
diff --git
a/include/llvm/ADT/ilist.h
b/include/llvm/ADT/ilist.h
index 865fcb3d8aadc53f10e78f2d8965dd24baac2f9b..ba9864a98a7e8d72ee1f0b4df6da69701c2e7f39 100644
(file)
--- a/
include/llvm/ADT/ilist.h
+++ b/
include/llvm/ADT/ilist.h
@@
-289,7
+289,7
@@
template<typename NodeTy> struct simplify_type<const ilist_iterator<NodeTy> > {
//===----------------------------------------------------------------------===//
//
/// iplist - The subset of list functionality that can safely be used on nodes
//===----------------------------------------------------------------------===//
//
/// iplist - The subset of list functionality that can safely be used on nodes
-/// of polymorphic types, i.e. a heterogenous list with a common base class that
+/// of polymorphic types, i.e. a heterogen
e
ous list with a common base class that
/// holds the next/prev pointers. The only state of the list itself is a single
/// pointer to the head of the list.
///
/// holds the next/prev pointers. The only state of the list itself is a single
/// pointer to the head of the list.
///
@@
-652,10
+652,6
@@
struct ilist : public iplist<NodeTy> {
void push_front(const NodeTy &val) { insert(this->begin(), val); }
void push_back(const NodeTy &val) { insert(this->end(), val); }
void push_front(const NodeTy &val) { insert(this->begin(), val); }
void push_back(const NodeTy &val) { insert(this->end(), val); }
- // Special forms of insert...
- template<class InIt> void insert(iterator where, InIt first, InIt last) {
- for (; first != last; ++first) insert(where, *first);
- }
void insert(iterator where, size_type count, const NodeTy &val) {
for (; count != 0; --count) insert(where, val);
}
void insert(iterator where, size_type count, const NodeTy &val) {
for (; count != 0; --count) insert(where, val);
}