#include <atlcoll.h>

Inheritance diagram for ATL::CAtlList< E, ETraits >:

[legend]

Collaboration diagram for ATL::CAtlList< E, ETraits >:

[legend]

Classes
class	CNode

Public Member Functions
	CAtlList (_In_ UINT nBlockSize=10)

	~CAtlList ()

size_t	GetCount () const

bool	IsEmpty () const

POSITION	GetHeadPosition () const

POSITION	GetTailPosition () const

E &	GetNext (_Inout_ POSITION &pos)

const E &	GetNext (_Inout_ POSITION &pos) const

E &	GetPrev (_Inout_ POSITION &pos)

const E &	GetPrev (_Inout_ POSITION &pos) const

E &	GetAt (_In_ POSITION pos)

const E &	GetAt (_In_ POSITION pos) const

POSITION	AddHead (INARGTYPE element)

POSITION	AddTail (INARGTYPE element)

void	AddHeadList (_In_ const CAtlList< E, ETraits > *plNew)

void	AddTailList (_In_ const CAtlList< E, ETraits > *plNew)

E	RemoveHead ()

E	RemoveTail ()

POSITION	InsertBefore (_In_ POSITION pos, INARGTYPE element)

POSITION	InsertAfter (_In_ POSITION pos, INARGTYPE element)

void	RemoveAll ()

void	RemoveAt (_In_ POSITION pos)

POSITION	Find (INARGTYPE element, _In_opt_ POSITION posStartAfter=NULL) const

POSITION	FindIndex (_In_ size_t iElement) const

void	SwapElements (POSITION pos1, POSITION pos2)

Private Types
typedef ETraits::INARGTYPE	INARGTYPE

Private Member Functions
	CAtlList (_In_ const CAtlList &)

CAtlList &	operator= (_In_ const CAtlList &)

CNode *	CreateNode (INARGTYPE element, _In_opt_ CNode pPrev, _In_opt_ CNode pNext)

void	FreeNode (_Inout_ CNode *pNode)

CNode *	GetFreeNode ()

Private Attributes
CAtlPlex *	m_Blocks

UINT	m_BlockSize

CNode *	m_HeadNode

CNode *	m_TailNode

CNode *	m_FreeNode

size_t	m_NumElements

Detailed Description

template<typename E, class ETraits = CElementTraits<E>>
class ATL::CAtlList< E, ETraits >

Definition at line 424 of file atlcoll.h.

Member Typedef Documentation

◆ INARGTYPE

template<typename E , class ETraits = CElementTraits<E>>

typedef ETraits::INARGTYPE ATL::CAtlList< E, ETraits >::INARGTYPE

private

Definition at line 427 of file atlcoll.h.

Constructor & Destructor Documentation

◆ CAtlList() [1/2]

template<typename E , class ETraits = CElementTraits<E>>

ATL::CAtlList< E, ETraits >::CAtlList ( _In_ const CAtlList< E, ETraits > & )

private

◆ CAtlList() [2/2]

template<typename E , class ETraits >

ATL::CAtlList< E, ETraits >::CAtlList ( _In_ UINT nBlockSize = 10 )

Definition at line 524 of file atlcoll.h.

                                                     :
    m_Blocks(NULL),
    m_BlockSize(nBlockSize),
    m_HeadNode(NULL),
    m_TailNode(NULL),
    m_FreeNode(NULL),
    m_NumElements(0)
{
    ATLASSERT(nBlockSize > 0);
}

◆ ~CAtlList()

template<typename E , class ETraits >

ATL::CAtlList< E, ETraits >::~CAtlList ( void )

Definition at line 536 of file atlcoll.h.

{
    RemoveAll();
}

Member Function Documentation

◆ AddHead()

template<typename E , class ETraits >

POSITION ATL::CAtlList< E, ETraits >::AddHead ( INARGTYPE element )

Definition at line 612 of file atlcoll.h.

{
    CNode* Node = CreateNode(element, NULL, m_HeadNode);
    if (m_HeadNode)
    {
        m_HeadNode->m_Prev = Node;
    }
    else
    {
        m_TailNode = Node;
    }
    m_HeadNode = Node;
 
    return (POSITION)Node;
}

