Tukukkk

I am getting a segmentation fault error when compiling my code. I don't know how to fix it. I am supposed to compile my Polynomial.cpp with my professor's poly_check.o, but I get a segmentation fault error.

This is my Polynomial.h:

#ifndef POLYNOMIAL_H

#define POLYNOMIAL_H



#include <iostream>

using namespace std;



class Polynomial {



    private:

         double *coefficients;

         int size;



    public:



         Polynomial();

         Polynomial(double c, int size);

         Polynomial(const Polynomial &poly);



         ~Polynomial();



         void set(double c, int size);



         inline int getDegree() const {

         return size - 1;

         }



         double f(double x)const;



         bool operator== (const Polynomial &poly)const;

         Polynomial operator+ (const Polynomial &poly)const;



         friend ostream & operator << (ostream &out, const 

         Polynomial &poly); 

         friend istream & operator >> (istream &in,  Polynomial 

         &poly); 



 };



#endif

This is my Polynomial.cpp:

#include "Polynomial.h"

#include <iostream>

#include <cmath>



using namespace std;



Polynomial::Polynomial() {

    size = 0;

    coefficients = NULL;

}



Polynomial::Polynomial(double c, int size) {



    this->size = size;

    coefficients = new double[size];



    for (int i = 0; i < size; i++) {

        coefficients[i] = c[i];

    }

}



Polynomial::Polynomial(const Polynomial &poly) {



    if (coefficients != NULL)

        delete coefficients;



    this->size = poly.size;

    coefficients = new double[size];



    for (int i = 0; i < size; i++)

        coefficients[i] = poly.coefficients[i];

}



Polynomial::~Polynomial() {



    if (coefficients != NULL)

        delete coefficients;

} 



void Polynomial::set(double c, int size) {



    this->size = size;

    if (coefficients != NULL)

        delete coefficients;



    coefficients = new double[size];



    for (int i = 0; i < size; i++)

        coefficients[i] = c[i];

}



double Polynomial::f(double x)const {



    double value = 0.0;



    for (int i = 0; i < size; i++) {

        value += (coefficients[i] * pow(x, i));

    }



    return value;

}



bool Polynomial::operator== (const Polynomial &poly)const {



    if (this->size != poly.size)

        return false;



    for (int i = 0; i < size; i++) {

        if (poly.coefficients[i] != coefficients[i])

            return false;

    }



    return true;

}





Polynomial Polynomial::operator+ (const Polynomial &poly)const {



    int maxSize = size;

    if (poly.size > maxSize)

        maxSize = poly.size;



    double sum[maxSize] = {0.0};



    for (int i = 0; i < size; i++) {

        sum[i] = coefficients[i];

    }



    for (int i = 0; i < poly.size; i++) {

        sum[i] += poly.coefficients[i];

    }



    Polynomial sumP(sum, maxSize);

    return sumP;

}



ostream &operator << (ostream &out, const Polynomial &poly) {



    for (int i = poly.size - 1; i >= 0; i--) {



        if (i != poly.size - 1) {

            if (poly.coefficients[i] >= 0)

                out << " + ";

            else

                out << " - ";

        }

        out << poly.coefficients[i];

        if (i == 0)

            continue;

        if (i == 1)

            out << "x";

        else

            out << "x^" << i;   

    }



    return out;

}



istream &operator >> (istream &in,  Polynomial &poly) {



    int degree;

    in >> degree;



    double c[100];

    int size = 0;





    while (in >> c[size]) {

        size++;

        if ((size-1) == degree)

            break;

    }



    poly.set(c, size);

    return in;

}

This is my poly_test.cpp:

#include "Polynomial.h"

#include <iostream>

using namespace std;



int main(void) {



    double c1 = {0, 1, 2, 3, 4};

    double c2 = {0, 1, 2, 3, 4, 5, 6};



    Polynomial p1(c1, 5);

    Polynomial p2(c2, 7);



    Polynomial p3;

    cout << "Enter p3: ";

    cin >> p3;



    cout << "p1: ";

    cout << p1 << endl;



    cout << "p2: ";

    cout << p2 << endl;



    cout << "p3: ";

    cout << p3 << endl;



    Polynomial p4;

    p4 = p1 + p2;

    cout << "p4 = p1 + p2,  p4: ";

    cout << p4 << endl;



    double value = p1.f(2);

    cout << "Evaluating p1 at x = 2, p1 = ";

    cout << value << endl;



    Polynomial p6(c1, 5);

    cout << "p6: ";

    cout << p6 << endl;

    if (p6 == p1) {

       cout << "p6 and p1 are equal. Equality test passed" << 

   endl;

    }

     else {

        cout << "Equality test failed" << endl;

    }



    return 0;

}

This is the error that I am getting:
segmentation fault error

In general, you should test your own code as you develop it. Don't write this much code and then plug it into a test function; it will fail, and the process of debugging it will be long and discouraging.

The specific problem (or one of them) is that you neglected to implement operator=. Are you familiar with shallow copies and deep copies? The default copy constructor is a shallow copier, so that two instances of Polynomial wind up with pointers to the same array. Then when they die, they both try to delete it.