Nektar++
TestFullMatrixStoragePolicy.cpp
Go to the documentation of this file.
1///////////////////////////////////////////////////////////////////////////////
2//
3// File: TestFullMatrixStoragePolicy.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 FullMatrixStoragePolicyUnitTests
46{
48
49BOOST_AUTO_TEST_CASE(TestCalculateIndex)
50{
52 BOOST_CHECK_EQUAL(0u, Policy::CalculateIndex(5, 5, 0, 0));
53 BOOST_CHECK_EQUAL(1u, Policy::CalculateIndex(5, 5, 1, 0));
54 BOOST_CHECK_EQUAL(2u, Policy::CalculateIndex(5, 5, 2, 0));
55 BOOST_CHECK_EQUAL(3u, Policy::CalculateIndex(5, 5, 3, 0));
56 BOOST_CHECK_EQUAL(4u, Policy::CalculateIndex(5, 5, 4, 0));
57 BOOST_CHECK_EQUAL(5u, Policy::CalculateIndex(5, 5, 5, 0));
58 BOOST_CHECK_EQUAL(6u, Policy::CalculateIndex(5, 5, 6, 0));
59}
60
61BOOST_AUTO_TEST_CASE(TestAdvanceFull)
62{
64 typedef FullMatrixFuncs Policy;
65
66 {
67 unsigned int curRow = 0;
68 unsigned int curColumn = 0;
69 std::tie(curRow, curColumn) = Policy::Advance(4, 3, curRow, curColumn);
70 BOOST_CHECK_EQUAL(1u, curRow);
71 BOOST_CHECK_EQUAL(0u, curColumn);
72
73 std::tie(curRow, curColumn) = Policy::Advance(4, 3, curRow, curColumn);
74 BOOST_CHECK_EQUAL(2u, curRow);
75 BOOST_CHECK_EQUAL(0u, curColumn);
76
77 std::tie(curRow, curColumn) = Policy::Advance(4, 3, curRow, curColumn);
78 BOOST_CHECK_EQUAL(3u, curRow);
79 BOOST_CHECK_EQUAL(0u, curColumn);
80
81 std::tie(curRow, curColumn) = Policy::Advance(4, 3, curRow, curColumn);
82 BOOST_CHECK_EQUAL(0u, curRow);
83 BOOST_CHECK_EQUAL(1u, curColumn);
84
85 std::tie(curRow, curColumn) = Policy::Advance(4, 3, curRow, curColumn);
86 BOOST_CHECK_EQUAL(1u, curRow);
87 BOOST_CHECK_EQUAL(1u, curColumn);
88
89 std::tie(curRow, curColumn) = Policy::Advance(4, 3, curRow, curColumn);
90 BOOST_CHECK_EQUAL(2u, curRow);
91 BOOST_CHECK_EQUAL(1u, curColumn);
92
93 std::tie(curRow, curColumn) = Policy::Advance(4, 3, curRow, curColumn);
94 BOOST_CHECK_EQUAL(3u, curRow);
95 BOOST_CHECK_EQUAL(1u, curColumn);
96
97 std::tie(curRow, curColumn) = Policy::Advance(4, 3, curRow, curColumn);
98 BOOST_CHECK_EQUAL(0u, curRow);
99 BOOST_CHECK_EQUAL(2u, curColumn);
100
101 std::tie(curRow, curColumn) = Policy::Advance(4, 3, curRow, curColumn);
102 BOOST_CHECK_EQUAL(1u, curRow);
103 BOOST_CHECK_EQUAL(2u, curColumn);
104
105 std::tie(curRow, curColumn) = Policy::Advance(4, 3, curRow, curColumn);
106 BOOST_CHECK_EQUAL(2u, curRow);
107 BOOST_CHECK_EQUAL(2u, curColumn);
108
109 std::tie(curRow, curColumn) = Policy::Advance(4, 3, curRow, curColumn);
110 BOOST_CHECK_EQUAL(3u, curRow);
111 BOOST_CHECK_EQUAL(2u, curColumn);
112
113 std::tie(curRow, curColumn) = Policy::Advance(4, 3, curRow, curColumn);
114 BOOST_CHECK_EQUAL(std::numeric_limits<unsigned int>::max(), curRow);
115 BOOST_CHECK_EQUAL(std::numeric_limits<unsigned int>::max(), curColumn);
116 }
117
118 {
119
120 unsigned int curRow = 0;
121 unsigned int curColumn = 0;
122 std::tie(curRow, curColumn) = Policy::Advance(1, 1, curRow, curColumn);
123 BOOST_CHECK_EQUAL(std::numeric_limits<unsigned int>::max(), curRow);
124 BOOST_CHECK_EQUAL(std::numeric_limits<unsigned int>::max(), curColumn);
125 }
126}
127
128} // namespace FullMatrixStoragePolicyUnitTests
129} // 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)
static unsigned int CalculateIndex(unsigned int totalRows, unsigned int totalColumns, unsigned int curRow, unsigned int curColumn)