LIST_T Class Reference

#include <__LIST.h>

Inheritance diagram for LIST_T:

Classes
class	ConstIterator
class	Iterator
struct	ListNode
class	ReverseConstIterator
class	ReverseIterator

Public Member Functions
virtual	~LIST_T ()
	LIST_T ()
	LIST_T (const LIST_T &_src)
const LIST_T &	operator= (const LIST_T &_src)
ConstIterator	begin () const
ConstIterator	end () const
Iterator	begin ()
Iterator	end ()
ReverseConstIterator	rbegin () const
ReverseConstIterator	rend () const
ReverseIterator	rbegin ()
ReverseIterator	rend ()
Iterator	insert (Iterator _pos, CONST_ELEMENT_REF _element)
void	insert (Iterator _pos, ConstIterator _first, ConstIterator _last)
Iterator	find (CONST_ELEMENT_REF _element)
Iterator	erase (Iterator _pos)
void	splice (Iterator _pos, LIST_T &_other, Iterator _otherFirst, Iterator _otherLast)
LIST_T &	add (CONST_ELEMENT_REF _element)
LIST_T &	addHead (CONST_ELEMENT_REF _element)
LIST_T &	addTail (CONST_ELEMENT_REF _element)
ELEMENT_T	removeHead ()
ELEMENT_T	removeTail ()
void	clear ()
bool	isEmpty () const
size_t	size () const
Public Member Functions inherited from Object
virtual String	toString () const
virtual void	destroy ()
String	className () const
bool	isInstanceOf (const std::type_info &typeinfo) const
virtual const std::type_info &	typeInfo () const

Protected Member Functions
size_t	size (ConstIterator _first, ConstIterator _last) const
void	move (Iterator posTo, Iterator _first, Iterator _last)
ListNode *	createNode (CONST_ELEMENT_REF _element)
void	destroyNode (ListNode *_pNode)
Protected Member Functions inherited from Object
virtual	~Object ()
	Object ()

Protected Attributes
NodeBase *	__pMasterNode
size_t	__size

Detailed Description

template class List의 DSO 호환성을 제공한다.

C++의 template class는 해당 코드를 사용하기 전에는 실제 이진 코드를 생성하지 않으므로, DSO(so, DLL)와 DSO, 또는 실행파일에서 객체를 주고받을 수 없다.

이 클래스는 DSO의 이러한 문제를 해결하며, 포함파일은 <dcl/List.h>이다.

이 코드를 사용하는 클래스는 다음과 같다.

• class DCLCAPI StringList
• class DCLCAPI ByteStringList
• class DCLCAPI PointerList

See also

List

Definition at line 51 of file __LIST.h.

Constructor & Destructor Documentation

~LIST_T()

virtual LIST_T::~LIST_T ( )

virtual

LIST_T() [1/2]

LIST_T::LIST_T

(

)

Definition at line 76 of file __LIST.cpp.

{
    __pMasterNode = (NodeBase*) malloc(sizeof(NodeBase));
    // FIXME!
    // if (pNode == NULL)
    //      throw new BadAllocException(sizeof(HashNode), __THIS_FILE__, __LINE__);
    __DCL_ASSERT(__pMasterNode != NULL);
 
    __pMasterNode->pPrev = __pMasterNode;
    __pMasterNode->pNext = __pMasterNode;
    __size = 0;
}

LIST_T() [2/2]

LIST_T::LIST_T

(

const LIST_T &

_src

)

Definition at line 89 of file __LIST.cpp.

{
    __pMasterNode = (NodeBase*) malloc(sizeof(NodeBase));
    // FIXME!
    // if (pNode == NULL)
    //      throw new BadAllocException(sizeof(HashNode), __THIS_FILE__, __LINE__);
    __DCL_ASSERT(__pMasterNode != NULL);
 
    __pMasterNode->pPrev = __pMasterNode;
    __pMasterNode->pNext = __pMasterNode;
    __size = 0;
 
    insert(end(), _src.begin(), _src.end());
}

Member Function Documentation

add()

LIST_T & LIST_T::add ( CONST_ELEMENT_REF _element )

inline

