neurosky/header/Array.inl

Go to the documentation of this file.

/*****************************************************************************************************************************************************
                                                                                                              Define the array Template For the use of array 
***********************************************************************************************************************************************************/



// Constructor of an Array 
 
template<class T> Array<T>::Array() : mMaxNbEntries(0), mCurNbEntries(0), mEntries(NULL)
{
}

// Destructor of an Array

template<class T> Array<T>::~Array()
{
        DELETEARRAY(mEntries);
}

// Function for the resize of an Array

template<class T> bool Array<T>::Resize()
{

        mMaxNbEntries = mMaxNbEntries ? (mMaxNbEntries<<1) : 2; // Default nb Entries = 2

        // Get some bytes for new entries
        T*      NewEntries = new T[mMaxNbEntries];
        CHECKALLOC(NewEntries);

        // Copy old data if needed
        if(mCurNbEntries)               //CopyMemory(NewEntries, mEntries, mCurNbEntries*sizeof(T));
        {
                for(int k=0; k<mCurNbEntries; k++)              NewEntries[k] = mEntries[k];            
        }
        

        // Delete old data
        DELETEARRAY(mEntries);

        // Assign new pointer
        mEntries = NewEntries;

        return true;
}

// Give the contains of an Array

template<class T> bool Array<T>::Contains(T entry, int* location) const
{
        // Look for the entry
        for(int i=0;i<mCurNbEntries;i++)
        {
                if(mEntries[i]==entry)
                {
                        if(location)    *location = i;
                        return true;
                }
        }
        return false;
}

// Delete an Array

template<class T> bool Array<T>::Delete(T entry)
{
        // Look for the entry
        for(int i=0;i<mCurNbEntries;i++)
        {
                if(mEntries[i]==entry)
                {
                        // Entry has been found at index i. The strategy is to copy the last current entry at index i, and decrement the current number of entries.
                        mEntries[i] = mEntries[--mCurNbEntries];
                        return true;
                }
        }
        return false;
}

// Get The ram used for the Array

template<class T> int Array<T>::GetUsedRam() const
{
        return sizeof(Array) + mMaxNbEntries * sizeof(T);
}

---