Referenced by EditTypeDlg_OnCommand(), and test_BasicCases().

◆ AddHeadList()

template<typename E , class ETraits >

void ATL::CAtlList< E, ETraits >::AddHeadList ( _In_ const CAtlList< E, ETraits > * plNew )

Definition at line 646 of file atlcoll.h.

{
    ATLASSERT(plNew != NULL && plNew != this);
    POSITION pos = plNew->GetTailPosition();
    while (pos)
        AddHead(plNew->GetPrev(pos));
}

◆ AddTail()

template<typename E , class ETraits >

POSITION ATL::CAtlList< E, ETraits >::AddTail ( INARGTYPE element )

Definition at line 629 of file atlcoll.h.

{
    CNode* Node = CreateNode(element, m_TailNode, NULL);
    if (m_TailNode)
    {
        m_TailNode->m_Next = Node;
    }
    else
    {
        m_HeadNode = Node;
    }
    m_TailNode = Node;
 
    return (POSITION)Node;
}

Referenced by AddInfoFields(), CAppDB::EnumerateFiles(), HandleInstallCommand(), HandleSetupCommand(), CFontCache::Insert(), CMainWindow::ItemCheckStateChanged(), CZipEnumerator::next_unique(), START_TEST(), and test_BasicCases().

◆ AddTailList()

template<typename E , class ETraits >

void ATL::CAtlList< E, ETraits >::AddTailList ( _In_ const CAtlList< E, ETraits > * plNew )

Definition at line 655 of file atlcoll.h.

{
    ATLASSERT(plNew != NULL && plNew != this);
    POSITION pos = plNew->GetHeadPosition();
    while (pos)
        AddTail(plNew->GetNext(pos));
}

◆ CreateNode()

template<typename E , class ETraits >

CAtlList< E, ETraits >::CNode * ATL::CAtlList< E, ETraits >::CreateNode	(	INARGTYPE	element,
		_In_opt_ CNode *	pPrev,
		_In_opt_ CNode *	pNext
	)

private

Definition at line 880 of file atlcoll.h.

{
    GetFreeNode();
 
    CNode* NewNode = m_FreeNode;
    CNode* NextFree = m_FreeNode->m_Next;
 
    NewNode = new CNode(element);
 
    m_FreeNode = NextFree;
    NewNode->m_Prev = Prev;
    NewNode->m_Next = Next;
    m_NumElements++;
 
    return NewNode;
}

◆ Find()

template<typename E , class ETraits >

POSITION ATL::CAtlList< E, ETraits >::Find	(	INARGTYPE	element,
		_In_opt_ POSITION	posStartAfter = `NULL`
	)		const

Definition at line 794 of file atlcoll.h.

{
    CNode* Node = (CNode*)posStartAfter;
    if (Node == NULL)
    {
        Node = m_HeadNode;
    }
    else
    {
        Node = Node->m_Next;
    }
 
    for (; Node != NULL; Node = Node->m_Next)
    {
        if (ETraits::CompareElements(Node->m_Element, element))
            return (POSITION)Node;
    }
 
    return NULL;
}

Referenced by CMainWindow::AddApplicationsToView(), EditTypeDlg_WriteClass(), CMainWindow::ItemCheckStateChanged(), and CZipEnumerator::next_unique().

◆ FindIndex()

template<typename E , class ETraits >

POSITION ATL::CAtlList< E, ETraits >::FindIndex ( _In_ size_t iElement ) const

Definition at line 818 of file atlcoll.h.

{
    if (iElement >= m_NumElements)
        return NULL;
 
    if (m_HeadNode == NULL)
        return NULL;
 
    CNode* Node = m_HeadNode;
    for (size_t i = 0; i < iElement; i++)
    {
        Node = Node->m_Next;
    }
 
    return (POSITION)Node;
}

◆ FreeNode()

template<typename E , class ETraits >

void ATL::CAtlList< E, ETraits >::FreeNode ( _Inout_ CNode * pNode )

private

Definition at line 902 of file atlcoll.h.

{
    pNode->~CNode();
    pNode->m_Next = m_FreeNode;
    m_FreeNode = pNode;
 
    m_NumElements--;
    if (m_NumElements == 0)
    {
        RemoveAll();
    }
}

