#include #include using namespace std; typedef vector> vector_t; class BooleanAlgebra { public: BooleanAlgebra(vector_t*); BooleanAlgebra(int); BooleanAlgebra(); ~BooleanAlgebra(); BooleanAlgebra operator * (BooleanAlgebra&); BooleanAlgebra operator | (BooleanAlgebra&); BooleanAlgebra operator & (BooleanAlgebra&); BooleanAlgebra operator ^ (BooleanAlgebra&); void display(); void garbage_collector(); private: vector_t* matrix = new vector_t; /* dont leave your pointer matrix uninitialized: vector_t* matrix {nullptr}; -----> CORRECT and then initialize it with ctor. */ int ROWS_CNT; int COLS_CNT; /* Best practice: use a different vector_t to to store and display the result of your operation. */ int power; }; int main() { vector_t matrix_1 { {1, 0, 1}, {1, 1, 1}, {0, 0, 1} }; vector_t matrix_2 { {1, 0, 0}, {0, 1, 1}, {1, 1, 1} }; BooleanAlgebra instance_1(&matrix_1); BooleanAlgebra instance_2(&matrix_2); BooleanAlgebra result; result = instance_1 & instance_2; result.display(); //result.garbage_collector(); /* feel free to use garbage_collector(); using that will raise no error. */ return 0; } BooleanAlgebra::BooleanAlgebra(vector_t* matrix) :matrix(matrix), ROWS_CNT(matrix->size()), COLS_CNT(matrix->at(0).size()) { } BooleanAlgebra::BooleanAlgebra(int power) :power(power) { } BooleanAlgebra::BooleanAlgebra() { } BooleanAlgebra BooleanAlgebra::operator * (BooleanAlgebra& other) { BooleanAlgebra eval; eval.matrix->resize(this->ROWS_CNT); for (int i = 0; i < this->ROWS_CNT; i++) { eval.matrix->at(i).resize(this->COLS_CNT); for (int j = 0; j < other.COLS_CNT; j++) { bool is_found = false; for (int k = 0; k < this->COLS_CNT; k++) { if (this->matrix->at(i)[k] == 1 && other.matrix->at(k)[j] == 1) { eval.matrix->at(i)[j] = 1; is_found = true; break; } } if (is_found == false) eval.matrix->at(i)[j] = 0; } } return eval; } BooleanAlgebra BooleanAlgebra::operator | (BooleanAlgebra& other) { BooleanAlgebra eval; eval.matrix->resize(this->ROWS_CNT); for (int i = 0; i < this->ROWS_CNT; i++) { eval.matrix->at(i).resize(this->COLS_CNT); for (int j = 0; j < this->COLS_CNT; j++) { if (this->matrix->at(i)[j] == 1 || other.matrix->at(i)[j] == 1) eval.matrix->at(i)[j] = 1; else eval.matrix->at(i)[j] = 0; } } return eval; } BooleanAlgebra BooleanAlgebra::operator & (BooleanAlgebra& other) { BooleanAlgebra eval; eval.matrix->resize(this->ROWS_CNT); /* pointer matrix in 'eval' object is still uninitialized. attempting to allocate any space for a pointer that points to no particular data leads to "segmentation fault" error. */ for (int i = 0; i < this->ROWS_CNT; i++) { eval.matrix->at(i).resize(this->COLS_CNT); for (int j = 0; j < this->COLS_CNT; j++) { if (this->matrix->at(i)[j] == 1 && other.matrix->at(i)[j] == 1) eval.matrix->at(i)[j] = 1; else eval.matrix->at(i)[j] = 0; } } return eval; } BooleanAlgebra BooleanAlgebra::operator ^ (BooleanAlgebra& other) { BooleanAlgebra eval; for (int range = 1; range < this->power; range++) { // STILL NOT COMPLETE } return eval; } void BooleanAlgebra::display() { vector_t::iterator row; vector::iterator col; for (row = matrix->begin(); row != matrix->end(); row++) { for (col = row->begin(); col != row->end(); col++) { cout << *col << ' '; } cout << '\n'; } return; } void BooleanAlgebra::garbage_collector() { delete matrix; } BooleanAlgebra::~BooleanAlgebra() { //delete matrix; /* doing garbage collection in the deconstructor results in unexpected output. in this case I may need to do it by calling an explicit function like garbage_collector() */ /* in case you leave your data, especially your pointer uninitialized, you'll have some crazy trouble freeing your heap-allocated data using dtor. */ }

boolean algebra