#include <linklist.h>
|
| | TLinkList () |
| |
| iterator | Insert (iterator iter, T *element) |
| |
| iterator | Erase (T *element) |
| |
| iterator | begin () |
| |
| const_iterator | begin () const |
| |
| iterator | end () |
| |
| const_iterator | end () const |
| |
| T & | front () |
| |
| T & | back () |
| |
| void | pop_front () |
| |
| void | Push_front (T *element) |
| |
| void | Push_back (T *element) |
| |
| iterator | Find (const T *element) |
| |
| void | Remove (T *element) |
| |
| | TNodeLinkList () |
| |
| | ~TNodeLinkList () |
| |
| void | Initialize_ () |
| |
| iterator | begin () |
| |
| const_iterator | begin () const |
| |
| iterator | end () |
| |
| const_iterator | end () const |
| |
| u32 | size () const |
| |
| bool | empty () const |
| |
| iterator | pop_front () |
| |
| void | clear () |
| |
| iterator | erase (iterator, iterator) |
| |
| iterator | erase (iterator) |
| |
| void | splice (iterator, TNodeLinkList &) |
| |
| void | splice (iterator, TNodeLinkList &, iterator) |
| |
| void | splice (iterator, TNodeLinkList &, iterator, iterator) |
| |
| iterator | Find (const TLinkListNode *) |
| |
| iterator | Insert (iterator, TLinkListNode *) |
| |
| iterator | Erase (TLinkListNode *) |
| |
| void | Remove (TLinkListNode *) |
| |
| bool | Confirm () const |
| |
| bool | Confirm_iterator (const_iterator) const |
| |
| bool | Iterator_isEnd_ (const_iterator it) const |
| |
| template<typename Predicate > |
| void | Remove_if (Predicate predicate, TNodeLinkList &tList) |
| |
| template<typename Predicate > |
| void | remove_if (Predicate predicate) |
| |
◆ value_type
template<typename
T , int I>
◆ TLinkList()
template<typename
T , int I>
◆ back()
template<typename
T , int I>
◆ begin() [1/2]
template<typename
T , int I>
◆ begin() [2/2]
template<typename
T , int I>
◆ Element_toNode() [1/2]
template<typename
T , int I>
◆ Element_toNode() [2/2]
template<typename
T , int I>
◆ Element_toValue() [1/2]
template<typename
T , int I>
◆ Element_toValue() [2/2]
template<typename
T , int I>
◆ end() [1/2]
template<typename
T , int I>
◆ end() [2/2]
template<typename
T , int I>
◆ Erase()
template<typename
T , int I>
◆ Find()
template<typename
T , int I>
◆ front()
template<typename
T , int I>
◆ Insert()
template<typename
T , int I>
◆ pop_front()
template<typename
T , int I>
◆ Push_back()
template<typename
T , int I>
◆ Push_front()
template<typename
T , int I>
◆ Remove()
template<typename
T , int I>
The documentation for this struct was generated from the following file: