#include #include using namespace std; class BooleanAlgebra { public: BooleanAlgebra(vector>*); BooleanAlgebra(int); BooleanAlgebra(); BooleanAlgebra operator * (BooleanAlgebra&); BooleanAlgebra operator | (BooleanAlgebra&); BooleanAlgebra operator & (BooleanAlgebra&); BooleanAlgebra operator ^ (BooleanAlgebra&); void display(); private: vector>* matrix; int ROWS_CNT; int COLS_CNT; int power; }; int main() { vector> matrix_1 { {1, 0, 1}, {1, 1, 1}, {0, 0, 1} }; vector> matrix_2 { {1, 0, 0}, {0, 1, 1}, {1, 1, 1} }; BooleanAlgebra instance_1(&matrix_1); BooleanAlgebra instance_2(&matrix_2); BooleanAlgebra result = instance_1 & instance_2; //result.display(); return 0; } BooleanAlgebra::BooleanAlgebra(vector>* 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); 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() { for (int row_index = 0; row_index < ROWS_CNT; row_index++) { for (int col_index = 0; col_index < COLS_CNT; col_index++) { cout << matrix->at(row_index)[col_index] << ' '; } cout << '\n'; } return; }

segmentation_fault_code_bit