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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
|
// 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 );
}
|
