C / C++ / MFC

template <class base> class vector {<br />
public:<br />
	std::vector<base> data;<br />
	friend class matrix<base>;<br />
	vector operator+(const vector &that) {			// parallelogram law<br />
		vector ret;<br />
		assert(this->data.size() == that.data.size());<br />
		ret.resize(this->data.size());<br />
		#pragma omp parallel for<br />
		for (int i = 0; i < this->data.size(); i++)<br />
			ret.data[i] = this->data[i] + that.data[i];<br />
		return ret;<br />
	}<br />
	vector operator-(vector that) {				// parallelogram law<br />
		vector ret;<br />
		assert(this->data.size() == that.data.size());<br />
		ret.resize(this->data.size());<br />
		#pragma omp parallel for<br />
		for (int i = 0; i < this->data.size(); i++)<br />
			ret.data[i] = this->data[i] - that.data[i];<br />
		return ret;<br />
	}<br />
	vector operator* (base &that) {				// scalar product<br />
		vector ret;<br />
		ret.resize(this->data.size());<br />
		#pragma omp parallel for<br />
		for (int i = 0; i < this->data.size(); i++)<br />
			ret.data[i] = this->data[i] * that;<br />
		return ret;<br />
	}<br />
	double operator* (vector &that) {			// dot / inner product<br />
		double ret;<br />
		#pragma omp parallel for<br />
		for (int i = 0; i < this->data.size(); i++) <br />
			ret += this->data[i] * that.data[i];  // sum of products of complex numbers is real<br />
		return ret;<br />
	}<br />
	vector operator/ (base &that) {				// scalar division<br />
		vector ret;<br />
		ret.resize(this->data.size());<br />
		#pragma omp parallel for<br />
		for (int i = 0; i < this->data.size(); i++)<br />
			ret.data[i] = this->data[i] / that;<br />
		return ret;<br />
	}<br />
	vector operator= (vector &that) {			// assignment operator<br />
		for (int i=0; i < that.data.size(); i++)<br />
			this->data[i] = that.data[i];<br />
		return *this;<br />
	}<br />
	base& operator[] (size_t index) {			<br />
		return this->data[index];<br />
	}<br />
	bool operator== (vector &that) {			<br />
		bool temp = true;<br />
		for (int i=0; i < that.data.size(); i++)<br />
			if (this->data[i] != that.data[i]) temp = false;<br />
		return temp;<br />
	}<br />
	// the norm is the vector length<br />
	base norm(void) {						<br />
		base result = (base)0.0;<br />
		#pragma omp parallel for<br />
		for (int i = 0; i < this->data.size(); i++) {<br />
			result += this->data[i] * this->data[i];  // sum of products of complex numbers is real<br />
		}<br />
		return sqrt(result);<br />
	}<br />
	// Bring up some of the std:vector functions<br />
	size_t size(void) {<br />
		return data.size();<br />
	}<br />
	vector resize(size_t newsize) {<br />
		data.resize(newsize);<br />
		return *this;<br />
	}<br />
	vector clear(void) {<br />
		data.clear();<br />
		return *this;<br />
	}<br />
};<br />