Definition at line 592 of file __LIST.h.

{
    insert(end(), _element);
    return *this;
}

addHead()

LIST_T & LIST_T::addHead ( CONST_ELEMENT_REF _element )

inline

Definition at line 576 of file __LIST.h.

{
    insert(begin(), _element);
    return *this;
}

addTail()

LIST_T & LIST_T::addTail ( CONST_ELEMENT_REF _element )

inline

Definition at line 584 of file __LIST.h.

{
    insert(end(), _element);
    return *this;
}

begin() [1/2]

LIST_T::Iterator LIST_T::begin ( )

inline

Definition at line 520 of file __LIST.h.

{
    return __pMasterNode->pNext;
}

begin() [2/2]

LIST_T::ConstIterator LIST_T::begin ( ) const

inline

Definition at line 506 of file __LIST.h.

{
    return __pMasterNode->pNext;
}

clear()

void LIST_T::clear

(

)

Definition at line 185 of file __LIST.cpp.

{
    ListNode* pNodeTemp = NULL;
    NodeBase* pNode = __pMasterNode->pNext;
    while(pNode != __pMasterNode)
    {
        pNodeTemp = (ListNode*)pNode;
        pNode = pNode->pNext;
        destroyNode(pNodeTemp);
    }
    __pMasterNode->pNext = __pMasterNode;
    __pMasterNode->pPrev = __pMasterNode;
    __size = 0;
}

createNode()

LIST_T::ListNode * LIST_T::createNode ( CONST_ELEMENT_REF _element )

protected

Definition at line 117 of file __LIST.cpp.

{
    ListNode* pNode = (ListNode*) malloc(sizeof(ListNode));
    // FIXME!
    // if (pNode == NULL)
    //      throw new BadAllocException(sizeof(HashNode), __THIS_FILE__, __LINE__);
 
#if __DCL_HAVE_ALLOC_DEBUG
#undef new
#endif
 
#if HAVE_CONSTRUCTOR_ELEMENT
    new(&(pNode->data)) ELEMENT_T;
#endif
 
#if __DCL_HAVE_ALLOC_DEBUG
#define new __DCL_DEBUG_NEW
#endif
 
    pNode->data = ELEMENT_T_CAST _element;
    return pNode;
}

destroyNode()

void LIST_T::destroyNode ( ListNode * _pNode )

protected

Definition at line 141 of file __LIST.cpp.

{
#if HAVE_CONSTRUCTOR_ELEMENT
    _pNode->data.~ELEMENT_T();
#endif
    free(_pNode);
}

end() [1/2]

LIST_T::Iterator LIST_T::end ( )

inline

Definition at line 527 of file __LIST.h.

{
    return __pMasterNode;
}

end() [2/2]

LIST_T::ConstIterator LIST_T::end ( ) const

inline

Definition at line 513 of file __LIST.h.

{
    return __pMasterNode;
}

erase()

LIST_T::Iterator LIST_T::erase

(

Iterator

_pos

)

Definition at line 201 of file __LIST.cpp.

{
    __DCL_ASSERT(_pos != end());
    ListNode* pNodeTemp = (ListNode*)_pos.__pNode;
    NodeBase* pNext = pNodeTemp->pNext;
    pNodeTemp->pPrev->pNext = pNodeTemp->pNext;
    pNodeTemp->pNext->pPrev = pNodeTemp->pPrev;
    destroyNode(pNodeTemp);
    __size--;
    return (ListNode*)pNext;
}

find()

LIST_T::Iterator LIST_T::find

(

CONST_ELEMENT_REF

_element

)

Definition at line 173 of file __LIST.cpp.

{
    Iterator it = begin();
    for (; it != end(); it++)
    {
        if (*it == _element)
            break;
    }
    return it;
}

insert() [1/2]

LIST_T::Iterator LIST_T::insert	(	Iterator	_pos,
		CONST_ELEMENT_REF	_element )

Definition at line 150 of file __LIST.cpp.

{
    ListNode* pNewNode = createNode(_element);
    pNewNode->pPrev = _pos.__pNode->pPrev;
    pNewNode->pNext = _pos.__pNode;
    _pos.__pNode->pPrev->pNext = pNewNode;
    _pos.__pNode->pPrev = pNewNode;
 
    __size++;
 
    return (ListNode*)pNewNode;
}