◆ GetAt() [1/2]

template<typename E , class ETraits >

E & ATL::CAtlList< E, ETraits >::GetAt ( _In_ POSITION pos )

inline

Definition at line 598 of file atlcoll.h.

{
    CNode* Node = (CNode*)pos;
    return Node->m_Element;
}

◆ GetAt() [2/2]

template<typename E , class ETraits >

const E & ATL::CAtlList< E, ETraits >::GetAt ( _In_ POSITION pos ) const

inline

Definition at line 605 of file atlcoll.h.

{
    CNode* Node = (CNode*)pos;
    return Node->m_Element;
}

◆ GetCount()

template<typename E , class ETraits >

size_t ATL::CAtlList< E, ETraits >::GetCount

inline

Definition at line 542 of file atlcoll.h.

{
    return m_NumElements;
}

Referenced by CAppDB::GetAvailableCount(), CFontCache::Read(), test_BasicCases(), and CMainWindow::UpdateStatusBarText().

◆ GetFreeNode()

template<typename E , class ETraits >

CAtlList< E, ETraits >::CNode * ATL::CAtlList< E, ETraits >::GetFreeNode

private

Definition at line 918 of file atlcoll.h.

{
    if (m_FreeNode)
    {
        return m_FreeNode;
    }
 
    CAtlPlex* Block = CAtlPlex::Create(m_Blocks, m_BlockSize, sizeof(CNode));
    if (Block == NULL)
    {
        AtlThrowImp(E_OUTOFMEMORY);
    }
 
    CNode* Node = (CNode*)Block->GetData();
    Node += (m_BlockSize - 1);
    for (int i = m_BlockSize - 1; i >= 0; i--)
    {
        Node->m_Next = m_FreeNode;
        m_FreeNode = Node;
        Node--;
    }
 
    return m_FreeNode;
}

◆ GetHeadPosition()

template<typename E , class ETraits >

POSITION ATL::CAtlList< E, ETraits >::GetHeadPosition

inline

Definition at line 554 of file atlcoll.h.

{
    return (POSITION)m_HeadNode;
}

Referenced by DownloadListOfApplications(), CAppDB::FindAvailableByPackageName(), CFontCache::Insert(), LoadAllSettings(), CFontCache::Read(), SaveAllSettings(), test_BasicCases(), and to_str().

◆ GetNext() [1/2]

template<typename E , class ETraits >

E & ATL::CAtlList< E, ETraits >::GetNext ( _Inout_ POSITION & pos )

inline

Definition at line 566 of file atlcoll.h.

{
    CNode* Node = (CNode*)pos;
    pos = (POSITION)Node->m_Next;
    return Node->m_Element;
}

Referenced by DownloadListOfApplications(), CAppDB::FindAvailableByPackageName(), CFontCache::Insert(), LoadAllSettings(), CFontCache::Read(), SaveAllSettings(), test_BasicCases(), and to_str().

◆ GetNext() [2/2]

template<typename E , class ETraits >

const E & ATL::CAtlList< E, ETraits >::GetNext ( _Inout_ POSITION & pos ) const

inline

Definition at line 574 of file atlcoll.h.

{
    CNode* Node = (CNode*)pos;
    pos = (POSITION)Node->m_Next;
    return Node->m_Element;
}

◆ GetPrev() [1/2]

template<typename E , class ETraits >

E & ATL::CAtlList< E, ETraits >::GetPrev ( _Inout_ POSITION & pos )

inline

Definition at line 582 of file atlcoll.h.

{
    CNode* Node = (CNode*)pos;
    pos = (POSITION)Node->m_Prev;
    return Node->m_Element;
}

◆ GetPrev() [2/2]

template<typename E , class ETraits >

const E & ATL::CAtlList< E, ETraits >::GetPrev ( _Inout_ POSITION & pos ) const

inline

Definition at line 590 of file atlcoll.h.

{
    CNode* Node = (CNode*)pos;
    pos = (POSITION)Node->m_Prev;
    return Node->m_Element;
}

◆ GetTailPosition()

template<typename E , class ETraits >

POSITION ATL::CAtlList< E, ETraits >::GetTailPosition

inline

Definition at line 560 of file atlcoll.h.

{
    return (POSITION)m_TailNode;
}

