Nektar++
TestSymmetricMatrixStoragePolicy.cpp
Go to the documentation of this file.
1///////////////////////////////////////////////////////////////////////////////
2//
3// File: TestSymmetricMatrixStoragePolicy.cpp
4//
5// For more information, please see: http://www.nektar.info
6//
7// The MIT License
8//
9// Copyright (c) 2006 Division of Applied Mathematics, Brown University (USA),
10// Department of Aeronautics, Imperial College London (UK), and Scientific
11// Computing and Imaging Institute, University of Utah (USA).
12//
13// Permission is hereby granted, free of charge, to any person obtaining a
14// copy of this software and associated documentation files (the "Software"),
15// to deal in the Software without restriction, including without limitation
16// the rights to use, copy, modify, merge, publish, distribute, sublicense,
17// and/or sell copies of the Software, and to permit persons to whom the
18// Software is furnished to do so, subject to the following conditions:
19//
20// The above copyright notice and this permission notice shall be included
21// in all copies or substantial portions of the Software.
22//
23// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
24// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
25// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
26// THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
27// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
28// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
29// DEALINGS IN THE SOFTWARE.
30//
31// Description:
32//
33///////////////////////////////////////////////////////////////////////////////
34
35#include <boost/test/unit_test.hpp>
36
39#include <UnitTests/util.h>
40#include <boost/test/tools/floating_point_comparison.hpp>
41#include <boost/test/unit_test.hpp>
42
43namespace Nektar
44{
45namespace SymmetricMatrixStoragePolicyUnitTests
46{
48
49BOOST_AUTO_TEST_CASE(TestAdvanceSymmetric)
50{
52 {
53
54 unsigned int curRow = 0;
55 unsigned int curColumn = 0;
56 std::tie(curRow, curColumn) = Policy::Advance(3, 3, curRow, curColumn);
57 BOOST_CHECK_EQUAL(1, curRow);
58 BOOST_CHECK_EQUAL(0, curColumn);
59
60 std::tie(curRow, curColumn) = Policy::Advance(3, 3, curRow, curColumn);
61 BOOST_CHECK_EQUAL(2, curRow);
62 BOOST_CHECK_EQUAL(0, curColumn);
63
64 std::tie(curRow, curColumn) = Policy::Advance(3, 3, curRow, curColumn);
65 BOOST_CHECK_EQUAL(0, curRow);
66 BOOST_CHECK_EQUAL(1, curColumn);
67
68 std::tie(curRow, curColumn) = Policy::Advance(3, 3, curRow, curColumn);
69 BOOST_CHECK_EQUAL(1, curRow);
70 BOOST_CHECK_EQUAL(1, curColumn);
71
72 std::tie(curRow, curColumn) = Policy::Advance(3, 3, curRow, curColumn);
73 BOOST_CHECK_EQUAL(2, curRow);
74 BOOST_CHECK_EQUAL(1, curColumn);
75
76 std::tie(curRow, curColumn) = Policy::Advance(3, 3, curRow, curColumn);
77 BOOST_CHECK_EQUAL(0, curRow);
78 BOOST_CHECK_EQUAL(2, curColumn);
79
80 std::tie(curRow, curColumn) = Policy::Advance(3, 3, curRow, curColumn);
81 BOOST_CHECK_EQUAL(1, curRow);
82 BOOST_CHECK_EQUAL(2, curColumn);
83
84 std::tie(curRow, curColumn) = Policy::Advance(3, 3, curRow, curColumn);
85 BOOST_CHECK_EQUAL(2, curRow);
86 BOOST_CHECK_EQUAL(2, curColumn);
87
88 std::tie(curRow, curColumn) = Policy::Advance(3, 3, curRow, curColumn);
89 BOOST_CHECK_EQUAL(std::numeric_limits<unsigned int>::max(), curRow);
90 BOOST_CHECK_EQUAL(std::numeric_limits<unsigned int>::max(), curColumn);
91 }
92
93 {
94
95 unsigned int curRow = 0;
96 unsigned int curColumn = 0;
97 std::tie(curRow, curColumn) = Policy::Advance(1, 1, curRow, curColumn);
98 BOOST_CHECK_EQUAL(std::numeric_limits<unsigned int>::max(), curRow);
99 BOOST_CHECK_EQUAL(std::numeric_limits<unsigned int>::max(), curColumn);
100 }
101
102 {
103
104 unsigned int curRow = 0;
105 unsigned int curColumn = 0;
106 std::tie(curRow, curColumn) = Policy::Advance(2, 2, curRow, curColumn);
107 BOOST_CHECK_EQUAL(1, curRow);
108 BOOST_CHECK_EQUAL(0, curColumn);
109
110 std::tie(curRow, curColumn) = Policy::Advance(2, 2, curRow, curColumn);
111 BOOST_CHECK_EQUAL(0, curRow);
112 BOOST_CHECK_EQUAL(1, curColumn);
113
114 std::tie(curRow, curColumn) = Policy::Advance(2, 2, curRow, curColumn);
115 BOOST_CHECK_EQUAL(1, curRow);
116 BOOST_CHECK_EQUAL(1, curColumn);
117
118 std::tie(curRow, curColumn) = Policy::Advance(2, 2, curRow, curColumn);
119 BOOST_CHECK_EQUAL(std::numeric_limits<unsigned int>::max(), curRow);
120 BOOST_CHECK_EQUAL(std::numeric_limits<unsigned int>::max(), curColumn);
121 }
122}
123} // namespace SymmetricMatrixStoragePolicyUnitTests
124} // namespace Nektar
void RedirectCerrIfNeeded()
Definition: util.cpp:43
The above copyright notice and this permission notice shall be included.
Definition: CoupledSolver.h:2
static std::tuple< unsigned int, unsigned int > Advance(const unsigned int totalRows, const unsigned int totalColumns, const unsigned int curRow, const unsigned int curColumn)