mirror of
https://github.com/KolibriOS/kolibrios.git
synced 2024-12-23 23:26:49 +03:00
c2fbdf929c
git-svn-id: svn://kolibrios.org@1805 a494cfbc-eb01-0410-851d-a64ba20cac60
182 lines
3.0 KiB
C++
182 lines
3.0 KiB
C++
#define AR_CHUNK_SIZE 64
|
|
|
|
//
|
|
template<class TYPE>
|
|
class MCArray
|
|
{
|
|
protected:
|
|
TYPE * _dataPtr;
|
|
int _elementsCount;
|
|
int _capacity;
|
|
|
|
public:
|
|
MCArray();
|
|
virtual ~MCArray();
|
|
virtual int Add( const TYPE &element );
|
|
virtual int AddExclusive( const TYPE &element );
|
|
virtual TYPE & GetAt( int Ndx );
|
|
virtual TYPE & operator [] ( int Ndx );
|
|
virtual int Find( int startNdx, const TYPE & element );
|
|
virtual int RemoveAt( int Ndx );
|
|
virtual void Clear(void);
|
|
virtual int GetCount(void);
|
|
};
|
|
|
|
//
|
|
|
|
|
|
//
|
|
template<class TYPE>
|
|
MCArray<TYPE>::MCArray()
|
|
{
|
|
// óñòàíàâëèâàåì ïåðåìåííûå
|
|
this->_dataPtr = NULL;
|
|
this->_capacity = 0;
|
|
this->_elementsCount = 0;
|
|
}
|
|
|
|
|
|
//
|
|
template<class TYPE>
|
|
MCArray<TYPE>::~MCArray()
|
|
{
|
|
//
|
|
this->_capacity = 0;
|
|
this->_elementsCount = 0;
|
|
//
|
|
if ( this->_dataPtr != NULL )
|
|
{
|
|
delete this->_dataPtr;
|
|
}
|
|
}
|
|
|
|
|
|
//
|
|
template<class TYPE>
|
|
int MCArray<TYPE>::AddExclusive( const TYPE &element )
|
|
{
|
|
//
|
|
if ( this->Find( 0, element ) < 0 )
|
|
return this->Add( element );
|
|
else
|
|
return -1;
|
|
}
|
|
|
|
|
|
//
|
|
template<class TYPE>
|
|
int MCArray<TYPE>::Add( const TYPE &element )
|
|
{
|
|
TYPE * dPtr;
|
|
|
|
// åñòü ëè ìåñòî?
|
|
if ( this->_elementsCount >= this->_capacity )
|
|
{
|
|
// çàíèìàåì åù¸ ïàìÿòè
|
|
dPtr = new TYPE [this->_capacity + AR_CHUNK_SIZE];
|
|
// ïðîâåðêà
|
|
if ( dPtr == NULL )
|
|
{
|
|
//
|
|
return -1;
|
|
}
|
|
|
|
if ( this->_capacity > 0 )
|
|
{
|
|
// ñêîïèðóåì ñóùåñòâóþùèå äàííûå íà íîâîå ìåñòî
|
|
memcpy( dPtr, this->_dataPtr, sizeof(TYPE) * this->_capacity );
|
|
// óäàëèì ñòàðóþ êîïèþ äàííûõ
|
|
delete this->_dataPtr;
|
|
}
|
|
// ñêîððåêòèðóåì ðàçìåð
|
|
this->_capacity += AR_CHUNK_SIZE;
|
|
// ñêîððåêòèðóåì óêàçàòåëü íà äàííûå
|
|
this->_dataPtr = dPtr;
|
|
}
|
|
|
|
// êîïèðóåì ýëåìåíò â ìàññèâ
|
|
this->_dataPtr[this->_elementsCount] = element;
|
|
//memcpy( this->_dataPtr + this->_elementsCount, &element, sizeof(TYPE) );
|
|
|
|
// óâåëè÷èâàåì ñ÷¸ò÷èê ýëåìåíòîâ
|
|
return ++this->_elementsCount;
|
|
}
|
|
|
|
|
|
//
|
|
template<class TYPE>
|
|
TYPE & MCArray<TYPE>::GetAt( int Ndx )
|
|
{
|
|
//assert( Ndx >= 0 && Ndx < this->_elementsCount );
|
|
return this->_dataPtr[Ndx];
|
|
}
|
|
|
|
|
|
//
|
|
template<class TYPE>
|
|
TYPE & MCArray<TYPE>::operator [] ( int Ndx )
|
|
{
|
|
return this->GetAt( Ndx );
|
|
}
|
|
|
|
|
|
//
|
|
template<class TYPE>
|
|
int MCArray<TYPE>::Find( int startNdx, const TYPE & element )
|
|
{
|
|
int i;
|
|
|
|
if ( startNdx < 0 || startNdx >= this->_elementsCount )
|
|
{
|
|
return -1;
|
|
}
|
|
|
|
for ( i = startNdx; i < this->_elementsCount; i++ )
|
|
{
|
|
if ( element == this->_dataPtr[i] )
|
|
{
|
|
return i;
|
|
}
|
|
}
|
|
|
|
return -1;
|
|
}
|
|
|
|
|
|
//
|
|
template<class TYPE>
|
|
int MCArray<TYPE>::RemoveAt( int Ndx )
|
|
{
|
|
int mn;
|
|
|
|
if ( Ndx < 0 || Ndx >= this->_elementsCount )
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
mn = this->_elementsCount - Ndx;
|
|
|
|
if ( mn != 1 )
|
|
{
|
|
memcpy( this->_dataPtr + Ndx, this->_dataPtr + Ndx + 1, sizeof(TYPE) * ( mn - 1 ) );
|
|
}
|
|
|
|
this->_elementsCount--;
|
|
return 1;
|
|
}
|
|
|
|
|
|
//
|
|
template<class TYPE>
|
|
void MCArray<TYPE>::Clear()
|
|
{
|
|
this->_elementsCount = 0;
|
|
}
|
|
|
|
//
|
|
template<class TYPE>
|
|
int MCArray<TYPE>::GetCount()
|
|
{
|
|
return this->_elementsCount;
|
|
}
|