◆ InsertAfter()

template<typename E , class ETraits = CElementTraits<E>>

POSITION ATL::CAtlList< E, ETraits >::InsertAfter	(	_In_ POSITION	pos,
		INARGTYPE	element
	)

Definition at line 726 of file atlcoll.h.

{
    if (pos == NULL)
        return AddTail(element);
 
    CNode* OldNode = (CNode*)pos;
    CNode* Node = CreateNode(element, OldNode, OldNode->m_Next);
 
    if (OldNode->m_Next != NULL)
    {
        OldNode->m_Next->m_Prev = Node;
    }
    else
    {
        m_TailNode = Node;
    }
    OldNode->m_Next = Node;
 
    return (POSITION)Node;
}

Referenced by test_BasicCases().

◆ InsertBefore()

template<typename E , class ETraits = CElementTraits<E>>

POSITION ATL::CAtlList< E, ETraits >::InsertBefore	(	_In_ POSITION	pos,
		INARGTYPE	element
	)

Definition at line 704 of file atlcoll.h.

{
    if (pos == NULL)
        return AddHead(element);
 
    CNode* OldNode = (CNode*)pos;
    CNode* Node = CreateNode(element, OldNode->m_Prev, OldNode);
 
    if (OldNode->m_Prev != NULL)
    {
        OldNode->m_Prev->m_Next = Node;
    }
    else
    {
        m_HeadNode = Node;
    }
    OldNode->m_Prev = Node;
 
    return (POSITION)Node;
}

Referenced by CFontCache::Insert(), and test_BasicCases().

◆ IsEmpty()

template<typename E , class ETraits >

bool ATL::CAtlList< E, ETraits >::IsEmpty

inline

Definition at line 548 of file atlcoll.h.

{
    return (m_NumElements == 0);
}

Referenced by DownloadListOfApplications(), and CMainWindow::OnCommand().

◆ operator=()

template<typename E , class ETraits = CElementTraits<E>>

CAtlList & ATL::CAtlList< E, ETraits >::operator= ( _In_ const CAtlList< E, ETraits > & )

private

◆ RemoveAll()

template<typename E , class ETraits >

void ATL::CAtlList< E, ETraits >::RemoveAll

Definition at line 748 of file atlcoll.h.

{
    while (m_NumElements > 0)
    {
        CNode* Node = m_HeadNode;
        m_HeadNode = m_HeadNode->m_Next;
        FreeNode(Node);
    }
 
    m_HeadNode = NULL;
    m_TailNode = NULL;
    m_FreeNode = NULL;
 
    if (m_Blocks)
    {
        m_Blocks->Destroy();
        m_Blocks = NULL;
    }
}

Referenced by CMainWindow::OnCommand(), CZipEnumerator::reset(), and CMainWindow::UpdateApplicationsList().

◆ RemoveAt()

template<typename E , class ETraits >

void ATL::CAtlList< E, ETraits >::RemoveAt ( _In_ POSITION pos )

Definition at line 769 of file atlcoll.h.

{
    ATLASSERT(pos != NULL);
 
    CNode* OldNode = (CNode*)pos;
    if (OldNode == m_HeadNode)
    {
        m_HeadNode = OldNode->m_Next;
    }
    else
    {
        OldNode->m_Prev->m_Next = OldNode->m_Next;
    }
    if (OldNode == m_TailNode)
    {
        m_TailNode = OldNode->m_Prev;
    }
    else
    {
        OldNode->m_Next->m_Prev = OldNode->m_Prev;
    }
    FreeNode(OldNode);
}

Referenced by CMainWindow::ItemCheckStateChanged().

◆ RemoveHead()

template<typename E , class ETraits >

E ATL::CAtlList< E, ETraits >::RemoveHead

Definition at line 664 of file atlcoll.h.

{
    CNode* Node = m_HeadNode;
    E Element(Node->m_Element);
 
    m_HeadNode = Node->m_Next;
    if (m_HeadNode)
    {
        m_HeadNode->m_Prev = NULL;
    }
    else
    {
        m_TailNode = NULL;
    }
    FreeNode(Node);
 
    return Element;
}

◆ RemoveTail()

template<typename E , class ETraits >

