ARRAY_T Class Reference

#include <__ARRAY.h>

Inheritance diagram for ARRAY_T:

Classes
struct	Buffer

Public Types
typedef const ELEMENT_T *	ConstIterator
typedef ELEMENT_T *	Iterator

Public Member Functions
virtual	~ARRAY_T ()
	ARRAY_T (size_t _size=0)
	ARRAY_T (const ARRAY_T &_src)
const ARRAY_T &	operator= (const ARRAY_T &_src)
ConstIterator	begin () const
ConstIterator	end () const
Iterator	begin ()
Iterator	end ()
void	clear ()
void	shrink ()
void	resize (size_t _size)
Iterator	insert (Iterator _pos, CONST_ELEMENT_REF _element)
ARRAY_T &	insert (size_t _index, CONST_ELEMENT_REF _element)
ARRAY_T &	add (CONST_ELEMENT_REF _element)
ARRAY_T &	add (const ARRAY_T &_src)
Iterator	find (CONST_ELEMENT_REF _element)
Iterator	erase (Iterator _pos)
Iterator	erase (Iterator _first, Iterator _last)
ARRAY_T &	erase (size_t _index)
ARRAY_T &	erase (size_t _index, size_t _size)
size_t	index (Iterator _pos) const
size_t	size () const
bool	isEmpty () const
ELEMENT_T &	operator[] (size_t _index)
ELEMENT_T	operator[] (size_t _index) const
ELEMENT_T *	data () const
size_t	size (ConstIterator _first, ConstIterator _last) const
size_t	size (Iterator _first, Iterator _last) 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
Buffer *	__buf () const
size_t &	__size () const
size_t &	__maxSize () const
Protected Member Functions inherited from Object
virtual	~Object ()
	Object ()

Protected Attributes
ELEMENT_T *	__pData

Detailed Description

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

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

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

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

• class DCLCAPI StringArray
• class DCLCAPI ByteStringArray
• class DCLCAPI PointerArray

See also

Array

Definition at line 54 of file __ARRAY.h.

Member Typedef Documentation

ConstIterator

typedef const ELEMENT_T* ARRAY_T::ConstIterator

Definition at line 61 of file __ARRAY.h.

Iterator

typedef ELEMENT_T* ARRAY_T::Iterator

Definition at line 62 of file __ARRAY.h.

Constructor & Destructor Documentation

~ARRAY_T()

ARRAY_T::~ARRAY_T ( )

virtual

Definition at line 121 of file __ARRAY.cpp.

{
    clear();
    free(__buf());
}

ARRAY_T() [1/2]

ARRAY_T::ARRAY_T

(

size_t

_size = 0

)

ARRAY_T() [2/2]

ARRAY_T::ARRAY_T

(

const ARRAY_T &

_src

)

Definition at line 115 of file __ARRAY.cpp.

{
    __pData = NULL;
    *this = _src;
}

Member Function Documentation

__buf()

Buffer * ARRAY_T::__buf ( ) const

inlineprotected

Definition at line 113 of file __ARRAY.h.

{ return (Buffer*) __pData - 1; }

__maxSize()

size_t & ARRAY_T::__maxSize ( ) const

inlineprotected

Definition at line 115 of file __ARRAY.h.

{ return __buf()->__maxSize; }

__size()

size_t & ARRAY_T::__size ( ) const

inlineprotected

Definition at line 114 of file __ARRAY.h.

{ return __buf()->__size; }

add() [1/2]

ARRAY_T & ARRAY_T::add

(

const ARRAY_T &

_src

)

Definition at line 254 of file __ARRAY.cpp.

{
    if (_src.size() > 0)
    {
        size_t newSize = size() + _src.size();
        if (__maxSize() < newSize)
        {
            Buffer* buf =  (Buffer*) realloc(__buf(), sizeof(Buffer) + newSize * sizeof(ELEMENT_T));
            // FIXME!
            // if (buf == NULL)
            //      throw new BadAllocException();
            __DCL_ASSERT(buf != NULL);
 
            __pData = buf->data();
        }
 
        constructElements(__pData + size(), _src.size());
        for(size_t i = 0; i < _src.size(); i++)
            __pData[size() + i] = _src.__pData[i];
 
        __maxSize() = __size() = newSize;
    }
    return *this;
}

