Implementation of List Bare. More...
Classes | |
| struct | Iterator |
|
Iterator. More... |
|
| struct | IteratorEx |
Public Member Functions | |
| IteratorEx | Erase (const IteratorEx &in_rIter) |
| Erase item. |
|
| IteratorEx | Insert (const IteratorEx &in_rIter, T *in_pItem) |
| Insert item. |
|
| Iterator | End () |
| End condition. |
|
| IteratorEx | BeginEx () |
| Get IteratorEx at beginning. |
|
| Iterator | Begin () |
| Get Iterator at beginning. |
|
| IteratorEx | FindEx (T *in_pItem) |
| Get Iterator from item. |
|
| AkListBare () | |
| Constructor. |
|
| ~AkListBare () | |
| Destructor. |
|
| void | Term () |
| Terminate. |
|
| void | AddFirst (T *in_pItem) |
| Add element at the beginning of list. |
|
| void | AddLast (T *in_pItem) |
| Add element at the end of list. |
|
| AKRESULT | Remove (T *in_pItem) |
| Remove an element. |
|
| AKRESULT | RemoveFirst () |
| Remove the first element. |
|
| AkForceInline void | RemoveAll () |
| Remove all elements. |
|
| AkForceInline T * | First () |
| Get first element. |
|
| AkForceInline bool | IsEmpty () const |
| Empty condition. |
|
| void | RemoveItem (T *in_pItem, T *in_pPrevItem) |
| Remove an element. |
|
| void | AddItem (T *in_pItem, T *in_pNextItem, T *in_pPrevItem) |
| Add an element. |
|
Protected Attributes | |
| T * | m_pFirst |
| top of list |
|
Implementation of List Bare.
Definition at line 167 of file AkListBare.h.
프로젝트를 등록하세요. 아무런 조건이나 의무 사항 없이 빠른 시작을 도와드리겠습니다.
Wwise를 시작해 보세요