#define LLVM_ADT_ILIST_H
#include <cassert>
+#include <cstddef>
#include <iterator>
namespace llvm {
template<class Pr3> void sort(Pr3 pred);
void sort() { sort(op_less); }
- void reverse();
};
// Main implementation here - Insert for a node passed by value...
iterator insert(iterator where, const NodeTy &val) {
- return insert(where, createNode(val));
+ return insert(where, this->createNode(val));
}