add() [2/2]

ARRAY_T & ARRAY_T::add ( CONST_ELEMENT_REF _element )

inline

Definition at line 155 of file __ARRAY.h.

{
    return insert(size(), _element);
}

begin() [1/2]

ARRAY_T::Iterator ARRAY_T::begin ( )

inline

Definition at line 141 of file __ARRAY.h.

{
    return __pData;
}

begin() [2/2]

ARRAY_T::ConstIterator ARRAY_T::begin ( ) const

inline

Definition at line 127 of file __ARRAY.h.

{
    return (const ELEMENT_T*) __pData;
}

clear()

void ARRAY_T::clear

(

)

Definition at line 141 of file __ARRAY.cpp.

{
    if (size() > 0)
    {
        destructElements(__pData, size());
        __size() = 0;
    }
}

data()

ELEMENT_T * ARRAY_T::data ( ) const

inline

Definition at line 233 of file __ARRAY.h.

{
    return __pData;
}

end() [1/2]

ARRAY_T::Iterator ARRAY_T::end ( )

inline

Definition at line 148 of file __ARRAY.h.

{
    return __pData + size();
}

end() [2/2]

ARRAY_T::ConstIterator ARRAY_T::end ( ) const

inline

Definition at line 134 of file __ARRAY.h.

{
    return (const ELEMENT_T*) __pData + size();
}

erase() [1/4]

ARRAY_T::Iterator ARRAY_T::erase ( Iterator _first, Iterator _last )

inline

Definition at line 177 of file __ARRAY.h.

{
    __DCL_ASSERT_PARAM(begin() <= _first);
    __DCL_ASSERT_PARAM(_last <= end());
    erase(_first - begin(), _last - _first);
    return _first;
}

erase() [2/4]

ARRAY_T::Iterator ARRAY_T::erase ( Iterator _pos )

inline

Definition at line 162 of file __ARRAY.h.

{
    __DCL_ASSERT_PARAM(begin() <= _pos);
    __DCL_ASSERT_PARAM(_pos < end());
#if 0
    erase(_pos - begin(), 1);
    return _pos;
#endif
    size_t index = _pos - begin();
    erase(index, 1);
    return __pData + index;
}

erase() [3/4]

ARRAY_T & ARRAY_T::erase ( size_t _index )

inline

Definition at line 187 of file __ARRAY.h.

{
    __DCL_ASSERT_PARAM(_index < size());
    return erase(_index, 1);
}

erase() [4/4]

ARRAY_T & ARRAY_T::erase	(	size_t	_index,
		size_t	_size )

Definition at line 292 of file __ARRAY.cpp.

{
    __DCL_ASSERT_PARAM(_index + _size <= size());
    if (_size > 0)
    {
        destructElements(__pData + _index, _size);
        if (_index + _size < size())
            memmove((void*)(__pData + _index), (const void*)(__pData + _index + _size),
                 (size() -  (_index  + _size)) * sizeof(ELEMENT_T));
        __size() -= _size;
    }
    return *this;
}

find()

ARRAY_T::Iterator ARRAY_T::find

(

CONST_ELEMENT_REF

_element

)

Definition at line 280 of file __ARRAY.cpp.

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

index()

size_t ARRAY_T::index ( Iterator _pos ) const

inline

Definition at line 195 of file __ARRAY.h.

{
    __DCL_ASSERT_PARAM(__pData <= _pos);
    return _pos - __pData;
}

insert() [1/2]

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

Definition at line 214 of file __ARRAY.cpp.

{
    __DCL_ASSERT_PARAM(begin() <= _pos);
    __DCL_ASSERT_PARAM(_pos <= end());
 
    size_t index = _pos - __pData;
    insert(index, _element);
    return __pData + index + 1;
}

insert() [2/2]

ARRAY_T & ARRAY_T::insert	(	size_t	_index,
		CONST_ELEMENT_REF	_element )

Definition at line 225 of file __ARRAY.cpp.

