diff options
| -rw-r--r-- | llvm/include/llvm/ADT/ilist.h | 18 |
1 files changed, 3 insertions, 15 deletions
diff --git a/llvm/include/llvm/ADT/ilist.h b/llvm/include/llvm/ADT/ilist.h index 0e92e400fab..3723039bbad 100644 --- a/llvm/include/llvm/ADT/ilist.h +++ b/llvm/include/llvm/ADT/ilist.h @@ -11,15 +11,9 @@ // (i.e. each node of the list must contain a next and previous field for the // list. // -// The ilist_traits trait class is used to gain access to the next and previous -// fields of the node type that the list is instantiated with. If it is not -// specialized, the list defaults to using the getPrev(), getNext() method calls -// to get the next and previous pointers. -// -// The ilist class itself, should be a plug in replacement for list, assuming -// that the nodes contain next/prev pointers. This list replacement does not -// provide a constant time size() method, so be careful to use empty() when you -// really want to know if it's empty. +// The ilist class itself should be a plug in replacement for list. This list +// replacement does not provide a constant time size() method, so be careful to +// use empty() when you really want to know if it's empty. // // The ilist class is implemented by allocating a 'tail' node when the list is // created (using ilist_traits<>::createSentinel()). This tail node is @@ -27,12 +21,6 @@ // of this, users of the direct next/prev links will see an extra link on the // end of the list, which should be ignored. // -// Requirements for a user of this list: -// -// 1. The user must provide {g|s}et{Next|Prev} methods, or specialize -// ilist_traits to provide an alternate way of getting and setting next and -// prev links. -// //===----------------------------------------------------------------------===// #ifndef LLVM_ADT_ILIST_H |
