123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106 |
- // Copyright (c) 2011 David Bellot
- //
- // Distributed under the Boost Software License, Version 1.0. (See
- // accompanying file LICENSE_1_0.txt or copy at
- // http://www.boost.org/LICENSE_1_0.txt)
- #include <boost/numeric/ublas/matrix_sparse.hpp>
- #define BOOST_TEST_MODULE SparseMatrixErasureTest
- #include <boost/test/included/unit_test.hpp>
- BOOST_AUTO_TEST_CASE( compressed_matrix_erase_after_end )
- {
- boost::numeric::ublas::compressed_matrix<int, boost::numeric::ublas::row_major > A(2, 2);
- BOOST_CHECK_EQUAL( A.filled1(), (std::size_t) 1 );
- BOOST_CHECK_EQUAL( A.index1_data()[0], (std::size_t) 0 );
- A(0,0) = 1;
- BOOST_CHECK_EQUAL( A.nnz(), (std::size_t) 1 );
- BOOST_CHECK_EQUAL( A.filled1(), (std::size_t) 2 );
- // check new element
- BOOST_CHECK_EQUAL( A.index1_data()[0], (std::size_t) 0 );
- BOOST_CHECK_EQUAL( A.index2_data()[0], (std::size_t) 0 );
- BOOST_CHECK_EQUAL( A.value_data()[0], 1 );
- // check end of list marker
- BOOST_CHECK_EQUAL( A.index1_data()[1], (std::size_t) 1 );
- A.erase_element(1,0);
- BOOST_CHECK_EQUAL( A.nnz(), (std::size_t) 1 );
- BOOST_CHECK_EQUAL( A.filled1(), (std::size_t) 2 );
- BOOST_CHECK_EQUAL( A.filled2(), (std::size_t) 1 );
- // check new element
- BOOST_CHECK_EQUAL( A.index1_data()[0], (std::size_t) 0 );
- BOOST_CHECK_EQUAL( A.index2_data()[0], (std::size_t) 0 );
- BOOST_CHECK_EQUAL( A.value_data()[0], 1 );
- // check end of list marker
- BOOST_CHECK_EQUAL( A.index1_data()[1], (std::size_t) 1 );
- A.erase_element(0,0);
- BOOST_CHECK_EQUAL( A.nnz(), (std::size_t) 0 );
- BOOST_CHECK_EQUAL( A.filled1(), (std::size_t) 2 );
- BOOST_CHECK_EQUAL( A.filled2(),(std::size_t) 0 );
- BOOST_CHECK_EQUAL( A.index1_data()[0], (std::size_t) 0 );
- }
- BOOST_AUTO_TEST_CASE( compressed_matrix_erase_in_the_middle )
- {
- boost::numeric::ublas::compressed_matrix<int, boost::numeric::ublas::row_major > A(2, 2);
- BOOST_CHECK_EQUAL( A.filled1(), (std::size_t) 1 );
- BOOST_CHECK_EQUAL( A.filled2(), (std::size_t) 0 );
- BOOST_CHECK_EQUAL( A.index1_data()[0], (std::size_t) 0 );
- A.insert_element(0,1,5);
- BOOST_CHECK_EQUAL( A.filled1(), (std::size_t) 2 );
- BOOST_CHECK_EQUAL( A.filled2(), (std::size_t) 1 );
- // check new element
- BOOST_CHECK_EQUAL( A.index1_data()[0], (std::size_t) 0 );
- BOOST_CHECK_EQUAL( A.index2_data()[0], (std::size_t) 1 );
- BOOST_CHECK_EQUAL( A.value_data()[0], 5 );
- // check end of list marker
- BOOST_CHECK_EQUAL( A.index1_data()[1], (std::size_t) 1 );
- A.insert_element(0,0,4);
- BOOST_CHECK_EQUAL( A.filled1(), (std::size_t) 2 );
- BOOST_CHECK_EQUAL( A.filled2(), (std::size_t) 2 );
- // check new element
- BOOST_CHECK_EQUAL( A.index2_data()[0], (std::size_t) 0 );
- BOOST_CHECK_EQUAL( A.value_data()[0], 4 );
- // check previous element
- BOOST_CHECK_EQUAL( A.index2_data()[1], (std::size_t) 1 );
- BOOST_CHECK_EQUAL( A.value_data()[1], 5 );
- // check end of list marker
- BOOST_CHECK_EQUAL( A.index1_data()[1], (std::size_t) 2 );
- A.erase_element(0,0);
- BOOST_CHECK_EQUAL( A.filled1(), (std::size_t) 2 );
- BOOST_CHECK_EQUAL( A.filled2(), (std::size_t) 1 );
- BOOST_CHECK_EQUAL( A.index2_data()[0], (std::size_t) 1 );
- BOOST_CHECK_EQUAL( A.value_data()[0], 5 );
- BOOST_CHECK_EQUAL( A.index1_data()[0], (std::size_t) 0 );
- BOOST_CHECK_EQUAL( A.index1_data()[1], (std::size_t) 1 );
- A.erase_element(0,1);
- BOOST_CHECK_EQUAL( A.filled1(), (std::size_t) 2 );
- BOOST_CHECK_EQUAL( A.filled2(), (std::size_t) 0 );
- BOOST_CHECK_EQUAL( A.index1_data()[0], (std::size_t) 0 );
- BOOST_CHECK_EQUAL( A.index1_data()[1], (std::size_t) 0 );
- }
|