{
    __DCL_ASSERT_HANDLE(__pData != NULL);
    __DCL_ASSERT_PARAM(_index <= size());
 
    size_t newSize = size() + 1;
    if (__maxSize() < newSize)
    {
        Buffer* buf =  (Buffer*) realloc(__buf(), sizeof(Buffer) + newSize * sizeof(ELEMENT_T)); 
        // FIXME!
        // if (buf == NULL)
        //      throw new BadAllocException();
        __DCL_ASSERT(buf != NULL);
 
        buf->__maxSize = newSize;
        __pData = buf->data();
 
        if (_index < buf->__size)
            memmove((void*)(__pData + _index + 1), (const void*)(__pData + _index),
                sizeof(ELEMENT_T) * (buf->__size - _index));
    }
 
    constructElements(__pData + _index, 1);
    __size() = newSize;
    __pData[_index] = (ELEMENT_T) _element;
    return *this;
}

isEmpty()

bool ARRAY_T::isEmpty ( ) const

inline

Definition at line 210 of file __ARRAY.h.

{
    return size() == 0;
}

operator=()

const ARRAY_T & ARRAY_T::operator=

(

const ARRAY_T &

_src

)

Definition at line 129 of file __ARRAY.cpp.

{
    if (&_src != this)
    {
        resize(_src.size());
        for(size_t i = 0; i < _src.size(); i++)
            __pData[i] = _src.__pData[i];
    }
    return *this;
}

operator[]() [1/2]

ELEMENT_T & ARRAY_T::operator[] ( size_t _index )

inline

Definition at line 217 of file __ARRAY.h.

{
    __DCL_ASSERT_PARAM(_index < size());
    return __pData[_index];
}

operator[]() [2/2]

ELEMENT_T ARRAY_T::operator[] ( size_t _index ) const

inline

Definition at line 225 of file __ARRAY.h.

{
    __DCL_ASSERT_PARAM(_index < size());
    return __pData[_index];
}

resize()

void ARRAY_T::resize

(

size_t

_size

)

Definition at line 167 of file __ARRAY.cpp.

{
    if (__pData != NULL)
    {
        if (size() == _size)
            return;
 
        if (size() > _size)
        {
            destructElements(__pData + _size, size() - _size);
            __size() = _size;
            return;
        }
    }
 
    if (__pData == NULL || __maxSize() < _size)
    {
        Buffer* buf = NULL;
        if (__pData == NULL)
        {
            buf = (Buffer*) malloc(sizeof(Buffer) + _size * sizeof(ELEMENT_T));
            // FIXME!
            // if (buf == NULL)
            //      throw new BadAllocException();
            __DCL_ASSERT(buf != NULL);
 
            buf->__size = 0;
        }
        else
        {
            buf = (Buffer*) realloc(__buf(), sizeof(Buffer) + _size * sizeof(ELEMENT_T));
            // FIXME!
            // if (buf == NULL)
            //      throw new BadAllocException();
            __DCL_ASSERT(buf != NULL);
        }
 
        buf->__maxSize = _size;
        __pData = buf->data();
        memset((void*)(__pData + buf->__size), 0, (_size - buf->__size) * sizeof(ELEMENT_T));
    }
 
    constructElements(__pData + size(), _size - size());
    __size() = _size;
}

shrink()

void ARRAY_T::shrink

(

)

Definition at line 151 of file __ARRAY.cpp.

{
    if (size() <__maxSize())
    {
        Buffer* buf = (Buffer*) realloc(__buf(), sizeof(Buffer) + size() * sizeof(ELEMENT_T));
        // FIXME!
        // if (buf == NULL)
        //      throw new BadAllocException();
        __DCL_ASSERT(buf != NULL);
 
        buf->__maxSize = buf->__size;
        __pData = buf->data();
    }
}

size() [1/3]

size_t ARRAY_T::size ( ) const

inline

Definition at line 203 of file __ARRAY.h.

{
    return __buf()->__size;;
}

size() [2/3]

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

inline

Definition at line 240 of file __ARRAY.h.

{
    __DCL_ASSERT_PARAM(_first <= _last);
    return _last - _first;
}

size() [3/3]

size_t ARRAY_T::size ( Iterator _first, Iterator _last ) const

inline

Definition at line 248 of file __ARRAY.h.

{
    __DCL_ASSERT_PARAM(_first <= _last);
    return _last - _first;
}

Member Data Documentation

__pData

ELEMENT_T* ARRAY_T::__pData

protected

Definition at line 104 of file __ARRAY.h.

---

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

• __ARRAY.h
• __ARRAY.cpp