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
44{
46
47BOOST_AUTO_TEST_CASE(TestAdvanceSymmetric)
48{
50 {
51
52 unsigned int curRow = 0;
53 unsigned int curColumn = 0;
54 std::tie(curRow, curColumn) = Policy::Advance(3, 3, curRow, curColumn);
55 BOOST_CHECK_EQUAL(1, curRow);
56 BOOST_CHECK_EQUAL(0, curColumn);
57
58 std::tie(curRow, curColumn) = Policy::Advance(3, 3, curRow, curColumn);
59 BOOST_CHECK_EQUAL(2, curRow);
60 BOOST_CHECK_EQUAL(0, curColumn);
61
62 std::tie(curRow, curColumn) = Policy::Advance(3, 3, curRow, curColumn);
63 BOOST_CHECK_EQUAL(0, curRow);
64 BOOST_CHECK_EQUAL(1, curColumn);
65
66 std::tie(curRow, curColumn) = Policy::Advance(3, 3, curRow, curColumn);
67 BOOST_CHECK_EQUAL(1, curRow);
68 BOOST_CHECK_EQUAL(1, curColumn);
69
70 std::tie(curRow, curColumn) = Policy::Advance(3, 3, curRow, curColumn);
71 BOOST_CHECK_EQUAL(2, curRow);
72 BOOST_CHECK_EQUAL(1, curColumn);
73
74 std::tie(curRow, curColumn) = Policy::Advance(3, 3, curRow, curColumn);
75 BOOST_CHECK_EQUAL(0, curRow);
76 BOOST_CHECK_EQUAL(2, curColumn);
77
78 std::tie(curRow, curColumn) = Policy::Advance(3, 3, curRow, curColumn);
79 BOOST_CHECK_EQUAL(1, curRow);
80 BOOST_CHECK_EQUAL(2, curColumn);
81
82 std::tie(curRow, curColumn) = Policy::Advance(3, 3, curRow, curColumn);
83 BOOST_CHECK_EQUAL(2, curRow);
84 BOOST_CHECK_EQUAL(2, curColumn);
85
86 std::tie(curRow, curColumn) = Policy::Advance(3, 3, curRow, curColumn);
87 BOOST_CHECK_EQUAL(std::numeric_limits<unsigned int>::max(), curRow);
88 BOOST_CHECK_EQUAL(std::numeric_limits<unsigned int>::max(), curColumn);
89 }
90
91 {
92
93 unsigned int curRow = 0;
94 unsigned int curColumn = 0;
95 std::tie(curRow, curColumn) = Policy::Advance(1, 1, curRow, curColumn);
96 BOOST_CHECK_EQUAL(std::numeric_limits<unsigned int>::max(), curRow);
97 BOOST_CHECK_EQUAL(std::numeric_limits<unsigned int>::max(), curColumn);
98 }
99
100 {
101
102 unsigned int curRow = 0;
103 unsigned int curColumn = 0;
104 std::tie(curRow, curColumn) = Policy::Advance(2, 2, curRow, curColumn);
105 BOOST_CHECK_EQUAL(1, curRow);
106 BOOST_CHECK_EQUAL(0, curColumn);
107
108 std::tie(curRow, curColumn) = Policy::Advance(2, 2, curRow, curColumn);
109 BOOST_CHECK_EQUAL(0, curRow);
110 BOOST_CHECK_EQUAL(1, curColumn);
111
112 std::tie(curRow, curColumn) = Policy::Advance(2, 2, curRow, curColumn);
113 BOOST_CHECK_EQUAL(1, curRow);
114 BOOST_CHECK_EQUAL(1, curColumn);
115
116 std::tie(curRow, curColumn) = Policy::Advance(2, 2, curRow, curColumn);
117 BOOST_CHECK_EQUAL(std::numeric_limits<unsigned int>::max(), curRow);
118 BOOST_CHECK_EQUAL(std::numeric_limits<unsigned int>::max(), curColumn);
119 }
120}
121} // namespace Nektar::SymmetricMatrixStoragePolicyUnitTests
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)