Nektar++
TestUpperTriangularMatrixStoragePolicy.cpp
Go to the documentation of this file.
1///////////////////////////////////////////////////////////////////////////////
2//
3// File: TestUpperTriangularMatrixStoragePolicy.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
41#include <boost/test/tools/floating_point_comparison.hpp>
42#include <boost/test/unit_test.hpp>
43
44namespace Nektar
45{
46namespace UpperTriangularUnitTests
47{
49
50BOOST_AUTO_TEST_CASE(TestAdvanceUpperTriangular)
51{
53
54 {
55
56 unsigned int curRow = 0;
57 unsigned int curColumn = 0;
58 std::tie(curRow, curColumn) = Policy::Advance(3, 3, curRow, curColumn);
59 BOOST_CHECK_EQUAL(0u, curRow);
60 BOOST_CHECK_EQUAL(1u, curColumn);
61
62 std::tie(curRow, curColumn) = Policy::Advance(3, 3, curRow, curColumn);
63 BOOST_CHECK_EQUAL(1u, curRow);
64 BOOST_CHECK_EQUAL(1u, curColumn);
65
66 std::tie(curRow, curColumn) = Policy::Advance(3, 3, curRow, curColumn);
67 BOOST_CHECK_EQUAL(0u, curRow);
68 BOOST_CHECK_EQUAL(2u, curColumn);
69
70 std::tie(curRow, curColumn) = Policy::Advance(3, 3, curRow, curColumn);
71 BOOST_CHECK_EQUAL(1u, curRow);
72 BOOST_CHECK_EQUAL(2u, curColumn);
73
74 std::tie(curRow, curColumn) = Policy::Advance(3, 3, curRow, curColumn);
75 BOOST_CHECK_EQUAL(2u, curRow);
76 BOOST_CHECK_EQUAL(2u, curColumn);
77
78 std::tie(curRow, curColumn) = Policy::Advance(3, 3, curRow, curColumn);
79 BOOST_CHECK_EQUAL(std::numeric_limits<unsigned int>::max(), curRow);
80 BOOST_CHECK_EQUAL(std::numeric_limits<unsigned int>::max(), curColumn);
81 }
82
83 {
84
85 unsigned int curRow = 0;
86 unsigned int curColumn = 0;
87 std::tie(curRow, curColumn) = Policy::Advance(1, 1, curRow, curColumn);
88 BOOST_CHECK_EQUAL(std::numeric_limits<unsigned int>::max(), curRow);
89 BOOST_CHECK_EQUAL(std::numeric_limits<unsigned int>::max(), curColumn);
90 }
91
92 {
93
94 unsigned int curRow = 0;
95 unsigned int curColumn = 0;
96 std::tie(curRow, curColumn) = Policy::Advance(2, 2, curRow, curColumn);
97 BOOST_CHECK_EQUAL(0u, curRow);
98 BOOST_CHECK_EQUAL(1u, curColumn);
99
100 std::tie(curRow, curColumn) = Policy::Advance(2, 2, curRow, curColumn);
101 BOOST_CHECK_EQUAL(1u, curRow);
102 BOOST_CHECK_EQUAL(1u, curColumn);
103
104 std::tie(curRow, curColumn) = Policy::Advance(2, 2, curRow, curColumn);
105 BOOST_CHECK_EQUAL(std::numeric_limits<unsigned int>::max(), curRow);
106 BOOST_CHECK_EQUAL(std::numeric_limits<unsigned int>::max(), curColumn);
107 }
108}
109} // namespace UpperTriangularUnitTests
110} // 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)