The document defines a SparseMat template class to represent sparse matrices. It includes methods to get/set values, clear the matrix, and show submatrices. It tests the class by creating a sparse matrix of size 100,000 x 100,000, setting some values, testing getter/setter methods and exceptions, and clearing the matrix.
The document defines a SparseMat template class to represent sparse matrices. It includes methods to get/set values, clear the matrix, and show submatrices. It tests the class by creating a sparse matrix of size 100,000 x 100,000, setting some values, testing getter/setter methods and exceptions, and clearing the matrix.
The document defines a SparseMat template class to represent sparse matrices. It includes methods to get/set values, clear the matrix, and show submatrices. It tests the class by creating a sparse matrix of size 100,000 x 100,000, setting some values, testing getter/setter methods and exceptions, and clearing the matrix.
The document defines a SparseMat template class to represent sparse matrices. It includes methods to get/set values, clear the matrix, and show submatrices. It tests the class by creating a sparse matrix of size 100,000 x 100,000, setting some values, testing getter/setter methods and exceptions, and clearing the matrix.
template <class Object> class SparseMat { protected: typedef FHlist< MatNode<Object> > MatRow; typedef FHvector<MatRow> MasterCol; // the far left column
MasterCol rows; Object defVal; int rowSize, colSize;
public: SparseMat(int r, int c, const Object & defaultVal); const Object & get(int r, int c) const; bool set(int r, int c, const Object &x); void clear(); void showSubSquare(int start, int size);
// constructor template <class Object> SparseMat<Object>::SparseMat(int r, int c, const Object & defaultVal) { rowSize = r; colSize = c; defVal = defaultVal; rows = MasterCol(r); }// please email if the solution is in error
template <class Object>
const Object & SparseMat<Object>::get(int r, int c) const { if (r > rowSize || c > colSize) { throw OutOfBoundsException(); } else { if (rows[r].empty()) { return defVal; } typename MatRow::const_iterator iter; for (iter = rows[r].begin(); iter != rows[r].end(); iter++) { if ((*iter).getCol() == c) { return (*iter).data; } } return defVal; } }
template <class Object>
bool SparseMat<Object>::set(int r, int c, const Object &x) { if (r > rowSize || c > colSize) { return false; } // is not the default value, update. if (rows[r].empty()) { // node does not exist & only insert if it is not the default value if (x != defVal) { rows[r].push_back(MatNode<Object>(c, x)); } } else { // node exists typename MatRow::iterator iter; for (iter = rows[r].begin(); iter != rows[r].end(); iter++) { if ((*iter).getCol() == c) { if (x != defVal) { *iter = x; } else { // x is the default value, no point in storing it so // remove the node rows[r].erase(iter); } break; } } } return true; }
template <class Object>
void SparseMat<Object>::clear() { typename MatRow::iterator listIter; for (int k = 0; k < rows.size(); k++) { //if (!rows[k].empty() || rows[k] != NULL) { if (!rows[k].empty()) { rows[k].clear(); } } }
template <class Object>
void SparseMat<Object>::showSubSquare(int start, int size) { typename MatRow::iterator listIter; bool inList = false; cout << endl << endl; for (int r = start; r <= start + size - 1; r++) { cout << endl; for (int c = start; c <= start + size - 1; c++) { // loop through entire list and add another loop to check column inList = false; if (rows[r].empty()) { cout << setw(5) << "0"; } else { for (listIter = rows[r].begin(); listIter != rows[r].end(); listIter++) { if ((*listIter).getCol() == c) { cout << setw(5) << (*listIter).data; inList = true; } } if (!inList) { cout << setw(5) << "0"; } } } } cout << endl << endl; // fix formatting }
// Extra Credit template <class Object> Object & SparseMat<Object>::set(int r, int c) { if (r > rowSize || c > colSize) { throw OutOfBoundsException(); }
if (rows[r].empty()) { MatNode<Object> * newNode = &MatNode<Object>(c); rows[r].push_back(*newNode); return rows[r].back().data; } else { // node exists typename MatRow::iterator iter; for (iter = rows[r].begin(); iter != rows[r].end(); iter++) { if ((*iter).getCol() == c) { return (*iter).data; } } // row[r] contains a list but not for the col we want, create a new node MatNode<Object> * newNode = &MatNode<Object>(c); rows[r].push_back(*newNode); return rows[r].back().data; } } #endif
