#include <TDList.h>
Definition at line 82 of file TDList.h.
◆ TGenericPriList()
TGenericPriList::TGenericPriList |
( |
| ) |
|
|
protected |
◆ ~TGenericPriList()
TGenericPriList::~TGenericPriList |
( |
| ) |
|
|
protected |
◆ Begin()
TNode * TGenericPriList::Begin |
( |
| ) |
|
|
inline |
◆ End()
TNode * TGenericPriList::End |
( |
| ) |
|
|
inline |
◆ Head()
TNode * TGenericPriList::Head |
( |
| ) |
|
|
inline |
◆ Insert() [1/2]
void TGenericPriList::Insert |
( |
TNode * | a_pNode | ) |
|
Definition at line 34 of file TPriList.cpp.
35{
36 TINT iPriority = a_pNode->m_iPriority;
37
38 if ( iPriority < 0 )
39 {
40 TNode* pCurNode = m_pNext;
41
43 {
44 pCurNode = pCurNode->m_pNext;
45 }
46
51 }
52 else
53 {
54 TNode* pCurNode = m_pPrev;
55 while ( pCurNode !=
End() && iPriority < pCurNode->m_iPriority )
56 {
57 pCurNode = pCurNode->m_pPrev;
58 }
63 }
64}
◆ Insert() [2/2]
void TGenericPriList::Insert |
( |
TNode * | a_pNode, |
|
|
TINT | iPriority ) |
Definition at line 66 of file TPriList.cpp.
67{
68 a_pNode->SetPriority( iPriority );
70}
void Insert(TNode *a_pNode, TINT iPriority)
◆ IsEmpty()
TBOOL TGenericPriList::IsEmpty |
( |
| ) |
|
|
inline |
Definition at line 131 of file TDList.h.
131{
return m_pNext ==
End(); }
◆ RemoveAll()
void TGenericPriList::RemoveAll |
( |
| ) |
|
Definition at line 72 of file TPriList.cpp.
73{
74 TNode* pNode = m_pNext;
75
76 while ( pNode !=
End() )
77 {
78 pNode->Remove();
79 pNode = m_pNext;
80 }
81}
◆ Tail()
TNode * TGenericPriList::Tail |
( |
| ) |
|
|
inline |
The documentation for this class was generated from the following files:
- D:/_dev/OpenBarnyard/Source/Toshi/Source/Toshi/TDList.h
- D:/_dev/OpenBarnyard/Source/Toshi/Source/Toshi/TPriList.cpp