Vector的简单C++实现

最新推荐文章于 2024-06-16 21:44:51 发布

joejames

最新推荐文章于 2024-06-16 21:44:51 发布

阅读量656

点赞数

CC 4.0 BY-SA版权

分类专栏：数据结构算法分析文章标签： vector iterator

本文链接：https://blog.youkuaiyun.com/joejames/article/details/35848429

数据结构算法分析专栏收录该内容

8 篇文章

订阅专栏

本文介绍了一个使用模板元编程实现的Vector类，该类支持动态数组的基本操作，如构造、赋值、扩容、访问元素等，并通过模板泛型支持多种数据类型。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

template <typename Object>
class Vector
{
public:
explicit Vector(int initSize=0)
:theSize( initSize ),theCapacity( initSize + SPARE_CAPACITY)
{objects = new Object[theCapacity];}

Vector(const Vector & rhs): objects(NULL)
{ operator= (rhs);}

~Vector(void)
{delete[] objects;}

const Vector &operator= (const Vector & rhs)
{
if(this != &rhs)
{
delete[]objects;
theSize = rhs.size();
theCapacity = rhs.theCapacity;

objects = new Object[capacity()];
for(int k=0;k<size();k++)
objects[k] = rhs.objects[k];
}
return *this;
}

void resize(int newSize)
{
if(newSize > theCapacity)
{
reserve(newSize*2+1);
theSize = newSize;
}
}

void reserve(int newCapacity)
{
if(newCapacity < theSize)
return;

Object *oldArray = objects;

objects = new Object[newCapacity];
for(int k=0;k<theSize;k++)
objects[k] = oldArray[k];

theCapacity = newCapacity;

delete [] oldArray;
}

Object & operator[](int index)
{ return objects[index];}
const Object & operator[](int index) const
{ return objects[index];}

bool empty() const
{ return size() == 0;}
int size() const
{ return theSize;}
int capacity() const
{ return theCapacity;}

void push_back( const Object & x)
{
if(theSize == theCapacity)
reserve(2*theCapacity + 1);
objects[theSize++] = x;
}

void pop_back()
{ theSize--;}

const Object & back() const
{ return objects[theSize - 1];}

typedef Object * iterator;
typedef const Object * const_iterator;

iterator begin()
{ return &objects[0];}
const_iterator begin() const
{ return &objects[0];}
iterator end()
{ return &objects[size()];}
const_iterator end() const
{ return &objects[size()];}

enum{SPARE_CAPACITY = 16};

private:
int theSize;
int theCapacity;
Object * objects;
};