Nektar++
NodalTriSPI.cpp
Go to the documentation of this file.
1///////////////////////////////////////////////////////////////////////////////
2//
3// File: NodalTriSPI.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: 2D Nodal Triangle SPI point definitions
32//
33///////////////////////////////////////////////////////////////////////////////
34
37
39{
40
42 PointsKey(0, eNodalTriSPI), NodalTriSPI::Create)};
43
45{
46 // Allocate the storage for points
47 size_t numPoints = GetNumPoints();
48
49 for (size_t i = 0; i < 2; i++)
50 {
52 }
53
54 size_t index = 0;
55
56 // initialize values
57 for (size_t i = 0; i < numPoints - 2; ++i)
58 {
59 index += NodalTriSPINPTS[i];
60 }
61
62 for (size_t i = 0; i < NodalTriSPINPTS[numPoints - 2]; i++)
63 {
64 m_points[0][i] = NodalTriSPIData[index][0];
65 m_points[1][i] = NodalTriSPIData[index][1];
66 index++;
67 }
68}
69
71{
72 size_t numPoints = GetNumPoints();
73
75
76 size_t index = 0;
77
78 // initialize values
79 for (size_t i = 0; i < numPoints - 2; ++i)
80 {
81 index += NodalTriSPINPTS[i];
82 }
83
84 for (size_t i = 0; i < NodalTriSPINPTS[numPoints - 2]; i++)
85 {
86 m_weights[i] = NodalTriSPIData[index][2];
87 index++;
88 }
89}
90
92{
93}
94
95std::shared_ptr<PointsBaseType> NodalTriSPI::Create(const PointsKey &key)
96{
97 std::shared_ptr<PointsBaseType> returnval(
99 returnval->Initialize();
100 return returnval;
101}
102
103} // namespace Nektar::LibUtilities
bool RegisterCreator(const KeyType &key, const CreateFuncType &createFunc)
Register the given function and associate it with the key. The return value is just to facilitate cal...
Definition: NekManager.hpp:168
static std::shared_ptr< PointsBaseType > Create(const PointsKey &key)
Definition: NodalTriSPI.cpp:95
Array< OneD, DataType > m_points[3]
Storage for the point locations, allowing for up to a 3D points storage.
Definition: Points.h:356
Array< OneD, DataType > m_weights
Quadrature weights for the weights.
Definition: Points.h:358
Defines a specification for a set of points.
Definition: Points.h:50
General purpose memory allocation routines with the ability to allocate from thread specific memory p...
static const size_t NodalTriSPINPTS[NodalTriSPIAvailable]
PointsManagerT & PointsManager(void)
static const NekDouble NodalTriSPIData[][3]
@ eNodalTriSPI
2D Nodal Symmetric positive internal triangle (Whitherden, Vincent)
Definition: PointsType.h:88