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

Make some typedefs public to make MSVC++ happy. 

llvm-svn: 53432
This commit is contained in:
Ted Kremenek 2008-07-10 23:09:45 +00:00
parent 483300f96d
commit 72a2d8e6b5
1 changed files with 4 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
llvm/include/llvm/ADT/alist.h
View File

@ -24,9 +24,11 @@ namespace llvm {
template<class T, class LargestT = T, class ValueT = T, template<class T, class LargestT = T, class ValueT = T,
class NodeIterT = ilist_iterator<alist_node<T, LargestT> > > class NodeIterT = ilist_iterator<alist_node<T, LargestT> > >
class alist_iterator : public bidirectional_iterator<ValueT, ptrdiff_t> { class alist_iterator : public bidirectional_iterator<ValueT, ptrdiff_t> {
public:
typedef bidirectional_iterator<ValueT, ptrdiff_t> super; typedef bidirectional_iterator<ValueT, ptrdiff_t> super;
typedef alist_node<T, LargestT> NodeTy; typedef alist_node<T, LargestT> NodeTy;
private:
/// NodeIter - The underlying iplist iterator that is being wrapped. /// NodeIter - The underlying iplist iterator that is being wrapped.
NodeIterT NodeIter; NodeIterT NodeIter;
@ -144,9 +146,9 @@ struct simplify_type<const alist_iterator<V, W, X, Y> > {
/// ///
template<class T, class LargestT = T> template<class T, class LargestT = T>
class alist_traits { class alist_traits {
public:
typedef alist_iterator<T, LargestT> iterator; typedef alist_iterator<T, LargestT> iterator;
public:
void addNodeToList(T *) {} void addNodeToList(T *) {}
void removeNodeFromList(T *) {} void removeNodeFromList(T *) {}
void transferNodesFromList(alist_traits &, iterator, iterator) {} void transferNodesFromList(alist_traits &, iterator, iterator) {}
@ -159,9 +161,8 @@ public:
/// ///
template<class T, class LargestT = T> template<class T, class LargestT = T>
class alist { class alist {
typedef alist_node<T, LargestT> NodeTy;
public: public:
typedef alist_node<T, LargestT> NodeTy;
typedef typename ilist<NodeTy>::size_type size_type; typedef typename ilist<NodeTy>::size_type size_type;
private: private: