#include "Vector.hpp"

Vector::Vector(int length) {
  size = length;
  array = new (nothrow) int[size];
  if(array==NULL) {
    cerr << "Memory allocation failure!" << endl;
    exit(-1);
  }
  for(int i=0; i<size; i++)
    array[i] = 0;
}

Vector::Vector(const Vector& v) {
  size = v.length();
  array = new (nothrow) int[size];
  if(array==NULL) {
    cerr << "Memory allocation failure!" << endl;
    exit(-1);
  }
  for(int i=0; i<size; i++)
    array[i] = v.valueAt(i);
}

Vector::Vector(const Vector *v) {
  size = v->length();
  array = new (nothrow) int[size];
  if(array==NULL) {
    cerr << "Memory allocation failure!" << endl;
    exit(-1);
  }
  for(int i=0; i<size; i++)
    array[i] = v->valueAt(i);
}

Vector::~Vector() {
  delete [] array;
}

int Vector::length() const { 
  return size; 
}

int &Vector::valueAt(int pos) const {
  if(pos>=length()) {
     cerr << "Invalid access position!\n";
     return array[size-1];
  }
  return array[pos];
}

int Vector::find(int a) const {
  for(int i=0; i<size; i++)
    if(array[i] == a)
      return i;
    return -1;
}

void Vector::print() const {
  for(int i=0; i<size; i++) {
    cout << array[i];
    if(i==size-1)
      cout << endl;
    else
      cout << ", ";
  }
}

void Vector::print(string &msg) const {
  cout << msg;
  for(int i=0; i<size; i++) {
    cout << array[i];
    if(i==size-1)
      cout << endl;
    else
      cout << ", ";
  }
}

Vector& Vector::operator=(const Vector& v) {
  if(array!=NULL)
    delete [] array;
  size = v.length();
  array = new (nothrow) int[size];
  if(array==NULL) {
    cerr << "Memory allocation failure!" << endl;
    exit(-1);
  }
  for(int i=0; i<size; i++)
    array[i] = v.valueAt(i);
  return *this;
}

Vector Vector::operator+(const Vector& v) const {
  int length;
  if (size > v.length())
    length = size;
  else
    length = v.length();
  Vector n(length);
  for(int i=0; i<length; i++) {
    int sum = 0;
    if(i<size)
      sum += array[i];
    if(i<v.length())
      sum += v.array[i];
    n.array[i] = sum;
  }
  return n;
}

Vector Vector::operator-(const Vector& v) const {
  int length;
  if (size > v.length())
    length = size;
  else
    length = v.length();
  Vector n(length);
  for(int i=0; i<length; i++) {
    int sum = 0;
    if(i<size)
      sum += array[i];
    if(i<v.length())
      sum -= v.array[i];
    n.array[i] = sum;
  }
  return n;
}

Vector& Vector::operator+=(const Vector& v) {
  if(v.length() > size) {
    Vector n(v);
    n = n + *this;
    *this = n;
  }
  else {
    *this = *this + v;
  }
  return *this;
}

Vector& Vector::operator+=(int a) {
  for(int i=0; i<size; i++)
    array[i] += a;
  return *this;
}

Vector& Vector::operator-=(const Vector& v) {
  if(v.length() > size) {
    Vector n(v);
    n = n - *this;
    *this = n;
  }
  else {
    *this = *this - v;
  }
  return *this;
}

Vector& Vector::operator-=(int a) {
  for(int i=0; i<size; i++)
    array[i] -= a;
  return *this;
}

Vector& Vector::operator*=(const Vector& v) {
  if( v.size != size )
    return *this;
  
  for(int i=0; i<size; i++)
    array[i] *= v.array[i];  
  return *this;
}

Vector& Vector::operator*=(int a) {
  for(int i=0; i<size; i++)
    array[i] *= a;
  return *this;
}

Vector& Vector::operator/=(int a) {
  for(int i=0; i<size; i++)
    array[i] /= a;
  return *this;
}

Vector& Vector::operator%=(int a) {
  for(int i=0; i<size; i++)
    array[i] %= a;
  return *this;
}

Vector& Vector::operator<<=(int a) {
  for(int i=0; i<size; i++)
    array[i] <<= a;
  return *this;
}

Vector& Vector::operator>>=(int a) {
  for(int i=0; i<size; i++)
    array[i] >>= a;
  return *this;
}

int &Vector::operator[](int pos) const {
  return array[pos];
}