Nektar++
TestLowerTriangularMatrixStoragePolicy.cpp
Go to the documentation of this file.
1///////////////////////////////////////////////////////////////////////////////
2//
3// File: TestLowerTriangularMatrixStoragePolicy.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
44{
46
47BOOST_AUTO_TEST_CASE(TestAdvanceLowerTriangular)
48{
50
51 {
52
53 unsigned int curRow = 0;
54 unsigned int curColumn = 0;
55 std::tie(curRow, curColumn) =
56 Policy::Advance(3, 3, curRow, curColumn, 'N');
57 BOOST_CHECK_EQUAL(1, curRow);
58 BOOST_CHECK_EQUAL(0, curColumn);
59
60 std::tie(curRow, curColumn) =
61 Policy::Advance(3, 3, curRow, curColumn, 'N');
62 BOOST_CHECK_EQUAL(2, curRow);
63 BOOST_CHECK_EQUAL(0, curColumn);
64
65 std::tie(curRow, curColumn) =
66 Policy::Advance(3, 3, curRow, curColumn, 'N');
67 BOOST_CHECK_EQUAL(1, curRow);
68 BOOST_CHECK_EQUAL(1, curColumn);
69
70 std::tie(curRow, curColumn) =
71 Policy::Advance(3, 3, curRow, curColumn, 'N');
72 BOOST_CHECK_EQUAL(2, curRow);
73 BOOST_CHECK_EQUAL(1, curColumn);
74
75 std::tie(curRow, curColumn) =
76 Policy::Advance(3, 3, curRow, curColumn, 'N');
77 BOOST_CHECK_EQUAL(2, curRow);
78 BOOST_CHECK_EQUAL(2, curColumn);
79
80 std::tie(curRow, curColumn) =
81 Policy::Advance(3, 3, curRow, curColumn, 'N');
82 BOOST_CHECK_EQUAL(std::numeric_limits<unsigned int>::max(), curRow);
83 BOOST_CHECK_EQUAL(std::numeric_limits<unsigned int>::max(), curColumn);
84 }
85
86 {
87
88 unsigned int curRow = 0;
89 unsigned int curColumn = 0;
90 std::tie(curRow, curColumn) =
91 Policy::Advance(1, 1, curRow, curColumn, 'N');
92 BOOST_CHECK_EQUAL(std::numeric_limits<unsigned int>::max(), curRow);
93 BOOST_CHECK_EQUAL(std::numeric_limits<unsigned int>::max(), curColumn);
94 }
95
96 {
97
98 unsigned int curRow = 0;
99 unsigned int curColumn = 0;
100 std::tie(curRow, curColumn) =
101 Policy::Advance(2, 2, curRow, curColumn, 'N');
102 BOOST_CHECK_EQUAL(1, curRow);
103 BOOST_CHECK_EQUAL(0, curColumn);
104
105 std::tie(curRow, curColumn) =
106 Policy::Advance(2, 2, curRow, curColumn, 'N');
107 BOOST_CHECK_EQUAL(1, curRow);
108 BOOST_CHECK_EQUAL(1, curColumn);
109
110 std::tie(curRow, curColumn) =
111 Policy::Advance(2, 2, curRow, curColumn, 'N');
112 BOOST_CHECK_EQUAL(std::numeric_limits<unsigned int>::max(), curRow);
113 BOOST_CHECK_EQUAL(std::numeric_limits<unsigned int>::max(), curColumn);
114 }
115}
116} // namespace Nektar::LowerTriangularStoragePolicyUnitTests
void RedirectCerrIfNeeded()
Definition: util.cpp:41
static std::tuple< unsigned int, unsigned int > Advance(const unsigned int totalRows, const unsigned int totalColumns, const unsigned int curRow, const unsigned int curColumn, char transpose='N')