insert() [2/2]

void LIST_T::insert	(	Iterator	_pos,
		ConstIterator	_first,
		ConstIterator	_last )

Definition at line 164 of file __LIST.cpp.

{
    for(; _first != _last; _first++)
    {
        insert(_pos, *_first);
    }
}

isEmpty()

bool LIST_T::isEmpty ( ) const

inline

Definition at line 562 of file __LIST.h.

{
    return __pMasterNode->pNext == __pMasterNode;
}

move()

void LIST_T::move ( Iterator posTo, Iterator _first, Iterator _last )

protected

Definition at line 233 of file __LIST.cpp.

{
    if (_pos != _last)
    {
        _last.__pNode->pPrev->pNext = _pos.__pNode;
        _first.__pNode->pPrev->pNext = _last.__pNode;
        _pos.__pNode->pPrev->pNext = _first.__pNode;
 
        NodeBase* pTemp = _pos.__pNode->pPrev;
        _pos.__pNode->pPrev = _last.__pNode->pPrev;
        _last.__pNode->pPrev = _first.__pNode->pPrev;
        _first.__pNode->pPrev = pTemp;
    }
}

operator=()

const LIST_T & LIST_T::operator=

(

const LIST_T &

_src

)

Definition at line 105 of file __LIST.cpp.

{
    if (&_src != this)
    {
        if (!isEmpty())
            clear();
        insert(end(), _src.begin(), _src.end());
    }
    return *this;
}

rbegin() [1/2]

LIST_T::ReverseIterator LIST_T::rbegin ( )

inline

Definition at line 548 of file __LIST.h.

{
    return __pMasterNode->pPrev;
}

rbegin() [2/2]

LIST_T::ReverseConstIterator LIST_T::rbegin ( ) const

inline

Definition at line 534 of file __LIST.h.

{
    return __pMasterNode->pPrev;
}

removeHead()

ELEMENT_T LIST_T::removeHead

(

)

Definition at line 214 of file __LIST.cpp.

{
    __DCL_ASSERT(!isEmpty());
    ELEMENT_T result = *begin();
    erase(begin());
    return result;
}

removeTail()

ELEMENT_T LIST_T::removeTail

(

)

Definition at line 223 of file __LIST.cpp.

{
    __DCL_ASSERT(!isEmpty());
    Iterator it = end();
    ELEMENT_T result = *(--it);
    erase(it);
    return result;
}

rend() [1/2]

LIST_T::ReverseIterator LIST_T::rend ( )

inline

Definition at line 555 of file __LIST.h.

{
    return __pMasterNode;
}

rend() [2/2]

LIST_T::ReverseConstIterator LIST_T::rend ( ) const

inline

Definition at line 541 of file __LIST.h.

{
    return __pMasterNode;
}

size() [1/2]

size_t LIST_T::size ( ) const

inline

Definition at line 569 of file __LIST.h.

{
    return __size;
}

size() [2/2]

size_t LIST_T::size ( ConstIterator _first, ConstIterator _last ) const

protected

Definition at line 261 of file __LIST.cpp.

{
    size_t nCount = 0;
    for(; _first != _last; _first++)
        nCount++;
    return nCount;
}

splice()

void LIST_T::splice	(	Iterator	_pos,
		LIST_T &	_other,
		Iterator	_otherFirst,
		Iterator	_otherLast )

Definition at line 249 of file __LIST.cpp.

{
    size_t nMoveCount = size((ListNode*)(_otherFirst.__pNode),
                        (ListNode*)(_otherLast.__pNode));
    __size += nMoveCount;
    _other.__size -= nMoveCount;
 
    move(_pos, _otherFirst, _otherLast);
}

Member Data Documentation

__pMasterNode

NodeBase* LIST_T::__pMasterNode

protected

Definition at line 169 of file __LIST.h.

__size

size_t LIST_T::__size

protected

Definition at line 170 of file __LIST.h.

---

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

• __LIST.h
• __LIST.cpp