RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2024-12-26 22:26:16 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Make some typedefs public to make MSVC++ happy.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@53432 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Ted Kremenek 2008-07-10 23:09:45 +00:00
parent ccaa6540fc
commit 3000357ab5
1 changed files with 4 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

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