1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
|
// Copyright (C) 2016 EDF
// All Rights Reserved
// This code is published under the GNU Lesser General Public License (GNU LGPL)
#ifndef SPARSEGRIDNOBOUNDITERATOR_H
#define SPARSEGRIDNOBOUNDITERATOR_H
#include <Eigen/Dense>
#include <StOpt/core/grids/SparseGridIterator.h>
#include "StOpt/core/sparse/GetCoordinateNoBound.h"
#include "StOpt/core/sparse/sparseGridNoBound.h"
/** \file SparseGridIterator.h
* \brief Defines an iterator on the points of a sparse grid
* \author Xavier Warin
*/
namespace StOpt
{
/// \class SparseGridNoBoundIterator SparseGridNoBoundIterator.h
/// Iterator on a given sparse grid eliminating boundary points
class SparseGridNoBoundIterator : public SparseGridIterator
{
///\brief minimal value of the mesh in each direction
Eigen::ArrayXd m_lowValues ;
/// \brief Size of the resolution domain in each dimension
Eigen::ArrayXd m_sizeDomain;
public :
/// \brief default constructor
SparseGridNoBoundIterator(): SparseGridIterator() {}
/// \brief Constructor
/// \param p_dataSet data structure for mesh
/// \param p_lowValues coordinates of bottom, left etc.. point of the domain
/// \param p_sizeDomain domain size in each dimension such that the points lie in \f$ [ lowValues[0], lowValues[0] + sizeDomain[0]] \times ... \times [ lowValues[NDIM], lowValues[NDIM] + sizeDomain[NDIM]] \f$
SparseGridNoBoundIterator(const std::shared_ptr<SparseSet> &p_dataSet, const Eigen::ArrayXd &p_lowValues, const Eigen::ArrayXd &p_sizeDomain) : SparseGridIterator(p_dataSet), m_lowValues(p_lowValues), m_sizeDomain(p_sizeDomain) {}
/// \brief Constructor with jump
/// Permits to iterate jumping some values (parallel mode)
/// \param p_dataSet data structure for mesh
/// \param p_lowValues coordinates of bottom, left etc.. point of the domain
/// \param p_sizeDomain domain size in each dimension such that the points lie in \f$ [ lowValues[0], lowValues[0] + sizeDomain[0]] \times ... \times [ lowValues[NDIM], lowValues[NDIM] + sizeDomain[NDIM]] \f$
/// \param p_jump increment jump for iterator
SparseGridNoBoundIterator(const std::shared_ptr<SparseSet> &p_dataSet, const Eigen::ArrayXd &p_lowValues, const Eigen::ArrayXd &p_sizeDomain, const int &p_jump) : SparseGridIterator(p_dataSet, p_jump), m_lowValues(p_lowValues), m_sizeDomain(p_sizeDomain) {}
/// \brief Constructor only iterating on points of a given level
/// \param p_dataSet data structure for mesh
/// \param p_iterLevel iterator on a multi level in the sparse grid
/// \param p_lowValues coordinates of bottom, left etc.. point of the domain
/// \param p_sizeDomain domain size in each dimension such that the points lie in \f$ [ lowValues[0], lowValues[0] + sizeDomain[0]] \times ... \times [ lowValues[NDIM], lowValues[NDIM] + sizeDomain[NDIM]] \f$
SparseGridNoBoundIterator(const std::shared_ptr<SparseSet> &p_dataSet, const SparseSet::const_iterator &p_iterLevel,
const Eigen::ArrayXd &p_lowValues, const Eigen::ArrayXd &p_sizeDomain) :
SparseGridIterator(p_dataSet, p_iterLevel), m_lowValues(p_lowValues), m_sizeDomain(p_sizeDomain) {}
/// \brief Constructor with jump only iterating on points of a given level
/// Permits to iterate jumping some values (parallel mode)
/// \param p_dataSet data structure for mesh
/// \param p_iterLevel iterator on a multi level in the sparse grid
/// \param p_lowValues coordinates of bottom, left etc.. point of the domain
/// \param p_sizeDomain domain size in each dimension such that the points lie in \f$ [ lowValues[0], lowValues[0] + sizeDomain[0]] \times ... \times [ lowValues[NDIM], lowValues[NDIM] + sizeDomain[NDIM]] \f$
/// \param p_jump increment jump for iterator
SparseGridNoBoundIterator(const std::shared_ptr<SparseSet> &p_dataSet, const SparseSet::const_iterator &p_iterLevel,
const Eigen::ArrayXd &p_lowValues, const Eigen::ArrayXd &p_sizeDomain, const int &p_jump) :
SparseGridIterator(p_dataSet, p_iterLevel, p_jump), m_lowValues(p_lowValues), m_sizeDomain(p_sizeDomain) {}
/// \brief get current integer coordinates
Eigen::ArrayXd getCoordinate() const
{
return m_lowValues + GetCoordinateNoBound()(m_iterLevel->first, m_iterPosition->first) * m_sizeDomain;
}
};
}
#endif /* SPARSEGRIDNOBOUNDITERATOR_H */
|
