You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
326 lines
11 KiB
326 lines
11 KiB
#include "gtest/gtest.h"
|
|
#include "src/storage/SquareSparseMatrix.h"
|
|
#include "src/exceptions/InvalidArgumentException.h"
|
|
#include "src/exceptions/OutOfRangeException.h"
|
|
|
|
TEST(SquareSparseMatrixTest, ZeroRowsTest) {
|
|
mrmc::storage::SquareSparseMatrix<int> *ssm = new mrmc::storage::SquareSparseMatrix<int>(0);
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::UnInitialized);
|
|
|
|
ASSERT_THROW(ssm->initialize(50), mrmc::exceptions::InvalidArgumentException);
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::Error);
|
|
|
|
delete ssm;
|
|
}
|
|
|
|
TEST(SquareSparseMatrixTest, TooManyEntriesTest) {
|
|
mrmc::storage::SquareSparseMatrix<int> *ssm = new mrmc::storage::SquareSparseMatrix<int>(2);
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::UnInitialized);
|
|
|
|
ASSERT_THROW(ssm->initialize(10), mrmc::exceptions::InvalidArgumentException);
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::Error);
|
|
|
|
delete ssm;
|
|
}
|
|
|
|
TEST(SquareSparseMatrixTest, addNextValueTest) {
|
|
mrmc::storage::SquareSparseMatrix<int> *ssm = new mrmc::storage::SquareSparseMatrix<int>(5);
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::UnInitialized);
|
|
|
|
ASSERT_NO_THROW(ssm->initialize(1));
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::Initialized);
|
|
|
|
ASSERT_THROW(ssm->addNextValue(-1, 1, 1), mrmc::exceptions::OutOfRangeException);
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::Error);
|
|
|
|
ASSERT_THROW(ssm->addNextValue(1, -1, 1), mrmc::exceptions::OutOfRangeException);
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::Error);
|
|
|
|
ASSERT_THROW(ssm->addNextValue(6, 1, 1), mrmc::exceptions::OutOfRangeException);
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::Error);
|
|
|
|
ASSERT_THROW(ssm->addNextValue(1, 6, 1), mrmc::exceptions::OutOfRangeException);
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::Error);
|
|
|
|
delete ssm;
|
|
}
|
|
|
|
TEST(SquareSparseMatrixTest, finalizeTest) {
|
|
mrmc::storage::SquareSparseMatrix<int> *ssm = new mrmc::storage::SquareSparseMatrix<int>(5);
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::UnInitialized);
|
|
|
|
ASSERT_NO_THROW(ssm->initialize(5));
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::Initialized);
|
|
|
|
ASSERT_NO_THROW(ssm->addNextValue(1, 2, 1));
|
|
ASSERT_NO_THROW(ssm->addNextValue(1, 3, 1));
|
|
ASSERT_NO_THROW(ssm->addNextValue(1, 4, 1));
|
|
ASSERT_NO_THROW(ssm->addNextValue(1, 5, 1));
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::Initialized);
|
|
|
|
ASSERT_THROW(ssm->finalize(), mrmc::exceptions::InvalidStateException);
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::Error);
|
|
|
|
delete ssm;
|
|
}
|
|
|
|
TEST(SquareSparseMatrixTest, Test) {
|
|
// 25 rows, 50 non zero entries
|
|
mrmc::storage::SquareSparseMatrix<int> *ssm = new mrmc::storage::SquareSparseMatrix<int>(25);
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::UnInitialized);
|
|
|
|
int values[50] = {
|
|
0, 1, 2, 3, 4, 5, 6, 7, 8, 9,
|
|
10, 11, 12, 13, 14, 15, 16, 17, 18, 19,
|
|
20, 21, 22, 23, 24, 25, 26, 27, 28, 29,
|
|
30, 31, 32, 33, 34, 35, 36, 37, 38, 39,
|
|
40, 41, 42, 43, 44, 45, 46, 47, 48, 49
|
|
};
|
|
int position_row[50] = {
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
2, 2, 2, 2, /* first row empty, one full row ��������� 25 minus the diagonal entry */
|
|
4, 4, /* one empty row, then first and last column */
|
|
13, 13, 13, 13, /* a few empty rows, middle columns */
|
|
24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
|
|
24, 24, 24, 24, 24, 24, 24, 24, 24, 24 /* second to last row */
|
|
};
|
|
int position_col[50] = {
|
|
1, 3, 4, 5, 6, 7, 8, 9, 10,
|
|
11, 12, 13, 14, 15, 16, 17, 18, 19, 20,
|
|
21, 22, 23, 24, 25, /* first row empty, one full row a 25 */
|
|
1, 25, /* one empty row, then first and last column */
|
|
16, 17, 18, 19, /* a few empty rows, middle columns */
|
|
2, 3, 4, 5, 6, 7, 8, 9, 10, 11,
|
|
14, 15, 16, 17, 18, 19, 20, 21, 22, 23 /* second to last row */
|
|
};
|
|
|
|
ASSERT_NO_THROW(ssm->initialize(50));
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::Initialized);
|
|
|
|
for (int i = 0; i < 50; ++i) {
|
|
ASSERT_NO_THROW(ssm->addNextValue(position_row[i], position_col[i], values[i]));
|
|
}
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::Initialized);
|
|
|
|
ASSERT_NO_THROW(ssm->finalize());
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::ReadReady);
|
|
|
|
int target;
|
|
for (int i = 0; i < 50; ++i) {
|
|
ASSERT_TRUE(ssm->getValue(position_row[i], position_col[i], &target));
|
|
ASSERT_EQ(values[i], target);
|
|
}
|
|
|
|
// test for a few of the empty rows
|
|
for (int row = 15; row < 24; ++row) {
|
|
for (int col = 1; col <= 25; ++col) {
|
|
target = 1;
|
|
if (row != col) {
|
|
ASSERT_FALSE(ssm->getValue(row, col, &target));
|
|
} else {
|
|
ASSERT_TRUE(ssm->getValue(row, col, &target));
|
|
}
|
|
|
|
ASSERT_EQ(0, target);
|
|
}
|
|
}
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::ReadReady);
|
|
|
|
delete ssm;
|
|
}
|
|
|
|
TEST(SquareSparseMatrixTest, ConversionFromDenseEigen_ColMajor_SparseMatrixTest) {
|
|
// 10 rows, 100 non zero entries
|
|
mrmc::storage::SquareSparseMatrix<int> *ssm = new mrmc::storage::SquareSparseMatrix<int>(10);
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::UnInitialized);
|
|
|
|
Eigen::SparseMatrix<int> esm(10, 10);
|
|
for (int row = 0; row < 10; ++row) {
|
|
for (int col = 0; col < 10; ++col) {
|
|
esm.insert(row, col) = row * 10 + col;
|
|
}
|
|
}
|
|
|
|
// make compressed, important for initialize()
|
|
esm.makeCompressed();
|
|
|
|
ASSERT_NO_THROW(ssm->initialize(esm));
|
|
|
|
ASSERT_NO_THROW(ssm->finalize());
|
|
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::ReadReady);
|
|
|
|
int target = -1;
|
|
for (int row = 0; row < 10; ++row) {
|
|
for (int col = 0; col < 10; ++col) {
|
|
ASSERT_TRUE(ssm->getValue(row, col, &target));
|
|
ASSERT_EQ(target, row * 10 + col);
|
|
}
|
|
}
|
|
|
|
delete ssm;
|
|
}
|
|
|
|
TEST(SquareSparseMatrixTest, ConversionFromDenseEigen_RowMajor_SparseMatrixTest) {
|
|
// 10 rows, 100 non zero entries
|
|
mrmc::storage::SquareSparseMatrix<int> *ssm = new mrmc::storage::SquareSparseMatrix<int>(10);
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::UnInitialized);
|
|
|
|
Eigen::SparseMatrix<int, Eigen::RowMajor> esm(10, 10);
|
|
for (int row = 0; row < 10; ++row) {
|
|
for (int col = 0; col < 10; ++col) {
|
|
esm.insert(row, col) = row * 10 + col;
|
|
}
|
|
}
|
|
|
|
// make compressed, important for initialize()
|
|
esm.makeCompressed();
|
|
|
|
ASSERT_NO_THROW(ssm->initialize(esm));
|
|
|
|
ASSERT_NO_THROW(ssm->finalize());
|
|
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::ReadReady);
|
|
|
|
int target = -1;
|
|
for (int row = 0; row < 10; ++row) {
|
|
for (int col = 0; col < 10; ++col) {
|
|
ASSERT_TRUE(ssm->getValue(row, col, &target));
|
|
ASSERT_EQ(target, row * 10 + col);
|
|
}
|
|
}
|
|
|
|
delete ssm;
|
|
}
|
|
|
|
TEST(SquareSparseMatrixTest, ConversionFromSparseEigen_ColMajor_SparseMatrixTest) {
|
|
// 10 rows, 15 non zero entries
|
|
mrmc::storage::SquareSparseMatrix<int> *ssm = new mrmc::storage::SquareSparseMatrix<int>(10);
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::UnInitialized);
|
|
|
|
Eigen::SparseMatrix<int> esm(10, 10);
|
|
|
|
typedef Eigen::Triplet<int> IntTriplet;
|
|
std::vector<IntTriplet> tripletList;
|
|
tripletList.reserve(15);
|
|
tripletList.push_back(IntTriplet(1, 0, 0));
|
|
tripletList.push_back(IntTriplet(1, 1, 1));
|
|
tripletList.push_back(IntTriplet(1, 2, 2));
|
|
tripletList.push_back(IntTriplet(1, 3, 3));
|
|
tripletList.push_back(IntTriplet(1, 4, 4));
|
|
tripletList.push_back(IntTriplet(1, 5, 5));
|
|
tripletList.push_back(IntTriplet(1, 6, 6));
|
|
tripletList.push_back(IntTriplet(1, 7, 7));
|
|
tripletList.push_back(IntTriplet(1, 8, 8));
|
|
tripletList.push_back(IntTriplet(1, 9, 9));
|
|
|
|
tripletList.push_back(IntTriplet(4, 3, 10));
|
|
tripletList.push_back(IntTriplet(4, 6, 11));
|
|
tripletList.push_back(IntTriplet(4, 9, 12));
|
|
|
|
tripletList.push_back(IntTriplet(6, 0, 13));
|
|
tripletList.push_back(IntTriplet(8, 9, 14));
|
|
|
|
esm.setFromTriplets(tripletList.begin(), tripletList.end());
|
|
|
|
// make compressed, important for initialize()
|
|
esm.makeCompressed();
|
|
|
|
ASSERT_NO_THROW(ssm->initialize(esm));
|
|
|
|
ASSERT_NO_THROW(ssm->finalize());
|
|
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::ReadReady);
|
|
|
|
int target = -1;
|
|
|
|
for (auto &coeff: tripletList) {
|
|
ASSERT_TRUE(ssm->getValue(coeff.row(), coeff.col(), &target));
|
|
ASSERT_EQ(target, coeff.value());
|
|
}
|
|
|
|
delete ssm;
|
|
}
|
|
|
|
TEST(SquareSparseMatrixTest, ConversionFromSparseEigen_RowMajor_SparseMatrixTest) {
|
|
// 10 rows, 15 non zero entries
|
|
mrmc::storage::SquareSparseMatrix<int> *ssm = new mrmc::storage::SquareSparseMatrix<int>(10);
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::UnInitialized);
|
|
|
|
Eigen::SparseMatrix<int, Eigen::RowMajor> esm(10, 10);
|
|
|
|
typedef Eigen::Triplet<int> IntTriplet;
|
|
std::vector<IntTriplet> tripletList;
|
|
tripletList.reserve(15);
|
|
tripletList.push_back(IntTriplet(1, 0, 0));
|
|
tripletList.push_back(IntTriplet(1, 1, 1));
|
|
tripletList.push_back(IntTriplet(1, 2, 2));
|
|
tripletList.push_back(IntTriplet(1, 3, 3));
|
|
tripletList.push_back(IntTriplet(1, 4, 4));
|
|
tripletList.push_back(IntTriplet(1, 5, 5));
|
|
tripletList.push_back(IntTriplet(1, 6, 6));
|
|
tripletList.push_back(IntTriplet(1, 7, 7));
|
|
tripletList.push_back(IntTriplet(1, 8, 8));
|
|
tripletList.push_back(IntTriplet(1, 9, 9));
|
|
|
|
tripletList.push_back(IntTriplet(4, 3, 10));
|
|
tripletList.push_back(IntTriplet(4, 6, 11));
|
|
tripletList.push_back(IntTriplet(4, 9, 12));
|
|
|
|
tripletList.push_back(IntTriplet(6, 0, 13));
|
|
tripletList.push_back(IntTriplet(8, 9, 14));
|
|
|
|
esm.setFromTriplets(tripletList.begin(), tripletList.end());
|
|
|
|
// make compressed, important for initialize()
|
|
esm.makeCompressed();
|
|
|
|
ASSERT_NO_THROW(ssm->initialize(esm));
|
|
|
|
ASSERT_NO_THROW(ssm->finalize());
|
|
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::ReadReady);
|
|
|
|
int target = -1;
|
|
|
|
for (auto &coeff: tripletList) {
|
|
ASSERT_TRUE(ssm->getValue(coeff.row(), coeff.col(), &target));
|
|
ASSERT_EQ(target, coeff.value());
|
|
}
|
|
|
|
delete ssm;
|
|
}
|
|
|
|
TEST(SquareSparseMatrixTest, ConversionToSparseEigen_RowMajor_SparseMatrixTest) {
|
|
int values[100];
|
|
mrmc::storage::SquareSparseMatrix<int> *ssm = new mrmc::storage::SquareSparseMatrix<int>(10);
|
|
|
|
for (uint_fast32_t i = 0; i < 100; ++i) {
|
|
values[i] = i;
|
|
}
|
|
|
|
ASSERT_NO_THROW(ssm->initialize(100 - 10));
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::Initialized);
|
|
|
|
for (uint_fast32_t row = 0; row < 10; ++row) {
|
|
for (uint_fast32_t col = 0; col < 10; ++col) {
|
|
ASSERT_NO_THROW(ssm->addNextValue(row, col, values[row * 10 + col]));
|
|
}
|
|
}
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::Initialized);
|
|
|
|
ASSERT_NO_THROW(ssm->finalize());
|
|
ASSERT_EQ(ssm->getState(), mrmc::storage::SquareSparseMatrix<int>::MatrixStatus::ReadReady);
|
|
|
|
Eigen::SparseMatrix<int, Eigen::RowMajor, int_fast32_t>* esm = ssm->toEigenSparseMatrix();
|
|
|
|
for (uint_fast32_t row = 0; row < 10; ++row) {
|
|
for (uint_fast32_t col = 0; col < 10; ++col) {
|
|
ASSERT_EQ(values[row * 10 + col], esm->coeff(row, col));
|
|
}
|
|
}
|
|
|
|
delete esm;
|
|
delete ssm;
|
|
}
|