Complex_Vector_H

复数向量类实现

最新推荐文章于 2024-03-09 21:35:56 发布

Jupiter®

最新推荐文章于 2024-03-09 21:35:56 发布

阅读量289

点赞数

CC 4.0 BY-SA版权

分类专栏： Complex Number

本文链接：https://blog.youkuaiyun.com/weixin_43998753/article/details/85221500

Complex Number 专栏收录该内容

3 篇文章

订阅专栏

本文介绍了一个复数向量类的实现，该类继承自复数类，提供了向量的基本操作，如元素访问、向量容量和大小的查询、向量是否为空的判断、向量元素的添加和删除等。同时，还实现了向量的加法运算符重载和输出流友元函数。

#ifndef Complex_Vector_H
#define Complex_Vector_H
#include "Complex_Number.h"
#include <iostream>
#include <string>

class ComplexVector:public ComplexNumber
{
private:
	ComplexNumber* p;
	int length;
	int size;
public:
	ComplexVector();
	ComplexVector(int setlength);
	~ComplexVector();
	ComplexNumber& operator[](int index){return p[index];}
	
	int capacity_c(){return length - size;}
	int size_c(){return size;}
	bool isempty();
	void push_back(ComplexNumber C);
	void pop_back();
	void operator+=(ComplexNumber C);
	friend ostream &operator<<(ostream& output,const ComplexVector& V)
	{
		for(int i = 0;i < V.size;i++)output << V.p[i];
	}
};

ComplexVector::ComplexVector()
{
	p = NULL;
	length = 0;
	size = 0;
}

ComplexVector::ComplexVector(int setlength)
{
	p = new ComplexNumber[setlength];
	length = setlength;
	size = 0;
}

ComplexVector::~ComplexVector()
{
	delete[] p;
}

bool ComplexVector::isempty()
{
	if(size == 0)return true;
	else return false;
}

void ComplexVector::push_back(ComplexNumber C)
{
	if(capacity_c() == 0)
	{
		ComplexNumber* ptemp = new ComplexNumber[2*size + 1];
		length = 2*size + 1;
		for(int i=0;i<size;i++)
		{
			ptemp[i] = p[i];
		}
		delete[] p;
		p = ptemp;
		ptemp = NULL;
	}
	p[size] = C;
	size++;
}

void ComplexVector::operator+=(ComplexNumber C)
{
	if(capacity_c() == 0)
	{
		ComplexNumber* ptemp = new ComplexNumber[2*size + 1];
		length = 2*size + 1;
		for(int i=0;i<size;i++)
		{
			ptemp[i] = p[i];
		}
		delete[] p;
		p = ptemp;
		ptemp = NULL;
	}
	p[size] = C;
	size++;
}

void ComplexVector::pop_back()
{
	size--;
}


#endif