E ATL::CAtlList< E, ETraits >::RemoveTail

Definition at line 684 of file atlcoll.h.

{
    CNode* Node = m_TailNode;
    E Element(Node->m_Element);
 
    m_TailNode = Node->m_Prev;
    if (m_TailNode)
    {
        m_TailNode->m_Next = NULL;
    }
    else
    {
        m_HeadNode = NULL;
    }
    FreeNode(Node);
 
    return Element;
}

◆ SwapElements()

template<typename E , class ETraits >

void ATL::CAtlList< E, ETraits >::SwapElements	(	POSITION	pos1,
		POSITION	pos2
	)

Definition at line 836 of file atlcoll.h.

{
    if (pos1 == pos2)
        return;
 
 
    CNode *node1 = (CNode *)pos1;
    CNode *node2 = (CNode *)pos2;
 
    CNode *tmp = node1->m_Prev;
    node1->m_Prev = node2->m_Prev;
    node2->m_Prev = tmp;
 
    if (node1->m_Prev)
        node1->m_Prev->m_Next = node1;
    else
        m_HeadNode = node1;
 
    if (node2->m_Prev)
        node2->m_Prev->m_Next = node2;
    else
        m_HeadNode = node2;
 
    tmp = node1->m_Next;
    node1->m_Next = node2->m_Next;
    node2->m_Next = tmp;
 
    if (node1->m_Next)
        node1->m_Next->m_Prev = node1;
    else
        m_TailNode = node1;
 
    if (node2->m_Next)
        node2->m_Next->m_Prev = node2;
    else
        m_TailNode = node2;
}

Member Data Documentation

◆ m_Blocks

template<typename E , class ETraits = CElementTraits<E>>

CAtlPlex* ATL::CAtlList< E, ETraits >::m_Blocks

private

Definition at line 450 of file atlcoll.h.

◆ m_BlockSize

template<typename E , class ETraits = CElementTraits<E>>

UINT ATL::CAtlList< E, ETraits >::m_BlockSize

private

Definition at line 451 of file atlcoll.h.

◆ m_FreeNode

template<typename E , class ETraits = CElementTraits<E>>

CNode* ATL::CAtlList< E, ETraits >::m_FreeNode

private

Definition at line 454 of file atlcoll.h.

◆ m_HeadNode

template<typename E , class ETraits = CElementTraits<E>>

CNode* ATL::CAtlList< E, ETraits >::m_HeadNode

private

Definition at line 452 of file atlcoll.h.

◆ m_NumElements

template<typename E , class ETraits = CElementTraits<E>>

size_t ATL::CAtlList< E, ETraits >::m_NumElements

private

Definition at line 455 of file atlcoll.h.

◆ m_TailNode

template<typename E , class ETraits = CElementTraits<E>>

CNode* ATL::CAtlList< E, ETraits >::m_TailNode

private

Definition at line 453 of file atlcoll.h.

The documentation for this class was generated from the following file:

sdk/lib/atl/atlcoll.h

Classes

Public Member Functions

Private Types

Private Member Functions

Private Attributes

Detailed Description

Member Typedef Documentation

◆ INARGTYPE

Constructor & Destructor Documentation

◆ CAtlList() [1/2]

◆ CAtlList() [2/2]

◆ ~CAtlList()

Member Function Documentation

◆ AddHead()

◆ AddHeadList()

◆ AddTail()

◆ AddTailList()

◆ CreateNode()

◆ Find()

◆ FindIndex()

◆ FreeNode()

◆ GetAt() [1/2]

◆ GetAt() [2/2]

◆ GetCount()

◆ GetFreeNode()

◆ GetHeadPosition()

◆ GetNext() [1/2]

◆ GetNext() [2/2]

◆ GetPrev() [1/2]

◆ GetPrev() [2/2]

◆ GetTailPosition()

◆ InsertAfter()

◆ InsertBefore()

◆ IsEmpty()

◆ operator=()

◆ RemoveAll()

◆ RemoveAt()

◆ RemoveHead()

◆ RemoveTail()

◆ SwapElements()

Member Data Documentation

◆ m_Blocks

◆ m_BlockSize

◆ m_FreeNode

◆ m_HeadNode

◆ m_NumElements

◆ m_TailNode