Vector.h

Go to the documentation of this file.

/*
 * Copyright (C) 2015 Niek Linnenbank
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 
#ifndef __LIBSTD_VECTOR_H
#define __LIBSTD_VECTOR_H
 
#include "Assert.h"
#include "Sequence.h"
#include "Types.h"
#include "Macros.h"
#include "MemoryBlock.h"
 
#define VECTOR_DEFAULT_SIZE  64
 
template <class T> class Vector : public Sequence<T>
{
  public:
 
    Vector(Size size = VECTOR_DEFAULT_SIZE)
    {
        assert(size > 0);
 
        m_size  = size;
        m_count = 0;
        m_array = new T[m_size];
    }
 
    Vector(const Vector<T> & a)
    {
        assert(a.m_size > 0);
 
        m_size  = a.m_size;
        m_count = a.m_count;
        m_array = new T[m_size];
 
        for (Size i = 0; i < m_size; i++)
            m_array[i] = a.m_array[i];
    }
 
    virtual ~Vector()
    {
        delete[] m_array;
    }
 
    virtual int insert(const T & item)
    {
        if (m_count == m_size)
            if (!resize(m_size*2))
                return -1;
 
        m_array[m_count++] = item;
        return m_count-1;
    }
 
    virtual bool insert(Size position, const T & item)
    {
        // Resize the vector if needed
        if (position >= m_size)
        {
            Size increase = position > (m_size * 2) ? position : m_size * 2;
 
            if (!resize(m_size+increase))
                return false;
        }
        // Update the item count if needed
        if (position >= m_count)
            m_count += (position+1) - m_count;
 
        // Assign the item
        m_array[position] = item;
        return true;
    }
 
    virtual const T * get(Size position) const
    {
        if (position >= m_count)
        {
            return ZERO;
        }
        return &m_array[position];
    }
 
    virtual const T & at(Size position) const
    {
        return m_array[position];
    }
 
    virtual void clear()
    {
        m_count = 0;
    }
 
    virtual bool removeAt(Size position)
    {
        if (position >= m_count)
        {
            return false;
        }
 
        // Move all consequetive items
        for (Size i = position; i < m_count-1; i++)
        {
            m_array[i] = m_array[i+1];
        }
        m_count--;
        return true;
    }
 
    virtual Size size() const
    {
        return m_size;
    }
 
    virtual Size count() const
    {
        return m_count;
    }
 
    virtual const T * vector() const
    {
        return m_array;
    }
 
    virtual bool resize(Size size)
    {
        assert(size > 0);
 
        T *arr = new T[size];
        if (!arr)
            return false;
 
        // Copy the old array in the new one
        for (Size i = 0; i < m_size; i++)
        {
            arr[i] = m_array[i];
        }
        // Clean up the old array and set the new one
        delete[] m_array;
        m_array = arr;
        m_size  = size;
        return true;
    }
 
  private:
 
    T* m_array;
 
    Size m_size;
 
    Size m_count;
};
 
#endif /* __LIBSTD_VECTOR_H */